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

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further reduced to O)(log(T)), and the network cumulative constraint violation bound is reduced to O(log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

An Erasmus+ project: Interactive Course for Control Theory (ICCT) 8

学校读者我要写书评

暂无评论

An Erasmus+ project: Interactive Course for Control Theory (...

47th Annual Conference of the IEEE Industrial Electronics Society, IECON 2021

作者： Podrzaj, Primoz Finzgar, Miha Pirnar, Zan Ljubic, Sandi Lanzetta, Michele Pollini, Lorenzo Venturini, Pietro Pizag, Bertalan Urbin, Agnes Korondi, Peter Graff, Jozsef Budai, Csaba University of Ljubljana Laboratory for Mechatronics Production Systems and Automation Faculty of Mechanical Engineering Ljubljana Slovenia University of Rijeka Faculty of Engineering Department of Computer Engineering Rijeka Croatia University of Pisa Department of Industrial Engineering Department of Information Engineering Pisa Italy Budapest University of Technology and Economics Faculty of Mechanical Engineering Department of Mechatronics Optics and Mechanical Engineering Informatics Budapest Hungary

ISBN: (纸本)9781665435543

The paper presents an overview and the main results of the Erasmus+ project titled Interactive Course for Control Theory-ICCT. The project was started by four European Universities when they identified by a survey that students find Control Theory more challenging to understand compared to other subjects. The project's main goal was to develop a platform, which would offer examples from the field of Control Theory in an interactive way-ICCT. Frequently asked questions (FAQ) and test exam questions were added as well. To support the course, an accompanying textbook was prepared. At this point, the course and the accompanying textbook are available in English and the languages of the partner universities;since both of them are publicly available, we assume they will be offered in other languages in future. The benefits of implementing our interactive course are already visible in better survey results and improved grades in Control Theory-related subjects. © 2021 IEEE.

关键词： Python

A Multilevel Intelligent Assistant for Multilevel Social Network Analysis 10

学校读者我要写书评

暂无评论

A Multilevel Intelligent Assistant for Multilevel Social Net...

10th IEEE International Conference on Intelligent systems, IS 2020

作者： Tianxing, Man Zhukova, Nataly Tsochev, Georgi ITMO University St. Petersburg Russia Laboratory of Computer-Information Systems and Software Engineering St. Petersburg Institute for Informatics and Automation Russian Academy of Sciences St. Petersburg Russia Bulgarian Academy of Sciences Laboratory of Telematics Sofia Bulgaria

ISBN: (纸本)9781728154565

In recent years, social network data analysis is an emerging field. Multilevel social network analysis could help researchers to figure out comprehensive influencing factors. But the raw data extracted from life is complicated and inoperable so that the entire analysis process is multi-step and changeable. The characteristics of social network datasets at different levels are diverse. There is no general data analysis algorithms for each level. The characteristics of the data and the requirements of the task are important basis for choosing suitable analysis methods. But it is hard for non-expert researchers. This paper proposes an intelligent multilevel assistant for multilevel social network analysis and implements it based on ontology technology. Algorithms at different levels process the corresponding data forms until the appropriate output model is generated. The use of ontology technology makes this framework extensible and understandable. Such a framework is significant for non-experts. © 2020 IEEE.

关键词： Ontology

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Learning

学校读者我要写书评

暂无评论

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Lea...

IEEE International Conference on Industrial Informatics (INDIN)

作者： Weipeng Cao Xuyang Yao Zhiwu Xu Yinghui Pan Yixuan Sun Dachuan Li Bohua Qiu Muheng Wei Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Stony Brook University New York United States Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China ZhenDui Industry Artificial Intelligence Co. Ltd Shenzhen China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (数字)9798331527471

ISBN: (纸本)9798331527488

Realizing Generalized Zero-Shot Learning (GZSL) based on large models is emerging as a prevailing trend. However, most existing methods merely regard large models as black boxes, solely leveraging the features output by the final layer while disregarding potential performance enhancements from other layers. Indeed, numerous researchers have visually depicted variations in the features learned across different layers of neural networks. Motivated by this observation, we propose a Vision Transformer (ViT)-based GZSL method named Depth-Aware Multi-Modal ViT (DAM2ViT), which exploits multi-level features of ViT. DAM2ViT incorporates a multi-modal interaction block to align semantic information of categories across multiple layers, thereby augmenting the model's capacity to learn associations between visual and semantic spaces. Extensive experiments conducted on three benchmark datasets (i.e., CUB, SUN, AWA2) have showcased that DAM2ViT achieves competitive results compared to state-of-the-art methods.

关键词： Visualization Adaptation models Semantics Zero shot learning Neural networks Termination of employment Transformers Market research Sun Optimization

Wireless Hallucination in Generative AI-enabled Communications: Concepts, Issues, and Solutions

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wang, Xudong Wang, Jiacheng Feng, Lei Niyato, Dusit Zhang, Ruichen Kang, Jiawen Xiong, Zehui Du, Hongyang Mao, Shiwen State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China College of Computing and Data Science Nanyang Technological University Singapore School of Automation Guangdong University of Technology Guangzhou510006 China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Electrical and Electronic Engineering University of Hong Kong Pok Fu Lam Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn United States

Generative AI (GenAI) is driving the intelligence of wireless communications. Due to data limitations, random generation, and dynamic environments, GenAI may generate channel information or optimization strategies that violate physical laws or deviate from actual real-world requirements. We refer to this phenomenon as wireless hallucination, which results in invalid channel information, spectrum wastage, and low communication reliability but remains underexplored. To address this gap, this article provides a comprehensive concept of wireless hallucinations in GenAI-driven communications, focusing on hallucination mitigation. Specifically, we first introduce the fundamental, analyze its causes based on the GenAI workflow, and propose mitigation solutions at the data, model, and post-generation levels. Then, we systematically examines representative hallucination scenarios in GenAI-enabled communications and their corresponding solutions. Finally, we propose a novel integrated mitigation solution for GenAI-based channel estimation. At the data level, we establish a channel estimation hallucination dataset and employ generative adversarial networks (GANs)-based data augmentation. Additionally, we incorporate attention mechanisms and large language models (LLMs) to enhance both training and inference performance. Experimental results demonstrate that the proposed hybrid solutions reduce the normalized mean square error (NMSE) by 0.19, effectively reducing wireless hallucinations. Copyright © 2025, The Authors. All rights reserved.

关键词： Generative adversarial networks

Temporal Correlation Meets Embedding: Towards a 2nd Generation of JDE-based Real-Time Multi-Object Tracking

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Yunfei Liang, Chao Gao, Jin Zhang, Zhipeng Hu, Weiming Maybank, Stephen Zhou, Xue Li, Liang School of Information Science and Technology Shanghaitech University Shanghai201210 China State Key Laboratory of Multimodal Artificial Intelligence System Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing101408 China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen518110 China KargoBot China Department of Computer Science and Information Systems Birkbeck College LondonWC1E 7HX United Kingdom School of Automation Engineering University of Electronic Science and Technology of China Chengdu611731 China Beijing Institute of Basic Medical Sciences Beijing100850 China

Joint Detection and Embedding (JDE) trackers have demonstrated excellent performance in Multi-Object Tracking (MOT) tasks by incorporating the extraction of appearance features as auxiliary tasks through embedding Re-Identification task (ReID) into the detector, achieving a balance between inference speed and tracking performance. However, solving the competition between the detector and the feature extractor has always been a challenge. Meanwhile, the issue of directly embedding the ReID task into MOT has remained unresolved. The lack of high discriminability in appearance features results in their limited utility. In this paper, a new learning approach using cross-correlation to capture temporal information of objects is proposed. The feature extraction network is no longer trained solely on appearance features from each frame but learns richer motion features by utilizing feature heatmaps from consecutive frames, which addresses the challenge of inter-class feature similarity. Furthermore, our learning approach is applied to a more lightweight feature extraction network, and treat the feature matching scores as strong cues rather than auxiliary cues, with an appropriate weight calculation to reflect the compatibility between our obtained features and the MOT task. Our tracker, named TCBTrack, achieves state-of-the-art performance on multiple public benchmarks, i.e., MOT17, MOT20, and DanceTrack datasets. Specifically, on the DanceTrack test set, we achieve 56.8 HOTA, 58.1 IDF1 and 92.5 MOTA, making it the best online tracker capable of achieving real-time performance. Comparative evaluations with other trackers prove that our tracker achieves the best balance between speed, robustness and accuracy. Code is available at https://***/yfzhang1214/TCBTrack. Copyright © 2024, The Authors. All rights reserved.

关键词： HTTP

Model-Driven Deep Learning for Non-Coherent Massive Machine-Type Communications

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ma, Zhe Wu, Wen Gao, Feifei Shen, Xuemin The Institute for Artificial Intelligence Tsinghua University State Key Lab of Intelligent Technologies and Systems Beijing National Research Center for Information Science and Technology Department of Automation Tsinghua University Beijing100084 China The Frontier Research Center Peng Cheng Laboratory Guangdong Shenzhen518055 China The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

In this paper, we investigate the joint device activity and data detection in massive machine-type communications (mMTC) with a one-phase non-coherent scheme, where data bits are embedded in the pilot sequences and the base station simultaneously detects active devices and their embedded data bits without explicit channel estimation. Due to the correlated sparsity pattern introduced by the noncoherent transmission scheme, the traditional approximate message passing (AMP) algorithm cannot achieve satisfactory performance. Therefore, we propose a deep learning (DL) modified AMP network (DL-mAMPnet) that enhances the detection performance by effectively exploiting the pilot activity correlation. The DL-mAMPnet is constructed by unfolding the AMP algorithm into a feedforward neural network, which combines the principled mathematical model of the AMP algorithm with the powerful learning capability, thereby benefiting from the advantages of both techniques. Trainable parameters are introduced in the DL-mAMPnet to approximate the correlated sparsity pattern and the large-scale fading coefficient. Moreover, a refinement module is designed to further advance the performance by utilizing the spatial feature caused by the correlated sparsity pattern. Simulation results demonstrate that the proposed DL-mAMPnet can significantly outperform traditional algorithms in terms of the symbol error rate performance. © 2023, CC BY-NC-SA.

关键词： Message passing

Pay Less But Get More: A Dual-Attention-based Channel Estimation Network for Massive MIMO systems with Low-Density Pilots

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhou, Binggui Yang, Xi Ma, Shaodan Gao, Feifei Yang, Guanghua The School of Intelligent Systems Science and Engineering Jinan University Zhuhai519070 China The State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau 999078 China The Shanghai Key Laboratory of Multidimensional Information Processing School of Communication and Electronic Engineering East China Normal University Shanghai200241 China Department of Automation Tsinghua University Beijing100084 China The School of Intelligent Systems Science and Engineering The GBA and B&R International Joint Research Center for Smart Logistics Jinan University Zhuhai519070 China

To reap the promising benefits of massive multiple-input multiple-output (MIMO) systems, accurate channel state information (CSI) is required through channel estimation. However, due to the complicated wireless propagation environment and large-scale antenna arrays, precise channel estimation for massive MIMO systems is significantly challenging and costs an enormous training overhead. Considerable time-frequency resources are consumed to acquire sufficient accuracy of CSI, which thus severely degrades systems’ spectral and energy efficiencies. In this paper, we propose a dual-attention-based channel estimation network (DACEN) to realize accurate channel estimation via low-density pilots, by jointly learning the spatial-temporal domain features of massive MIMO channels with the temporal attention module and the spatial attention module. To further improve the estimation accuracy, we propose a parameter-instance transfer learning approach to transfer the channel knowledge learned from the high-density pilots pre-acquired during the training dataset collection period. Experimental results reveal that the proposed DACEN-based method achieves better channel estimation performance than the existing methods under various pilot-density settings and signal-to-noise ratios. Additionally, with the proposed parameter-instance transfer learning approach, the DACEN-based method achieves additional performance gain, thereby further demonstrating the effectiveness and superiority of the proposed method. Copyright © 2023, The Authors. All rights reserved.

关键词： Channel estimation