Uri Stemmer

Orcid: 0000-0001-7584-8768

According to our database1, Uri Stemmer authored at least 58 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries.
IACR Cryptol. ePrint Arch., 2024

Private Truly-Everlasting Robust-Prediction.
CoRR, 2024

2023
On Differential Privacy and Adaptive Data Analysis with Bounded Space.
IACR Cryptol. ePrint Arch., 2023

Hot PATE: Private Aggregation of Distributions for Diverse Task.
CoRR, 2023

On Differentially Private Online Predictions.
CoRR, 2023

Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model.
CoRR, 2023

Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Adaptive Data Analysis in a Balanced Adversarial Model.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Private Everlasting Prediction.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Black-Box Differential Privacy for Interactive ML.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generalized Private Selection and Testing with High Confidence.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Concurrent Shuffle Differential Privacy Under Continual Observation.
Proceedings of the International Conference on Machine Learning, 2023

Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Differentially Private Learning of Geometric Concepts.
SIAM J. Comput., 2022

Adversarially Robust Streaming Algorithms via Differential Privacy.
J. ACM, 2022

MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably.
IACR Cryptol. ePrint Arch., 2022

Differentially-Private Bayes Consistency.
CoRR, 2022

Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

FriendlyCore: Practical Differentially Private Aggregation.
Proceedings of the International Conference on Machine Learning, 2022

Adaptive Data Analysis with Correlated Observations.
Proceedings of the International Conference on Machine Learning, 2022

Differentially Private Approximate Quantiles.
Proceedings of the International Conference on Machine Learning, 2022

On the Robustness of CountSketch to Adaptive Inputs.
Proceedings of the International Conference on Machine Learning, 2022

Monotone Learning.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Algorithmic Stability for Adaptive Data Analysis.
SIAM J. Comput., 2021

Locally Private k-Means Clustering.
J. Mach. Learn. Res., 2021

A Note on Sanitizing Streams with Differential Privacy.
CoRR, 2021

Separating Adaptive Streaming from Oblivious Streaming.
CoRR, 2021

Learning Privately with Labeled and Unlabeled Examples.
Algorithmica, 2021

Differentially Private Multi-Armed Bandits in the Shuffle Model.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Sample Complexity of Privately Learning Axis-Aligned Rectangles.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Differentially-Private Clustering of Easy Instances.
Proceedings of the 38th International Conference on Machine Learning, 2021

Learning and Evaluating a Differentially Private Pre-trained Language Model.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2021, 2021

Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

The Sparse Vector Technique, Revisited.
Proceedings of the Conference on Learning Theory, 2021

Differentially Private Weighted Sampling.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Practical Locally Private Heavy Hitters.
J. Mach. Learn. Res., 2020

On the Round Complexity of the Shuffle Model.
IACR Cryptol. ePrint Arch., 2020

Locally Private <i>k</i>-Means Clustering.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

How to Find a Point in the Convex Hull Privately.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Privately Learning Thresholds: Closing the Exponential Gap.
Proceedings of the Conference on Learning Theory, 2020

Closure Properties for Private Classification and Online Prediction.
Proceedings of the Conference on Learning Theory, 2020

Private k-Means Clustering with Stability Assumptions.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Heavy Hitters and the Structure of Local Privacy.
ACM Trans. Algorithms, 2019

Concentration Bounds for High Sensitivity Functions Through Differential Privacy.
J. Priv. Confidentiality, 2019

Simultaneous Private Learning of Multiple Concepts.
J. Mach. Learn. Res., 2019

Characterizing the Sample Complexity of Pure Private Learners.
J. Mach. Learn. Res., 2019

Private Center Points and Learning of Halfspaces.
Proceedings of the Conference on Learning Theory, 2019

2018
The Limits of Post-Selection Generalization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Differentially Private k-Means with Constant Multiplicative Error.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Clustering Algorithms for the Centralized and Local Models.
Proceedings of the Algorithmic Learning Theory, 2018

2016
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.
Theory Comput., 2016

Locating a Small Cluster Privately.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Differentially Private Release and Learning of Threshold Functions.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2013
Characterizing the sample complexity of private learners.
Proceedings of the Innovations in Theoretical Computer Science, 2013


  Loading...