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

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Huang, Changxin Chang, Yanbin Lin, Junfan Liang, Junyang Zeng, Runhao Li, Jianqiang National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Peng Cheng Laboratory Shenzhen China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen China

ISBN: (纸本)157735897X

The ability to autonomously explore and resolve tasks with minimal human guidance is crucial for the self-development of embodied intelligence. Although reinforcement learning methods can largely ease human effort, it’s challenging to design reward functions for real-world tasks, especially for high-dimensional robotic control, due to complex relationships among joints and tasks. Recent advancements large language models (LLMs) enable automatic reward function design. However, approaches evaluate reward functions by retraining policies from scratch placing an undue burden on the reward function, expecting it to be effective throughout the whole policy improvement process. We argue for a more practical strategy in robotic autonomy, focusing on refining existing policies with policy-dependent reward functions rather than a universal one. To this end, we propose a novel reward-policy co-evolution framework where the reward function and the learned policy benefit from each other’s progressive on-the-fly improvements, resulting in more efficient and higher-performing skill acquisition. Specifically, the reward evolution process translates the robot’s previous best reward function, descriptions of tasks and environment into text inputs. These inputs are used to query LLMs to generate a dynamic amount of reward function candidates, ensuring continuous improvement at each round of evolution. For policy evolution, our method generates new policy populations by hybridizing historically optimal and random policies. Through an improved Bayesian optimization, our approach efficiently and robustly identifies the most capable and plastic reward-policy combination, which then proceeds to the next round of co-evolution. Despite using less data, our approach demonstrates an average normalized improvement of 95.3% across various high-dimensional robotic skill learning tasks. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserve

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Downstream-agnostic Adversarial Examples

Downstream-agnostic Adversarial Examples

引用

International Conference on Computer Vision (ICCV)

作者： Ziqi Zhou Shengshan Hu Ruizhi Zhao Qian Wang Leo Yu Zhang Junhui Hou Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan University School of Information and Communication Technology Griffith University Department of Computer Science City University of Hong Kong School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab

Self-supervised learning usually uses a large amount of unlabeled data to pre-train an encoder which can be used as a general-purpose feature extractor, such that downstream users only need to perform fine-tuning operations to enjoy the benefit of "large model". Despite this promising prospect, the security of pre-trained encoder has not been thoroughly investigated yet, especially when the pre-trained encoder is publicly available for commercial *** this paper, we propose AdvEncoder, the first framework for generating downstream-agnostic universal adversarial examples based on the pre-trained encoder. AdvEncoder aims to construct a universal adversarial perturbation or patch for a set of natural images that can fool all the downstream tasks inheriting the victim pre-trained encoder. Unlike traditional adversarial example works, the pre-trained encoder only outputs feature vectors rather than classification labels. Therefore, we first exploit the high frequency component information of the image to guide the generation of adversarial examples. Then we design a generative attack framework to construct adversarial perturbations/patches by learning the distribution of the attack surrogate dataset to improve their attack success rates and transferability. Our results show that an attacker can successfully attack downstream tasks without knowing either the pre-training dataset or the downstream dataset. We also tailor four defenses for pre-trained encoders, the results of which further prove the attack ability of AdvEncoder. Our codes are available at: https://***/CGCL-codes/AdvEncoder.

关键词：

来源：评论

学校读者我要写书评

暂无评论

NaFV-Net: An Adversarial Four-view Network for Mammogram Classification 39

NaFV-Net: An Adversarial Four-view Network for Mammogram Cla...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lu, Feng Hou, Yuxiang Li, Wei Yang, Xiangying Zheng, Haibo Luo, Wenxi Chen, Leqing Cao, Yuyang Liao, Xiaofei Zhang, Yu Yang, Fan Zomaya, Albert Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Australia-China Joint Research Centre for Energy Informatics and Demand Response Technologies Centre for Distributed and High Performance Computing School of Computer Science University of Sydney Australia Tongji Hospital Tongji Medical College Huazhong University of Science and Technology China

ISBN: (纸本)157735897X

Breast cancer remains a leading cause of mortality among women, with millions of new cases diagnosed annually. Early detection through screening is crucial. Using neural networks to improve the accuracy of breast cancer screening has become increasingly important. In accordance with radiologists’ practices, we propose using images from the unaffected side to create adversarial samples with critical medical implications in our adversarial learning process. By introducing beneficial perturbations, this method aims to reduce overconfidence and improve the precision and robustness of breast cancer classification. Our proposed framework is an adversarial four-view classification network (NaFV-Net) incorporating images from both affected and unaffected perspectives. By comprehensively capturing local and global information and implementing adversarial learning from four mammography views, this framework allows for the fusion of features and the integration of medical principles and radiologist evaluation techniques, thus facilitating the accurate identification and characterization of breast tissues. Extensive experiments have shown the high effectiveness of our model in accurately distinguishing between benign and malignant findings, demonstrating state-of-the-art classification performance on both internal and public datasets. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Mammography

