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

5th International Conference on Artificial Intelligence and Computer Science, AICS 2023

作者： Chen, Boran Wang, Jiaji Miao, Zhenjiang Li, Jianpo Yang, Shengchun Jilin Electric Power Big Data Intelligent Processing Engineering Technology Research Center School of Computing Northeast Electric Power University Jilin Jilin132012 China Institute of Information Science School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China

ISBN: (纸本)9781510668621

Labanotation is an approach to record human movement with different distributions in space that have different representations of symbols. Motion capture is a technique that records the trajectory of an object in the time domain by tracking the motion of key points, observed using different sensors, and recorded in files. This paper is to manually mark the Labanotation based on 3D human motion capture data, to divide the 3D human motion into gaits and poses, and to record and represent different human movements and positions in space in the notation. This is an exploration of motion capture data to generate Labanotation, while also contributing to the preservation of folk-art forms. © 2023 SPIE.

关键词： Time domain analysis

来源：评论

学校读者我要写书评

暂无评论

Leveraging Slot-Aware Enhancements for Improved Zero-Shot Dialogue State Tracking

Leveraging Slot-Aware Enhancements for Improved Zero-Shot Di...

引用

Frontiers technology of information and Computer (ICFTIC), IEEE International Conference on

作者： Tianhang Song Haolei Hu Xinxin Chen Kangli Zi Henan Institute of Advanced Technology Zhengzhou University Zhengzhou China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Beijing China

ISBN: (数字)9798331541750

ISBN: (纸本)9798331541767

Task-oriented dialogue systems (TOD) aim to help users complete specific tasks through multiple rounds of dialogue, in which Dialogue State Tracking (DST) is a key component. The training of DST models typically necessitates the availability of a substantial corpus of dialogue data with turn-level annotations. However, the collection of such data is both costly and inefficient. Despite the impressive performance of systems based on advanced large language models (LLMs), their closed-source nature restricts the potential for local deployment. To address this challenge, this paper proposes a new zero-shot slot-aware enhanced model (SAE), which introduces a novel coded prompting framework to enhance the DST capability of small parameter models in new domains and task scenarios. In particular, we have devised a prompting framework that employs code to refine task instructions. Furthermore, we have proposed a slot-aware question generation mechanism that generates slot-aware questions based on contextual details in accordance with the dialogue context, thereby enhancing the model's perception and matching capabilities for slots. In order to verify the effectiveness of the model, we conducted experiments on the MultiWOZ dataset. The results show that the SAE model has achieved significant performance improvements in zero-shot DST tasks.

关键词： Training Adaptation models Codes Large language models Computational modeling Termination of employment Predictive models Question generation Data models Context modeling

来源：评论

学校读者我要写书评

暂无评论

Sequential Topic Selection Model with Latent Variable for Topic-Grounded Dialogue

Sequential Topic Selection Model with Latent Variable for To...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Wen, Xiaofei Wei, Wei Mao, Xian-Ling Cognitive Computing and Intelligent Information Processing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science and Technology Beijing Institute of Technology China

Recently, topic-grounded dialogue system has attracted significant attention due to its effectiveness in predicting the next topic to yield better responses via the historical context and given topic sequence. However, almost all existing topic prediction solutions focus on only the current conversation and corresponding topic sequence to predict the next conversation topic, without exploiting other topic-guided conversations which may contain relevant topic-transitions to current conversation. To address the problem, in this paper we propose a novel approach, named Sequential Global Topic Attention (SGTA) to exploit topic transition over all conversations in a subtle way for better modeling post-to-response topic-transition and guiding the response generation to the current conversation. Specifically, we introduce a latent space modeled as a Multivariate Skew-Normal distribution with hybrid kernel functions to flexibly integrate the global-level information with sequence-level information, and predict the topic based on the distribution sampling results. We also leverage a topic-aware prior-posterior approach for secondary selection of predicted topics, which is utilized to optimize the response generation task. Extensive experiments demonstrate that our model outperforms competitive baselines on prediction and generation tasks. © 2022 Association for Computational Linguistics.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

An evolutionary multiobjective method based on dominance and decomposition for feature selection in classification

引用

Science China(information Sciences) 2024年第2期67卷 5-19页

作者： Jing LIANG Yuyang ZHANG Ke CHEN Boyang QU Kunjie YU Caitong YUE Ponnuthurai Nagaratnam SUGANTHAN School of Electrical and Information Engineering Zhengzhou University State Key Laboratory of Intelligent Agricultural Power Equipment School of Electrical Engineering and Automation Henan Institute of Technology School of Electronics and Information Zhongyuan University of Technology KINDI Center for Computing Research College of EngineeringQatar University

