让神经微分方程的稳定性与分类边界对齐,同时提升准确率和鲁棒性。
Learning Aligned Stability in Neural ODEs Reconciling Accuracy with Robustness
- 用可学习的李雅普诺夫函数直接做多分类,使吸引域与决策边界一致。
- 通过可微分损失实现预设与真实吸引域匹配,显著降低误差率至2.1%。
- 适用于需要高可靠性的安全关键场景,如自动驾驶与医疗诊断。
尽管神经微分方程(Neural ODEs)具有内在鲁棒性,现有方法常依赖李雅普诺夫稳定性以获得形式化保证,但仍面临准确率与鲁棒性之间的根本权衡。这源于稳定性条件僵化且不恰当,导致模型吸引域(RoAs)与其决策边界不匹配。为此,我们提出Zubov-Net框架,统一动态系统与决策机制。首先,将可学习的李雅普诺夫函数直接作为多类分类器,确保预设吸引域(PRoAs)与分类目标自然对齐。其次,通过将祖博夫方程重构为可微一致性损失,建立驱动祖博夫的吸引域匹配机制,实现PRoAs与真实吸引域(RoAs)的一致性。基于此,我们提出新范式,通过直接优化PRoAs来主动控制吸引域几何结构,以调和准确率与鲁棒性。理论上,最小化三重损失可保证PRoAs-RoAs一致性、非重叠性、轨迹稳定性及认证鲁棒性裕度。此外,我们建立了更紧的概率界与更低维度要求的随机凸可分性,支持李雅普诺夫函数的凸设计。
原文摘要 · Abstract (English)
Despite Neural Ordinary Differential Equations (Neural ODEs) exhibiting intrinsic robustness, existing methods often impose Lyapunov stability for formal guarantees. However, these methods still face a fundamental accuracy-robustness trade-off, which stems from a core limitation: their applied stability conditions are rigid and inappropriate, creating a mismatch between the model's regions of attraction (RoAs) and its decision boundaries. To resolve this, we propose Zubov-Net, a novel framework that unifies dynamics and decision-making. We first employ learnable Lyapunov functions directly as the multi-class classifier, ensuring the prescribed RoAs (PRoAs, defined by the Lyapunov functions) inherently align with a classification objective. Then, for aligning prescribed and true regions of attraction (PRoAs-RoAs), we establish a Zubov-driven stability region matching mechanism by reformulating Zubov's equation into a differentiable consistency loss. Building on this alignment, we introduce a new paradigm for actively controlling the geometry of RoAs by directly optimizing PRoAs to reconcile accuracy and robustness. Theoretically, we prove that minimizing the tripartite loss guarantees consistency alignment of PRoAs-RoAs, non-overlapping PRoAs, trajectory stability, and a certified robustness margin. Moreover, we establish stochastic convex separability with tighter probability bounds and lower dimensionality requirements to justify the convex design in Lyapunov functions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。