Cover Image

Efficient learning by implicit exploration in bandit problems with side observations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kocak, Tomas, Neu, Gergely, Valko, Michal, Munos, Remi
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

Online learning with noisy side observations
by: Kocák, Tomáš, et al.
Published: (2026)

Online learning with Erdős-Rényi side-observation graphs
by: Kocák, Tomáš, et al.
Published: (2026)

Spectral bandits for smooth graph functions
by: Valko, Michal, et al.
Published: (2026)

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

Spectral bandits for smooth graph functions with applications in recommender systems
by: Kocák, Tomáš, et al.
Published: (2026)

Spectral Thompson sampling
by: Kocak, Tomas, et al.
Published: (2026)

Online combinatorial optimization with stochastic decision sets and adversarial losses
by: Neu, Gergely, et al.
Published: (2026)

VA-learning as a more efficient alternative to Q-learning
by: Tang, Yunhao, et al.
Published: (2023)

Bandits attack function optimization
by: Preux, Philippe, et al.
Published: (2026)

Stochastic simultaneous optimistic optimization
by: Valko, Michal, et al.
Published: (2026)

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

Black-box optimization of noisy functions with unknown smoothness
by: Grill, Jean-Bastien, et al.
Published: (2026)

Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning
by: Grill, Jean-Bastien, et al.
Published: (2026)

Revealing graph bandits for maximizing local influence
by: Carpentier, Alexandra, et al.
Published: (2026)

Covariance-adapting algorithm for semi-bandits with application to sparse rewards
by: Perrault, Pierre, et al.
Published: (2026)

RL-finetuning LLMs from on- and off-policy data with a single algorithm
by: Tang, Yunhao, et al.
Published: (2025)

A single algorithm for both restless and rested rotting bandits
by: Seznec, Julien, et al.
Published: (2026)

Planning in entropy-regularized Markov decision processes and games
by: Grill, Jean-Bastien, et al.
Published: (2026)

Trading off rewards and errors in multi-armed bandits
by: Erraqabi, Akram, et al.
Published: (2026)

Adaptive graph-based algorithms for conditional anomaly detection and semi-supervised learning
by: Valko, Michal
Published: (2026)

Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier
by: Fiegel, Come, et al.
Published: (2026)

Efficient kernelized bandit algorithms via exploration distributions
by: Hu, Bingshan, et al.
Published: (2025)

Distance metric learning for conditional anomaly detection
by: Valko, Michal, et al.
Published: (2026)

On two ways to use determinantal point processes for Monte Carlo integration
by: Gautier, Guillaume, et al.
Published: (2026)

On a few pitfalls in KL divergence gradient estimation for RL
by: Tang, Yunhao, et al.
Published: (2025)

Bandits on graphs and structures
by: Valko, Michal
Published: (2026)

Model-free Posterior Sampling via Learning Rate Randomization
by: Tiapkin, Daniil, et al.
Published: (2023)

Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning
by: Moulin, Antoine, et al.
Published: (2025)

Super-Exponential Regret for UCT, AlphaGo and Variants
by: Orseau, Laurent, et al.
Published: (2024)

Adaptive multi-fidelity optimization with fast learning rates
by: Fiegel, Come, et al.
Published: (2026)

Offline RL via Feature-Occupancy Gradient Ascent
by: Neu, Gergely, et al.
Published: (2024)

Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
by: Lugosi, Gábor, et al.
Published: (2023)

Large-scale semi-supervised learning with online spectral graph sparsification
by: Calandriello, Daniele, et al.
Published: (2026)

Pack only the essentials: Adaptive dictionary learning for kernel ridge regression
by: Calandriello, Daniele, et al.
Published: (2026)

When and why randomised exploration works (in linear bandits)
by: Abeille, Marc, et al.
Published: (2025)

Dealing with unbounded gradients in stochastic saddle-point optimization
by: Neu, Gergely, et al.
Published: (2024)

Feature importance analysis for patient management decisions
by: Valko, Michal, et al.
Published: (2026)

Learning from a single labeled face and a stream of unlabeled data
by: Kveton, Branislav, et al.
Published: (2026)

Efficient RL Training for LLMs with Experience Replay
by: Arnal, Charles, et al.
Published: (2026)

Semi-supervised learning with max-margin graph cuts
by: Kveton, Branislav, et al.
Published: (2026)