Papers by Tianxiang Sun
LLatrieval: LLM-Verified Retrieval for Verifiable Generation (2024.naacl-long)
Copied to clipboard
| Challenge: | Large language models struggle with factual errors and often produce non-factual and fabricated content. |
| Approach: | They propose to use large language models to generate text with supporting documents to enable the user to flexibly verify the answer. |
| Outcome: | Experiments on ALCE show that LLatrieval significantly outperforms extensive baselines and achieves state-of-the-art results. |
BERTScore is Unfair: On Social Bias in Language Model-Based Metrics for Text Generation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Currently, pre-trained language model (PLM) based metrics are widely adopted in text generation tasks. |
| Approach: | They propose to use PLMs to encode stereotypical societal biases in PLM-based metrics . they show that popular metrics exhibit higher social bias than traditional metrics based on 6 attributes . |
| Outcome: | The proposed method shows that PLM-based metrics exhibit higher social bias than traditional metrics on 6 attributes. |
Flames: Benchmarking Value Alignment of LLMs in Chinese (2024.naacl-long)
Copied to clipboard
Kexin Huang, Xiangyang Liu, Qianyu Guo, Tianxiang Sun, Jiawei Sun, Yaru Wang, Zeyang Zhou, Yixu Wang, Yan Teng, Xipeng Qiu, Yingchun Wang, Dahua Lin
| Challenge: | Existing benchmarks for large language models (LLMs) do not accurately uncover safety vulnerabilities in LLMs. |
| Approach: | They propose a value alignment benchmark called Flames that encompasses both harmlessness principles and a unique morality dimension that integrates specific Chinese values such as harmony. |
| Outcome: | The proposed model performs poorly on Flames, particularly in safety and fairness dimensions. |
Does syntax matter? A strong baseline for Aspect-based Sentiment Analysis with RoBERTa (2021.naacl-main)
Copied to clipboard
| Challenge: | Aspect-based sentiment analysis (ABSA) is a fine-grained task in sentiment analysis. |
| Approach: | They compare a model with a dependency parser and a tree from a fine-tuned RoBERTa model to find the polarities for aspects in a sentence. |
| Outcome: | The proposed model outperforms the parser-provided tree on six datasets across four languages. |
Towards Efficient NLP: A Standard Evaluation and A Strong Baseline (2022.naacl-main)
Copied to clipboard
Xiangyang Liu, Tianxiang Sun, Junliang He, Jiawen Wu, Lingling Wu, Xinyu Zhang, Hao Jiang, Zhao Cao, Xuanjing Huang, Xipeng Qiu
| Challenge: | Rather than pursuing the reachless SOTA accuracy, researchers are focusing on model efficiency and usability. |
| Approach: | They propose an evaluation and a public leaderboard for efficient NLP models that depicts the Pareto Frontier for various language understanding tasks. |
| Outcome: | The proposed model outperforms or performs on par with SOTA compressed and early exiting models. |
AnyGPT: Unified Multimodal LLM with Discrete Sequence Modeling (2024.acl-long)
Copied to clipboard
Jun Zhan, Junqi Dai, Jiasheng Ye, Yunhua Zhou, Dong Zhang, Zhigeng Liu, Xin Zhang, Ruibin Yuan, Ge Zhang, Linyang Li, Hang Yan, Jie Fu, Tao Gui, Tianxiang Sun, Yu-Gang Jiang, Xipeng Qiu
| Challenge: | Existing language models that use discrete representations for unified processing of various modalities are limited to text generation and do not include multimodal output. |
| Approach: | They propose a multimodal language model that utilizes discrete representations for unified processing of various modalities. |
| Outcome: | The proposed model can be trained stably without any alterations to existing models or training paradigms. |
Turn Waste into Worth: Rectifying Top-k Router of MoE (2024.emnlp-main)
Copied to clipboard
Zhiyuan Zeng, Qipeng Guo, Zhaoye Fei, Zhangyue Yin, Yunhua Zhou, Linyang Li, Tianxiang Sun, Hang Yan, Dahua Lin, Xipeng Qiu
| Challenge: | Top-k router suffers from redundancy computation and memory costs due to unbalanced routing . some experts are overflow, where exceeding tokens are dropped, while others are empty, which are padded with zeros, negatively impacting model performance. |
| Approach: | They propose a top-k router that is unbalanced and uses a multi-gPU system to handle dropped tokens and padding. |
| Outcome: | The proposed model surpasses the top-1 router by 4.7% in terms of performance . the top-k router suffers from redundancy computation and memory costs . |
BBTv2: Towards a Gradient-Free Future with Large Language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent work on parameter-efficient tuning (PET) only tunes a small portion of parameters while keeping most of the parameters of the LLM unchanged. |
| Approach: | They propose an improved version of Black-Box Tuning to tune PTMs through gradient descent . they prepend continuous prompts to every layer of the PTM and propose a divide-and-conquer gradient-free algorithm to optimize the prompts alternately. |
| Outcome: | The proposed method achieves comparable performance to full model tuning and state-of-the-art parameter-efficient methods under few-shot settings while maintaining much fewer tunable parameters. |
Improving Contrastive Learning of Sentence Embeddings from AI Feedback (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to learn sentence embeddings with rich semantics are limited due to the discrete nature of natural language. |
| Approach: | They propose to use AI feedback to improve contrastive learning of sentence embeddings by combining human feedback and AI feedback. |
| Outcome: | The proposed method achieves state-of-the-art performance on several semantic textual similarity and transfer learning tasks compared to other unsupervised and supervised contrastive learning methods. |
A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation (2022.findings-acl)
Copied to clipboard
Tianxiang Sun, Xiangyang Liu, Wei Zhu, Zhichao Geng, Lingling Wu, Yilong He, Yuan Ni, Guotong Xie, Xuanjing Huang, Xipeng Qiu
| Challenge: | Existing methods to measure instance difficulty use generalization and threshold-tuning . a new approach to learn to exit is based on hash functions to assign tokens to a fixed exiting layer. |
| Approach: | They propose a Hash-based Early Exiting approach that replaces learn-to-exit modules with hash functions to assign each token to a fixed exiting layer. |
| Outcome: | The proposed approach improves on learning to exit and predicting instance difficulty. |
Accelerating BERT Inference for Sequence Labeling via Early-Exit (2021.acl-long)
Copied to clipboard
| Challenge: | Existing early-exit mechanisms are designed for sequence-level tasks, rather than sequence labeling. |
| Approach: | They propose to extend sentence-level early-exit to accelerate inference of PTMs . they propose a token-level mechanism that allows partial tokens to exit early at different layers . |
| Outcome: | The proposed approach can save up to 66%75% inference cost with minimal performance degradation. |
LLM can Achieve Self-Regulation via Hyperparameter Aware Generation (2024.findings-acl)
Copied to clipboard
Siyin Wang, Shimin Li, Tianxiang Sun, Jinlan Fu, Qinyuan Cheng, Jiasheng Ye, Junjie Ye, Xipeng Qiu, Xuanjing Huang
| Challenge: | Existing decoding strategies and hyperparameters may not be optimal for each sample. |
| Approach: | They propose a model that auto-regulates decoding strategies and hyperparameters . this approach eliminates the need for extensive manual tuning, they argue . |
| Outcome: | The proposed model eliminates the need for extensive manual tuning, offering a more autonomous, self-regulate model behavior. |
CoLAKE: Contextualized Language and Knowledge Embedding (2020.coling-main)
Copied to clipboard
| Challenge: | Existing models for integrating factual knowledge into pre-trained language models are shallow, static, and separately pre-train entities. |
| Approach: | They propose a method which integrates knowledge contexts from large-scale knowledge bases into a unified data structure. |
| Outcome: | The proposed model outperforms existing models on knowledge-driven tasks and knowledge probing tasks. |
DiffusionBERT: Improving Generative Masked Language Models with Diffusion Models (2023.acl-long)
Copied to clipboard
| Challenge: | Existing generative masked language models have a shared training objective, i.e., denoising. |
| Approach: | They propose a noise schedule for the forward diffusion process that controls the degree of noise added at each step based on the information of each token. |
| Outcome: | The proposed model improves on existing models in terms of perplexity and BLEU score. |
Multitask Pre-training of Modular Prompt for Chinese Few-Shot Learning (2023.acl-long)
Copied to clipboard
| Challenge: | Prompt tuning is a parameter-efficient approach to adapting pre-trained language models to downstream tasks. |
| Approach: | They propose to combine pre-trained modules with pre-trains to boost prompt tuning for few-shot learning. |
| Outcome: | The proposed model outperforms prompt tuning, full model tuning, and prior prompt pre-training methods in few-shot learning settings. |
Unified Active Retrieval for Retrieval Augmented Generation (2024.findings-emnlp)
Copied to clipboard
Qinyuan Cheng, Xiaonan Li, Shimin Li, Qin Zhu, Zhangyue Yin, Yunfan Shao, Linyang Li, Tianxiang Sun, Hang Yan, Xipeng Qiu
| Challenge: | Existing active retrieval methods struggle with handling various types of instructions. |
| Approach: | They propose a unified active retrieval framework for retrieval-augmented generation . they propose to combine four orthogonal criteria into plug-and-play classification tasks . |
| Outcome: | The proposed framework outperforms existing methods on four representative types of user instructions on four types of instructions. |
Late Prompt Tuning: A Late Prompt Could Be Better Than Many Prompts (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Prompt tuning is parameter-efficient but lags behind other state-of-the-art methods. |
| Approach: | They propose a parameter-efficient tuning method that only optimizes a soft prompt to adapt PTMs to downstream tasks. |
| Outcome: | The proposed method is parameter-efficient but lags behind other state-of-the-art methods. |
Aggregation of Reasoning: A Hierarchical Framework for Enhancing Answer Selection in Large Language Models (2024.lrec-main)
Copied to clipboard
Zhangyue Yin, Qiushi Sun, Qipeng Guo, Zhiyuan Zeng, Xiaonan Li, Tianxiang Sun, Cheng Chang, Qinyuan Cheng, Ding Wang, Xiaofeng Mou, Xipeng Qiu, Xuanjing Huang
| Challenge: | Recent advances in Chain-of-Thought prompting have facilitated significant breakthroughs for Large Language Models (LLMs) in complex reasoning tasks. |
| Approach: | They propose a hierarchical reasoning aggregation framework to address this problem . they propose dynamic sampling to adjust the number of reasoning chains . |
| Outcome: | The proposed framework outperforms existing ensemble methods on complex reasoning tasks. |
CodeIE: Large Code Generation Models are Better Few-Shot Information Extractors (2023.acl-long)
Copied to clipboard
| Challenge: | Large language models pre-trained on massive corpora have shown impressive few-shot learning ability on many NLP tasks. |
| Approach: | They propose to recast structured output in the form of code instead of natural language and use generative LLMs of code to perform IE tasks. |
| Outcome: | The proposed method outperforms fine-tuning moderate-size pre-trained models and prompting NL-LLMs under few-shot settings. |