REVIEW 69 references
Event-Driven Online Vertical Federated Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Online learning is more adaptable to real-world scenarios in Vertical Federated Learning (VFL) compared to offline learning. However, integrating online learning into VFL presents challenges due to the unique nature of VFL, where clients possess non-intersecting feature sets for the same sample. In real-world scenarios, the clients may not receive data streaming for the disjoint features for the same entity synchronously. Instead, the data are typically generated by an \emph{event} relevant to only a subset of clients. We are the first to identify these challenges in online VFL, which have been overlooked by previous research. To address these challenges, we proposed an event-driven online VFL framework. In this framework, only a subset of clients were activated during each event, while the remaining clients passively collaborated in the learning process. Furthermore, we incorporated \emph{dynamic local regret (DLR)} into VFL to address the challenges posed by online learning problems with non-convex models within a non-stationary environment. We conducted a comprehensive regret analysis of our proposed framework, specifically examining the DLR under non-convex conditions with event-driven online VFL. Extensive experiments demonstrated that our proposed framework was more stable than the existing online VFL framework under non-stationary data conditions while also significantly reducing communication and computation costs.
Reference graph
Works this paper leans on
-
[1]
Competing in the dark: An efficient algorithm for bandit linear optimization
Jacob D Abernethy, Elad Hazan, and Alexander Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. 2009
work page 2009
-
[2]
Learning in non-convex games with an optimization oracle
Naman Agarwal, Alon Gonen, and Elad Hazan. Learning in non-convex games with an optimization oracle. In Conference on Learning Theory, pp.\ 18--29. PMLR, 2019
work page 2019
-
[3]
Dynamic local regret for non-convex online forecasting
Sergul Aydore, Tianhao Zhu, and Dean P Foster. Dynamic local regret for non-convex online forecasting. Advances in neural information processing systems, 32, 2019
2019
-
[4]
Jonas Beuchert, Friedrich Solowjow, Sebastian Trimpe, and Thomas Seel. Overcoming bandwidth limitations in wireless sensor networks by exploitation of cyclic signal patterns: An event-triggered learning approach. Sensors, 20 0 (1): 0 260, 2020
work page 2020
-
[5]
Compressed-vfl: Communication-efficient learning with vertically partitioned data
Timothy J Castiglia, Anirban Das, Shiqiang Wang, and Stacy Patterson. Compressed-vfl: Communication-efficient learning with vertically partitioned data. In International Conference on Machine Learning, pp.\ 2738--2766. PMLR, 2022
work page 2022
-
[6]
Vafl: a method of vertical asynchronous federated learning
Tianyi Chen, Xiao Jin, Yuejiao Sun, and Wotao Yin. Vafl: a method of vertical asynchronous federated learning. arXiv preprint arXiv:2007.06081, 2020
arXiv 2007
-
[7]
Distributed online optimization over a heterogeneous network with any-batch mirror descent
Nima Eshraghi and Ben Liang. Distributed online optimization over a heterogeneous network with any-batch mirror descent. In International Conference on Machine Learning, pp.\ 2933--2942. PMLR, 2020
work page 2020
-
[8]
Large-scale secure xgb for vertical federated learning
Wenjing Fang, Derun Zhao, Jin Tan, Chaochao Chen, Chaofan Yu, Li Wang, Lei Wang, Jun Zhou, and Benyu Zhang. Large-scale secure xgb for vertical federated learning. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp.\ 443--452, 2021
work page 2021
Show all 69 references
-
[9]
Towards communication-efficient vertical federated learning training via cache-enabled local updates
Fangcheng Fu, Xupeng Miao, Jiawei Jiang, Huanran Xue, and Bin Cui. Towards communication-efficient vertical federated learning training via cache-enabled local updates. arXiv preprint arXiv:2207.14628, 2022
2022 arXiv
-
[10]
Online federated learning via non-stationary detection and adaptation amidst concept drift
Bhargav Ganguly and Vaneet Aggarwal. Online federated learning via non-stationary detection and adaptation amidst concept drift. IEEE/ACM Transactions on Networking, 2023
2023
-
[11]
Online learning with non-convex losses and non-stationary regret
Xiand Gao, Xiaobo Li, and Shuzhong Zhang. Online learning with non-convex losses and non-stationary regret. In International Conference on Artificial Intelligence and Statistics, pp.\ 235--243. PMLR, 2018
2018
-
[12]
heng huang
Bin Gu, An Xu, and Cheng Deng. heng huang. 2020. privacy-preserving asynchronous federated learning algorithms for multi-party vertically collaborative learning. arXiv preprint arXiv:2008.06233, 2020
2020 arXiv
-
[13]
Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption
Stephen Hardy, Wilko Henecka, Hamish Ivey-Law, Richard Nock, Giorgio Patrini, Guillaume Smith, and Brian Thorne. Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. arXiv preprint arXiv:1711.10677, 2017
2017 arXiv
-
[14]
Extracting certainty from uncertainty: Regret bounded by variation in costs
Elad Hazan and Satyen Kale. Extracting certainty from uncertainty: Regret bounded by variation in costs. Machine learning, 80: 0 165--188, 2010
2010
-
[15]
Adaptive online gradient descent
Elad Hazan, Alexander Rakhlin, and Peter Bartlett. Adaptive online gradient descent. Advances in neural information processing systems, 20, 2007
2007
-
[16]
Efficient regret minimization in non-convex games
Elad Hazan, Karan Singh, and Cyril Zhang. Efficient regret minimization in non-convex games. In International Conference on Machine Learning, pp.\ 1433--1441. PMLR, 2017
2017
-
[17]
Introduction to online convex optimization
Elad Hazan et al. Introduction to online convex optimization. Foundations and Trends in Optimization , 2 0 (3-4): 0 157--325, 2016
2016
-
[18]
A hybrid self-supervised learning framework for vertical federated learning
Yuanqin He, Yan Kang, Xinyuan Zhao, Jiahuan Luo, Lixin Fan, Yuxing Han, and Qiang Yang. A hybrid self-supervised learning framework for vertical federated learning. arXiv preprint arXiv:2208.08934, 2022
2022 arXiv
-
[19]
Periodic event-triggered control for linear systems
WPM Heemels Heemels, MCF Donkers, and Andrew R Teel. Periodic event-triggered control for linear systems. IEEE Transactions on automatic control, 58 0 (4): 0 847--861, 2012
2012
-
[20]
Online non-convex optimization with imperfect feedback
Am \'e lie H \'e liou, Matthieu Martin, Panayotis Mertikopoulos, and Thibaud Rahier. Online non-convex optimization with imperfect feedback. Advances in Neural Information Processing Systems, 33: 0 17224--17235, 2020
2020
-
[21]
Online learning: A comprehensive survey
SC Hoi, D Sahoo, J Lu, and P Zhao. Online learning: A comprehensive survey. arxiv. arXiv preprint arXiv:1802.02871, 2018
2018 arXiv
-
[22]
Communication-efficient randomized algorithm for multi-kernel online federated learning
Songnam Hong and Jeongmin Chae. Communication-efficient randomized algorithm for multi-kernel online federated learning. IEEE transactions on pattern analysis and machine intelligence, 44 0 (12): 0 9872--9886, 2021
2021
-
[23]
Fdml: A collaborative machine learning framework for distributed features
Yaochen Hu, Di Niu, Jianming Yang, and Shengping Zhou. Fdml: A collaborative machine learning framework for distributed features. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp.\ 2232--2240, 2019
2019
-
[24]
Differentially private distributed optimization
Zhenqi Huang, Sayan Mitra, and Nitin Vaidya. Differentially private distributed optimization. In Proceedings of the 2015 international conference on distributed computing and networking, pp.\ 1--10, 2015
2015
-
[25]
Fedcvt: Semi-supervised vertical federated learning with cross-view training
Yan Kang, Yang Liu, and Xinle Liang. Fedcvt: Semi-supervised vertical federated learning with cross-view training. ACM Transactions on Intelligent Systems and Technology (TIST), 13 0 (4): 0 1--16, 2022
2022
-
[26]
Scaffold: Stochastic controlled averaging for federated learning
Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank Reddi, Sebastian Stich, and Ananda Theertha Suresh. Scaffold: Stochastic controlled averaging for federated learning. In International conference on machine learning, pp.\ 5132--5143. PMLR, 2020
2020
-
[27]
Tighter regret analysis and optimization of online federated learning
Dohyeok Kwon, Jonghwan Park, and Songnam Hong. Tighter regret analysis and optimization of online federated learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023
2023
-
[28]
Federated optimization in heterogeneous networks
Tian Li, Anit Kumar Sahu, Manzil Zaheer, Maziar Sanjabi, Ameet Talwalkar, and Virginia Smith. Federated optimization in heterogeneous networks. Proceedings of Machine learning and systems, 2: 0 429--450, 2020
2020
-
[29]
Vertical federated learning hybrid local pre-training
Wenguo Li, Xinling Guo, Xu Jiao, Tiancheng Huang, Xiaoran Yan, and Yao Yang. Vertical federated learning hybrid local pre-training. arXiv preprint arXiv:2405.11884, 2024
2024 arXiv
-
[30]
Vertical semi-federated learning for efficient online advertising
Wenjie Li, Qiaolin Xia, Hao Cheng, Kouyin Xue, and Shu-Tao Xia. Vertical semi-federated learning for efficient online advertising. arXiv preprint arXiv:2209.15635, 2022
2022
-
[31]
Fedbn: Federated learning on non-iid features via local batch normalization
Xiaoxiao Li, Meirui Jiang, Xiaofei Zhang, Michael Kamp, and Qi Dou. Fedbn: Federated learning on non-iid features via local batch normalization. arXiv preprint arXiv:2102.07623, 2021
2021 arXiv
-
[32]
Vertical federated edge learning with distributed integrated sensing and communication
Peixi Liu, Guangxu Zhu, Wei Jiang, Wu Luo, Jie Xu, and Shuguang Cui. Vertical federated edge learning with distributed integrated sensing and communication. IEEE Communications Letters, 26 0 (9): 0 2091--2095, 2022
2022
-
[33]
A communication efficient collaborative learning framework for distributed features
Yang Liu, Yan Kang, Xinwei Zhang, Liping Li, Yong Cheng, Tianjian Chen, Mingyi Hong, and Qiang Yang. A communication efficient collaborative learning framework for distributed features. arXiv preprint arXiv:1912.11187, 2019
1912 arXiv
-
[34]
Boosting privately: Federated extreme gradient boosting for mobile crowdsensing
Yang Liu, Zhuo Ma, Ximeng Liu, Siqi Ma, Surya Nepal, Robert H Deng, and Kui Ren. Boosting privately: Federated extreme gradient boosting for mobile crowdsensing. In 2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS), pp.\ 1--11. IEEE, 2020
2020
-
[35]
Training invariant support vector machines using selective sampling
Ga\" e lle Loosli, St\' e phane Canu, and L\' e on Bottou. Training invariant support vector machines using selective sampling. In L\' e on Bottou, Olivier Chapelle, Dennis DeCoste , and Jason Weston (eds.), Large Scale Kernel Machines, pp.\ 301--320. MIT Press, Cambridge, MA....
2007
-
[36]
Personalized federated learning through local memorization
Othmane Marfoq, Giovanni Neglia, Richard Vidal, and Laetitia Kameni. Personalized federated learning through local memorization. In International Conference on Machine Learning, pp.\ 15070--15092. PMLR, 2022
2022
-
[37]
Communication-efficient learning of deep networks from decentralized data
Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas. Communication-efficient learning of deep networks from decentralized data. In Artificial intelligence and statistics, pp.\ 1273--1282. PMLR, 2017
2017
-
[38]
Ad click prediction: a view from the trenches
H Brendan McMahan, Gary Holt, David Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, et al. Ad click prediction: a view from the trenches. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge di...
2013
-
[39]
Distributed learning with compressed gradient differences
Konstantin Mishchenko, Eduard Gorbunov, Martin Tak \'a c , and Peter Richt \'a rik. Distributed learning with compressed gradient differences. arXiv preprint arXiv:1901.09269, 2019
1901 arXiv
-
[40]
Online federated learning
Aritra Mitra, Hamed Hassani, and George J Pappas. Online federated learning. In 2021 60th IEEE Conference on Decision and Control (CDC), pp.\ 4083--4090. IEEE, 2021
2021
-
[41]
Smpai: Secure multi-party computation for federated learning
Vaikkunth Mugunthan, Antigoni Polychroniadou, David Byrd, and Tucker Hybinette Balch. Smpai: Secure multi-party computation for federated learning. In Proceedings of the NeurIPS 2019 Workshop on Robust AI in Financial Services, 2019
2019
-
[42]
Fairvfl: A fair vertical federated learning framework with contrastive adversarial learning
Tao Qi, Fangzhao Wu, Chuhan Wu, Lingjuan Lyu, Tong Xu, Hao Liao, Zhongliang Yang, Yongfeng Huang, and Xing Xie. Fairvfl: A fair vertical federated learning framework with contrastive adversarial learning. Advances in Neural Information Processing Systems, 35: 0 7852--7865, 2022
2022
-
[43]
Differentially private vertical federated learning
Thilina Ranbaduge and Ming Ding. Differentially private vertical federated learning. arXiv preprint arXiv:2211.06782, 2022
2022 arXiv
-
[44]
Improving availability of vertical federated learning: Relaxing inference on non-overlapping data
Zhenghang Ren, Liu Yang, and Kai Chen. Improving availability of vertical federated learning: Relaxing inference on non-overlapping data. ACM Transactions on Intelligent Systems and Technology (TIST), 13 0 (4): 0 1--20, 2022
2022
-
[45]
Doyen Sahoo, Quang Pham, Jing Lu, and Steven C. H. Hoi. Online deep learning: Learning deep neural networks on the fly. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Jun 2018. doi:10.24963/ijcai.2018/369. URL http://dx.doi.org/...
2018 doi
-
[46]
A primal-dual perspective of online learning algorithms
Shai Shalev-Shwartz and Yoram Singer. A primal-dual perspective of online learning algorithms. Machine Learning, 69: 0 115--142, 2007
2007
-
[47]
Online non-convex learning: Following the perturbed leader is optimal
Arun Sai Suggala and Praneeth Netrapalli. Online non-convex learning: Following the perturbed leader is optimal. In Algorithmic Learning Theory, pp.\ 845--861. PMLR, 2020
2020
-
[48]
Send-on-delta sensor data transmission with a linear predictor
Young Soo Suh. Send-on-delta sensor data transmission with a linear predictor. Sensors, 7 0 (4): 0 537--547, 2007
2007
-
[49]
Event-based state estimation with variance-based triggering
Sebastian Trimpe and Raffaello D'Andrea. Event-based state estimation with variance-based triggering. IEEE Transactions on Automatic Control, 59 0 (12): 0 3266--3281, 2014
2014
-
[50]
Split learning for health: Distributed deep learning without sharing raw patient data
Praneeth Vepakomma, Otkrist Gupta, Tristan Swedish, and Ramesh Raskar. Split learning for health: Distributed deep learning without sharing raw patient data. arXiv preprint arXiv:1812.00564, 2018
2018 arXiv
-
[51]
A unified solution for privacy and communication efficiency in vertical federated learning
Ganyu Wang, Bin Gu, Qingsong Zhang, Xiang Li, Boyu Wang, and Charles Ling. A unified solution for privacy and communication efficiency in vertical federated learning. In Thirty-seventh Conference on Neural Information Processing Systems, 2023
2023
-
[52]
Secure and fast asynchronous vertical federated learning via cascaded hybrid optimization
Ganyu Wang, Qingsong Zhang, Xiang Li, Boyu Wang, Bin Gu, and Charles X Ling. Secure and fast asynchronous vertical federated learning via cascaded hybrid optimization. Machine Learning, 113 0 (9): 0 6413--6451, 2024
2024
-
[53]
Online vertical federated learning for cooperative spectrum sensing
Heqiang Wang and Jie Xu. Online vertical federated learning for cooperative spectrum sensing. arXiv preprint arXiv:2312.11363, 2023
2023 arXiv
-
[54]
Communication-efficient adaptive federated learning
Yujia Wang, Lu Lin, and Jinghui Chen. Communication-efficient adaptive federated learning. arXiv preprint arXiv:2205.02719, 2022
2022 arXiv
-
[55]
Federated learning with differential privacy: Algorithms and performance analysis
Kang Wei, Jun Li, Ming Ding, Chuan Ma, Howard H Yang, Farhad Farokhi, Shi Jin, Tony QS Quek, and H Vincent Poor. Federated learning with differential privacy: Algorithms and performance analysis. IEEE Transactions on Information Forensics and Security, 15: 0 3454--3469, 2020
2020
-
[56]
Vertical federated learning: Challenges, methodologies and experiments
Kang Wei, Jun Li, Chuan Ma, Ming Ding, Sha Wei, Fan Wu, Guihai Chen, and Thilina Ranbaduge. Vertical federated learning: Challenges, methodologies and experiments. arXiv preprint arXiv:2202.04309, 2022
2022 arXiv
-
[57]
Daniel Whiteson. HIGGS . UCI Machine Learning Repository, 2014 a . DOI : https://doi.org/10.24432/C5V312
2014 doi
-
[58]
Daniel Whiteson. SUSY . UCI Machine Learning Repository, 2014 b . DOI : https://doi.org/10.24432/C54606
2014 doi
-
[59]
A quasi-newton method based vertical federated learning framework for logistic regression
Kai Yang, Tao Fan, Tianjian Chen, Yuanming Shi, and Qiang Yang. A quasi-newton method based vertical federated learning framework for logistic regression. arXiv preprint arXiv:1912.00513, 2019
1912 arXiv
-
[60]
Asynchronous vertical federated learning for kernelized auc maximization
Ke Zhang, Ganyu Wang, Han Li, Yulong Wang, Hong Chen, and Bin Gu. Asynchronous vertical federated learning for kernelized auc maximization. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp.\ 4244--4255, 2024
2024
-
[61]
Desirable companion for vertical federated learning: New zeroth-order gradient based algorithm
Qingsong Zhang, Bin Gu, Zhiyuan Dang, Cheng Deng, and Heng Huang. Desirable companion for vertical federated learning: New zeroth-order gradient based algorithm. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp.\ 2598--2607, 2021 a
2021
-
[62]
Asysqn: Faster vertical federated learning algorithms with better computation resource utilization
Qingsong Zhang, Bin Gu, Cheng Deng, Songxiang Gu, Liefeng Bo, Jian Pei, and Heng Huang. Asysqn: Faster vertical federated learning algorithms with better computation resource utilization. In Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp...
2021
-
[63]
Secure bilevel asynchronous vertical federated learning with backward updating
Qingsong Zhang, Bin Gu, Cheng Deng, and Heng Huang. Secure bilevel asynchronous vertical federated learning with backward updating. In Proceedings of the AAAI conference on artificial intelligence, volume 35, pp.\ 10896--10904, 2021 c
2021
-
[64]
Vertically federated graph neural network for privacy-preserving node classification
Jun Zhou, Chaochao Chen, Longfei Zheng, Huiwen Wu, Jia Wu, Xiaolin Zheng, Bingzhe Wu, Ziqi Liu, and Li Wang. Vertically federated graph neural network for privacy-preserving node classification. arXiv preprint arXiv:2005.11903, 2020
2005 arXiv
-
[65]
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th international conference on machine learning (icml-03), pp.\ 928--936, 2003
2003
-
[66]
write newline
" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...
-
[67]
@esa (Ref
\@ifxundefined[1] #1\@undefined \@firstoftwo \@secondoftwo \@ifnum[1] #1 \@firstoftwo \@secondoftwo \@ifx[1] #1 \@firstoftwo \@secondoftwo [2] @ #1 \@temptokena #2 #1 @ \@temptokena \@ifclassloaded agu2001 natbib The agu2001 class already includes natbib coding, so you should ...
-
[68]
\@lbibitem[] @bibitem@first@sw\@secondoftwo \@lbibitem[#1]#2 \@extra@b@citeb \@ifundefined br@#2\@extra@b@citeb \@namedef br@#2 \@nameuse br@#2\@extra@b@citeb \@ifundefined b@#2\@extra@b@citeb @num @parse #2 @tmp #1 NAT@b@open@#2 NAT@b@shut@#2 \@ifnum @merge>\@ne @bibitem@firs...
-
[69]
@open @close @open @close and [1] URL: #1 \@ifundefined chapter * \@mkboth \@ifxundefined @sectionbib * \@mkboth * \@mkboth\@gobbletwo \@ifclassloaded amsart * \@ifclassloaded amsbook * \@ifxundefined @heading @heading NAT@ctr thebibliography [1] @ \@biblabel @NAT@ctr \@bibset...
Discussion (0). Sign in to comment.