Fetching the paper…
Reading the bibliography…
We present three new algorithms for constructing differentially private synthetic data---a sanitized version of a sensitive dataset that approximately preserves the answers to a large collection of statistical queries.
Online non-convex learning: Following the perturbed leader is optimal
Suggala, A. S. and Netrapalli, P · 1903
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y. and Schapire, R. E · 1997
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
Kearns, M. J · 1998
Earlier work this paper cites.
Efficient algorithms for online decision problems
Kalai, A. T. and Vempala, S · 2004
Earlier work this paper cites.
Error limiting reductions between classification tasks
Beygelzimer, A., Dani, V., Hayes, T. P., Langford, J., and Zadrozny, B · 2005
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Dwork, C., McSherry, F., Nissim, K., and Smith, A · 2006
Earlier work this paper cites.
Mechanism design via differential privacy
McSherry, F. and Talwar, K · 2007
Earlier work this paper cites.
Robust reductions from ranking to classification
Balcan, M., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., and Sorkin, G. B · 2008
Earlier work this paper cites.
A learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., and Roth, A · 2008
Earlier work this paper cites.
A multiplicative weights mechanism for privacy-preserving data analysis
Hardt, M. and Rothblum, G. N · 2010
Earlier work this paper cites.
Pcps and the hardness of generating private synthetic data
Ullman, J. and Vadhan, S · 2011
Earlier work this paper cites.
A simple and practical algorithm for differentially private data release
Hardt, M., Ligett, K., and McSherry, F · 2012
Earlier work this paper cites.
Differential privacy for the analyst via private equilibrium computation
Hsu, J., Roth, A., and Ullman, J · 2013
Cited alongside, same era.
The geometry of differential privacy: the sparse and approximate cases
Nikolov, A., Talwar, K., and Zhang, L · 2013
Cited alongside, same era.
Dual query: Practical private query release for high dimensional data
Gaboardi, M., Arias, E. J. G., Hsu, J., Roth, A., and Wu, Z. S · 2014
Cited alongside, same era.
Oracle-based robust optimization via online learning
Ben-Tal, A., Hazan, E., Koren, T., and Mannor, S · 2015
Cited alongside, same era.
Efficient algorithms for privately releasing marginals via convex relaxations
Dwork, C., Nikolov, A., and Talwar, K · 2015
Cited alongside, same era.
The matrix mechanism: optimizing linear counting queries under differential privacy
Li, C., Miklau, G., Hay, M., McGregor, A., and Rastogi, V · 2015
UCI machine learning repository, 2017
Dua, D. and Graff, C · 2017
Later among the works it cites.
The U.S. census bureau adopts differential privacy
Abowd, J. M · 2018
Later among the works it cites.
A reductions approach to fair classification
Agarwal, A., Beygelzimer, A., Dudík, M., Langford, J., and Wallach, H. M · 2018
Later among the works it cites.
Unleashing linear optimizers for group-fair learning and optimization
Alabi, D., Immorlica, N., and Kalai, A · 2018
Later among the works it cites.
Fingerprinting codes and the price of approximate differential privacy
Bun, M., Ullman, J., and Vadhan, S. P · 2018
Later among the works it cites.
Preventing fairness gerrymandering: Auditing and learning for subgroup fairness
Kearns, M. J., Neel, S., Roth, A., and Wu, Z. S · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An improved private mechanism for small databases
Nikolov, A · 2015
Cited alongside, same era.
Learning reductions that really work
Beygelzimer, A., III, H. D., Langford, J., and Mineiro, P · 2016
Cited alongside, same era.
Concentrated differential privacy: Simplifications, extensions, and lower bounds
Bun, M. and Steinke, T · 2016
Cited alongside, same era.
The computational power of optimization in online learning
Hazan, E. and Koren, T · 2016
Cited alongside, same era.
Efficient algorithms for adversarial contextual learning
Syrgkanis, V., Krishnamurthy, A., and Schapire, R. E · 2016
Cited alongside, same era.
Answering n 2+o(1) {}^{\mbox{2+o(1)}} counting queries with differential privacy is hard
Ullman, J · 2016
Cited alongside, same era.
Optimizing error of high-dimensional statistical queries under differential privacy
McKenna, R., Miklau, G., Hay, M., and Machanavajjhala, A · 2018
Later among the works it cites.
Towards instance-optimal private query release
Błasiok, J., Bun, M., Nikolov, A., and Steinke, T · 2019
Later among the works it cites.
Consistency with external knowledge: The topdown algorithm, 2019
Kifer, D · 2019
Later among the works it cites.
How to use heuristics for differential privacy
Neel, S., Roth, A., and Wu, Z. S · 2019
Later among the works it cites.
Oracle efficient private non-convex optimization
Neel, S., Roth, A., Vietri, G., and Wu, Z. S · 2020
Closest in time.