Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2509.17554 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909978450722816 |
|---|---|
| author | Yu, Zhan Shi, Zhongjie Yuan, Deming Ho, Daniel W. C. |
| author_facet | Yu, Zhan Shi, Zhongjie Yuan, Deming Ho, Daniel W. C. |
| contents | In this paper, we establish a distributed functional optimization (DFO) theory over time-varying networks. The vast majority of existing distributed optimization theories are developed based on Euclidean decision variables. However, for many scenarios in machine learning and statistical learning, such as reproducing kernel spaces or probability measure spaces that use functions or probability measures as fundamental variables, the development of existing distributed optimization theories exhibit obvious theoretical and technical deficiencies. This paper addresses these issues by developing a novel general DFO theory on Banach spaces, allowing functional learning problems in the aforementioned scenarios to be incorporated into our framework for resolution. We study both convex and nonconvex DFO problems and rigorously establish a comprehensive convergence theory of distributed functional mirror descent and distributed functional gradient descent algorithm to solve them. Satisfactory convergence rates are fully derived. The work has provided generic analyzing frameworks for DFO. The established theory is shown to have crucial application value in the kernel-based distributed learning theory over networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_17554 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generic Frameworks for Distributed Functional Optimization and Learning over Time-Varying Networks Yu, Zhan Shi, Zhongjie Yuan, Deming Ho, Daniel W. C. Optimization and Control In this paper, we establish a distributed functional optimization (DFO) theory over time-varying networks. The vast majority of existing distributed optimization theories are developed based on Euclidean decision variables. However, for many scenarios in machine learning and statistical learning, such as reproducing kernel spaces or probability measure spaces that use functions or probability measures as fundamental variables, the development of existing distributed optimization theories exhibit obvious theoretical and technical deficiencies. This paper addresses these issues by developing a novel general DFO theory on Banach spaces, allowing functional learning problems in the aforementioned scenarios to be incorporated into our framework for resolution. We study both convex and nonconvex DFO problems and rigorously establish a comprehensive convergence theory of distributed functional mirror descent and distributed functional gradient descent algorithm to solve them. Satisfactory convergence rates are fully derived. The work has provided generic analyzing frameworks for DFO. The established theory is shown to have crucial application value in the kernel-based distributed learning theory over networks. |
| title | Generic Frameworks for Distributed Functional Optimization and Learning over Time-Varying Networks |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2509.17554 |