Jacob D. Abernethy
15 papers · 2010–2023 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
π Conference Polyglot (2) π Academic Marathon (13) π§ Keyword Pioneer π Interdisciplinary Bridge π Cross-Pollinator (5)
πΊοΈ
Taxonomy Completionist
(27)
π£
Hot Topic Early Bird
π
Keyword Trendsetter Combo
(5)
π
Keyword Champion
π
Trend Setter
π₯
Unstoppable
(5)
π
Century Club
(15)
ποΈ
Keyword Collector
(81)
Conferences
NIPS (13)
COLT (2)
Top co-authors
Keywords
online learning
(7)
regret bound
(5)
multi-armed bandit
(5)
mechanism design
(3)
prediction market
(3)
bregman divergence
(2)
convex optimization
(2)
differential privacy
(2)
game theory
(2)
riemannian manifold
(2)
zero-sum game
(2)
crowdsourcing
(1)
dynamic regret
(1)
continuous optimization
(1)
binary classification
(1)
adversarial learning
(1)
minimax optimization
(1)
margin maximization
(1)
privacy preservation
(1)
generalization error
(1)
Papers
Minimizing Dynamic Regret on Geodesic Metric Spaces
COLT 2023
Faster Margin Maximization Rates for Generic Optimization Methods
NIPS 2023
Riemannian Projection-free Online Learning
NIPS 2023
Adaptive Oracle-Efficient Online Learning
NIPS 2022
Observation-Free Attacks on Stochastic Bandits
NIPS 2021
Learning Auctions with Robust Incentive Guarantees
NIPS 2019
Online Learning via the Differential Privacy Lens
NIPS 2019
Acceleration through Optimistic No-Regret Dynamics
NIPS 2018
On Frank-Wolfe and Equilibrium Computation
NIPS 2017
Threshold Bandits, With and Without Censored Feedback
NIPS 2016
A Market Framework for Eliciting Private Data
NIPS 2015
Fighting Bandits with a New Kind of Smoothness
NIPS 2015
A Characterization of Scoring Rules for Linear Properties
COLT 2012
A Collaborative Mechanism for Crowdsourcing Prediction Problems
NIPS 2011
Repeated Games against Budgeted Adversaries
NIPS 2010