Papers by Yuan Gao
Copied to clipboard
| Challenge: | Out-of-distribution (OOD) detection is a fundamental task vexing real-world applications . fine-tuning based methods require storing fine- tuned models for each scenario . |
| Approach: | They propose an unsupervised prefix-tuning based OOD detection framework called PTO . they propose to take advantage of optional training data labels and targeted OOD data . |
| Outcome: | The proposed framework performs better than existing methods under a wide range of metrics, detection settings, and OOD types. |
Copied to clipboard
| Challenge: | Existing approaches to composable text operations often require plug-and-play . a single LM can perform arbitrary text operation composition in the latent space . |
| Approach: | They propose an efficient approach for composable text operations in the latent space of text . they connect pretrained LMs to the laten space and adapt them to the space . |
| Outcome: | The proposed approach improves on existing methods in the latent space of text. |
Copied to clipboard
| Challenge: | OpenVNA is an open-source framework for analyzing the behavior of multimodal language understanding systems under noisy conditions. |
| Approach: | They propose to use OpenVNA to analyze behavior of multimodal language understanding systems under noisy conditions. |
| Outcome: | The proposed framework provides high flexibility and extensibility, enabling customization with user-defined noise types and models. |
Copied to clipboard
| Challenge: | Parameter-Efficient Fine-Tuning (PEFT) methods have gained popularity for adapting pre-trained Large Language Models (LLMs) to downstream tasks. |
| Approach: | They propose a method to optimize the importance of full layers with layer-wise importance scoring by leveraging the estimated importance scores. |
| Outcome: | The proposed method is compatible with PEFT methods that operate on a per-layer basis and achieves better performance. |
Copied to clipboard
| Challenge: | Existing models of robustness evaluation are incomprehensive, impractical, and invalid . |
| Approach: | They propose a framework for automatic robustness evaluation that shifts towards model-centric evaluation to further exploit the advantages of adversarial attacks. |
| Outcome: | The proposed framework is based on a model-centric evaluation protocol and a robustness evaluation protocol. |
Copied to clipboard
| Challenge: | Visual Language Models (VLMs) have significant parameter size and autoregressive (AR) decoding nature impose considerable computational demands on VLA models. |
| Approach: | They propose a framework to relax acceptance utilizing the relative distances represented by the action tokens of the VLA model. |
| Outcome: | Empirical results show that the proposed framework improves the speed of the prediction task by 44%. |
Copied to clipboard
| Challenge: | Text-based image generation models, such as Stable Diffusion and DALL-E 3, hold significant potential in content creation and publishing workflows . however, considerable efforts are being made to prevent the generation of harmful content, such abusive, violent, or pornographic material. |
| Approach: | They propose a chain-of-jailbreak method which decomposes malicious queries into multiple sub-queries and iteratively edits images based on these sub-questions. |
| Outcome: | The proposed method can bypass safeguards of image generation models for over 60% cases, significantly outperforms other jailbreaking methods (14%) |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated impressive performance on reasoning-intensive tasks, but enhancing their reasoning abilities typically relies on expensive high-quality demonstrations and reinforcement learning. |
| Approach: | They propose to incentivize reasoning abilities of large language models without expensive demonstrations and reinforcement learning. |
| Outcome: | The proposed model can recover 94% of the gains of expensive RL at a fraction of the cost. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) have expanded the capabilities of traditional language models by enabling interaction through both text and images. |
| Approach: | They propose a multimodal safety awareness benchmark to evaluate MLLMs across 29 safety scenarios with 1,500 carefully curated image-prompt pairs. |
| Outcome: | The proposed model is able to identify unsafe content and avoid over-sensitivity that can hinder helpfulness. |
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: | i-Code V2 is one of the first models capable of generating natural language from any combination of Vision, Language, and Speech data. |
| Approach: | They propose to create a model that can generate natural language from any combination of Vision, Language, and Speech data. |
| Outcome: | i-Code V2 matches or outperforms state-of-the-art single- and dual-modality baselines on 7 multimodal tasks. |
Copied to clipboard
| Challenge: | Existing meta-learning models rely on implicit instance statistics and are unreliability and weak interpretability. |
| Approach: | They propose a meta-information guided meta-learning framework that uses semantics to guide meta- learning . experimental results demonstrate the effectiveness of the proposed framework . |
| Outcome: | The proposed framework can establish connections between instance-based information and semantic-based data, enabling faster initialization and adaptation. |
Copied to clipboard
| Challenge: | Existing approaches to improve contextual faithfulness treat the LLM as a black box, generating responses that are inconsistent with the provided context. |
| Approach: | They propose a framework for faithful RAG that operates in three stages: (i) fine-grained knowledge pruning to filter irrelevant context, (ii) latent conflict probing to identify hard conflicts in the model’s latent space, and (iv) conflict-aware attention to modulate attention heads toward faithful context integration. |
| Outcome: | Experiments show that ProbeRAG significantly improves both accuracy and contextual faithfulness. |
Copied to clipboard
| Challenge: | M-SENA is an open-source platform for multimodal sentiment analysis. |
| Approach: | They propose to use a platform for multimodal sentiment analysis to facilitate advanced research by providing flexible toolkits, reliable benchmarks, and intuitive demonstrations. |
| Outcome: | The proposed framework provides reliable benchmarks and baseline results of different modality features and MSA benchmarks. |
Copied to clipboard
| Challenge: | Existing approaches to represent knowledge in the low-dimensional space are to leverage large-scale unsupervised text corpus to train fixed or contextual representations. |
| Approach: | They propose to leverage large-scale unsupervised text corpus to train fixed or contextual language representations and to express knowledge into a knowledge graph (KG) they incorporate distributional representations of a KG onto the representations from pre-trained language models, via simply concatenation or multi-head attention. |
| Outcome: | The proposed models outperform the other models on the COIN: COmmonsense INference in Natural Language Processing (COIN) Workshop datasets. |
Copied to clipboard
| Challenge: | Existing studies for understanding programs do not take human behaviors as reference. |
| Approach: | They propose a graph neural network model that takes human behaviors as reference in understanding programs. |
| Outcome: | The proposed model performs better on code summarization and code clone detection tasks. |
Copied to clipboard
| Challenge: | OpenNRE provides a framework to implement neural relation extraction (RE) . the toolkit provides various functional modules based on TensorFlow and PyTorch . |
| Approach: | OpenNRE is an open-source framework to implement neural relation extraction models. they also release an online system to meet real-time extraction without any training and deployment. |
| Outcome: | OpenNRE provides a framework to implement neural models for relation extraction (RE) the toolkit also includes an online system to meet real-time extraction without training and deployment . |
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: | Recent approaches demonstrate that MLLMs can be adapted into competitive embedding models via large-scale contrastive learning. |
| Approach: | They propose a compressed pre-training phase which serves as a warm-up stage for contrastive learning. |
| Outcome: | The proposed model achieves state-of-the-art among MLLMs of comparable size on the MMEB, realizing optimization in both efficiency and effectiveness. |
Copied to clipboard
| Challenge: | Existing approaches to self-reflection fail to deliver robust response refinement for models with parameter sizes of 10 billion or smaller. |
| Approach: | They propose to redesign Self-Refine and introduce an information-theoretic framework based on Chain-of-Thought prompt engineering to improve self-reflection in Small Language Models. |
| Outcome: | The proposed framework improves reasoning accuracy and computational efficiency by up to 36.2% under identical model and data settings. |
Copied to clipboard
| Challenge: | Existing methods for offsite-tuning of large language models require high computational costs and lack theoretical analysis. |
| Approach: | They propose an offsite-tuning approach that selectively applies compression techniques such as rank compression and channel pruning to preserve the gradients of fine-tuned adapters while ensuring privacy. |
| Outcome: | The proposed method surpasses existing OT methods in privacy protection and model performance. |
Copied to clipboard
| Challenge: | Existing models for language understanding and understanding can be trained to provide contextualized representations of words based on text data. |
| Approach: | They propose a large-scale language VAE model Optimus that is pre-trained on large text corpus and fine-tuned for various language generation and understanding tasks. |
| Outcome: | The proposed model achieves new state-of-the-art on VAE language modeling benchmarks. |
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: | Current music information retrieval systems struggle to meet linguistic diversity challenges . current systems struggle with text queries in non-English languages . |
| Approach: | They propose a music information retrieval system that supports both ABC notation and MIDI . CLaMP 2 includes a multilingual text encoder and a multiple-modal music encoder . |
| Outcome: | The proposed system achieves state-of-the-art results in multilingual semantic search and music classification across modalities. |
Copied to clipboard
| Challenge: | Recent pruning methods rely on heuristically hand-crafted metrics, leading to suboptimal performance. |
| Approach: | They propose a method that optimizes pruning masks by minimizing back-propagation . they learn an underlying Bernoulli distribution to sample binary pruning mask samples . |
| Outcome: | The proposed method is able to support global and heterogeneous pruning without back-propagation. |
Copied to clipboard
| Challenge: | Existing trading systems rely on fragmented and task-specific APIs, resulting in inconsistent schemas and limited reproducibility. |
| Approach: | They propose a unified trading environment for large language model (LLM) agents that standardizes three core capabilities . they argue that such a standardized trading environment is essential for scalable research on LLM-based financial agents. |
| Outcome: | The proposed trading environment reduces engineering overhead and supports reproducible evaluation through comprehensive logging and deterministic replay. |
Copied to clipboard
| Challenge: | Existing transfer learning methods for neural machine translation use a well-trained translation model to initialize a child model with corresponding datasets. |
| Approach: | They propose a two-step fine-tuning framework for transfer learning in low-resource neural machine translation that adjusts the parent model to fit the child language by using the child source data. |
| Outcome: | The proposed framework improves on five low-resource translations on high-resolution languages. |
Copied to clipboard
| Challenge: | Existing methods for surfacing symbolic reasoning capabilities are limited to narrow tasks . arithmetic computations are unnatural to perform in pure language space, and hence present difficulties for LLMs. |
| Approach: | They propose a natural language embedded program framework for solving symbolic reasoning tasks. |
| Outcome: | The proposed framework improves on strong baselines across math and symbolic reasoning, text classification, question answering, and instruction following tasks. |
Copied to clipboard
| Challenge: | Existing work on instruction tuning has focused on task level, without considering that tasks are artificially defined and, to LLMs, merely consist of tokens and representations. |
| Approach: | They propose a training data arrangement framework that allows for continual learning and loss reduction. |
| Outcome: | The proposed framework promotes continual learning and loss reduction on unseen tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can simulate non-native-like English use observed in human second language (L2) learners interfered with by their native first language (N1) knowledge. |
| Approach: | They use large language models to simulate non-native-like English use observed in human second language (L2) learners, and then compare their outputs to real L2 learner data. |
| Outcome: | The proposed models replicate L1-dependent patterns observed in human second language (L2) learners, with distinct influences from various languages. |
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: | Existing approaches for few-shot Named Entity Recognition (NER) are evaluated mainly under in-domain settings, but little is known about how these models perform in cross-domain NER using labeled in- domain examples. |
| Approach: | They propose to use a rationale-centric data augmentation method to improve model generalization ability by allowing model to learn from a few labeled examples in a new target domain. |
| Outcome: | The proposed method improves the performance of cross-domain NER tasks compared to the counterfactual data augmentation and prompt-tuning methods. |
Copied to clipboard
| Challenge: | Existing approaches to Knowledge Graph Question Answering (KGQA) use Retrieval-Augmented Generation (RAG) but subgraph selection process is non-differentiable, preventing end-to-end training of the retriever and the generator. |
| Approach: | They propose a Differentiable RAG approach that optimizes the retriever and the generator for KGQA. |
| Outcome: | The proposed approach outperforms state-of-the-art approaches on WebQSP and CWQ. |
Copied to clipboard
| Challenge: | Existing methods for retrieval-augmented generation struggle with a trade-off between flexibility and retrieval quality. |
| Approach: | They propose a flexible modular KG-RAG framework that uses query text instead of KGs . they propose to use query text to infer the structural information of reasoning paths . |
| Outcome: | The proposed method achieves state-of-the-art performance with high efficiency and low resource consumption. |
Copied to clipboard
| Challenge: | Large language models (LLMs) experience significant performance degradation when the input exceeds the pretraining context window due to the out-of-distribution (OOD) behavior of Rotary Position Embedding (RoPE). |
| Approach: | They propose a training-free method that remaps out-of-distribution (OOD) positions into the in-distance range with fixed mapping strategies, ignoring the dynamic relationship between input length and effective context window. |
| Outcome: | Experiments on three representative LLMs across five mainstream long-context benchmarks show that the proposed method achieves significant performance improvements compared to existing methods. |
Copied to clipboard
| Challenge: | Existing prompt engineering techniques are limited to producing single flow instructions, struggling with handling diverse patterns. |
| Approach: | They propose an automatic prompt optimization method that iteratively develops a multi-branched prompt using failure cases as feedback. |
| Outcome: | The proposed method achieves the best results across five tasks and demonstrates significant optimization efficiency due to adoption of a minimal search strategy. |
Copied to clipboard
| Challenge: | Long-context modeling is crucial for next-generation language models, but high computational cost of standard attention mechanisms poses significant computational challenges. |
| Approach: | They propose a natively trained Sparse Attention mechanism that integrates algorithms with hardware-aligned optimizations to achieve efficient long-context modeling. |
| Outcome: | The proposed model maintains or exceeds Full Attention models across general benchmarks, long-context tasks, and instruction-based reasoning. |
Copied to clipboard
| Challenge: | AEGIS examines whether current models can effectively audit AI-generated images in academic papers. |
| Approach: | They propose a holistic benchmark for forensic analysis of AI-Generated academic ImageS that reveals limitations in academic image forensics. |
| Outcome: | AEGIS compared with existing benchmarks on seven academic categories and features key advances in forensic analysis. |
Copied to clipboard
| Challenge: | Existing computational studies of child language acquisition focus on isolated mechanisms, such as spreading activation in retrieval, sentence planning, or production efficiency. |
| Approach: | They propose a computational framework for modeling child language production using graphs to formalize meaning and Synchronous Hyperedge Replacement Grammar to formalized the syntax–semantics interface. |
| Outcome: | The proposed framework is based on graphs to formalize meaning and Synchronous Hyperedge Replacement Grammar (SHRG) resulting interpretable grammars are evaluated by their ability to generate utterances . |
Copied to clipboard
| Challenge: | Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence. |
| Approach: | They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included . |
| Outcome: | The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model. |
Copied to clipboard
| Challenge: | Named Entity Recognition and Entity Linking are challenging for voice assistants . utterances are relatively short, so there is not much context to help disambiguate . |
| Approach: | They propose a Named Entity Understanding system that combines NER and EL in a joint reranking module. |
| Outcome: | The proposed framework improves NER accuracy by up to 3.13% and EL accuracy by 3.6% in F1 score . it also leads to better accuracies in other natural language understanding tasks . |
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: | Existing studies on explainable AI focus on post-hoc explanation methods that interpret trained models through external approximations. |
| Approach: | They propose to categorize existing approaches into five design paradigms: functional transparency, concept alignment, representational decomposability, explicit modularization, and latent sparsity induction. |
| Outcome: | The proposed approaches are categorized into five design paradigms: functional transparency, concept alignment, representational decomposability, explicit modularization, and latent sparsity induction. |
Copied to clipboard
| Challenge: | Modern NLP workflows require different models for generation and embedding tasks. |
| Approach: | They propose a method that transforms an LLM into a Uni-Directional Masked Auto-Encoder. |
| Outcome: | The proposed method achieves state-of-the-art under unsupervised conditions with merely 100 training steps. |
Copied to clipboard
| Challenge: | Using common statistical measures for termhood and unithood, we identify terms from monolingual texts and investigate the contribution of terminology to translation quality. |
| Approach: | They propose to use common statistical measures for termhood and unithood as features to train classifiers for identifying terms in cross-domain and cross-language settings. |
| Outcome: | The proposed method has shown some reliability in automatically identifying terms in human translations, but drawbacks in handling low frequency terms and term variations shall be dealt with in the future. |
Copied to clipboard
| Challenge: | Existing studies evaluate efficiency robustness of vision-language models under unrealistic assumptions, requiring access to model architecture and parameters. |
| Approach: | They propose a novel approach to evaluate VLM efficiency robustness in a realistic black-box setting. |
| Outcome: | The proposed approach generates adversarial images with imperceptible perturbations, increasing the computational cost by up to 128.47%. |
Copied to clipboard
| Challenge: | Open Domain Multi-Hop Question Answering (ODMHQA) is one of the most challenging tasks in Natural Language Processing (NLP) |
| Approach: | They propose a mechanism that leverages the intrinsic capabilities of Large Language Models to judge whether the generated answers are off-topic. |
| Outcome: | The proposed method reduces the occurrence of off-topic answers by nearly 13%, improving the performance in Exact Match (EM) by nearly 3% compared to the baseline method without the Dr3 mechanism. |