惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

D
Docker
月光博客
月光博客
B
Blog RSS Feed
C
Check Point Blog
WordPress大学
WordPress大学
T
Tailwind CSS Blog
GbyAI
GbyAI
H
Help Net Security
Y
Y Combinator Blog
I
InfoQ
雷峰网
雷峰网
阮一峰的网络日志
阮一峰的网络日志
小众软件
小众软件
美团技术团队
博客园 - 三生石上(FineUI控件)
MongoDB | Blog
MongoDB | Blog
Jina AI
Jina AI
A
About on SuperTechFans
G
Google Developers Blog
爱范儿
爱范儿
F
Fortinet All Blogs
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
U
Unit 42
人人都是产品经理
人人都是产品经理

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Computing Saddle Points in Stiff Problems via a Precondit...
[Submitted on 26 Mar 2026 (v1), last revised 22 May 2026 (this v · 2026-05-25 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:High-index saddle dynamics (HiSD) is an effective approach for computing saddle points of a prescribed Morse index and constructing solution landscapes for complex nonlinear systems. However, for problems with ill-conditioned Hessians arising from fine discretizations or stiff potentials, the efficiency of standard HiSD deteriorates as its convergence rate worsens with the spectral condition number $\kappa$. To address this issue, we propose a preconditioned HiSD (p-HiSD) framework that reformulates the continuous dynamics within a Riemannian metric induced by a symmetric positive definite preconditioner $M$. By generalizing orthogonal reflections and unstable-subspace tracking to the $M$-inner product, the proposed scheme modifies the geometry of the saddle-search dynamics while remaining computationally efficient. Rigorous theoretical analysis confirms that the equilibria and their Morse indices are invariant under this metric. Furthermore, we establish the local exponential stability of the continuous dynamics and prove a discrete linear convergence rate governed by the preconditioned condition number $\kappa_M$. Consequently, the iteration complexity is sharply reduced from $O(\kappa\log(1/\epsilon))$ to $O(\kappa_M\log(1/\epsilon))$. We validate the method on nine numerical tests spanning finite-dimensional model problems, stiff lattice systems, and PDE discretizations. The results demonstrate that p-HiSD resolves stiffness-induced convergence failures, permits substantially larger step sizes, and significantly reduces iteration counts.

Submission history

From: Hua Su [view email]
[v1] Thu, 26 Mar 2026 12:38:49 UTC (655 KB)
[v2] Fri, 22 May 2026 09:57:28 UTC (703 KB)