#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2005

2017

- This year (3)
- Last 5 years (18)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Mikhail Belkin, Kaushik Sinha
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2010

The question of polynomial learn ability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoretical computer science andâ€¦ (More)

- Kamalika Chaudhuri, Anand D. Sarwate, Kaushik Sinha
- NIPS
- 2012

Principal components analysis (PCA) is a standard tool for identifying good lowdimensional approximations to data sets in high dimension. Many current data sets of interest contain private orâ€¦ (More)

- Kaushik Sinha, Mikhail Belkin
- AAAI Fall Symposium: Manifold Learning and Itsâ€¦
- 2009

We present a new framework for semi-supervised learning with sparse eigenfunction bases of kernel matrices. It turns out that when the data has clustered, that is, when the high density regions areâ€¦ (More)

- Sanjoy Dasgupta, Kaushik Sinha
- Algorithmica
- 2014

The $$k$$ k -d tree was one of the first spatial data structures proposed for nearest neighbor search. Its efficacy is diminished in high-dimensional spaces, but several variants, with randomizationâ€¦ (More)

- Kamalika Chaudhuri, Anand D. Sarwate, Kaushik Sinha
- ArXiv
- 2012

Principal components analysis (PCA) is a standard tool for identifying good low-dimensional approximations to data in high dimension. Many data sets of interest contain private or sensitiveâ€¦ (More)

- Kaushik Sinha, Mikhail Belkin
- NIPS
- 2007

Semi-supervised learning, i.e. learning from both labeled and unlabeled data has received significant attention in the machine learning literature in recent years. Still our understanding of theâ€¦ (More)

- Sanjoy Dasgupta, Kaushik Sinha
- COLT
- 2013

The k-d tree was one of the first spatial data structures proposed for nearest neighbor search. Its efficacy is diminished in high-dimensional spaces, but several variants, with randomization andâ€¦ (More)

- Mikhail Belkin, Kaushik Sinha
- COLT
- 2010

In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory communities. In this paperâ€¦ (More)

- Alfredo J Garcia, Stephen D. Patek, Kaushik Sinha
- Operations Research
- 2007

We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical interests. In thisâ€¦ (More)

- Kaushik Sinha, Xuan Zhang, Ruoming Jin, Gagan Agrawal
- Fifth IEEE Symposium on Bioinformatics andâ€¦
- 2005

One of the major problems in biological data integration is that many data sources are stored as atlasses, with a variety of different layouts. Integrating data from such sources can be an extremelyâ€¦ (More)