来源：评论

学校读者我要写书评

暂无评论

Ev-IDID: Enhancing Solutions to Interactive Dynamic Influence Diagrams through Evolutionary Algorithms 21

Ev-IDID: Enhancing Solutions to Interactive Dynamic Influenc...

引用

21st International Conference on Autonomous Agents and Multiagent systems, AAMAS 2022

作者： Ma, Biyang Pan, Yinghui Zeng, Yifeng Ming, Zhong School of Computer Science and Engineering Minnan Normal University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer and Information Sciences Northumbria University United Kingdom College of Computer Science and Software Engineering Shenzhen University China

ISBN: (纸本)9781713854333

Interactive dynamic influence diagrams (I-DIDs) are a general framework for multiagent sequential decision making under uncertainty. Due to the model complexity, a significant amount of research has been invested into solving the model through various types of either exact or approximate algorithms. However, there is no tool that allows users to specify the algorithm parameters and visualise the model solutions. In this demo, we develop an interactive I-DID system that implements most of the state-of-art I-DID algorithms and develops a new type of algorithms based on evolutionary computation. In particular, we propose a multi-population genetic algorithm for solving the I-DID models and automate the generation of behavioural models in the solutions. This demo will facilitate the I-DID research development and practical applications, and elicit a new wave of I-DID solutions based on evolutionary algorithms. © 2022 International Foundation for Autonomous Agents and Multiagent systems (***). All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

GeckoDAG: Towards a Lightweight DAG-Based Blockchain via Reducing data Redundancy

GeckoDAG: Towards a Lightweight DAG-Based Blockchain via Red...

引用

International Conference on Distributed computing systems

作者： Xiaohai Dai Yifan Zhou Jiang Xiao Feng Cheng Xia Xie Hai Jin Bo Li National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China School of Computer Science and Technology Hainan University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

To overcome the scaling and performance limitations, the Directed Acyclic Graph (DAG) is utilized as the underlying storage model of blockchain systems, which enables concurrent transaction processing and confirmation. However, accompanied by high performance, DAG-based blockchains still suffer from the severe challenge of constrained storage scalability, i.e., expensive storage overhead. Based on an in-depth analysis of the data, we discover that the root cause of storage overhead stems from the considerable data redundancy in the DAG-based blockchains. In this paper, we propose GeckoDAG, a lightweight DAG-based blockchain, whose design consists of two steps. First, we abstract a storage model named Basic from the existing DAG-based blockchain systems, which offers both high performance and security. On top of Basic, we then devise GeckoDAG, which merges previous transactions into Transaction Union (TU) and reduces the data redundancy in TU, thus lowering the storage overhead. To evaluate our design, we implement a prototype of GeckoDAG and conduct various experiments on it. The experimental results demonstrate that GeckoDAG can offer storage scalability while maintaining the security and efficiency of DAG-based blockchains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic Searchable Scheme with Forward Privacy for Encrypted Document Similarity 22

Dynamic Searchable Scheme with Forward Privacy for Encrypted...

引用

22nd IEEE International Conference on Trust, Security and Privacy in computing and Communications, TrustCom 2023

作者： Al Sibahee, Mustafa A. Luo, Chengwen Zhang, Jin Huang, Yijing Abduljabbar, Zaid Ameen Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Iraq University College Computer Technology Engineering Department Basrah61004 Iraq University of Basrah College of Education for Pure Sciences Department of Computer Science Basrah61004 Iraq Huazhong University of Science and Technology Shenzhen Institute Shenzhen518000 China

ISBN: (纸本)9798350381993

Document retrieval plays an essential role in many real-world applications especially when the data storage is outsourced. Due to the great advantages offered by cloud computing, clients tend to outsource their personal data to remote servers maintained by external service providers. This raises serious privacy concerns about outsourced data because such providers are usually considered untrusted entities. The majority of previous schemes of document similarity search share the same limitation: they focus mainly on static collections. Dynamic searchable schemes (DSE) allow adding or removing documents at the expense of more leakage than static schemes. To thwart certain attacks, DSE schemes should support forward privacy property, which ensures that newly added documents cannot be related to previously issued search queries. We design and implement dynamic secure similarity search schemes with forward privacy for textual documents utilizing simhash method for hamming similarity. Our scheme provides an efficient search time and a sufficient level of privacy. To show the practicality of our proposed scheme, we performed excremental results with large document collections. © 2023 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Variational Bayes for Federated Continual Learning

