检索结果-内蒙古大学图书馆

IEEE Conference on Decision and control

作者： Apostolos I. Rikos Wei Jiang Themistoklis Charalambous Karl H. Johansson Artificial Intelligence Thrust of the Information Hub The Hong Kong University of Science and Technology (Guangzhou) Guangzhou China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay Hong Kong China Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia Cyprus Division of Decision and Control Systems KTH Royal Institute of Technology SE-100 44 Stockholm Sweden

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

In realistic distributed optimization scenarios, individual nodes possess only partial information and communicate over bandwidth constrained channels. For this reason, the development of efficient distributed algorithms is essential. In our paper we addresses the challenge of unconstrained distributed optimization. In our scenario each node’s local function exhibits strong convexity with Lipschitz continuous gradients. The exchange of information between nodes occurs through 3-bit bandwidth-limited channels (i.e., nodes exchange messages represented by a only 3 -bits). Our proposed algorithm respects the network’s bandwidth constraints by leveraging zoom-in and zoom-out operations to adjust quantizer parameters dynamically. We show that during our algorithm’s operation nodes are able to converge to the exact optimal solution. Furthermore, we show that our algorithm achieves a linear convergence rate to the optimal solution. We conclude the paper with simulations that highlight our algorithm’s unique characteristics.

关键词： Adaptation models Quantization (signal) Heuristic algorithms Bandwidth Distributed algorithms Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacy

arXiv

引用

arXiv 2024年

作者： Huo, Wei Liu, Changxin Ding, Kemi Johansson, Karl Henrik Shi, Ling Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen518055 China

This paper investigates the use of the cubic-regularized Newton method within a federated learning framework while addressing two major concerns that commonly arise in federated learning: privacy leakage and communication bottleneck. We introduce a federated learning algorithm called Differentially Private Federated Cubic Regularized Newton (DP-FCRN). By leveraging second-order techniques, our algorithm achieves lower iteration complexity compared to first-order methods. We also incorporate noise perturbation during local computations to ensure privacy. Furthermore, we employ sparsification in uplink transmission, which not only reduces the communication costs but also amplifies the privacy guarantee. Specifically, this approach reduces the necessary noise intensity without compromising privacy protection. We analyze the convergence properties of our algorithm and establish the privacy guarantee. Finally, we validate the effectiveness of the proposed algorithm through experiments on a benchmark dataset. © 2024, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Towards Trustworthy AI: Sandboxing AI-Based Unverified controllers for Safe and Secure Cyber-Physical systems

Towards Trustworthy AI: Sandboxing AI-Based Unverified Contr...

引用

IEEE Conference on Decision and control

作者： Bingzhuo Zhong Siyuan Liu Marco Caccamo Majid Zamani TUM School of Engineering and Design Technical University of Munich Germany Division of Decision and Control Systems KTH Royal Institute of Technology Stockholm Sweden Department of Computer Science University of Colorado Boulder USA

In the past decade, artificial-intelligence-based (AI-based) techniques have been widely applied to design controllers over cyber-physical systems (CPSs) for complex control missions (e.g., motion planning in robotics). Nevertheless, AI-based controllers, particularly those developed based on deep neural networks, are typically very complex and are challenging to be formally verified. To cope with this issue, we propose a secure-by-construction architecture, namely Safe-Sec-visor architecture, to sandbox AI-based unverified controllers. By applying this architecture, the overall safety and security of CPSs can be ensured simultaneously, while formal verification over the AI-based controllers is not required. Here, we consider invariance and opacity properties as the desired safety and security properties, respectively. Accordingly, by leveraging a notion of (augmented) control barrier functions, we design a supervisor to check the control inputs provided by the AI-based controller and decide whether to accept them. At the same time, a safety-security advisor runs in parallel and provides fallback control inputs whenever the AI-based controller is rejected for safety and security reasons. To show the effectiveness of our approaches, we apply them to a case study on a quadrotor controlled by an AI-based controller. Here, the initial state of the quadrotor contains secret information which should not be revealed while the safety of the quadrotor should be ensured.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multiplier analysis of Lurye systems with power signals

Multiplier analysis of Lurye systems with power signals

引用

IEEE Conference on Decision and control

作者： William P. Heath Joaquin Carrasco School of Computer Science and Engineering Bangor University Dean St LL57 1UT UK Department of Electrical and Electronic Engineering Control Systems and Robotics Group Nancy Rothwell Building University of Manchester M13 9PL UK

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

