Countries citing papers authored by Jacob Abernethy
Since
Specialization
Citations
This map shows the geographic impact of Jacob Abernethy'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 Jacob Abernethy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jacob Abernethy more than expected).
This network shows the impact of papers produced by Jacob Abernethy. 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 Jacob Abernethy. The network helps show where Jacob Abernethy may publish in the future.
Co-authorship network of co-authors of Jacob Abernethy
This figure shows the co-authorship network connecting the top 25 collaborators of Jacob Abernethy.
A scholar is included among the top collaborators of Jacob Abernethy 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 Jacob Abernethy. Jacob Abernethy 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.
Abernethy, Jacob, et al.. (2021). Last-Iterate Convergence Rates for Min-Max Optimization: Convergence of Hamiltonian Gradient Descent and Consensus Optimization.. 3–47.1 indexed citations
2.
Abernethy, Jacob, et al.. (2021). Observation-Free Attacks on Stochastic Bandits. Neural Information Processing Systems. 34.1 indexed citations
3.
Abernethy, Jacob, et al.. (2019). Learning Auctions with Robust Incentive Guarantees. Neural Information Processing Systems. 32. 11587–11597.4 indexed citations
4.
Abernethy, Jacob, et al.. (2019). Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games. International Conference on Machine Learning. 921–930.7 indexed citations
5.
Abernethy, Jacob, et al.. (2019). Online Learning via the Differential Privacy Lens. Neural Information Processing Systems. 32. 8894–8904.
6.
Abernethy, Jacob, et al.. (2018). Faster Rates for Convex-Concave Games. Conference on Learning Theory. 1595–1625.1 indexed citations
7.
Abernethy, Jacob, et al.. (2017). On Frank-Wolfe and Equilibrium Computation. Neural Information Processing Systems. 30. 6584–6593.8 indexed citations
8.
Abernethy, Jacob, et al.. (2017). How to Train Your DRAGAN. arXiv (Cornell University).12 indexed citations
9.
Abernethy, Jacob, et al.. (2017). Online Learning via Differential Privacy.. arXiv (Cornell University).2 indexed citations
10.
Abernethy, Jacob, Kareem Amin, & Ruihao Zhu. (2016). Threshold Bandits, With and Without Censored Feedback. Neural Information Processing Systems. 29. 4889–4897.6 indexed citations
11.
Abernethy, Jacob & Elad Hazan. (2016). Faster convex optimization: simulated annealing with an efficient universal barrier. International Conference on Machine Learning. 2520–2528.1 indexed citations
12.
Waggoner, Bo, Rafael Frongillo, & Jacob Abernethy. (2015). A market framework for eliciting private data. Neural Information Processing Systems. 28. 3510–3518.4 indexed citations
13.
Abernethy, Jacob, Kareem Amin, Michael Kearns, & Moez Draief. (2013). Large-Scale Bandit Problems and KWIK Learning. International Conference on Machine Learning. 588–596.5 indexed citations
14.
Abernethy, Jacob & Satyen Kale. (2013). Adaptive Market Making via Online Learning. Neural Information Processing Systems. 26. 2058–2066.10 indexed citations
15.
Abernethy, Jacob & Shie Mannor. (2011). Does an Efficient Calibrated Forecasting Strategy Exist. Conference on Learning Theory. 809–812.2 indexed citations
16.
Abernethy, Jacob. (2010). Can we learn to gamble efficiently. Conference on Learning Theory. 318–319.5 indexed citations
17.
Abernethy, Jacob & Alexander Rakhlin. (2009). An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction. Conference on Learning Theory.4 indexed citations
18.
Abernethy, Jacob & Alexander Rakhlin. (2009). Beating the adaptive bandit with high probability. ScholarlyCommons (University of Pennsylvania).15 indexed citations
19.
Abernethy, Jacob & Manfred K. Warmuth. (2009). Minimax games with bandits. Conference on Learning Theory.1 indexed citations
20.
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
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.