J. Frankl. Inst.最新文献

Cruise Controllers for Lane-Free Ring-Roads based on Control Lyapunov Functions 基于控制Lyapunov函数的无车道环线巡航控制器

J. Frankl. Inst. Pub Date : 2022-08-03 DOI: 10.48550/arXiv.2208.01977

D. Theodosis, I. Karafyllis, M. Papageorgiou

引用次数: 5

Towards Efficient Communications in Federated Learning: A Contemporary Survey 迈向联邦学习中的有效沟通:一项当代调查

J. Frankl. Inst. Pub Date : 2022-08-02 DOI: 10.48550/arXiv.2208.01200

Zihao Zhao, Yuzhu Mao, Yang Liu, Linqi Song, Ouyang Ye, Xinlei Chen, Wenbo Ding

{"title":"Towards Efficient Communications in Federated Learning: A Contemporary Survey","authors":"Zihao Zhao, Yuzhu Mao, Yang Liu, Linqi Song, Ouyang Ye, Xinlei Chen, Wenbo Ding","doi":"10.48550/arXiv.2208.01200","DOIUrl":"https://doi.org/10.48550/arXiv.2208.01200","url":null,"abstract":"In the traditional distributed machine learning scenario, the user's private data is transmitted between clients and a central server, which results in significant potential privacy risks. In order to balance the issues of data privacy and joint training of models, federated learning (FL) is proposed as a particular distributed machine learning procedure with privacy protection mechanisms, which can achieve multi-party collaborative computing without revealing the original data. However, in practice, FL faces a variety of challenging communication problems. This review seeks to elucidate the relationship between these communication issues by methodically assessing the development of FL communication research from three perspectives: communication efficiency, communication environment, and communication resource allocation. Firstly, we sort out the current challenges existing in the communications of FL. Second, we have collated FL communications-related papers and described the overall development trend of the field based on their logical relationship. Ultimately, we discuss the future directions of research for communications in FL.","PeriodicalId":205993,"journal":{"name":"J. Frankl. Inst.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127807141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Pursuit of a Discriminative Representation for Multiple Subspaces via Sequential Games 多子空间序列博弈的判别表示

J. Frankl. Inst. Pub Date : 2022-06-18 DOI: 10.48550/arXiv.2206.09120

Druv Pai, Michael Psenka, Chih-Yuan Chiu, Manxi Wu, Edgar Dobriban, Y. Ma

{"title":"Pursuit of a Discriminative Representation for Multiple Subspaces via Sequential Games","authors":"Druv Pai, Michael Psenka, Chih-Yuan Chiu, Manxi Wu, Edgar Dobriban, Y. Ma","doi":"10.48550/arXiv.2206.09120","DOIUrl":"https://doi.org/10.48550/arXiv.2206.09120","url":null,"abstract":"We consider the problem of learning discriminative representations for data in a high-dimensional space with distribution supported on or around multiple low-dimensional linear subspaces. That is, we wish to compute a linear injective map of the data such that the features lie on multiple orthogonal subspaces. Instead of treating this learning problem using multiple PCAs, we cast it as a sequential game using the closed-loop transcription (CTRL) framework recently proposed for learning discriminative and generative representations for general low-dimensional submanifolds. We prove that the equilibrium solutions to the game indeed give correct representations. Our approach unifies classical methods of learning subspaces with modern deep learning practice, by showing that subspace learning problems may be provably solved using the modern toolkit of representation learning. In addition, our work provides the first theoretical justification for the CTRL framework, in the important case of linear subspaces. We support our theoretical findings with compelling empirical evidence. We also generalize the sequential game formulation to more general representation learning problems. Our code, including methods for easy reproduction of experimental results, is publically available on GitHub.","PeriodicalId":205993,"journal":{"name":"J. Frankl. Inst.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130148826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Generalized Multi-cluster Game under Partial-decision Information with Applications to Management of Energy Internet 部分决策信息下的广义多集群博弈及其在能源互联网管理中的应用

J. Frankl. Inst. Pub Date : 2022-05-24 DOI: 10.48550/arXiv.2205.12027

Yue-Chun Chen, Peng Yi

{"title":"Generalized Multi-cluster Game under Partial-decision Information with Applications to Management of Energy Internet","authors":"Yue-Chun Chen, Peng Yi","doi":"10.48550/arXiv.2205.12027","DOIUrl":"https://doi.org/10.48550/arXiv.2205.12027","url":null,"abstract":"The decision making and management of many engineering networks involves multiple parties with conflicting interests, while each party is constituted with multiple agents. Such problems can be casted as a multi-cluster game. Each cluster is treated as a self-interested player in a non-cooperative game where agents in the same cluster cooperate together to optimize the payoff function of the cluster. In a large-scale network, the information of agents in a cluster can not be available immediately for agents beyond this cluster, which raise challenges to the existing Nash equilibrium seeking algorithms. Hence, we consider a partial-decision information scenario in generalized Nash equilibrium seeking for multi-cluster games in a distributed manner. We reformulate the problem as finding zeros of the sum of preconditioned monotone operators by the primal-dual analysis and graph Laplacian matrix. Then a distributed generalized Nash equilibrium seeking algorithm is proposed without requiring fully awareness of its opponent clusters' decisions based on a forward-backward-forward method. With the algorithm, each agent estimates the strategies of all the other clusters by communicating with neighbors via an undirected network. We show that the derived operators can be monotone when the communication strength parameter is sufficiently large. We prove the algorithm convergence resorting to the fixed point theory by providing a sufficient condition. We discuss its potential application in Energy Internet with numerical studies.","PeriodicalId":205993,"journal":{"name":"J. Frankl. Inst.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127940195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Nonconvex L1/2-Regularized Nonlocal Self-similarity Denoiser for Compressive Sensing based CT Reconstruction 基于压缩感知的CT重构非凸l1 /2正则化非局部自相似去噪

J. Frankl. Inst. Pub Date : 2022-05-15 DOI: 10.48550/arXiv.2205.07185

Yunyi Li, Yiqiu Jiang, Hengmin Zhang, Jianxun Liu, Xiangling Ding, Guan Gui

{"title":"Nonconvex L1/2-Regularized Nonlocal Self-similarity Denoiser for Compressive Sensing based CT Reconstruction","authors":"Yunyi Li, Yiqiu Jiang, Hengmin Zhang, Jianxun Liu, Xiangling Ding, Guan Gui","doi":"10.48550/arXiv.2205.07185","DOIUrl":"https://doi.org/10.48550/arXiv.2205.07185","url":null,"abstract":"Compressive sensing (CS) based computed tomography (CT) image reconstruction aims at reducing the radiation risk through sparse-view projection data. It is usually challenging to achieve satisfying image quality from incomplete projections. Recently, the nonconvex ${{L_ {{1/2}}}} $-norm has achieved promising performance in sparse recovery, while the applications on imaging are unsatisfactory due to its nonconvexity. In this paper, we develop a ${{L_ {{1/2}}}} $-regularized nonlocal self-similarity (NSS) denoiser for CT reconstruction problem, which integrates low-rank approximation with group sparse coding (GSC) framework. Concretely, we first split the CT reconstruction problem into two subproblems, and then improve the CT image quality furtherly using our ${{L_ {{1/2}}}} $-regularized NSS denoiser. Instead of optimizing the nonconvex problem under the perspective of GSC, we particularly reconstruct CT image via low-rank minimization based on two simple yet essential schemes, which build the equivalent relationship between GSC based denoiser and low-rank minimization. Furtherly, the weighted singular value thresholding (WSVT) operator is utilized to optimize the resulting nonconvex ${{L_ {{1/2}}}} $ minimization problem. Following this, our proposed denoiser is integrated with the CT reconstruction problem by alternating direction method of multipliers (ADMM) framework. Extensive experimental results on typical clinical CT images have demonstrated that our approach can further achieve better performance than popular approaches.","PeriodicalId":205993,"journal":{"name":"J. Frankl. Inst.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134023908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Event-driven NN adaptive fixed-time control for nonlinear systems with guaranteed performance 具有保证性能的非线性系统事件驱动神经网络自适应定时控制

J. Frankl. Inst. Pub Date : 2021-08-04 DOI: 10.21203/rs.3.rs-764885/v1

Xiaona Song, Peng Sun, Shuai Song, V. Stojanovic

引用次数: 70

Agile attitude maneuver with active vibration-suppression for flexible spacecraft 柔性航天器主动减振的敏捷姿态机动

J. Frankl. Inst. Pub Date : 2021-04-19 DOI: 10.21203/RS.3.RS-365203/V1

Jianqiao Zhang, Xianglong Kong, Chuang Liu, Qing Deng, Keke Shi

引用次数: 3

An iterative learning scheme-based fault estimator design for nonlinear systems with quantised measurements 基于迭代学习方案的非线性量化系统故障估计器设计

J. Frankl. Inst. Pub Date : 2019-09-08 DOI: 10.1007/978-981-32-9682-4_47

Xiaoyu Liu, Shanbi Wei, Yi Chai