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

arXiv 2024年

作者： Hou, Xiaoyang Zhu, Tian Ren, Milong Bu, Dongbo Gao, Xin Zhang, Chunming Sun, Shiwei Key Laboratory of Intelligent Information Processing Institute of Computing Technology School of Computer Science and Technology University of Chinese Academy of Sciences China Central China Research Institute for Artificial Intelligence Technologies China Western Institute of Computing Technology Phil Rivers Technology King Abdullah University of Science and Technology Saudi Arabia

Generating molecular graphs is crucial in drug design and discovery but remains challenging due to the complex interdependencies between nodes and edges. While diffusion models have demonstrated their potentiality in molecular graph design, they often suffer from unstable training and inefficient sampling. To enhance generation performance and training stability, we propose GGFlow, a discrete flow matching generative model incorporating optimal transport for molecular graphs and it incorporates an edge-augmented graph transformer to enable the direct communications among chemical bounds. Additionally, GGFlow introduces a novel goal-guided generation framework to control the generative trajectory of our model, aiming to design novel molecular structures with the desired properties. GGFlow demonstrates superior performance on both unconditional and conditional molecule generation tasks, outperforming existing baselines and underscoring its effectiveness and potential for wider application. © 2024, CC BY.

关键词： Molecular docking

来源：评论

学校读者我要写书评

暂无评论

DASC-SPT: Towards Self-Supervised Panoramic Semantic Segmentation

DASC-SPT: Towards Self-Supervised Panoramic Semantic Segment...

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Tianlong Tan Bin Chen Hongliang Cao Chenggang Yan Yike Ma Feng Dai Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences Institute of Computing Technology Chinese Academy of Sciences Beijing China Shandong University University of Chinese Academy of Sciences Beijing China Hangzhou Dianzi University

ISBN: (数字)9798331510831

ISBN: (纸本)9798331510848

Self-Supervised Semantic Segmentation, aiming to leverage masses of unlabeled data for boosting semantic segmentation, has been rapidly emerging as an active task in recent years. However, existing self-supervised semantic segmentation approaches mainly focus on planar images, leaving multiple distorted objects encountered in panoramic images unexplored due to the formidable challenge of handling heterogeneous degrees of distortions across different locations. In this paper, we propose a novel Self-Supervised Panoramic Semantic Segmentation model, termed DASC-SPT, built upon the mainstream contrastive learning framework. Towards distortions in panoramic images, we present two structures to better learn from distorted features by applying planar images. For the input images of self-supervision, we design a Spherical Projection Transformation (SPT) strategy that involves randomly projecting planar images onto various locations of the sphere to introduce the distortions. For pixel-wise distorted features, we construct a Deformation-aware Sampling Consistency (DASC) framework to further utilize the shared content and discrepancies caused by different distortions of paired views, where the deformation-aware consistency can be quantified on pixel-wise features. Both of the two components facilitate the model to adapt to distortions and boost panoramic semantic segmentation. Extensive comprehensive experiments on three panoramic datasets demonstrate the effectiveness and superiority of DASC-SPT approach.

关键词： Training Deformable models Adaptation models Computer vision Semantic segmentation Computational modeling Crops Contrastive learning Distortion Boosting

来源：评论

学校读者我要写书评

暂无评论

Non-autoregressive Machine Translation with Probabilistic Context-free Grammar

arXiv

引用

arXiv 2023年

作者： Gui, Shangtong Shao, Chenze Ma, Zhengrui Zhang, Xishan Chen, Yunji Feng, Yang State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Cambricon Technologies China

Non-autoregressive Transformer(NAT) significantly accelerates the inference of neural machine translation. However, conventional NAT models suffer from limited expression power and performance degradation compared to autoregressive (AT) models due to the assumption of conditional independence among target tokens. To address these limitations, we propose a novel approach called PCFG-NAT, which leverages a specially designed Probabilistic Context-Free Grammar (PCFG) to enhance the ability of NAT models to capture complex dependencies among output tokens. Experimental results on major machine translation benchmarks demonstrate that PCFG-NAT further narrows the gap in translation quality between NAT and AT models. Moreover, PCFG-NAT facilitates a deeper understanding of the generated sentences, addressing the lack of satisfactory explainability in neural machine translation.2 Copyright © 2023, The Authors. All rights reserved.

关键词： Computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

FedCross: Intertemporal Federated Learning Under Evolutionary Games 39

FedCross: Intertemporal Federated Learning Under Evolutionar...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lu, Jianfeng Zhang, Ying Jia, Riheng Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology) Ministry of Education China School of Computer Science and Technology Zhejiang Normal University China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

ISBN: (纸本)157735897X

