Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
In The Last Decade
doi.org/w3460586 →Countries where authors are citing Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
This map shows the geographic impact of Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. 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 Adaptive Subgradient Methods for Online Learning and Stochastic Optimization with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Adaptive Subgradient Methods for Online Learning and Stochastic Optimization more than expected).
Fields of papers citing Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
This network shows the impact of Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Adaptive Subgradient Methods for Online Learning and Stochastic Optimization.
About Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
This paper, published in 2010, received 4.9k indexed citations . Written by John C. Duchi, Elad Hazan and Yoram Singer covering the research area of Computational Mechanics, Artificial Intelligence and Management Science and Operations Research. It is primarily cited by scholars working on Artificial Intelligence (3.0k citations), Computer Vision and Pattern Recognition (1.4k citations) and Computational Mechanics (456 citations). Published in Journal of Machine Learning Research.
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.
This paper is also available at doi.org/w3460586.