Feature selection in classification can be considered a multiobjective problem with the objectives of increasing classification accuracy and decreasing the size of the selected feature subset. Dominance-based and decomposition-based multiobjective evolutionary algorithms(MOEAs) have been extensively used to address the feature selection problem due to their strong global search capability. However, most of them face the problem of not effectively balancing convergence and diversity during the evolutionary process. In addressing the aforementioned issue, this study proposes a unified evolutionary framework that combines two search forms of dominance and decomposition. The advantages of the two search methods assist one another in escaping the local optimum and inclining toward a balance of convergence and diversity. Specifically, an improved environmental selection strategy based on the distributions of individuals in the objective space is presented to avoid duplicate feature subsets. Furthermore, a novel knowledge transfer mechanism that considers evolutionary characteristics is developed, allowing for the effective implementation of positive knowledge transfer between dominance-based and decomposition-based feature selection methods. The experimental results demonstrate that the proposed algorithm can evolve feature subsets with good convergence and diversity in a shorter time compared with 9 state-of-the-art feature selection methods on 20 classification problems.

关键词： evolutionary algorithms feature selection multiobjective optimization knowledge transfer classification

来源：评论

学校读者我要写书评

暂无评论

Nested relation extraction with iterative neural network

引用

Frontiers of Computer Science 2021年第3期15卷 109-122页

作者： Yixuan CAO Dian CHEN Zhengqi XU Hongwei LI Ping LUO Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China

Most existing researches on relation extraction focus on binary flat relations like Bomln relation between a Person and a *** a large portion of objective facts de-scribed in natural language are complex,especially in professional documents in fields such as finance and biomedicine that require precise *** example,“the GDP of the United States in 2018 grew 2.9%compared with 2017”describes a growth rate relation between two other relations about the economic index,which is beyond the expressive power of binary flat ***,we propose the nested relation extraction problem and formulate it as a directed acyclic graph(DAG)structure extraction ***,we propose a solution using the Iterative Neural Network which extracts relations layer by *** proposed solution achieves 78.98 and 97.89 FI scores on two nested relation extraction tasks,namely semantic cause-and-efFect relation extraction and formula ***,we observe that nested relations are usually expressed in long sentences where entities are mentioned repetitively,which makes the annotation difficult and ***,we extend our model to incorporate a mention-insensitive mode that only requires annotations of relations on entity concepts(instead of exact mentions)while preserving most of its *** mention-insensitive model performs better than the mention sensitive model when the random level in mention selection is higher than 0.3.

关键词： nested relation extraction mention insensitive relation iterative neural network

来源：评论

学校读者我要写书评

暂无评论

ESNet: Evolution and Succession Network for High-Resolution Salient Object Detection 41

ESNet: Evolution and Succession Network for High-Resolution ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Liu, Hongyu Cong, Runmin Li, Hua Xu, Qianqian Huang, Qingming Zhang, Wei Institute of Information Science Beijing Jiaotong University Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China School of Control Science and Engineering Shandong University Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Computer Science and Technology Hainan University Hainan China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

Preserving details and avoiding high computational costs are the two main challenges for the High-Resolution Salient Object Detection (HRSOD) task. In this paper, we propose a two-stage HRSOD model from the perspective of evolution and succession, including an evolution stage with Low-resolution Location Model (LrLM) and a succession stage with High-resolution Refinement Model (HrRM). The evolution stage achieves detail-preserving salient objects localization on the low-resolution image through the evolution mechanisms on supervision and feature;the succession stage utilizes the shallow high-resolution features to complement and enhance the features inherited from the first stage in a lightweight manner and generate the final high-resolution saliency prediction. Besides, a new metric named Boundary-Detail-aware Mean Absolute Error (MAEBD) is designed to evaluate the ability to detect details in high-resolution scenes. Extensive experiments on five datasets demonstrate that our network achieves superior performance at real-time speed (49 FPS) compared to state-of-the-art methods. Our code is publicly available at: https://***/rmcong/ESNet_ICML24. Copyright 2024 by the author(s)

关键词： Miocene

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Riemannian Meta-Optimization via Subspace Adaptation

arXiv

引用

arXiv 2025年

作者： Yu, Peilin Wu, Yuwei Gao, Zhi Fan, Xiaomeng Jia, Yunde Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

