Non-convex optimization for machine learning

P Jain, P Kar - Foundations and Trends® in Machine …, 2017 - nowpublishers.com
A vast majority of machine learning algorithms train their models and perform inference by
solving optimization problems. In order to capture the learning and prediction problems …

Matrix factorization techniques in machine learning, signal processing, and statistics

KL Du, MNS Swamy, ZQ Wang, WH Mow - Mathematics, 2023 - mdpi.com
Compressed sensing is an alternative to Shannon/Nyquist sampling for acquiring sparse or
compressible signals. Sparse coding represents a signal as a sparse linear combination of …

SPARSE HIGH-DIMENSIONAL REGRESSION

D Bertsimas, B Van Parys - The Annals of Statistics, 2020 - JSTOR
We present a novel binary convex reformulation of the sparse regression problem that
constitutes a new duality perspective. We devise a new cutting plane method and provide …

Does -Minimization Outperform -Minimization?

L Zheng, A Maleki, H Weng, X Wang… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
In many application areas ranging from bioinformatics to imaging, we are faced with the
following question: can we recover a sparse vector xo∈ ℝ N from its undersampled set of …

Global linear and local superlinear convergence of IRLS for non-smooth robust regression

L Peng, C Kümmerle, R Vidal - Advances in neural …, 2022 - proceedings.neurips.cc
We advance both the theory and practice of robust $\ell_p $-quasinorm regression for $ p\in
(0, 1] $ by using novel variants of iteratively reweighted least-squares (IRLS) to solve the …

Measuring progress in dictionary learning for language model interpretability with board game models

A Karvonen, B Wright, C Rager, R Angell… - arXiv preprint arXiv …, 2024 - arxiv.org
What latent features are encoded in language model (LM) representations? Recent work on
training sparse autoencoders (SAEs) to disentangle interpretable features in LM …

A simplified approach to recovery conditions for low rank matrices

S Oymak, K Mohan, M Fazel… - 2011 IEEE International …, 2011 - ieeexplore.ieee.org
Recovering sparse vectors and low-rank matrices from noisy linear measurements has been
the focus of much recent research. Various reconstruction algorithms have been studied …

Convergence and stability of iteratively re-weighted least squares algorithms

D Ba, B Babadi, PL Purdon… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
In this paper, we study the theoretical properties of iteratively re-weighted least squares
(IRLS) algorithms and their utility in sparse signal recovery in the presence of noise. We …

Distributed compressive sensing augmented wideband spectrum sharing for cognitive IoT

X Zhang, Y Ma, H Qi, Y Gao, Z Xie, Z Xie… - IEEE Internet of …, 2018 - ieeexplore.ieee.org
The increasing number of Internet of Things (IoT) objects has been a growing challenge of
the current spectrum supply. To handle this issue, the IoT devices should have cognitive …

MIMO radar 3D imaging based on combined amplitude and total variation cost function with sequential order one negative exponential form

C Ma, TS Yeo, Y Zhao, J Feng - IEEE Transactions on Image …, 2014 - ieeexplore.ieee.org
In inverse synthetic aperture radar (ISAR) imaging, a target is usually regarded as consist of
a few strong (specular) scatterers and the distribution of these strong scatterers is sparse in …