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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Contrastive Coding for Active Learning under Class Distribution Mismatch

Contrastive Coding for Active Learning under Class Distribut...

引用

International Conference on Computer Vision (ICCV)

作者： Pan Du Suyun Zhao Hui Chen Shuwen Chai Hong Chen Cuiping Li Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing China Renmin University of China Beijing China

ISBN: (纸本)9781665428132

Active learning (AL) is successful based on the assumption that labeled and unlabeled data are obtained from the same class distribution. However, its performance deteriorates under class distribution mismatch, wherein the un-labeled data contain many samples out of the class distribution of labeled data. To effectively handle the problems under class distribution mismatch, we propose a contrastive coding based AL framework named CCAL. Unlike the existing AL methods that focus on selecting the most informative samples for annotating, CCAL extracts both semantic and distinctive features by contrastive learning and combines them in a query strategy to choose the most informative un-labeled samples with matched categories. Theoretically, we prove that the AL error of CCAL has a tight upper bound. Experimentally, we evaluate its performance on CIFAR10, CIFAR100, and an artificial cross-dataset that consists of five datasets; consequently, CCAL achieves state-of-the-art performance by a large margin with remarkably lower annotation cost. To the best of our knowledge, CCAL is the first work related to AL for class distribution mismatch.

关键词： Computer vision Costs Upper bound Annotations Semantics Text categorization Computer architecture

来源：评论

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on Large Language Models

SLMP: A Scientific Literature Management Platform Based on L...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Menghao Guo Jinling Jiang Fan Wu Shanxin Sun Chen Zhang Wenhui Li Zeyi Sun Guangyong Chen Xindong Wu Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Hefei China

ISBN: (数字)9798331508821

ISBN: (纸本)9798331508838

