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

arXiv 2024年

作者： Zhang, Ruichen Du, Hongyang Liu, Yinqiu Niyato, Dusit Kang, Jiawen Xiong, Zehui Jamalipour, Abbas Kim, Dong In The College of Computing and Data Science Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The University of Sydney SydneyNSW2006 Australia The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

In response to the needs of 6G global communications, satellite communication networks have emerged as a key solution. However, the large-scale development of satellite communication networks is constrained by the complex system models, whose modeling is challenging for massive users. Moreover, transmission interference between satellites and users seriously affects communication performance. To solve these problems, this paper develops generative artificial intelligence (AI) agents for model formulation and then applies a mixture of experts (MoE) approach to design transmission strategies. Specifically, we leverage large language models (LLMs) to build an interactive modeling paradigm and utilize retrieval-augmented generation (RAG) to extract satellite expert knowledge that supports mathematical modeling. Afterward, by integrating the expertise of multiple specialized components, we propose an MoE-proximal policy optimization (PPO) approach to solve the formulated problem. Each expert can optimize the optimization variables at which it excels through specialized training through its own network and then aggregates them through the gating network to perform joint optimization. The simulation results validate the accuracy and effectiveness of employing a generative agent for problem formulation. Furthermore, the superiority of the proposed MoE-ppo approach over other benchmarks is confirmed in solving the formulated problem. The adaptability of MoE-PPO to various customized modeling problems has also been demonstrated. © 2024, CC BY.

关键词： Satellite communication systems

来源：评论

学校读者我要写书评

暂无评论

Using Machine Learning to Study the Effects of Genetic Predisposition on Brain Aging in the UK Biobank

Using Machine Learning to Study the Effects of Genetic Predi...

引用

IEEE International Symposium on Biomedical Imaging

作者： Karen Ardila Emily Munro Fernando Vega Aashka Mohite Charlotte Curtis Amanda V. Tyndall M. Ethan MacDonald Department of Electronic and Automation Biomedical Engineering Universidad Autónoma de Manizales Manizales Colombia Department of Biomedical Engineering University of Calgary Calgary Canada Department of Electrical & Software Engineering University of Calgary Calgary Canada Department of Radiology University of Calgary Calgary Canada Hotchkiss Brain Institute University of Calgary Calgary Canada Mitacs Globalink Research Internship Program Canada Department of Chemical Engineering University of Calgary Calgary Canada Department of Mathematics and Computing Mount Royal University Calgary Canada Department of Medical Genetics University of Calgary Calgary Canada

The influence of genetic predisposition on changes in brain morphology during aging remains largely unknown. This study explores the effects of genetic predisposition on three key brain regions: total brain volume (TBV), lateral ventricular volume (LVV), and total hippocampal volume (THV). The brain age gap estimate (BrainAGE) biomarker is used as an input to a genome-wide association study to determine which single nucleotide polymorphisms (SNPs) and genes are associated with accelerated brain aging. Six independent significant SNPs were found to contribute to accelerated morphological changes: TBV had associations on chromosome 17 linked with brain aging, and the total THV had independent significant associations in the APOC1 and TOMM40 gene regions related to neurodegeneration. Lastly, LVV presented a possible novel discovery in the gene NUAK1, known to play a role in cellular senescence. This study provides a framework to uncover complex associations between brain aging physiology and genetics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Coplane-Constrained Sparse Depth Sampling and Local Depth Propagation for Depth Estimation

SSRN

引用

SSRN 2023年

作者： Zhang, Jiehua Yang, Zhiwen Li, Liang Chen, Chuqiao Wang, Hongkui Wang, Tingyu Yan, Chenggang Gong, Yihong School of Software Engineering Xi’an Jiaotong University Xi’an710000 China Hangzhou Dianzi University Hangzhou310018 China Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Lishui Institute of Hangzhou Dianzi University Hangzhou310018 China Department of Automation

Depth estimation with sparse reference has emerged recently, and predicts depth map from a monocular image and a set of depth reference samples. Previous works randomly select reference samples by sensors, leading to severe depth bias as this sampling is independent to image semantic and neglects the unbalance of depth distribution in regions. This paper proposes a Coplane-Constrained sparse Depth (CCD) sampling to explore representative reference samples, and design a Local Depth Propagation (LDP) network for complete the sparse point cloud map. This can capture diverse depth information and diffuse the valid points to neighbors with geometry prior. Specifically, we first construct the surface normal map and detect coplane pixels by superpixel segmenting for sampling references, whose depth can be represented by that of superpixel centroid. Then, we introduce local depth propagation to obtain coarse-level depth map with geometric information, which dynamically diffuses the depth from the reference to neighbors based on local planar assumption. Further, we generate the fine-level depth map by devising a pixel-wise focal loss, which imposes the semantic and geometry calibration on pixels with low confidence in coarse-level prediction. Extensive experiments on public datasets demonstrate that our model outperforms SOTA depth estimation and completion methods. © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Joint Class-Balanced Client Selection and Bandwidth Allocation for Cost-Efficient Federated Learning in Mobile Edge computing Networks

