On the Computational Complexity of Performative Prediction
Fuente:
arXiv
Guardado en:
| Autores principales: | Anagnostides, Ioannis, Chauhan, Rohan, Panageas, Ioannis, Sandholm, Tuomas, Yan, Jingming |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
Computational Lower Bounds for Regret Minimization in Normal-Form Games
por: Anagnostides, Ioannis, et al.
Publicado: (2024)
por: Anagnostides, Ioannis, et al.
Publicado: (2024)
Barriers to Welfare Maximization with No-Regret Learning
por: Anagnostides, Ioannis, et al.
Publicado: (2024)
por: Anagnostides, Ioannis, et al.
Publicado: (2024)
Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
por: Chauhan, Rohan, et al.
Publicado: (2025)
por: Chauhan, Rohan, et al.
Publicado: (2025)
Convergence of Regret Matching in Potential Games and Constrained Optimization
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
por: Zhang, Brian Hu, et al.
Publicado: (2025)
por: Zhang, Brian Hu, et al.
Publicado: (2025)
Policy Optimization for Dynamic Heart Transplant Allocation
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
Convergence of $\text{log}(1/ε)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis
por: Anagnostides, Ioannis, et al.
Publicado: (2024)
por: Anagnostides, Ioannis, et al.
Publicado: (2024)
On the Interplay between Social Welfare and Tractability of Equilibria
por: Anagnostides, Ioannis, et al.
Publicado: (2023)
por: Anagnostides, Ioannis, et al.
Publicado: (2023)
A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
Learning Potentials for Dynamic Matching and Application to Heart Transplantation
por: Zilberstein, Itai, et al.
Publicado: (2026)
por: Zilberstein, Itai, et al.
Publicado: (2026)
Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
por: Zilberstein, Itai, et al.
Publicado: (2026)
por: Zilberstein, Itai, et al.
Publicado: (2026)
Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
The Complexity of Finding Local Optima in Contrastive Learning
por: Yan, Jingming, et al.
Publicado: (2025)
por: Yan, Jingming, et al.
Publicado: (2025)
Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
por: Zhang, Brian Hu, et al.
Publicado: (2025)
por: Zhang, Brian Hu, et al.
Publicado: (2025)
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
por: Daskalakis, Constantinos, et al.
Publicado: (2018)
por: Daskalakis, Constantinos, et al.
Publicado: (2018)
Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
por: Daskalakis, Constantinos, et al.
Publicado: (2018)
por: Daskalakis, Constantinos, et al.
Publicado: (2018)
Expected Variational Inequalities
por: Zhang, Brian Hu, et al.
Publicado: (2025)
por: Zhang, Brian Hu, et al.
Publicado: (2025)
Decision Making under Imperfect Recall: Algorithms and Benchmarks
por: Tewolde, Emanuel, et al.
Publicado: (2026)
por: Tewolde, Emanuel, et al.
Publicado: (2026)
Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
por: Kalogiannis, Fivos, et al.
Publicado: (2024)
por: Kalogiannis, Fivos, et al.
Publicado: (2024)
Exact Learning of Weighted Graphs Using Composite Queries
por: Goodrich, Michael T., et al.
Publicado: (2025)
por: Goodrich, Michael T., et al.
Publicado: (2025)
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
por: Anagnostides, Ioannis, et al.
Publicado: (2023)
por: Anagnostides, Ioannis, et al.
Publicado: (2023)
Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
por: Zhang, Brian Hu, et al.
Publicado: (2024)
por: Zhang, Brian Hu, et al.
Publicado: (2024)
Efficient Swap Regret Minimization in Combinatorial Bandits
por: Kontogiannis, Andreas, et al.
Publicado: (2026)
por: Kontogiannis, Andreas, et al.
Publicado: (2026)
Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
por: Barakat, Anas, et al.
Publicado: (2026)
por: Barakat, Anas, et al.
Publicado: (2026)
The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
por: Zhang, Brian Hu, et al.
Publicado: (2026)
por: Zhang, Brian Hu, et al.
Publicado: (2026)
Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
por: Leonardos, Stefanos, et al.
Publicado: (2021)
por: Leonardos, Stefanos, et al.
Publicado: (2021)
On the Complexity of Correlated Equilibria Beyond Normal-Form Games
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
por: Feng, Yi, et al.
Publicado: (2024)
por: Feng, Yi, et al.
Publicado: (2024)
Swap Regret Minimization Through Response-Based Approachability
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
The Complexity of Equilibrium Refinements in Potential Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
por: Anagnostides, Ioannis, et al.
Publicado: (2025)
The Value of Recall in Extensive-Form Games
por: Berker, Ratip Emin, et al.
Publicado: (2024)
por: Berker, Ratip Emin, et al.
Publicado: (2024)
Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
por: Lei, Qi, et al.
Publicado: (2020)
por: Lei, Qi, et al.
Publicado: (2020)
Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
por: Barakat, Anas, et al.
Publicado: (2026)
por: Barakat, Anas, et al.
Publicado: (2026)
ApproxED: Approximate exploitability descent via learned best responses
por: Martin, Carlos, et al.
Publicado: (2023)
por: Martin, Carlos, et al.
Publicado: (2023)
The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
por: Kontogiannis, Andreas, et al.
Publicado: (2026)
por: Kontogiannis, Andreas, et al.
Publicado: (2026)
Performative Prediction with Neural Networks
por: Mofakhami, Mehrnaz, et al.
Publicado: (2023)
por: Mofakhami, Mehrnaz, et al.
Publicado: (2023)
The Bayesian Context Trees State Space Model for time series modelling and forecasting
por: Papageorgiou, Ioannis, et al.
Publicado: (2023)
por: Papageorgiou, Ioannis, et al.
Publicado: (2023)
Collaborative Knowledge Distillation via a Learning-by-Education Node Community
por: Kaimakamidis, Anestis, et al.
Publicado: (2024)
por: Kaimakamidis, Anestis, et al.
Publicado: (2024)
Ejemplares similares
-
The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025) -
Computational Lower Bounds for Regret Minimization in Normal-Form Games
por: Anagnostides, Ioannis, et al.
Publicado: (2024) -
Barriers to Welfare Maximization with No-Regret Learning
por: Anagnostides, Ioannis, et al.
Publicado: (2024) -
Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
por: Chauhan, Rohan, et al.
Publicado: (2025) -
Convergence of Regret Matching in Potential Games and Constrained Optimization
por: Anagnostides, Ioannis, et al.
Publicado: (2025)