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

Abstract

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 O(T) under KL-drift path length ST = Σt2 KL(Dt|Dt-1)/2. In particular, trust-decay achieves O(1) per-switch regret, while stress-free updates incur (1) tails. A parameter-free hedge adapts the tilt to unknown drift, whereas persistent over-tilting yields an (λ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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…