mlsanityData to 14 Oct 2026

Stress-Aware Learning under KL Drift via Trust-Decayed Mirror Descent

arXiv 2510.15222 ↗First posted 17 Oct 2025cs.LG math.ST stat.THcited by 0

Not on the map. Why?

Abstract (arXiv)

We study sequential decision-making under distribution drift. We propose entropy-regularized trust-decay, which injects stress-aware exponential tilting into both belief updates and mirror-descent decisions. On the simplex, a Fenchel-dual equivalence shows that belief tilt and decision tilt coincide. We formalize robustness via fragility (worst-case excess risk in a KL ball), belief bandwidth (radius sustaining a target excess), and a decision-space Fragility Index (drift tolerated at O(√T) regret). We prove high-probability sensitivity bounds and establish dynamic-regret guarantees of tildeO(√T) under KL-drift path length ST = sumt≥2√rm KL(Dt|Dt-1)/2. In particular, trust-decay achieves O(1) per-switch regret, while stress-free updates incur Omega(1) tails. A parameter-free hedge adapts the tilt to unknown drift, whereas persistent over-tilting yields an Omega(λ2 T) stationary penalty. We further obtain calibrated-stress bounds and extensions to second-order updates, bandit feedback, outliers, stress variation, distributed optimization, and plug-in KL-drift estimation. The framework unifies dynamic-regret analysis, distributionally robust objectives, and KL-regularized control within a single stress-adaptive update.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 17 references that are in the map. First posted on arXiv 17 Oct 2025.

Builds on

10 of 17 references.

References · 10

  1. 2018A Lyapunov-based Approach to Safe Reinforcement Learningcited by 297
  2. 2020Tilted Empirical Risk Minimizationcited by 106
  3. 2019Algorithms of Robust Stochastic Optimization Based on Mirror Descent Methodcited by 32
  4. 2019Online Learning with Continuous Variations: Dynamic Regret and Reductionscited by 10
  5. 2025State Entropy Regularization for Robust Reinforcement Learningcited by 6
  6. 2025ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learningcited by 6
  7. 2023Optimality of Robust Online Learningcited by 5
  8. 2025Unconstrained Robust Online Convex Optimizationcited by 3
  9. 2024On the KL-Divergence-based Robust Satisficing Modelcited by 1
  10. 2025Beyond KL-divergence: Risk Aware Control Through Cross Entropy and Adversarial Entropy Regularizationcited by 1

Built on by

Not cited yet.