Multipliers can be used to guarantee both the Lyapunov stability and input-output stability of Lurye systems with time-invariant memoryless slope-restricted nonlinearities. If a dynamic multiplier is used there is no guarantee the closedloop system has finite incremental gain. It has been suggested in the literature that without this guarantee such a system may be critically sensitive to time-varying exogenous signals including noise. We show that multipliers guarantee the power gain of the system to be bounded and quantifiable. Furthermore power may be measured about an appropriate steady state bias term, provided the multiplier does not require the nonlinearity to be odd. Hence dynamic multipliers can be used to guarantee Lurye systems have low sensitivity to noise, provided other exogenous systems have constant steady state. We illustrate the analysis with an example where the exogenous signal is a power signal with non-zero mean.

关键词： Sensitivity Power measurement Noise Stability analysis Steady-state Time-varying systems Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

Design and application of a one-stop mobile application sharing platform for steel enterprises

Design and application of a one-stop mobile application shar...

引用

第42届中国控制会议

作者： Xinzhe Chen Luefeng Chen Jie Hu Qingfeng Yang Min Wu Witold Pedrycz School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Department of Electrical and Computer Engineering University of Alberta

As China's steel production accounts for an increasing share of the world's output, the intelligent transformation of the steel industry is becoming increasingly urgent. To address issues such as low levels of mobile informationization in steel enterprises and the lack of an industry-specific mobile application platform, it is of great significance to establish a shared mobile application platform for the steel industry. In this paper, the requirements of the platform were analyzed, and the platform's functions were designed. The software design of the platform was then carried out, and the entire mobile application sharing platform was developed, effectively improving the production management efficiency of steel enterprises. The results indicate that the platform can effectively meet the needs of steel enterprises and has significant engineering significance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Consistent and Asymptotically Efficient Localization from Range-Difference Measurements

arXiv

引用

arXiv 2023年

作者： Zeng, Guangyang Mu, Biqiang Shi, Ling Chen, Jiming Wu, Junfeng The School of Data Science Chinese University of Hong Kong Shenzhen Shenzhen China The Department of Automation University of Science and Technology of China Hefei China Key Laboratory of Systems and Control Institute of Systems Science Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong The College of Control Science and Engineering The State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou310027 China

We consider signal source localization from range-difference measurements. First, we give some readily-checked conditions on measurement noises and sensor deployment to guarantee the asymptotic identifiability of the model and show the consistency and asymptotic normality of the maximum likelihood (ML) estimator. Then, we devise an estimator that owns the same asymptotic property as the ML one. Specifically, we prove that the negative log-likelihood function converges to a function, which has a unique minimum and positive definite Hessian at the true source's position. Hence, it is promising to execute local iterations, e.g., the Gauss-Newton (GN) algorithm, following a consistent estimate. The main issue involved is obtaining a preliminary consistent estimate. To this aim, we construct a linear least-squares problem via algebraic operation and constraint relaxation and obtain a closed-form solution. We then focus on deriving and eliminating the bias of the linear least-squares estimator, which yields an asymptotically unbiased (thus consistent) estimate. Noting that the bias is a function of the noise variance, we further devise a consistent noise variance estimator that involves 3-order polynomial rooting. Based on the preliminary consistent location estimate, a one-step GN iteration suffices to achieve the same asymptotic property as the ML estimator. Simulation results demonstrate the superiority of our proposed algorithm in the large sample case. Copyright © 2023, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Completion with Low-Dimensional Gated Hierarchical Hyperbolic Embedding

SSRN

引用

SSRN 2024年

作者： Fang, Yan Liu, Xiaodong Lu, Wei Pedrycz, Witold Lang, Qi Yang, Jianhua School of Control Science and Engineering Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian116024 China Department of Electrical and Computer Engineering University of Alberta EdmontonT6R 2V4 AB Canada Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia School of Computer Science and Information Technology Northeast Normal University Changchun130117 China

