Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Tensor decompositions for learning latent variable models
2014371 citationsAnimashree Anandkumar, Rong Ge et al.Journal of Machine Learning Researchprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Matus Telgarsky
Since
Specialization
Citations
This map shows the geographic impact of Matus Telgarsky'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 Matus Telgarsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matus Telgarsky more than expected).
This network shows the impact of papers produced by Matus Telgarsky. 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 Matus Telgarsky. The network helps show where Matus Telgarsky may publish in the future.
Co-authorship network of co-authors of Matus Telgarsky
This figure shows the co-authorship network connecting the top 25 collaborators of Matus Telgarsky.
A scholar is included among the top collaborators of Matus Telgarsky 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 Matus Telgarsky. Matus Telgarsky is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
15 of 15 papers shown
1.
Ji, Ziwei & Matus Telgarsky. (2021). Characterizing the implicit bias via a primal-dual analysis.. 772–804.1 indexed citations
2.
Ji, Ziwei & Matus Telgarsky. (2020). Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networks. arXiv (Cornell University).10 indexed citations
3.
Ji, Ziwei & Matus Telgarsky. (2020). Directional convergence and alignment in deep learning. Neural Information Processing Systems. 33. 17176–17186.2 indexed citations
4.
Ji, Ziwei, et al.. (2020). Neural tangent kernels, transportation mappings, and universal approximation. arXiv (Cornell University).2 indexed citations
5.
Ji, Ziwei, Miroslav Dudı́k, Robert E. Schapire, & Matus Telgarsky. (2020). Gradient descent follows the regularization path for general losses.. Conference on Learning Theory. 2109–2136.
6.
Ji, Ziwei & Matus Telgarsky. (2019). The implicit bias of gradient descent on nonseparable data. Conference on Learning Theory. 1772–1798.14 indexed citations
7.
Ji, Ziwei & Matus Telgarsky. (2019). Gradient descent aligns the layers of deep linear networks. International Conference on Learning Representations.15 indexed citations
Dasgupta, Sanjoy & Matus Telgarsky. (2012). Agglomerative Bregman Clustering. International Conference on Machine Learning. 1011–1018.11 indexed citations
12.
Telgarsky, Matus. (2011). The Fast Convergence of Boosting. Neural Information Processing Systems. 24. 1593–1601.1 indexed citations
13.
Telgarsky, Matus. (2011). The Convergence Rate of AdaBoost and Friends. arXiv (Cornell University).1 indexed citations
14.
Telgarsky, Matus & Andrea Vattani. (2010). Hartigan's method: κ-means clustering without Voronoi. Journal of Machine Learning Research. 9. 820–827.20 indexed citations
15.
Telgarsky, Matus & Andrea Vattani. (2010). Hartigan's Method: k-means Clustering without Voronoi. International Conference on Artificial Intelligence and Statistics. 820–827.19 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.