Follow
Amit Deshpande
Amit Deshpande
Microsoft Research
Verified email at microsoft.com
Title
Cited by
Cited by
Year
NP-hardness of Euclidean sum-of-squares clustering
D Aloise, A Deshpande, P Hansen, P Popat
Machine learning 75, 245-248, 2009
11902009
Matrix approximation and projective clustering via volume sampling
A Deshpande, L Rademacher, SS Vempala, G Wang
Theory of Computing 2 (1), 225-247, 2006
3602006
Adaptive sampling and fast low-rank matrix approximation
A Deshpande, S Vempala
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
2322006
Efficient volume sampling for row/column subset selection
A Deshpande, L Rademacher
2010 ieee 51st annual symposium on foundations of computer science, 329-338, 2010
2162010
Adaptive Sampling for k-Means Clustering
A Aggarwal, A Deshpande, R Kannan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
1432009
Fair and diverse DPP-based data summarization
E Celis, V Keswani, D Straszak, A Deshpande, T Kathuria, N Vishnoi
International Conference on Machine Learning, 716-725, 2018
952018
Batched gaussian process bandit optimization via determinantal point processes
T Kathuria, A Deshpande, P Kohli
Advances in neural information processing systems 29, 2016
922016
How to be fair and diverse?
LE Celis, A Deshpande, T Kathuria, NK Vishnoi
arXiv preprint arXiv:1610.07183, 2016
732016
On greedy maximization of entropy
D Sharma, A Kapoor, A Deshpande
International Conference on Machine Learning, 1330-1338, 2015
592015
Sampling-based dimension reduction for subspace approximation
A Deshpande, K Varadarajan
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
542007
Better lower bounds for locally decodable codes
A Deshpande, R Jain, T Kavitha, SV Lokam, J Radhakrishnan
Proceedings 17th IEEE Annual Conference on Computational Complexity, 184-193, 2002
492002
Algorithms and hardness for subspace approximation
A Deshpande, M Tulsiani, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
432011
Improved smoothed analysis of the shadow vertex simplex method
A Deshpande, DA Spielman
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 349-356, 2005
302005
On the complexity of constrained determinantal point processes
LE Celis, A Deshpande, T Kathuria, D Straszak, NK Vishnoi
arXiv preprint arXiv:1608.00554, 2016
252016
The importance of modeling data missingness in algorithmic fairness: A causal perspective
N Goel, A Amayuelas, A Deshpande, A Sharma
Proceedings of the AAAI Conference on Artificial Intelligence 35 (9), 7564-7573, 2021
192021
How Linguistically Fair Are Multilingual Pre-Trained Language Models?
M Choudhury, A Deshpande
Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12710 …, 2021
152021
Partitioning a planar graph of girth ten into a forest and a matching
A Bassa, J Burns, J Campbell, A Deshpande, J Farley, M Halsey, ...
manuscript, 2004
142004
Robust -means++
A Deshpande, P Kacham, R Pratap
Conference on Uncertainty in Artificial Intelligence, 799-808, 2020
132020
On sampling and greedy map inference of constrained determinantal point processes
T Kathuria, A Deshpande
arXiv preprint arXiv:1607.01551, 2016
132016
Invariance vs robustness of neural networks
S Kamath, A Deshpande, KV Subrahmanyam
11*2020
The system can't perform the operation now. Try again later.
Articles 1–20