Satyen Kale
About
In The Last Decade
Satyen Kale
63 papers receiving 2.4k citations
Hit Papers
Peers
Comparison fields: 5 of 105
- Artificial Intelligence 1.7k
- Management Science and Operations Research 1.1k
- Computer Networks and Communications 658
- Computational Mechanics 318
- Computational Theory and Mathematics 313
Countries citing papers authored by Satyen Kale
This map shows the geographic impact of Satyen Kale'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 Satyen Kale with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Satyen Kale more than expected).
Fields of papers citing papers by Satyen Kale
This network shows the impact of papers produced by Satyen Kale. 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 Satyen Kale. The network helps show where Satyen Kale may publish in the future.
Co-authorship network of co-authors of Satyen Kale
This figure shows the co-authorship network connecting the top 25 collaborators of Satyen Kale. A scholar is included among the top collaborators of Satyen Kale 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 Satyen Kale. Satyen Kale is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Breaking the Glass Ceiling for Embedding-Based Classifiers for Large Output Spaces | 15 |
| 2 | Logistic Regression: The Importance of Being Improper. | 7 |
| 3 | Loss Decomposition for Fast Learning in Large Output Spaces. | 3 |
| 4 | Adaptive Methods for Nonconvex Optimization | 102 |
| 5 | Hardness of Online Sleeping Combinatorial Optimization Problems | 3 |
| 6 | Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization | 77 |
| 7 | Open Problem: Efficient Online Sparse Regression | 0 |
| 8 | Adaptive Market Making via Online Learning | 10 |
| 9 | 26 | |
| 10 | Commentary on \Online Optimization with Gradual Variations" | 2 |
| 11 | Cross-Validation and Mean-Square Stability | 15 |
| 12 | Combinatorial Approximation Algorithms for MAXCUT using Random Walks. | 6 |
| 13 | Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization | 51 |
| 14 | Non-Stochastic Bandit Slate Problems | 32 |
| 15 | Beyond Convexity: Online Submodular Minimization | 7 |
| 16 | On Stochastic and Worst-case Models for Investing | 19 |
| 17 | Online submodular minimization | 29 |
| 18 | 21 | |
| 19 | Boosting and hard-core set constructions: a simplified approach. | 3 |
| 20 | Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria | 4 |
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.