Cover Image

Faster Randomized Methods for Orthogonality Constrained Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shustin, Boris, Avron, Haim
Format:	Preprint
Published:	2021
Subjects:	Numerical Analysis Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Higher Order Reduced Rank Regression
by: Greenberg, Leia, et al.
Published: (2025)

Nonlinear Dimensionality Reduction Techniques for Bayesian Optimization
by: Long, Luo, et al.
Published: (2025)

Dimensionality Reduction Techniques for Global Bayesian Optimisation
by: Long, Luo, et al.
Published: (2024)

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

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
by: Yuan, Ganzhao
Published: (2023)

Provably Faster Gradient Descent via Long Steps
by: Grimmer, Benjamin
Published: (2023)

Beyond Muon: MUD (MomentUm Decorrelation) for Faster Transformer Training
by: Southworth, Ben S., et al.
Published: (2026)

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

Acceleration Methods
by: d'Aspremont, Alexandre, 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)

Learning Regularization Functionals for Inverse Problems: A Comparative Study
by: Hertrich, Johannes, et al.
Published: (2025)

Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton
by: Niu, Chengmei, et al.
Published: (2025)

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

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

Anderson Acceleration in Nonsmooth Problems: Local Convergence via Active Manifold Identification
by: Li, Kexin, et al.
Published: (2024)

Adaptive Proximal Gradient Method for Convex Optimization
by: Malitsky, Yura, et al.
Published: (2023)

Constrained Density Estimation via Optimal Transport
by: Hu, Yinan, et al.
Published: (2026)

On the Role of Initialization on the Implicit Bias in Deep Linear Networks
by: Gruber, Oria, et al.
Published: (2024)

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

Online Statistical Inference of Constrained Stochastic Optimization via Random Scaling
by: Du, Xinchen, et al.
Published: (2025)

KANtrol: A Physics-Informed Kolmogorov-Arnold Network Framework for Solving Multi-Dimensional and Fractional Optimal Control Problems
by: Aghaei, Alireza Afzal
Published: (2024)

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
by: Farzin, Amir Ali, et al.
Published: (2026)

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

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
by: Yuan, Ganzhao
Published: (2026)

A Trust-Region Interior-Point Stochastic Sequential Quadratic Programming Method
by: Fang, Yuchen, et al.
Published: (2026)

Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes
by: Chhaibi, Reda, et al.
Published: (2025)

Modified Loss of Momentum Gradient Descent: Fine-Grained Analysis
by: Cattaneo, Matias D., et al.
Published: (2025)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
by: Xia, Lu, et al.
Published: (2023)

A Natural Primal-Dual Hybrid Gradient Method for Adversarial Neural Network Training on Solving Partial Differential Equations
by: Liu, Shu, et al.
Published: (2024)

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

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

Randomized Kaczmarz Methods with Beyond-Krylov Convergence
by: Dereziński, Michał, et al.
Published: (2025)

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

Block Matrix and Tensor Randomized Kaczmarz Methods for Linear Feasibility Problems
by: Zhang, Minxin, et al.
Published: (2024)

Solving Dense Linear Systems Faster Than via Preconditioning
by: Dereziński, Michał, et al.
Published: (2023)

DeepMartingale: Duality of the Optimal Stopping Problem with Expressivity and High-Dimensional Hedging
by: Ye, Junyan, et al.
Published: (2025)

Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
by: Dereziński, Michał, et al.
Published: (2024)

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