It is proved that the extracted trend is invariant across representations, and a closed-form Bregman-type divergence quantifying their disagreement under a shared coefficient vector is obtained, and this divergence vanishes as $\lambda\to\infty$.
Abstract
We derive the complete duality theory underlying the Hodrick--Prescott filter, whose rank-deficient second-difference penalty admits infinitely many equivalent trend representations via generalized inverses. Constructing two canonical choices---the Moore--Penrose-based \emph{B-representation} and an alternative \emph{A-representation}---we prove that the extracted trend is invariant across representations, obtain a closed-form Bregman-type divergence quantifying their disagreement under a shared coefficient vector, and show this divergence vanishes as $\lambda\to\infty$. We further mollify the non-smooth $\ell_1$ trend filter with a compactly supported biweight kernel to obtain a closed-form $C^3$ \emph{Convolutional LASSO} that restores Newton-type quadratic convergence without sacrificing the kink- setecting character of $\ell_1$ regularization. Theoretical results are verified numerically and benchmarked against ADMM/IRLS on NVIDIA's 2013--2018 daily closing prices, where the sparse filter isolates genuine growth-regime breaks---chiefly the November 2016 post-earnings acceleration---cleanly separated from the smooth $L_2$ trend.
A unified non-linear regularization framework for high-dimensional $M$-estimation, encompassing both linear models and Cox's proportional hazards models, and establishes a unified oracle equivalence for both model classes under a liberated micro-penalty scaling regime.
Gradient descent on a factored model $W = UV^\top$ is implicitly biased toward low-rank solutions, while Adam, starting from the same small initialization, is not. We trace the difference to the gauge symmetry of the loss, its invariance under $(U, V) \mapsto (UQ, VQ)$. Gradient flow's low-rank mechanism is available t...
Divergence-based regularization and Sharpness-Aware Minimization (SAM) are two prominent approaches for improving generalization in deep learning, both motivated by robustness to perturbations. However, their relationship has remained largely unexplored. Building on classical second-order expansions of $f$-divergences,...
An exact distance identity for two coupled updates is derived and approximate non-expansiveness of the common-example map is proved, with a quadratic defect only when the two latent margins straddle zero.
A high-probability uniform ($L^{\infty}$) recovery guarantee that jointly controls approximation and statistical errors while enjoying an optimization error of zero is introduced.
Rui-Yang Hong, Hrad Ghoukasian, Anastasis Kratsios· 0 citations
It is shown that adding a free affine skip connection leaves these function-space solutions unchanged but fundamentally improves the parameter-space landscape: every KKT point of the constrained problem becomes globally optimal, whereas suboptimal KKT points can occur without the skip connection.
Karolina Drabik, Ben Lewis, Antoni Puch et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.