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

arXiv 2023年

作者： Liu, Xiaogeng Li, Minghui Wang, Haoyu Hu, Shengshan Ye, Dengpan Jin, Hai Wu, Libing Xiao, Chaowei School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab China School of Cyber Science and Engineering Wuhan University China Arizona State University United States

Deep neural networks are proven to be vulnerable to backdoor attacks. Detecting the trigger samples during the inference stage, i.e., the test-time trigger sample detection, can prevent the backdoor from being triggered. However, existing detection methods often require the defenders to have high accessibility to victim models, extra clean data, or knowledge about the appearance of backdoor triggers, limiting their practicality. In this paper, we propose the test-time corruption robustness consistency evaluation (TeCo)1, a novel test-time trigger sample detection method that only needs the hard-label outputs of the victim models without any extra information. Our journey begins with the intriguing observation that the backdoor-infected models have similar performance across different image corruptions for the clean images, but perform discrepantly for the trigger samples. Based on this phenomenon, we design TeCo to evaluate test-time robustness consistency by calculating the deviation of severity that leads to predictions' transition across different corruptions. Extensive experiments demonstrate that compared with state-of-the-art defenses, which even require either certain information about the trigger types or accessibility of clean data, TeCo outperforms them on different backdoor attacks, datasets, and model architectures, enjoying a higher AUROC by 10% and 5 times of stability. Copyright © 2023, The Authors. All rights reserved.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Granule Density-Based Outlier Detection with Multi-Scale Granular Balls

arXiv

引用

arXiv 2025年

作者： Gao, Can Tan, Xiaofeng Zhou, Jie Ding, Weiping Pedrycz, Witold The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China The Faculty of Data Science City University of Macau Macau999078 China The Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia The Department of Computer Engineering Istinye University Istanbul Turkey

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. The source codes are released at https://***/Xiaofeng-Tan/MGBOD. © 2025, CC BY.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

Denoi-SpEx+: A Speaker Extraction Network based Speech Dialogue System

Denoi-SpEx+: A Speaker Extraction Network based Speech Dialo...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Yun Hao Xiangkang Huang Huichou Huang Qingyao Wu School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot Ministry of Education Guangzhou China City University of Hong Kong Hong Kong China Pazhou Lab Guangzhou China

ISBN: (纸本)9781665444194

The speech dialogue system has gradually been widely used in daily life. Users can consult and communicate with the system through natural language. However, in practical applications, third-person background sounds and background noise interference in real dialogue scenes will be encountered. The uncertainty and complexity of these background sounds will have a bad impact on the recognition of the system. A good speech enhancement module can help us to separate the target speaker from the original speech. Recently, a solution called SpEx+ was proposed from the time domain, but SpEx+ needs a reference speech to assist in training. This reference speech may have noise in actual applications that will affect performance. Therefore, we propose a Denoi-SpEx+ model. Before the reference speech is input to the network, a speech denoising network is added, so that the quality of speech separation in practical applications can be guaranteed. Experiments show that our model can significantly improve the performance of speech separation model of noisy reference speech.

关键词： Training Uncertainty Conferences Noise reduction Natural languages Interference Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

Tackling Real-world Complexity: Hierarchical Modeling and Dynamic Prompting for Multimodal Long Document Classification

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第6期35卷 5776-5790页

作者： Liu, Tengfei Hu, Yongli Li, Mingjie Yi, Junfei Chang, Xiaojun Gao, Junbin Yin, Baocai Beijing University of Technology Beijing Key Laboratory of Multimedia and Intelligent Software Technology Beijing Institute of Artificial Intelligence School of Information Science and Technology Beijing100124 China Stanford University Department of Radiation Oncology StanfordCA94305 United States Hunan University National Engineering Laboratory of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha410082 China University of Technology Sydney ReLER Laboratory Australian Artificial Intelligence Institute Faculty of Engineering and Information Technology UltimoNSW2007 Australia The University of Sydney Business School The University of Sydney Discipline of Business Analytics CamperdownNSW2006 Australia

