The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Distributed Autonomous Online Learning: Regrets and Intrinsic Privacy-Preserving Properties
Open accessAbstract
Online learning has become increasingly popular on handling massive data. The sequential nature of online learning, however, requires a centralized learner to store data and update parameters. In this paper, we consider online learning with distributed data sources. The autonomous learners update local parameters based on local data sources and periodically exchange information with a small subset of neighbors in a communication network. We derive the regret bound for strongly convex functions that generalizes the work by Ram et al. for convex functions. More importantly, we show that our algorithm has intrinsic privacy-preserving properties, and we prove the sufficient and necessary conditions for privacy preservation in the network. These conditions imply that for networks with greater-than-one connectivity, a malicious learner cannot reconstruct the subgradients (and sensitive raw data) of other learners, which makes our algorithm appealing in privacy-sensitive applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Validity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
Monte Carlo Strategies in Scientific Computing
Hesterberg, T. (2002) · Technometrics · doi:10.1198/tech.2002.s85 · Cited by 1,409
Parallelized Stochastic Gradient Descent
Zinkevich, M., Weimer, M., Li, L., & Smola, A. J. (2010) · Cited by 1,124
Logarithmic regret algorithms for online convex optimization
Hazan, E., Agarwal, A., & Kale, S. (2007) · Machine Learning · doi:10.1007/s10994-007-5016-8 · Cited by 828
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814
Privacy-preserving logistic regression
Chaudhuri, K., & Monteleoni, C. (2008) · Cited by 525
Generic properties and control of linear structured systems: a survey
Dion, J.-M., Commault, C., & van der Woude, J. (2003) · Automatica · doi:10.1016/s0005-1098(03)00104-3 · Cited by 522
Modern control theory (3rd ed.)
Brogan, W. L. (1991) · Prentice-Hall, Inc eBooks · Cited by 207
Langford, J. C., Smola, A. J., & Zinkevich, M. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0911.0491 · Cited by 178
Privacy-Preserving Data Mining
Clifton, C., Kantarcıoğlu, M., & Vaidya, J. (2005) · Springer eBooks · doi:10.1007/11362197_11 · Cited by 137
SVM Classifier Estimation from Group Probabilities
ping, S. R. (2010) · International Conference on Machine Learning · Cited by 68
Distributed Dual Averaging In Networks
Agarwal, A., Wainwright, M. J., & Duchi, J. C. (2010) · neural information processing systems · Cited by 55
Improved Risk Tail Bounds for On-Line Algorithms
Cesa‐Bianchi, N., & Gentile, C. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.911292 · Cited by 51
Efficient Methods for Privacy Preserving Face Detection
Avidan, S., & Butman, M. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0012 · Cited by 29
Improved risk tail bounds for on-line algorithms
Cesa‐Bianchi, N., & Gentile, C. (2005) · Cited by 14
Linear iterative strategies for transmitting streams of values through sensor networks
Sundaram, S., & Hadjicostis, C. N. (2009) · 2006 14th Mediterranean Conference on Control and Automation · doi:10.1109/med.2009.5164523 · Cited by 3
Self-citation
Cited by
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
On the Convergence of Decentralized Gradient Descent
Yuan, K., Ling, Q., & Yin, W. (2013) · arXiv · doi:10.48550/arxiv.1310.7063 · Cited by 635
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
A systems and control perspective of CPS security
Dibaji, S. M., Pirani, M., Flamholz, D. B., Annaswamy, A. M., Johansson, K. H., & Chakrabortty, A. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.04.011 · Cited by 559
A Proximal Gradient Algorithm for Decentralized Composite Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2461520 · Cited by 307
Metadata
- Authors
- Yan, F., Sundaram, S., Vishwanathan, S. V. N., & Qi, Y.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2013-11
- Volume
- 25
- Issue
- 11
- Pages
- 2483-2493
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2149778463
- Cited by
- 263
- References
- 18
- FWCI
- 16.56
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
