Cover Image

Solving Sparse \& High-Dimensional-Output Regression via Compression

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Renyuan, Chen, Zhehui, Wang, Guanyi
Format:	Preprint
Published:	2024
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

Screening Cut Generation for Sparse Ridge Regression
by: Tan, Haozhe, et al.
Published: (2025)

Risk-sensitive Markov Decision Process and Learning under General Utility Functions
by: Wu, Zhengqi, et al.
Published: (2023)

CLion: Efficient Cautious Lion Optimizer with Enhanced Generalization
by: Huang, Feihu, et al.
Published: (2026)

HomeAdam: Adam and AdamW Algorithms Sometimes Go Home to Obtain Better Provable Generalization
by: Huang, Feihu, et al.
Published: (2026)

Fast Policy Learning for Linear Quadratic Control with Entropy Regularization
by: Guo, Xin, et al.
Published: (2023)

A Novel Approach in Solving Stochastic Generalized Linear Regression via Nonconvex Programming
by: Anh, Vu Duc, et al.
Published: (2024)

Stochastic Control for Fine-tuning Diffusion Models: Optimality, Regularity, and Convergence
by: Han, Yinbin, et al.
Published: (2024)

Policy Gradient Converges to the Globally Optimal Policy for Nearly Linear-Quadratic Regulators
by: Han, Yinbin, et al.
Published: (2023)

Scalable Bi-causal Optimal Transport via KL Relaxation and Policy Gradients
by: Cao, Haoyang, et al.
Published: (2026)

Optimal Cross-Validation for Sparse Linear Regression
by: Cory-Wright, Ryan, et al.
Published: (2023)

Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics
by: Ang, Andersen, et al.
Published: (2021)

Model-Free Output Feedback Stabilization via Policy Gradient Methods
by: Zhang, Ankang, et al.
Published: (2026)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
by: Chen, Hao, et al.
Published: (2026)

The Optimality of (Accelerated) SGD for High-Dimensional Quadratic Optimization
by: Zhang, Haihan, et al.
Published: (2024)

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

Inference of Utilities and Time Preference in Sequential Decision-Making
by: Cao, Haoyang, et al.
Published: (2024)

Adaptive Partitioning and Learning for Stochastic Control of Diffusion Processes
by: Jin, Hanqing, et al.
Published: (2025)

Decentralized Sparse Linear Regression via Gradient-Tracking: Linear Convergence and Statistical Guarantees
by: Maros, Marie, et al.
Published: (2022)

Exact Instance Compression for Convex Empirical Risk Minimization via Color Refinement
by: Zhu, Bryan, et al.
Published: (2026)

Robust Multi-Dimensional Scaling via Accelerated Alternating Projections
by: Deng, Tong, et al.
Published: (2025)

Dynamics of Stochastic Momentum with Sparse Updates in High Dimensions
by: Everett, Katie, et al.
Published: (2026)

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

End-to-End Training of High-Dimensional Optimal Control with Implicit Hamiltonians via Jacobian-Free Backpropagation
by: Gelphman, Eric, et al.
Published: (2025)

Sparse Transformer Architectures via Regularized Wasserstein Proximal Operator with $L_1$ Prior
by: Han, Fuqun, et al.
Published: (2025)

A Computational Method for Solving the Stochastic Joint Replenishment Problem in High Dimensions
by: Ata, Barış, et al.
Published: (2025)

Comparison of High-Dimensional Bayesian Optimization Algorithms on BBOB
by: Santoni, Maria Laura, et al.
Published: (2023)

Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
by: Meinhardt, Georg, et al.
Published: (2024)

How Does the ReLU Activation Affect the Implicit Bias of Gradient Descent on High-dimensional Neural Network Regression?
by: Lai, Kuo-Wei, et al.
Published: (2026)

Distributionally and Adversarially Robust Logistic Regression via Intersecting Wasserstein Balls
by: Selvi, Aras, et al.
Published: (2024)

Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees
by: Chen, Chuyan, et al.
Published: (2025)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
by: Zhang, Huaqing, et al.
Published: (2024)

High-Dimensional Bayesian Optimization Using Both Random and Supervised Embeddings
by: Priem, Rémy, et al.
Published: (2025)

An Ensemble Score Filter for Tracking High-Dimensional Nonlinear Dynamical Systems
by: Bao, Feng, et al.
Published: (2023)

Splat Regression Models
by: Daniels, Mara, et al.
Published: (2025)

Online Learning of Kalman Filtering: From Output to State Estimation
by: Ye, Lintao, et al.
Published: (2026)

Compressed Regression over Adaptive Networks
by: Carpentiero, Marco, et al.
Published: (2023)

Gradient Flow Polarizes Softmax Outputs towards Low-Entropy Solutions
by: Varre, Aditya, et al.
Published: (2026)

Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
by: Mukhopadhyay, Samrat, et al.
Published: (2025)

First-Order Sparse Convex Optimization: Better Rates with Sparse Updates
by: Garber, Dan
Published: (2025)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization
by: Liu, Wei, et al.
Published: (2025)