Imagen de Portada

Best of both worlds: Stochastic & adversarial best-arm identification

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abbasi-Yadkori, Yasin, Bartlett, Peter L., Gabillon, Victor, Malek, Alan, Valko, Michal
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Scale-free adaptive planning for deterministic dynamics & discounted rewards
por: Bartlett, Peter L., et al.
Publicado: (2026)

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

Pointwise confidence estimation in the non-linear $\ell^2$-regularized least squares
por: Kuzborskij, Ilja, et al.
Publicado: (2025)

Low-rank bias, weight decay, and model merging in neural networks
por: Kuzborskij, Ilja, et al.
Publicado: (2025)

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

To Believe or Not to Believe Your LLM
por: Yadkori, Yasin Abbasi, et al.
Publicado: (2024)

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

Stochastic simultaneous optimistic optimization
por: Valko, Michal, et al.
Publicado: (2026)

Bandits on graphs and structures
por: Valko, Michal
Publicado: (2026)

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

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

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

Quantum spatial best-arm identification via quantum walks
por: Yamagami, Tomoki, et al.
Publicado: (2025)

Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
por: Tarbouriech, Jean, et al.
Publicado: (2026)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
por: Zhao, Canzhe, et al.
Publicado: (2025)

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
por: Tsuchiya, Taira, et al.
Publicado: (2023)

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

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

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

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

Extreme bandits
por: Carpentier, Alexandra, et al.
Publicado: (2026)

A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays
por: Masoudian, Saeed, et al.
Publicado: (2023)

Hierarchical Reasoning Model
por: Wang, Guan, et al.
Publicado: (2025)

Active multiple matrix completion with adaptive confidence sets
por: Locatelli, Andrea, et al.
Publicado: (2026)

Bandits attack function optimization
por: Preux, Philippe, et al.
Publicado: (2026)

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

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

Analysis of Nystrom method with sequential ridge leverage scores
por: Calandriello, Daniele, et al.
Publicado: (2026)

Bayesian policy gradient and actor-critic algorithms
por: Ghavamzadeh, Mohammad, et al.
Publicado: (2026)

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

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

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

Learning predictive models for combinations of heterogeneous proteomic data sources
por: Valko, Michal, et al.
Publicado: (2026)

Language Generation with Replay: A Learning-Theoretic View of Model Collapse
por: Racca, Giorgio, et al.
Publicado: (2026)

Lookahead identification in adversarial bandits: accuracy and memory bounds
por: Brukhim, Nataly, et al.
Publicado: (2026)

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

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

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

Maximum Entropy Semi-Supervised Inverse Reinforcement Learning
por: Audiffren, Julien, et al.
Publicado: (2026)

Spectral Thompson sampling
por: Kocak, Tomas, et al.
Publicado: (2026)