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

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haihong Guo Fengxin Li Jiao Li Hongyan Liu School of Information Renmin University of China China Institute of Medical Information / Medical Library Chinese Academy of Medical Sciences / Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative to the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP-based conservative Q-learning (CQL) on the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This allows us to choose the base networks according to the offline RL task requirements.

关键词： Training Performance evaluation Hands Q-learning Neural networks Memory management Signal processing Benchmark testing Splines (mathematics) Speech processing

来源：评论

学校读者我要写书评

暂无评论

Uncovering the Impact of Chain-of-Thought Reasoning for Direct Preference Optimization: Lessons from Text-to-SQL

arXiv

引用

arXiv 2025年

作者： Liu, Hanbing Li, Haoyang Zhang, Xiaokang Chen, Ruotong Xu, Haiyong Tian, Tian Qi, Qi Zhang, Jing Gaoling School of Artificial Intelligence Renmin University of China Beijing China School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China Engineering Research Center of Database and Business Intelligence Beijing China China Mobile Information Technology Center China

Direct Preference Optimization (DPO) has proven effective in complex reasoning tasks like math word problems and code generation. However, when applied to Text-to-SQL datasets, it often fails to improve performance and can even degrade it. Our investigation reveals the root cause: unlike math and code tasks, which naturally integrate Chain-of-Thought (CoT) reasoning with DPO, Text-to-SQL datasets typically include only final answers (gold SQL queries) without detailed CoT solutions. By augmenting Text-to-SQL datasets with synthetic CoT solutions, we achieve, for the first time, consistent and significant performance improvements using DPO. Our analysis shows that CoT reasoning is crucial for unlocking DPO’s potential, as it mitigates reward hacking, strengthens discriminative capabilities, and improves scalability. These findings offer valuable insights for building more robust Text-to-SQL models. To support further research, we publicly release the code and CoT-enhanced datasets © 2025, CC BY.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Accurate, Secure, and Efficient Semi-Constrained Navigation Over Encrypted City Maps

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2642-2658页

作者： Li, Meng Chen, Yifei Gao, Jianbo Wu, Jingyu Zhang, Zijian He, Jialing Zhu, Liehuang Conti, Mauro Lin, Xiaodong Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei230002 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230002 China Hefei University of Technology Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei230002 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100811 China University of Science and Technology of China School of Computer Science and Technology Hefei230026 China Beijing Institute of Technology Southeast Institute of Information Technology Fujian Putian351100 China Chongqing University College of Computer Science Chongqing400044 China University of Padua Department of Mathematics HIT Center Padua35131 Italy Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Delft2628 CD Netherlands University of Guelph School of Computer Science GuelphONN1G 2W1 Canada

Navigation services enable users to find the shortest path from a starting point S to a destination D, reducing time, gas, and traffic congestion. Still, navigation users risk the exposure of their sensitive location data. Our motivation arises from how users can accurately, securely, and efficiently navigate from S to Dwhile passing through k unordered stops, i.e., midway locations with a non-fixed visiting order. In this work, we formally define Semi-Constrained Navigation (SCN) and present a novel scheme Hermestoachieveaccurate,secure, andefficient SCN. Specifically, weproposeadivide-and-conquerapproachtostrikeagoodbalance betweenaccuracyandefficiency. It recursively depth-first-searches the whole area (a navigation tree) and invokes five carefully-crafted strategies stop-by-stop to compute three subpaths in three se quential subareas. We construct a path-distance oracle to encrypt the road graph and securely implement the strategies by using homomorphic encryption and garble circuits. We formally prove the security in the random oracle model and analyze the search complexity to be less than O(k2). We experiment over a real-world city map and compare with six baselines. Results show that path search with k = 4 among N = 1000 intersections requires 5.58 seconds with a 3.2% distance deviation rate and an 82.5% path similarity. © 2004-2012 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Counterfactual Inference for Generalized Zero-Shot Compound-Fault Diagnosis

引用

IEEE Transactions on Instrumentation and Measurement 2025年 74卷

作者： Xu, Juan Kong, Hui Ding, Xu Yuan, Xiaohui Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Ministry of Education School of Computer and Information Hefei230601 China University of North Texas Department of Computer Science and Engineering DentonTX76205 United States

Learning a model heavily depends on the training examples, which are sometimes difficult to obtain if not impossible. This a typically true for fault diagnosis in machinery, particularly for compound faults. The counterfactual inference reveals the causal components inherent in the fault data in an interpretable manner, divulging critical causes from the observable phenomena. This article proposes a method to address the imbalance and interpretability issues of generalized zero-shot learning (GZSL) methods for compound-fault diagnosis using counterfactual inference. Our method uses a structural causal model (SCM) to decouple and generate fault features, which enhances the capabilities of the variational autoencoder and generative adversarial network (VAE-GAN) through a strengthened discriminator, and reveals the intrinsic causal components in fault data, distinguishing key fault causes from accompanying phenomena. This enables the classification of both single and compound faults by learning from examples of single faults, easing the dependence on the examples of compound faults. Extensive experimental results show that our method, trained solely with single-fault samples, achieves a harmonic average of 87.40% accuracy for both single and compound faults, outperforming existing state-of-the-art methods. This significantly improves both the accuracy and interpretability of compound-fault diagnosis. © 1963-2012 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

CroPrompt: Cross-task Interactive Prompting for Zero-shot Spoken Language Understanding

CroPrompt: Cross-task Interactive Prompting for Zero-shot Sp...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Libo Qin Fuxuan Wei Qiguang Chen Jingxuan Zhou Shijue Huang Jiasheng Si Wenpeng Lu Wanxiang Che School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Harbin Institute of Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology (Shandong Academy of Sciences)

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Slot filling and intent detection are two highly correlated tasks in spoken language understanding (SLU). Recent SLU research attempts to explore zero-shot prompting techniques in large language models to alleviate the data scarcity problem. Nevertheless, the existing prompting work ignores the cross-task interaction information for SLU, which leads to sub-optimal performance. To solve this problem, we present the pioneering work of Cross-task Interactive Prompting (CroPrompt) for SLU, which enables the model to interactively leverage the information exchange across the correlated tasks in SLU. Additionally, we further introduce a multi-task self-consistency mechanism to mitigate the error propagation caused by the intent information injection. We conduct extensive experiments on the standard SLU benchmark and the results reveal that CroPrompt consistently outperforms the existing prompting approaches. In addition, the multi-task self-consistency mechanism can effectively ease the error propagation issue, thereby enhancing the performance. We hope this work can inspire more research on cross-task prompting for SLU.

关键词： Large language models Signal processing Benchmark testing Multitasking Filling Acoustics Speech processing information exchange Standards

来源：评论

学校读者我要写书评

暂无评论

SoAy: A Solution-based LLM API-using Methodology for Academic information Seeking 25

SoAy: A Solution-based LLM API-using Methodology for Academi...

引用

Proceedings of the 31st ACM SIGKDD Conference on knowledge Discovery and data Mining V.1

作者： Yuanchun Wang Jifan Yu Zijun Yao Jing Zhang Yuyang Xie Shangqing Tu Yiyang Fu Youhe Feng Jinkai Zhang Jingyao Zhang Bowen Huang Yuanyao Li Huihui Yuan Lei Hou Juanzi Li Jie Tang School of Information Renmin University of China Beijing China & Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China Institute of Education Tsinghua University Beijing China Department of Computer Science and Technology Tsinghua University Beijing China School of Information Renmin University of China Beijing China & Engineering Research Center of Database and Business Intelligence MOE Beijing China School of Information Renmin University of China Beijing China Zhipu AI Beijing China

ISBN: (纸本)9798400712456

Applying large language models (LLMs) to academic API usage shows promise in reducing researchers' efforts to seek academic information. However, current LLM methods for using APIs struggle with the complex API coupling commonly encountered in academic queries. To address this, we introduce SoAy, a solution-based LLM methodology for academic information seeking. SoAy enables LLMs to generate code for invoking APIs, guided by a pre-constructed API calling sequence referred to as a solution. This solution simplifies the model's understanding of complex API relationships, while the generated code enhances reasoning efficiency. LLMs are aligned with this solution-oriented, code-based reasoning method by automatically enumerating valid API coupling sequences and transforming them into queries and executable *** evaluate SoAy, we introduce SoAyBench, an evaluation benchmark accompanied by SoAyEval, built upon a cloned environment of APIs from AMiner. Experimental results demonstrate a 34.58-75.99% performance improvement compared to state-of-the-art LLM API-based baselines. All datasets, codes, tuned models, and deployed online services are publicly accessible at https://***/RUCKBReasoning/SoAy.

关键词： academic information seeking

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Preference Completion with Ranked and Unranked Preferences

引用

Cognitive Computation 2025年第3期17卷 1-21页

作者： Li, Lei Liu, Pan Zhang, Renjie Tao, Zhenchao Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Radiation Oncology The First Affiliated Hospital of USTC Division of Life Sciences and Medicine University of Science and Technology of China Hefei China Department of Radiation Oncology Anhui Provincial Cancer Hospital Hefei China

As for social choice, all alternatives are ranked by agents to form preferences as linear orders. However, in applications, sometimes some alternatives cannot be ranked, or it is unnecessary to rank them, which leads to unranked alternatives. Hence, without loss of generality, by dividing the set of alternatives into three ranked and unranked subsets, including top-k alternatives, intermediate-r alternatives, and last-l alternatives, the Mallows model on ranked and unranked preferences can be analyzed systematically. Technically, a repeated insertion model is adopted during sampling, and probability distributions are derived for ranked and unranked preferences of alternatives. Experimental results verify the accuracy of the probability distributions for different ranked and unranked preferences of alternatives. Furthermore, in order to solve the preference completion problem where agents have multiple partial rankings, a fuzzy preference completion algorithm, Fuzzy-Multi-Rankings, is proposed, which introduces a fuzzy ranking to complete the target agent’s preference in addition to the traditional nearest-neighbor-based methods. Based on the three ranked and unranked preferences, seven cases can be classified and analyzed for fuzzy preference completion. Experiments on the synthetic datasets and MovieLens dataset confirm the effectiveness and efficiency of our proposed Fuzzy-Multi-Rankings algorithm and also verify the accuracy of the evaluated probability distributions for the proposed seven cases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recovering accurate labeling information from partially valid data for effective multi-label learning 29

Recovering accurate labeling information from partially vali...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Li, Ximing Wang, Yang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University China Key Laboratory of Knowledge Engineering With Big Data Ministry of Education Hefei University of Technology China School of Computer Sci and Information Engineering Hefei University of Technology China

ISBN: (纸本)9780999241165

Partial Multi-label Learning (PML) aims to induce the multi-label predictor from datasets with noisy supervision, where each training instance is associated with several candidate labels but only partially valid. To address the noisy issue, the existing PML methods basically recover the ground-truth labels by leveraging the ground-truth confidence of the candidate label, i.e., the likelihood of a candidate label being a ground-truth one. However, they neglect the information from non-candidate labels, which potentially contributes to the ground-truth label recovery. In this paper, we propose to recover the ground-truth labels, i.e., estimating the ground-truth confidences, from the label enrichment, composed of the relevance degrees of candidate labels and irrelevance degrees of non-candidate labels. Upon this observation, we further develop a novel two-stage PML method, namely Partial MultiLabel Learning with Label Enrichment-Recovery (PML3ER), where in the first stage, it estimates the label enrichment with unconstrained label propagation, then jointly learns the ground-truth confidence and multi-label predictor given the label enrichment. Experimental results validate that PML3ER outperforms the state-of-the-art PML methods. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

PEJA:Progressive Energy-Efficient Join Processing for Sensor Networks

引用

Journal of Computer Science & Technology 2008年第6期23卷 957-972页

作者：赖永炫陈毅隆陈红 School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education

Sensor networks are widely used in many applications to collaboratively collect information from the physical environment. In these applications, the exploration of the relationship and linkage of sensing data within multiple regions can be naturally expressed by joining tuples in these regions. However, the highly distributed and resource-constraint nature of the network makes join a challenging query. In this paper, we address the problem of processing join query among different regions progressively and energy-efficiently in sensor networks. The proposed algorithm PEJA （Progressive Energy-efficient Join Algorithm） adopts an event-driven strategy to output the joining results as soon as possible, and alleviates the storage shortage problem in the in-network nodes. It also installs filters in the joining regions to prune unmatchable tuples in the early processing phase, saving lots of unnecessary transmissions. Extensive experiments on both synthetic and real world data sets indicate that the PEJA scheme outperforms other join algorithms, and it is effective in reducing the number of transmissions and the delay of query results during the join processing.

关键词： progressive join minimal join set in-network processing sensor network

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Medical Image Segmentation Based on Frequency Domain Aware Stable Consistency Regularization

引用

Journal of imaging informatics in medicine 2025年 2025 Jan 22页

作者： Yihao Ouyang Peipei Li Haixiang Zhang Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei 230009 Anhui China. School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 Anhui China. School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 Anhui China. peipeili@***. Center for Big Data and Population Health of IHM Anhui Medical University Hefei Anhui China. peipeili@***. Center for Big Data and Population Health of IHM Anhui Medical University Hefei Anhui China. Computer Centre The Second People's Hospital of Hefei Hefei 230011 Anhui China. Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei University of Technology Hefei 230009 Anhui China.

With the advancement of deep learning models nowadays, they have successfully applied in the semi-supervised medical image segmentation where there are few annotated medical images and a large number of unlabeled ones. A representative approach in this regard is the semi-supervised method based on consistency regularization, which improves model training by imposing consistency constraints (perturbations) on unlabeled data. However, the perturbations in this kind of methods are often artificially designed, which may introduce biases unfavorable to the model learning in the handling of medical image segmentation. On the other hand, the majority of such methods often overlook the supervision in the Encoder stage of training and primarily focus on the outcomes in the later stages, potentially leading to chaotic learning in the initial phase and subsequently impacting the learning process of the model in the later stages. At the meanwhile, they miss the intrinsic spatial-frequency information of the images. Therefore, in this study, we propose a new semi-supervised medical image segmentation approach based on frequency domain aware stable consistency regularization. Specifically, to avoid the bias introduced by artificially setting perturbations, we first utilize the inherent frequency domain information of images, including both high and low frequencies, as the consistency constraint. Secondly, we incorporate supervision in the Encoder stage of model training to ensure that the model does not fail to learn due to the disruption of the original feature space caused by strong augmentation. Finally, extensive experimentation validates the effectiveness of our semi-supervised approach.

关键词： Consistency regularization Frequency domain Medical image segmentation Semi-supervision

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：