Knowledge Graph Embedding aims to advance the learning performance of knowledge graphs by deliberating the complexity of hierarchical data structures in a finite-dimensional space. Most traditional Euclidean models struggle to accurately describe and navigate the intricate hierarchical relationships between nodes. The hyperbolic embedding methods, particularly in conjunction with graph neural networks, offer promise in effectively modeling complex hierarchies in a limited-dimensional space. These methods can accommodate more information about nodes under the same conditions but are also more susceptible to interference from complex neighborhood features. This paper introduces HyperGatE, which novelty combines a hyperbolic graph hierarchical neighbor structure based on a gated filter and a hyperbolic isometric rotation model for knowledge graph completion. By analyzing the hierarchical structure of the knowledge base and using a gated mechanism to form multi-layer embedding networks of entity-relational paths, the gated filter selects diverse uneven multi-hop relations within the entity neighborhood and measures them through graph attention networks. Furthermore, the simplified hyperbolic isometric model allows for uncovering hierarchical structures in the data. HyperGatE experimentally surpasses the state-of-the-art Euclidean and hyperbolic space models in high and low dimensions across four well-known data, namely WN18RR, FB15k-237, NELL-995, and Kinship. © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Constrained Optimization with Decision-Dependent Distributions

引用

IEEE Transactions on Automatic control 2025年

作者： Wang, Zifan Liu, Changxin Parisini, Thomas Zavlanos, Michael M. Johansson, Karl H. KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures StockholmSE-10044 Sweden East China University of Science and Technology Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education Shanghai200237 China Imperial College London Department of Electrical and Electronic Engineering LondonSW7 2AZ United Kingdom Aalborg University Department of Electronic Systems Denmark University of Trieste Department of Engineering and Architecture Italy Duke University Department of Mechanical Engineering and Materials Science DurhamNC United States

In this paper we deal with stochastic optimization problems where the data distributions change in response to the decision variables. Traditionally, the study of optimization problems with decision-dependent distributions has assumed either the absence of constraints or fixed constraints. This work considers a more general setting where the constraints can also dynamically adjust in response to changes in the decision variables. Specifically, we consider linear constraints and analyze the effect of decision-dependent distributions in both the objective function and constraints. Firstly, we establish a sufficient condition for the existence of a constrained equilibrium point, at which the distributions remain invariant under retraining. Moreover, we propose and analyze two algorithms: repeated constrained optimization and repeated dual ascent. For each algorithm, we provide sufficient conditions for convergence to the constrained equilibrium point. Furthermore, we explore the relationship between the equilibrium point and the optimal point for the constrained decision-dependent optimization problem. Notably, our results encompass previous findings as special cases when the constraints remain fixed. To show the effectiveness of our theoretical analysis, we provide numerical experiments on both a market problem and a dynamic pricing problem for parking based on real-world data. © 1963-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization for Quadratic Cost Functions over Large-Scale Networks with Quantized Communication and Finite-Time Convergence

arXiv

引用

arXiv 2023年

作者： Rikos, Apostolos I. Grammenos, Andreas Kalyvianaki, Evangelia Hadjicostis, Christoforos N. Charalambous, Themistoklis Johansson, Karl H. The Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden The Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom The Alan Turing Institute London United Kingdom The Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus

We propose two distributed iterative algorithms that can be used to solve, in finite time, the distributed optimization problem over quadratic local cost functions in large-scale networks. The first algorithm exhibits synchronous operation whereas the second one exhibits asynchronous operation. Both algorithms share salient features. Specifically, the algorithms operate exclusively with quantized values, which means that the information stored, processed and exchanged between neighboring nodes is subject to deterministic uniform quantization. The algorithms rely on event-driven updates in order to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage. Finally, once the algorithms converge, nodes distributively terminate their operation. We prove that our algorithms converge in a finite number of iterations to the exact optimal solution depending on the quantization level, and we present applications of our algorithms to (i) optimal task scheduling for data centers, and (ii) global model aggregation for distributed federated learning. We provide simulations of these applications to illustrate the operation, performance, and advantages of the proposed algorithms. Additionally, it is shown that our proposed algorithms compare favorably to algorithms in the current literature. Quantized communication and asynchronous updates increase the required time to completion, but finite-time operation is maintained. © 2023, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Overview of bioinformatic tools to study viral infections

Overview of bioinformatic tools to study viral infections

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Verdiana Zulian Anna Rosa Garbuglia Giulia Fiscon Paola Paci Virology Laboratory National Institute for Infectious Diseases Lazzaro Spallanzani IRCCS Rome Italy Department of Computer Control and Management Engineering Sapienza University of Rome Institute for Systems Analysis and Computer Science "Antonio Ruberti" National Research Council Rome Italy

microRNAs play an important role in post-transcriptional gene regulation. Recently, viral microRNAs have been discovered in several viruses, including Hepatitis B virus. This brief work explores bioinformatics tools for viral/host miRNA research and provides insights into the roles of miRNAs in HBV infection, offering an overview of this field, in order to facilitate the selection of the most suitable bioinformatics tools according to individual needs and research goals.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：