mlsanityData to 7 Oct 2026

Efficient Regret Minimization in Non-Convex Games

arXiv 1708.00075 ↗First posted 31 Jul 2017cs.LG cs.GT stat.MLcited by 28

Not on the map. Why?

Abstract (arXiv)

We consider regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural notion of regret which permits efficient optimization and generalizes offline guarantees for convergence to an approximate local optimum. We give gradient-based methods that achieve optimal regret, which in turn guarantee convergence to equilibrium in this framework.

Key facts. Cited by 28 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Jul 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 4; 2023: 7; 2024: 4; 2025: 5; 2026: 4.

28 papers.

Sort:

By area:

  1. 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversioncited by 42
  2. 2021Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvaturecited by 32
  3. 2022Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methodscited by 14
  4. 2022Non-convex online learning via algorithmic equivalencecited by 10
  5. 2023Non-Convex Bilevel Optimization with Time-Varying Objective Functionscited by 8
  6. 2024In-Trajectory Inverse Reinforcement Learning: Learn Incrementally Before An Ongoing Trajectory Terminatescited by 7
  7. 2021Zeroth-order non-convex learning via hierarchical dual averagingcited by 6
  8. 2023Playing Large Games with Oracles and AI Debatecited by 5
  9. 2023Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problemscited by 4
  10. 2025Online Decision-Focused Learningcited by 4
  11. 2021Dynamic Regret Analysis for Online Meta-Learningcited by 3
  12. 2022Future Gradient Descent for Adapting the Temporal Shifting Data Distribution in Online Recommendation Systemscited by 3
16 more
  1. 2024Provable Length Generalization in Sequence Prediction via Spectral Filteringcited by 3
  2. 2022Distributed Online Non-convex Optimization with Composite Regretcited by 2
  3. 2024Online Nonconvex Bilevel Optimization with Bregman Divergencescited by 2
  4. 2025Personalized Federated Learning for Cellular VR: Online Learning and Dynamic Cachingcited by 2
  5. 2025Robust Multimodal Learning via Entropy-Gated Contrastive Fusioncited by 2
  6. 2025Convergence of Regret Matching in Potential Games and Constrained Optimizationcited by 2
  7. 2026Non-Stationary Functional Bilevel Optimizationcited by 2
  8. 2023A Gradient-based Approach for Online Robust Deep Neural Network Training with Noisy Labelscited by 1
  9. 2026Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimizationcited by 1
  10. 2021Multi-task Federated Edge Learning (MtFEEL) in Wireless Networkscited by 0
  11. 2023Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boostingcited by 0
  12. 2023Online Non-convex Optimization with Long-term Non-convex Constraintscited by 0
  13. 2024Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regretcited by 0
  14. 2025Event-Driven Online Vertical Federated Learningcited by 0
  15. 2026Fully First-Order Algorithms for Online Bilevel Optimizationcited by 0
  16. 2026Online Optimization of Difference-of-Convex Compositions with Smooth Mappingscited by 0