引用

IEEE Transactions on Mobile computing 2025年第7期24卷 5681-5698页

作者： Tang, Jian Li, Xiuhua Li, Hui Li, Penghua Wang, Xiaofei Leung, Victor C.M. School of Big Data & Software Engineering Chongqing University Chongqing400000 China School of Automation Chongqing University of Posts and Telecommunications Chongqing400065 China College of Intelligence and Computing Tianjin University 300072 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverBCV6T1Z4 Canada

Federated Learning (FL) has significant potential to protect data privacy and mitigate network burden in mobile edge computing (MEC) networks. However, due to the system and data heterogeneity of mobile clients (MCs), client selection and bandwidth allocation is key for achieving cost-efficient FL in MEC networks with limited bandwidth. To address these challenges, we investigate the issue of joint client selection and bandwidth allocation for reducing the cost (i.e., latency and energy consumption) of FL training. We formulate the problem and decompose it into a holistic subproblem to reduce the number of rounds and a partial subproblem to reduce the costs of FL each round. We propose a joint class-balanced client selection and bandwidth allocation (CBCSBA) framework to address the whole problem. Specifically, for the holistic subproblem, CBCSBA combines MCs into groups, each having data distribution as close as possible to class-balanced distribution;For the partial subproblem, CBCSBA reduces costs by exploratively selecting a group and sequentially optimizing the latency and energy consumption of MCs within the group. Experimental results show that CBCSBA outperforms the baseline frameworks in reducing latency by 28.2% and energy consumption by 25.3% on average in the considered four datasets. Our code is available here. © 2002-2012 IEEE All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Label Cluster Chains for Multi-Label Classification

arXiv

引用

arXiv 2024年

作者： Gatto, Elaine Cecília Nakano, Felipe Kenji Read, Jesse Ferrandin, Mauri Cerri, Ricardo Vens, Celine Department of Computer Science Federal University of São Carlos SP São Carlos13565-905 Brazil Faculty of Medicine Katholieke Universiteit Leuven West Flanders Kortrijk8500 Belgium École Polytechnique Polytechnic Institute of Paris Palaiseau Paris91120 France Department of Control Automation and Computing Engineering Federal University of Santa Catarina SC Blumenau89036-002 Brazil Institute of Mathematical and Computing Sciences University of São Paulo SP São Carlos13566-590 Brazil

Multi-label classification is a type of supervised machine learning that can simultaneously assign multiple labels to an instance. To solve this task, some methods divide the original problem into several sub-problems (local approach), others learn all labels at once (global approach), and others combine several classifiers (ensemble approach). Regardless of the approach used, exploring and learning label correlations is important to improve the classifier predictions. Ensemble of Classifier Chains (ECC) is a well-known multi-label method that considers label correlations and can achieve good overall performance on several multi-label datasets and evaluation measures. However, one of the challenges when working with ECC is the high dimensionality of the label space, which can impose limitations for fully-cascaded chains as the complexity increases regarding feature space expansion. To improve classifier chains, we propose a method to chain disjoint correlated label clusters obtained by applying a partition method in the label space. During the training phase, the ground truth labels of each cluster are used as new features for all of the following clusters. During the test phase, the predicted labels of clusters are used as new features for all the following clusters. Our proposal, called Label Cluster Chains for Multi-Label Classification (LCC-ML), uses multi-label Random Forests as base classifiers in each cluster, combining their predictions to obtain a final multi-label classification. Our proposal obtained better results compared to the original ECC. This shows that learning and chaining disjoint correlated label clusters can better explore and learn label correlations. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantum error precompensation for quantum noisy channels

引用

Physical Review A 2022年第4期106卷 042440-042440页

作者： Chengjie Zhang Liangsheng Li Guodong Lu Haidong Yuan Runyao Duan School of Physical Science and Technology Ningbo University Ningbo 315211 China Science and Technology on Electromagnetic Scattering Laboratory Beijing 100854 China Department of Mechanical and Automation Engineering The Chinese University of Hong Kong Hong Kong Institute for Quantum Computing Baidu Research Beijing 100193 China

Most previous efforts on quantum error correction focused on either extending classical error-correction schemes to the quantum regime by performing a perfect correction on a subset of errors or seeking a recovery operation to maximize the fidelity between an input state and its corresponding output state of a noisy channel. There are few results concerning quantum error precompensation. Here we design an error-precompensated input state for an arbitrary quantum noisy channel and a given target output state. By following a procedure, the required input state, if it exists, can be analytically obtained in single-partite systems. Furthermore, we also present semidefinite programs to numerically obtain the error-precompensated input states with maximal fidelities between the target state and the output state. The numerical results coincide with the analytical results.

关键词： Quantum channels Quantum control Quantum error correction

来源：评论

学校读者我要写书评

暂无评论

Active legibility in multiagent reinforcement learning

引用

Artificial Intelligence 2025年 346卷

