Two-player games for efficient non-convex constrained optimization

MaRDI QIDQ7034395zbMATH OpenFDO

Authors Andrew Cotter, Heinrich Jiang, Karthik Sridharan

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/cotter19a.html

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonconvex programming, global optimization (90C26) Applications of game theory (91A80)

Cites work

• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• A Stochastic Approximation Method
• Adaptive subgradient methods for online learning and stochastic optimization
• Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
• Equilibria of continuous two-person games
• From external to internal regret
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3062461 (Why is no real title available?)
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Playing non-linear games with linear oracles
• The multiplicative weights update method: a meta-algorithm and applications
• Zur Theorie der Gesellschaftsspiele.

Cited in

(2)

• Semi-supervised group DRO: combating sparsity with unlabeled data
• Binary choice under asymmetric loss in a data-rich environment: theory and an application to algorithmic fairness

This page was built for publication: Two-player games for efficient non-convex constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034395)