Amit Deshpande

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 23

Top Topics

Point Processes

Top Venues

ICLR (Workshop)

Publications

Sandesh Kamath, Sankalp Mittal, Amit Deshpande, Vineeth N. Balasubramanian
Rethinking Robustness of Model Attributions. AAAI (2024)
Sushant Agarwal, Amit Deshpande
On the Power of Randomization in Fair Classification and Representation. CoRR (2024)
Amit Deshpande, Rameshwar Pratap
Improved Outlier Robust Seeding for k-means. CoRR (2023)
Mohit Sharma, Amit Deshpande, Rajiv Ratn Shah
On Testing and Comparing Fair classifiers under Data Bias. CoRR (2023)
Mohit Sharma, Amit Deshpande
How Far Can Fairness Constraints Help Recover From Biased Data? CoRR (2023)
Sandesh Kamath, Sankalp Mittal, Amit Deshpande, Vineeth N. Balasubramanian
Rethinking Robustness of Model Attributions. CoRR (2023)
Amit Deshpande, Rameshwar Pratap
Subspace Approximation and (k, p)-Clustering. Algorithmica 85 (10) (2023)
Kulin Shah, Amit Deshpande, Navin Goyal
Learning and Generalization in Overparameterized Normalizing Flows. AISTATS (2022)
Amit Deshpande, Rameshwar Pratap
subspace approximation. CoRR (2022)
Amit Deshpande, Rameshwar Pratap
Subspace Approximation. ICALP (2022)
Sandesh Kamath, Amit Deshpande, Subrahmanyam Kambhampati Venkata, Vineeth N. Balasubramanian
Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks. NeurIPS (2021)
Kulin Shah, Amit Deshpande, Navin Goyal
Learning and Generalization in Overparameterized Normalizing Flows. CoRR (2021)
L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi
Fair and Diverse DPP-based Data Summarization. CoRR (2018)
Amit Deshpande, Navin Goyal, Sushrut Karmalkar
Depth separation and weight-width trade-offs for sigmoidal neural networks. ICLR (Workshop) (2018)
L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi
Fair and Diverse DPP-Based Data Summarization. ICML (2018)
Uma Parthavi Moravapalle, Amit Deshpande, Ashish Kapoor, Ramachandran Ramjee, Priya Ravi
Blood Count on a Smartphone Microscope: Challenges. HotMobile (2017)
L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi
On the Complexity of Constrained Determinantal Point Processes. APPROX-RANDOM (2017)
Amit Deshpande, Sushrut Karmalkar
On Robust Concepts and Small Neural Nets. ICLR (Workshop) (2017)
Tarun Kathuria, Amit Deshpande
On Sampling and Greedy MAP Inference of Constrained Determinantal Point Processes. CoRR (2016)
L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi
How to be Fair and Diverse? CoRR (2016)
Tarun Kathuria, Amit Deshpande, Pushmeet Kohli
Batched Gaussian Process Bandit Optimization via Determinantal Point Processes. CoRR (2016)
Tarun Kathuria, Amit Deshpande, Pushmeet Kohli
Batched Gaussian Process Bandit Optimization via Determinantal Point Processes. NIPS (2016)
Amit Deshpande, Prahladh Harsha, Rakesh Venkat
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. FSTTCS (2016)
Dravyansh Sharma, Ashish Kapoor, Amit Deshpande
On Greedy Maximization of Entropy. ICML (2015)
Amit Deshpande, Prahladh Harsha, Rakesh Venkat
. CoRR (2015)
Amit Deshpande, Rakesh Venkat
Guruswami-Sinop Rounding without Higher Level Lasserre. APPROX-RANDOM (2014)
Amit Deshpande, Rakesh Venkat
Guruswami-Sinop Rounding without Higher Level Lasserre. CoRR (2014)
Amit Deshpande, Ravindran Kannan, Nikhil Srivastava
Zero-One Rounding of Singular Vectors. ICALP (1) (2012)
Amit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi
Algorithms and Hardness for Subspace Approximation. SODA (2011)
Amit Deshpande, Luis Rademacher
Efficient Volume Sampling for Row/Column Subset Selection. FOCS (2010)
Amit Deshpande, Luis Rademacher
Efficient volume sampling for row/column subset selection CoRR (2010)
Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat
NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75 (2) (2009)
Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi
Algorithms and Hardness for Subspace Approximation CoRR (2009)
Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. APPROX-RANDOM (2009)
Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala
The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions CoRR (2009)
Ankit Aggarwal, Amit Deshpande, Ravi Kannan
Adaptive Sampling for k-Means Clustering. APPROX-RANDOM (2009)
Atish Das Sarma, Amit Deshpande, Ravi Kannan
, 1/2). WAOA (2009)
Atish Das Sarma, Amit Deshpande, Ravi Kannan
Finding Dense Subgraphs in G(n,1/2) CoRR (2008)
Amit Deshpande, Kasturi R. Varadarajan
Sampling-based dimension reduction for subspace approximation. STOC (2007)
Amit Deshpande, Santosh S. Vempala
Adaptive Sampling and Fast Low-Rank Matrix Approximation. APPROX-RANDOM (2006)
Amit Deshpande, Luis Rademacher, Santosh S. Vempala, Grant Wang
Matrix approximation and projective clustering via volume sampling. SODA (2006)
Amit Deshpande, Santosh S. Vempala
Adaptive Sampling and Fast Low-Rank Matrix Approximation. Electron. Colloquium Comput. Complex. 13 (042) (2006)
Amit Deshpande, Luis Rademacher, Santosh S. Vempala, Grant Wang
Matrix Approximation and Projective Clustering via Volume Sampling. Theory Comput. 2 (12) (2006)
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27 (3) (2005)
Amit Deshpande, Daniel A. Spielman
Improved Smoothed Analysis of the Shadow Vertex Simplex Method. FOCS (2005)
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
Better Lower Bounds for Locally Decodable Codes. Computational Complexity Conference (2002)