← Back to all news
arXiv Machine Learning By Ilsang Ohn

Fast rates in Bayesian online learning with approximate posteriors

Read the original on arXiv Machine Learning →

The paper investigates how fast predictive regret guarantees of exact Bayesian online learning can be maintained when using approximate posterior methods. It establishes a general theorem linking the cumulative cost of posterior approximation to the contraction radius of the exact Gibbs posterior and the Wasserstein distance between approximate and exact posteriors. Three concrete online learning scenarios—linear models, infinite‑dimensional exponential families, and Gaussian process regression—illustrate that appropriately accurate approximations (projected Langevin, truncation, and sparse variational posteriors) preserve fast regret bounds while reducing computational demands.

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
Oct 16

The Tilted Sampling Problem: Optimism, Posterior Sampling, and Logarithmic Regret

The paper introduces the tilted sampling problem, where an online learner aims to sample from a Gibbs distribution defined by an unknown reward function. It defines sampling regret as the temperature‑normalized cumulative KL divergence between the learner’s distribution and the target Gibbs distribution, linking it to entropy‑regularized reward maximization. The authors develop sampling analogues of UCB and Thompson sampling, proving that sampling regret can achieve logarithmic growth in time, unlike standard regret which scales as ×O(√T).

By Mohammad Pedramfar, Siamak Ravanbakhsh
reinforcement-learning
More like this →
arXiv Statistics ML
5d ago

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization

This paper tackles Bayesian optimization using Gaussian processes, focusing on minimizing regret when the objective function is drawn from a known GP. For a Matérn kernel with sufficient smoothness, the authors prove that the GP-UCB algorithm achieves a cumulative regret of “~O(√T) with high probability. They also establish an “O(√T ln²T)" regret bound for the squared exponential kernel, bridging the gap between previous upper bounds and Scarlett’s 2018 results. The analysis hinges on capturing the concentration of the input sequence generated by GP-UCB to refine the GP’s information‑gain estimates.

By Shogo Iwazaki
reinforcement-learning
More like this →