#### Filter Results:

- Full text PDF available (86)

#### Publication Year

2004

2017

- This year (14)
- Last 5 years (68)
- Last 10 years (89)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative entropy between two multivariate Gaussians under constraints on the distance function. We express this problem as a particular Bregman optimization problem---that of minimizing the… (More)

- Prateek Jain, Raghu Meka, Inderjit S. Dhillon
- NIPS
- 2010

Minimizing the rank of a matrix subject to affine constraints is a fundamental problem with many important applications in machine learning and statistics. In this paper we propose a simple and fast algorithm SVP (Singular Value Projection) for rank minimization with affine constraints (ARMP) and show that SVP recovers the minimum rank solution for affine… (More)

- Prateek Jain, Praneeth Netrapalli, Sujay Sanghavi
- STOC
- 2013

Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to be one of the most accurate and efficient, and formed a major component of the winning entry in the Netflix Challenge… (More)

- Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi
- IEEE Transactions on Signal Processing
- 2013

Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of Gerchberg and Saxton and Fienup is still the popular choice for solving many variants of this problem. The algorithm is based on alternating… (More)

- Prateek Jain, Raghu Meka, Inderjit S. Dhillon
- Statistical Analysis and Data Mining
- 2008

Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult problem of uncovering disparate clusterings from the data in a totally unsupervised manner. We propose two new approaches for this problem. In the first approach we aim to find… (More)

- Prateek Jain, Brian Kulis, Kristen Grauman
- 2008 IEEE Conference on Computer Vision and…
- 2008

We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis distance function that captures the imagespsila underlying relationships well. To allow sub-linear time similarity search under the learned metric, we show how to encode the learned… (More)

- Kush Bhatia, Himanshu Jain, Purushottam Kar, Manik Varma, Prateek Jain
- NIPS
- 2015

The objective in extreme multi-label learning is to train a classifier that can automatically tag a novel data point with the most relevant subset of labels from an extremely large label set. Embedding based approaches attempt to make training and prediction tractable by assuming that the training label matrix is low-rank and reducing the effective number… (More)

Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all distance constraints at once. However, in many real applications, constraints are only available incrementally, thus necessitating methods that can perform online updates to the… (More)

- Alekh Agarwal, Amod J. G. Anandkumar, Prateek Jain, Praneeth Netrapalli
- SIAM Journal on Optimization
- 2016

We consider the problem of sparse coding, where each sample consists of a sparse linear combination of a set of dictionary atoms, and the task is to learn both the dictionary elements and the mixing coefficients. Alternating minimization is a popular heuristic for sparse coding, where the dictionary and the coefficients are estimated in alternate steps,… (More)

- Prateek Jain, Brian Kulis, Jason V. Davis, Inderjit S. Dhillon
- Journal of Machine Learning Research
- 2012

Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional data, while existing kernel learning algorithms are often limited to the transductive setting and do not generalize to new data points. In this paper, we study the connections… (More)