AI & ML
Dissipation Bounds and Hardness in Globally Asymptotically Stable Quadratic Systems
arXiv cs.SY0 views
arXiv:2610.29512v1 Announce Type: new Abstract: We study worst-case finite-time energy dissipation in quadratic systems with proved global asymptotic stability (GAS). Estimating the maximum retained energy fraction to any fixed positive additive error below $1/2$ is NP-hard, even when the input includes a strict quartic Lyapunov function and proof of strictness, both constructed in polynomial time. NP denotes nondeterministic polynomial time. For a partially damped family, the unit-sphere minimum norm of the coupling map equals the structured coefficient distance to loss of GAS. Positive distances at most $1/2$ give two-sided inverse-square halving-time bounds with explicit coefficient factors. Polynomial-factor approximation of the least dissipated fraction, halving time or coefficient distance is NP-hard. Additive hardness persists throughout an explicit coefficient neighborhood and under direct damping with exponential stability, a strict quadratic Lyapunov function and a Hurwitz Jacobian. Unless $\mathrm{P}=\mathrm{NP}$, where P denotes deterministic polynomial time, no polynomial-time algorithm attains these guarantees on all inputs.
Source:https://arxiv.org/abs/2610.29512PreviousA Decade of Learning-Based Control: From Theoretic Foundations to Practical DeploymentNextSafe World Model for Joint Trajectory and Beamforming Design of Mobile Base Stations
Related posts

The Download: the agentic web arrives and the drive for safer roads
0MIT Technology Review

Stop counting tokens, start counting what ships
0MIT Technology Review
OpenAI is finally merging ChatGPT’s chat and Work tabs
0TechCrunch

10 Open-Source Robotics Repositories for 3D Perception, VLA Policies, and Sensor Calibration
0dev.to
My self-modifying system tried to wire a gate-passing module into its own protection enforcer. It was refused three times.
0dev.to
Last night an AI agent performed brain surgery on a mouse
0Hacker News