Media Summary: A Google TechTalk, presented by Abhradeep Guha Thakurta, 2020/0814 Full Title: ( Machine Learning in Finance Workshop: 2020 Virtual Edition Hosted by Bloomberg, The Fu Foundation School of Engineering ... Paper by Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan presented at Crypto 2020 See ...

Nearly Optimal Algorithm For Private - Detailed Analysis & Overview

A Google TechTalk, presented by Abhradeep Guha Thakurta, 2020/0814 Full Title: ( Machine Learning in Finance Workshop: 2020 Virtual Edition Hosted by Bloomberg, The Fu Foundation School of Engineering ... Paper by Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan presented at Crypto 2020 See ... Recent work of Erlingsson et al (2019) demonstrates that random shuffling amplifies differential privacy guarantees of locally ... In this work we show that for any mechanism design problem with the objective of maximizing social welfare, the exponential ... Talk by Hanna Komlos, joint work with Michael A. Bender, Alex Conway, Martin Farach-Colton, Michal Koucky, William Kuszmaul ...

Speaker: Alireza Fallah, Massachusetts Institute of Technology Date: July 29th, 2022 Abstract: ... Speaker: Audra McMillan (Apple) Title: Hiding among the clones: a simple and Speaker: Robert Kleinberg, Cornell University Friday, September 26th, 2025 ... A Google TechTalk, 2020/7/29, presented by Adam Smith, Boston University ABSTRACT: We show that a classic

Photo Gallery

(Nearly) Optimal Algorithm for Private Online Learning
Emily Diana: Optimal, Truthful, and Private Securities Lending
Nearly Optimal Robust Secret Sharing against Rushing Adversaries
Vitaly Feldman: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling
The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal
FOCS 2024 Nearly Optimal List Labeling
Optimal and Differentially Private Data Acquisition: Central and Local Mechanisms
Jinya Lin, Univ. of Hong Kong,  Optimal Differentially Private Algorithms for k-Means Clustering
PODS22 A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries
TCS+ Talk: Audra McMillan (Apple)
E3.C — Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem
Near-Optimal Algorithms for Omniprediction
View Detailed Profile
(Nearly) Optimal Algorithm for Private Online Learning

(Nearly) Optimal Algorithm for Private Online Learning

A Google TechTalk, presented by Abhradeep Guha Thakurta, 2020/0814 Full Title: (

Emily Diana: Optimal, Truthful, and Private Securities Lending

Emily Diana: Optimal, Truthful, and Private Securities Lending

Machine Learning in Finance Workshop: 2020 Virtual Edition Hosted by Bloomberg, The Fu Foundation School of Engineering ...

Nearly Optimal Robust Secret Sharing against Rushing Adversaries

Nearly Optimal Robust Secret Sharing against Rushing Adversaries

Paper by Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan presented at Crypto 2020 See ...

Vitaly Feldman: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling

Vitaly Feldman: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling

Recent work of Erlingsson et al (2019) demonstrates that random shuffling amplifies differential privacy guarantees of locally ...

The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal

The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal

In this work we show that for any mechanism design problem with the objective of maximizing social welfare, the exponential ...

FOCS 2024 Nearly Optimal List Labeling

FOCS 2024 Nearly Optimal List Labeling

Talk by Hanna Komlos, joint work with Michael A. Bender, Alex Conway, Martin Farach-Colton, Michal Koucky, William Kuszmaul ...

Optimal and Differentially Private Data Acquisition: Central and Local Mechanisms

Optimal and Differentially Private Data Acquisition: Central and Local Mechanisms

Speaker: Alireza Fallah, Massachusetts Institute of Technology Date: July 29th, 2022 Abstract: ...

Jinya Lin, Univ. of Hong Kong,  Optimal Differentially Private Algorithms for k-Means Clustering

Jinya Lin, Univ. of Hong Kong, Optimal Differentially Private Algorithms for k-Means Clustering

Jinya Lin, Univ. of Hong Kong,

PODS22 A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries

PODS22 A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries

A

TCS+ Talk: Audra McMillan (Apple)

TCS+ Talk: Audra McMillan (Apple)

Speaker: Audra McMillan (Apple) Title: Hiding among the clones: a simple and

E3.C — Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem

E3.C — Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem

ICALP-A 2020 Near

Near-Optimal Algorithms for Omniprediction

Near-Optimal Algorithms for Omniprediction

Speaker: Robert Kleinberg, Cornell University Friday, September 26th, 2025 ...

Private Algorithms with Minimal Space

Private Algorithms with Minimal Space

A Google TechTalk, 2020/7/29, presented by Adam Smith, Boston University ABSTRACT: We show that a classic