Riemannian meta-optimization provides a promising approach to solving non-linear constrained optimization problems, which trains neural networks as optimizers to perform optimization on Riemannian manifolds. However, existing Riemannian meta-optimization methods take up huge memory footprints in large-scale optimization settings, as the learned optimizer can only adapt gradients of a fixed size and thus cannot be shared across different Riemannian parameters. In this paper, we propose an efficient Riemannian meta-optimization method that significantly reduces the memory burden for large-scale optimization via a subspace adaptation scheme. Our method trains neural networks to individually adapt the row and column subspaces of Riemannian gradients, instead of directly adapting the full gradient matrices in existing Riemannian meta-optimization methods. In this case, our learned optimizer can be shared across Riemannian parameters with different sizes. Our method reduces the model memory consumption by six orders of magnitude when optimizing an orthogonal mainstream deep neural network (e.g. ResNet50). Experiments on multiple Riemannian tasks show that our method can not only reduce the memory consumption but also improve the performance of Riemannian meta-optimization. © 2025, CC BY-NC-ND.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Speculative decoding with CTC-based draft model for LLM inference acceleration 24

Speculative decoding with CTC-based draft model for LLM infe...

引用

Proceedings of the 38th International Conference on Neural information Processing Systems

作者： Zhuofan Wen Shangtong Gui Yang Feng Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences and State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences and Key Laboratory of Al Safety Chinese Academy of Sciences and University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798331314385

Inference acceleration of large language models (LLMs) has been put forward in many application scenarios and speculative decoding has shown its advantage in addressing inference acceleration. Speculative decoding usually introduces a draft model to assist the base LLM where the draft model produces drafts and the base LLM verifies the draft for acceptance or rejection. In this framework, the final inference speed is decided by the decoding speed of the draft model and the acceptance rate of the draft provided by the draft model. Currently the widely used draft models usually generate draft tokens for the next several positions in a non-autoregressive way without considering the correlations between draft tokens. Therefore, it has a high decoding speed but an unsatisfactory acceptance rate. In this paper, we focus on how to improve the performance of the draft model and aim to accelerate inference via a high acceptance rate. To this end, we propose a CTC-based draft model which strengthens the correlations between draft tokens during the draft phase, thereby generating higher-quality draft candidate sequences. Experiment results show that compared to strong baselines, the proposed method can achieve a higher acceptance rate and hence a faster inference speed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CIMulator: Evaluating Neuromorphic Accelerators with HZO FefinFET-Based Synaptic Device 7

CIMulator: Evaluating Neuromorphic Accelerators with HZO Fef...

引用

7th International Conference on Green technology and Sustainable Development, GTSD 2024

作者： Le, Hoang-Hiep Lu, Hao-Yu Baig, Md. Aftab De, Sourav Lin, Ing-Chao Lu, Darsen D. Minghsin University of Science and Technology Department of Computer Science and Information Engineering Hsinchu Taiwan National ChengKung University Intelligent Computing Industrial Doctorate Program Tainan Taiwan Institute of Microelectronics National ChengKung University Tainan Taiwan National ChengKung University Department of Computer Science and Information Engineering Tainan Taiwan

ISBN: (纸本)9798350386073

In this study, we use the CIMulator platform to evaluate the performance of neuromorphic accelerators with novel Hf0.5Zr0.5O2 (HZO) ferroelectric fin field-effect transistor (FefinFET) as synaptic device. The MNIST handwritten digit dataset is used for training and inference processes in multilayer perceptron (MLP) neural networks. With the highly optimized synaptic device, the results demonstrate high training and inference accuracy, achieving up to 97% for the MLP, approaching the accuracy of software implementations. © 2024 IEEE.

关键词： Multilayer neural networks

来源：评论

学校读者我要写书评

暂无评论

Video Summarization Using Denoising Diffusion Probabilistic Model 39

Video Summarization Using Denoising Diffusion Probabilistic ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Shang, Zirui Zhu, Yubo Li, Hongxi Yang, Shuo Wu, Xinxiao Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

ISBN: (纸本)157735897X

Video summarization aims to eliminate visual redundancy while retaining key parts of video to construct concise and comprehensive synopses. Most existing methods use discriminative models to predict the importance scores of video frames. However, these methods are susceptible to annotation inconsistency caused by the inherent subjectivity of different annotators when annotating the same video. In this paper, we introduce a generative framework for video summarization that learns how to generate summaries from a probability distribution perspective, effectively reducing the interference of subjective annotation noise. Specifically, we propose a novel diffusion summarization method based on the Denoising Diffusion Probabilistic Model (DDPM), which learns the probability distribution of training data through noise prediction, and generates summaries by iterative denoising. Our method is more resistant to subjective annotation noise, and is less prone to overfitting the training data than discriminative methods, with strong generalization ability. Moreover, to facilitate training DDPM with limited data, we employ an unsupervised video summarization model to implement the earlier denoising process. Extensive experiments on various datasets (TVSum, SumMe, and FPVSum) demonstrate the effectiveness of our method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Normal distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：