Imagen de Portada

The Stability of Online Algorithms in Performative Prediction

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Farina, Gabriele, Perdomo, Juan Carlos
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Computers and Society Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
por: Farina, Gabriele, et al.
Publicado: (2026)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
por: Fan, Zhiyuan, et al.
Publicado: (2024)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
por: Maiti, Arnab, et al.
Publicado: (2025)

GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning
por: Fan, Zhiyuan, et al.
Publicado: (2026)

User Strategization and Trustworthy Algorithms
por: Cen, Sarah H., et al.
Publicado: (2023)

Strategic Hiring under Algorithmic Monoculture
por: Baek, Jackie, et al.
Publicado: (2025)

Algorithmic Collective Action with Two Collectives
por: Karan, Aditya, et al.
Publicado: (2025)

Evolutionary Prediction Games
por: Saig, Eden, et al.
Publicado: (2025)

Clickbait vs. Quality: How Engagement-Based Optimization Shapes the Content Landscape in Online Platforms
por: Immorlica, Nicole, et al.
Publicado: (2024)

Online Learning and Equilibrium Computation with Ranking Feedback
por: Liu, Mingyang, et al.
Publicado: (2026)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
por: Soleymani, Ashkan, et al.
Publicado: (2025)

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
por: Cai, Yang, et al.
Publicado: (2023)

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
por: Anagnostides, Ioannis, et al.
Publicado: (2025)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
por: Zhang, Brian, et al.
Publicado: (2022)

On the Universal Near Optimality of Hedge in Combinatorial Settings
por: Fan, Zhiyuan, et al.
Publicado: (2025)

On Randomized Algorithms in Online Strategic Classification
por: Hutton, Chase, et al.
Publicado: (2026)

When to Ask a Question: Understanding Communication Strategies in Generative AI Tools
por: Park, Charlotte, et al.
Publicado: (2026)

A Benchmark for Strategic Auditee Gaming Under Continuous Compliance Monitoring
por: Burnat, Florian A. D., et al.
Publicado: (2026)

Proportional Fairness in Clustering: A Social Choice Perspective
por: Kellerhals, Leon, et al.
Publicado: (2023)

Designing Reputation Systems for Manufacturing Data Trading Markets: A Multi-Agent Evaluation with Q-Learning and IRL-Estimated Utilities
por: Yamamoto, Kenta, et al.
Publicado: (2025)

Cherry on the Cake: Fairness is NOT an Optimization Problem
por: Favier, Marco, et al.
Publicado: (2024)

Incentivizing Desirable Effort Profiles in Strategic Classification: The Role of Causality and Uncertainty
por: Efthymiou, Valia, et al.
Publicado: (2025)

Improved Bayes Risk Can Yield Reduced Social Welfare Under Competition
por: Jagadeesan, Meena, et al.
Publicado: (2023)

LiteEFG: An Efficient Python Library for Solving Extensive-form Games
por: Liu, Mingyang, et al.
Publicado: (2024)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
por: Soleymani, Ashkan, et al.
Publicado: (2025)

A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence
por: Liu, Mingyang, et al.
Publicado: (2024)

The Relationship between No-Regret Learning and Online Conformal Prediction
por: Ramalingam, Ramya, et al.
Publicado: (2025)

Inducing Efficient and Equitable Professional Networks through Link Recommendations
por: Dwork, Cynthia, et al.
Publicado: (2025)

Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
por: Zhang, Brian Hu, et al.
Publicado: (2025)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
por: Cai, Yang, et al.
Publicado: (2024)

Improved Online Learning Algorithms for CTR Prediction in Ad Auctions
por: Feng, Zhe, et al.
Publicado: (2024)

Performative Prediction with Neural Networks
por: Mofakhami, Mehrnaz, et al.
Publicado: (2023)

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
por: Esmaeili, Seyed A., et al.
Publicado: (2023)

Vehicles, Pedestrians, and E-bikes: a Three-party Game at Right-turn-on-red Crossroads Revealing the Dual and Irrational Role of E-bikes that Risks Traffic Safety
por: Zhang, Gangcheng, et al.
Publicado: (2024)

Bayesian Algorithms for Adversarial Online Learning: from Finite to Infinite Action Spaces
por: Terenin, Alexander, et al.
Publicado: (2025)

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games
por: Zhang, Brian Hu, et al.
Publicado: (2023)

Differentially Private Equilibrium Finding in Polymatrix Games
por: Liu, Mingyang, et al.
Publicado: (2025)

Contextual Online Bilateral Trade
por: Cosson, Romain, et al.
Publicado: (2026)

Online Learning with Bounded Recall
por: Schneider, Jon, et al.
Publicado: (2022)

Fair Online Bilateral Trade
por: Bachoc, François, et al.
Publicado: (2024)