Federated Learning (FL) mitigates privacy leakage in decentralized machine learning by allowing multiple clients to train collaboratively locally. However, dynamic mobile networks with high mobility, intermittent connectivity, and bandwidth limitation severely hinder model updates to the cloud server. Although previous studies have typically addressed user mobility issue through task reassignment or predictive modeling, frequent migrations may result in high communication overhead. Addressing this challenge involves not only dealing with resource constraints, but also finding ways to mitigate the challenges posed by user migrations. We therefore propose a intertemporal incentive framework, FedCross, which ensures the continuity of FL tasks by migrating interrupted training tasks to feasible mobile devices. FedCross comprises two distinct stages: Specifically, in Stage 1, we address the task allocation problem across regions under resource constraints by employing a multi-objective migration algorithm to quantify the optimal task receivers. Moreover, we adopt evolutionary game theory to capture the dynamic decision-making of users, forecasting the evolution of user proportions across different regions to mitigate frequent migrations. In Stage 2, we utilize a procurement auction mechanism to allocate rewards among base stations, ensuring that those providing high-quality models receive optimal compensation. This approach incentivizes sustained user participation, thereby ensuring the overall feasibility of FedCross. Finally, experimental results validate the theoretical soundness of FedCross and demonstrate its significant reduction in communication overhead. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

TRAIL: Trust-Aware Client Scheduling for Semi-Decentralized Federated Learning 39

TRAIL: Trust-Aware Client Scheduling for Semi-Decentralized ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Hu, Gangqiang Lu, Jianfeng Han, Jianmin Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Zhejiang Normal University China School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

ISBN: (纸本)157735897X

Due to the sensitivity of data, Federated Learning (FL) is employed to enable distributed machine learning while safeguarding data privacy and accommodating the requirements of various devices. However, in the context of semi-decentralized FL, clients’ communication and training states are dynamic. This variability arises from local training fluctuations, heterogeneous data distributions, and intermittent client participation. Most existing studies primarily focus on stable client states, neglecting the dynamic challenges inherent in real-world scenarios. To tackle this issue, we propose a TRust-Aware clIent scheduLing mechanism called TRAIL, which assesses client states and contributions, enhancing model training efficiency through selective client participation. We focus on a semi-decentralized FL framework where edge servers and clients train a shared global model using unreliable intra-cluster model aggregation and inter-cluster model consensus. First, we propose an adaptive hidden semi-Markov model to estimate clients’ communication states and contributions. Next, we address a client-server association optimization problem to minimize global training loss. Using convergence analysis, we propose a greedy client scheduling algorithm. Finally, our experiments conducted on real-world datasets demonstrate that TRAIL outperforms state-of-the-art baselines, achieving an improvement of 8.7% in test accuracy and a reduction of 15.3% in training loss. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

DeepMesh: A Comprehensive Survey of Deep Learning-Based Routing Performance in Wireless Mesh Networks 18

DeepMesh: A Comprehensive Survey of Deep Learning-Based Rout...

引用

18th International Conference on intelligent Systems and Knowledge Engineering, ISKE 2023

作者： Xiaoping, Qiu Alam, Md Zahidul Du, Shiling Yue, Zhongjian Wang, Yulan School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu610031 China Tangshan Institute of Southwest Jiaotong University Tangshan063000 China National United Engineering Laboratory of Integrated and Intelligent Transportation Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Chengdu610031 China Sichuan Institute of Industrial Software Technology Sichuan Chengdu China

ISBN: (纸本)9798350318401

This paper provides a analysis of the challenges faced in routing in wireless mesh networks and how deep learning can be used to improve performance. Wireless mesh networks (WMNs) are a particular kind of wireless network that use mesh routers and mesh clients that talk to one another to provide wireless coverage over a wide area. The paper discusses the limitations of traditional routing methods in WMNs and highlights the potential of deep learning-based routing approaches to revolutionize WMNs. The survey evaluates the literature focusing on the various routing approaches, performances, and research methodologies. The study aims to provide several potential areas for further investigation in deep learning-based routing approaches for WMNs and discusses several research challenges and opportunities in the field. The identification of trends and challenges, and recommendations for future research directions provide valuable insights for researchers and practitioners in the field of wireless mesh networks. © 2023 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Meta-Causal Learning for Single Domain Generalization

Meta-Causal Learning for Single Domain Generalization

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Jin Chen Zhi Gao Xinxiao Wu Jiebo Luo Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Computer Science University of Rochester Rochester NY USA

Single domain generalization aims to learn a model from a single training domain (source domain) and apply it to multiple unseen test domains (target domains). Existing methods focus on expanding the distribution of the training domain to cover the target domains, but without estimating the domain shift between the source and target domains. In this paper, we propose a new learning paradigm, namely simulate-analyze-reduce, which first simulates the domain shift by building an auxiliary domain as the target domain, then learns to analyze the causes of domain shift, and finally learns to reduce the domain shift for model adaptation. Under this paradigm, we propose a meta-causal learning method to learn meta-knowledge, that is, how to infer the causes of domain shift between the auxiliary and source domains during training. We use the meta-knowledge to analyze the shift between the target and source domains during testing. Specifically, we perform multiple transformations on source data to generate the auxiliary domain, perform counterfactual inference to learn to discover the causal factors of the shift between the auxiliary and source domains, and incorporate the inferred causality into factor-aware domain alignments. Extensive experiments on several benchmarks of image classification show the effectiveness of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accurate interpolation for scattered data through hierarchical residual refinement 23

