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

31st International Conference on Computational Linguistics, COLING 2025

作者： Lai, Yilong Wu, Jialong Zhang, Congzhi Sun, Haowen Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China

ISBN: (纸本)9798891761964

Conversational Query Reformulation (CQR) has significantly advanced in addressing the challenges of conversational search, particularly those stemming from the latent user intent and the need for historical context. Recent works aimed to boost the performance of CQR through alignment. However, they are designed for one specific retrieval system, which potentially results in sub-optimal generalization. To overcome this limitation, we present a novel framework ADACQR. By aligning reformulation models with both term-based and semantic-based retrieval systems, ADACQR enhances the generalizability of information-seeking queries among diverse retrieval environments through a two-stage training strategy. Moreover, two effective approaches are proposed to obtain superior labels and diverse input candidates, boosting the efficiency and robustness of the framework. Experimental results on the TopiOCQA, QReCC and TREC CAsT datasets demonstrate that ADACQR outperforms the existing methods in a more efficient framework, offering both quantitative and qualitative improvements in conversational query reformulation. © 2025 Association for Computational Linguistics.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding 31

SEED: Accelerating Reasoning Tree Construction via Scheduled...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wang, Zhenglin Wu, Jialong Lai, Yilong Zhang, Congzhi Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China

ISBN: (纸本)9798891761964

Large Language Models (LLMs) demonstrate remarkable emergent abilities across various tasks, yet fall short of complex reasoning and planning tasks. The tree-search-based reasoning methods address this by encouraging the exploration of intermediate steps, surpassing the capabilities of chain-of-thought prompting. However, significant inference latency is introduced due to the systematic exploration and evaluation of multiple thought paths. This paper introduces SEED, a novel and efficient inference framework to improve both runtime speed and GPU memory management concurrently. Based on a scheduled speculative execution, SEED efficiently handles multiple iterations for thought generation and state evaluation, leveraging a rounds-scheduled strategy to manage draft model dispatching. Extensive experimental evaluations on three reasoning datasets demonstrate the superior speedup performance of SEED. © 2025 Association for Computational Linguistics.

关键词： Memory management

来源：评论

学校读者我要写书评

暂无评论

Light Up Fireflies: Towards Understanding the Design of Interpersonal Bodily Intertwinement in Bodily Play 24

Light Up Fireflies: Towards Understanding the Design of Inte...

引用

11th ACM SIGCHI Annual Symposium on computer-Human Interaction in Play, CHI-PLAY Companion 2024

作者： Lu, Yingtong Li, Zhuying Ding, Ding Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China

ISBN: (纸本)9798400706929

In this paper, we explore the design of interpersonal bodily intertwinement through a VR social game, "Light Up Fireflies". Inspired by works of virtual co-embodiment, our game lets two players embody a single avatar, where each player controls half of the body. The gameplay involves walking in a virtual forest and collaboratively interacting with floating fireflies. While moving, poor coordination can lead to unbalanced movements, causing the avatar to lose its center of mass and fall. Such a design might blur the body boundary between players, providing an intriguing bodily experience of interpersonal bodily intertwinement. We hope our work offers novel insights into bodily play where players experience interconnected physical presence within the digital space. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Enhancing Parameter-Efficient Transformers with Contrastive Syntax and Regularized Dropout for Neural Machine Translation 21st

Enhancing Parameter-Efficient Transformers with Contrastive...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Fan, Yunlong Yang, Zhiheng Li, Baixuan Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China

ISBN: (纸本)9789819601219

