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

IEEE Transactions on Artificial Intelligence 2025年第4期6卷 794-804页

作者： Movin, Maria Siciliano, Federico Ferreira, Rui Silvestri, Fabrizio Tolomei, Gabriele Spotify StockholmSE-111 Sweden Sapienza University of Rome Department of Computer Control and Management Engineering Rome00185 Italy Spotify LondonWC2N 6AT United Kingdom Sapienza University of Rome Department of Computer Science Rome00161 Italy

Algorithmic recourses are popular methods to provide individuals impacted by machine learning models with recommendations on feasible actions for a more favorable prediction. Most of the previous algorithmic recourse methods work under the assumption that the predictive model does not change over time. However, in reality, models in deployment may both be periodically retrained and have their architecture changed. Therefore, it is desirable that the recourse should remain valid when such a model update occurs, unless new evidence arises. We call this feature consistency. This article presents anomaly control and data coherence (ACDC), a novel model-agnostic recourse method that generates counterfactual explanations, i.e., instance-level recourses. ACDC is inspired by anomaly detection methods and uses a one-class classifier to aid the search for valid, consistent, and feasible counterfactual explanations. The one-class classifier asserts that the generated counterfactual explanations lie on the data manifold and are not outliers of the target class. We compare ACDC against several state-of-the-art recourse methods across four datasets. Our experiments show that ACDC outperforms baselines both in generating consistent counterfactual explanations, and in generating feasible and plausible counterfactual explanations, while still having proximity measures similar to the baseline methods targeting the data manifold. © 2024 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Distributed Estimation and Motion control in Multi-Agent Systems Under Multiple Attacks

引用

IEEE Transactions on Automation Science and engineering 2025年 22卷 12548-12559页

作者： Jenabzadeh, Ahmadreza Shu, Zhan Huang, Tingwen Zhu, Quanmin Shang, Yilun Cui, Yukang Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Peng Cheng Laboratory Shenzhen518000 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen518055 China University of the West of England School of Engineering BristolBS16 1QY United Kingdom Northumbria University Faculty of Engineering and Environment Department of Computer and Information Sciences Newcastle upon TyneNE1 8ST United Kingdom

This paper addresses the problem of distributed estimation and motion control (DEMC) in multi-agent systems (MASs) with both linear and Lipschitz nonlinear dynamics. Unlike conventional DEMC methods designed for MASs under ideal conditions, this work investigates scenarios where all agents are vulnerable to various forms of attacks. The considered attacks comprise false-data injection (FDI) attacks and denial of service (DoS) attacks that affect the communication channels among agents to destabilize the MAS. Also, the unbounded actuator attacks which exist in practical environments to intentionally degrade the MAS performance is considered. To cope with these kinds of attacks, two novel resilient approaches are established aimed at estimating and following a mobile target under attacks. The proposed distributed attack-resilient control strategies are designed based on a dual-layer structure, guaranteeing effective DEMC with an ultimately bounded error. The results from two simulation examples are provided to validate the presented algorithms. © 2004-2012 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Distill & Contrast: A New Graph Self-Supervised Method With Approximating Nature Data Relationships

引用

IEEE Transactions on Knowledge and Data engineering 2025年第6期37卷 3284-3297页

作者： He, Dongxiao Zhao, Jitao Guo, Rui Feng, Zhiyong Huo, Cuiying Jin, Di Pedrycz, Witold Zhang, Weixiong Tianjin University College of Intelligence and Computing Tianjin300350 China Department of Measurement and Control Systems Gliwice44-100 Poland University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Hong Kong Polytechnic University Department of Data Science and Ai Hong Kong

Contrastive Learning (CL) has emerged as a popular self-supervised representation learning paradigm that has been shown in many applications to perform similarly to traditional supervised learning methods. A key component of CL is mining the latent discriminative relationships between positive and negative samples and using them as self-supervised labels. We argue that this discriminative contrastive task is, in essence, similar to a classification task, and the "either positive or negative"hard label sampling strategies are arbitrary. To solve this problem, we explore ideas from data distillation, which considers probabilistic logit vectors as soft labels to transfer model knowledge. We attempt to abandon the classical hard sampling labels in CL and instead explore self-supervised soft labels. We adopt soft sampling labels that are extracted, without supervision, from the inherent relationships in data pairs to retain more information. We propose a new self-supervised graph learning method, Distill and Contrast (D&C), for learning representations that closely approximate natural data relationships. D&C extracts node similarities from the features and structures to derive soft sampling labels, which also eliminate noise in the data to increase robustness. Extensive experimental results on real-world datasets demonstrate the effectiveness of the proposed method. © 2025 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm with network-independent step-size and event-triggered mechanism for economic dispatch problem

A distributed algorithm with network-independent step-size a...

引用