Accurate interpolation for scattered data through hierarchic...

引用

Proceedings of the 37th International Conference on Neural information Processing Systems

作者： Shizhe Ding Boyang Xia Dongbo Bu Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and University of Chinese Academy of Sciences Beijing China and Central China Institute for Artificial Intelligence Technologies Zhengzhou China

Accurate interpolation algorithms are highly desired in various theoretical and engineering scenarios. Unlike the traditional numerical algorithms that have exact zero-residual constraints on observed points, the neural network-based interpolation methods exhibit non-zero residuals at these points. These residuals, which provide observations of an underlying residual function, can guide predicting interpolation functions, but have not been exploited by the existing approaches. To fill this gap, we propose Hierarchical INTerpolation Network (HINT), which utilizes the residuals on observed points to guide target function estimation in a hierarchical fashion. HINT consists of several sequentially arranged lightweight interpolation blocks. The first interpolation block estimates the main component of the target function, while subsequent blocks predict the residual components using observed points residuals of the preceding blocks. The main component and residual components are accumulated to form the final interpolation results. Furthermore, under the assumption that finer residual prediction requires a more focused attention range on observed points, we utilize hierarchical local constraints in correlation modeling between observed and target points. Extensive experiments demonstrate that HINT outperforms existing interpolation algorithms significantly in terms of interpolation accuracy across a wide variety of datasets, which underscores its potential for practical scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Designing Novel Cognitive Diagnosis Models via Evolutionary Multi-Objective Neural Architecture Search

arXiv

引用

arXiv 2023年

作者： Yang, Shangshang Ma, Haiping Zhen, Cheng Tian, Ye Zhang, Limiao Jin, Yaochu Zhang, Xingyi The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Anhui University Hefei230039 China The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Anhui Hefei230601 China The Faculty of Technology Bielefeld Unversity Bielefeld33619 Germany

Cognitive diagnosis plays a vital role in modern intelligent education platforms to reveal students’ proficiency in knowledge concepts for subsequent adaptive tasks. However, due to the requirement of high model interpretability, existing manually designed cognitive diagnosis models hold too simple architectures to meet the demand of current intelligent education systems, where the bias of human design also limits the emergence of effective cognitive diagnosis models. In this paper, we propose to automatically design novel cognitive diagnosis models by evolutionary multiobjective neural architecture search (NAS). Specifically, we observe existing models can be represented by a general model handling three given types of inputs and thus first design an expressive search space for the NAS task in cognitive diagnosis. Then, we propose multi-objective genetic programming (MOGP) to explore the NAS task’s search space by maximizing model performance and interpretability. In the MOGP design, each architecture is transformed into a tree architecture and encoded by a tree for easy optimization, and a tailored genetic operation based on four sub-genetic operations is devised to generate offspring effectively. Besides, an initialization strategy is also suggested to accelerate the convergence by evolving half of the population from existing models’ variants. Experiments on two real-world datasets demonstrate that the cognitive diagnosis models searched by the proposed approach exhibit significantly better performance than existing models and also hold as good interpretability as human-designed models. Copyright © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Two Heads Are Better Than One: Improving Fake News Video Detection by Correlating with Neighbors

arXiv

引用

arXiv 2023年

作者： Qi, Peng Zhao, Yuyang Shen, Yufeng Ji, Wei Cao, Juan Chua, Tat-Seng Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China National University of Singapore Singapore

The prevalence of short video platforms has spawned a lot of fake news videos, which have stronger propagation ability than textual fake news. Thus, automatically detecting fake news videos has been an important countermeasure in practice. Previous works commonly verify each news video individually with multimodal information. Nevertheless, news videos from different perspectives regarding the same event are commonly posted together, which contain complementary or contradictory information and thus can be used to evaluate each other mutually. To this end, we introduce a new and practical paradigm, i.e., cross-sample fake news video detection, and propose a novel framework, Neighbor-Enhanced fakE news video Detection (NEED), which integrates the neighborhood relationship of new videos belonging to the same event. NEED can be readily combined with existing single-sample detectors and further enhance their performances with the proposed graph aggregation (GA) and debunking rectification (DR) modules. Specifically, given the feature representations obtained from single-sample detectors, GA aggregates the neighborhood information with the dynamic graph to enrich the features of independent samples. After that, DR explicitly leverages the relationship between debunking videos and fake news videos to refute the candidate videos via textual and visual consistency. Extensive experiments on the public benchmark demonstrate that NEED greatly improves the performance of both single-modal (up to 8.34% in accuracy) and multimodal (up to 4.97% in accuracy) base detectors. Codes are available in https://***/ICTMCG/NEED. Copyright © 2023, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：