arXiv Machine Learning
A First-Order Learning Algorithm for Online Resource Allocation with Constant Regret
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 9
Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits
arXiv:2606. 08977v1 Announce Type: new Abstract: Motivated by the recency effect in online learning, we study algorithms for single-pass *sliding-window streaming multi-armed bandits (MABs)* in this paper.
arXiv Machine Learning
Oct 2
Rising Multi-Armed Bandits with Known Horizons
arXiv:2602.10727v3 Announce Type: replace Abstract: Rising Multi-Armed Bandits (RMABs) model sequential decision problems where each arm's expected reward improves with repeated pulls. In such proble...
Hugging Face Trending Papers
Oct 19
A Simple and Unified Method for Gradient-Variation Regret
Gradient-variation online learning has attracted increasing attention for its connections to game theory and optimization. It has been studied in both non-stationary online learning, which aims to min...
arXiv Machine Learning
Aug 4
Learning-Based Stochastic Optimal Control with Infinite-Horizon Probabilistic Constraints
arXiv:2608. 01151v1 Announce Type: cross Abstract: In this paper, we consider stochastic optimal control problems with infinite-horizon joint chance constraints.
arXiv Machine Learning
Oct 7
Linear Bandits under Exact Sliding-Window Constraints
arXiv:2610. 08745v1 Announce Type: new Abstract: We study linear bandits under exact sliding-window constraints, where every consecutive block of actions must belong to a prescribed feasible set.
arXiv Machine Learning
Jun 15
Optimal Hidden-Target Learning for Online Inventory Optimization on General Convex Sets
arXiv:2606. 14679v1 Announce Type: new Abstract: Online inventory optimization (OIO) is online convex optimization with physical memory: inventory carryover makes the feasible action set depend on the past.