User-Level Differentially Private Learning via Correlated Sampling

von Ghazi, Badih
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 24 of 36 (2022)

NEARLY TIGHT BOUNDS FOR ROBUST PROPER LEARNING OF HALFSPACES WITH A MARQGIN

von Diakonikolas, Ilias
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 14 of 20 (2020)

DIFFERENTIALLY PRIVATE CLUSTERING: TIGHT APPROXIMATION RATIOS

von Ghazi, Badih
Veröffentlicht in NeurIPS (34. : 2020 : Online) 34th Conference on Neural Information Processing Systems (NeurIPS 2020) ; Volume 5 of 27 (2021)

Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems

von Dudycz, Szymon
Veröffentlicht in WAOA (19. : 2021 : Online) Approximation and online algorithms (2021)

THE COMPLEXITY OF ADVERSARIALLY ROBUST PROPER LEARNING OF HALFSPACES WITH AGNOSTIC NOISE

von Diakonikolas, Tlias
Veröffentlicht in NeurIPS (34. : 2020 : Online) 34th Conference on Neural Information Processing Systems (NeurIPS 2020) ; Volume 25 of 27 (2021)

Nearly Optimal Robust Secret Sharing Against Rushing Adversaries

von Manurangsi, Pasin
Veröffentlicht in CRYPTO (40. : 2020 : Santa Barbara, Calif.; Online) Advances in cryptology - CRYPTO 2020 ; Part 3 (2020)

PRIVATE COUNTING FROM ANONYMOUS MESSAGES: NEAR-OPTIMAL ACCURACY WITH VANISHING COMMUNICATION OVERHEAD

von Ghazi, Badih
Veröffentlicht in International Conference on Machine Learning (37. : 2020 : Online) 37th International Conference on Machine Learning (ICML 2020) ; Part 5 of 15 (2021)

Anonymized Histograms in Intermediate Privacy Models

von Ghazi, Badih
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 12 of 50 (2023)

Private Isotonic Regression

von Ghazi, Badih
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 12 of 50 (2023)

Cryptographic Hardness of Learning Halfspaces with Massart Noise

von Diakonikolas, Ilias
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 5 of 50 (2023)

Faster Privacy Accounting Via Evolving Discretization

von Ghazi, Badih
Veröffentlicht in International Conference on Machine Learning (39. : 2022 : Baltimore, Md.; Online) International Conference on Machine Learning (ICML 2022) ; Part 9 of 33 (2023)

LOCALLY PRIVATE K-MEANS IN ONE ROUND

von CHANG, ALISA
Veröffentlicht in International Conference on Machine Learning (38. : 2021 : Online) International Conference on Machine Learning (ICML 2021 ; Part 2 of 16 (2022)

DIFFERENTIALLY PRIVATE AGGREGATION IN THE SHUFFLE MODEL: ALMOST CENTRAL ACCURACY IN ALMOST A SINGLE MESSAGE

von GHAZI, BADIH
Veröffentlicht in International Conference on Machine Learning (38. : 2021 : Online) International Conference on Machine Learning (ICML 2021 ; Part 5 of 16 (2022)

To Close Is Easier Than To Open: Dual Parameterization To k-Median

von Byrka, Jarostaw
Veröffentlicht in WAOA (18. : 2020 : Online) Approximation and Online Algorithms (2021)

Deep Learning with Label Differential Privacy

von Ghazi, Badih
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 32 of 36 (2022)

Consensus Halving for Sets of Items

von Goldberg, Paul W.
Veröffentlicht in WINE (16. : 2020 : Online) Web and internet economics (2020)

Contextual Recommendations and Low-Regret Cutting-Plane Algorithms

von Gollapudi, Sreenivas
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 27 of 36 (2022)

Justifying Groups in Multiwinner Approval Voting

von Elkind, Edith
Veröffentlicht in SAGT (15. : 2022 : Colchester) Algorithmic game theory (2022)

Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds

von Chen, Justin Y.
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 7 of 7 (2023)