Amit Deshpande

According to our database, Amit Deshpande authored at least 47 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

How Far Can Fairness Constraints Help Recover From Biased Data?

Mohit Sharma, Amit Deshpande

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Rethinking Robustness of Model Attributions.

Sandesh Kamath, Sankalp Mittal, Amit Deshpande, Vineeth N. Balasubramanian

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

One-Pass Additive-Error Subset Selection for ℓ _p Subspace Approximation and (k, p)-Clustering.

Amit Deshpande, Rameshwar Pratap

Algorithmica, October, 2023

Improved Outlier Robust Seeding for k-means.

Amit Deshpande, Rameshwar Pratap

CoRR, 2023

On Testing and Comparing Fair classifiers under Data Bias.

Mohit Sharma, Amit Deshpande, Rajiv Ratn Shah

CoRR, 2023

2022

One-Pass Additive-Error Subset Selection for ℓ_p Subspace Approximation.

Amit Deshpande, Rameshwar Pratap

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

On the Power of Randomization in Fair Classification and Representation.

Sushant Agarwal, Amit Deshpande

Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

Universalization of Any Adversarial Attack using Very Few Test Examples.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam, Vineeth N. Balasubramanian

Proceedings of the CODS-COMAD 2022: 5th Joint International Conference on Data Science & Management of Data (9th ACM IKDD CODS and 27th COMAD), Bangalore, India, January 8, 2022

Learning and Generalization in Overparameterized Normalizing Flows.

Kulin Shah, Amit Deshpande, Navin Goyal

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Sampling-based dimension reduction for subspace approximation with outliers.

Amit Deshpande, Rameshwar Pratap

Theor. Comput. Sci., 2021

On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling.

Amit Deshpande, Rameshwar Pratap

CoRR, 2021

Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks.

Sandesh Kamath, Amit Deshpande, Subrahmanyam Kambhampati Venkata, Vineeth N. Balasubramanian

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Rawlsian Fair Adaptation of Deep Learning Classifiers.

Kulin Shah, Pooja Gupta, Amit Deshpande, Chiranjib Bhattacharyya

Proceedings of the AIES '21: AAAI/ACM Conference on AI, 2021

2020

How do SGD hyperparameters in natural training affect adversarial robustness?

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

On Universalized Adversarial and Invariant Perturbations.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

Universalization of any adversarial attack using very few test examples.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

Invariance vs. Robustness of Neural Networks.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

Robust k-means++.

Amit Deshpande, Praneeth Kacham, Rameshwar Pratap

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

Subspace Approximation with Outliers.

Amit Deshpande, Rameshwar Pratap

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2018

Fair and Diverse DPP-Based Data Summarization.

L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi

Proceedings of the 35th International Conference on Machine Learning, 2018

Depth separation and weight-width trade-offs for sigmoidal neural networks.

Amit Deshpande, Navin Goyal, Sushrut Karmalkar

Proceedings of the 6th International Conference on Learning Representations, 2018

2017

Blood Count on a Smartphone Microscope: Challenges.

Uma Parthavi Moravapalle, Amit Deshpande, Ashish Kapoor, Ramachandran Ramjee, Priya Ravi

Proceedings of the 18th International Workshop on Mobile Computing Systems and Applications, 2017

On Robust Concepts and Small Neural Nets.

Amit Deshpande, Sushrut Karmalkar

Proceedings of the 5th International Conference on Learning Representations, 2017

On the Complexity of Constrained Determinantal Point Processes.

L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi

Proceedings of the Approximation, 2017

2016

On Sampling and Greedy MAP Inference of Constrained Determinantal Point Processes.

Tarun Kathuria, Amit Deshpande

CoRR, 2016

How to be Fair and Diverse?

L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi

CoRR, 2016

Batched Gaussian Process Bandit Optimization via Determinantal Point Processes.

Tarun Kathuria, Amit Deshpande, Pushmeet Kohli

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1.

Amit Deshpande, Prahladh Harsha, Rakesh Venkat

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Embedding approximately low-dimensional ℓ_2² metrics into ℓ₁.

Amit Deshpande, Prahladh Harsha, Rakesh Venkat

CoRR, 2015

On Greedy Maximization of Entropy.

Dravyansh Sharma, Ashish Kapoor, Amit Deshpande

Proceedings of the 32nd International Conference on Machine Learning, 2015

2014

Guruswami-Sinop Rounding without Higher Level Lasserre.

Amit Deshpande, Rakesh Venkat

Proceedings of the Approximation, 2014

2012

Zero-One Rounding of Singular Vectors.

Amit Deshpande, Ravindran Kannan, Nikhil Srivastava

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Algorithms and Hardness for Subspace Approximation.

Amit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Efficient Volume Sampling for Row/Column Subset Selection.

Amit Deshpande, Luis Rademacher

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

NP-hardness of Euclidean sum-of-squares clustering.

Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat

Mach. Learn., 2009

Algorithms and Hardness for Subspace Approximation

Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi

CoRR, 2009

The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions

Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala

CoRR, 2009

Finding Dense Subgraphs in <i>G</i>(<i>n</i>, 1/2).

Atish Das Sarma, Amit Deshpande, Ravi Kannan

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry.

Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala

Proceedings of the Approximation, 2009

Adaptive Sampling for k-Means Clustering.

Ankit Aggarwal, Amit Deshpande, Ravi Kannan

Proceedings of the Approximation, 2009

2008

Finding Dense Subgraphs in G(n,1/2)

Atish Das Sarma, Amit Deshpande, Ravi Kannan

CoRR, 2008

2007

Sampling-based dimension reduction for subspace approximation.

Amit Deshpande, Kasturi R. Varadarajan

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Matrix Approximation and Projective Clustering via Volume Sampling.

Amit Deshpande, Luis Rademacher, Santosh S. Vempala, Grant Wang

Theory Comput., 2006

Adaptive Sampling and Fast Low-Rank Matrix Approximation.

Amit Deshpande, Santosh S. Vempala

Electron. Colloquium Comput. Complex., 2006

2005

Lower bounds for adaptive locally decodable codes.

Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan

Random Struct. Algorithms, 2005

Improved Smoothed Analysis of the Shadow Vertex Simplex Method.

Amit Deshpande, Daniel A. Spielman

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2002

Better Lower Bounds for Locally Decodable Codes.

Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002