Imagen de Portada

On the Optimality of the Oja's Algorithm for Online PCA

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Liang, Xin
Formato:	Preprint
Publicado:	2021
Materias:	Machine Learning Optimization and Control 62H25, 68W27, 65F15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Nearly Optimal Stochastic Approximation for Online Principal Subspace Estimation
por: Liang, Xin, et al.
Publicado: (2017)

An Eulerian approach to regularized JKO scheme with low-rank tensor decompositions for Bayesian inversion
por: Aksenov, Vitalii, et al.
Publicado: (2024)

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
por: Bergou, El Houcine, et al.
Publicado: (2023)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
por: Atenas, Felipe, et al.
Publicado: (2024)

CoMadOut -- A Robust Outlier Detection Algorithm based on CoMAD
por: Lohrer, Andreas, et al.
Publicado: (2022)

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
por: Vidyasagar, Mathukumalli
Publicado: (2025)

Where Have All the Kaczmarz Iterates Gone?
por: Bergou, El Houcine, et al.
Publicado: (2025)

Improved Convergence Factor of Windowed Anderson Acceleration for Symmetric Fixed-Point Iterations
por: Garner, Casey, et al.
Publicado: (2023)

A Unified Matrix-Spectral Framework for Stability and Interpretability in Deep Learning
por: Katende, Ronald
Publicado: (2026)

On the Connection Between Non-negative Matrix Factorization and Latent Dirichlet Allocation
por: Geiger, Benedikt, et al.
Publicado: (2024)

Reinforcement Learning with Action-Triggered Observations
por: Ryabchenko, Alexander, et al.
Publicado: (2025)

Evidence Slopes and Effective Dimension in Singular Linear Models
por: Rao, Kalyaan
Publicado: (2026)

Generalized sparsity-promoting solvers for Bayesian inverse problems: Versatile sparsifying transforms and unknown noise variances
por: Lindbloom, Jonathan, et al.
Publicado: (2024)

Convergence analysis of online algorithms for vector-valued kernel regression
por: Griebel, Michael, et al.
Publicado: (2023)

Learning nonnegative matrix factorizations from compressed data
por: Chaudhry, Abraar, et al.
Publicado: (2024)

Bayesian ICA with super-Gaussian Source Priors
por: Datta, Jyotishka, et al.
Publicado: (2024)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
por: Gupta, Swati, et al.
Publicado: (2026)

Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
por: He, Haoze, et al.
Publicado: (2024)

Deterministic computation of quantiles in a Lipschitz framework
por: Gu, Yurun, et al.
Publicado: (2024)

DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime
por: Park, Jongho, et al.
Publicado: (2023)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
por: Matti, Fabio, et al.
Publicado: (2025)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
por: Tondji, Lionel, et al.
Publicado: (2025)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
por: Lok, Jackie, et al.
Publicado: (2025)

Tensor Train Completion from Fiberwise Observations Along a Single Mode
por: Sofi, Shakir Showkat, et al.
Publicado: (2025)

Connections between convex optimization algorithms and subspace correction methods
por: Jiang, Boou, et al.
Publicado: (2025)

Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models
por: Li, Jiaqi, et al.
Publicado: (2024)

Bundle EXTRA for Decentralized Optimization
por: Liu, Haijuan, et al.
Publicado: (2026)

Federated Learning with Convex Global and Local Constraints
por: He, Chuan, et al.
Publicado: (2023)

Have ASkotch: A Neat Solution for Large-scale Kernel Ridge Regression
por: Rathore, Pratik, et al.
Publicado: (2024)

Robust Low-Rank Tensor Completion based on M-product with Weighted Correlated Total Variation and Sparse Regularization
por: Karmakar, Biswarup, et al.
Publicado: (2026)

Computing adjoint mismatch of linear maps
por: Bresch, Jonas, et al.
Publicado: (2025)

Accelerated Bayesian imaging by relaxed proximal-point Langevin sampling
por: Klatzer, Teresa, et al.
Publicado: (2023)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
por: Cai, HanQin, et al.
Publicado: (2023)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
por: Hu, Wei, et al.
Publicado: (2026)

Gaussian Ensemble Belief Propagation for Efficient Inference in High-Dimensional Systems
por: MacKinlay, Dan, et al.
Publicado: (2024)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
por: Persson, David, et al.
Publicado: (2023)

Online learning of quadratic manifolds from streaming data for nonlinear dimensionality reduction and nonlinear model reduction
por: Schwerdtner, Paul, et al.
Publicado: (2024)

On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent
por: Laumont, Rémi, et al.
Publicado: (2022)

Time-Dependent Blackwell Approachability and Application to Absorbing Games
por: Kwon, Joon, et al.
Publicado: (2023)

Pathwise Learning of Stochastic Dynamical Systems with Partial Observations
por: Yang, Nicole Tianjiao
Publicado: (2026)