Transformers have significantly improved Neural Machine Translation (NMT) models, accompanied by the inherent space complexity of O(n2). While recent approaches aim to be parameter-efficient, they often exhibit limited generalization capabilities with fewer parameters and decreased performances in longer sentences. To this end, we propose two methods, Syntax-enhanced Contrastive Learning (Syn-CL) and JS divergence-based Regularized Dropout (JSR-Drop) for the cross-layer parameter-sharing Transformer (baseline) in NMT. In Syn-CL, we add the corresponding target-to-source instances for the same batch in an extra bidirectional training phase, and minimize the distances of syntax-enhanced representation between the bilingual sentence-pair while maximizing the ones among others. In JSR-Drop, we refine the regularized dropout strategy with JS divergence, and improve generalization capabilities by reducing Transformers’ inconsistencies between training and inference introduced by dropout. Extensive experiments on six NMT tasks, IWSLT2014 (German↔English) and IWSLT2017 (English↔French and English↔Romanian), show an average BLEU score of 37.55, surpassing the vanilla Transformer and the baseline up to 1.75 BLEU, and outperforming models with 1.5×, 2.0× parameters in translating long sentences. Our code is available at https://***/Anon1214/EnPeNMT. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Label distribution learning for scene text detection

引用

Frontiers of computer Science 2023年第6期17卷 5-12页

作者： Haoyu MA Ningning LU Junjun MEI Tao GUAN Yu ZHANG Xin GENG School of Computer Science and Engineering and the Key Lab of Computer Network and Information Integration(Ministry of Education)Southeast UniversityNanjing 211189China ZTE Corporation Nanjing 210012China

Recently,segmentation-based scene text detection has drawn a wide research interest due to its flexibility in describing scene text instance of arbitrary shapes such as curved ***,existing methods usually need complex post-processing stages to process ambiguous labels,i.e.,the labels of the pixels near the text boundary,which may belong to the text or *** this paper,we present a framework for segmentation-based scene text detection by learning from ambiguous *** use the label distribution learning method to process the label ambiguity of text annotation,which achieves a good performance without using additional post-processing *** on benchmark datasets demonstrate that our method produces better results than state-of-the-art methods for segmentation-based scene text detection.

关键词： scene text detection multi-task learning label distribution learning

来源：评论

学校读者我要写书评

暂无评论

SEAVER: Attention Reallocation for Mitigating Distractions in Language Models for Conditional Semantic Textual Similarity Measurement

SEAVER: Attention Reallocation for Mitigating Distractions i...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Li, Baixuan Fan, Yunlong Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9798891761681

Conditional Semantic Textual Similarity (C-STS) introduces specific limiting conditions to the traditional Semantic Textual Similarity (STS) task, posing challenges for STS models. Language models employing cross-encoding demonstrate satisfactory performance in STS, yet their effectiveness significantly diminishes in C-STS. In this work, we argue that the failure is due to the fact that the redundant information in the text distracts language models from the required condition-relevant information. To alleviate this, we propose SElf-Augmentation Via SElf-Reweighting (SEAVER), which, based solely on models' internal attention and without the need for external auxiliary information, adaptively reallocates the model's attention weights by emphasizing the importance of condition-relevant tokens. On the C-STS-2023 test set, SEAVER consistently improves performance of all million-scale fine-tuning baseline models (up to around 3 points), and even surpasses performance of billion-scale few-shot prompted large language models (such as GPT-4). Our code is available at https://***/BaixuanLi/SEAVER. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Open Set Recognition 38

Multi-Label Open Set Recognition

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Wang, Yi-Bo Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

In multi-label learning, each training instance is associated with multiple labels simultaneously. Traditional multi-label learning studies primarily focus on closed set scenario, i.e. the class label set of test data is identical to those used in training phase. Nevertheless, in numerous real-world scenarios, the environment is open and dynamic where unknown labels may emerge gradually during testing. In this paper, the problem of multi-label open set recognition (MLOSR) is investigated, which poses significant challenges in classifying and recognizing instances with unknown labels in multi-label setting. To enable open set multi-label prediction, a novel approach named SLAN is proposed by leveraging sub-labeling information enriched by structural information in the feature space. Accordingly, unknown labels are recognized by differentiating the sub-labeling information from holistic supervision. Experimental results on various datasets validate the effectiveness of the proposed approach in dealing with the MLOSR problem. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Binary Decomposition: A Problem Transformation Perspective for Open-Set Semi-Supervised Learning 41

Binary Decomposition: A Problem Transformation Perspective f...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

