Sarah Sachs
5 papers · 2021–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
🌍 Conference Polyglot (3) 🌉 Interdisciplinary Bridge 🗺️ Taxonomy Completionist (10) 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird
🐝
Cross-Pollinator
(14)
Conferences
COLT (2)
NIPS (2)
ALT (1)
Top co-authors
Keywords
online convex optimization
(2)
learning theory
(1)
game theory
(1)
outlier detection
(1)
nash equilibrium
(1)
compression scheme
(1)
mutual information
(1)
rademacher complexity
(1)
query complexity
(1)
generalization bound
(1)
regret bound
(1)
zero-sum game
(1)
fractal dimension
(1)
vc class
(1)
robust regret
(1)
extreme gradient
(1)
stochastic optimization
(1)
filtering strategy
(1)
Papers
An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems.
ALT 2025
Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games
NIPS 2023
Generalization Guarantees via Algorithm-dependent Rademacher Complexity
COLT 2023
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
NIPS 2022
Robust Online Convex Optimization in the Presence of Outliers
COLT 2021