← Back to all news
arXiv Machine Learning By Taehyun Hwang, Min-hwan Oh

Linear Ensemble Sampling with Smaller Ensembles

Read the original on arXiv Machine Learning →

arXiv:2609. 13954v1 Announce Type: new Abstract: Ensemble sampling offers a practical approach to randomized exploration by maintaining a collection of models, but how small an ensemble can be while retaining strong regret guarantees remains unresolved.

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.

Related stories

arXiv Machine Learning
Jun 30

Randomized Exploration for Linear Bandits via Absolute Perturbations

arXiv:2606. 28616v1 Announce Type: new Abstract: In stochastic linear bandits, the canonical Upper Confidence Bound (UCB) algorithm admits a simple frequentist regret analysis but can be computationally demanding, while Thompson Sampling (TS) is computationally attractive yet typically harder to analyze due to its non-optimistic nature.

By Toshinori Kitamura, Shuai Liu, Csaba Szepesv\'ari
More like this →
arXiv Machine Learning
Jul 14

Bandit PCA with Minimax Optimal Regret

arXiv:2607. 10936v1 Announce Type: new Abstract: We study the bandit-feedback version of online principal component analysis (Bandit PCA): in each round $t = 1,\dots,T$, the adversary selects a $d \times d$ symmetric gain matrix $G_t$ with spectrum in $[0,1]$ and rank at most $r$; the learner simultaneously selects a unit vector $w_t \in S^{d-1}$ and receives the reward $w_t^\top G_t w_t$.

By Mo\"ise Blanchard, Dmitrii Ostrovskii, Aadirupa Saha
reinforcement-learning
More like this →