Cover Image

Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Niu, Chengmei, Liao, Zhenyu, Ling, Zenan, Mahoney, Michael W.
Format:	Preprint
Published:	2025
Subjects:	Numerical Analysis Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models
by: Fang, Yuchen, et al.
Published: (2024)

A distributed semismooth Newton based augmented Lagrangian method for distributed optimization
by: Ma, Qihao, et al.
Published: (2026)

Muon is Not That Special: Random or Inverted Spectra Work Just as Well
by: Shumaylov, Zakhar, et al.
Published: (2026)

Cubic regularized subspace Newton for non-convex optimization
by: Zhao, Jim, et al.
Published: (2024)

Debiasing Random Oblique Projections for Subsampled OLS and Fast CUR in High Dimensions
by: Niu, Chengmei, et al.
Published: (2026)

Random Subspace Cubic-Regularization Methods, with Applications to Low-Rank Functions
by: Cartis, Coralia, et al.
Published: (2025)

A Gauss-Newton Approach for Min-Max Optimization in Generative Adversarial Networks
by: Mishra, Neel, et al.
Published: (2024)

RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees
by: Laufer, Eilon Vaknin, et al.
Published: (2025)

Online Covariance Matrix Estimation in Sketched Newton Methods
by: Kuang, Wei, et al.
Published: (2025)

PRISM: Distribution-free Adaptive Computation of Matrix Functions for Accelerating Neural Network Training
by: Yang, Shenghao, et al.
Published: (2026)

Faster Randomized Methods for Orthogonality Constrained Problems
by: Shustin, Boris, et al.
Published: (2021)

Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size
by: Dereziński, Michał, et al.
Published: (2026)

Minimisation of Submodular Functions Using Gaussian Zeroth-Order Random Oracles
by: Farzin, Amir Ali, et al.
Published: (2025)

Worth Their Weight: Randomized and Regularized Block Kaczmarz Algorithms without Preprocessing
by: Goldshlager, Gil, et al.
Published: (2025)

Nonlinear Assimilation via Score-based Sequential Langevin Sampling
by: Ding, Zhao, et al.
Published: (2024)

Accuracy of Discretely Sampled Stochastic Policies in Continuous-time Reinforcement Learning
by: Jia, Yanwei, et al.
Published: (2025)

Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods
by: O'Leary-Roseberry, Thomas, et al.
Published: (2024)

Stochastic Langevin Differential Inclusions with Applications to Machine Learning
by: Difonzo, Fabio V., et al.
Published: (2022)

Shape Derivative-Informed Neural Operators with Application to Risk-Averse Shape Optimization
by: Gong, Xindi, et al.
Published: (2026)

Generalization Bounds for Sparse Random Feature Expansions
by: Hashemi, Abolfazl, et al.
Published: (2021)

Symmetric Rank-One Quasi-Newton Methods for Deep Learning Using Cubic Regularization
by: Ranganath, Aditya, et al.
Published: (2025)

ZORMS-LfD: Learning from Demonstrations with Zeroth-Order Random Matrix Search
by: Dry, Olivia, et al.
Published: (2025)

A second-order method landing on the Stiefel manifold via Newton$\unicode{x2013}$Schulz iteration
by: Xiong, Xinhui, et al.
Published: (2026)

Natural Riemannian gradient for learning functional tensor networks
by: Klug, Nikolas, et al.
Published: (2026)

On the Stability Connection Between Discrete-Time Algorithms and Their Resolution ODEs: Applications to Min-Max Optimisation
by: Farzin, Amir Ali, et al.
Published: (2026)

Backtracking New Q-Newton's method, Newton's flow, Voronoi's diagram and Stochastic root finding
by: Fornaess, John Erik, et al.
Published: (2024)

Optimizing Sparse Generalized Singular Vectors for Feature Selection in Proximal Support Vector Machines with Application to Breast and Ovarian Cancer Detection
by: Ugwu, Ugochukwu O., et al.
Published: (2024)

Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2025)

Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
by: Shen, Weiping, et al.
Published: (2026)

Scalable Acceleration for Classification-Based Derivative-Free Optimization
by: Han, Tianyi, et al.
Published: (2023)

Why is Normalization Preferred? A Worst-Case Complexity Theory for Stochastically Preconditioned SGD under Heavy-Tailed Noise
by: Fang, Yuchen, et al.
Published: (2026)

Learning rate adaptive stochastic gradient descent optimization methods: numerical simulations for deep learning methods for partial differential equations and convergence analyses
by: Dereich, Steffen, et al.
Published: (2024)

On the numerical reliability of nonsmooth autodiff: a MaxPool case study
by: Boustany, Ryan
Published: (2024)

Error Feedback Can Accurately Compress Preconditioners
by: Modoranu, Ionut-Vlad, et al.
Published: (2023)

Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
by: Li, Bowen, et al.
Published: (2023)

State-Dependent Lyapunov Method for Rank-1 Matrix Factorization
by: Moon, Jaehong
Published: (2026)

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
by: Zhu, Linglingzhi, et al.
Published: (2026)

Subhomogeneous Deep Equilibrium Models
by: Sittoni, Pietro, et al.
Published: (2024)

Solving Elliptic Optimal Control Problems via Neural Networks and Optimality System
by: Dai, Yongcheng, et al.
Published: (2023)

Flattened one-bit stochastic gradient descent: compressed distributed optimization with controlled variance
by: Stollenwerk, Alexander, et al.
Published: (2024)