Image de couverture de livre

Online Learning with Bounded Recall

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Schneider, Jon, Vodrahalli, Kiran
Format:	Preprint
Publié:	2022
Sujets:	Machine Learning Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Next-Token Prediction and Regret Minimization
par: Mohri, Mehryar, et autres
Publié: (2026)

A New Benchmark for Online Learning with Budget-Balancing Constraints
par: Braverman, Mark, et autres
Publié: (2025)

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
par: Kumar, Rachitesh, et autres
Publié: (2024)

Learning to Play Against Unknown Opponents
par: Arunachaleswaran, Eshwar Ram, et autres
Publié: (2024)

Improved Regret Bounds for Online Fair Division with Bandit Learning
par: Schiffer, Benjamin, et autres
Publié: (2025)

Fundamental Bounds on Online Strategic Classification
par: Ahmadi, Saba, et autres
Publié: (2023)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
par: Fan, Zhiyuan, et autres
Publié: (2024)

Distributional Alignment Games for Answer-Level Fine-Tuning
par: Mohri, Mehryar, et autres
Publié: (2026)

Strategizing against No-regret Learners
par: Deng, Yuan, et autres
Publié: (2019)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
par: Bechavod, Yahav, et autres
Publié: (2025)

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
par: Ahmadi, Saba, et autres
Publié: (2024)

Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
par: Leme, Renato Paes, et autres
Publié: (2022)

Computing Optimal Regularizers for Online Linear Optimization
par: Gatmiry, Khashayar, et autres
Publié: (2024)

Efficient Opportunistic Approachability
par: Marinov, Teodor Vanislavov, et autres
Publié: (2026)

Learning-Augmented Online Bidding in Stochastic Settings
par: Angelopoulos, Spyros, et autres
Publié: (2025)

Full Swap Regret and Discretized Calibration
par: Fishelson, Maxwell, et autres
Publié: (2025)

Swap Regret and Correlated Equilibria Beyond Normal-Form Games
par: Arunachaleswaran, Eshwar Ram, et autres
Publié: (2025)

The Relationship between No-Regret Learning and Online Conformal Prediction
par: Ramalingam, Ramya, et autres
Publié: (2025)

Learning in Online Principal-Agent Interactions: The Power of Menus
par: Han, Minbiao, et autres
Publié: (2023)

Honor Among Bandits: No-Regret Learning for Online Fair Division
par: Procaccia, Ariel D., et autres
Publié: (2024)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
par: Jalota, Devansh, et autres
Publié: (2023)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
par: Castiglioni, Matteo, et autres
Publié: (2023)

PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators
par: Xu, Renzhe, et autres
Publié: (2024)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
par: Liu, Junyan, et autres
Publié: (2026)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
par: Cai, Yang, et autres
Publié: (2025)

Contextual Online Bilateral Trade
par: Cosson, Romain, et autres
Publié: (2026)

Fair Online Bilateral Trade
par: Bachoc, François, et autres
Publié: (2024)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
par: Zhang, Brian Hu, et autres
Publié: (2025)

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
par: Farina, Gabriele, et autres
Publié: (2026)

Nonparametric Contextual Online Bilateral Trade
par: Coccia, Emanuele, et autres
Publié: (2026)

On Randomized Algorithms in Online Strategic Classification
par: Hutton, Chase, et autres
Publié: (2026)

Online Omniprediction with Long-Term Constraints
par: Bechavod, Yahav, et autres
Publié: (2025)

Trading Volume Maximization with Online Learning
par: Cesari, Tommaso, et autres
Publié: (2024)

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
par: Xin, Yun, et autres
Publié: (2025)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
par: Jin, Yaonan
Publié: (2026)

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
par: Di Gregorio, Simone, et autres
Publié: (2025)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
par: Anagnostides, Ioannis, et autres
Publié: (2024)

Analyzing Skill Element in Online Fantasy Cricket
par: Sarkar, Sarthak, et autres
Publié: (2025)

Online Stackelberg Optimization via Nonlinear Control
par: Brown, William, et autres
Publié: (2024)

Regularized Online RLHF with Generalized Bilinear Preferences
par: Lee, Junghyun, et autres
Publié: (2026)