This map shows the geographic impact of Mark Schmidt'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 Mark Schmidt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Schmidt more than expected).
This network shows the impact of papers produced by Mark Schmidt. 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 Mark Schmidt. The network helps show where Mark Schmidt may publish in the future.
Co-authorship network of co-authors of Mark Schmidt
This figure shows the co-authorship network connecting the top 25 collaborators of Mark Schmidt.
A scholar is included among the top collaborators of Mark Schmidt 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 Mark Schmidt. Mark Schmidt is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Schmidt, Mark, et al.. (2019). Distributed Maximization of "Submodular plus Diversity" Functions for Multi-label Feature Selection on Huge Datasets. International Conference on Artificial Intelligence and Statistics. 2077–2086.1 indexed citations
Schmidt, Mark, et al.. (2015). Stop wasting my gradients: practical SVRG. Neural Information Processing Systems. 28. 2251–2259.15 indexed citations
9.
Schmidt, Mark, et al.. (2015). Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields. ANU Open Research (Australian National University). 819–828.6 indexed citations
Lacoste-Julien, Simon, Martin Jaggi, Mark Schmidt, & Patrick Pletscher. (2012). Stochastic Block-Coordinate Frank-Wolfe Optimization for Structural SVMs. arXiv (Cornell University).9 indexed citations
12.
Schmidt, Mark & Karteek Alahari. (2011). Generalized fast approximate energy minimization via graph cuts: α-expansion β-shrink moves. Uncertainty in Artificial Intelligence. 653–660.5 indexed citations
13.
Schmidt, Mark & Kevin P. Murphy. (2010). Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials. International Conference on Artificial Intelligence and Statistics. 709–716.32 indexed citations
14.
Yan, Yan, Rómer Rosales, Glenn Fung, et al.. (2010). Modeling annotator expertise: Learning when everybody knows a bit of something. International Conference on Artificial Intelligence and Statistics. 932–939.113 indexed citations
Schmidt, Mark, E. van den Berg, Michael P. Friedlander, & Kevin P. Murphy. (2009). Optimizing Costly Functions with Simple Constraints: A Limited-Memory Projected Quasi-Newton Algorithm. International Conference on Artificial Intelligence and Statistics. 456–463.147 indexed citations
Carbonetto, Peter, Mark Schmidt, & Nando de Freitas. (2008). An interior-point stochastic approximation method and an L1-regularized delta rule. Oxford University Research Archive (ORA) (University of Oxford). 21. 233–240.8 indexed citations
19.
Duvenaud, David, Daniel Eaton, Kevin P. Murphy, & Mark Schmidt. (2008). Causal learning without DAGs. Neural Information Processing Systems. 177–190.4 indexed citations
20.
Schmidt, Mark, Alexandru Niculescu-Mizil, & Kevin J. Murphy. (2007). Learning graphical model structure using L1-regularization paths. National Conference on Artificial Intelligence. 1278–1283.100 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.