← Authors

Jacob Abernethy

18 papers · 2009–2025 · 7 conferences · across top CS/AI conferences

Achievements

πŸƒ Academic Marathon (16) 🐝 Cross-Pollinator (14) πŸ—ΊοΈ Taxonomy Completionist (11) 🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge 🌍 Conference Polyglot (7) 🧭 Keyword Pioneer 🌟 Keyword Trendsetter Combo (4) πŸ† Keyword Champion (3) πŸ’Ž Century Club (18) πŸš€ Conference Pioneer πŸ“ˆ Trend Setter ❓ The Questioner (2) πŸ—ƒοΈ Keyword Collector (75)

Conferences

COLT (5) ICML (4) NIPS (3) ALT (2) ICLR (2) ACML (1) JMLR (1)

Top co-authors

Jun-Kun Wang (3) Kevin A. Lai (2) Peter L. Bartlett (2) Elad Hazan (2) Andre Wibisono (2) Shie Mannor (1) Alekh Agarwal (1) He Wang (1) Satyen Kale (1) Rafael Hanashiro (1)

Keywords

online learning (5) regret minimization (4) online linear optimization (3) regret bound (3) game theory (2) adversarial learning (2) minimax optimization (2) convex optimization (2) learning theory (2) zero-sum game (2) hedging strategy (2) calibrated forecasting (2) nash equilibrium (1) low-rank decomposition (1) collaborative filtering (1) neural network optimization (1) online optimization (1) sample complexity (1) spectral regularization (1) gradient descent (1)

Papers

Can Transformers Reason Logically? A Study in SAT Solving ICML 2025
A Mechanism for Sample-Efficient In-Context Learning for Sparse Retrieval Tasks ALT 2024
On Accelerated Perceptrons and Beyond ICLR 2023
Understanding How Over-Parametrization Leads to Acceleration: A case of learning a single teacher neuron ACML 2021
Last-Iterate Convergence Rates for Min-Max Optimization: Convergence of Hamiltonian Gradient Descent and Consensus Optimization ALT 2021
Conference on Learning Theory 2020: Preface COLT 2020
Escaping Saddle Points Faster with Stochastic Momentum ICLR 2020
Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games ICML 2019
Faster Rates for Convex-Concave Games COLT 2018
Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier ICML 2016
Online Linear Optimization via Smoothing COLT 2014
Adaptive Market Making via Online Learning NIPS 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization NIPS 2013
How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NIPS 2013
Large-Scale Bandit Problems and KWIK Learning ICML 2013
Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011
Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization JMLR 2009