Backend
Restorative Control and the Limits of Safe Model Discrimination
arXiv cs.SY0 views
arXiv:2610.09442v1 Announce Type: new Abstract: Restorative control seeks lasting recovery through an intervention that ends in finite time. We formulate this objective as a reach-avoid problem in which the input must bring the system safely into a desired basin of attraction before withdrawal. Two candidates share bistable baseline dynamics but accumulate irreversible damage through different allocations of drive-generated exposure. We derive a lower bound on the exposure required for basin transfer and a sufficient construction for safe restoration. When the lower bound exceeds the summed tolerances, every common open-loop input that restores either model causes failure under at least one. With sufficient tolerance, proportional allocation restores both without identification. For feedback from output samples with Gaussian noise, we bound safe-restoration probability in terms of failure risk under the alternative model. A numerical example illustrates the certificates under two sensing regimes.
Source:https://arxiv.org/abs/2610.09442PreviousHierarchical Defense in Leader-Defender-Attacker Games: Nested Equilibria and Receding-Horizon ControlNextSafe Control of Semi-Explicit Differential-Algebraic Systems: Control Barrier Functions with SOS Verification
Related posts
DeepSeek's Open-Source "Super-Agent" Codes Without Being Asked
0dev.to GitHub
All-in-one platform or a stack you assemble? Where do coaches and educators land?
0dev.to Discuss
I Wanted to Live on Coruscant. PAT Scared Me. Now My Alexa Lives on Mute.
0dev.to Discuss
Detect What You Can Name: PaliGemma 2 Object Detection with Transformers
0dev.to Machine Learning
When Should an LLM Router Stop Being Sticky? llm-d 1.0 Cache-Affinity Routing, Break-Even Math, and a Simulation
0dev.to Machine Learning

Understanding HackerTube: Karpathy’s Two-Hour Experiment in Better Recommendations
0dev.to Machine Learning