Cover Image

Bayesian Algorithms for Adversarial Online Learning: from Finite to Infinite Action Spaces

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Terenin, Alexander, Negrea, Jeffrey
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computer Science and Game Theory Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stochastic contextual bandits with graph feedback: from independence number to MAS number
by: Wen, Yuxiao, et al.
Published: (2024)

Algorithmic Collective Action in Machine Learning
by: Hardt, Moritz, et al.
Published: (2023)

Pure Exploration via Frank-Wolfe Self-Play
by: Liu, Xinyu, et al.
Published: (2025)

Optimal Scoring Rule Design under Partial Knowledge
by: Chen, Yiling, et al.
Published: (2021)

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games
by: Yan, Yuling, et al.
Published: (2022)

Computing Optimal Regularizers for Online Linear Optimization
by: Gatmiry, Khashayar, et al.
Published: (2024)

Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)

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

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

A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent
by: Jafarnia-Jahromi, Mehdi, et al.
Published: (2021)

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
by: Xin, Yun, et al.
Published: (2025)

Isotonic Mechanism for Exponential Family Estimation in Machine Learning Peer Review
by: Yan, Yuling, et al.
Published: (2023)

Instance-Adaptive Hypothesis Tests with Heterogeneous Agents
by: Shi, Flora C., et al.
Published: (2025)

Statistical Impossibility and Possibility of Aligning LLMs with Human Preferences: From Condorcet Paradox to Nash Equilibrium
by: Liu, Kaizhao, et al.
Published: (2025)

Sharp Results for Hypothesis Testing with Risk-Sensitive Agents
by: Shi, Flora C., et al.
Published: (2024)

Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)

From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces
by: Dagan, Yuval, et al.
Published: (2023)

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

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

Bayesian Learning in Episodic Zero-Sum Games
by: Yueh, Chang-Wei, et al.
Published: (2026)

Reinforcement Learning for Finite Space Mean-Field Type Games
by: Shao, Kai, et al.
Published: (2024)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness
by: Ehrenberg, Maayan, et al.
Published: (2024)

Robust Adversarial Reinforcement Learning in Stochastic Games via Sequence Modeling
by: Tang, Xiaohang, et al.
Published: (2025)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
by: Liu, Junyan, et al.
Published: (2025)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
by: Bollini, Matteo, et al.
Published: (2026)

The Stability of Online Algorithms in Performative Prediction
by: Farina, Gabriele, et al.
Published: (2026)

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

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

Learning in Budgeted Auctions with Spacing Objectives
by: Fikioris, Giannis, et al.
Published: (2024)

Bilateral Trade Under Heavy-Tailed Valuations: Minimax Regret with Infinite Variance
by: Zhao, Hangyi
Published: (2026)

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)

Online Multi-Agent Control with Adversarial Disturbances
by: Barakat, Anas, et al.
Published: (2025)

Online Price Competition under Generalized Linear Demands
by: Bracale, Daniele, et al.
Published: (2025)

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

Principal-Agent Hypothesis Testing
by: Bates, Stephen, et al.
Published: (2022)

You Are the Best Reviewer of Your Own Papers: The Isotonic Mechanism
by: Su, Weijie
Published: (2022)