activity
20102026
most citedIdentifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling

53 citations · 293 across the 32 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

cs.LG2017★ 2 cited

Near Optimal Sketching of Low-Rank Tensor Regression

Jarvis Haupt, Xingguo Li, David P. Woodruff

We study the least squares regression problem \begin{align*} \min_{Θ\in \mathcal{S}_{\odot D,R}} \|AΘ-b\|_2, \end{align*} where is the set of for whic…

stat.ML2017

Communication-efficient Algorithm for Distributed Sparse Learning via Two-way Truncation

Jineng Ren, Jarvis Haupt

We propose a communicationally and computationally efficient algorithm for high-dimensional distributed sparse learning. At each iteration, local machines compute the gradient on l…

cs.IT2017★ 6 cited

Improved Support Recovery Guarantees for the Group Lasso With Applications to Structural Health Monitoring

Mojtaba Kadkhodaie Elyaderani, Swayambhoo Jain, Jeffrey Druce +2

This paper considers the problem of estimating an unknown high dimensional signal from noisy linear measurements, {when} the signal is assumed to possess a \emph{group-sparse} stru…

stat.ML2017★ 1 cited

On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions

Xingguo Li, Lin F. Yang, Jason Ge +3

We propose a DC proximal Newton algorithm for solving nonconvex regularized sparse learning problems in high dimensions. Our proposed algorithm integrates the proximal Newton algor…

stat.ML2017

Noisy Tensor Completion for Tensors with a Sparse Canonical Polyadic Factor

Swayambhoo Jain, Alexander Gutierrez, Jarvis Haupt

In this paper we study the problem of noisy tensor completion for tensors that admit a canonical polyadic or CANDECOMP/PARAFAC (CP) decomposition with one of the factors being spar…