作者： Chen, Baitong Yang, Jianhua Lu, Wei Pedrycz, Witold Sun, Changhai School of Control Science and Engineering Dalian University of Technology Dalian China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada Institute of Systems Engineering Macau University of Science and Technology SARTaipa 999078 China Research Center of Performance and Productivity Analysis Istinye University Istanbul Turkey School of Electrical Engineering Dalian University of Technology Dalian China

The economic dispatch problem (EDP) poses a significant challenge in energy management for modern power systems, particularly as these systems undergo expansion. This growth escalates the demand for communication resources and increases the risk of communication failures. To address this challenge, we propose a distributed algorithm with network-independent step sizes and an event-triggered mechanism, which reduces communication requirements and enhances adaptability. Unlike traditional methods, our algorithm uses network-independent step sizes derived from each agent's local cost functions, thus eliminating the need for detailed network topology knowledge. The theoretical derivation identifies a range of step size values that depend solely on the objective function's strong convexity and the gradient's Lipschitz continuity. Furthermore, the proposed algorithm is shown to achieve a linear convergence rate, assuming the event triggering threshold criteria are met for linear convergence. Numerical experiments further validate the effectiveness and advantages of our proposed distributed algorithm by demonstrating its ability to maintain good convergence characteristics while reducing communication frequency. © 2024 John Wiley & Sons Ltd.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Task Allocation for Teams of Multi-mode Robots

arXiv

引用

arXiv 2025年

作者： Ito, Takumi Funada, Riku Sampei, Mitsuji Notomista, Gennaro Department of Systems and Control Engineering Institute of Science Tokyo Tokyo152-8550 Japan Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

This work proposes a novel multi-robot task allocation framework for robots that can switch between multiple modes, e.g., flying, driving, or walking. We first provide a method to encode the multi-mode property of robots as a graph, where the mode of each robot is represented by a node. Next, we formulate a constrained optimization problem to decide both the task to be allocated to each robot as well as the mode in which the latter should execute the task. The robot modes are optimized based on the state of the robot and the environment, as well as the energy required to execute the allocated task. Moreover, the proposed framework is able to encompass kinematic and dynamic models of robots alike. Furthermore, we provide sufficient conditions for the convergence of task execution and allocation for both robot models. Copyright © 2025, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Mixture-of-Experts as Continual Knowledge Adapter for Mobile Vision Understanding

引用

IEEE Transactions on Mobile Computing 2025年

作者： Guo, Bicheng Zhou, Conghao He, Shibo Chen, Jiming Shen, Xuemin Zhejiang University College of Control Science and Engineering Zhejiang Hangzhou310027 China Xidian University School of Telecommunications Engineering China University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada

Continual machine learning in the context of limited computational resources and data availability is critical in the connected digital world. Current intelligent applications predominantly rely on deep learning models requiring labor/computation-intensive training. These models often struggle to adapt effectively to new data while preserving performance on previously learned knowledge. In this paper, we introduce a lightweight method for continual knowledge adaptation that can address these challenges. To prevent disruption of the existing services, we propose a Mixture-of-Experts (MoE) adapter that integrates seamlessly with the existing vision model to encode new data. The weights of the original model are kept fixed during the adaptation process, ensuring the preservation of previously learned knowledge. The MoE technique enables scaling up the parameters of the adapter while maintaining a relatively low computation, making it fit for constrained devices in mobile computation scenarios. Furthermore, to enhance learning efficiency and accelerate convergence with new data, we implement a knowledge fusion mechanism that facilitates interaction between the existing knowledge and the information extracted from new data. The timing of employing the fusion module is further investigated. We find that it is conducive in scenarios where the task's performance requirements are enhanced. The MoE adapter and knowledge fusion module are integrated at each stage with minimal trainable parameters, efficiently optimizing resource usage. Extensive experiments and ablation studies validate the effectiveness of the proposed method. Specifically, the proposed method prevents an accuracy drop of 43.02% on the previous data compared to the continual train method, while achieving an accuracy of 44.81% on the new data, which is even 0.34% higher than fully training a new model. © 2002-2012 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Survey on Network Management for xANET: Evolution, Challenges, Future Directions

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Li, Tong Yang, Chungang Wang, Yao Cai, Lin Anpalagan, Alagan Han, Zhu Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China National Key Laboratory of Multi-domain Data Collaborative Processing and Control Xi'an710068 China Hangzhou Institute of Technology of Xidian University Hangzhou311231 China University of Victoria Department of Electrical and Computer Engineering VictoriaBCV8P 5C2 Canada Ryerson University Department of Electrical and Computer Engineering TorontoONM5B 2K3 Canada University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446701 Korea Republic of