Semi-supervised learning (SSL) is a classical machine learning paradigm dealing with labeled and unlabeled data. However, it often suffers performance degradation in real-world open-set scenarios, where unlabeled data contains outliers from novel categories that do not appear in labeled data. Existing studies commonly tackle this challenging open-set SSL problem with detect-and-filter strategy, which attempts to purify unlabeled data by detecting and filtering outliers. In this paper, we propose a novel binary decomposition strategy, which refrains from error-prone procedure of outlier detection by directly transforming the original open-set SSL problem into a number of standard binary SSL problems. Accordingly, a concise yet effective approach named BDMatch is presented. BDMatch confronts two attendant issues brought by binary decomposition, i.e. class-imbalance and representation-compromise, with adaptive logit adjustment and label-specific feature learning respectively. Comprehensive experiments on diversified benchmarks clearly validate the superiority of BDMatch as well as the effectiveness of our binary decomposition strategy. Copyright 2024 by the author(s)

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Prediction-Based Fuzzy Method for Multi-objective Microservice Workflows Scheduling 18th

A Prediction-Based Fuzzy Method for Multi-objective Microse...

引用

18th CCF Conference on computer Supported Cooperative Work and Social Computing, ChineseCSCW 2023

作者： Xu, Jingwen Chen, Long Li, Xiaoping Wang, Shuang School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing211189 China

ISBN: (纸本)9789819996391

Microservice workflows are widely used in real-time mobile computing scenarios such as face recognition and speech recognition. The key challenge is to develop efficient, stable, and robust algorithms capable of handling uncertain and fuzzy workflow tasks. In this paper, we consider the real-time microservice workflow fuzzy scheduling problem under VM-Container two-tier resources. A novel model based on triangle fuzzy numbers is formulated. The model encompasses two metrics: cost and degree of satisfaction. In response, this paper proposes an ARIMA prediction-based workflow fuzzy scheduling method (PFSM), comprising five key components: prediction of workflow arrival number, predistribution of task sub-deadlines, ordering of the task pool, task scheduling strategy, and resource management. To assess the performance of the proposed algorithms, several comparison algorithms are selected for analysis, and their performance differences are evaluated using ANOVA. The experimental results demonstrate the significant superiority of the proposed algorithms over the other compared algorithms in terms of overall performance. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

A Traffic Flow Prediction Based Task Offloading Method in Vehicular Edge Computing 18th

A Traffic Flow Prediction Based Task Offloading Method in V...

引用

18th CCF Conference on computer Supported Cooperative Work and Social Computing, ChineseCSCW 2023

作者： Xie, Liqiong Chen, Long Li, Xiaoping Wang, Shuang School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing211189 China

ISBN: (纸本)9789819996391

Vehicular Edge Computing (VEC) emerges as a promising paradigm by deploying computation and storage resources on edge servers located in close proximity to vehicles, such as roadside units or base stations. This proximity enables VEC to provide abundant resources and low-latency services, catering to the computational needs of vehicles. However, the dynamic nature of traffic flow presents new challenges in terms of task offloading decisions and resource allocation within VEC environments. This paper addresses the task offloading problem in VEC systems, considering the impact of dynamic traffic flow. To address this problem, we formulate an integer programming model that captures the essence of the studied scenario. To devise an efficient solution, we propose a novel traffic flow prediction-based heuristic algorithm (TFPVTO). TFPVTO incorporates different rules and strategies to generate an optimal offloading task sequence, make informed offloading decisions, and allocate resources effectively. To assess the performance of the proposed algorithm, we utilize a real-world traffic flow dataset. In order to fine-tune and optimize the algorithm’s components, we employ a multi-factor analysis of variance (ANOVA) technique. The proposed TFPVTO algorithm is then rigorously compared against other state-of-the-art algorithms, namely TAVF, MONSA, and RANDOM. Through extensive experiments and statistical analysis, we demonstrate the effectiveness and efficiency of the proposed algorithm in terms of task offloading performance. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：