arXiv Machine Learning July 28, 2026 By Ruiyuan Huang, Zengfeng Huang

Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback

Read the original on arXiv Machine Learning →

arXiv:2502. 04678v2 Announce Type: replace Abstract: Repeated first-price auctions are contextual decision problems with censored but reusable feedback: after submitting a bid, a learner can infer the outcomes of related bids and evaluate them under different private values.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 29

Learning in Markovian bandits with non-observable states and constrained decision epochs

arXiv:2606. 27448v1 Announce Type: new Abstract: This paper studies the problem of regret minimization in Markovian bandits with \emph{non-observable states} and possibly \emph{constrained} decision epochs.

By Thomas Hira, Victor Boone, Urtzi Ayesta, Ina Maria Verloop

reinforcement-learning benchmarks safety

arXiv AI

Jul 15

Learning When to Trust in Contextual Social Bandits

arXiv:2603. 13356v2 Announce Type: replace Abstract: Robust reinforcement learning typically assumes that feedback sources are either globally trustworthy or corrupted within a fixed global budget.

By Majid Ghasemi, Mark Crowley

reinforcement-learning safety

arXiv Machine Learning

Sep 15

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

arXiv:2609.13547v1 Announce Type: new Abstract: We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$...

By Mengxiao Zhang

safety

arXiv Machine Learning

Sep 10

Best-of-Both Worlds for linear contextual bandits with paid observations

arXiv:2510. 07424v3 Announce Type: replace Abstract: We study linear contextual bandits with paid observations, where at each round the learner observes a context, selects an action, and may pay a fixed cost to observe feedback from a subset of arms.

By Nathan Boyer, Dorian Baudry, Patrick Rebeschini

safety

arXiv Machine Learning

Jun 19

Stabilizing Bandits using Regularization: Precise Regret and A Quantitative Central Limit Theorem

arXiv:2603. 10184v2 Announce Type: replace-cross Abstract: Statistical inference with bandit data presents fundamental challenges owing to adaptive sampling, which violates the independence assumptions underlying classical asymptotic theory.

By Budhaditya Halder, Ishan Sengupta, Koustav Chowdhury, Samya Praharaj, Koulik Khamaru

reinforcement-learning safety

arXiv Machine Learning

Jun 2

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions

arXiv:2605. 01752v4 Announce Type: replace Abstract: We study linear dueling bandits in volatile environments characterized by the simultaneous presence of post-serving contexts, delayed feedback, and adversarial corruption.

By Youngmin Oh

safety

One email a morning, machine-written

Related stories

Learning in Markovian bandits with non-observable states and constrained decision epochs

Learning When to Trust in Contextual Social Bandits

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

Best-of-Both Worlds for linear contextual bandits with paid observations

Stabilizing Bandits using Regularization: Precise Regret and A Quantitative Central Limit Theorem

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions