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

arXiv 2024年

作者： Tao, Wei Zhou, Yucheng Wang, Yanlin Zhang, Hongyu Wang, Haofen Zhang, Wenqiang Shanghai Engineering Research Center of AI and Robotics Academy for Engineering and Technology Fudan University Shanghai China State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China School of Software Engineering Sun Yat-sen University Guangdong Zhuhai519082 China School of Big Data and Software Engineering Chongqing University Chongqing China College of Design and Innovation Tongji University Shanghai China Engineering Research Center of AI and Robotics Ministry of Education Academy for Engineering and Technology Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University 220 Handan Road Shanghai200433 China

Commit messages are natural language descriptions of code changes, which are important for software evolution such as code understanding and maintenance. However, previous methods are trained on the entire dataset without considering the fact that a portion of commit messages adhere to good practice (i.e., good-practice commits), while the rest do not. On the basis of our empirical study, we discover that training on good-practice commits significantly contributes to the commit message generation. Motivated by this finding, we propose a novel knowledge-aware denoising learning method called KADEL. Considering that good-practice commits constitute only a small proportion of the dataset, we align the remaining training samples with these good-practice commits. To achieve this, we propose a model that learns the commit knowledge by training on good-practice commits. This knowledge model enables supplementing more information for training samples that do not conform to good practice. However, since the supplementary information may contain noise or prediction errors, we propose a dynamic denoising training method. This method composes a distribution-aware confidence function and a dynamic distribution list, which enhances the effectiveness of the training process. Experimental results on the whole MCMD dataset demonstrate that our method overall achieves state-of-the-art performance compared with previous methods. © 2024, CC BY.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

Generative Positive-Unlabeled Classification for Hunting Small Open Reading Frames

Generative Positive-Unlabeled Classification for Hunting Sma...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jie Chen Wenbin Liao Du Wen Jianqiang Li Fangzhong Wang College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Laboratory of Synthetic Microbiology School of Chemical Engineering & Technology Tianjin University China

The annotation of Open Reading Frames (ORFs) is a crucial step in gene annotation, as it precisely delineates the specific regions of expressed genes. However, small Open Reading Frames (smORFs), in comparison to ORFs, are shorter in length, exhibit lower expression abundance, and are more challenging to predict. Particularly in the presence of noise in prokaryotic data and limited availability of positive sample data, the difficulty of prediction is amplified. Therefore, it is necessary to study smORF prediction methods. However, current machine learning models use limited data for modeling and overlook the existence of undiscovered positive samples within the negative samples. Additionally, they do not incorporate prior knowledge that can be calibrated to enhance the 3-nt periodicity. This work utilizes a multimodal VAE for data dimensionality reduction and employs a GAN to generate latent vectors for data augmentation. It incorporates PU learning to leverage unknown samples and combines Riboseq data from experiments with and without antibiotic treatment. Additionally, an adversarial training mechanism is employed to enhance the model’s robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust Generalization Against Photon-Limited Corruptions via Worst-Case Sharpness Minimization

Robust Generalization Against Photon-Limited Corruptions via...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhuo Huang Miaoxi Zhu Xiaobo Xia Li Shen Jun Yu Chen Gong Bo Han Bo Du Tongliang Liu Sydney AI Centre The University of Sydney National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University JD Explore Academy Department of Automation University of Science and Technology of China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Department of Computer Science Hong Kong Baptist University

