Imagen de Portada

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kümmerle, Christian, Maly, Johannes
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning Information Theory Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Outlier-robust Autocovariance Least Square Estimation via Iteratively Reweighted Least Square
por: Li, Jiahong, et al.
Publicado: (2026)

More is Less: Inducing Sparsity via Overparameterization
por: Chou, Hung-Hsu, et al.
Publicado: (2021)

Global Convergence of Iteratively Reweighted Least Squares for Robust Subspace Recovery
por: Lerman, Gilad, et al.
Publicado: (2025)

Q3R: Quadratic Reweighted Rank Regularizer for Effective Low-Rank Training
por: Ghosh, Ipsita, et al.
Publicado: (2025)

On Regularization via Early Stopping for Least Squares Regression
por: Sonthalia, Rishi, et al.
Publicado: (2024)

Iteratively Reweighted Least Squares for Phase Unwrapping
por: Dubois-Taine, Benjamin, et al.
Publicado: (2024)

On Convex Data-Driven Inverse Optimal Control for Nonlinear, Non-stationary and Stochastic Systems
por: Garrabe, Emiland, et al.
Publicado: (2023)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
por: Cui, Chengyu, et al.
Publicado: (2026)

Pessimistic Nonlinear Least-Squares Value Iteration for Offline Reinforcement Learning
por: Di, Qiwei, et al.
Publicado: (2023)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
por: Yu, Qian, et al.
Publicado: (2024)

Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements
por: Meng, Xiang, et al.
Publicado: (2026)

Iterative Pre-Conditioning for Expediting the Gradient-Descent Method: The Distributed Linear Least-Squares Problem
por: Chakrabarti, Kushal, et al.
Publicado: (2020)

Structured Sampling for Robust Euclidean Distance Geometry
por: Kundu, Chandra, et al.
Publicado: (2024)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
por: Ene, Alina, et al.
Publicado: (2025)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
por: Kundu, Chandra, et al.
Publicado: (2025)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
por: Wibisono, Andre
Publicado: (2025)

Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization
por: Wang, Hao, et al.
Publicado: (2024)

Robust Least-Squares Optimization for Data-Driven Predictive Control: A Geometric Approach
por: Bharadwaj, Shreyas, et al.
Publicado: (2025)

Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares
por: Pai, Chih-Fan, et al.
Publicado: (2026)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
por: Wang, Hao, et al.
Publicado: (2021)

Inferring Dynamic Networks from Marginals with Iterative Proportional Fitting
por: Chang, Serina, et al.
Publicado: (2024)

Convergence Rates for Gradient Descent on the Edge of Stability in Overparametrised Least Squares
por: MacDonald, Lachlan Ewen, et al.
Publicado: (2025)

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
por: Stöger, Dominik, et al.
Publicado: (2024)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
por: Shen, Wei, et al.
Publicado: (2023)

Span-Based Optimal Sample Complexity for Average Reward MDPs
por: Zurek, Matthew, et al.
Publicado: (2023)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
por: Matt, Hannes, et al.
Publicado: (2025)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
por: Ling, Shuyang
Publicado: (2021)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
por: Cai, HanQin, et al.
Publicado: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
por: Zurek, Matthew, et al.
Publicado: (2024)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
por: Liu, Yujie, et al.
Publicado: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
por: Zamir, Guy, et al.
Publicado: (2026)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
por: Foss, Mikil, et al.
Publicado: (2025)

Tight Regret Bounds for Bayesian Optimization in One Dimension
por: Scarlett, Jonathan
Publicado: (2018)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
por: Zurek, Matthew, et al.
Publicado: (2024)

Variational Inference on the Boolean Hypercube with the Quantum Entropy
por: Beyler, Eliot, et al.
Publicado: (2024)

The augmented NLP bound for maximum-entropy remote sampling
por: Ponte, Gabriel, et al.
Publicado: (2026)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
por: Shen, Wei, et al.
Publicado: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
por: Zurek, Matthew, et al.
Publicado: (2025)

On the Convergence Analysis of Muon
por: Shen, Wei, et al.
Publicado: (2025)

Adversarial Water-Filling: Theory, Algorithms and Foundation Model
por: Tong, Xindi, et al.
Publicado: (2026)