Papers by Jie Peng
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have catalyzed the development of autonomous agents capable of executing complex, multi-turn tasks. |
| Approach: | They propose a framework for agentic reinforcement learning that integrates turn-level tree search with tree search to address key challenges. |
| Outcome: | The proposed framework addresses key challenges: limited exploration diversity, sparse credit assignment, and misaligned policy optimization. |
Copied to clipboard
| Challenge: | Experimental results show that pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
| Approach: | They conduct experiments on an English essay dataset using Chinese-GPT2 . they find that the model can generate better continuations by learning to generate the in the fine-tuning stage. |
| Outcome: | The pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
Copied to clipboard
| Challenge: | Existing discrepancies between token-level objective and overall sequence-level quality of a model are causing exposure bias and other issues in NMT. |
| Approach: | They propose a contrastive preference model that integrates an indicator function to fine-tune a pre-trained model in Neural Machine Translation. |
| Outcome: | The proposed model outperforms the traditional Plackett-Luce model on three language pairs and also outperFORMs token-level and sequence-level baseline models. |
Copied to clipboard
| Challenge: | Open-source web agents rely on long tool-call trajectories with cyclic reasoning loops and exploration of unproductive branches. |
| Approach: | They propose a framework that compresses web agent trajectories via graph-based pruning. |
| Outcome: | The proposed framework reduces tool-call rounds by 20% while improving accuracy and efficiency while maintaining the same level of performance as existing models. |
Copied to clipboard
| Challenge: | Existing large-scale pre-trained language models are mainly trained from scratch individually, ignoring that many well-taught PLMs are available. |
| Approach: | They propose a pre-training framework called knowledge inheritance and propose auxiliary supervision to efficiently learn larger PLMs. |
| Outcome: | The proposed framework can be used to train large-scale language models with huge parameters and a large dataset can be adapted to domain adaptation and knowledge transfer. |
Copied to clipboard
| Challenge: | Existing datasets exhibit data scarcity and limited coverage of general-domain events. |
| Approach: | They present a MAssive eVENt detection dataset which contains 4,480 Wikipedia documents and 168 event types. |
| Outcome: | The proposed dataset shows that existing methods cannot achieve promising results on the small datasets. |
Copied to clipboard
| Challenge: | Existing knowledge distillation methods rely on intermediate layer features and golden labels, which require aligned model architecture and labeled data respectively. |
| Approach: | They propose a general language model distillation method that performs two-stage word prediction distillation and vocabulary compression, which is simple and shows extremely strong performance. |
| Outcome: | The proposed method outperforms 25 state-of-the-art methods on the SuperGLUE benchmark, achieving an average score that surpasses the best method by 3%. |
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: | Existing methods for fine-grained text sentiment transfer only reverse the sentiment polarity of text, but they lack a robust and parallel learning algorithm. |
| Approach: | They propose a novel fine-grained text sentiment transfer task that revises a sequence to satisfy a given sentiment intensity while preserving the original semantic content. |
| Outcome: | The proposed model outperforms existing methods by a large margin in automatic evaluation and human evaluation. |
Copied to clipboard
| Challenge: | Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically . |
| Approach: | They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE . |
| Outcome: | The proposed methods can extract relational facts from text, but they are still lacking in the current field. |
Copied to clipboard
| Challenge: | Existing models merging methods often lead to suboptimal performance due to harmful models . et al., 2018; 59: 59-64. |
| Approach: | They propose an uncertainty-guided MLLM merging algorithm that integrates models into a single MLML. |
| Outcome: | The proposed algorithm improves on held-in and held-out vision-language benchmarks. |
Copied to clipboard
| Challenge: | Parallel Coordinated Reasoning (PaCoRe) overcomes a central limitation of contemporary language models: their inability to scale test-time compute (TTC) far beyond sequential reasoning under a fixed context window. |
| Approach: | They propose a training-and-inference framework to overcome a central limitation of language models: their inability to scale test-time compute (TTC) under a fixed context window. |
| Outcome: | The proposed model scales to multi-million-token effective TTC without exceeding context limits. |
Copied to clipboard
| Challenge: | Existing methods of content moderation are infeasible due to over-editing and compromise the advertiser’s original semantic intent. |
| Approach: | They propose a framework to harmonize compliance with original intent preservation that integrates a data-driven framework and a curriculum to enforce compliance while maximizing semantic consistency. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines on industrial datasets and on online A/B testing on industrial video. |
Copied to clipboard
| Challenge: | Existing reference-free metrics have obvious limitations for evaluating controlled text generation models. |
| Approach: | They propose an unsupervised reference-free metric which evaluates controlled text generation from different aspects by formulating each aspect into multiple text infilling tasks. |
| Outcome: | The proposed metric has higher correlations with human judgments while obtaining better generalization of evaluating generated texts from different models and with different qualities. |
Copied to clipboard
| Challenge: | In-depth research on the specific capabilities needed by the RAG generation model is lacking, leading to inconsistent document quality and retrieval system imperfections. |
| Approach: | They propose that RAG models should possess three progressively hierarchical abilities: (1) Filtering: the ability to select relevant information; (2) Combination: the capability to combine semantic information across paragraphs; (3) RAG-specific reasoning: the capacity to further process external knowledge using internal knowledge. |
| Outcome: | Experiments show that the proposed method significantly improves the model’s open-book examination capability on datasets such as RGB, PopQA, MuSiQue, HotpotQA, and PubmedQA. |
Copied to clipboard
| Challenge: | Existing methods for event argument extraction cannot adequately model the correlation between event arguments and their roles. |
| Approach: | They propose a Bayesian model to jointly extract event arguments using Gibbs sampling . they train two neural networks to model prior distribution and conditional distribution over event arguments . |
| Outcome: | The proposed model can achieve comparable results to existing methods on two widely-used datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks on longcontext large language models fail to reflect their deep understanding capabilities across diverse tasks. |
| Approach: | They propose a benchmark to assess the ability of long-context large language models to handle long-text problems. |
| Outcome: | The proposed model achieves 50.1% accuracy when directly answering the questions . human experts achieve only 53.7% accuracy under a 15-minute time constraint . |
Copied to clipboard
| Challenge: | Existing unsupervised paraphrase generation methods require large-scale, manually annotated paraphrase datasets, which are labor-intensive to build. |
| Approach: | They propose a self-supervised pseudo-data construction method that generates diverse pseudo-paraphrases in distinct surface structures for a given sentence. |
| Outcome: | The proposed method generates diverse pseudo-paraphrases in distinct surface structures for a given sentence. |
Copied to clipboard
| Challenge: | Existing graph embedding methods overlook streaming nature of incoming data in real-world applications. |
| Approach: | They propose a disentangle-based continual graph representation learning framework inspired by the human’s ability to learn procedural knowledge. |
| Outcome: | The proposed framework outperforms state-of-the-art continual graph representation learning framework and alleviate catastrophic forgetting problem. |
Copied to clipboard
| Challenge: | Existing approaches to improve the generalization of large language models are using Supervised Fine-Tuning (SFT) this approach does not show sufficient generalization ability because it only relies on the given CoT data. |
| Approach: | They propose to use Chain-of-Thought annotations to train Large Language Models using supervised fine-tuning to improve generalization. |
| Outcome: | The proposed approach outperforms SFT on GSM8K, MathQA, and SVAMP datasets and shows a superior generalization ability. |
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: | Existing knowledge graph question answering methods rely on LLM-induced type systems with inconsistent granularity or perform multi-hop reasoning without explicit target-type constraints. |
| Approach: | They propose a type-constrained knowledge graph question answering framework that reasons over a relation-centric ontology graph. |
| Outcome: | The proposed framework achieves state-of-the-art and produces ontology-grounded reasoning chains with substantial Hit@1 gains. |
Copied to clipboard
| Challenge: | Existing studies have explored the use of entity linking (EL) in downstream tasks. |
| Approach: | They propose a modularized entity linking toolkit for easy task adaptation. |
| Outcome: | The proposed toolkit achieves significantly better accuracy and less time and spaceconsumption than existing methods. |
Copied to clipboard
| Challenge: | Existing methods to defend against jailbreak attacks exploit vulnerabilities to elicit unintended or harmful outputs. |
| Approach: | They propose a method to defend against jailbreak attacks by patching specific layers within large language models through self-augmented datasets. |
| Outcome: | The proposed approach reduces harmfulness and attack success rate of jailbreak attacks without compromising utility for benign queries compared to previous methods. |
Copied to clipboard
| Challenge: | Few-shot domain adaptation and NOTA detection are two real-world challenges for few-shot relation classification models. |
| Approach: | They propose a task to investigate two aspects of few-shot relation classification models . they build upon the FewRel dataset by adding a new test set in a different domain . |
| Outcome: | The proposed task can evaluate few-shot domain adaptation and few- shot none-of-the-above detection on a new domain and NOTA relation choice. |
Copied to clipboard
| Challenge: | Foundation models for single-cell RNA sequencing ignore biological prior knowledge encoded in gene regulatory relationships and fail to leverage multi-omics signals. |
| Approach: | They propose a framework that integrates multi-scale gene regulatory networks into RNA foundation model training. |
| Outcome: | The proposed framework improves on state-of-the-art models on three downstream tasks . it integrates multi-scale gene regulatory networks (GRNs) from multi-omics data into training . |
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: | Recent work has shown that feed-forward networks (FFNs) in pre-trained Transformers are a key component, storing various linguistic and factual knowledge. |
| Approach: | They propose to convert a model into its MoE version with the same parameters and build expert routers to decide which experts will be used for each input. |
| Outcome: | The proposed model can use 10% to 30% of FFN parameters while maintaining over 95% original performance. |
Copied to clipboard
| Challenge: | Existing knowledge selection tasks require the preidentified knowledge to generate informative dialogues. |
| Approach: | They propose a novel method to supervise knowledge selection when the gold knowledge label is unknown by obtaining an oracle knowledge label via distant supervision and leverage knowledge distillation to alleviate the noisy labeling problem of distant supervision. |
| Outcome: | The proposed method outperforms strong supervised baselines on two knowledge-grounded dialogue datasets and generates more informative responses. |
Copied to clipboard
| Challenge: | Recent work has identified properties of pretrained self-attention models that mirror those of dependency parse structures. |
| Approach: | They propose a model that encourages attention heads to model different dependency relations from raw corpora and a masked language modeling task. |
| Outcome: | The proposed model can induce dependency structures from raw corpora and the masked language modeling task without gold POS tags and any external information. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) have potential for cross-modal understanding . but extending MLLM to handle diverse modalities introduces two challenges . |
| Approach: | They propose a dual-stage compression mechanism to reduce the number of modality tokens per modality and condense it into a single, compact token sequence. |
| Outcome: | Experiments show that Flex-M3 outperforms its counterpart trained on only full-modality data. |
Copied to clipboard
| Challenge: | Existing tuning methods for medical AI models are monologue-based . existing benchmarks are based on licensing exams or research articles . |
| Approach: | They propose a benchmark to expose limitations of monologue-based tuning for medical AI models . they use a large dialogue dataset to capture stepwise diagnostic reasoning . |
| Outcome: | The proposed model outperforms monologue-tuned models on a medical question answering task and improves accuracy on standard medical QA benchmarks. |
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 knowledge injection methods are not suitable for enhancing pre-trained language models with external knowledge bases. |
| Approach: | They propose a plug-and-play knowledge injection method where knowledge bases are injected into frozen existing downstream models by a knowledge plugin. |
| Outcome: | The proposed method improves the performance of knowledge injection on knowledge-driven tasks while keeping model parameters frozen. |
Copied to clipboard
| Challenge: | Recent studies have shown that biased samples can be brittle for VQA models . however, the improvements on OOD data severely sacrifice the performance on the in-distribution (ID) data. |
| Approach: | They propose a contrastive learning approach that exploits biased samples for unbiased information that contributes to reasoning. |
| Outcome: | The proposed method achieves competitive performance on the OOD dataset while maintaining robustness on the ID dataset. |
Copied to clipboard
| Challenge: | Backdoor attacks are a serious threat to the safety of reusing deep neural networks (DNNs). |
| Approach: | They propose an efficient online defense mechanism based on robustness-aware perturbations to distinguish poisoned and clean samples to defend against backdoor attacks on natural language processing models. |
| Outcome: | The proposed method achieves better defending performance and lower computational costs than existing defense methods. |
Copied to clipboard
| Challenge: | Existing numerical MRC models are weak in numerical reasoning, such as addition, subtraction, sorting and counting. |
| Approach: | They propose a numerical MRC model that integrates numerical reasoning into existing MRC models and achieves an EM-score of 64.56% on the DROP dataset. |
| Outcome: | The proposed model outperforms all existing machine reading comprehension models by considering the numerical relations among numbers on the DROP dataset. |
Copied to clipboard
| Challenge: | Existing methods for QA in industrial environments are inherently relational and often updated. |
| Approach: | They propose a framework that optimizes retrieval and generation through two components: Graph-aware Retrieval and evidence-constrained reinforcement learning. |
| Outcome: | Experiments on an internal advertising QA dataset show consistent gains across expert-judged dimensions including accuracy, completeness, safety, and URL validity. |
Copied to clipboard
| Challenge: | Existing methods for table-to-text generation use encoder-decoder framework, but lack of large parallel data is a problem for many domains. |
| Approach: | They propose a model to separate table-to-text generation into two stages: key fact prediction and surface realization. |
| Outcome: | The proposed model achieves 27.34 BLEU score with only 1,000 parallel data, while the baseline model only achieves 9.71 BLUE score. |
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: | Distantly supervised relation extraction (RE) has attracted much attention in the past few years . previous methods to evaluate models manually or directly on autolabeled data have produced inaccurate evaluations . |
| Approach: | They propose to use distant supervision to generate large-scale autolabeled data . they build manually-annotated test sets for two DS-RE datasets and evaluate models . |
| Outcome: | The proposed method produces 53% wrong labels at the entity pair level in the popular NYT10 dataset. |
Copied to clipboard
| Challenge: | Existing non-autoregressive neural machine translation models suffer from multi-modality problem . despite their autoregressivity, most NMT models suffer with slow decoding speed . |
| Approach: | They propose a semi-autoregressive model which generates a translation as a sequence of segments while each segment is predicted token-by-token. |
| Outcome: | The proposed model can achieve 4 times speedup while maintaining comparable performance. |
Copied to clipboard
| Challenge: | Existing models fail to fully utilize contextual information which plays an important role in interpreting sentences. |
| Approach: | They propose a graph-based Context Tracking Network to model the discourse context for IDRR. |
| Outcome: | The proposed model can integrate sentence-level and token-level contextual semantics better than existing models. |
Copied to clipboard
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
Copied to clipboard
| Challenge: | Recent studies show pre-trained language models contain matching subnetworks that have similar transfer learning performance as the original PLM. |
| Approach: | They propose to prune matching subnetworks using magnitude-based pruning . they propose to optimize the subnetwork structure towards the pre-training objectives . |
| Outcome: | The proposed method is more efficient in searching subnetworks and advantageous when fine-tuning within a range of data scarcity. |
Copied to clipboard
| Challenge: | Existing backdoor attacks are not stealthy to system deployers or users. |
| Approach: | They propose a novel backdoor attack method based on negative data augmentation and modifying word embeddings that is much stealthier while maintaining pretty good attacking performance. |
| Outcome: | The proposed method is much stealthier while maintaining pretty good attacking performance. |
Copied to clipboard
| Challenge: | Existing approaches to generate agentic workflows using large language models are limited by high manual design costs, inefficient agentic search, and poor dynamic adaptability to new tasks and human preferences. |
| Approach: | They propose an evolutionary framework for generating agentic workflows through human-agent collaboration using evolutionary algorithms that mutate and cross over their structures, prompts, and LLM backbones. |
| Outcome: | The proposed framework surpasses other automated baselines by 27.34% while achieving comparable performance to o1-preview at only one-fourth of the cost. |
Copied to clipboard
| Challenge: | Existing hyperbolic neural networks encode features in the hyperbolical space yet formalize most of their operations in the tangent space. |
| Approach: | They propose a fully hyperbolic framework to build hyperbolical networks based on the Lorentz model by adapting Lorentzer transformations to formalize essential operations of neural networks. |
| Outcome: | The proposed framework has better performance on four NLP tasks compared with existing hyperbolic models . |
Copied to clipboard
| Challenge: | Compared to standard RC tasks, dialogue reading comprehension (DRC) has raised challenges because of the complex speaker information and noisy dialogue context. |
| Approach: | They propose a new method for dialogue reading comprehension that extracts answers from dialogues by using key-utterances-extracting methods and a Question-Interlocutor Scope Realized Graph. |
| Outcome: | The proposed method achieves state-of-the-art performance against previous works. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) have achieved remarkable progress in recent years, yet their ability to perform left–right reasoning in mirror contexts remains underexplored. |
| Approach: | They propose a benchmark to evaluate MLLMs' ability to distinguish left from right from a subject-centered perspective. |
| Outcome: | The proposed benchmarks show that even the best performing models achieve only 65.40% accuracy, far below the 99.28% accuracy of humans. |
Copied to clipboard
| Challenge: | Existing event extraction methods classify each argument role independently, ignoring conceptual correlations between different argument roles. |
| Approach: | They propose a Hierarchical Modular Event Argument Extraction model to provide inductive bias from the concept hierarchy of event argument roles. |
| Outcome: | The proposed model outperforms existing methods on real-world datasets and shows that it leverages useful knowledge from the concept hierarchy. |
Copied to clipboard
| Challenge: | Existing datasets for open-domain dialogue modeling limited to a single language . absence of multilingual datasets hinders development of robust open- domain dialog systems . |
| Approach: | They propose a multilingual parallel open-domain dialog dataset to explore multilingual and cross-lingual open- domain dialog. |
| Outcome: | The proposed model can be used to explore multilingual and cross-lingual open-domain dialogs in other languages. |
Copied to clipboard
| Challenge: | Existing studies focus on implicit exploration of multimodal coreference but neglect the importance of locating the objects explicitly in the visual content, which is associated with textual entities. |
| Approach: | They propose a multimodal incremental transformer with visual grounding which aims to explicitly locate related objects in the image guided by textual entities. |
| Outcome: | The proposed model achieves comparable performance on the VisDial v0.9 and v1.0 datasets. |
Copied to clipboard
| Challenge: | Recent studies have highlighted the lack of adversarial robustness in pre-trained models. |
| Approach: | They propose a fine-tuning approach that conducts selective updates when adapting pre-trained models to downstream tasks. |
| Outcome: | The proposed approach improves adversarial robustness on downstream tasks . it eliminates spurious updates, leading to flatter and wider optima than the conventional method . |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) enhances large language models by incorporating external knowledge, yet traditional singleround retrieval struggles with complex multistep reasoning. |
| Approach: | They propose a framework that introduces path-centric reward shaping for agentic RAG training. |
| Outcome: | The proposed framework improves on existing methods with an average accuracy gain of 7.7 points. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have paved the way for complex tasks such as role-playing. |
| Approach: | They propose a framework to benchmark, elicit, and enhance role-playing abilities in Large Language Models. |
| Outcome: | The proposed framework improves role-playing abilities with 168,093 samples. |
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 pre-training objectives do not explicitly model relational facts in text . Experimental results show that ERICA can improve typical PLMs on several language understanding tasks, including relation extraction, entity typing and question answering. |
| Approach: | They propose a contrastive learning framework ERICA to obtain a deep understanding of entities and relations in text. |
| Outcome: | The proposed framework can improve PLMs on several language understanding tasks, especially under low-resource settings. |
Copied to clipboard
| Challenge: | Existing relation extraction methods focus on extracting relational facts between entity pairs within single sentences or documents. |
| Approach: | They present a problem of cross-document relation extraction (CRE) using human annotations. |
| Outcome: | The proposed dataset is the first human-annotated cross-document RE dataset . it shows that it is challenging to existing RE methods including strong BERT-based models. |
Copied to clipboard
| Challenge: | Using pretrained language models, we propose an error-annotated dataset for text generation . we use carefully selected prompt words to guide GPT-2 to generate candidate sentences . |
| Approach: | They propose an error-annotated dataset with multiple benchmark tasks for text generation from pretrained language models. |
| Outcome: | The proposed dataset covers 24 types of errors according to common sense and linguistics. |
Copied to clipboard
| Challenge: | Existing table benchmarks lack the capacity to adequately assess the practical application of table reasoning in industrial applications. |
| Approach: | They propose a bilingual table-to-report task and a table-based benchmark to assess the quality of table reasoning. |
| Outcome: | The proposed task is based on a bilingual benchmark with 457 industrial tables and evaluation criteria to measure the quality of report generation. |
Copied to clipboard
| Challenge: | Existing knowledge distillation frameworks for language models are limited by memory and the use of complex distillation methods on larger-scale PLMs. |
| Approach: | They propose a general knowledge distillation framework that supports distillation on larger-scale PLMs using various distillation methods. |
| Outcome: | The proposed framework can support distillation on larger-scale PLMs and 25 mainstream methods on 8 NVIDIA A100 (40GB) GPUs. |
Copied to clipboard
| Challenge: | Character-based dialogue systems (CharacterDial) allow users to customize social characters for social interactions. |
| Approach: | They will collect a large-scale Chinese corpus of characters with diverse categories and behaviors and develop CharacterGLM models to address these challenges. |
| Outcome: | Experiments show that CharacterGLM outperforms most popular open- and closed-source LLMs and performs comparable to GPT-4. |
Copied to clipboard
| Challenge: | a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented. |
| Approach: | They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs). |
| Outcome: | The proposed library is based on extensive experiments in a variety of evaluation settings. |
Copied to clipboard
| Challenge: | Using Mixture-of-Experts, researchers have found that efficient MoE is difficult to achieve due to two key reasons: imbalanced expert activation and massive communication overhead. |
| Approach: | They propose a collaboration-constrained routing strategy that encourages more specialized expert groups and leverages expert specialization. |
| Outcome: | The proposed approach achieves an average performance improvement of 0.51% and 0.33% on LLaMA-MoE and Qwen-MaE respectively. |
Copied to clipboard
| Challenge: | Existing methods to learn incessantly emerging novel relations are overfitting the few memorized examples of old relations, causing confusion among existing relations. |
| Approach: | They introduce episodic memory activation and reconsolidation (EMAR) to continual relation learning. |
| Outcome: | The proposed method outperforms state-of-the-art models in catastrophic forgetting old relations. |
Copied to clipboard
| Challenge: | Existing Text-to-SQL research focuses on specific database systems, limiting adaptability to different dialects. |
| Approach: | They propose a framework that employs Object Relational Mapping (ORM) code as an intermediate language to bridge this gap. |
| Outcome: | The proposed framework outperforms existing methods that generate SQL queries directly. |
Copied to clipboard
| Challenge: | Experimental results show that our model outperforms the strong baseline in both generative and discriminative settings by a significant margin. |
| Approach: | They propose a relation-aware graph-over-graph network (GoG) for visual dialog . their model outperforms the strong baseline in both generative and discriminative settings . |
| Outcome: | The proposed model outperforms baseline models in both generative and discriminative settings by a significant margin. |
Copied to clipboard
| Challenge: | Existing knowledge-grounded dialogue models lack prior and posterior knowledge selection . prior selection module may not learn to select knowledge properly because of lack of posterior information . |
| Approach: | They propose a knowledge distillation-based training strategy to remove the exposure bias of knowledge selection. |
| Outcome: | The proposed model improves on two knowledge-grounded dialogue datasets. |
Copied to clipboard
| Challenge: | Existing pre-trained language models are typically trained with static data, ignoring that streaming data of various sources may continuously grow. |
| Approach: | They propose to use function preserved model expansion to expand existing PLM's width and depth to improve efficiency of knowledge acquisition. |
| Outcome: | The proposed model improves pre-training efficiency and performance over existing models on BERT and GPT. |
Copied to clipboard
| Challenge: | Existing methods to fix non-compliant images suffer from over-editing, destroying original intent and perceptual similarity. |
| Approach: | They propose a framework for the minimalist rectification of non-compliant image ads. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines in both compliance and preservation of visual and commercial consistency. |
Copied to clipboard
| Challenge: | Existing datasets may leak shallow heuristics via entity mentions, thus contributing to the high performance on RE benchmarks. |
| Approach: | They propose an entity-masked contrastive framework for relation extraction to gain a deeper understanding on textual context and type information while avoiding rote memorization of entities. |
| Outcome: | The proposed framework improves the effectiveness and robustness of neural models in different RE scenarios. |
Copied to clipboard
| Challenge: | Visual Question Answering (VQA) models are prone to learn the shortcut solution formed by dataset biases rather than the intended solution. |
| Approach: | They propose a dataset that considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets. |
| Outcome: | The proposed dataset considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets. |
Copied to clipboard
| Challenge: | Existing regulatory policies create label inconsistencies and reasoning ambiguities in historical datasets. |
| Approach: | They propose a policy-adaptive governance system that enables evolving reinforcement through multi-agent adversarial umpiring. |
| Outcome: | The proposed system outperforms fine-tuning baselines on industrial and public datasets . it enables evolving reinforcement through multi-agent adversarial umpiring . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) struggle to automate real-world vulnerability detection due to the heterogeneity of vulnerability patterns and manual prompt engineering for massive weakness categories is unscalable. |
| Approach: | They propose a retrieval-augmented multi-agent framework for precise and broad-coverage vulnerability detection using a coarse-to-fine strategy. |
| Outcome: | The proposed framework outperforms the baseline model on 130 CWE types and achieves 34.79% Macro-F1 performance. |
Copied to clipboard
| Challenge: | Recent studies have shifted paradigms and leveraged Large Language Models (LLMs) to tackle the challenging task of Text-to-SQL. |
| Approach: | They propose a framework that leverages large language models to generate SQL queries . they exploit prior knowledge from the LLM to enhance embedding-based retriever . |
| Outcome: | The proposed method improves embedding-based retriever and reduces cost. |
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: | Existing methods for routing-based expert models favor generalization over performance on held-in tasks. |
| Approach: | They propose a global and local instruction driven expert router that leverages recent LLMs' semantic reasoning capabilities to generate task-specific instructions from the input query. |
| Outcome: | The proposed method improves held-in performance while maintaining strong generalization on held-out tasks. |
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: | Existing relation extraction methods focus on extracting intra-sentence relations for single entities. |
| Approach: | They propose a relation extraction dataset from Wikipedia and Wikidata with three features . document-level relation extraction is a task to identify relational facts between entities . |
| Outcome: | The proposed dataset is the largest human-annotated dataset for document-level RE from plain text. |