# Pranjal Awasthi

According to our database

Collaborative distances:

^{1}, Pranjal Awasthi authored at least 43 papers between 2007 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Efficient active learning of sparse halfspaces with arbitrary bounded noise.

CoRR, 2020

A Deep Conditioning Treatment of Neural Networks.

CoRR, 2020

2019

On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints.

Math. Program., 2019

Adversarially Robust Low Dimensional Representations.

CoRR, 2019

Effectiveness of Equalized Odds for Fair Classification under Imperfect Group Information.

CoRR, 2019

On Robustness to Adversarial Examples and Polynomial Optimization.

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Guarantees for Spectral Clustering with Fairness Constraints.

Proceedings of the 36th International Conference on Machine Learning, 2019

Fair k-Center Clustering for Data Summarization.

Proceedings of the 36th International Conference on Machine Learning, 2019

Robust Communication-Optimal Distributed Clustering Algorithms.

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem.

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Robust Matrix Completion from Quantized Observations.

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Crowdsourcing with Arbitrary Adversaries.

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

Clustering Semi-Random Mixtures of Gaussians.

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

Towards Learning Sparsely Used Dictionaries with Arbitrary Supports.

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Robust Vertex Enumeration for Convex Hulls in High Dimensions.

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

2017

Local algorithms for interactive clustering.

J. Mach. Learn. Res., 2017

The Power of Localization for Efficiently Learning Linear Separators with Noise.

J. ACM, 2017

General and Robust Communication-Efficient Algorithms for Distributed Clustering.

CoRR, 2017

Efficient PAC Learning from the Crowd.

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Clustering Under Stability Assumptions.

Encyclopedia of Algorithms, 2016

Testing Lipschitz Functions on Hypergrid Domains.

Algorithmica, 2016

Spectral Embedding of k-Cliques, Graph Partitioning and k-Means.

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Learning and 1-bit Compressed Sensing under Asymmetric Noise.

Proceedings of the 29th Conference on Learning Theory, 2016

2015

On some provably correct cases of variational inference for topic models.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Relax, No Need to Round: Integrality of Clustering Formulations.

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

The Hardness of Approximation of Euclidean k-Means.

Proceedings of the 31st International Symposium on Computational Geometry, 2015

Label optimal regret bounds for online local learning.

Proceedings of The 28th Conference on Learning Theory, 2015

Efficient Learning of Linear Separators under Bounded Noise.

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Learning Mixtures of Ranking Models.

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013

The Power of Localization for Efficiently Learning Linear Separators with Malicious Noise.

CoRR, 2013

Learning Using Local Membership Queries.

Proceedings of the COLT 2013, 2013

2012

Center-based clustering under perturbation stability.

Inf. Process. Lett., 2012

Limitations of Local Filters of Lipschitz and Monotone Functions.

Electronic Colloquium on Computational Complexity (ECCC), 2012

Learning using Local Membership Queries under Smooth Distributions

CoRR, 2012

Improved Spectral-Norm Bounds for Clustering.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

Additive Approximation for Near-Perfect Phylogeny Construction.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Decision trees for entity identification: Approximation algorithms and hardness results.

ACM Trans. Algorithms, 2011

2010

On Nash-Equilibria of Approximation-Stable Games.

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Supervised Clustering.

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Stability Yields a PTAS for k-Median and k-Means Clustering.

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

Improved Guarantees for Agnostic Learning of Disjunctions.

Proceedings of the COLT 2010, 2010

2009

Online Stochastic Optimization in the Large: Application to Kidney Exchange.

Proceedings of the IJCAI 2009, 2009

2007

Image Modeling Using Tree Structured Conditional Random Fields.

Proceedings of the IJCAI 2007, 2007