Pritish Kamath

According to our database1, Pritish Kamath authored at least 62 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
How Unique is Whose Web Browser? The role of demographics in browser fingerprinting among US users.
Proc. Priv. Enhancing Technol., 2025

2024
Summary Reports Optimization in the Privacy Sandbox Attribution Reporting API.
Proc. Priv. Enhancing Technol., 2024

Unlearn and Burn: Adversarial Machine Unlearning Requests Destroy Model Accuracy.
CoRR, 2024

Crosslingual Capabilities and Knowledge Barriers in Multilingual Large Language Models.
CoRR, 2024

Mind the Privacy Unit! User-Level Differential Privacy for Language Model Fine-Tuning.
CoRR, 2024

Differentially Private Optimization with Sparse Gradients.
CoRR, 2024

How Private is DP-SGD?
CoRR, 2024

Training Differentially Private Ad Prediction Models with Semi-Sensitive Features.
CoRR, 2024

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

How Private are DP-SGD Implementations?
Proceedings of the Forty-first International Conference on Machine Learning, 2024

LabelDP-Pro: Learning with Label Differential Privacy via Projections.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

On Convex Optimization with Semi-Sensitive Features.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Learning Neural Networks with Sparse Activations.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Training Differentially Private Ad Prediction Models With Semi-Sensitive Features.
Proceedings of the Workshop on Data Mining for Online Advertising (AdKDD 2024) co-located with the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2024), 2024

2023
Supervised Bayesian specification inference from demonstrations.
Int. J. Robotics Res., December, 2023

Separating Computational and Statistical Differential Privacy (Under Plausible Assumptions).
CoRR, 2023

Optimal Unbiased Randomizers for Regression with Label Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On Computing Pairwise Statistics with Local Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

User-Level Differential Privacy With Few Examples Per User.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Sparsity-Preserving Differentially Private Training of Large Embedding Models.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On User-Level Private Convex Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Regression with Label Differential Privacy.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

On Differentially Private Counting on Trees.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Towards Separating Computational and Statistical Differential Privacy.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Ticketed Learning-Unlearning Schemes.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Private Ad Modeling with DP-SGD.
Proceedings of the Workshop on Data Mining for Online Advertising (AdKDD 2023) co-located with the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2023), 2023

Optimizing Hierarchical Queries for the Attribution Reporting API.
Proceedings of the Workshop on Data Mining for Online Advertising (AdKDD 2023) co-located with the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2023), 2023

2022
Connect the Dots: Tighter Discrete Approximations of Privacy Loss Distributions.
Proc. Priv. Enhancing Technol., 2022

Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange.
J. Cryptol., 2022

Circuits Resilient to Short-Circuit Errors.
Electron. Colloquium Comput. Complex., 2022

Understanding the Eluder Dimension.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Private Isotonic Regression.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Anonymized Histograms in Intermediate Privacy Models.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Faster Privacy Accounting via Evolving Discretization.
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

2021
Eluder Dimension and Generalized Rank.
CoRR, 2021

On the Power of Differentiable Learning versus PAC and SQ Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels.
Proceedings of the 38th International Conference on Machine Learning, 2021

Does Invariant Risk Minimization Capture Invariance?
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Optimality of Correlated Sampling Strategies.
Theory Comput., 2020

Approximate is Good Enough: Probabilistic Variants of Dimensional and Margin Complexity.
Proceedings of the Conference on Learning Theory, 2020

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Correction to: Query-to-Communication Lifting for P NP.
Comput. Complex., 2019

Query-to-Communication Lifting for P NP.
Comput. Complex., 2019

2018
Adventures in Monotone Complexity and TFNP.
Electron. Colloquium Comput. Complex., 2018

Bayesian Inference of Temporal Task Specifications from Demonstrations.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Dimension Reduction for Polynomials over Gaussian Space and Applications.
Electron. Colloquium Comput. Complex., 2017

Monotone Circuit Lower Bounds from Resolution.
Electron. Colloquium Comput. Complex., 2017

Unexpected power of low-depth arithmetic circuits.
Commun. ACM, 2017

Improved bounds for universal one-bit compressive sensing.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Compression in a Distributed Setting.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Arithmetic Circuits: A Chasm at Depth 3.
SIAM J. Comput., 2016

Decidability of Non-Interactive Simulation of Joint Distributions.
Electron. Colloquium Comput. Complex., 2016

The Optimality of Correlated Sampling.
Electron. Colloquium Comput. Complex., 2016

2015
Communication Complexity of Permutation-Invariant Functions.
Electron. Colloquium Comput. Complex., 2015

Communication with Partial Noiseless Feedback.
Proceedings of the Approximation, 2015

2014
Approaching the Chasm at Depth Four.
J. ACM, 2014

2013
Arithmetic circuits: A chasm at depth three.
Electron. Colloquium Comput. Complex., 2013

2012
An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin.
Electron. Colloquium Comput. Complex., 2012

Preservation under Substructures modulo Bounded Cores.
Proceedings of the Logic, Language, Information and Computation, 2012

Faster Algorithms for Alternating Refinement Relations.
Proceedings of the Computer Science Logic (CSL'12), 2012

2011
Using Dominances for Solving the Protein Family Identification Problem.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011


  Loading...