![[2606.04931] Mean-based algorithms: A lower bound and regret](/static/img/curated/desks/afbytes-tech.png)
[2606.04931] Mean-based algorithms: A lower bound and regret
Abstract page for arXiv paper 2606.04931: Mean-based algorithms: A lower bound and regret
America Forever Bytes
online learning · AFBytes
Technology
online learning
Recent coverage
[2606.02655] Coherent Swap Regret and Channel-Proof Learning
Abstract page for arXiv paper 2606.02655: Coherent Swap Regret and Channel-Proof Learning
[2605.29748] Instance-dependent Stochastic Lipschitz bandit
Abstract page for arXiv paper 2605.29748: Instance-dependent Stochastic Lipschitz bandit
[2605.29148] Optimal Gap-Dependent Regret for Private Stochastic Decision-Theoretic Online Learning
Abstract page for arXiv paper 2605.29148: Optimal Gap-Dependent Regret for Private Stochastic Decision-Theoretic Online Learning
[2605.28133] Learning to Bid in Repeated Second-Price Auctions with Dynamic Values and Aggregated Feedback
Abstract page for arXiv paper 2605.28133: Learning to Bid in Repeated Second-Price Auctions with Dynamic Values and Aggregated Feedback