arXiv Machine Learning
Data Reuse in Non-Stationary Learning
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 4
The Cost of Learning Under Multiple Change Points
arXiv:2602. 11406v2 Announce Type: replace-cross Abstract: We consider an online learning problem in environments with multiple change points.
arXiv Machine Learning
Jun 2
Agile Online Model Selection: Resolving Adaptation Lag via Safeguarded Large Learning Rates
arXiv:2605. 26919v2 Announce Type: replace Abstract: Maintaining predictive accuracy in non-stationary environments requires online model selection to adapt autonomously to unknown distribution shifts.
arXiv Machine Learning
Oct 8
Differential Refresh Policies for Models Trained on Lagging Data Snapshots: From a Single-Age Equivalence Limit to an Optimal Per-Segment Allocation
arXiv:2610.09519v1 Announce Type: new Abstract: Production machine-learning models are derived artifacts of time-bounded training snapshots: a deployed model is a materialized view over a training cu...
arXiv Machine Learning
Jun 9
Theoretical Foundations of Continual Learning via Drift-Plus-Penalty
arXiv:2606. 08452v1 Announce Type: new Abstract: In many real-world settings, data streams are nonstationary and arrive sequentially, requiring learning systems to adapt continuously without retraining from scratch.
arXiv Machine Learning
Sep 7
Resilience Beyond Stationary Client Unavailability: Unlocking Efficient and Unbiased Federated Learning
The paper introduces FedSWE, a federated learning algorithm designed to handle non‑stationary and heterogeneous client availability without requiring prior real‑time knowledge of which devices are online. FedSWE compensates for missed computations, stabilizes global updates, and mixes local updates through implicit gossiping, all while adding only modest memory and computational overhead. The authors prove that FedSWE converges to a stationary point for non‑convex objectives and achieves linear speedup in certain scenarios, and they validate these claims with experiments on real‑world datasets featuring diverse client unavailability patterns.
arXiv Machine Learning
Oct 3
Online Generalized-Mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
The paper investigates online fair allocation of sequential items to agents with heterogeneous preferences, aiming to maximize generalized-mean welfare. In an i.i.d. arrival setting, a pure greedy algorithm achieves near-optimal “~O(1/T)” average regret without needing distributional knowledge. For nonstationary arrivals, the authors show that a single historical sample per distribution suffices to recover the same regret rate, using re-solving algorithms that remain robust to distribution shifts.