Countries citing papers authored by Alexander Rakhlin
Since
Specialization
Citations
This map shows the geographic impact of Alexander Rakhlin'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 Alexander Rakhlin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Rakhlin more than expected).
Fields of papers citing papers by Alexander Rakhlin
This network shows the impact of papers produced by Alexander Rakhlin. 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 Alexander Rakhlin. The network helps show where Alexander Rakhlin may publish in the future.
Co-authorship network of co-authors of Alexander Rakhlin
This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Rakhlin.
A scholar is included among the top collaborators of Alexander Rakhlin 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 Alexander Rakhlin. Alexander Rakhlin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Liang, Tengyuan, Alexander Rakhlin, & Xiyu Zhai. (2019). On the Risk of Minimum-Norm Interpolants and Restricted Lower Isometry of Kernels.. arXiv (Cornell University).5 indexed citations
2.
Rakhlin, Alexander & Xiyu Zhai. (2019). Consistency of Interpolation with Laplace Kernels is a High-Dimensional Phenomenon.. Conference on Learning Theory. 2595–2623.4 indexed citations
Liang, Tengyuan, Alexander Rakhlin, & Karthik Sridharan. (2015). Learning with Square Loss: Localization through Offset Rademacher Complexity. Conference on Learning Theory. 1260–1285.5 indexed citations
5.
Rakhlin, Alexander & Karthik Sridharan. (2015). On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities. Conference on Learning Theory. 1704–1722.1 indexed citations
6.
Belloni, Alexandre, Tengyuan Liang, Hariharan Narayanan, & Alexander Rakhlin. (2015). Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions. Conference on Learning Theory. 240–265.16 indexed citations
7.
Cai, Tommaso, Tengyuan Liang, & Alexander Rakhlin. (2014). Geometrizing Local Rates of Convergence for Linear Inverse Problems. arXiv (Cornell University).2 indexed citations
8.
Rakhlin, Alexander, Ohad Shamir, & Karthik Sridharan. (2013). Localization and Adaptation in Online Learning. ScholarlyCommons (University of Pennsylvania). 31. 516–526.2 indexed citations
Foster, Dean P., Alexander Rakhlin, Karthik Sridharan, & Ambuj Tewari. (2011). Complexity-Based Approach to Calibration With Checking Rules. ScholarlyCommons (University of Pennsylvania). 19. 293–314.6 indexed citations
11.
Rakhlin, Alexander, Karthik Sridharan, & Ambuj Tewari. (2010). Online Learning: Random Averages, Combinatorial Parameters, and Learnability. ScholarlyCommons (University of Pennsylvania). 23. 1984–1992.35 indexed citations
12.
Abernethy, Jacob & Alexander Rakhlin. (2009). An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction. Conference on Learning Theory.4 indexed citations
13.
Abernethy, Jacob & Alexander Rakhlin. (2009). Beating the adaptive bandit with high probability. ScholarlyCommons (University of Pennsylvania).15 indexed citations
14.
Abernethy, Jacob, Alekh Agarwal, Peter L. Bartlett, & Alexander Rakhlin. (2009). A Stochastic View of Optimal Regret through Minimax Duality. QUT ePrints (Queensland University of Technology).41 indexed citations
15.
Bartlett, Peter L., Varsha Dani, Thomas P. Hayes, et al.. (2008). High-probability regret bounds for bandit online linear optimization. QUT ePrints (Queensland University of Technology). 335–342.32 indexed citations
16.
Abernethy, Jacob, Elad Hazan, & Alexander Rakhlin. (2008). Competing in the dark: An efficient algorithm for bandit linear optimization. ScholarlyCommons (University of Pennsylvania). 263–274.99 indexed citations
17.
Abernethy, Jacob, Peter L. Bartlett, Alexander Rakhlin, & Ambuj Tewari. (2008). Optimal Stragies and Minimax Lower Bounds for Online Convex Games.. Conference on Learning Theory. 415–424.16 indexed citations
18.
Seshia, Sanjit A. & Alexander Rakhlin. (2008). Game-theoretic timing analysis. International Conference on Computer Aided Design. 575–582.17 indexed citations
19.
Hazan, Elad, Alexander Rakhlin, & Peter L. Bartlett. (2007). Adaptive Online Gradient Descent. Neural Information Processing Systems. 20. 65–72.102 indexed citations
20.
Caponnetto, Andrea & Alexander Rakhlin. (2006). Stability Properties of Empirical Risk Minimization over Donsker Classes. Journal of Machine Learning Research. 7(91). 2565–2583.9 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.