English
Related papers

Related papers: Parameter optimization for low-rank matrix recover…

200 papers

We propose a new algorithm for hyperparameter selection in machine learning algorithms. The algorithm is a novel modification of Harmonica, a spectral hyperparameter selection approach using sparse recovery methods. In particular, we show…

Machine Learning · Computer Science 2019-04-26 Minsu Cho , Chinmay Hegde

Hyperparameter optimization (HPO) is an important step in machine learning (ML) model development, but common practices are archaic -- primarily relying on manual or grid searches. This is partly because adopting advanced HPO algorithms…

Machine Learning · Computer Science 2024-02-08 Sungduk Yu , Mike Pritchard , Po-Lun Ma , Balwinder Singh , Sam Silva

This paper addresses sparse signal reconstruction under various types of structural side constraints with applications in multi-antenna systems. Side constraints may result from prior information on the measurement system and the sparse…

Information Retrieval · Computer Science 2021-06-18 Khaled Ardah , Martin Haardt , Tianyi Liu , Frederic Matter , Marius Pesavento , Marc E. Pfetsch

Low rank matrix recovery problems, including matrix completion and matrix sensing, appear in a broad range of applications. In this work we present GNMR -- an extremely simple iterative algorithm for low rank matrix recovery, based on a…

Optimization and Control · Mathematics 2022-04-28 Pini Zilber , Boaz Nadler

Signal recovery from nonlinear measurements involves solving an iterative optimization problem. In this paper, we present a framework to optimize the sensing parameters to improve the quality of the signal recovered by the given iterative…

Image and Video Processing · Electrical Eng. & Systems 2020-06-09 Zikui Cai , Rakib Hyder , M. Salman Asif

Many real world datasets subsume a linear or non-linear low-rank structure in a very low-dimensional space. Unfortunately, one often has very little or no information about the geometry of the space, resulting in a highly under-determined…

Computer Vision and Pattern Recognition · Computer Science 2016-05-27 Nauman Shahid , Nathanael Perraudin , Pierre Vandergheynst

We propose a first-order method for convex optimization, where instead of being restricted to the gradient from a single parameter, gradients from multiple parameters can be used during each step of gradient descent. This setup is…

Machine Learning · Computer Science 2023-02-08 Yash Chandak , Shiv Shankar , Venkata Gandikota , Philip S. Thomas , Arya Mazumdar

We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an $m\times n$ rank $r$ matrix from $p < mn$ number of linear measurements. The…

Numerical Analysis · Mathematics 2016-04-12 Ke Wei , Jian-Feng Cai , Tony F. Chan , Shingyu Leung

Standard regularization methods that are used to compute solutions to ill-posed inverse problems require knowledge of the forward model. In many real-life applications, the forward model is not known, but training data is readily available.…

Numerical Analysis · Mathematics 2015-06-19 Julianne Chung , Matthias Chung

The choice of the sensing matrix is crucial in compressed sensing. Random Gaussian sensing matrices satisfy the restricted isometry property, which is crucial for solving the sparse recovery problem using convex optimization techniques.…

Signal Processing · Electrical Eng. & Systems 2023-12-29 Kartheek Kumar Reddy Nareddy , Abijith Jagannath Kamath , Chandra Sekhar Seelamantula

Reduced-rank approach has been used for decades in robust linear estimation of both deterministic and random vector of parameters in linear model y=Hx+\sqrt{epsilon}n. In practical settings, estimation is frequently performed under…

Optimization and Control · Mathematics 2024-08-05 Tomasz Piotrowski , Isao Yamada

Low rank recovery problems have been a subject of intense study in recent years. While the rank function is useful for regularization it is difficult to optimize due to its non-convexity and discontinuity. The standard remedy for this is to…

Optimization and Control · Mathematics 2021-08-17 Marcus Carlsson , Daniele Gerosa , Carl Olsson

Random projection has been widely used in data classification. It maps high-dimensional data into a low-dimensional subspace in order to reduce the computational cost in solving the related optimization problem. While previous studies are…

Machine Learning · Computer Science 2014-02-24 Lijun Zhang , Mehrdad Mahdavi , Rong Jin , Tianbao Yang , Shenghuo Zhu

To accelerate MRI, the field of compressed sensing is traditionally concerned with optimizing the image quality after a partial undersampling of the measurable $\textit{k}$-space. In our work, we propose to change the focus from the quality…

Image and Video Processing · Electrical Eng. & Systems 2022-11-15 Artem Razumov , Oleg Y. Rogov , Dmitry V. Dylov

Substantial progress has been made recently on developing provably accurate and efficient algorithms for low-rank matrix factorization via nonconvex optimization. While conventional wisdom often takes a dim view of nonconvex optimization…

Machine Learning · Computer Science 2019-10-23 Yuejie Chi , Yue M. Lu , Yuxin Chen

We give a simple, fast algorithm for hyperparameter optimization inspired by techniques from the analysis of Boolean functions. We focus on the high-dimensional regime where the canonical example is training a neural network with a large…

Machine Learning · Computer Science 2018-01-23 Elad Hazan , Adam Klivans , Yang Yuan

Phase retrieval refers to a classical nonconvex problem of recovering a signal from its Fourier magnitude measurements. Inspired by the compressed sensing technique, signal sparsity is exploited in recent studies of phase retrieval to…

Computational Physics · Physics 2013-02-04 Zai Yang , Cishen Zhang , Lihua Xie

Magnetic resonance imaging (MRI) is an essential medical tool with inherently slow data acquisition process. Slow acquisition process requires patient to be long time exposed to scanning apparatus. In recent years significant efforts are…

Computer Vision and Pattern Recognition · Computer Science 2015-03-05 Jelena Badnjar

We study matrix estimation problems arising in reinforcement learning (RL) with low-rank structure. In low-rank bandits, the matrix to be recovered specifies the expected arm rewards, and for low-rank Markov Decision Processes (MDPs), it…

Machine Learning · Computer Science 2023-10-31 Stefan Stojanovic , Yassir Jedra , Alexandre Proutiere

In this paper, we consider the problem of low-rank phase retrieval whose objective is to estimate a complex low-rank matrix from magnitude-only measurements. We propose a hierarchical prior model for low-rank phase retrieval, in which a…

Machine Learning · Statistics 2018-11-06 Kaihui Liu , Jiayi Wang , Zhengli Xing , Linxiao Yang , Jun Fang