This map shows the geographic impact of Brian Bullins'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 Brian Bullins with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Brian Bullins more than expected).
This network shows the impact of papers produced by Brian Bullins. 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 Brian Bullins. The network helps show where Brian Bullins may publish in the future.
Co-authorship network of co-authors of Brian Bullins
This figure shows the co-authorship network connecting the top 25 collaborators of Brian Bullins.
A scholar is included among the top collaborators of Brian Bullins 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 Brian Bullins. Brian Bullins is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bullins, Brian. (2020). Highly smooth minimization of non-smooth problems. Conference on Learning Theory. 988–1030.1 indexed citations
5.
Bullins, Brian, et al.. (2020). Adaptive regularization with cubics on manifolds. Oxford University Research Archive (ORA) (University of Oxford).19 indexed citations
6.
Woodworth, Blake, Kumar Kshitij Patel, Sebastian U. Stich, et al.. (2020). Is Local SGD Better than Minibatch SGD. 1. 10334–10343.23 indexed citations
7.
Agarwal, Naman, Brian Bullins, Elad Hazan, Sham M. Kakade, & Karan Singh. (2019). Online Control with Adversarial Disturbances. arXiv (Cornell University). 111–119.9 indexed citations
8.
Agarwal, Naman, Nicolas Boumal, Brian Bullins, & Coralia Cartis. (2018). Adaptive regularization with cubics on manifolds with a first-order analysis. arXiv (Cornell University).2 indexed citations
9.
Agarwal, Naman, Brian Bullins, Xinyi Chen, et al.. (2018). The Case for Full-Matrix Adaptive Regularization. arXiv (Cornell University).
Bullins, Brian, Elad Hazan, & Tomer Koren. (2016). The Limits of Learning with Missing Data. Neural Information Processing Systems. 29. 3495–3503.5 indexed citations
13.
Agarwal, Naman, Zeyuan Allen Zhu, Brian Bullins, Elad Hazan, & Tengyu Ma. (2016). Finding Approximate Local Minima for Nonconvex Optimization in Linear Time.. arXiv (Cornell University).12 indexed citations
14.
Agarwal, Naman, Zeyuan Allen-Zhu, Brian Bullins, Elad Hazan, & Tengyu Ma. (2016). Finding Local Minima for Nonconvex Optimization in Linear Time. arXiv (Cornell University).3 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.