arXiv

引用

arXiv 2024年

作者： Yao, Dezhong Li, Sanmu Dai, Yutong Xu, Zhiqiang Hu, Shengshan Zhao, Peilin Sun, Lichao The National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Lehigh University PA18015 United States Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Tencent AI Lab. Shenzhen China

Federated continual learning (FCL) has received increasing attention due to its potential in handling real-world streaming data, characterized by evolving data distributions and varying client classes over time. The constraints of storage limitations and privacy concerns confine local models to exclusively access the present data within each learning cycle. Consequently, this restriction induces performance degradation in model training on previous data, termed "catastrophic forgetting". However, existing FCL approaches need to identify or know changes in data distribution, which is difficult in the real world. To release these limitations, this paper directs attention to a broader continuous framework. Within this framework, we introduce Federated Bayesian Neural Network (FedBNN), a versatile and efficacious framework employing a variational Bayesian neural network across all clients. Our method continually integrates knowledge from local and historical data distributions into a single model, adeptly learning from new data distributions while retaining performance on historical distributions. We rigorously evaluate FedBNN’s performance against prevalent methods in federated learning and continual learning using various metrics. Experimental analyses across diverse datasets demonstrate that FedBNN achieves state-of-the-art results in mitigating forgetting. Copyright © 2024, The Authors. All rights reserved.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Hyperbit: A Financial Temporal Knowledge Graph data Storage system

SSRN

引用

SSRN 2022年

作者： Yuan, Pingpeng Han, Sheng Zang, Shaoqi Shi, Xuanhua Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

In the field of finance, data has the characteristics of temporal multi-frequency and heterogeneous high dimension, and the traditional knowledge graph is not suitable to express the temporal relation of financial data, so the financial temporal knowledge graph has become a research hotspot recently. There are a large number of temporal edges in the financial temporal knowledge graph. The use of general graph database management system to store financial knowledge graph data has problems such as large storage scale and slow update speed, and it cannot realize the traceability of financial data, so it cannot meet the needs of the financial field. In order to solve these problems, HyperBit, a storage system for efficient storage and management of financial data, is designed and implemented. Firstly, a temporal quad storage structure is proposed. Secondly, the Log Structured Cumulative Update (LSCU) is proposed to update financial temporal data efficiently. The update log module is designed in the system. When there is data to update, it is not directly updated in the data storage of the system, but recorded in the update log, and the system updates the content of the update log cumulatively. The system manages update logs by partition and chunk, which makes the log storage compact and independent. Besides, it is convenient for parallel processing and it improves the data update speed. Thirdly, a Bidirectional Backtracking by Final and Optimal Root (BBFOR) method is proposed to meet the requirements of efficient traceability of financial data. Unlike traditional version tracing method, BBFOR adopt both the snapshot and incremental methods which balance the space and time cost of version switching, and BBROF consider the version of the access frequency characteristic and set up the final root and the optimal root. Besides, BBROF adopt bidirectional backtracking technology to improve the efficiency of the version switching. Experimental results show that the storage cost

关键词： Switching

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

引用

IEEE Transactions on Cognitive and Developmental systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

FedMoS: Taming Client Drift in Federated Learning with Double Momentum and Adaptive Selection

FedMoS: Taming Client Drift in Federated Learning with Doubl...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Xiong Wang Yuxin Chen Yuqing Li Xiaofei Liao Hai Jin Bo Li National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Cyber Science and Engineering Wuhan University Wuhan China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Federated learning (FL) enables massive clients to collaboratively train a global model by aggregating their local updates without disclosing raw data. Communication has become one of the main bottlenecks that prolongs the training process, especially under large model variances due to skewed data distributions. Existing efforts mainly focus on either single momentum-based gradient descent, or random client selection for potential variance reduction, yet both often lead to poor model accuracy and system efficiency. In this paper, we propose FedMoS, a communication-efficient FL framework with coupled double momentum-based update and adaptive client selection, to jointly mitigate the intrinsic variance. Specifically, FedMoS maintains customized momentum buffers on both server and client sides, which track global and local update directions to alleviate the model discrepancy. Taking momentum results as input, we design an adaptive selection scheme to provide a proper client representation during FL aggregation. By optimally calibrating clients’ selection probabilities, we can effectively reduce the sampling variance, while ensuring unbiased aggregation. Through a rigid analysis, we show that FedMoS can attain the theoretically optimal ${{\mathcal{O}}}\left({{T^{ - 2/3}}}\right)$ convergence rate. Extensive experiments using real-world datasets further validate the superiority of FedMoS, with 58%-87% communication reduction for achieving the same target performance compared to state-of-the-art techniques.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：