Pranjal Awasthi

According to our database1, Pranjal Awasthi authored at least 96 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Stacking as Accelerated Gradient Descent.
CoRR, 2024

On Distributed Larger-Than-Memory Subset Selection With Pairwise Submodular Functions.
CoRR, 2024

Simulated Overparameterization.
CoRR, 2024

2023
Does Engaging in Data Philanthropy Impact Business Value?
Inf. Syst. Manag., April, 2023

A Weighted K-Center Algorithm for Data Subset Selection.
CoRR, 2023

Improving Length-Generalization in Transformers via Task Hinting.
CoRR, 2023

The Sample Complexity of Multi-Distribution Learning for VC Classes.
CoRR, 2023

Best-Effort Adaptation.
CoRR, 2023

Agnostic Learning of General ReLU Activation Using Gradient Descent.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Distributionally Robust Data Join.
Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

Open Problem: The Sample Complexity of Multi-Distribution Learning for VC Classes.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Theoretically Grounded Loss Functions and Algorithms for Adversarial Robustness.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Theory and Algorithm for Batch Distribution Drift Problems.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Trimmed Maximum Likelihood Estimation for Robust Learning in Generalized Linear Models.
CoRR, 2022

H-Consistency Estimation Error of Surrogate Loss Minimizers.
CoRR, 2022

Semi-supervised Active Linear Regression.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On the Adversarial Robustness of Mixture of Experts.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Multi-Class $H$-Consistency Bounds.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Trimmed Maximum Likelihood Estimation for Robust Generalized Linear Model.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Agnostic Learnability of Halfspaces via Logistic Loss.
Proceedings of the International Conference on Machine Learning, 2022

H-Consistency Bounds for Surrogate Loss Minimizers.
Proceedings of the International Conference on Machine Learning, 2022

Do More Negative Samples Necessarily Hurt In Contrastive Learning?
Proceedings of the International Conference on Machine Learning, 2022

Congested Bandits: Optimal Routing via Short-term Resets.
Proceedings of the International Conference on Machine Learning, 2022

Individual Preference Stability for Clustering.
Proceedings of the International Conference on Machine Learning, 2022

Active Sampling for Min-Max Fairness.
Proceedings of the International Conference on Machine Learning, 2022

On the benefits of maximum likelihood estimation for Regression and Forecasting.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Effective and Inconspicuous Over-the-Air Adversarial Examples with Adaptive Filtering.
Proceedings of the IEEE International Conference on Acoustics, 2022

Understanding Simultaneous Train and Test Robustness.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Beyond GNNs: An Efficient Architecture for Graph Problems.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
On the Existence of the Adversarial Bayes Classifier (Extended Version).
CoRR, 2021

Semi-supervised Active Regression.
CoRR, 2021

A Finer Calibration Analysis for Adversarial Robustness.
CoRR, 2021

A Multiclass Boosting Framework for Achieving Fast and Provable Adversarial Robustness.
CoRR, 2021

Neural Active Learning with Performance Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Calibration and Consistency of Adversarial Surrogate Losses.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Existence of The Adversarial Bayes Classifier.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Convergence Analysis of Gradient Descent on Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Evaluating Fairness of Machine Learning Models Under Uncertain and Incomplete Information.
Proceedings of the FAccT '21: 2021 ACM Conference on Fairness, 2021

Adversarial Robustness Across Representation Spaces.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2021

Adversarially Robust Low Dimensional Representations.
Proceedings of the Conference on Learning Theory, 2021

A Deep Conditioning Treatment of Neural Networks.
Proceedings of the Algorithmic Learning Theory, 2021

Measuring Model Fairness under Noisy Covariates: A Theoretical Perspective.
Proceedings of the AIES '21: AAAI/ACM Conference on AI, 2021

2020
Beyond Individual and Group Fairness.
CoRR, 2020

On the Rademacher Complexity of Linear Hypothesis Sets.
CoRR, 2020

Adaptive Sampling to Reduce Disparate Performance.
CoRR, 2020

A Notion of Individual Fairness for Clustering.
CoRR, 2020

Robust vertex enumeration for convex hulls in high dimensions.
Ann. Oper. Res., 2020

Efficient active learning of sparse halfspaces with arbitrary bounded noise.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

PAC-Bayes Learning Bounds for Sample-Dependent Priors.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adversarial robustness via robust low rank representations.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adversarial Learning Guarantees for Linear Hypotheses and Neural Networks.
Proceedings of the 37th International Conference on Machine Learning, 2020

The Impact of Data Philanthropy on Global Health When Mediated Through Digital Epidemiology.
Proceedings of the 41st International Conference on Information Systems, 2020

Estimating Principal Components under Adversarial Perturbations.
Proceedings of the Conference on Learning Theory, 2020

A case for Data Democratization.
Proceedings of the 26th Americas Conference on Information Systems, 2020

Equalized odds postprocessing under imperfect group information.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints.
Math. Program., 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

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
Approximation Algorithms and New Models for Clustering and Learning.
PhD thesis, 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.
Electron. Colloquium Comput. Complex., 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


  Loading...