#### Filter Results:

#### Publication Year

2015

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- SHASHANKA UBARU, JIE CHEN
- 2016

The problem of estimating the trace of matrix functions appears in applications ranging from machine learning, to scientific computing, and computational biology to name just a few. This paper presents an inexpensive method to estimate the trace of f (A) for cases where f is analytic inside a closed interval. The method combines three key ingredients,… (More)

- Shashanka Ubaru, Arya Mazumdar, Yousef Saad
- ICML
- 2015

Low-rank matrix approximation is an integral component of tools such as principal component analysis (PCA), as well as is an important instrument used in applications like web search, text mining and computer vision, e.g., face recognition. Recently, randomized algorithms were proposed to effectively construct low rank approximations of large matrices. In… (More)

- Shashanka Ubaru, Yousef Saad
- ICML
- 2016

We present two computationally inexpensive techniques for estimating the numerical rank of a matrix, combining powerful tools from computational linear algebra. These techniques exploit three key ingredients. The first is to approximate the projector on the non-null invariant subspace of the matrix by using a polynomial filter. Two types of filters are… (More)

- Shashanka Ubaru, Yousef Saad, Abd-Krim Seghouane
- Neural Computation
- 2017

Many machine learning and data-related applications require the knowledge of approximate ranks of large data matrices at hand. This letter presents two computationally inexpensive techniques to estimate the approximate ranks of such matrices. These techniques exploit approximate spectral densities, popular in physics, which are probability density… (More)

- Shashanka Ubaru, Arya Mazumdar, Alexander Barg
- 2016 IEEE International Symposium on Information…
- 2016

Despite a large volume of research in group testing, explicit small-size group testing schemes are still difficult to construct, and the parameters of known combinatorial schemes are limited by the constraints of the problem. Relaxing the worst-case identification requirements to probabilistic localization of defectives enables one to expand the range of… (More)

Understanding the singular value spectrum of a matrix A ∈ R n×n is a fundamental task in countless numerical computation and data analysis applications. In matrix multiplication time, it is possible to perform a full SVD of A and directly compute the singular values σ 1 ,. .. , σ n in n ω time. However, little is known about algorithms that break this… (More)

- Shashanka Ubaru, Abd-Krim Seghouane, Yousef Saad
- Neural Computation
- 2017

This letter considers the problem of dictionary learning for sparse signal representation whose atoms have low mutual coherence. To learn such dictionaries, at each step, we first update the dictionary using the method of optimal directions (MOD) and then apply a dictionary rank shrinkage step to decrease its mutual coherence. In the rank shrinkage step, we… (More)

1. Additional Details In this supplementary material, we give additional details on the two polynomial filters discussed in the main paper. First, we give an example to illustrate how the choice of the degree in the extend McWeeny filter method affects the inflexion point and the rank estimated. Next, we discuss some details on the practical implementation… (More)

- Shashanka Ubaru, Arya Mazumdar, Yousef Saad
- ArXiv
- 2015

—Low rank approximation is an important tool used in many applications of signal processing and machine learning. Recently, randomized algorithms were proposed to effectively construct low rank approximations and obtain approximate singular value decompositions of large matrices. Similar ideas were used to solve least squares regression problems. In this… (More)

- ‹
- 1
- ›