Robust generalization aims to tackle the most challenging data distributions which are rare in the training set and contain severe noises, i.e., photon-limited corruptions. Common solutions such as distributionally robust optimization (DRO) focus on the worst-case empirical risk to ensure low training error on the uncommon noisy distributions. However, due to the over-parameterized model being optimized on scarce worst-case data, DRO fails to produce a smooth loss landscape, thus struggling on generalizing well to the test set. Therefore, instead of focusing on the worst-case risk minimization, we propose SharpDRO by penalizing the sharpness of the worst-case distribution, which measures the loss changes around the neighbor of learning parameters. Through worst-case sharpness minimization, the proposed method successfully produces a flat loss curve on the corrupted distributions, thus achieving robust generalization. Moreover, by considering whether the distribution annotation is available, we apply SharpDRO to two problem settings and design a worst-case selection process for robust generalization. Theoretically, we show that SharpDRO has a great convergence guarantee. Experimentally, we simulate photon-limited corruptions using CIFAR10/100 and ImageNet30 datasets and show that SharpDRO exhibits a strong generalization ability against severe corruptions and exceeds well-known baseline methods with large performance gains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Meta Koopman Decomposition for Time Series Forecasting Under Temporal Distribution Shifts

SSRN

引用

SSRN 2024年

作者： Zhang, Yudong Wang, Xu Sun, Zhaoyang Wang, Pengkun Wang, Binwu Li, Limin Wang, Yang School of Data Science University of Science and Technology of China Hefei230026 China School of Software Engineering University of Science and Technology of China Hefei230026 China School of Computer Science and Technology University of Science and Technology of China Hefei230026 China Key Laboratory of Precision and Intelligent Chemistry University of Science and Technology of China Hefei230026 China Suzhou Institute for Advanced Research University of Science and Technology of China Suzhou215123 China

Time series forecasting facilitates various real-world applications and has attracted great research interests. In real-world scenarios, time series forecasting models confront a fundamental issue of temporal distribution shifts (TDS), i.e., the statistical properties of time series are evolving over time. In this paper, we utilize Koopman theory to address temporal distribution shifts. Koopman theory states any time series can be mapped into a Koopman space by proper measurement functions with their dynamics modeled by the infinite-dimensional linear Koopman operator. Therefore, time series under different distributions can be modeled by different Koopman operators. Considering the linearity of Koopman operators, the Koopman operators for representing time series under different distributions can be decomposed as a linear combination of a set of Koopman operators, which we termed as meta Koopman operators. We further theoretically show the infinite-dimensional Koopman operators can be approximated by finite matrix multiplications and the meta Koopman operators are equivalent to a set of matrices. Based on the analysis, we propose an auto-encoder framework for implementing the meta Koopman decomposition of time series, which is theoretically capable of handling TDS. Extensive experiments conducted on four real-world time series datasets demonstrate the superiority of the proposed model in tackling temporal distribution shifts. © 2024, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

TUBENCH: BENCHMARKING LARGE VISION-LANGUAGE MODELS ON TRUSTWORTHINESS WITH UNANSWERABLE QUESTIONS

arXiv

引用

arXiv 2024年

作者： He, Xingwei Zhang, Qianru Jin, A-Long Yuan, Yuan Yiu, Siu-Ming The University of Hong Kong Hong Kong Xi’an Jiaotong-Liverpool University China School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Software Development Environment China Zhongguancun Laboratory China

Large Vision-Language Models (LVLMs) have achieved remarkable progress on visual perception and linguistic interpretation. Despite their impressive capabilities across various tasks, LVLMs still suffer from the issue of hallucination, which involves generating content that is incorrect or unfaithful to the visual or textual inputs. Traditional benchmarks, such as MME and POPE, evaluate hallucination in LVLMs within the scope of Visual Question Answering (VQA) using answerable questions. However, some questions are unanswerable due to insufficient information in the images, and the performance of LVLMs on such unanswerable questions remains underexplored. To bridge this research gap, we propose TUBench, a benchmark specifically designed to evaluate the reliability of LVLMs using unanswerable questions. TUBench comprises an extensive collection of high-quality, unanswerable questions that are meticulously crafted using ten distinct strategies. To thoroughly evaluate LVLMs, the unanswerable questions in TUBench are based on images from four diverse domains as visual contexts: screenshots of code snippets, natural images, geometry diagrams, and screenshots of statistical tables. These unanswerable questions are tailored to test LVLMs’ trustworthiness in code reasoning, commonsense reasoning, geometric reasoning, and mathematical reasoning related to tables, respectively. We conducted a comprehensive quantitative evaluation of 28 leading foundational models on TUBench, with Gemini-1.5-Pro, the top-performing model, achieving an average accuracy of 69.2%, and GPT-4o, the third-ranked model, reaching 66.7% average accuracy, in determining whether questions are answerable. Furthermore, our manual analysis of the model outputs reveals that: (1) Gemini-1.5-Pro provides both correct answers and explanations in only 41% of cases, and (2) hallucinations are the primary cause of error, accounting for 58.5% of the incorrect explanations generated by Gemini-1.5-Pro. These findings

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Modelling context and syntactical features for aspect-based sentiment analysis 58

