Research map / Learning theory and algorithms / Submodular and game algorithms
On the Computational Complexity of Performative Prediction
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- The Stability of Online Algorithms in Performative Prediction (NeurIPS 2026 · similarity 0.87)
- Decentralized Noncooperative Games with Coupled Decision-Dependent Distributions (NeurIPS 2024 · similarity 0.87)
- Two-timescale Derivative Free Optimization for Performative Prediction with Markovian Data (ICML 2024 · similarity 0.85)
- Multi-Agent Learning under Uncertainty: Recurrence vs. Concentration (NeurIPS 2025 · similarity 0.85)
- Stochastic Optimization Schemes for Performative Prediction with Nonconvex Loss (NeurIPS 2024 · similarity 0.85)
- Plug-in Performative Optimization (ICML 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.