With the rapid growth of internet content, multimodal long document data has become increasingly prominent, drawing significant attention from researchers. However, most existing methods primarily focus on scenarios where all modalities are present, often overlooking more challenging and realistic cases involving missing image modality. To address this limitation, we propose a robust multimodal long document classification (MLDC) framework that integrates hierarchical modeling and dynamic prompting to handle complex multimodal long document data. Our approach begins by leveraging hierarchical modeling combined with an Adaptive Correlation Multimodal Transformer (ACMT) to effectively capture relationships between text and images at both section and sentence levels. We also introduce a Dynamic Prompt Generation (DPG) module at both levels to enhance the model's robustness in handling missing image data. By evaluating sample uncertainty, the DPG module dynamically adjusts both the number of prompts and the prompts themselves, allowing the model to better adapt to the varying needs of different samples. Finally, a Hierarchical Heterogeneous Graph (HHG) is introduced to enhance feature interactions across levels, further improving the coherence and accuracy of the model. Extensive experiments on four multi-modal long document datasets demonstrate that our model shows superior performance compared to existing state-of-the-art MLDC classification methods in various conditions. © 1991-2012 IEEE.

关键词： dynamic prompt generation hierarchical heterogeneous graph Multimodal long document classification

来源：评论

学校读者我要写书评

暂无评论

Graph Edit Distance Reward: Learning to Edit Scene Graph 16th

Graph Edit Distance Reward: Learning to Edit Scene Graph

引用

16th European Conference on Computer Vision, ECCV 2020

作者： Chen, Lichang Lin, Guosheng Wang, Shijie Wu, Qingyao Nanyang Technological University Singapore Singapore Zhejiang University Hangzhou China Huazhong University of Science and Technology Wuhan China School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot Ministry of Education Beijing China

ISBN: (纸本)9783030585280

Scene Graph, as a vital tool to bridge the gap between language domain and image domain, has been widely adopted in the cross-modality task like VQA. In this paper, we propose a new method to edit the scene graph according to the user instructions, which has never been explored. To be specific, in order to learn editing scene graphs as the semantics given by texts, we propose a Graph Edit Distance Reward, which is based on the Policy Gradient and Graph Matching algorithm, to optimize neural symbolic model. In the context of text-editing image retrieval, we validate the effectiveness of our method in CSS and CRIR dataset. Besides, CRIR is a new synthetic dataset generated by us, which we will publish soon for future use. © 2020, Springer Nature Switzerland AG.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

MetaGCD: Learning to Continually Learn in Generalized Category Discovery

MetaGCD: Learning to Continually Learn in Generalized Catego...

引用

International Conference on Computer Vision (ICCV)

作者： Yanan Wu Zhixiang Chi Yang Wang Songhe Feng Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education Beijing Jiaotong University Beijing China School of Computer and Information Technology Beijing Jiaotong University Beijing China Department of Electrical and Computer Engineering University of Toronto Toronto Canada Department of Computer Science and Software Engineering Concordia University Montreal Canada

In this paper, we consider a real-world scenario where a model that is trained on pre-defined classes continually encounters unlabeled data that contains both known and novel classes. The goal is to continually discover novel classes while maintaining the performance in known classes. We name the setting Continual Generalized Category Discovery (C-GCD). Existing methods for novel class discovery cannot directly handle the C-GCD setting due to some unrealistic assumptions, such as the unlabeled data only containing novel classes. Furthermore, they fail to discover novel classes in a continual fashion. In this work, we lift all these assumptions and propose an approach, called MetaGCD, to learn how to incrementally discover with less forgetting. Our proposed method uses a meta-learning framework and leverages the offline labeled data to simulate the testing incremental learning process. A meta-objective is defined to revolve around two conflicting learning objectives to achieve novel class discovery without forgetting. Furthermore, a soft neighborhood-based contrastive network is proposed to discriminate uncorrelated images while attracting correlated images. We build strong baselines and conduct extensive experiments on three widely used benchmarks to demonstrate the superiority of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Temperature prediction modeling and control parameter optimization based on data driven 5

Temperature prediction modeling and control parameter optimi...

引用

5th IEEE International Conference on data Science in Cyberspace, DSC 2020

