Supervised Learning Under Distributed Features
Open accessThe DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
Abstract
This paper studies the problem of learning under both large datasets and large-dimensional feature space scenarios. The feature information is assumed to be spread across agents in a network, where each agent observes some of the features. Through local cooperation, the agents are supposed to interact with each other to solve an inference problem and converge towards the global minimizer of an empirical risk. We study this problem exclusively in the primal domain, and propose new and effective distributed solutions with guaranteed convergence to the minimizer with linear rate under strong convexity. This is achieved by combining a dynamic diffusion construction, a pipeline strategy, and variance-reduced techniques. Simulation results illustrate the conclusions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Consensus algorithms were also developed in [158] to jointly learn a model under the decentralized network while keeping the distributed data features locally.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [158]
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,375
(2010) · Cited by 8,261
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Large Scale Distributed Deep Networks
Dean, J. B., Corrado, G. S., Monga, R., Chen, K., Devin, M., Mao, M., Ranzato, M., Senior, A., Tucker, P. A., Yang, K., et al. (2012) · neural information processing systems · Cited by 4,489
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 · cited 3×
“under some mild conditions on A [19], [46]–[49].”
BackgroundMethodInfluentialWeik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Penrose, M. (2003) · doi:10.1093/acprof:oso/9780198506263.001.0001 · Cited by 2,480
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439 · cited 2×
“After sufficient iterations, it is well-known that under some mild conditions on A [19], [47]–[50].”
BackgroundConvergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
Tseng, P. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017501703105 · Cited by 1,989 · cited 2×
“With regards to the large feature space, one may be motivated to consider coordinate descent techniques [27], [28], which pursue optimization one coordinate y n at a time.”
BackgroundAccelerating Stochastic Gradient Descent using Predictive Variance Reduction
Johnson, R., & Zhang, T. (2013) · Cited by 1,889
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
The Tradeoffs of Large-Scale Learning
Bottou, L., & Bousquet, O. (2011) · Optimization for Machine Learning · doi:10.7551/mitpress/8996.003.0015 · Cited by 1,128
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
A Survey on Multi-view Learning
Xu, C., Tao, D., & Xu, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.5634 · Cited by 942 · cited 1×
“Likewise, in multi-view learning problems [8], [9], the observed model is represented by multiple feature sets.”
BackgroundDistributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901 · cited 1×
“For instance, in sensor network applications, [6], [7], multiple sensors are normally employed to monitor an environment; the sensors are distributed over space and can be used to collect different measurements.”
BackgroundA survey of multi-view machine learning
Sun, S. (2013) · Neural Computing and Applications · doi:10.1007/s00521-013-1362-6 · Cited by 878 · cited 1×
“Likewise, in multi-view learning problems [8], [9], the observed model is represented by multiple feature sets.”
BackgroundSAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
Defazio, A., Bach, F., & Lacoste-Julien, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.0202 · Cited by 834 · cited 3×
“We will also exploit variance-reduced techniques [44] and a pipeline strategy [45] to obtain a reduced complexity algorithm that requires only O (1) operations per iteration.”
BackgroundMethodOn the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2304432 · Cited by 820 · cited 1×
“Other useful approaches to solving problems of the form (3) are the Alternating Direction Method of Multipliers (ADMM) [22], [34], [35] and primal dual-methods [18], [25], [36], [37].”
MethodSelf-citationKar, S., & Moura, J. M. F. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007111 · Cited by 691 · cited 2×
“In this work, we focus on empirical risk minimization problems, which, by ergodicity arguments, provide a good approximation for average risks [7], [14]–[20].”
Background(2004) · Choice Reviews Online · doi:10.5860/choice.41-5348 · Cited by 677
Adaptation, Learning, and Optimization over Networks
Sayed, A. H. (2014) · Foundations and Trends in Machine Learning · doi:10.1561/2200000051 · Cited by 667 · cited 6×
“It is known, e.g., from [14], [51], [53], [54] that under constant step-size adaptation, and due to this gradient noise, recursion (15) will only approach an O ( µ ) − neighborhood around the global minimizer of (3).”
BackgroundInfluentialSelf-citationStochastic dual coordinate ascent methods for regularized lossPreprint
Shalev‐Shwartz, S., & Zhang, T. (2013) · Cited by 637
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587 · cited 1×
“If J is large enough, it is known that ᾱn,k will approach the desired average ᾱn across all agents [22].”
BackgroundSelf-citationStability and Convergence Properties of Dynamic Average Consensus Estimators
Freeman, R. A., Yang, P., & Lynch, K. M. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377078 · Cited by 506 · cited 3×
“It can be shown that if the signals change slowly, the x i,k will track the mean ¯ d i = 1 K =1 d i,k well [38], [39].”
BackgroundMethodOn the convergence of the coordinate descent method for convex differentiable minimization
Luo, Z. Q., & Tseng, P. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00939948 · Cited by 502 · cited 1×
“With regards to the large feature space, one may be motivated to consider coordinate descent techniques [27], [28], which pursue optimization one coordinate y n at a time.”
BackgroundDiscrete-time dynamic average consensus
Zhu, M., & Martínez, S. (2010) · Automatica · doi:10.1016/j.automatica.2009.10.021 · Cited by 488
NEXT: In-Network Nonconvex Optimization
Lorenzo, P. D., & Scutari, G. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2524588 · Cited by 473 · cited 2×
“The motivation for dynamic diffusion is similar to what been used before in the distributed optimization literature [40]–[42], with two main differences.”
MethodMulti-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444 · cited 2×
“Other useful approaches to solving problems of the form (3) are the Alternating Direction Method of Multipliers (ADMM) [22], [34], [35] and primal dual-methods [18], [25], [36], [37].”
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
Self-citationDistributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
Chang, T.-H., Nedic, A., & Scaglione, A. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2308612 · Cited by 401 · cited 1×
“Other useful approaches to solving problems of the form (3) are the Alternating Direction Method of Multipliers (ADMM) [22], [34], [35] and primal dual-methods [18], [25], [36], [37].”
MethodThe Perron-Frobenius theorem: some of its applications
Pillai, S. U., Suel, T., & Cha, S. (2005) · IEEE Signal Processing Magazine · doi:10.1109/msp.2005.1406483 · Cited by 338 · cited 2×
“After sufficient iterations, it is well-known that under some mild conditions on A [19], [47]–[50].”
BackgroundARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
Peng, Z., Xu, Y., Yan, M., & Yin, W. (2016) · SIAM Journal on Scientific Computing · doi:10.1137/15m1024950 · Cited by 247
Distributed delayed stochastic optimization
Agarwal, A., & Duchi, J. C. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426626 · Cited by 243 · cited 1×
“Fortunately, problems involving delays in gradient calculations are well-studied in the distributed machine learning and signal processing literature [57]–[59].”
BackgroundA Linear Algorithm for Optimization Over Directed Graphs With Geometric Convergence
Xin, R., & Khan, U. A. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2834316 · Cited by 243
Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
Shalev‐Shwartz, S., & Zhang, T. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.1873 · Cited by 240
Kar, S., & Moura, J. M. F. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2127446 · Cited by 231 · cited 3×
“Compared with other distributed learning algorithms [25], [26], [52], the convergence behavior of PVRD 2 closer to the behavior of single agent SGD than multi-agent SGD; this is also clear from recursion (80) in the proof.”
BackgroundMota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Puschel, M. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2182347 · Cited by 210 · cited 1×
“Other useful approaches to solving problems of the form (3) are the Alternating Direction Method of Multipliers (ADMM) [22], [34], [35] and primal dual-methods [18], [25], [36], [37].”
MethodDual decomposition for multi-agent distributed optimization with coupling constraints
Falsone, A., Margellos, K., Garatti, S., & Prandini, M. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.003 · Cited by 205 · cited 1×
“Problems of this type have been pursued before in the literature by using duality arguments, such as those in [13], [15], [22]–[24].”
MethodExact Diffusion for Distributed Optimization and Learning—Part I: Algorithm Development
Yuan, K., Ying, B., Zhao, X., & Sayed, A. H. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2875898 · Cited by 200 · cited 3×
“To this end, we can apply the exact diffusion algorithm developed in [18], [51] to solve (22).”
BackgroundMethodSelf-citationMetzler, C., Hobbs, B. F., & Pang, J.-S. (2003) · Networks and Spatial Economics · doi:10.1023/a:1023907818360 · Cited by 190
Convergence Rate of Incremental Subgradient Algorithms
Nedić, A., & Bertsekas, D. (2001) · Applied Optimization · doi:10.1007/978-1-4757-6594-6_11 · Cited by 190
Distributed Pareto Optimization via Diffusion Strategies
Chen, J., & Sayed, A. H. (2013) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2013.2246763 · Cited by 177 · cited 1×
“In this work, we focus on empirical risk minimization problems, which, by ergodicity arguments, provide a good approximation for average risks [7], [14]–[20].”
BackgroundSelf-citationDSA: Decentralized Double Stochastic Averaging Gradient Algorithm
Mokhtari, A., & Ribeiro, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.04216 · Cited by 130
A new class of distributed optimization algorithms: Application to regression of distributed data
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2012) · Optimization Methods and Software · doi:10.1080/10556788.2010.511669 · Cited by 123 · cited 2×
“Next, we compare our algorithm to the method proposed in [46] with some modification, which can be viewed as the deterministic fullgradient version of our algorithm without pipeline.”
BackgroundMethodDistributed Learning for Stochastic Generalized Nash Equilibrium Problems
Yu, C.-K., van der Schaar, M., & Sayed, A. H. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2695451 · Cited by 119 · cited 2×
“Another example is the Cournot competition problem in networked markets [10]–[12], where individual factories have information about their local markets, which will not share with each other.”
BackgroundSelf-citationSDCA without Duality, Regularization, and Individual ConvexityPreprint
Shalev‐Shwartz, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.01582 · Cited by 103 · cited 1×
“The same difficulties mentioned above for the dual methods will again arise if coordinate descent solutions are implemented in the dual domain [23], [32], [33].”
BackgroundExact Diffusion for Distributed Optimization and Learning—Part II: Convergence Analysis
Yuan, K., Ying, B., Zhao, X., & Sayed, A. H. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2875883 · Cited by 103 · cited 3×
“To this end, we can apply the exact diffusion algorithm developed in [18], [51] to solve (22).”
BackgroundMethodSelf-citationDecentralized Consensus Optimization With Asynchrony and Delays
Wu, T., Yuan, K., Ling, Q., Yin, W., & Sayed, A. H. (2018) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2695121 · Cited by 99
Self-citationDictionary Learning Over Distributed Models
Chen, J., Towfic, Z. J., & Sayed, A. H. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385045 · Cited by 95 · cited 3×
“That is, we have a “cost-of-sum” form similar to what was discussed in [13].”
BackgroundMethodResultSelf-citationA Push-Pull Gradient Method for Distributed Optimization in Networks
Pu, S., Shi, W., Xu, J., & Nedic, A. (2018) · 2018 IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619047 · Cited by 94
Cournot competition in networked markets
Bimpikis, K., Ehsani, S., & İlkılıç, R. (2014) · ACM Conference on Economics and Computation (EC) · doi:10.1145/2600057.2602882 · Cited by 69 · cited 1×
“Another example is the Cournot competition problem in networked markets [10]–[12], where individual factories have information about their local markets, which will not share with each other.”
BackgroundVariance-Reduced Stochastic Learning by Networked Agents Under Random Reshuffling
Yuan, K., Ying, B., Liu, J., & Sayed, A. H. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2872003 · Cited by 67 · cited 1×
“In the simulation, we compare this implementation it with SAGA+Exact diffusion as proposed in [60].”
MethodSelf-citationStochastic Learning Under Random Reshuffling With Constant Step-Sizes
Ying, B., Yuan, K., Vlaski, S., & Sayed, A. H. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2878551 · Cited by 51
Self-citationVariance-Reduced Stochastic Learning Under Random Reshuffling
Ying, B., Yuan, K., & Sayed, A. H. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2968280 · Cited by 43
Self-citationStochastic gradient descent with finite samples sizes
Yuan, K., Ying, B., Vlaski, S., & Sayed, A. H. (2016) · Machine learning for signal processing ... · doi:10.1109/mlsp.2016.7738878 · Cited by 23 · cited 2×
“A second drawback is that the stochasticgradient implementation (19)–(21) will converge to a small neighborhood around the exact minimizer rather than to the exact minimizer itself [14], [51].”
BackgroundSelf-citationA Push-Pull Gradient Method for Distributed Optimization in NetworksPreprint
Pu, S., Shi, W., Xu, J., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.07588 · Cited by 21 · cited 1×
“The motivation for dynamic diffusion is similar to what been used before in the distributed optimization literature [40]–[42], with two main differences.”
MethodCoordinate-Descent Diffusion Learning by Networked Agents
Wang, C., Zhang, Y., Ying, B., & Sayed, A. H. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2757903 · Cited by 18 · cited 1×
“For instance, in the primal domain [29]–[31], they will generally require two time-scales: one scale governs the rate for updating the gradients and a second faster scale for running averaging iterations multiple times.”
BackgroundSelf-citationDistributed big-data optimization via block-iterative convexification and averaging
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263982 · Cited by 18 · cited 2×
“,z i+1 N,k} as one long vector, the update (30)—(32) resembles a coordinate descent algorithm [28], [30].”
BackgroundMethodExact Diffusion for Distributed Optimization and Learning --- Part I: Algorithm DevelopmentPreprint
Yuan, K., Ying, B., Zhao, X., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.05122 · Cited by 16 · cited 3×
“To this end, we can apply the exact diffusion algorithm developed in [18], [51] to solve (22).”
BackgroundMethodSelf-citationDoubly random parallel stochastic methods for large scale learning
Mokhtari, A., Koppel, A., & Ribeiro, A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526120 · Cited by 13 · cited 1×
“For instance, in the primal domain [29]–[31], they will generally require two time-scales: one scale governs the rate for updating the gradients and a second faster scale for running averaging iterations multiple times.”
BackgroundVariance-Reduced Stochastic Learning under Random ReshufflingPreprint
Ying, B., Yuan, K., & Sayed, A. H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.01383 · Cited by 12
Self-citationDiffusion gradient boosting for networked learning
Ying, B., & Sayed, A. H. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952609 · Cited by 11 · cited 1×
“The same difficulties mentioned above for the dual methods will again arise if coordinate descent solutions are implemented in the dual domain [23], [32], [33].”
BackgroundSelf-citationAN EXPONENTIALLY CONVERGENT ALGORITHM FOR LEARNING UNDER DISTRIBUTED FEATURES
Ying, B., Yuan, K., & Sayed, A. H. (2018) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2018.8439886 · Cited by 2 · cited 1×
“Formally, we consider an empirical risk of the form: A short version of this work appears in the conference publication [1].”
BackgroundSelf-citationVariance-Reduced Stochastic Learning by Networked Agents under Random ReshufflingPreprint
Yuan, K., Ying, B., Liu, J., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.01384 · Cited by 1
Self-citation
Research works printed but not linked: 3
- [19] A. Nedi´ c and A. Ozdaglar, 'Distributed subgradient methods for multiagent optimization,' IEEE Transactions on Automatic Control , vol. 54, no. 1, pp. 48-61, 2009. -
- [5] S. Boyd and L. Vandenberghe, Convex Optimization , Cambridge University Press, 2004. -
- [49] R. A. Horn and C. R. Johnson, Matrix analysis , Cambridge university press, 1990. -
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“Consensus algorithms were also developed in [158] to jointly learn a model under the decentralized network while keeping the distributed data features locally.”
MethodFedBCD: A Communication-Efficient Collaborative Learning Framework for Distributed Features
Liu, Y., Zhang, X., Kang, Y., Li, L., Chen, T., Hong, M., & Yang, Q. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3198176 · Cited by 257
“[19] propose a dynamic diffusion approach which requires communications between parties with its related neighbours.”
BackgroundA Sharp Estimate on the Transient Time of Distributed Stochastic Gradient Descent
Pu, S., Olshevsky, A., & Paschalidis, I. C. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3126253 · Cited by 72
“gent i only, and all the agents communicate and exchange information over a network. Problems in the form of (1.1) find applications in multi-agent target seeking [31, 8], distributed machine learning [13, 24, 10, 2, 45, 1, 4], and wireless networks [9, 20, 2], among other scenarios. In order to solve (1.1), we assume…”
BackgroundInfluentialPu, S., Olshevsky, A., & Paschalidis, I. C. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975212 · Cited by 61
“There is a great need for techniques that train such models quickly and reliably in a distributed fashion over networks where the individual processors or GPUs may be scattered across the globe and communicate over an unreliable network, which may suffer from message losses, delays, and asynchrony (see [1], [2], [29],…”
BackgroundHierarchical Federated Learning for Hybrid Data Partitioning Across Multitype Sensors
Su, L., & Lau, V. K. N. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3051382 · Cited by 37
“Recently, in [12]–[14], vertical data partitioning has been studied to extend FL to embrace systems with distributed features.”
BackgroundMethodInfluential
Metadata
- Authors
- Ying, B., Yuan, K., & Sayed, A. H.
- Affiliations
- École Polytechnique Fédérale de Lausanne (CH)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2019-02-15
- Volume
- 67
- Issue
- 4
- Pages
- 977-992
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2805185133
- Cited by
- 50
- References
- 67
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 4 · 2023: 4 · 2022: 8 · 2021: 13 · 2020: 7 · 2019: 9
- FWCI
- 4.49
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- arXiv (Cornell University)
- Funders
- National Science Foundation (CCF-1011918)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
- Keywords
- distributed learning, supervised learning, large-scale datasets, high-dimensional feature space, multi-agent systems, strong convexity, linear convergence, variance reduction, empirical risk minimization
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.