Cover Image

Rethinking PCA Through Duality

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Quan, Jan, Suykens, Johan, Patrinos, Panagiotis
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives
by: Oikonomidis, Konstantinos, et al.
Published: (2026)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, et al.
Published: (2024)

Imitation Learning from Observations: An Autoregressive Mixture of Experts Approach
by: Wang, Renzi, et al.
Published: (2024)

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems
by: Ozaslan, Ibrahim K., et al.
Published: (2024)

Dualities for non-Euclidean smoothness and strong convexity under the light of generalized conjugacy
by: Laude, Emanuel, et al.
Published: (2021)

Asynchronous Message-Passing and Zeroth-Order Optimization Based Distributed Learning with a Use-Case in Resource Allocation in Communication Networks
by: Behmandpoor, Pourya, et al.
Published: (2023)

Scaled relative graphs for pairs of operators beyond classical monotonicity
by: Quan, Jan, et al.
Published: (2025)

Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Attention-based PCA
by: Maulen-Soto, Rodrigo, et al.
Published: (2026)

Lasry-Lions Envelopes and Nonconvex Optimization: A Homotopy Approach
by: Simões, Miguel, et al.
Published: (2021)

A Deep Learning Based Resource Allocator for Communication Networks with Dynamic User Utility Demands
by: Behmandpoor, Pourya, et al.
Published: (2023)

Efficient Sparse PCA via Block-Diagonalization
by: Del Pia, Alberto, et al.
Published: (2024)

Nonlinearly preconditioned gradient flows
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Federated Structured Sparse PCA for Anomaly Detection in IoT Networks
by: Huang, Chenyi, et al.
Published: (2025)

Prescriptive PCA: Dimensionality Reduction for Two-stage Stochastic Optimization
by: He, Long, et al.
Published: (2023)

Escaping saddle points without Lipschitz smoothness: the power of nonlinear preconditioning
by: Bodard, Alexander, et al.
Published: (2025)

Anisotropic Proximal Point Algorithm
by: Laude, Emanuel, et al.
Published: (2023)

Anisotropic Proximal Gradient
by: Laude, Emanuel, et al.
Published: (2022)

Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach
by: Bodard, Alexander, et al.
Published: (2026)

Federated ADMM from Bayesian Duality
by: Möllenhoff, Thomas, et al.
Published: (2025)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
by: Del Pia, Alberto, et al.
Published: (2025)

Tuning-Free Structured Sparse PCA via Deep Unfolding Networks
by: Chen, Long, et al.
Published: (2025)

Sparse PCA With Multiple Components
by: Cory-Wright, Ryan, et al.
Published: (2022)

A Unified Kantorovich Duality for Multimarginal Optimal Transport
by: Cheryala, Yehya, et al.
Published: (2026)

Implicit Regularization Makes Overparameterized Asymmetric Matrix Sensing Robust to Perturbations
by: Wind, Johan S.
Published: (2023)

Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning
by: Li, Zihao, et al.
Published: (2024)

Learning Weakly Communicating Average-Reward CMDPs: Strong Duality and Improved Regret
by: Yu, Kihyun, et al.
Published: (2026)

Risk-Sensitive Model Predictive Control for Interaction-Aware Planning -- A Sequential Convexification Algorithm
by: Wang, Renzi, et al.
Published: (2025)

Probabilistic Safety under Arbitrary Disturbance Distributions using Piecewise-Affine Control Barrier Functions
by: Teuwen, Matisse, et al.
Published: (2025)

How to Set $β_1, β_2$ in Adam: An Online Learning Perspective
by: Nguyen, Quan
Published: (2025)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Forward-backward splitting under the light of generalized convexity
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

On the Regularity of Generalized Conjugate Functions
by: Oikonomidis, Konstantinos, et al.
Published: (2026)

Improved convergence rates for the Difference-of-Convex algorithm
by: Rotaru, Teodor, et al.
Published: (2024)

Rethinking the Capacity of Graph Neural Networks for Branching Strategy
by: Chen, Ziang, et al.
Published: (2024)

Hidden Convexity of Fair PCA and Fast Solver via Eigenvalue Optimization
by: Shen, Junhui, et al.
Published: (2025)