Papers by Lei Lin
Copied to clipboard
| Challenge: | Large Language Models exhibit a significant performance gap in Information Extraction (IE) high-quality instruction data is the vital key for enhancing LLMs' specific capabilities . |
| Approach: | They propose a bilingual (English and Chinese) IE instruction corpus that contains 0.32B tokens. |
| Outcome: | The proposed model improves the performance of LLMs for IE with zero-shot generalization. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks that use large language models as referees are insufficient for accurately assessing their alignment with human intent. |
| Approach: | They propose a calibration framework to address positional bias in large language models as evaluators by manually annotating the “win/tie/lose” outcomes of responses from ChatGPT and Vicuna-13B in the Vicun A Benchmark’s question prompt. |
| Outcome: | The proposed framework alleviates evaluation bias, resulting in closer alignment with human judgments. |
Copied to clipboard
| Challenge: | Code large language models (codeLLMs) focus on synthesizing the correct code snippet, ignoring the alignment with human preferences. |
| Approach: | They propose a benchmark code-based on 40 categories and 44 programming languages to emulate real-world coding tasks. |
| Outcome: | The proposed benchmarks show that open-source code LLMs perform better than open-sourced ones. |
Copied to clipboard
| Challenge: | Multilingual neural machine translation models suffer from performance degradation when learning multiple languages. |
| Approach: | They propose to use LaSS to jointly train a single unified multilingual MT model. |
| Outcome: | The proposed model gains on 36 language pairs by up to 1.2 BLEU and zero-shot translation with 8.3 BLUE on 30 language pairs. |
Copied to clipboard
| Challenge: | Existing datasets for event understanding have limited coverage due to complexity of tasks. |
| Approach: | They propose a dataset that augments MAVEN datasets with event argument annotations . they propose 98,591 events and 290,613 arguments obtained with laborious human annotation . |
| Outcome: | The proposed dataset is the first all-in-one dataset supporting event detection, event argument extraction, and event relation extraction. |
Copied to clipboard
| Challenge: | Recent efforts such as RLPR have extended RLVR to general domains, enabling training on broader datasets and achieving improvements over RL PR. |
| Approach: | They propose a framework that encourages the generation of diverse answers within a controlled deviation range from the reference while preserving alignment with it. |
| Outcome: | Extensive experiments on 13 benchmarks show that DARL surpasses RLPR in both reasoning accuracy and output diversity. |
Copied to clipboard
| Challenge: | Prompt engineering is an essential technique for enhancing the abilities of large language models (LLMs) by providing explicit and specific instructions. |
| Approach: | They propose a new approach that uses text embeddings to obtain basis vectors by matrix decomposition and constructs a space for representing all prompts. |
| Outcome: | The proposed approach significantly outperforms state-of-the-art prompt paradigms on ten public reasoning benchmarks. |
Copied to clipboard
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Copied to clipboard
| Challenge: | Existing datasets that focus on natural language tasks are not considered as a general evaluation benchmark for multimodal tasks. |
| Approach: | They present a general evaluation benchmark for multimodal tasks, GEM 1 . they compare it with existing multimodal vision-language datasets . |
| Outcome: | The proposed model is compared with existing vision-language datasets focusing on natural language tasks . it is the largest vision-linguistic dataset covering image-language tasks and video-language task at the same time . |
Copied to clipboard
| Challenge: | Recent advances in large reasoning models have demonstrated remarkable capabilities in tackling complex tasks. |
| Approach: | They propose an algorithm to teach reasoning models to choose the optimal thinking mode based on problem difficulty. |
| Outcome: | The proposed algorithm reduces the average response length and improves accuracy on three math datasets. |
Copied to clipboard
| Challenge: | Using a node-based framework, knowledge base question answering systems can grasp structural mappings between questions and KB queries. |
| Approach: | They propose a node-based framework that better grasps the structural mapping between questions and KB queries by aligning the nodes in a query with their corresponding mentions in question. |
| Outcome: | The proposed framework outperforms the previous SoTA on CCKS CKBQA dataset. |
Copied to clipboard
| Challenge: | Language models have emerged as powerful tools for predicting human brain activity during language comprehension. |
| Approach: | They propose a technique that leverages electrocorticography’s millisecond precision to train speech language models. |
| Outcome: | The proposed technique improves brain alignment over pretrained and distillation models and produces higher gains in higher-order language regions. |
Copied to clipboard
| Challenge: | Recent approaches to fine-tuning of large language models suffer from task interference and catastrophic forgetting. |
| Approach: | They propose a fine-tuning framework that adapts isolation decisions based on online estimates of parameter importance. |
| Outcome: | The proposed framework reduces interference and forgetting while releasing outdated parameters to recover plasticity. |
Copied to clipboard
| Challenge: | Existing uncertainty sampling methods are time-consuming and can't be executed frequently. |
| Approach: | They propose adversarial uncertainty sampling in discrete space to find informative unlabeled text samples for annotation using adversarials. |
| Outcome: | The proposed approach outperforms baselines on effectiveness on five datasets. |
Copied to clipboard
| Challenge: | Large language models are increasingly employed to empower autonomous agents to simulate human behavior. |
| Approach: | They propose to evaluate LLM-driven agents through multi-turn interactions using a bottom-up approach to create diverse social scenarios constructed from extensive scripts. |
| Outcome: | The proposed model evaluates LLM-driven agents through multi-turn interactions emphasizing goal completion and implicit reasoning. |
Copied to clipboard
| Challenge: | Recent work on applying large language models (LMs) achieves impressive performance in many NLP applications. |
| Approach: | They propose to continuously post-train an LM with unlabeled domains to expand its knowledge without forgetting previous skills. |
| Outcome: | The proposed system improves few-shot end-task learning in these domains. |
Copied to clipboard
| Challenge: | Trending topics bring in a new channel for poisoning attacks, resulting in negative impacts on society. |
| Approach: | They propose an LLM-based multi-agent system to simulate trending topics in social media . they propose a time-aware interaction mechanism, centralized message dissemination, and an interactive system . |
| Outcome: | The proposed system simulates trending topics under poisoning attacks on social media platforms. |
Copied to clipboard
| Challenge: | Existing methods for reinforcement learning (RL) require a large sample size to be implemented. |
| Approach: | They propose a memory-efficient RL algorithm that maximizes a lower bound of the ELBO-based objective. |
| Outcome: | Experiments show that BGPO outperforms previous RL algorithms for diffusion large language models in math problem solving, code generation, and planning tasks. |
Copied to clipboard
| Challenge: | RAAMove is a comprehensive multi-domain corpus dedicated to the annotation of move structures in Research Article (RA) abstracts. |
| Approach: | They propose a multi-domain corpus dedicated to the annotation of move structures in RA abstracts. |
| Outcome: | The proposed corpus is based on a human-annotated dataset and a BERT-based model to verify its effectiveness. |
Copied to clipboard
| Challenge: | Vision-extended LLMs have made significant strides in VQA, but they still encounter significant difficulties in handling queries involving long-tail entities. |
| Approach: | They propose a benchmark to test models' ability to identify entities and provide detailed, entity-specific knowledge by combining 10 images and 10 knowledge-intensive QA pairs. |
| Outcome: | The proposed model outperforms existing methods on the SnapNTell dataset, achieving a 66.5% improvement in the BELURT score. |
Copied to clipboard
| Challenge: | Existing methods for event prediction are incomplete and noisy. |
| Approach: | They propose to use news-related event schemas to extract newsworthy events . they build a demo website and include a video demonstrating the framework . |
| Outcome: | The proposed framework can be applied to a wide variety of newsworthy scenarios. |
Copied to clipboard
| Challenge: | Existing datasets and benchmarks focus only on patents or cover limited aspects of the IP field, lacking alignment with real-world scenarios. |
| Approach: | They propose a bilingual IP task taxonomy and a large-scale bilingual benchmark to evaluate LLMs in real-world IP practice. |
| Outcome: | The proposed model achieves only 75.8% accuracy, indicating room for improvement . open-source IP and law-oriented models lag behind closed-source general-purpose models . |
Copied to clipboard
| Challenge: | Existing EE methods do not model event characteristics from large unsupervised data. |
| Approach: | They propose a contrastive pre-training framework for event extraction to better learn event knowledge from large unsupervised data and their semantic structures. |
| Outcome: | The proposed framework improves on ACE 2005 and MAVEN datasets on event extraction tasks. |
Copied to clipboard
| Challenge: | Reinforcement Learning from Human Feedback (RLHF) is effective for aligning Large Language Models with human preferences, but its complex process limits its ability to continually learn human feedback. |
| Approach: | They propose a non-RL offline method to convert historical optimal policies into optimization constraints when continually learning new preferences. |
| Outcome: | The proposed method outperforms strong CL baselines in terms of reward-based evaluations and human assessment. |
Copied to clipboard
| Challenge: | a recent study shows that large language models have limited generalization in low-resource languages like Chinese. |
| Approach: | They propose to evaluate the zero-shot generalizability of large language models to the Chinese language . they release only half of the dataset publicly, with the remainder kept private . |
| Outcome: | The Chinese Instruction-Following Benchmark evaluates the generalizability of LLMs to the Chinese language. |
Copied to clipboard
| Challenge: | Social graphs are mathematical structures stem from pairwise interactions between entities through nodes and edges. |
| Approach: | They propose a framework for dynamic, text-attributed social graph generation that simulates the temporal node and edge generation processes for zero-shot social graphs. |
| Outcome: | The proposed framework improves macroscopic graph structure metrics by 11% . the proposed model can generate graphs with up to 100,000 nodes or 10 million edges . |
Copied to clipboard
| Challenge: | Existing datasets only cover limited relation types at once, which prevents models from taking full advantage of relation interactions. |
| Approach: | They construct a large-scale human-annotated ERE dataset with improved annotation schemes to address these drawbacks. |
| Outcome: | The proposed dataset is larger than existing datasets of all the ERE tasks by at least an order of magnitude. |
Copied to clipboard
| Challenge: | Existing methods to generate empathetic responses are monotonous and generic, resulting in shallow empathy and few connections to the context. |
| Approach: | They propose to use explicit control to guide the empathy expression and a framework DiffusEmp to unify the utilization of dialogue context and attribute-oriented control signals. |
| Outcome: | The proposed framework outperforms baselines on EmpatheticDialogue in terms of controllability, informativeness, diversity, and diversity without the loss of context-relatedness. |
Copied to clipboard
| Challenge: | Existing pre-training methods are not effective for machine translation tasks. |
| Approach: | They propose a method to pre-train a universal multilingual neural machine translation model . they use random aligned substitution technique to bring words and phrases with similar meanings closer in the representation space. |
| Outcome: | The proposed approach improves translation quality on low, medium, rich resource languages. |
Copied to clipboard
| Challenge: | chain-of-thought (CoT) prompting has been shown to be effective on complex reasoning tasks, but the naive greedy decoding used in CoT prompting causes the repetitiveness and local optimality. |
| Approach: | They propose a generalizable ensemble-optimization method that uses a set of reasoning paths to prompt a language model one more time to determine the optimal answer. |
| Outcome: | The proposed method can be generalized to almost all scenarios where the type of input questions and answer format of reasoning paths may be unknown. |
Copied to clipboard
| Challenge: | Existing legal benchmarks focusing on knowledge and logic evaluate LLMs on various tasks in legal domain, but few have explored the practical application of LLM by actual users. |
| Approach: | They propose a Chinese user-centric legal benchmark that aims to assess the practical application of LLMs by real users. |
| Outcome: | The proposed model outperforms existing models on various tasks in legal domain but does not outperfect ChatGPT. |
Copied to clipboard
| Challenge: | Pre-Trained Models (PTMs) have reshaped the development of natural language processing (NLP) but it is not easy to obtain high-performing PTMs without a large amount of labeled training data and deploy them online with fast inference speed. |
| Approach: | They propose to make it easy to build NLP applications with knowledge-enhanced pre-training and knowledge distillation. |
| Outcome: | EasyNLP supports a comprehensive suite of NLP algorithms and features knowledge-enhanced pre-training, knowledge distillation and few-shot learning functionalities. |
Copied to clipboard
| Challenge: | Autoregressive models are ubiquitous in natural language processing due to the sequential nature of text generation. |
| Approach: | They propose a compression technique for autoregressive models driven by an imitation learning perspective on knowledge distillation. |
| Outcome: | The proposed method outperforms other distillation algorithms on translation and summarization tasks while increasing inference speed 14 times. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but require much more training time than fine-timing. |
| Approach: | They empirically investigate the transferability of soft prompts across different downstream tasks and PLMs to determine what decides prompt transferability. |
| Outcome: | The proposed method can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but requires much more training time than fine-timing. |
Copied to clipboard
| Challenge: | Existing models for document-level relation extraction relied on implicitly powerful representations, which makes the model less transparent. |
| Approach: | They propose a probabilistic model for document-level relation extraction by learning logic rules. |
| Outcome: | The proposed model outperforms baseline models in relation performance and logical consistency. |
Copied to clipboard
| Challenge: | Large Language Model (LLM) agents struggle with ultra-long-horizon tasks requiring hundreds or thousands of interaction steps. |
| Approach: | They propose a framework that reconceptualizes context management as a Next Step Prediction problem. |
| Outcome: | The proposed framework improves task success rates and robust cross-lingual performance. |
Copied to clipboard
| Challenge: | Text-based question answering (TBQA) has been studied extensively in recent years. |
| Approach: | They propose a Dynamically Fused Graph Network to answer questions requiring multiple scattered evidence and reasoning over them. |
| Outcome: | The proposed method achieves competitive results on a public TBQA dataset and produces interpretable reasoning chains. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown remarkable capabilities in code translation, yet their performance deteriorates in low-resource programming domains such as Fortran and emerging frameworks like CUDA . |
| Approach: | They propose a dual-LLM Questioner–Solver pipeline that integrates external knowledge from compilers and runtime feedback to generate verified translations and multi-turn dialogues. |
| Outcome: | The proposed model outperforms proprietary models on key metrics like compilation success and accuracy. |
Copied to clipboard
| Challenge: | Pre-trained language models capture factual knowledge from massive texts . but they are still quite behind the SOTA KGC models in terms of performance . |
| Approach: | They propose to use open-world assumption to evaluate PLM-based knowledge graph completion models . they propose to convert each triple and its support information into natural prompt sentences . |
| Outcome: | The proposed model is more accurate under the open-world assumption (OWA) this setting manual checks the correctness of knowledge that is not in KGs. |
Copied to clipboard
| Challenge: | Existing studies treat each transformer encoding layer as a single artificial neuron . layer-level embeddings aggregate multiple types of contextual attention captured by multiple head modules . |
| Approach: | They propose to embed each transformer encoding layer as a single artificial neuron . they propose to couple those ANs with their biological-neuron counterparts in the human brain . |
| Outcome: | The proposed models can be used to link representations to brain activity, the authors say . their results show that the proposed models carry meaningful neurolinguistic information . |
Copied to clipboard
| Challenge: | Existing studies show that stacking causal self-attention layers alone induces a positional bias in attention scores toward earlier tokens, but this differs from the bias toward later tokens observed in Transformer decoders, known as recency bias. |
| Approach: | They propose to stack causal self-attention layers and layer norm to induce recency bias in Transformer decoders by analyzing the interaction between causal self and other architectural components. |
| Outcome: | The proposed method provides new theoretical insights into how positional information interacts with architectural components and suggests improvements in positional encoding strategies. |
Copied to clipboard
| Challenge: | Existing LoRA methods assume that experts operate independently, leading to unstable routing, expert dominance. |
| Approach: | They propose a communication-aware MoELoRA framework that relaxes this assumption by introducing expert-level communication prior to routing. |
| Outcome: | The proposed framework outperforms vanilla LoRA and MoELoRA on diverse language understanding tasks while maintaining expert dominance. |
Copied to clipboard
| Challenge: | Existing statically compressed pre-trained language models lack spatial and temporal efficiency due to their large size and wide width. |
| Approach: | They propose a spatially and temporally efficient model which retains the major capacity of PLMs. |
| Outcome: | The proposed model retains the major capacity of pre-trained language models at high compression and acceleration rate with 1/8 parameters and 1/19 FLOPs of BERT. |
Copied to clipboard
| Challenge: | Existing methods to learn temporal evolutional representations of entities are hard to capture the complex temporal patterns such as sequential and repetitive. |
| Approach: | They propose a Sequential and Repetitive Pattern Learning method that captures both sequential and repetitive patterns. |
| Outcome: | The proposed method outperforms state-of-the-art methods on four representative benchmarks on GDELT dataset, where performance improvement of MRR reaches up to 18.84%. |
Copied to clipboard
| Challenge: | Recent work has shown that reinforcement learning with simple rule-based reward functions (RLVR) can induce emergent reasoning behaviors and yield gains in challenging domains such as math problem solving. |
| Approach: | They propose a rollout-alignment-quantization-aware RL which aligns training-side forward with the quantized rollout to minimize mismatch. |
| Outcome: | The proposed approach outperforms quantized-rollout training by +5.5 on Qwen3-30B-A3B MoE for math problems while maintaining low-bit throughput. |
Copied to clipboard
| Challenge: | Existing 4-bit training pipelines rely on max-scaling, which causes representation collapse . despite this, there are limitations in the accuracy of 4-bit LLM training . |
| Approach: | They propose a scaling strategy that uses half-scaling as a hardware-friendly default . they propose fp4 support that allows for a faster scaling of large language models . |
| Outcome: | The proposed scaling strategy narrows the gap between theoretical optimum and BF16 while maintaining the efficiency benefits of 4-bit training. |
Copied to clipboard
| Challenge: | Existing non-autoregressive neural machine translation methods are either inferior to Transformer or require multiple decoding passes, leading to reduced speedup. |
| Approach: | They propose a Glancing Language Model (GLM) for single-pass parallel generation models and Glancing Transformer (GLAT) with only single- pass decoding, GLAT is able to generate high-quality translation with 8-15 speedup. |
| Outcome: | The proposed model outperforms all previous non-autoregressive methods on multiple language directions and is nearly comparable to Transformer. |
Copied to clipboard
| Challenge: | Existing models for natural language processing (NLP) are fine-tuned and released for research and deployments. |
| Approach: | They propose a PLM reuse paradigm that merges teacher-PLM knowledge into a student model. |
| Outcome: | The proposed paradigm can reduce the computational cost and environmental side-effects of retraining the PLM from scratch. |
Copied to clipboard
| Challenge: | Existing prompt-learning-based methods concatenate in-context examples only at the input layer, limiting the model’s ability to capture abstract semantic cues necessary for identifying complex causal relationships. |
| Approach: | They propose a model that injects in-context examples into the deeper layer of a pre-trained language model (PLM) this model leverages hierarchical semantic representations formed in deeper layers, thereby enhancing its capacity to learn high-level causal abstractions. |
| Outcome: | The proposed model improves on two widely used datasets and shows that it can learn high-level causal abstractions. |
Copied to clipboard
| Challenge: | End-to-end speech-totext translation (ST) data are limited due to the limited resources. |
| Approach: | They propose a knowledge distillation framework for speech translation that integrates knowledge from machine translation and decouples knowledge from non-target class knowledge. |
| Outcome: | The proposed framework outperforms state-of-the-art models on a benchmark dataset. |
Copied to clipboard
| Challenge: | Existing methods for dependency parsing are transition-based, graph-based and sequence-to-sequence method. |
| Approach: | They propose to achieve dependency parsing (DP) via Sequence Generation (SG) by utilizing only the pre-trained language model without any auxiliary structures. |
| Outcome: | The proposed method performs well on DP benchmarks including PTB, UD2.2, SDP15 and SemEval16. |
Copied to clipboard
| Challenge: | Existing multi-LLM collaboration systems often encounter scalability challenges when integrating new LLMs and tasks. |
| Approach: | They propose a Scalable Multi-LLM Collaboration System to coordinate multiple open-source LLMs. |
| Outcome: | The proposed system outperforms prevailing closed-source LLMs on eight mainstream benchmarks on multiple tasks. |
Copied to clipboard
| Challenge: | Existing methods for translating collaborative information into textual prompts or injecting pre-trained embeddings into the LLM treat structural information as static input and fail to capture high-order relational dependencies. |
| Approach: | They propose a framework that generalizes low-rank adaptation from independent to structure-aware propagation by embedding a trainable graph message-passing network within the low-ranked adaptation pathway. |
| Outcome: | Experiments on multiple benchmarks show that GraphLoRA outperforms state-of-the-art recommendation methods and achieves superior generalization. |
Copied to clipboard
| Challenge: | ice cream flavors and climate change are among the topics people hold on various topics. |
| Approach: | They propose to use a large language model to extrapolate from stances to unknown opinions by prompting and fine-tuning data to improve their ability to extrapole from known to unknown stance. |
| Outcome: | The proposed model can extrapolate from opinions on known topics to unknown ones and generate reasoning behind extrapolation. |
Copied to clipboard
| Challenge: | Fill-in-the-Middle (FIM) models suffer from performance degradation and prohibitive latency. |
| Approach: | They propose a search-and-replace infilling framework that integrates agentic verification and editing into a single-pass inference process. |
| Outcome: | The proposed framework harmonizes completion tasks with the instruction-following priors of Chat LLMs, extending the paradigm from static infilling to dynamic context-aware editing. |
Copied to clipboard
| Challenge: | Existing DA-training methods do not explicitly identify what knowledge should be preserved and what should be changed by the domain corpus. |
| Approach: | They propose to use an unlabeled corpus of aparticular domain to train a pre-trained general-purpose language model to adapt the LM so that end-tasks in the domain can give improved performances. |
| Outcome: | The proposed method improves the performance of pre-trained general-purpose language models by contrasting the representations of the general and the full (both general and domain knowledge) to learn an integrated representation with both general and specific knowledge. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated impressive reasoning capabilities, yet there is ongoing debate about their capabilities and the potential data contamination problem. |
| Approach: | They propose to evaluate the reasoning capabilities of large language models in solving recent competition-level programming problems in Codeforces. |
| Outcome: | The proposed model has experienced a cliff-like decline in problems after September 2021, which shows the potential data contamination and the challenges for any existing LLM to solve unseen complex reasoning problems. |
Copied to clipboard
| Challenge: | Existing security evaluation benchmarks lack relevance to real-world AI programming tasks . current LLMs struggle with secure coding, research shows . |
| Approach: | They propose a repository-level evaluation benchmark to assess security of AI-generated code. |
| Outcome: | The proposed framework mirrors real-world AI programming tasks and offers valuable insights into the state of AI code generation. |
Copied to clipboard
| Challenge: | Text-Attributed Graphs (TAGs) inherit issues from Graph Neural Networks such as fairness. |
| Approach: | They propose to evolve LM-as-encoder to LM as-fair-encoding process to explore fairness in TAGRL. |
| Outcome: | The proposed process can be integrated with fairness-enhancing strategies on the GNNs decoder side. |
Copied to clipboard
| Challenge: | Current document image parsing solutions rely on specialized models or generate content autoregressively. |
| Approach: | They propose a multimodal document image parsing model that integrates specialized models with autogeneous content generation. |
| Outcome: | The proposed model achieves state-of-the-art performance across diverse page-level and element-level settings while ensuring superior efficiency. |
Copied to clipboard
| Challenge: | Existing methods conduct knowledge distillation statically, e.g., student model aligns output distribution to teacher model on pre-defined training dataset. |
| Approach: | They propose a dynamic knowledge distillation that empowers the student to adjust the learning procedure according to its competency . they find it is promising and provide discussions on potential future directions towards more efficient methods . |
| Outcome: | The proposed method can boost student model performance while accelerating training . the proposed method reduces memory usage and accelerates model inference . |
Copied to clipboard
| Challenge: | Recent advances in pre-trained language models have made it possible to generate human-like text. |
| Approach: | They propose to integrate an open-ended text adventure game in Chinese, named KuiLeiXi, where players interact with the AI until the plot goals are reached. |
| Outcome: | The proposed game lacks incentives and relies on players to explore on their own. |
Copied to clipboard
| Challenge: | Experimental results show that CascadeBERT can achieve an overall 15% improvement under 4x speed-up compared with existing dynamic early exiting methods on six classification tasks. |
| Approach: | They propose a framework which emits predictions in internal layers without passing through the entire model. |
| Outcome: | The proposed framework can achieve 15% improvement under 4x speed-up compared with existing methods on six classification tasks yielding more calibrated and accurate predictions. |
Copied to clipboard
| Challenge: | Recent studies show that sequence-to-sequence (seq2sequ) models struggle with compositional generalization (CG) a crucial property of human language learning is its compositional globalization (GC), the algebraic ability to understand and produce a potentially infinite number of novel combinations from known components. |
| Approach: | They propose a sequence-to-sequence (seq2sequ) extension which learns to compose representations of different encoder layers dynamically for different tasks. |
| Outcome: | The proposed model achieves competitive results on two comprehensive and realistic benchmarks, which empirically demonstrates the effectiveness of the proposed model. |