The x ad hoc network (xANET) termed as a family of ad hoc networks, including mobile ad hoc network (MANET), vehicular ad hoc network (VANET), flying ad hoc network (FANET) and satellite ad hoc network (SANET), has found a wide range of applications in providing ubiquitous wireless services. Despite its broad utility, the dynamic nature and lack of a centralized controller pose significant challenges to effective and flexible network management for xANET. Conventional network management protocols face challenges such as scalability, security vulnerabilities, configuration complexity, robustness, and performance resilience. Recent efforts have presented different approaches, focusing on policy-based network management (PBNM) and intent-driven network management (IDNM). However, there is no comprehensive survey to clarify their concepts and classifications. This paper presents a survey of the network management evolution for xANET, covering configuration-based, policy-based and the latest intent-driven approaches. We first introduce the characteristics and applications of xANET. Meanwhile, we investigate the network management concepts and challenges. Moreover, we survey the evolution of management protocols for xANET, including simple network management protocol (SNMP), PBNM, and IDNM. Then, we follow the detailed network management of xANET from configuration-based to policy-based and intent-driven approaches. Through comparative analysis, it is found that IDNM employs a more intelligent management protocol, demonstrating higher efficiency and flexibility in handling complex tasks and dynamic network management. This makes it better suited to addressing the challenges of xANET management. Finally, we summarize the remaining challenges and possible future research directions. © 2025 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Multi-view Unsupervised Representation Learning via Integration of Fuzzy Rules and Graph-Based Adaptive Regularization

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Zhu, Yi Li, Dong Xi, Chao Pedrycz, Witold Macau University of Science and Technology School of Computer Science and Engineering China East China University of Technology School of Mechanical and Electronic Engineering Nanchang330013 China Gliwice Department of Measurement and Control Systems Gliwice44-100 Poland University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey

With the rapid advancement of data acquisition technologies, multiview data have been widely applied in fields such as social networks, computer vision, and natural language processing. Multiview data typically contain information arising from different views or sensors, offering more perspectives for observation. The multiview nature also brings challenges, such as high dimensionality, noise, heterogeneity, and redundancy. Particularly, in scenarios with limited labeled data, traditional single-view learning methods often struggle to handle these complex issues. To address this, this article proposes an unsupervised multiview learning framework that integrates Takagi–Sugeno–Kang fuzzy systems and graph-based adaptive regularization (MvTSK-GAR) to handle the heterogeneity and redundancy in multiview data effectively. Specifically, this article first captures the uncertainty in multiview data through fuzzy rules and models the structural relationships between the data using graph-based adaptive regularization. The framework does not rely on a large amount of labeled data. Instead, it integrates complementary information coming from different views to automatically mine latent patterns, thus generating more accurate and stable data representations. Experimental results demonstrate that the proposed framework performs well in various real-world applications, particularly excelling in high-dimensional data processing and noise reduction. Good performance in multiple publicly available datasets validates the effectiveness of our approach. Thecode is available at https://***/r/MvTSK-GAR-E3FB/***. © 1993-2012 IEEE.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

CRB-Rate Tradeoff in RSMA-enabled Near-Field Integrated Multi-Target Sensing and Multi-User Communications

arXiv

引用

arXiv 2025年

作者： Zhou, Jiasi Zhou, Cong Sun, Yanjing Tellambura, Chintha School of Medical Information and Engineering Xuzhou Medical University Xuzhou221004 China School of Electronic and Information Engineering Harbin Institute of Technology Harbin150001 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada

Extremely large-scale antenna arrays enhance spectral efficiency and spatial resolution in integrated sensing and communication (ISAC) networks while expanding the Rayleigh distance, triggering a shift from conventional far-field plane waves to near-field (NF) spherical waves. However, full-digital beamforming is infeasible due to the need for dedicated radio frequency (RF) chains. To address this, NF-ISAC with a rate-splitting multiple access (RSMA) scheme is developed for advanced interference management, considering fully-connected and partially-connected hybrid analog and digital (HAD) beamforming architectures. Specifically, the Cramér-Rao bound (CRB) for joint distance and angle sensing is derived, and the achievable performance region between the max-min communication rate and the multi-target CRB is defined. To fully characterize the Pareto boundary of the CRB-rate region, a sensing-centric minimization problem is formulated under communication rate constraints for two HAD beamforming architectures. A penalty dual decomposition (PDD)-based double-loop algorithm is developed to optimize fully-connected HAD beamformers. To reduce computational complexity, a two-stage design algorithm for fully connected HAD beamforming is also proposed. Additionally, the PDD-based double-loop algorithm is extended to the partially-connected HAD architecture. Simulations demonstrate the proposed schemes and algorithms: 1) achieve performance comparable to a fully digital beamformer with fewer RF chains, 2) outperform space division multiple access and far-field ISAC, and 3) yield enhanced CRB-rate trade-off performance. Copyright © 2025, The Authors. All rights reserved.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：