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
13162009
Matrix approximation and projective clustering via volume sampling
A Deshpande, L Rademacher, SS Vempala, G Wang
Theory of Computing 2 (1), 225-247, 2006
4042006
Adaptive sampling and fast low-rank matrix approximation
A Deshpande, S Vempala
International Workshop on Approximation Algorithms for Combinatorial …, 2006
2652006
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
2402010
Adaptive Sampling for k-Means Clustering
A Aggarwal, A Deshpande, R Kannan
International Workshop on Approximation Algorithms for Combinatorial …, 2009
1642009
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
1262018
Batched gaussian process bandit optimization via determinantal point processes
T Kathuria, A Deshpande, P Kohli
Advances in neural information processing systems 29, 2016
992016
How to be fair and diverse?
LE Celis, A Deshpande, T Kathuria, NK Vishnoi
arXiv preprint arXiv:1610.07183, 2016
922016
Sampling-based dimension reduction for subspace approximation
A Deshpande, K Varadarajan
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
662007
On greedy maximization of entropy
D Sharma, A Kapoor, A Deshpande
International Conference on Machine Learning, 1330-1338, 2015
652015
Algorithms and hardness for subspace approximation
A Deshpande, M Tulsiani, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
492011
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
462021
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
462002
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
342005
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
322021
Robust -means++
A Deshpande, P Kacham, R Pratap
Conference on Uncertainty in Artificial Intelligence, 799-808, 2020
282020
On the complexity of constrained determinantal point processes
LE Celis, A Deshpande, T Kathuria, D Straszak, NK Vishnoi
arXiv preprint arXiv:1608.00554, 2016
282016
On the problem of underranking in group-fair ranking
S Gorantla, A Deshpande, A Louis
International Conference on Machine Learning, 3777-3787, 2021
202021
Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks
S Kamath, A Deshpande, S Kambhampati Venkata, ...
Advances in Neural Information Processing Systems 34, 27462-27474, 2021
15*2021
On sampling and greedy map inference of constrained determinantal point processes
T Kathuria, A Deshpande
arXiv preprint arXiv:1607.01551, 2016
142016
The system can't perform the operation now. Try again later.
Articles 1–20