Daniel M. Roy

4.1k total citations
51 papers, 1.1k citations indexed

About

Daniel M. Roy is a scholar working on Artificial Intelligence, Statistics and Probability and Computational Theory and Mathematics. According to data from OpenAlex, Daniel M. Roy has authored 51 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Artificial Intelligence, 10 papers in Statistics and Probability and 9 papers in Computational Theory and Mathematics. Recurrent topics in Daniel M. Roy's work include Bayesian Methods and Mixture Models (8 papers), Bayesian Modeling and Causal Inference (8 papers) and Gaussian Processes and Bayesian Inference (7 papers). Daniel M. Roy is often cited by papers focused on Bayesian Methods and Mixture Models (8 papers), Bayesian Modeling and Causal Inference (8 papers) and Gaussian Processes and Bayesian Inference (7 papers). Daniel M. Roy collaborates with scholars based in United States, Canada and United Kingdom. Daniel M. Roy's co-authors include Peter Orbanz, Martin Rinard, Cristian Cadar, Yee Whye Teh, Joshua B. Tenenbaum, Gintare Karolina Dziugaite, Zoubin Ghahramani, Vikash K. Mansinghka, Noah D. Goodman and Keith Bonawitz and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, Biometrika and The Annals of Statistics.

In The Last Decade

Daniel M. Roy

49 papers receiving 960 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Daniel M. Roy United States 13 659 270 138 135 121 51 1.1k
Michael G. Thomason United States 16 334 0.5× 324 1.2× 59 0.4× 85 0.6× 95 0.8× 53 1.0k
Huanguo Zhang China 16 959 1.5× 443 1.6× 202 1.5× 77 0.6× 194 1.6× 250 1.4k
Virginia Vassilevska Williams United States 18 472 0.7× 403 1.5× 92 0.7× 90 0.7× 152 1.3× 71 1.3k
JF Baldwin United Kingdom 7 322 0.5× 170 0.6× 75 0.5× 72 0.5× 94 0.8× 30 714
Jürg Nievergelt Switzerland 12 493 0.7× 505 1.9× 256 1.9× 154 1.1× 169 1.4× 54 1.2k
Jan Van Leeuwen Netherlands 9 414 0.6× 283 1.0× 88 0.6× 89 0.7× 128 1.1× 25 1.0k
Michel Habib France 23 283 0.4× 368 1.4× 82 0.6× 38 0.3× 100 0.8× 101 1.5k
Bob Kanefsky United States 12 538 0.8× 521 1.9× 164 1.2× 33 0.2× 126 1.0× 24 1.2k
Kai Lü China 19 1.2k 1.8× 323 1.2× 160 1.2× 191 1.4× 352 2.9× 130 1.7k
M. D. McIlroy United States 13 376 0.6× 179 0.7× 104 0.8× 94 0.7× 125 1.0× 22 706

Countries citing papers authored by Daniel M. Roy

Since Specialization
Citations

This map shows the geographic impact of Daniel M. Roy's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel M. Roy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel M. Roy more than expected).

Fields of papers citing papers by Daniel M. Roy

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel M. Roy. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel M. Roy. The network helps show where Daniel M. Roy may publish in the future.

Co-authorship network of co-authors of Daniel M. Roy

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel M. Roy. A scholar is included among the top collaborators of Daniel M. Roy based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel M. Roy. Daniel M. Roy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Roy, Daniel M., et al.. (2023). Relaxing the i.i.d. assumption: Adaptively minimax optimal regret via root-entropic regularization. The Annals of Statistics. 51(4). 1 indexed citations
2.
Dziugaite, Gintare Karolina, et al.. (2021). Towards a Unified Information-Theoretic Framework for Generalization. arXiv (Cornell University). 34. 1 indexed citations
3.
Dziugaite, Gintare Karolina, et al.. (2021). On the role of data in PAC-Bayes. International Conference on Artificial Intelligence and Statistics. 604–612. 2 indexed citations
4.
Faghri, Fartash, et al.. (2020). Adaptive Gradient Quantization for Data-Parallel SGD. Neural Information Processing Systems. 33. 3174–3185. 3 indexed citations
5.
Fort, Stanislav, et al.. (2020). Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernel. Neural Information Processing Systems. 33. 5850–5861. 1 indexed citations
6.
Khisti, Ashish, et al.. (2020). Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms. Neural Information Processing Systems. 33. 9925–9935. 2 indexed citations
7.
Sun, Shengyang, et al.. (2019). Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes. Neural Information Processing Systems. 32. 10802–10812. 2 indexed citations
8.
Faghri, Fartash, et al.. (2019). NUQSGD: Improved Communication Efficiency for Data-parallel SGD via Nonuniform Quantization.. arXiv (Cornell University). 6 indexed citations
9.
Staton, Sam, et al.. (2018). The Beta-Bernoulli process and algebraic effects. Oxford University Research Archive (ORA) (University of Oxford). 1 indexed citations
10.
Grosse, Roger, et al.. (2016). Measuring the reliability of MCMC inference with bidirectional Monte Carlo. Neural Information Processing Systems. 29. 2451–2459. 4 indexed citations
11.
Lloyd, James Robert, Peter Orbanz, Zoubin Ghahramani, & Daniel M. Roy. (2012). Random function priors for exchangeable arrays with applications to graphs and relational data. 25. 998–1006. 44 indexed citations
12.
Freer, Cameron E. & Daniel M. Roy. (2011). Computable de Finetti measures. Annals of Pure and Applied Logic. 163(5). 530–546. 12 indexed citations
13.
Mansinghka, Vikash K., Daniel M. Roy, Eric Jonas, & Joshua B. Tenenbaum. (2009). Exact and approximate sampling by systematic stochastic search. International Conference on Artificial Intelligence and Statistics. 400–407. 3 indexed citations
14.
Roy, Daniel M. & Yee Whye Teh. (2008). The Mondrian Process. UCL Discovery (University College London). 21. 1377–1384. 49 indexed citations
15.
Roy, Daniel M., et al.. (2007). Discovering Syntactic Hierarchies. eScholarship (California Digital Library). 29(29).
16.
Roy, Daniel M. & Leslie Pack Kaelbling. (2007). Efficient Bayesian task-level transfer learning. International Joint Conference on Artificial Intelligence. 2599–2604. 23 indexed citations
17.
Mansinghka, Vikash K., Daniel M. Roy, Ryan Rifkin, & Joshua B. Tenenbaum. (2007). AClass: A simple, online, parallelizable algorithm for probabilistic classification. International Conference on Artificial Intelligence and Statistics. 315–322. 4 indexed citations
18.
Rinard, Martin, et al.. (2004). Enhancing server availability and security through failure-oblivious computing. Operating Systems Design and Implementation. 21–21. 233 indexed citations
19.
Roy, Daniel M., et al.. (1999). Meeting deadlines in hard real-time systems : the rate monotonic approach. 22 indexed citations
20.
Roy, Daniel M.. (1994). The Personal Software Process: Downscaling the factory. NASA Technical Reports Server (NASA). 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026