We study the problem of locally private mean estimation of high-dimensio...
Constrained k-submodular maximization is a general framework that captur...
Multitask learning is widely used in practice to train a low-resource ta...
In this work, we describe a generic approach to show convergence with hi...
We study the application of variance reduction (VR) techniques to genera...
Existing analysis of AdaGrad and other adaptive methods for smooth conve...
In this paper, we study the finite-sum convex optimization problem focus...
Given a data set of size n in d'-dimensional Euclidean space, the
k-mean...
We design differentially private algorithms for the bandit convex
optimi...
Variational inequalities with monotone operators capture many problems o...
In this note, we describe a simple approach to obtain a differentially
p...
As important decisions about the distribution of society's resources bec...
We provide new adaptive first-order methods for constrained convex
optim...
We study the problem of maximizing a non-monotone submodular function su...
In this work, we give a new parallel algorithm for the problem of maximi...
In the matroid intersection problem, we are given two matroids of rank r...
We present new differentially private algorithms for learning a large-ma...
We study parallel algorithms for the problem of maximizing a non-negativ...
We consider fast algorithms for monotone submodular maximization subject...
We consider the problem of maximizing the multilinear extension of a
sub...
We study a recent model of collaborative PAC learning where k players wi...
In this paper, we study the tradeoff between the approximation guarantee...
A function f: Z_+^E →R_+ is DR-submodular if
it satisfies f( + χ_i) -f (...
We study the tradeoff between the statistical error and communication co...
Submodular function minimization is a fundamental optimization problem t...