Papers by Jun Gao
Copied to clipboard
| Challenge: | Existing evaluation metrics for open-domain dialogue systems are limited by the diversity of possible outcomings. |
| Approach: | They propose a method to augment a reference set to improve reliability . they propose BLEU to measure similarity between a predicted response and a small set of references . |
| Outcome: | The proposed model improves the reliability of reference-based metrics with augmented reference sets. |
Copied to clipboard
| Challenge: | Existing methods for few-shot Named Entity Recognition ignore entity boundaries and are time-consuming . a seminal span-based prototypical network solves the problem using two stages: span extraction and mention classification. |
| Approach: | They propose a seminal span-based prototypical network that tackles few-shot NER . they transform sequential tags into a global boundary matrix and use prototypical learning . |
| Outcome: | The proposed model outperforms strong baselines over multiple benchmarks. |
Copied to clipboard
| Challenge: | Existing data augmentation methods for event extraction are costly and time-consuming. |
| Approach: | They propose a data augmentation framework that randomly masks out an adjunct sentence fragment and infills a variable-length text span with a fine-tuned infilling model. |
| Outcome: | The proposed framework can generate more diverse data while keeping the original structure unchanged . it can replace a fragment of arbitrary length in the text with another fragment of variable length . |
Copied to clipboard
| Challenge: | Recent named entity recognition models have great performance on many conventional benchmarks, but it is not reliable in realistic applications. |
| Approach: | They propose a method to create natural adversarial examples using Wikidata and pre-trained language models. |
| Outcome: | The proposed method produces natural adversarial examples with a shifted distribution from training data. |
Copied to clipboard
| Challenge: | Existing proof generation tasks require reasoning capabilities, but they usually just request for an answer without the reasoning procedure that would make it interpretable. |
| Approach: | They propose an iterative backward reasoning model to solve the proof generation tasks on rule-based Question Answering. |
| Outcome: | The proposed model improves in-domain performance and cross-domain transferability over existing models. |
Copied to clipboard
| Challenge: | Existing work regards dropped pronoun recovery and conversational discourse parsing as two separate tasks and tackles them separately. |
| Approach: | They propose a neural model for dropped pronoun recovery and conversational discourse parsing in Chinese conversational speech. |
| Outcome: | The proposed model outperforms the state-of-the-art models on a new dataset . the proposed model is based on linguistic and semantic information from Chinese conversational speech . |
Copied to clipboard
| Challenge: | Existing studies have explored multiple aspects that affect the performance of large language models (LLMs) such as input-output mapping, extensive data resources, and the ability to train on labeled examples. |
| Approach: | They propose a framework that injects knowledge into LLMs during continual self-supervised pre-training and judiciously selects examples with high knowledge relevance. |
| Outcome: | The proposed framework outperforms baseline models and improves by more than 13% and 7% on text classification and question-answering tasks. |
Copied to clipboard
| Challenge: | Existing EE datasets define fixed event types and design specific schemas for each of them, failing to cover diverse events emerging from the online text. |
| Approach: | They propose to use a sentence-level dataset to benchmark Open Event Extraction without restricting event types. |
| Outcome: | The proposed dataset contains more than 42,000 news titles in 34 topics collected from Chinese web pages. |
Copied to clipboard
| Challenge: | Existing approaches to query–document relevance assessment are limited . ambiguous user intent and asymmetric relevance are challenges for RAG platforms . |
| Approach: | They propose a decomposed reasoning model for relevance assessment that decomposes query intent into intent inference and evidence grounding. |
| Outcome: | The proposed model outperforms strong baselines on offline benchmarks and achieves significant gains in large-scale online A/B testing. |
Copied to clipboard
| Challenge: | Existing generative methods focus on a single task at a time. |
| Approach: | They propose a unified generative multi-task framework that can solve multiple ABSA tasks . they propose to control the type of task prompts consisting of multiple element prompts . |
| Outcome: | The proposed framework achieves state-of-the-art results in almost all ABSA tasks and competitive results in task transfer scenarios. |
Copied to clipboard
| Challenge: | Existing approaches to VideoQA focus on utilizing frame- or object-level visual representations, but they neglect visual-language interactions. |
| Approach: | They propose to break down video into trajectories and first leverage trajectory feature in VideoQA to enhance alignment between two modalities. |
| Outcome: | The proposed method outperforms all the state-of-the-art models on the NExT-QA benchmark. |
Copied to clipboard
| Challenge: | Existing quantization-aware fine-tuning methods decouple weight precision and adapter capacity, overlooking that a layer’s ability to adapt is constrained by the information preserved in its frozen weights. |
| Approach: | They propose a framework that jointly optimizes per-layer quantization bit-width and LoRA rank. |
| Outcome: | Experiments on LLaMA and Qwen models show that the proposed framework matches or approaches 16-bit baselines while using substantially less memory. |
Copied to clipboard
| Challenge: | Existing representation methods fail to fully capture olfactory pathway . current approaches focus on isolated segments of the olefactory pathways . |
| Approach: | They propose a representation learning framework that aligns molecular structure, receptor sequence, and natural language description. |
| Outcome: | The proposed framework achieves state-of-the-art and excellent zero-shot generalization . it decouples contributions of molecular structure, receptor sequence, and natural language description . |
Copied to clipboard
| Challenge: | Existing methods for automated insight discovery lack contextual coherence and coverage due to single-path exploration. |
| Approach: | They propose a Manager-Centric Collaborative Framework that integrates planner and executor . it ensures cross-episode contextual coherence and allows for adaptive sub-goal generation . |
| Outcome: | The proposed framework outperforms baselines on InsightBench and Inseval. |
Copied to clipboard
| Challenge: | Existing methods for calibration of large reasoning models (LRMs) focus on clean inputs, leaving noise unexplored. |
| Approach: | They propose a confidence calibration framework for character-level noisy inputs that extracts uncertainty signals from both the empirical answer distribution and the model’s predictive distribution and integrates them via a learned calibrator. |
| Outcome: | Experiments on multiple mathematical reasoning benchmarks show that DisCal outperforms existing calibration methods under noisy inputs, reducing expected calibration error (ECE) by up to 39.21% and improving Area Under the Receiver Operating Characteristic Curve (AUROC) by 31.44%. |
Copied to clipboard
| Challenge: | Document-level event extraction aims to extract structured information from unstructured text. |
| Approach: | They propose a cross-document event extraction pipeline that integrates event information from multiple documents and provides a comprehensive perspective on events. |
| Outcome: | The proposed pipeline achieves about 72% F1 in end-to-end cross-document event extraction, setting up a benchmark for future research. |
Copied to clipboard
| Challenge: | Existing RAG research focuses on textual data, overlooking rich visual content in financial documents. |
| Approach: | They propose a visual RAG benchmark tailored for finance that integrates multimodal data and provides visual citation to ensure traceability. |
| Outcome: | The proposed visual RAG benchmark integrates multimodal data and provides visual citation to ensure traceability. |
Copied to clipboard
| Challenge: | Existing adversarial models rely on keyword matching and ignore relevant contextual relations for answer prediction. |
| Approach: | They propose to use keyword matching to attack model with two biases that rely on a perturbed answer sentence and a distracting answer sentence to misguide model. |
| Outcome: | The proposed method produces fluent and grammatical adversarial contexts while maintaining gold answers. |
Copied to clipboard
| Challenge: | Existing methods to improve reasoning abilities of Large Language Models (LLMs) have limitations due to excessive growth in context length, causing large hardware burden. |
| Approach: | They propose a novel Unified ICL framework that unifies demonstration compression, demonstration selection, and final response generation. |
| Outcome: | The proposed framework unifies demonstration compression, demonstration selection, and final response generation. |
Copied to clipboard
| Challenge: | Existing quantization methods are compromising performance of large language models (LLMs) despite their high computational intensity, LLMs are still demanding intensive computation. |
| Approach: | They propose to generate the KV cache of pivot tokens losslessly from the full-precision model. |
| Outcome: | The proposed method generates the KV cache of pivot tokens losslessly from the full-precision model with no extra inference overhead. |
Copied to clipboard
| Challenge: | Asymmetrical text matching is a fundamental problem in information retrieval and natural language processing. |
| Approach: | They propose a method that regularizes features vectors projected from different domains . WD-Match can be used to improve different text matching methods . |
| Outcome: | The proposed method outperforms existing methods and benchmarks on four datasets. |
Copied to clipboard
| Challenge: | Existing methods for event schema generation are noise-sensitive and error-accumulating, e.g., inability to correct errors while generating schema. |
| Approach: | They propose a novel diffusion event graph model that embeds and roundes event graphs into learnable latent representations and a denoising process to maintain the model's robustness. |
| Outcome: | The proposed model achieves better results than existing state-of-the-art models on three IED bombing datasets. |
Copied to clipboard
| Challenge: | Emergent Large Language Models (LLMs) use extraordinary performance and powerful deduction capacity to discern from traditional language models. |
| Approach: | They propose a method that uses weights to compensate quantization error and learnable singular value incremental (LSI) LSI is a technique that helps weights compensate each other conditioned on activation. |
| Outcome: | The proposed method achieves state-of-the-art performance in diverse quantization settings, no matter in weight-only, weight-activation or extremely low bit scenarios. |
Copied to clipboard
| Challenge: | Recent studies show that prompts improve performance of large pre-trained language models for few-shot text classification. |
| Approach: | They propose a prompt-based framework for few-shot learning that captures cross-task transferable knowledge and uses two de-biasing techniques to make it more task-agnostic and unbiased . |
| Outcome: | The proposed framework outperforms strong baselines over multiple NLP tasks and datasets. |
Copied to clipboard
| Challenge: | Experimental results show that Sequence-to-sequence models tend to generate generic/dull responses . |
| Approach: | They propose a statistical re-weighting method that assigns different weights for multiple responses of the same query. |
| Outcome: | The proposed method improves acceptance rate of generated responses and significantly reduces generated generic responses. |
Copied to clipboard
| Challenge: | Existing methods for hallucination mitigation are based on external dependency and require external annotations or auxiliary models for preference data collection. |
| Approach: | a new method is proposed to help model-generated hallucinations without external dependencies. |
| Outcome: | a new method that self-injects hallucinations into a generated response improves halluuutations mitigation. |
Copied to clipboard
| Challenge: | Existing approaches to empathetic response generation ignore the emotion cause . existing dialogue systems lack emotion understanding and empathy . |
| Approach: | They propose a framework that integrates emotion cause information into empathetic response generation by predicting context emotion labels and sequence of emotion cause-oriented labels. |
| Outcome: | The proposed framework improves empathetic response generation by incorporating emotion cause information into the model. |
Copied to clipboard
| Challenge: | Existing studies fail to provide comprehensive service satisfaction analysis . Existing models fail to include satisfaction polarity classification and sentimental utterance identification . |
| Approach: | They propose a model that predicts customer sentiments and aggregates them into service satisfaction polarity. |
| Outcome: | The proposed model predicts customer sentiments and aggregates them into service satisfaction polarity and reasoning clues. |
Copied to clipboard
| Challenge: | Existing approaches to recover dropped pronouns ignore the dependencies between pronounes in neighboring utterances. |
| Approach: | They propose a framework that combines Transformer network and General Conditional Random Fields to model the dependencies between pronouns in neighboring utterances. |
| Outcome: | The proposed framework outperforms state-of-the-art models on three Chinese conversation datasets showing that it captures the dependencies between pronouns in neighboring utterances. |
Copied to clipboard
| Challenge: | Existing code reasoning benchmarks evaluate final output correctness under a single implementation. |
| Approach: | They propose a Code Reasoning benchmark that evaluates code reasoning through implementation invariance and process transparency. |
| Outcome: | The proposed benchmarks lack implementation invariance and process transparency . they observe superficial execution where models arrive at correct outputs without reasoning . |
Copied to clipboard
| Challenge: | Existing black-box large language models (LLMs) have excellent performance in task-oriented dialogue (TOD) tasks, but obtaining suitable prompts for specific tasks is challenging. |
| Approach: | They propose a black-box large language model that generates domain and slot information in the belief state, which serves as prior knowledge for subsequent prompt generation. |
| Outcome: | The proposed framework outperforms existing prompting methods on the MultiWOZ 2.0 dataset. |
Copied to clipboard
| Challenge: | Text-to-Image Synthesis (TIS) is a popular task to convert natural language texts into realistic images. |
| Approach: | They propose a transformer-based Chinese text-to-image synthesizer for high-resolution image generation that incorporates linguistic and relational knowledge facts into the model to ensure better performance without the usage of ultra-large models. |
| Outcome: | The proposed model outperforms existing models in Chinese with linguistic and relational knowledge facts. |
Copied to clipboard
| Challenge: | Existing parameter-efficient methods for RLVR face limitations . low-rank adaptation methods do not account for the distinct optimization dynamics . |
| Approach: | They propose a low-rank adaptation method tailored for RLVR that exploits the anisotropic structure of RL update subspace and extracts its principal directions via Singular Value Decomposition (SVD). |
| Outcome: | Experiments on large reasoning models show that GeoRA outperforms strong low-rank baselines across RLVR settings while showing stronger generalization and less forgetting on out-of-domain tasks. |
Copied to clipboard
| Challenge: | Process reward models (PRMs) assign fine-grained scores to intermediate reasoning steps within a solution trajectory. |
| Approach: | They propose a bidirectional evaluation paradigm that integrates a parallel evaluation stream alongside the L2R evaluation scheme and a gating mechanism to fuse the reward scores. |
| Outcome: | The proposed model surpasses unidirectional baselines in multiple benchmarks, LLM objectives and sampling policies. |
Copied to clipboard
| Challenge: | Existing approaches to memory management rely on final task performance as the primary reward, resulting in severe reward sparsity and ineffective credit assignment. |
| Approach: | They propose a framework for fine-grained feedback alignment using a Chunk-level step reward and Evidence-Anchored Reward Attribution to redistribute global rewards based on memory items utilized as evidence in reasoning. |
| Outcome: | The proposed framework outperforms baselines and supports generalization across different model configurations and backbones. |
Copied to clipboard
| Challenge: | Abbreviated column names often harm downstream tasks, causing performance drops of 10.54, 40.50, and 3.83 percentage points. |
| Approach: | They propose a method that integrates a subsequence abbreviation generator trained on human-annotated data and collects non-subsequent abbrevations to improve the training set. |
| Outcome: | The proposed approach improves on the English NameGuess task and surpasses state-of-the-art LLMs. |
Copied to clipboard
| Challenge: | Existing supervised relation extraction methods can still misclassify unknown relations into known relations due to the lack of supervision signals. |
| Approach: | They propose a method that regularizes the model by dynamically synthesizing negative instances that can provide the missing supervision signals. |
| Outcome: | The proposed method achieves SOTA unknown relation detection without compromising the classification of known relations. |
Copied to clipboard
| Challenge: | Existing methods for knowledge Graph Completion (KGC) fail in unseen relation representations. |
| Approach: | They propose to use three kinds of graphs to obtain unseen relation representations . they propose to decouple mixture-of-graph experts (DMoG) for unseened relations learning . |
| Outcome: | The proposed method outperforms the state-of-the-art methods on unseen relation representations. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) unintentionally memorize sensitive data, posing privacy and security risks. |
| Approach: | They propose a framework that reconciles unlearning efficacy and utility preservation by using a latent-space gating mechanism to simulate internal recovery attempts. |
| Outcome: | The proposed framework achieves superior trade-off between unlearning efficacy and model utility. |
Copied to clipboard
| Challenge: | Existing methods for pre-trained language models rely on noisy data, which can be expensive if all parameters are updated. |
| Approach: | They propose a self-training framework that incorporates Monte Carlo dropouts into the model and judiciously selects reliable pseudo-labeled examples based on confidence and certainty. |
| Outcome: | The proposed framework improves performance and efficiency over multiple tasks over multiple datasets. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) are increasingly being deployed as content moderators . however, they exploit the Human-AI capability gap and create adversarial environments . smuggling attacks exploit the human-AI gap and exploit the vulnerability . |
| Approach: | They construct a benchmark to evaluate the vulnerability of MLLMs as content moderators . they identify three root causes: limited capabilities of vision encoders, robustness gap in OCR . |
| Outcome: | The proposed model exploits the Human-AI capability gap and is vulnerable to smuggling attacks. |
Copied to clipboard
| Challenge: | Pronouns are often dropped in conversational genres as their referents can be easily understood from context. |
| Approach: | They propose an end-to-end neural network model to recover dropped pronouns in conversational data. |
| Outcome: | The proposed model improves on three different conversational genres. |
Copied to clipboard
| Challenge: | eschewing separate architecture and training for knowledge-intensive tasks is cumbersome . end-to-end training only based on supervision from the end task is awkward . |
| Approach: | They propose a single Transformer that performs retrieval as attention and end-to-end training solely based on supervision from the end QA task. |
| Outcome: | The proposed model outperforms state-of-the-art retrievers and readers on in-domain datasets. |
Copied to clipboard
| Challenge: | Existing cross-document event coreference resolution models lack the ability to capture long-distance dependencies. |
| Approach: | They propose to construct document-level Rhetorical Structure Theory trees and cross-document Lexical Chains to model structural and semantic information of documents. |
| Outcome: | The proposed model outperforms baseline models on English and Chinese datasets by large margins. |
Copied to clipboard
| Challenge: | Existing approaches to mitigate inference inefficiency and optimization difficulty are fragmented and constrained by inherent trade-offs. |
| Approach: | They propose a framework that reconceptualizes discrete reasoning steps as a continuous probabilistic flow, quantifying the contribution of each step toward the ground-truth answer. |
| Outcome: | The proposed framework achieves a superior balance between inference efficiency and reasoning performance on challenging benchmarks. |
Copied to clipboard
| Challenge: | Existing dynamic schemes such as early-exit and layer-drop reduce FLOPs but break batch processing or introduce KV-cache inconsistency. |
| Approach: | They propose a dynamic low-rank substitution framework that employs a lightweight decision module at each layer to dynamically determine the execution branch for different tokens. |
| Outcome: | The proposed model reduces computation by approximately 40% compared to the original dense model while outperforming existing baseline methods. |
Copied to clipboard
| Challenge: | Extractive Question Answering (EQA) is one of the most essential tasks in Machine Reading Comprehension (MRC). |
| Approach: | They propose a framework that transforms extractive question answering into a non-autoregressive Masked Language Modeling (MLM) generation problem. |
| Outcome: | The proposed framework outperforms state-of-the-art approaches in few-shot learning scenarios by a large margin. |
Copied to clipboard
| Challenge: | Recent advances in visual-language pre-trained (VLP) models have greatly improved cross-modal retrieval performance . however, the fine-grained interactions between objects from different modalities are far from well-established . e-commerce domain lacks sufficient training data and fine-granular cross-modulal knowledge . |
| Approach: | They propose a visual-language pre-trained (VLP) image-text retrieval model that integrates cross-modal knowledge into the model to improve performance. |
| Outcome: | The proposed model improves performance on e-commerce image-text retrieval task by a large margin. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have many advantages but they also pose significant safety risks. |
| Approach: | They propose a method to enhance the safety self-evaluation capability of LLMs . they perform semantic mutations on the original safety evaluation questions . |
| Outcome: | The proposed method improves safety self-evaluation accuracy by 5.86% and 7.79% over baseline methods on Chinese and English datasets. |
Copied to clipboard
| Challenge: | Existing document understanding benchmarks only handle a small number of pages . existing models are limited to handling only a limited number of documents . |
| Approach: | They propose a long document understanding benchmark that integrates three primary tasks and 20 sub-tasks based on different primary tasks. |
| Outcome: | The proposed model outperforms existing benchmarks on open-source and closed-source models . the model outpersforms other models on more than 33,000 pages of documents . |
Copied to clipboard
| Challenge: | Neural conversation models are easy to generate bland and generic responses . however, their improvement of generating high-quality responses is still unsatisfactory . |
| Approach: | They propose to use a discrete latent variable with an explicit semantic meaning to improve the conditional variational autoencoder on short-text conversation. |
| Outcome: | The proposed model outperforms various kinds of generation models under automatic and human evaluations and generates more diverse and informative responses. |
Copied to clipboard
| Challenge: | Existing research has analyzed various factors indicating the conversational purpose such as emotions, topics, word orders, syntactic patterns and other aspects. |
| Approach: | They propose to annotate a short-text conversation dataset with annotated sentences and train conversation models conditioned on the sentence functions. |
| Outcome: | The proposed model can predict the quality of the returned responses. |
Copied to clipboard
| Challenge: | a recent study shows that agent research practices are far from standard, rigorous . lack of a standard evaluation protocol makes previous works not reproducible, authors say . |
| Approach: | They conduct an empirical study on the GAIA benchmark to investigate agent design choices . they find that lack of a standard evaluation protocol makes previous works not reproducible . |
| Outcome: | The proposed framework achieves state-of-the-art performance among open-source projects. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive performance but require computational and memory resources. |
| Approach: | They propose a post-training framework that uses a Haar wavelet transform to prune weights. |
| Outcome: | The proposed pruning framework reduces pruning time and computational costs by removing less important weights while preserving model architecture. |
Copied to clipboard
| Challenge: | Existing methods for multilingual knowledge graph completion do not align with mKGC tasks because of their English-centric bias. |
| Approach: | They propose to use multilingual pretrained language models to solve queries in different languages by reasoning a tail entity. |
| Outcome: | The proposed method outperforms the previous SOTA on Hits@1 and Hits @10 by 12.32% and 16.03% on public datasets. |
Copied to clipboard
| Challenge: | Existing prompt-based NER models fail to detect entity boundaries, causing performance degradation. |
| Approach: | They propose a model which consists of a BART encoder and a parabiotic decoder and propose ' boundary expansion strategy' to enhance the model's capability in entity type classification. |
| Outcome: | The proposed model can achieve significant performance gains over state-of-the-art models. |
Copied to clipboard
| Challenge: | Existing work exploits easily accessible co-occurrence information of events to learn event representations. |
| Approach: | They propose a weakly supervised contrastive learning method and a prototype-based clustering method for event representation learning. |
| Outcome: | The proposed framework outperforms baselines on Hard Similarity and Transitive Sentence Similarity tasks. |
Copied to clipboard
| Challenge: | Existing red-teaming methods require expensive fine-tuning, especially for large LLMs. |
| Approach: | They propose a red-teaming method that uses an ‘evil score’ to evaluate the potential of tokens to contribute to harmful outputs during decoding. |
| Outcome: | The proposed method achieves an ASR of 92.83% on the Llama-3.2-3B-Instruct model, compared to 83.48% with adversarial fine-tuning while using less computational resources. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable capabilities in reasoning and generation, serving as the foundation for advanced persona simulation and Role-Playing Language Agents (RPLAs). |
| Approach: | They propose a framework that treats psychological patterns as interacting causal forces and synthesizes 113 scenarios where 2-5 patterns reinforce, conflict, or modulate each other. |
| Outcome: | The proposed framework outperforms Qwen3-32B on multi-pattern dynamics despite 4 fewer parameters. |