This paper presents a Scientific Literature Management Platform (SLMP, demo link 1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM 2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge.

关键词： Training Large language models knowledge graphs Information retrieval data models Question answering (information retrieval)

来源：评论

学校读者我要写书评

暂无评论

Are Large Language Models Really Good Logical Reasoners? A Comprehensive Evaluation and Beyond

arXiv

引用

arXiv 2023年

作者： Xu, Fangzhi Lin, Qika Han, Jiawei Zhao, Tianzhe Liu, Jun Cambria, Erik The School of Computer Science and Technology Xi’an Jiao-tong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering National Engineering Lab for Big Data Analytics Shaanxi Xi’an710049 China The School of Computer Science and Engineering Nanyang Technological University Singapore

Logical reasoning consistently plays a fundamental and significant role in the domains of knowledge engineering and artificial intelligence. Recently, Large Language Models (LLMs) have emerged as a noteworthy innovation in natural language processing (NLP). However, the question of whether LLMs can effectively address the task of logical reasoning, which requires gradual cognitive inference similar to human intelligence, remains unanswered. To this end, we aim to bridge this gap and provide comprehensive evaluations in this paper. Firstly, to offer systematic evaluations, we select fifteen typical logical reasoning datasets and organize them into deductive, inductive, abductive and mixed-form reasoning settings. Considering the comprehensiveness of evaluations, we include 3 early-era representative LLMs and 4 trending LLMs. Secondly, different from previous evaluations relying only on simple metrics (e.g., accuracy), we propose fine-level evaluations in objective and subjective manners, covering both answers and explanations, including answer correctness, explain correctness, explain completeness and explain redundancy. Additionally, to uncover the logical flaws of LLMs, problematic cases will be attributed to five error types from two dimensions, i.e., evidence selection process and reasoning process. Thirdly, to avoid the influences of knowledge bias and concentrate purely on benchmarking the logical reasoning capability of LLMs, we propose a new dataset with neutral content. Based on the in-depth evaluations, this paper finally forms a general evaluation scheme of logical reasoning capability from six dimensions (i.e., Correct, Rigorous, Self-aware, Active, Oriented and No hallucination). It reflects the pros and cons of LLMs and gives guiding directions for future works. © 2023, CC BY.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Mitigating label-Noise for Facial Expression Recognition in the Wild

Mitigating Label-Noise for Facial Expression Recognition in ...

引用

2022 IEEE International Conference on Multimedia and Expo, ICME 2022

作者： Yan, Huan Gu, Yu Zhang, Xiang Wang, Yantong Ji, Yusheng Ren, Fuji School of Computer and Information Hefei University of Technology S2AC Lab China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data China Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation China National Institute of Informatics Tokushima University Japan

ISBN: (数字)9781665485630

ISBN: (纸本)9781665485630

label-noise constitutes a major challenge for facial expression recognition in the wild due to the ambiguity of facial expressions worsened by low-quality images. To deal with this problem, we propose a simple but effective label-noise Robust Network (LRN) which explores the inter-class correlations for mitigating ambiguity that usually happens between morphologically similar classes. Specifically, LRN leverages a multivariate normal distribution to model such correlations at the final hidden layer of the neural network to suppress the heteroscedastic uncertainty caused by inter-class label noise. Furthermore, LRN utilizes a confidence-based label-free loss to extract compact intra-class feature representations under label noise while preserving the intrinsic inter-class relationships. Experiments on three in-the-wild facial expression datasets demonstrates the superiority of our method. © 2022 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Attention-Constrained Inference For Robust Decoder-Only Text-to-Speech

Attention-Constrained Inference For Robust Decoder-Only Text...

引用

IEEE Spoken Language Technology Workshop

作者： Hankun Wang Chenpeng Du Yiwei Guo Shuai Wang Xie Chen Kai Yu Department of Computer Science and Engineering MoE Key Lab of Artificial Intelligence AI Institute X-LANCE Lab Shanghai Jiao Tong University Shanghai China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China

ISBN: (数字)9798350392258

ISBN: (纸本)9798350392265

Recent popular decoder-only text-to-speech models are known for their ability of generating natural-sounding speech. However, such models sometimes suffer from word skipping and repeating due to the lack of explicit monotonic alignment constraints. In this paper, we notice from the attention maps that some particular attention heads of the decoder-only model indicate the alignments between speech and text. We call the attention maps of those heads Alignment-Emerged Attention Maps (AEAMs). Based on this discovery, we propose a novel inference method without altering the training process, named Attention-Constrained Inference (ACI), to facilitate monotonic synthesis. It first identifies AEAMs using the Attention Sweeping algorithm and then applies constraining masks on AEAMs. Our experimental results on decoderonly TTS model VALL-E show that the WER of synthesized speech is reduced by up to 20.5% relatively with ACI while the naturalness and speaker similarity are comparable.

关键词： Training Conferences Robustness Inference algorithms Text to speech Optimization

来源：评论

学校读者我要写书评

暂无评论

SAMPLING LOVÁSZ LOCAL LEMMA FOR GENERAL CONSTRAINT SATISFACTION SOLUTIONS IN NEAR-LINEAR TIME

arXiv

引用

arXiv 2022年

作者： He, Kun Wang, Chunyang Yin, Yitong The Key Lab of Data Engineering and Knowledge Engineering MOE Renmin University of China No. 59 Zhongguancun Street Haidian District Beijing China State Key Laboratory for Novel Software Technology Nanjing University 163 Xianlin Avenue Jiangsu Province Nanjing China

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has n variables with domain size at most q, each constraint contains at most k variables, shares variables with at most Δ constraints, and is violated with probability at most p by a uniform random assignment. The algorithm returns an almost uniform satisfying assignment in expected poly(q,k, Δ) ·(n) time, as long as a local lemma condition is satisfied: k · p · q2 · Δ5 ≤ C0 for a suitably small absolute constant C0. Previously, under similar local lemma conditions, sampling algorithms with running time polynomial in both nand Δ were only known for the almost atomic case, where each constraint is violated by a small number of forbidden local configurations. The key term Δ5 in our local lemma condition also improves the previously best known Δ7 for general CSPs [JPV21b] and Δ5.714 for atomic CSPs, including the special case of k-CNF [JPV21a, HSW21]. Our sampling approach departs from previous fast algorithms for sampling LLL, which were based on Markov chains. A crucial step of our algorithm is a recursive marginal sampler that is of independent interests. Within a local lemma regime, this marginal sampler can draw a random value for a variable according to its marginal distribution, at a cost independent of the size of the CSP. Copyright © 2022, The Authors. All rights reserved.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

ATTENTION-CONSTRAINED INFERENCE FOR ROBUST DECODER-ONLY TEXT-TO-SPEECH

arXiv

引用

arXiv 2024年

作者： Wang, Hankun Du, Chenpeng Guo, Yiwei Wang, Shuai Chen, Xie Yu, Kai MoE Key Lab of Artificial Intelligence AI Institute X-LANCE Lab Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China

Recent popular decoder-only text-to-speech models are known for their ability of generating natural-sounding speech. However, such models sometimes suffer from word skipping and repeating due to the lack of explicit monotonic alignment constraints. In this paper, we notice from the attention maps that some particular attention heads of the decoder-only model indicate the alignments between speech and text. We call the attention maps of those heads Alignment-Emerged Attention Maps (AEAMs). Based on this discovery, we propose a novel inference method without altering the training process, named Attention-Constrained Inference (ACI), to facilitate monotonic synthesis. It first identifies AEAMs using the Attention Sweeping algorithm and then applies constraining masks on AEAMs. Our experimental results on decoder-only TTS model VALL-E show that the WER of synthesized speech is reduced by up to 20.5% relatively with ACI while the naturalness and speaker similarity are comparable. Copyright © 2024, The Authors. All rights reserved.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Prototype and Instance Contrastive Learning for Unsupervised Domain Adaptation in Speaker Verification

Prototype and Instance Contrastive Learning for Unsupervised...

引用

International Symposium on Chinese Spoken Language Processing

作者： Wen Huang Bing Han Zhengyang Chen Shuai Wang Yanmin Qian Department of Computer Science and Engineering Auditory Cognition and Computational Acoustics Lab MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen

ISBN: (数字)9798331516826

ISBN: (纸本)9798331516833

Speaker verification system trained on one domain usually suffers performance degradation when applied to another domain. To address this challenge, researchers commonly use feature distribution matching-based methods in unsupervised domain adaptation scenarios where some unlabeled target domain data is available. However, these methods often have limited performance improvement and lack generalization in various mismatch situations. In this paper, we propose Prototype and Instance Contrastive Learning (PICL), a novel method for unsupervised domain adaptation in speaker verification through dual-level contrastive learning. For prototype contrastive learning, we generate pseudo labels via clustering to create dynamically updated prototype representations, aligning instances with their corresponding class or cluster prototypes. For instance contrastive learning, we minimize the distance between different views or augmentations of the same instance, ensuring robust and invariant representations resilient to variations like noise. This dual-level approach provides both high-level and low-level supervision, leading to improved generalization and robustness of the speaker verification model. Unlike previous studies that only evaluated mismatches in one situation, we have conducted relevant explorations on various datasets and achieved state-of-the-art performance currently, which also proves the generalization of our method.

关键词： Degradation Adaptation models Noise Prototypes Contrastive learning Robustness

来源：评论

学校读者我要写书评

暂无评论

Attention-based Encoder-Decoder Network for End-to-End Neural Speaker Diarization with Target Speaker Attractor

arXiv

引用

arXiv 2023年

作者： Chen, Zhengyang Han, Bing Wang, Shuai Qian, Yanmin MoE Key Lab of Artificial Intelligence AI Institute X-LANCE Lab Department of Computer Science and Engineering Shanghai Jiao Tong University China Shenzhen Research Institute of Big Data Shenzhen China

This paper proposes a novel Attention-based Encoder-Decoder network for End-to-End Neural speaker Diarization (AED-EEND). In AED-EEND system, we incorporate the target speaker enrollment information used in target speaker voice activity detection (TS-VAD) to calculate the attractor, which can mitigate the speaker permutation problem and facilitate easier model convergence. In the training process, we propose a teacher-forcing strategy to obtain the enrollment information using the ground-truth label. Furthermore, we propose three heuristic decoding methods to identify the enrollment area for each speaker during the evaluation process. Additionally, we enhance the attractor calculation network LSTM used in the end-to-end encoder-decoder based attractor calculation (EEND-EDA) system by incorporating an attention-based model. By utilizing such an attention-based attractor decoder, our proposed AED-EEND system outperforms both the EEND-EDA and TS-VAD systems with only 0.5s of enrollment data. © 2023, CC BY-NC-SA.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：