作者： Liu, Yanyu Pan, Yinghui Zeng, Yifeng Ma, Biyang Doshi, Prashant School of Automation Central South University No. 605 South Lushan Road Hunan Changsha410083 China School of Artificial Intelligence & National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen China Department of Computer and Information Sciences Northumbria University Newcastle United Kingdom School of Computer Science Minnan Normal University Fujian Zhangzhou China Department of Computer Science University of Georgia AthensGA United States

A multiagent sequential decision problem has been seen in many critical applications including urban transportation, autonomous driving cars, military operations, etc. Its widely known solution, namely multiagent reinforcement learning, has evolved tremendously in recent years. Among them, the solution paradigm of modeling other agents attracts our interest, which is different from traditional value decomposition or communication mechanisms. It enables agents to understand and anticipate others' behaviors and facilitates their collaboration. Inspired by recent research on the legibility that allows agents to reveal their intentions through their behavior, we propose a multiagent active legibility framework to improve their performance. The legibility-oriented framework drives agents to conduct legible actions so as to help others optimize their behaviors. In addition, we design a series of problem domains that emulate a common legibility-needed scenario and effectively characterize the legibility in multiagent reinforcement learning. The experimental results demonstrate that the new framework is more efficient and requires less training time compared to several multiagent reinforcement learning algorithms. © 2025 The Author(s)

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

Generative AI for Deep Reinforcement Learning: Framework, Analysis, and Use Cases

arXiv

引用

arXiv 2024年

作者： Sun, Geng Xie, Wenwen Niyato, Dusit Mei, Fang Kang, Jiawen Du, Hongyang Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510006 China Department of Electrical and Electronic Engineering The University of Hong Kong 999077 Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn36830 United States

As a form of artificial intelligence (AI) technology based on interactive learning, deep reinforcement learning (DRL) has been widely applied across various fields and has achieved remarkable accomplishments. However, DRL faces certain limitations, including low sample efficiency and poor generalization. Therefore, we present how to leverage generative AI (GAI) to address these issues above and enhance the performance of DRL algorithms in this paper. We first introduce several classic GAI and DRL algorithms and demonstrate the applications of GAI-enhanced DRL algorithms. Then, we discuss how to use GAI to improve DRL algorithms from the data and policy perspectives. Subsequently, we introduce a framework that demonstrates an actual and novel integration of GAI with DRL, i.e., GAI-enhanced DRL. Additionally, we provide a case study of the framework on UAV-assisted integrated near-field/far-field communication to validate the performance of the proposed framework. Moreover, we present several future directions. Finally, the related code is available at: https://***/GAI-enhanced-DRL. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Coalitional MPC with predicted topology transitions ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 3342-3347页

作者： E. Masero J.M. Maestre M. Francisco E.F. Camacho Systems Engineering and Automation Department University of Seville Seville Spain Computing and Automation Department University of Salamanca Salamanca Spain

This paper proposes a novel hierarchical coalitional MPC technique, where transitions to the best communication topology are considered over the prediction horizon. For this reason, a new variable, called transition horizon, is added to the optimization problem to compute the optimal instant to introduce a new topology. Consequently, local controllers can anticipate topology transitions and adapt their trajectories whilst optimizing their local interests. Furthermore, stability guarantees in the closed-loop control of each coalition are provided. The benefits of this control method are shown via a simulated non-linear eight-coupled tanks plant.

关键词： Model predictive control Multi-agent systems Networked control LMI Stability

来源：评论

学校读者我要写书评

暂无评论

Computationally Expensive High-Dimensional Multiobjective Optimization via Surrogate-Assisted Reformulation and Decomposition

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Pan, Linqiang Lin, Jianqing Wang, Handing He, Cheng Tan, Kay Chen Jin, Yaochu School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan China School of Artificial Intelligence Xidian University Xi’an China School of Electrical and Electronic Engineering Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hong Kong School of Engineering Trustworth and General Artificial Intelligence Laboratory Westlake University Hangzhou China

In recent decades, various surrogate-assisted evolutionary algorithms (SAEAs) have been proposed to solve computationally expensive multiobjective optimization problems (EMOPs). Nevertheless, designing an SAEA to handle high-dimensional EMOPs and balance convergence, diversity, and computational complexity remains challenging. Here, we propose a two-phase SAEA (TP-SAEA), which follows the idea of convergence first and diversity second, for solving high-dimensional EMOPs. In Phase I, a surrogate-assisted problem reformulation method is proposed to fast-track the Pareto optimal set in association with some reference solutions. Specifically, the high-dimensional EMOP is reformulated into an expensive single-objective one with low-dimensional decision space. Then, the surrogate-assisted optimization is utilized to obtain well-converged solutions. In Phase II, the high-dimensional EMOP is decomposed into two subproblems to explore subregions of the decision space that can effectively promote the diversity of the solutions. The two subproblems are optimized independently via surrogate-assisted optimization, aiming to push the population towards different regions of the Pareto optimal front. Experiments are conducted on EMOPs with 100 to 500 decision variables compared with four state-of-the-art SAEAs. The proposed TP-SAEA obtains well-converged and diverse solutions with only 509 real function evaluations. Moreover, its superiority is examined in six real-world instances with up to 12,000 decision variables. IEEE

关键词： Iron

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：