Modelling context and syntactical features for aspect-based ...

引用

58th Annual Meeting of the Association for Computational Linguistics, ACL 2020

作者： Phan, Minh Hieu Ogunbona, Philip School of Computer Science and Software Engineering University of Wollongong NSW2522 Australia

ISBN: (纸本)9781952148255

The aspect-based sentiment analysis (ABSA) consists of two conceptual tasks, namely an aspect extraction and an aspect sentiment classification. Rather than considering the tasks separately, we build an end-to-end ABSA solution. Previous works in ABSA tasks did not fully leverage the importance of syntactical information. Hence, the aspect extraction model often failed to detect the boundaries of multi-word aspect terms. On the other hand, the aspect sentiment classifier was unable to account for the syntactical correlation between aspect terms and the context words. This paper explores the grammatical aspect of the sentence and employs the self-attention mechanism for syntactical learning. We combine part-of-speech embeddings, dependency-based embeddings and contextualized embeddings (e.g. BERT, RoBERTa) to enhance the performance of the aspect extractor. We also propose the syntactic relative distance to de-emphasize the adverse effects of unrelated words, having weak syntactic connection with the aspect terms. This increases the accuracy of the aspect sentiment classifier. Our solutions outperform the state-of-the-art models on SemEval-2014 dataset in both two subtasks. © 2020 Association for Computational Linguistics

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Covert Communication in Underlay Cognitive Radio Networks with Energy Harvesting

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2025年

作者： Fan, Hongbin Yang, Weiwei Pan, Gaofeng Shi, Hui Rong, Chuanzhen Army Engineering University of PLA College of Communications Engineering Nanjing210007 China Xiangnan University College of Computer and Artificial Intelligence Chenzhou423000 China Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software Guilin541004 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100081 China

This paper examines covert communication in underlay cognitive radio networks (CRNs) with energy harvesting (EH), in which considers two scenarios: 1) with perfect channel state information (CSI) of the link from the secondary source (SS) to the primary receiver (PR) at Willie, 2) with statistical CSI of the SS-PR link at Willie. The closed-form expressions for Willie’s detection error probability, the average minimum detection error probability, the transmission outage probability, and the maximum effective covert rate under both cases are derived and analyzed. The maximum effective covert rate is obtained by optimizing the maximum jamming power of the primary transmitter (PT). The numerical results demonstrate that the combined effect of energy conversion efficiency and time allocation ratio of EH, in conjunction with the maximum jamming power of PT, provides a positive effective covert rate in the secondary network. Furthermore, it is evident that the maximum effective covert rate in the secondary network is greater when Willie has access to the perfect CSI of the SS-PR link than that when Willie only has access to the statistical CSI of the SS-PR link. © 2025 IEEE. All rights reserved.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

StencilMART: Predicting Optimization Selection for Stencil Computations across GPUs

StencilMART: Predicting Optimization Selection for Stencil C...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Qingxiao Sun Yi Liu Hailong Yang Zhonghui Jiang Zhongzhi Luan Depei Qian State Key Laboratory of Software Development Environment Beijing China School of Computer Science and Engineering Beihang University Beijing China

