Sarah Sachs

5 papers · 2021–2025 · 3 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓

🌍 Conference Polyglot · Bronze 🌉 Interdisciplinary Bridge · Bronze 🗺️ Taxonomy Completionist (14) 🐣 Hot Topic Early Bird 📈 Trend Setter

Venues

COLT (2) NeurIPS (2) ALT (1)

Top co-authors

Tim van Erven (5) Hedi Hadiji (3) Cristóbal Guzmán (1) Wouter M Koolen (1) Wojciech Kotlowski (1) Umut Simsekli (1) Liam Hodgkinson (1) Wouter M. Koolen (1) Mathias Staudigl (1) Rajiv Khanna (1)

Research topics

Machine Learning (4) Mathematics & Optimization (4) Optimization & Theory (4) Optimization (3) Artificial Intelligence (1) Application Areas (1) Core AI (1) Learning Types (1) Mathematics (1)

Keywords

online convex optimization (2) regret bound (2) stochastic gradient descent (1) online learning (1) game theory (1) outlier detection (1) nash equilibrium (1) compression scheme (1) mutual information (1) rademacher complexity (1) convergence (1) query complexity (1) generalization bound (1) zero-sum game (1) fractal dimension (1) generalized nash equilibrium (1) vc class (1) robust regret (1) extreme gradient (1) filtering strategy (1)

Papers

An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems. ALT 2025 Generalization Guarantees via Algorithm-dependent Rademacher Complexity COLT 2023 Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games NeurIPS 2023 Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness NeurIPS 2022 Robust Online Convex Optimization in the Presence of Outliers COLT 2021