Papers by Chin-Yew Lin
Disentangling Reasoning Capabilities from Language Models with Compositional Reasoning Transformers (2023.findings-acl)
Copied to clipboard
| Challenge: | ReasonFormer is a unified reasoning framework for complex decision-making . it is based on the dual-process theory of cognitive science, where two cognitive systems interact to form a whole reasoning process. |
| Approach: | They propose a unified reasoning framework that mirrors the modular reasoning process of humans . they decouple the representation module and the reasoning modules to capture different levels of cognition . |
| Outcome: | The proposed framework shows that humans can perform better in complex decision-making tasks. |
Enhancing Neural Data-To-Text Generation Models with External Background Knowledge (D19-1)
Copied to clipboard
| Challenge: | Recent neural models for data-to-text generation rely on parallel pairs of data and text to learn writing knowledge. |
| Approach: | They propose to enhance neural models with external knowledge to improve fidelity of generated text. |
| Outcome: | The proposed model improves on Wikipedia infobox-to-text datasets on 21 datasets. |
LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly lengthy and require longer prompts . this paper presents a coarse-to-fine prompt compression method to reduce cost and increase performance. |
| Approach: | They propose a coarse-to-fine prompt compression method that maintains semantic integrity under high compression ratios and a token-level iterative compression algorithm to better model the interdependence between compressed contents. |
| Outcome: | The proposed method yields state-of-the-art performance and allows for up to 20x compression with little performance loss over four datasets from different scenarios. |
Learning Semantic Correspondences from Noisy Data-text Pairs by Local-to-Global Alignments (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for data-to-text generation use a large-scale training corpus to learn semantic correspondences between structured input data and associated texts. |
| Approach: | They propose a local-to-global alignment framework that uses local and global models to learn semantic correspondences from large-scale datasets. |
| Outcome: | The proposed framework can be generalized to restaurant and computer domains and improve alignment accuracy. |
Revisiting Distant Supervision for Relation Extraction (L18-1)
Copied to clipboard
| Challenge: | Existing approaches for relation extraction (RE) use supervised learning on relation-specific training data, which is expensive to acquire. |
| Approach: | They propose to use a new testing dataset to re-examine distant supervision approaches . they aim to draw new conclusions based on the new testing data . |
| Outcome: | The proposed method can generate training data without noise and bias issues . the proposed method is annotated by the researchers on Amzaon Mechanical Turk . |
Multi-Level Knowledge Distillation for Out-of-Distribution Detection in Text (2023.acl-long)
Copied to clipboard
| Challenge: | Self-supervised representation learning has proved to be a valuable component for out-of-distribution (OoD) detection with only the texts of in-difference (ID) examples. |
| Approach: | They propose a method that integrates strengths and weaknesses of both methods . they use a fine-tuned model as the teacher to teach a randomly initialized student model . |
| Outcome: | The proposed method outperforms human evaluators in the pair-expert task on the Human ChatGPT Comparison Corpus. |
Learning Latent Semantic Annotations for Grounding Natural Language to Structured Data (D18-1)
Copied to clipboard
| Challenge: | Existing work on grounded language learning does not capture the semantics of correspondences between structured world state representations and texts. |
| Approach: | They propose to learn explicit latent semantic annotations from paired structured tables and texts . they use an adapted semi-hidden Markov model to impose a soft constraint to further improve performance . |
| Outcome: | The proposed framework improves on a semi-hidden Markov model and extracts templates for language generation. |
Mitigate Position Bias in LLMs via Scaling a Single Hidden States Channel (2025.findings-acl)
Copied to clipboard
Yijiong Yu, Huiqiang Jiang, Xufang Luo, Qianhui Wu, Chin-Yew Lin, Dongsheng Li, Yuqing Yang, Yongfeng Huang, Lili Qiu
| Challenge: | Long-context language models exhibit position bias, also known as "lost in the middle" research shows that even long-contemporary LLMs fail to utilize all context information effectively . |
| Approach: | They propose a method to mitigate position bias by scaling positional hidden states . they propose to use a channel of hidden states to modify positional Hidden states a LCLM's positional bias . |
| Outcome: | The proposed method can improve performance by 15.2% in a "lost in the middle" benchmark. |
Using Intermediate Representations to Solve Math Word Problems (P18-1)
Copied to clipboard
| Challenge: | Existing approaches to solving math word problems do not include higher-order operations that cannot be explicitly represented in equations. |
| Approach: | They propose an iterative labeling framework that generates intermediate forms and executes them to obtain the final answers. |
| Outcome: | The proposed model outperforms existing models in solving math word problems. |
ReTraCk: A Flexible and Efficient Framework for Knowledge Base Question Answering (2021.acl-demo)
Copied to clipboard
| Challenge: | Existing neural semantic parsing methods for knowledge base question answering are lacking . a generic and extensible framework is lacking for KBQA. |
| Approach: | They propose a neural semantic parsing framework for large scale knowledge base question answering . they propose 'retriever-transducer-checker' framework that provides a retriever and a transducer . |
| Outcome: | The proposed framework is ranked at top1 overall performance on the GrailQA leaderboard and achieves competitive performance on typical WebQuestionsSP benchmark. |
Operation-guided Neural Networks for High Fidelity Data-To-Text Generation (D18-1)
Copied to clipboard
| Challenge: | Recent neural models for data-to-text generation generate descriptions that are not consistent with structured data. |
| Approach: | They propose a framework for data-to-text generation that uses symbolic operations to generate texts from structured data. |
| Outcome: | The proposed framework improves the fidelity of the generated texts to the input structured data. |
TIARA: Multi-grained Retrieval for Robust Question Answering over Large Knowledge Base (2022.emnlp-main)
Copied to clipboard
| Challenge: | KBQA is a challenging area for pre-trained language models due to its extensive space and complexity. |
| Approach: | They propose a model that uses multi-grained retrieval to focus on most relevant KB contexts . constrained decoding is used to control output space and reduce generation errors . |
| Outcome: | The proposed model outperforms existing models on GrailQA and WebQuestionsSP. |
On the Effectiveness of Sentence Encoding for Intent Detection Meta-Learning (2022.naacl-main)
Copied to clipboard
| Challenge: | Recent studies on few-shot intent detection have attempted to formulate the task as a meta-learning problem. |
| Approach: | They propose to modify a few-shot intent detection task to produce a non-trivially strong performance without further domain-specific adaptation. |
| Outcome: | The proposed model improves on the prototypical network variants with task-specific fine-tuning. |
Neural Math Word Problem Solver with Reinforcement Learning (C18-1)
Copied to clipboard
| Challenge: | Existing models for solving math word problems rely on predefined rules or feature engineering. |
| Approach: | They propose to incorporate copy and alignment mechanism into the sequence-to-sequence model to address two shortcomings . they use model output as a feature and incorporate it into the feature-based model to explore the effectiveness . |
| Outcome: | The proposed model outperforms the state-of-the-art models on the problem solving task. |
CoLaDa: A Collaborative Label Denoising Framework for Cross-lingual Named Entity Recognition (2023.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to named entity recognition (NER) are limited by the cost of labeling and labeling, especially for low-resource languages. |
| Approach: | They propose a model-collaboration-based denoising scheme that enables models trained on different data sources to collaboratively denoise pseudo labels used by each other. |
| Outcome: | The proposed framework achieves superior results on benchmark datasets and can generalize to distant languages. |
Decomposed Meta-Learning for Few-Shot Named Entity Recognition (2022.findings-acl)
Copied to clipboard
| Challenge: | Named entity recognition systems aim at recognizing unseen entity types based on a few labeled examples. |
| Approach: | They propose a decomposed meta-learning approach to solve few-shot span detection and few- shot entity typing problems by introducing a model-agnostic meta-loop algorithm. |
| Outcome: | The proposed approach achieves superior performance over prior methods on benchmarks. |
Data2Text Studio: Automated Text Generation from Structured Data (D18-2)
Copied to clipboard
| Challenge: | Data2Text Studio is a platform for automated text generation from structured data. |
| Approach: | They conduct experiments on RotoWire datasets for template extraction and text generation . they find that the Semi-HMMs model improves interactivity and interpretability . |
| Outcome: | The proposed model improves on template extraction and text generation tasks on RotoWire datasets. |
Towards Improving Neural Named Entity Recognition with Gazetteers (P19-1)
Copied to clipboard
| Challenge: | Currently, neural models for named entity recognition are based on data-driven models, with a strong emphasis on getting rid of the efforts for collecting external resources or designing hand-crafted features. |
| Approach: | They propose to use external gazetteers to efficiently access annotated data to generalize beyond the annotation of entities. |
| Outcome: | The proposed model can access external gazetteers while avoiding the effort to design hand-crafted features. |
A Simple Recipe towards Reducing Hallucination in Neural Surface Realisation (P19-1)
Copied to clipboard
| Challenge: | Recent neural language generation systems often hallucinate contents when trained on loosely corresponding pairs of the input structure and text. |
| Approach: | They propose to integrate a language understanding module for data refinement with self-training iterations to induce strong equivalence between the input data and the paired text. |
| Outcome: | Experiments on the E2E challenge dataset show that the proposed framework reduces relative unaligned noise by 50% compared with the current state-of-the-art ensemble generator. |
LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression (2024.findings-acl)
Copied to clipboard
Zhuoshi Pan, Qianhui Wu, Huiqiang Jiang, Menglin Xia, Xufang Luo, Jue Zhang, Qingwei Lin, Victor Rühle, Yuqing Yang, Chin-Yew Lin, H. Vicky Zhao, Lili Qiu, Dongmei Zhang
| Challenge: | Existing approaches to compress prompts only leverage unidirectional context, causing suboptimal results. |
| Approach: | They propose a task-agnostic prompt compression method that takes tokens from context . they use a Transformer encoder to capture all essential information needed for prompt compression . |
| Outcome: | The proposed method is 3x-6x faster than existing prompt compression methods and faster than baselines. |
Issues with Entailment-based Zero-shot Text Classification (2021.acl-short)
Copied to clipboard
| Challenge: | Pre-trained BERT models with no fine-tuning can yield competitive performance against BERT fine- tuned for NLI. |
| Approach: | They propose to use any target label into a sentence of hypothesis and verify whether it could be entailed by the input. |
| Outcome: | The proposed models perform better than models fine-tuned for BERT, but the results are in general negative. |
LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression (2024.acl-long)
Copied to clipboard
| Challenge: | Longer prompts introduce irrelevant and redundant information, which can weaken LLMs' performance. |
| Approach: | They propose a prompt compression tool that improves LLMs' perception of key information in input prompts by up to 21.4% with around 4x fewer tokens in GPT-3.5-Turbo. |
| Outcome: | The proposed solution improves performance and reduces costs and latency by up to 21.4% with around 4x fewer tokens in the NaturalQuestions benchmark. |