Cover Image

Lookahead identification in adversarial bandits: accuracy and memory bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brukhim, Nataly, Cesa-Bianchi, Nicolò, Ciliberto, Carlo
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning Conditional Averages
by: Bressan, Marco, et al.
Published: (2026)

Of Dice and Games: A Theory of Generalized Boosting
by: Bressan, Marco, et al.
Published: (2024)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Distributed Online Optimization with Stochastic Agent Availability
by: Achddou, Juliette, et al.
Published: (2024)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
by: Jin, Tianyuan, et al.
Published: (2024)

Online Linear Regression with Paid Stochastic Features
by: Merlis, Nadav, et al.
Published: (2025)

Multitask Online Learning: Listen to the Neighborhood Buzz
by: Achddou, Juliette, et al.
Published: (2023)

Adaptive maximization of social welfare
by: Cesa-Bianchi, Nicolo, et al.
Published: (2023)

On the Hardness of Bandit Learning
by: Brukhim, Nataly, et al.
Published: (2025)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
by: Di Gennaro, Federico, et al.
Published: (2025)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026)

A Perturbation Approach to Unconstrained Linear Bandits
by: Jacobsen, Andrew, et al.
Published: (2026)

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Beyond Bandit Feedback in Online Multiclass Classification
by: van der Hoeven, Dirk, et al.
Published: (2021)

Cooperative Online Learning with Feedback Graphs
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
by: Eldowa, Khaled, et al.
Published: (2024)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

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

A Regret Analysis of Bilateral Trade
by: Cesa-Bianchi, Nicolò, et al.
Published: (2021)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

A Theory of Interpretable Approximations
by: Bressan, Marco, et al.
Published: (2024)

Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Market Making without Regret
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

The Invisible Handshake: Persistent Overpricing by Adaptive Market Agents
by: Foscari, Luigi, et al.
Published: (2025)

Extreme bandits
by: Carpentier, Alexandra, et al.
Published: (2026)

Functional multi-armed bandit and the best function identification problems
by: Dorn, Yuriy, et al.
Published: (2025)

Best of both worlds: Stochastic & adversarial best-arm identification
by: Abbasi-Yadkori, Yasin, et al.
Published: (2026)

Spectral bandits
by: Kocák, Tomáš, et al.
Published: (2026)

Next-Depth Lookahead Tree
by: Lee, Jaeho, et al.
Published: (2025)

Reinforcement Learning with Lookahead Information
by: Merlis, Nadav
Published: (2024)

Generalization and Optimization of SGD with Lookahead
by: Li, Kangcheng, et al.
Published: (2025)

Closed-form Filtering for Non-linear Systems
by: Cantelobre, Théophile, et al.
Published: (2024)

Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)

Lookahead Counterfactual Fairness
by: Zuo, Zhiqun, et al.
Published: (2024)

The Value of Reward Lookahead in Reinforcement Learning
by: Merlis, Nadav, et al.
Published: (2024)

Operator World Models for Reinforcement Learning
by: Novelli, Pietro, et al.
Published: (2024)