Cover Image

Eigen-componentwise convergence of SGD on quadratic programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Lehan, Nakatsukasa, Yuji
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Twice is enough for dangerous eigenvalues
by: Horning, Andrew, et al.
Published: (2020)

Efficient Function Approximation Under Heteroskedastic Noise
by: Nakatsukasa, Yuji, et al.
Published: (2025)

Matrix Perturbation Theory in the Tangent Space of Isospectral Matrices
by: Hrobat, Francesco, et al.
Published: (2026)

Instability of the Sherman-Morrison formula and stabilization by iterative refinement
by: Hashemi, Behnam, et al.
Published: (2025)

Computing the Zeros of a Holomorphic Function Using Quadrature-Based Subdivision and Rational Approximation of the Logarithmic Derivative
by: Bowhay, Jake, et al.
Published: (2025)

Polynomial approximation of noisy functions
by: Matsuda, Takeru, et al.
Published: (2024)

Adaptive LSQR Preconditioning from One Small Sketch
by: Huh, Jung Eun, et al.
Published: (2026)

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling
by: Jones, Eleanor, et al.
Published: (2025)

Applications of AAA rational approximation
by: Nakatsukasa, Yuji, et al.
Published: (2025)

Accuracy and Stability of CUR decompositions with Oversampling
by: Park, Taejun, et al.
Published: (2024)

Low-rank approximation of parameter-dependent matrices via CUR decomposition
by: Park, Taejun, et al.
Published: (2024)

Convergence and Near-optimal Sampling for Multivariate Function Approximations in Irregular Domains via Vandermonde with Arnoldi
by: Zhu, Wenqi, et al.
Published: (2023)

Finding accurate eigenvalues and eigenvectors of positive semi-definite matrices given a subspace
by: Nakatsukasa, Yuji, et al.
Published: (2026)

Approximating Sparse Matrices and their Functions using Matrix-vector products
by: Park, Taejun, et al.
Published: (2023)

A Sherman--Morrison--Woodbury approach to solving least squares problems with low-rank updates
by: Güttel, Stefan, et al.
Published: (2024)

Towards Universal Convergence of Backward Error in Linear System Solvers
by: Dereziński, Michał, et al.
Published: (2026)

Stable algorithms for general linear systems by preconditioning the normal equations
by: Epperly, Ethan N., et al.
Published: (2025)

Mixed precision accumulation for neural network inference guided by componentwise forward error analysis
by: Arar, El-Mehdi El, et al.
Published: (2025)

Accuracy and componentwise accuracy in multilinear PageRank
by: Kalyani, Mehdi Najafi, et al.
Published: (2025)

Numerical Stability of the Nyström Method
by: Bucci, Alberto, et al.
Published: (2025)

Fast randomized numerical rank estimation for numerically low-rank matrices
by: Meier, Maike, et al.
Published: (2021)

Analysis of the Picard-Newton iteration for the Navier-Stokes equations: global stability and quadratic convergence
by: Pollock, Sara, et al.
Published: (2024)

Randomized flexible Krylov methods for $\ell_p$ regularization
by: Landman, Malena Sabaté, et al.
Published: (2025)

Sharp error bounds for approximate eigenvalues and singular values from subspace methods
by: Haas, Irina-Beatrice, et al.
Published: (2025)

Adaptive projected SOR algorithms for nonnegative quadratic programming
by: Miyatake, Yuto, et al.
Published: (2021)

Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
by: Epperly, Ethan N., et al.
Published: (2026)

Asymptotic quadratic convergence of the Gauss-Newton method for complex phase retrieval
by: Huang, Meng
Published: (2024)

EigenWave: An Optimal O(N) Method for Computing Eigenvalues and Eigenvectors by Time-Filtering the Wave Equation
by: Appelo, Daniel, et al.
Published: (2025)

Eig-PIELM: A Mesh-Free Approach for Efficient Eigen-Analysis with Physics-Informed Extreme Learning Machines
by: Mishra, Rishi, et al.
Published: (2025)

Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
by: Lazzarino, Lorenzo, et al.
Published: (2024)

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
by: Dong, Yijun, et al.
Published: (2022)

A Short Note on Batch-efficient Divide-and-Conquer Algorithm for EigenDecomposition
by: Song, Yue
Published: (2026)

A minimax method for the spectral fractional Laplacian and related evolution problems
by: Carrillo, José A., et al.
Published: (2025)

Near-optimal convergence of the full orthogonalization method
by: Chen, Tyler, et al.
Published: (2024)

Fast Rank Adaptive CUR via a Recycled Small Sketch
by: Pritchard, Nathaniel, et al.
Published: (2025)

Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
by: Epperly, Ethan N., et al.
Published: (2024)

A multilevel sketch-and-solve method for overdetermined least squares problems
by: Haas, Irina-Beatrice, et al.
Published: (2026)

Preconditioned normal equations for solving discretised partial differential equations
by: Lazzarino, Lorenzo, et al.
Published: (2025)

Rate of convergence of Thresholding Greedy Algorithms
by: Temlyakov, V. N.
Published: (2023)

Some convergence analysis for multicontinuum homogenization
by: Leung, Wing Tat
Published: (2024)