作者： Liu, Qingguang Wei, Jielong Lei, Sining Huang, Qingbao Zhang, Mengqiao Zhou, Xiongbin Guangxi University School of Electrical Engineering Nanning China School of EE Guangxi University China School of Software Engineering South China University of Technology China Key Laboratory of Big Data and Intelligent Robot Ministry of Education China Alnan Aluminium Lnc. Alnan Aluminium Co. Ltd Nanning China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195582

The aluminum smelting process is characterized with multi-variable, strong coupling and large lag, which leads to low efficiency and high energy consumption. Previous study shows that Extreme learning machine (ELM) can be used to model furnace temperature for its high train speed. However, due to the random initialization of the input weight and the hidden layer threshold in the ELM, the furnace temperature prediction model is unstable in the start of each smelting process. To improve the stability, we introduce the restricted Boltzmann machine to optimize an ELM model. In addition, a furnace temperature segmentation optimization strategy based on whale optimization algorithm is proposed to effectively find the optimal values of the control parameters in each furnace temperature section. The simulation results state that the aluminum melting time can be reduced by about 6.67% after optimization. © 2020 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Low-Light Enhancement Effect on Classification and Detection: An Empirical Study

arXiv

引用

arXiv 2024年

作者： Wu, Xu Lai, Zhihui Jie, Zhou Gao, Can Hou, Xianxu Zhang, Ya-Nan Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China

Low-light images are commonly encountered in real-world scenarios, and numerous low-light image enhancement (LLIE) methods have been proposed to improve the visibility of these images. The primary goal of LLIE is to generate clearer images that are more visually pleasing to humans. However, the impact of LLIE methods in high-level vision tasks, such as image classification and object detection, which rely on high-quality image datasets, is not well explored. To explore the impact, we comprehensively evaluate LLIE methods on these high-level vision tasks by utilizing an empirical investigation comprising image classification and object detection experiments. The evaluation reveals a dichotomy: While Low-Light Image Enhancement (LLIE) methods enhance human visual interpretation, their effect on computer vision tasks is inconsistent and can sometimes be harmful. Our findings suggest a disconnect between image enhancement for human visual perception and for machine analysis, indicating a need for LLIE methods tailored to support high-level vision tasks effectively. This insight is crucial for the development of LLIE techniques that align with the needs of both human and machine vision. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine vision

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

ABFS: Natural Robustness Testing for LLM-based NLP software

arXiv

引用

arXiv 2025年

作者： Xiao, Mingxuan Xiao, Yan Ji, Shunhui Li, Yunhe Xue, Lei Zhang, Pengcheng Key Laboratory of Water Big Data Technology of Ministry of Water Resources the College of Computer Science and Software Engineering Hohai University No. 8 Focheng West Road Jiangning District Nanjing211100 China School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University No.66 Gongchang Road Xinhu Street Guangming District Shenzhen528406 China

Owing to the exceptional performance of Large Language Models (LLMs) in Natural Language Processing (NLP) tasks, LLM-based NLP software has rapidly gained traction across various domains, such as financial analysis and content moderation. However, these applications frequently exhibit robustness deficiencies, where slight perturbations in input (prompt+example) may lead to erroneous outputs. Current robustness testing methods face two main limitations: (1) low testing effectiveness, limiting the applicability of LLM-based software in safety-critical scenarios, and (2) insufficient naturalness of test cases, reducing the practical value of testing outcomes. To address these issues, this paper proposes ABFS, a straightforward yet effective automated testing method that, for the first time, treats the input prompts and examples as a unified whole for robustness testing. Specifically, ABFS formulates the testing process as a combinatorial optimization problem, employing Best-First Search to identify successful test cases within the perturbation space and designing a novel Adaptive control strategy to enhance test case naturalness. We evaluate the robustness testing performance of ABFS on three datasets across five threat models. On Llama2-13b, the traditional StressTest achieves only a 13.273% success rate, while ABFS attains a success rate of 98.064%, supporting a more comprehensive robustness assessment before software deployment. Compared to baseline methods, ABFS introduces fewer modifications to the original input and consistently generates test cases with superior naturalness. Furthermore, test cases generated by ABFS exhibit stronger transferability and higher testing efficiency, significantly reducing testing costs. © 2025, CC BY-NC-ND.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：