research
∙
08/20/2023
Improved Differentially Private Densest Subgraph: Local and Purely Additive
We study the Densest Subgraph problem under the additional constraint of...
share
research
∙
01/31/2022
Agnostic Learnability of Halfspaces via Logistic Loss
We investigate approximation guarantees provided by logistic regression ...
research
∙
08/08/2020
Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning
Federated learning is a challenging optimization problem due to the hete...
research
∙
02/19/2020
