paper-with-me

홈 › Papers

Differential Spectral Damping Gap Adaptive Regularization for Ill-Conditioned Kernel Methods

2026-06-22 · Praveg Vashishtha arxiv

Kernel methods requiring matrix inversion -- particularly Least-Squares Twin Support Vector Machines (LSTSVM) -- suffer from exponential eigenvalue decay in their system matrices, producing severely ill-conditioned problems where standard Tikhonov regularization applies uniform damping regardless of eigenvector reliability. We propose Differential Spectral Damping (DSD), a regularization formula that adapts its penalty to localized eigengap structure: preserving eigenvectors with large spectral gaps (reliable per Davis-Kahan perturbation theory) while aggressively suppressing those with small gaps (directionally corrupted beyond recovery). We motivate DSD through a principled design procedure grounded in the Davis-Kahan $\sin(Θ)$ theorem, systematically deriving the requirements for a reliability-aware damping function and selecting the exponential form for its smoothness, differentiability, and natural saturation properties. Through rigorous paired testing with fairly optimized baselines (including gradient-optimized Tikhonov receiving equal optimization opportunity), we demonstrate that DSD improves LSTSVM classification accuracy by +4.8 percentage points on real-world GINA ($d=970$, Cohen's $d = 4.49$, $p < 0.0001$), +10.4 percentage points at $d=200$, and +2.6 percentage points on Madelon ($d=500$) -- all using only principled spectral initialization while Tikhonov receives grid search. For pre-image reconstruction on manifold data, DSD ties Tikhonov at high perturbation noise ($p=0.99$) but slightly underperforms at lower noise levels; both reduce naive inversion error by $66\times$. We characterize the precise operating regime ($d \geq 100$, condition number $> 10^3$) and document where simpler methods suffice, providing practitioners with clear deployment guidance.

📄 PDF Abstract BibTeX arXiv:2606.23407

Code (0)

등록된 구현이 없습니다.

Tasks

Image Reconstruction

Similar Papers 제목 키워드 기반

Adaptive Low-Rank Regularization with Damping Sequences to Restrict Lazy Weights in Deep Networks

2021-06-17 · Mohammad Mahdi Bejani, Mehdi Ghatee

Overfitting is one of the critical problems in deep neural networks. Many regularization schemes try to prevent overfitting blindly. However, they decrease the convergence speed of training algorithms. Adaptive regulariz…

Merging Memory and Space: A State Space Neural Operator

2025-07-31 · Nodens Koren, Samuel Lanthaler arxiv

We propose the *State Space Neural Operator* (SS-NO), a compact architecture for learning solution operators of time-dependent partial differential equations (PDEs). Our formulation extends structured state space models …

An inexact Newton-Krylov algorithm for constrained diffeomorphic image registration

2014-08-27 · Andreas Mang, George Biros

We propose numerical algorithms for solving large deformation diffeomorphic image registration problems. We formulate the nonrigid image registration problem as a problem of optimal control. This leads to an infinite-dim…

Computational EfficiencyConstrained Diffeomorphic Image RegistrationImage Registration

Energy-optimal control of adaptive structures

2023-06-23 · Manuel Schaller, Amelie Zeller, Michael Böhm, Oliver Sawodny 외

Adaptive structures are equipped with sensors and actuators to actively counteract external loads such as wind. This can significantly reduce resource consumption and emissions during the life cycle compared to conventio…

Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization

2025-04-13 · NeurIPS 2021 12 · Gavin Zhang, Salar Fattahi, Richard Y. Zhang

In practical instances of nonconvex matrix factorization, the rank of the true solution $r^{\star}$ is often unknown, so the rank $r$ of the model can be overspecified as $r>r^{\star}$. This over-parameterized regime of …