Privacy Aware Learning
We study statistical risk minimization problems under a privacy model in which the data is kept confidential even from the learner. In this local privacy framework, we establish...
Publications
4 shownAdaptive Subgradient Methods for Online Learning and Stochastic Optimization.
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative grad...
Efficient projections onto the<i>l</i><sub>1</sub>-ball for learning in high dimensions
We describe efficient algorithms for projecting a vector onto the ℓ1-ball. We present two methods for projection. The first performs exact projection in O(n) expected time, wher...
Composite objective mirror descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known first...
Frequent Co-Authors
Researcher Info
- h-index
- 4
- Publications
- 4
- Citations
- 10,239
- Institution
- University of California, Berkeley
External Links
Identifiers
- ORCID
- 0000-0003-0045-7185
Impact Metrics
h-index
4
h-index: Number of publications with at least h citations each.