Exact Risk-Complexity Laws for Projective Boundaries in Scenario Optimization and Distribution-Free Certification

arXiv:2609.01355 · eess.SY, cs.LG, cs.SY, math.OC · Submitted 2026-09-01 · Read on arXiv

eess.SY, cs.LG, cs.SY, math.OC

Submitted: 2026-09-01

Updated: 2026-09-01

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Calibration — 24× in this paper · explained in 7 episodes
• Conformal Prediction — 19× in this paper · explained in 5 episodes
• Consistency — 4× in this paper · explained in 3 episodes
• Verification — 4× in this paper · explained in 2 episodes
• Exchangeability — 3× in this paper · explained in 2 episodes
• Sample Complexity — 2× in this paper · explained in 15 episodes
• Admissibility — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• No-Go Theorem — 1× in this paper · explained in 2 episodes
• Regularization — 1× in this paper · explained in 3 episodes

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
• Battery Second Life: A Review of Experimental Studies
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
• Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model