English
Related papers

Related papers: Sketching for Simultaneously Sparse and Low-Rank C…

200 papers

Sketching is used as a ubiquitous tool of expression by novices and experts alike. In this thesis I explore two methods that help a system provide a geometric machine-understanding of sketches, and in-turn help a user accomplish a…

Computer Vision and Pattern Recognition · Computer Science 2022-04-15 Raghav Brahmadesam Venkataramaiyer

We adapt a well known streaming algorithm for approximating item frequencies to the matrix sketching setting. The algorithm receives the rows of a large matrix $A \in \R^{n \times m}$ one after the other in a streaming fashion. It maintains…

Data Structures and Algorithms · Computer Science 2012-07-12 Edo Liberty

We introduce a new approach for applying sampling-based sketches to two and three mode tensors. We illustrate our technique to construct sketches for the classical problems of $\ell_0$ sampling and producing $\ell_1$ embeddings. In both…

Data Structures and Algorithms · Computer Science 2024-06-12 William Swartworth , David P. Woodruff

This article focuses on drawing computationally-efficient predictive inference from Gaussian process (GP) regressions with a large number of features when the response is conditionally independent of the features given the projection to a…

Methodology · Statistics 2024-09-27 Samuel Gailliot , Rajarshi Guhaniyogi , Roger D. Peng

In this paper, we consider the Group Lasso estimator of the covariance matrix of a stochastic process corrupted by an additive noise. We propose to estimate the covariance matrix in a high-dimensional setting under the assumption that the…

Statistics Theory · Mathematics 2011-10-26 Jérémie Bigot , Rolando Biscay , Jean-Michel Loubes , Lilian Muniz Alvarez

The topic of recovery of a structured model given a small number of linear observations has been well-studied in recent years. Examples include recovering sparse or group-sparse vectors, low-rank matrices, and the sum of sparse and low-rank…

Information Theory · Computer Science 2014-07-28 Samet Oymak , Amin Jalali , Maryam Fazel , Yonina C. Eldar , Babak Hassibi

Given a symmetric matrix $A$, we show from the simple sketch $GAG^T$, where $G$ is a Gaussian matrix with $k = O(1/\epsilon^2)$ rows, that there is a procedure for approximating all eigenvalues of $A$ simultaneously to within $\epsilon…

Data Structures and Algorithms · Computer Science 2023-04-20 William Swartworth , David P. Woodruff

We propose a Bayesian methodology for estimating spiked covariance matrices with jointly sparse structure in high dimensions. The spiked covariance matrix is reparametrized in terms of the latent factor model, where the loading matrix is…

Methodology · Statistics 2019-01-31 Fangzheng Xie , Yanxun Xu , Carey E. Priebe , Joshua Cape

Multivariate density estimation is of great interest in various scientific and engineering disciplines. In this work, we introduce a new framework called Variance-Reduced Sketching (VRS), specifically designed to estimate multivariate…

Machine Learning · Statistics 2025-05-05 Yifan Peng , Yuehaw Khoo , Daren Wang

Covariance regression offers an effective way to model the large covariance matrix with the auxiliary similarity matrices. In this work, we propose a sparse covariance regression (SCR) approach to handle the potentially high-dimensional…

Methodology · Statistics 2024-10-17 Yuan Gao , Zhiyuan Zhang , Zhanrui Cai , Xuening Zhu , Tao Zou , Hansheng Wang

Estimation of covariance matrices is a fundamental problem in multivariate statistics. Recently, growing efforts have focused on incorporating covariate effects into these matrices, facilitating subject-specific estimation. Despite these…

Methodology · Statistics 2026-04-10 Rakheon Kim , Emma Jingfei Zhang

A classical problem in matrix computations is the efficient and reliable approximation of a given matrix by a matrix of lower rank. The truncated singular value decomposition (SVD) is known to provide the best such approximation for any…

Numerical Analysis · Mathematics 2014-08-12 Ming Gu

We study how well one can recover sparse principal components of a data matrix using a sketch formed from a few of its elements. We show that for a wide class of optimization problems, if the sketch is close (in the spectral norm) to the…

Machine Learning · Computer Science 2015-03-16 Abhisek Kundu , Petros Drineas , Malik Magdon-Ismail

Linear sketching algorithms have been widely used for processing large-scale distributed and streaming datasets. Their popularity is largely due to the fact that linear sketches can be naturally composed in the distributed model and be…

Data Structures and Algorithms · Computer Science 2017-03-28 Jiecao Chen , Qin Zhang

Randomized algorithms in numerical linear algebra can be fast, scalable and robust. This paper examines the effect of sketching on the right singular vectors corresponding to the smallest singular values of a tall-skinny matrix. We analyze…

Numerical Analysis · Mathematics 2023-05-29 Yuji Nakatsukasa , Taejun Park

We introduce co-occurring directions sketching, a deterministic algorithm for approximate matrix product (AMM), in the streaming model. We show that co-occuring directions achieves a better error bound for AMM than other randomized and…

Machine Learning · Computer Science 2016-10-26 Youssef Mroueh , Etienne Marcheret , Vaibhava Goel

We study the problem of estimating a temporally varying coefficient and varying structure (VCVS) graphical model underlying nonstationary time series data, such as social states of interacting individuals or microarray expression profiles…

Machine Learning · Statistics 2010-12-21 Mladen Kolar , Eric P. Xing

It has been proposed that complex populations, such as those that arise in genomics studies, may exhibit dependencies among observations as well as among variables. This gives rise to the challenging problem of analyzing unreplicated…

Machine Learning · Statistics 2018-06-08 Michael Hornstein , Roger Fan , Kerby Shedden , Shuheng Zhou

We apply a method recently introduced to the statistical literature to directly estimate the precision matrix from an ensemble of samples drawn from a corresponding Gaussian distribution. Motivated by the observation that cosmological…

Instrumentation and Methods for Astrophysics · Physics 2016-05-25 Nikhil Padmanabhan , Martin White , Harrison H. Zhou , Ross O'Connell

Constrained stochastic nonlinear optimization problems have attracted significant attention for their ability to model complex real-world scenarios in physics, economics, and biology. As datasets continue to grow, online inference methods…

Machine Learning · Statistics 2025-05-27 Xinchen Du , Wanrong Zhu , Wei Biao Wu , Sen Na