Fetching the paper…
Reading the bibliography…
Privacy preservation is becoming an increasingly important issue in data mining and machine learning.
R. Agrawal and R. Srikant, “Privacy-preserving data mining,” In Proc. ACM SIGMOD International Conference on Management of Data
2000
Earlier work this paper cites.
O. Goldreich. The Foundations of Cryptograph
2004
Earlier work this paper cites.
J. Vaidya, C. Clifton, and M. Zhu, Privacy-Preserving Data Mining
2005
Earlier work this paper cites.
L. Wang and L. Guo, “Robust consensus and soft control of multi-agent systems with noises,” J. Syst. Sci. Complexity
2008
Earlier work this paper cites.
C. Dwork. Differential privacy: A survey of results. In Theory and Applications of Models of Computation
2008
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Trans. Autom. Control
2009
Earlier work this paper cites.
A. Nedić, A. Ozdaglar, and P. A. Parrilo, “Constrained consensus and optimization in multi-agent networks,” IEEE Trans. Autom. Control
2010
Earlier work this paper cites.
S. S. Ram, A. Nedić, and V. V. Veeravalli, “Distributed stochastic subgradient projection algorithms for convex optimization,” J. Optim. Theory Appl
2010
Earlier work this paper cites.
B. Johansson, M. Rabi, and M. Johansson, “A randomized incremental subgradient method for distributed optimization in networked systems,” SIAM J. Optim
2010
Earlier work this paper cites.
S. Han, W. Ng, L. Wan, and V. Lee, “Privacy-preserving gradient-descent methods,” IEEE Trans. Know. Data Eng
2010
Cited alongside, same era.
I. Lobel and A. Ozdaglar, Distributed subgradient methods for convex optimization over random networks, IEEE Trans. Automat. Control,
2011
Cited alongside, same era.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning,
2011
Cited alongside, same era.
K. Srivastava and A. Nedić, “Distributed asynchronous constrained stochastic optimization,” IEEE J. Selec. Top. Sig. Process
2011
Cited alongside, same era.
A. Nedić, “Asynchronous broadcast-based convex optimization over a network,” IEEE Trans. Autom. Control
2011
Cited alongside, same era.
F. Yan, S. Sundaram, S. Vishwanathan, and Y. Qi, “Distributed autonomous online learning: Regrets and intrinsic privacy-preserving properties,” IEEE Trans. Know. Data Eng
2013
Later among the works it cites.
G. M. Fung and O. L. Mangasarian, “Privacy-preserving linear and nonlinear approximation via linear programming,” Optimization Methods and Software,
2013
Later among the works it cites.
W. Shi, Q. Ling, K. Yuan, G. Wu, and W. Yin, “On the linear convergence of the ADMM in decentralized consensus optimization,” IEEE Trans. Sig. Proc
2014
Later among the works it cites.
Y. Lou, G. Shi, K. H. Johansson, and Y. Hong, “Approximate projected consensus for convex intersection computation: Convergence analysis and critical error angle,” IEEE Trans. Autom. Control
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. C. Duchi, A. Agarwal, and M. J. Wainwright, “Dual averaging for distributed optimization: Convergence analysis and network scaling,” IEEE Trans. Autom. Control
2012
Cited alongside, same era.
G. Shi and K. H. Johansson, “Randomized optimal consensus of multi-agent systems,” Automatica
2012
Cited alongside, same era.
Y. Lou, G. Shi, K. H. Johansson, and Y. Hong, “Convergence of random sleep algorithms for optimal consensus,” Systems & Control Letters
2013
Cited alongside, same era.
Cited in the paper.
Cited in the paper.
2014
Later among the works it cites.
2014
Later among the works it cites.
Z. Huang, S. Mitra, and N. Vaidya, “Differentially private distributed optimization,” Proc. 2015 International Conf. Distributed Computing and Networking
2015
Closest in time.