Stencil computations are widely used in high performance computing (HPC) applications. Many HPC platforms utilize the high computation capability of GPUs to accelerate stencil computations. In recent years, stencils have become more diverse in terms of stencil order, memory accesses and computation patterns. To adapt diverse stencils to GPUs, a variety of optimization techniques have been proposed such as streaming and retiming. However, due to the diversity of stencil patterns and GPU architectures, no single optimization technique fits all stencils. Besides, it is challenging to choose the most cost-efficient GPU for accelerating target stencils. To address the above problems, we propose StencilMART, an automatic optimization selection framework that predicts the best optimization combination and execution time under a certain parameter setting for stencils on GPUs. Specifically, the StencilMART represents the stencil patterns as binary tensors and neighboring features through tensor assignment and feature extraction. In addition, the StencilMART implements various machine learning methods such as classification and regression that utilize stencil representation and hardware characteristics for execution time prediction. The experiment results show that the StencilMART can achieve accurate optimization selection and performance prediction for various stencils across GPUs.

关键词： Distributed processing Tensors High performance computing Graphics processing units Machine learning computer architecture Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Geometrically Inspired Kernel Machines for Collaborative Learning Beyond Gradient Descent

arXiv

引用

arXiv 2024年

作者： Kumar, Mohit Valentinitsch, Alexander Fuchs, Magdalena Brucker, Mathias Bowles, Juliana Husakovic, Adnan Abbas, Ali Moser, Bernhard A. Faculty of Computer Science and Electrical Engineering University of Rostock Germany Software Competence Center Hagenberg GmbH HagenbergA-4232 Austria School of Computer Science University of St Andrews United Kingdom Primetals Technologies Austria GmbH LinzA-4031 Austria Institute of Signal Processing Johannes Kepler University Linz Austria

This paper develops a novel mathematical framework for collaborative learning by means of geometrically inspired kernel machines which includes statements on the bounds of generalisation and approximation errors, and sample complexity. For classification problems, this approach allows us to learn bounded geometric structures around given data points and hence solve the global model learning problem in an efficient way by exploiting convexity properties of the related optimisation problem in a Reproducing Kernel Hilbert Space (RKHS). In this way, we can reduce classification problems to determining the closest bounded geometric structure from a given data point. Further advantages that come with our solution is that our approach does not require clients to perform multiple epochs of local optimisation using stochastic gradient descent, nor require rounds of communication between client/server for optimising the global model. We highlight that numerous experiments have shown that the proposed method is a competitive alternative to the state-of-the-art. © 2024, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

GKT: A Novel Guidance-Based Knowledge Transfer Framework For Efficient Cloud-edge Collaboration LLM Deployment

arXiv

引用

arXiv 2024年

作者： Yao, Yao Li, Zuchao Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China

The burgeoning size of Large Language Models (LLMs) has led to enhanced capabilities in generating responses, albeit at the expense of increased inference times and elevated resource demands. Existing methods of acceleration, predominantly hinged on knowledge distillation, generally necessitate fine-tuning of considerably large models, posing a challenge for average users. Furthermore, present techniques for expediting inference and reducing costs operate independently. To address these issues, we introduce a novel and intuitive Guidance-based Knowledge Transfer (GKT) framework. This approach leverages a larger LLM as a "teacher" to create guidance prompts, paired with a smaller "student" model to finalize responses. Remarkably, GKT requires no fine-tuning and doesn’t necessitate the teacher and student models to have the same vocabulary, allowing for extensive batch generation to accelerate the process while ensuring user customization. GKT can be seamlessly integrated into cloud-edge collaboration architectures, and is versatile enough for plug-and-play application across various models. When utilizing ChatGPT as teacher model and Llama2-70B as the student model, we can achieve 95.00% of ChatGPT’s performance at 52% of the cost. The results highlight substantial enhancements in accuracy and processing speed on the GSM8K and CSQA datasets, surpassing the performance of using either the student or teacher models in isolation. Our code is publicly available at https://***/Zoeyyao27/GKT © 2024, CC BY.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：