Sushrut Karmalkar

According to our database1, Sushrut Karmalkar authored at least 24 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Multi-Model 3D Registration: Finding Multiple Moving Objects in Cluttered Point Clouds.
Proceedings of the IEEE International Conference on Robotics and Automation, 2024

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
First Order Stochastic Optimization with Oblivious Noise.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Robust Sparse Mean Estimation via Sum of Squares.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Fairness for Image Generation with Uncertain Sensitive Attributes.
Proceedings of the 38th International Conference on Machine Learning, 2021

Instance-Optimal Compressed Sensing via Posterior Sampling.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
The Polynomial Method is Universal for Distribution-Free Correlational SQ Learning.
CoRR, 2020

Robustly Learning any Clusterable Mixture of Gaussians.
CoRR, 2020

On the Power of Compressed Sensing with Generative Models.
Proceedings of the 37th International Conference on Machine Learning, 2020

Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent.
Proceedings of the 37th International Conference on Machine Learning, 2020

Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Approximation Schemes for ReLU Regression.
Proceedings of the Conference on Learning Theory, 2020

2019
Lower Bounds for Compressed Sensing with Generative Models.
CoRR, 2019

Compressed Sensing with Adversarial Sparse Noise via L1 Regression.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

List-decodable Linear Regression.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Time/Accuracy Tradeoffs for Learning a ReLU with respect to Gaussian Marginals.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Depth separation and weight-width trade-offs for sigmoidal neural networks.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
On Robust Concepts and Small Neural Nets.
Proceedings of the 5th International Conference on Learning Representations, 2017

Robust Polynomial Regression up to the Information Theoretic Limit.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017


  Loading...