Useful Compact Representations for Data-Fitting

arXiv:2403.12206v1 Announce Type: cross
Abstract: For minimization problems without 2nd derivative information, methods that estimate Hessian matrices can be very effective. However, conventional techniques generate dense matrices that are prohibitive for large problems. Limited-memory compact representations express the dense arrays in terms of a low rank representation and have become the state-of-the-art for software implementations on large deterministic problems. We develop new compact representations that are parameterized by a choice of vectors and that reduce to existing well known formulas …

abstract arrays art arxiv become cs.lg cs.na data express generate however information low math.na math.oc memory representation software stat.co state terms type