Fast rates in Bayesian online learning with approximate posteriors
This story is from 2026-08-27. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2608.25706v1 Announce Type: new Abstract: Exact Bayes prediction enjoys fast predictive regret guarantees, but exact posterior updating or representation may be too costly for online use. We study when these statistical guarantees are preserved by computational approximations. We show that th…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-08-27 04:00 · arXiv stat.ML
Fast rates in Bayesian online learning with approximate posteriors