Papers by Jiahao Liu
Copied to clipboard
| Challenge: | Existing balancing strategies focus on constraining the final distribution of expert usage, but overlook the routing decisions made at each layer. |
| Approach: | They propose a three-stage framework that leverages process-level rewards to guide balanced expert routing. |
| Outcome: | Extensive experiments show that LayerMoE improves the performance of state-of-the-art LoRA-MoA baselines, yielding an average accuracy gain of 1.39%. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) improves the fine-tuning efficiency and performance of large language models. |
| Approach: | They propose a low-rank adaptive approach that decomposes update matrix into global and local adapters and assigns them to local and global adapters. |
| Outcome: | The proposed method achieves up to 2.7% accuracy improvement over LoRA and its variants on commonsense reasoning, mathematical reasoning, and code generation. |
Copied to clipboard
| Challenge: | Speculative decoding is a promising technique to accelerate the inference of Large Language Models. |
| Approach: | They propose a method that uses a token graph to record multiple sequence hypotheses within a single draft stage. |
| Outcome: | The proposed method significantly accelerates the inference of Large Language Models (LLMs) it allows the LLM to choose from and select the longest sequence that meets its standards. |
Copied to clipboard
| Challenge: | Existing CodePre-trained models struggle to generalize due to superficial mapping from source code to labels instead of understanding the root causes of code vulnerabilities. |
| Approach: | They propose a framework that integrates multi-task learning with Large Language Models to effectively mine deep-seated vulnerability features. |
| Outcome: | The proposed framework surpasses seven state-of-the-art models in effectiveness, generalization, and robustness. |
Copied to clipboard
| Challenge: | Existing systems with opaque architectures are limiting deep search capabilities for web-augmented large language models. |
| Approach: | They propose a transparent and modular multi-agent framework to democratize deep search for LLMs. |
| Outcome: | The proposed framework outperforms open-source systems in deep reasoning tasks. |
Copied to clipboard
| Challenge: | PTs are employed by scammers to manipulate victims and cause lasting psychological trauma. |
| Approach: | They propose a benchmark to capture the PTs employed in real-worldscam reports and investigate how LLMs can be utilized to generate variants of scams based on the pts and the contexts provided by thesescams. |
| Outcome: | The proposed model can generate variants of scams based on the PTs employed in real-world scam reports and the contexts provided by these scams. |
Copied to clipboard
| Challenge: | In-context learning (ICL) is an emerging capability of large autoregressive language models where a few demonstrations are appended to the input to enhance the model’s understanding of downstream NLP tasks without directly adjusting the model parameters. |
| Approach: | They propose a method where a few demonstrations are appended to the input to enhance the model's understanding of downstream NLP tasks without directly adjusting the model parameters. |
| Outcome: | The proposed method significantly improves the input-label mapping in ICL demonstrations. |
Copied to clipboard
| Challenge: | Existing beam retrieval frameworks for multi-hop question answering were customized for two-hop questions and were poorly supervised. |
| Approach: | They propose an end-to-end beam retrieval framework for multi-hop question answering . they combine an encoder and two classification heads to optimize the retrieval process . |
| Outcome: | The proposed framework improves on MuSiQue-Ans and surpasses all previous retrievers on HotpotQA and achieves 99.9% precision on 2WikiMultiHopQA. |
Copied to clipboard
| Challenge: | Existing methods for multimodal aspect-based sentiment classification rely on superficial correlations and spurious cues. |
| Approach: | They propose a Dual-Path Counterfactual Integration framework that explicitly models counterfactual reasoning in multimodal contexts. |
| Outcome: | The proposed framework improves model robustness by explicitly modeling counterfactual reasoning in multimodal contexts. |
Copied to clipboard
| Challenge: | Existing membership inference attacks require access to complete logits, but such access is often unavailable in real-world deployments where only the generated text is exposed. |
| Approach: | They propose a surrogate-free label-only MIA approach that directly estimates token probabilities through Monte Carlo sampling of the target model. |
| Outcome: | The proposed approach outperforms existing label-only attacks and serves as a foundational density estimator in the label-exclusive setting. |
Copied to clipboard
| Challenge: | Existing methods for in-context learning with large language models focus on using correct or negative examples, ignoring the potential value of incorrect or negative samples. |
| Approach: | They propose a few-shot technique that leverages both correct and incorrect sample constructions to create in-context learning demonstrations. |
| Outcome: | The proposed technique outperforms previous few-shot in-context learning methods on a broad spectrum of related tasks. |
Copied to clipboard
| Challenge: | Existing post-SFT methods for embodied AI are constrained by sparse rewards and action-only optimization, resulting in low sample efficiency, poor consistency, and model degradation. |
| Approach: | They propose to integrate Thought-Centric Preference Optimization (TCPO) into embodied decision-making by transforming sparse reward signals into richer step sample pairs. |
| Outcome: | The proposed approach achieves an average success rate of 26.67% in the ALFWorld environment, and a 6% improvement over RL4VLM. |
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) prompting can mitigate hallucinations by encouraging step-by-step reasoning, but its impact on halluciation detection remains underexplored. |
| Approach: | They conduct an empirical evaluation of CoT prompting in Large Language Models (LLMs) to examine their impact on hallucination detection methods. |
| Outcome: | The proposed method significantly affects the internal states and token probability distributions of the LLM. |
Copied to clipboard
| Challenge: | Existing approaches to perform large-scale query-passage retrieval are term-based, but they lose interaction between query-pastage pairs. |
| Approach: | They propose to fuse query (passage) information into query representations via graph neural networks that are constructed by queries and their top retrieved passages. |
| Outcome: | The proposed model outperforms existing models on MSMARCO, Natural Questions and TriviaQA datasets and achieves the new state-of-the-art on these datasets. |
Copied to clipboard
| Challenge: | Extensive experiments with seven Large Language Models reveal their varying behaviors. |
| Approach: | They investigate the behaviors of Large Language Models when faced with conflicting prompts versus their internal memory. |
| Outcome: | Extensive experiments with seven LLMs reveal their varying behaviors. |
Copied to clipboard
| Challenge: | Recent studies explore Large Language Models’ (LLMs) performance on Theory of Mind (ToM) reasoning tasks, but research on ToM abilities that require more nuanced social context is limited, such as white lies. |
| Approach: | They propose a novel English benchmark to evaluate Large Language Models’ ability to understand white lies within real-life conversations and reason about prosocial motivations behind them. |
| Outcome: | The proposed model outperforms state-of-the-art models on ToM reasoning tasks and reveals significant gaps between humans and LLMs. |
Copied to clipboard
| Challenge: | Mamba models demonstrate superior inference efficiency and competitive performance on short-context tasks, but their capacity to comprehend long contexts is limited compared to transformer-based models. |
| Approach: | They propose a model which incorporates selective compression and adaptation techniques within a two-stage re-forward process, incurring minimal additional inference costs overhead. |
| Outcome: | The proposed model improves on the LongBench and L-Eval benchmarks by 3.2 and 1.6 points and attains performance almost on par with same-size transformer models. |
Copied to clipboard
| Challenge: | Automated Essay Scoring (AES) systems face three major challenges: reliance on handcrafted features that limit generalizability, difficulty in capturing fine-grained traits like coherence and argumentation, and inability to handle multimodal contexts. |
| Approach: | They propose a multimodal benchmark to evaluate AES capabilities across lexical-, sentence-, and discourse-level traits without manual feature engineering. |
| Outcome: | The proposed system can evaluate AES capabilities across lexical-, sentence-, and discourse-level traits without manual feature engineering. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) for large language models has been successful in various domains. |
| Approach: | They propose to perform low-rank updates within clustered parameter subspaces . they group rows/columns of update matrix into locally coherent, uncorrelated subspace blocks . |
| Outcome: | Empirical results show that low-rank Adaptation (LoRA) is better than global adaptations in various domains. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) exhibit remarkable performance across a wide range of domains. |
| Approach: | They propose a multimodal prompt tuning approach for efficient instruction tuning of MLLMs. |
| Outcome: | The proposed approach shows superior performance on multimodal evaluation datasets compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | High-order numerical methods enhance performance in tasks like NLP but introduce a performance-efficiency trade-off due to increased computational overhead. |
| Approach: | They propose an iterative implicit Euler Transformer which simplifies high-order numerical methods by iterating implicit Eule. |
| Outcome: | The proposed method improves accuracy and reduces inference overhead by 55% while retaining 99.4% of the original task accuracy. |
Copied to clipboard
| Challenge: | Existing Trojan attacks require extensive training data and poor generalization, limiting effectiveness and scalability. |
| Approach: | They propose a method for embedding Trojans into plugins using a single edit layer . they find that the method reduces modified parameters by 8-fold and cuts injection time to 25 seconds . |
| Outcome: | The proposed method achieves an average attack success rate of 91%, a 78% improvement over the state-of-the-art (SOTA) method. |
Copied to clipboard
| Challenge: | Experimental results show that representation-based text matching methods suffer from performance degradation due to the lack of interactions between the pair of texts. |
| Approach: | They propose a virtual interaction mechanism that enables deep interaction between texts . they propose 'inteRacTion mechanism' that can be integrated into existing methods as plugins . |
| Outcome: | The proposed method outperforms state-of-the-art models on six text matching benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown remarkable performance across various English benchmarks, including both human exam datasets such as MMLU and instruction-following datasets. |
| Approach: | They introduce two new benchmarks to evaluate the capabilities of Large Language Models in Southeast Asian (SEA) application scenarios. |
| Outcome: | The proposed benchmarks show that they can discern LLM performance on SEA language tasks compared to their translated benchmarks. |
Copied to clipboard
| Challenge: | Existing models that interpolate weights of two specialized models can be abused for efficient reasoning. |
| Approach: | They propose to merge two specialized models and create a model that combines efficiency and efficiency. |
| Outcome: | The proposed method outperforms existing models on efficiency and effectiveness. |
Copied to clipboard
| Challenge: | Existing methods for teacher assistant-based distillation require multiple trials to find the optimal teacher assistant. |
| Approach: | They propose a method that allows scheduling of an optimal teacher assistant in just one trial . they show that student performance is positively correlated with the scale-performance tradeoff . |
| Outcome: | The proposed method can select the optimal teacher assistant in just one trial . it can be used to compare performance of student and teacher assistants on GLUE benchmarks. |
Copied to clipboard
| Challenge: | Existing studies have shown that pretrained language models require a tremendous amount of inference compute to perform. |
| Approach: | They propose to compress pretrained language models to small ones with a teacher-student paradigm to fill the capacity gap. |
| Outcome: | The proposed model achieves state-of-the-art performance at small FLOPs compared with competitive baselines. |
Copied to clipboard
| Challenge: | Unsupervised sentence representation learning is one of the fundamental problems in natural language processing . contrastive learning methods fail to capture fine-grained ranking information among the sentences . |
| Approach: | They propose a novel approach for unsupervised sentence representation learning that integrates ranking consistency and ranking distillation with contrastive learning into a unified framework. |
| Outcome: | The proposed approach performs better over state-of-the-art models on STS and TR tasks. |
Copied to clipboard
| Challenge: | Large-scale pre-trained language models (LLMs) have demonstrated exceptional performance in various natural language processing (NLP) tasks. |
| Approach: | They propose a new compression paradigm that extracts knowledge from pre-trained language models to construct a knowledge store from which the model can leverage it for effective inference. |
| Outcome: | The proposed model extracts knowledge from LLMs to construct a knowledge store, which the model can leverage for effective inference. |
Copied to clipboard
| Challenge: | Experimental results show that combining both proposed methods leads to a gain of 1.8 points compared to the strong baseline SimCSE configured with BERT base. |
| Approach: | They propose a method to deal with dropout noise and a dimension-wise contrastive learning objective to address feature corruption. |
| Outcome: | The proposed method achieves 1.8 points compared to the strong baseline SimCSE and 1.4 points for DiffCSE. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a key task reliant on textual data. |
| Approach: | They propose a method to transform NER into a multimodal task by using images from the internet as auxiliaries. |
| Outcome: | The proposed method surpasses all text-only baselines and improves F1 score by 1.4% to 2.3% on prominent MNER datasets. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have brought significant changes to various domains, especially through autonomous agents. |
| Approach: | They propose a framework that lets agents learn shortcuts from their past tasks and use them for future task execution. |
| Outcome: | The proposed framework enables agents to tackle unseen software-developing tasks more effectively. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have limitations such as generating factually incorrect information (hallucinations) Retrieval-Augmented Generation (RAG) is a powerful paradigm for enhancing LLMs with external, up-to-date knowledge. |
| Approach: | They investigate the data extraction vulnerabilities of Graph RAG systems by executing tailored attacks on them. |
| Outcome: | The proposed attacks exploit the vulnerability of Graph RAG systems to leak raw text and structured data. |
Copied to clipboard
| Challenge: | Visual Document Retrieval (VDR) is of importance in multimodal retrieval applications. |
| Approach: | They propose a two-stage pruning and merging frameworks that combine pruning and merge techniques to achieve higher compression rates. |
| Outcome: | The proposed framework outperforms existing methods on 29 visual document retrieval datasets. |
Copied to clipboard
| Challenge: | Live morph resolution task is used to detect e-commerce live streaming violations . morphs are used to evade scrutiny and engage in false advertising . |
| Approach: | They propose a task to detect morph violations in live streaming scenarios . they use large language models to generate additional training data . |
| Outcome: | The proposed method improves performance and improves live streaming regulation. |
Copied to clipboard
| Challenge: | EmoAgent evaluates and mitigates mental health hazards in human-AI interactions, especially for vulnerable human users with psychological disorders. |
| Approach: | EmoAgent is a multi-agent AI framework designed to evaluate and mitigate mental health hazards in human-AI interactions. |
| Outcome: | EmoAgent evaluates and mitigates mental health hazards in human-AI interactions. |
Copied to clipboard
| Challenge: | Existing dynamic vocabulary approaches struggle to generalize to novel or out-of-vocabulary words, limiting their flexibility in handling diverse token combinations. |
| Approach: | They propose an open-source framework for training, evaluation, and visualization of dynamic vocabulary-augmented language models. |
| Outcome: | The proposed framework validates the effectiveness of dynamic vocabulary-augmented language models on modern LLMs and shows support for batch inference significantly improving inference throughput. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP) Existing cost analyses regulate only the number of sampling passes, ignoring the substantial disparities in sampling costs. |
| Approach: | They propose to integrate two complementary methods into a unified EconRL pipeline to increase pass rates under constrained sampling passes. |
| Outcome: | The proposed method reduces token usage and sample passes while maintaining the original performance. |
Copied to clipboard
| Challenge: | Existing merging approaches involve scaling the parameters model-wise or integrating parameter importance parameter-wise. |
| Approach: | They propose a method for merging model-based models at the parameter level without training data or joint training. |
| Outcome: | The proposed model merging framework outperforms baseline models on validation sets. |
Copied to clipboard
| Challenge: | Existing methods for temporal sentence grounding ignore two crucial issues . 1) Boundary-bias: the video downsampling process may lose these two frames . 2) Reasoning-biases: such incorrect new boundary frames lead to the reasoning bias . |
| Approach: | They propose a siamese sampling mechanism to generate additional contextual frames . they use a reasoning strategy to learn the inter-relationship among these frames a . |
| Outcome: | Extensive experiments demonstrate the effectiveness of a new siamese sampling network on three challenging datasets. |
Copied to clipboard
| Challenge: | Existing approaches to generate draft tokens in large language models are expensive and resource-intensive. |
| Approach: | They propose an approach to generate draft tokens using a segment of the LLM and a self-distillation method to enhance the quality of draft token. |
| Outcome: | The proposed approach generates draft tokens using a segment of the LLM and a self-distillation method to improve quality and speed up generation. |
Copied to clipboard
| Challenge: | Existing approaches to classify aspects with aspect sentiment bias are hard to find . |
| Approach: | They propose a no-aspect differential sentiment framework for the ABSA task that eliminates aspect sentiment bias and uses differential sentiment loss instead of cross-entropy loss to better classify the sentiments. |
| Outcome: | The proposed framework can be combined with almost all traditional ABSA methods. |
Copied to clipboard
| Challenge: | Explicit reasoning trajectories increase performance but often trigger overthinking . despite its importance, this study examines how each step of reasoning affects the final outcome . |
| Approach: | They propose a Reasoning Completion Point Detector that detects the RCP by monitoring rank dynamics of termination tokens. |
| Outcome: | The proposed method reduces token usage by up to 44% while preserving accuracy. |
Copied to clipboard
| Challenge: | Existing approaches to sentence embeddings are based on contrastive learning (CL) . |
| Approach: | They propose a framework which performs contrastive learning under the self-training paradigm with knowledge distillation and propose 'Group-P shuffling strategy' and averaging logits from multiple teacher components. |
| Outcome: | The proposed framework outperforms many strong baseline methods and yields a new state-of-the-art performance. |
Copied to clipboard
| Challenge: | Existing methods to extract product attribute value require multiple extractions to obtain all corresponding values. |
| Approach: | They propose an Efficient product Attribute Value Extraction approach using lightweight sparse-layer interaction. |
| Outcome: | The proposed method achieves significant efficiency gains with neutral or marginal loss in performance when the context is long and number of attributes is large. |
Copied to clipboard
| Challenge: | Quantization is a viable solution for pre-trained language models, but most existing methods are task-specific and require customized training and quantization with a large number of trainable parameters. |
| Approach: | They propose a "quantize before fine-tuning" framework that allows for quantization with a large number of trainable parameters on each individual task. |
| Outcome: | The proposed framework is compatible with quantization-aware training and post-training quantization and corrects quantization errors. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on well-structured tables and fail to reflect irregular structures and complex reasoning commonly encountered in real-world scenarios. |
| Approach: | They propose a benchmark to evaluate TableQA under complex reasoning and irregular table conditions. |
| Outcome: | The proposed framework improves generalization and realism of large language models under complex and irregular table conditions. |
Copied to clipboard
| Challenge: | Large language models exhibit intrinsic limitations such as knowledge cutoff, single-threaded reasoning that hinders finer-grained branch and aggregation, and rigid collaboration mechanisms that struggle to coordinate specialized capabilities. |
| Approach: | They propose a taxonomy spanning *Graph-Assisted Knowledge Augmentation*, *Graph Assisted Reasoning and Planning*, and *Graphed LLM Collaboration*. |
| Outcome: | The proposed models show that graphs can augment and correct LLMs and support dynamic coordination among experts and agents in collaborative settings. |
Copied to clipboard
| Challenge: | Existing jailbreak techniques focus on prompt manipulation or intent obfuscation to bypass safety filters. |
| Approach: | They propose a jailbreak technique that exploits the ability to store, retrieve, and use historical knowledge of Large Language Models (LLMs) they use an inspector agent to extract historical information and an attacker agent to generate adversarial prompts, enabling effective bypassing of safety filters. |
| Outcome: | The proposed jailbreak technique outperforms state-of-the-art jailbreak techniques on six popular models and maintains over 55.4% ASR against defence mechanisms. |
Copied to clipboard
| Challenge: | Existing studies on back translation (BT) focus on beam search or random sampling . a new method to generate synthetic data with a backward model is proposed to improve BT performance. |
| Approach: | They propose a method to generate synthetic data to trade off quality and importance factors . back translation (BT) is one of the most significant technologies in NMT research fields . |
| Outcome: | The proposed method outperforms the baseline methods on WMT14 DE-EN, EN-DE, and RU-EN benchmark tasks. |
Copied to clipboard
| Challenge: | Existing training methods, such as direct instruction fine-tuning, overlook hierarchical relationships among acceleration patterns. |
| Approach: | They propose a new training paradigm that uses bidirectional tree editing and progressive code acceleration learning to improve LLMs’ CA capabilities. |
| Outcome: | The proposed training paradigm outperforms prompt-enhanced GPT-4 and current training-based methods on average across five programming languages. |
Copied to clipboard
| Challenge: | Existing safety evaluation paradigms rely on constructed benchmarks or dynamic red-teaming to probe potential vulnerabilities. |
| Approach: | They propose a framework that integrates specification-based software testing with AI safety. |
| Outcome: | The proposed framework achieves higher coverage and attack success counts compared to baselines. |
Copied to clipboard
| Challenge: | Existing work in multilingual pretraining relies on the shared vocabulary and bilingual contexts to encourage the correlation across languages. |
| Approach: | They propose to plug a cross-attention module into a Transformer encoder to explicitly build the interdependence between languages. |
| Outcome: | The proposed model outperforms existing models on XTREME and English-to-French translation datasets. |