betaFeedback

WorksMathematics

Smoothing Bias and Direction Recovery at Boundary Minima of the Nuclear Norm along Matrix Lines

Abstract

We study optimal matrix directions associated with minimizing ∥G+λΘ∥∗\|G+λΘ\|_*, the nuclear norm along a fixed affine line of real matrices with scalar multiplier λλ. At a rank-deficient minimum, the compact polar factor can violate the tangency constraint even at the minimizing multiplier. Spectral smoothing gives a continuous scalar equation for tangency. We quantify its bias at a unique boundary minimum, where exactly one one-sided derivative vanishes. An orthogonal block decomposition shows that pseudo-Huber smoothing with scale δδ shifts the multiplier by exact order δ2/3δ^{2/3} as δ→0δ\to0. The Frobenius error relative to the minimum-Frobenius-norm optimal direction has exact order δ1/3δ^{1/3} when some singular values vanish at exactly second order in the multiplier displacement, and δ2/3δ^{2/3} otherwise. A sharp rank bound rules out the slower rate when ΘΘ has rank at most two. Huber smoothing gives an error of exact order δδ for the same limiting direction. Convergent expansions in powers of δ1/3δ^{1/3} also yield a three-scale extrapolation with O(δ)O(δ) error after restoring feasibility.

Paper details

vlnc:W_pkuvmvxu
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…