Papers by Tao He
Copied to clipboard
| Challenge: | Existing studies have shown that rule-based evaluation methods are ineffective for open-ended natural language generation. |
| Approach: | They propose a pointwise generative reward model with a dedicated two-stage rollout method and unified query-based criteria that can be trained with 5.7K high-quality data. |
| Outcome: | The proposed model achieves superior performance on diverse reward model benchmarks, especially in Best-of-N scenarios, and delivers more effective improvements in downstream RL practice. |
Copied to clipboard
| Challenge: | Existing processes that reward for each step are one-directional and lack a mechanism to model the distance to the final target. |
| Approach: | They propose a process supervision model that evaluates the correctness of previous steps and the probability of future success. |
| Outcome: | The proposed model outperforms existing supervision models like ORM and PRM on reasoning tasks and improves solution re-design. |
Copied to clipboard
| Challenge: | Existing discriminative approaches suffer from "confident but wrong" failure mode, blindly adapting to OOD noise leading to error accumulation. |
| Approach: | They propose a TTA framework that harmonizes the robustness of generative diffusion models with the efficiency of discriminative regression networks via Bayesian Diffusion Distillation (BDD). |
| Outcome: | The proposed framework reduces MAE from 0.6872 to 0.5673 and boosts binary accuracy by 5.81 percentage points (reaching 57.33%) it also reduces the MAE of the MOSI to SIMS shift and achieves an 11.18-point gain over the baseline. |
Copied to clipboard
| Challenge: | Existing cultural benchmarks assess cultural knowledge or values biases, but ignore cultural taboos. |
| Approach: | They propose a benchmark to evaluate and improve the cultural taboo safety of large language models. |
| Outcome: | The proposed benchmark spans 77 countries and regions, and includes over 2,020 taboos. |
Copied to clipboard
| Challenge: | Biology-Instructions is the first large-scale instruction-tuning dataset for multi-omics biological sequences. |
| Approach: | They propose a large-scale instruction-tuning dataset for multi-omics biological sequences . they propose 'chatMultiOmics' to overcome limitations of current LLMs on multi-ome tasks . |
| Outcome: | The proposed dataset bridges LLMs and complex biological sequence-related tasks while maintaining conversational fluency. |
Copied to clipboard
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Copied to clipboard
| Challenge: | Existing datasets in operations research domain lack detailed annotations of the modeling process, focusing only on objective values. |
| Approach: | They propose an annotation-based tree-of-thought tree-based reasoning algorithm that integrates reinforcement learning into a tree- of-though. |
| Outcome: | The proposed algorithm outperforms state-of-the-art methods on StructuredOR, NL4OPT, and MAMO-ComplexLP datasets. |
Copied to clipboard
| Challenge: | Existing approaches to improve LLM reasoning are limited in complex domains and lack external grounding makes verifiers unreliable on computation-intensive tasks. |
| Approach: | They propose a framework that transforms reward modeling into a multi-turn, tool-augmented deliberative process. |
| Outcome: | The proposed framework surpasses state-of-the-art ORMs by 25.2% under parallel and sequential TTS. |
Copied to clipboard
| Challenge: | Existing methods for long chain-of-thought (LCoT) are coarse-grained, reward hacking, and poor generalization. |
| Approach: | They propose a Long Chain-of-Thought (LCoT) model that integrates reinforcement learning with verifiable rewards with a process-aware verification approach. |
| Outcome: | The proposed model improves reasoning and code generation tasks while reducing the cost of training and performance bottlenecks. |
Copied to clipboard
| Challenge: | In the era of evaluating large language models, data contamination is an increasingly prominent concern . static benchmarking has been used for evaluation, but there are limitations of *dynamic* benchmarks . |
| Approach: | They propose a series of optimal design principles for *dynamic* benchmarking and analyze the limitations of existing *static* benchmarks. |
| Outcome: | The proposed benchmarks highlight a critical gap in the evaluation of LLMs. |
Copied to clipboard
| Challenge: | Large language models (LLMs) generate solutions themselves and iteratively train on filtered, high-quality rationales, but performance reaches a ceiling after a few iterations. |
| Approach: | They propose a strategy to improve the efficiency of sampling heavy-tailed data by using Socratic-style guidance signals to help LLMs reasoning with complex queries. |
| Outcome: | The proposed approach is effective on difficult queries and on held-out tasks, while requiring human supervision. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are promising foundations to build generally-capable agents . however, the community lacks a unified interactive framework that covers diverse environments for comprehensive evaluation of agents. |
| Approach: | They propose a framework that features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
| Outcome: | The proposed framework features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
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: | Recent advances in deep neural networks have improved learning performance for NMT . Residual connections allow features from previous layers to be accumulated to the next layer easily. |
| Approach: | They propose a densely connected NMT architecture that can train more efficiently for NMT. |
| Outcome: | The proposed architecture improves learning performance and attention quality on multiple datasets. |
Copied to clipboard
| Challenge: | Extensive experiments show that MEO significantly improves computational efficiency . compared to dense networks, sparsely activated networks only employ a few parameters for each input . |
| Approach: | They propose a method that merges multiple experts into one to reduce computation costs . they demonstrate that a sparse Mixture of Experts (MoE) can reduce the cost by activating a small subset of parameters for each input . |
| Outcome: | The proposed approach reduces the computational cost to that of a single expert by 83.3% compared to 82.6% in vanilla MoE. |
Copied to clipboard
| Challenge: | Existing quantization-based approaches to knowledge Graph Completion (KGC) are incomplete. |
| Approach: | They propose a framework that generates semantically coherent discrete codes for KG entities . they introduce a Granular Semantic Enhancement module that injects hierarchical knowledge into the codebook . |
| Outcome: | The proposed framework outperforms existing text-based and embedding-based baselines in the KGC domain. |
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: | Large Language Models (LLMs) operate in a reactive mode, often resulting in efficiency issues or suboptimal performance. |
| Approach: | They propose a dual-process dialogue planning framework that leverages the dual-process theory of human cognition and a deliberative Monte Carlo Tree Search mechanism to emulate human-like conversational dynamics. |
| Outcome: | The proposed framework outperforms existing methods in achieving high-quality dialogues and operational efficiency. |
Copied to clipboard
| Challenge: | Using rank score thresholding, sparse retrieval skips the index at cluster and document levels. |
| Approach: | They propose a pruning control scheme with a probabilistic guarantee on rank-safeness competitiveness. |
| Outcome: | The proposed pruning control scheme improves accuracy and safeness while delivering low latency on single-threaded CPU. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are difficult to align with high-stakes medical standards due to dissonance between coarse-grained preference signals and complex protocols. |
| Approach: | They propose a framework that aligns Large Language Models with medical standards . they use a dataset generated via a human-in-the-loop pipeline to augment medical instructions . |
| Outcome: | The proposed framework disentangles safety constraints from general proficiency, enabling precise guidance during reinforcement learning. |
Copied to clipboard
| Challenge: | Large language models struggle to process lengthy inputs due to limited length generalization and attention’s quadratic computational demands. |
| Approach: | They propose a training-free framework that allows each head to attend to important context chunks instead of allowing each head a full sentence . |
| Outcome: | The proposed framework unlocks multi-head attention's untapped potential by allowing each head to attend to important context chunks instead of the full sentence. |
Copied to clipboard
| Challenge: | Dynamic networks can significantly improve the model’s representation power with acceptable computational cost. |
| Approach: | They propose a partially dynamic network to transform redundant dynamic parameters into static ones and iterative mode partition to partition dynamic and static parameters efficiently. |
| Outcome: | The proposed network surpasses fully dynamic networks by +0.7% top-1 acc with only 30% dynamic parameters for DY-Conv and +1.9% average score in language understanding with only 50% dynamic parameters. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been successful in understanding language and processing text, but their cost prohibits their practical applications. |
| Approach: | They propose a multi-agent collaboration method that breaks down lengthy documents into smaller, more manageable chunks and organizes the member agents to read their assigned chunks. |
| Outcome: | The proposed method achieves 16.42% and 1.63% accuracy gains over existing models on single-hop and multi-hop QA settings. |
Copied to clipboard
| Challenge: | a test suite to evaluate commonsense reasoning capability of neural machine translation is presented . language models pretrained on large-scale corpora achieve a commonsensing accuracy of lower than 72% on target translations of this test suite. |
| Approach: | They propose a test suite to evaluate the commonsense reasoning capability of neural machine translation. |
| Outcome: | The proposed test suite performs poorly on commonsense reasoning of the three ambiguity types in terms of reasoning accuracy and reasoning consistency. |
Copied to clipboard
| Challenge: | Existing knowledge-enhanced pretrained language models focus on entity information and ignore fine-grained relationships between entities. |
| Approach: | They propose to incorporate KG into the language learning process to obtain a KG-enhanced pretrained Language Model. |
| Outcome: | The proposed model improves on several knowledge-driven tasks, such as entity typing and relation classification, compared with the state-of-the-art knowledge-enhanced PLMs. |
Copied to clipboard
| Challenge: | Phonetic Cloaking Replacement (PCR) is a problem in content moderation in China. |
| Approach: | They organize PCR into a four-way surface-form taxonomy and compile PCR-ToxiCN, a dataset of 500 phonetically cloaked offensive posts gathered from the RedNote platform. |
| Outcome: | The proposed model achieves only an F1-score and zero-shot chain-of-thought prompting pushes performance even lower. |
Copied to clipboard
| Challenge: | Large language models (LLMs) generate hallucinations when handling unfamiliar information. |
| Approach: | They propose a Chinese benchmark to evaluate large language models' knowledge and reasoning capabilities in medication tasks. |
| Outcome: | The proposed benchmark evaluates models in indication, dosage and administration, contraindicated population, mechanisms of action, drug recommendation, and drug interaction across six datasets. |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) improves LLMs but faces high prefill latency during long contexts. |
| Approach: | They propose a method that uses deep-layer hidden-state norms to guide token selection . they propose to use deep-layered hidden-status norms as a proxy to guide the token selection. |
| Outcome: | The proposed SpecCache outperforms state-of-the-art (SOTA) benchmarks. |
Copied to clipboard
| Challenge: | InfiMM is a multimodal large language model that adapts to complex vision-language tasks. |
| Approach: | They present a Multimodal Large Language Model that adapts to intricate vision-language tasks using large-scale training data and comprehensive training strategies. |
| Outcome: | Empirical evaluations across a variety of benchmarks underscore InfiMM’s remarkable capability in multimodal understanding. |
Copied to clipboard
| Challenge: | Existing benchmarks primarily focus on Python and are limited in terms of language diversity. |
| Approach: | They propose a multilingual debugging benchmark that includes 3.9K test samples of 20 programming languages and introduces the debug instruction corpora MdEval-Instruct by injecting bugs into the correct multilingual queries and solutions. |
| Outcome: | The proposed benchmark includes 3.9K test samples of 20 programming languages and covers the automated program repair task, bug localization task, and bug identification task. |
Copied to clipboard
| Challenge: | Existing RL methods suffer from reliability bottlenecks due to reward sparsity and intractable computations . d-TreeRPO provides fine-grained and verifiable step-wise reward signals . |
| Approach: | They propose a reliable reinforcement learning framework for diffusion large language models that leverages tree-structured rollouts and bottom-up advantage computation based on verifiable outcome rewards. |
| Outcome: | The proposed framework outperforms baseline models and achieves significant improvements across reasoning benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for integrating knowledge graphs into pre-trained language models have been poorly implemented. |
| Approach: | They propose a self-supervised entity masking scheme that exploits relational knowledge underlying the text. |
| Outcome: | The proposed model achieves improved performance on five benchmarks, including question answering and knowledge base completion. |
Copied to clipboard
| Challenge: | Unsupervised Text Style Transfer (UTST) aims to transfer the stylistic properties of a given text without parallel text pairs. |
| Approach: | They propose a SFT-then-PPO paradigm to fine-tune an LLM with parallel data and reward functions for distinguishing stylistic intensity in hierarchical levels. |
| Outcome: | The proposed system can transfer stylistic properties without parallel text pairs even for adjacent levels of intensity. |
Copied to clipboard
| Challenge: | Neural text generation models are typically trained by maximizing log-likelihood with the sequence cross entropy (CE) loss. |
| Approach: | They propose an Edit-Invariant Sequence Loss method which computes the matching loss of a target sequence with all n-grams in the generated sequence. |
| Outcome: | The proposed method outperforms the common CE loss and strong baselines on a wide range of tasks. |
Copied to clipboard
| Challenge: | Existing studies on how SAEs derive most fine-grained latent features for safety remain unexplored. |
| Approach: | They propose a framework for interpreting SAE features in safety-critical domains . they train a suite of SAEs with human-readable explanations and systematic evaluations based on pornography, politics, violence, and terror . |
| Outcome: | The proposed framework reduces interpretation cost by 55% and improves safety-critical features. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have made significant advances in code generation, but they still face challenges when tackling complex programming tasks beyond their basic capabilities. |
| Approach: | They propose to integrate self-generated tests into the code generation process . they propose to use post-execution and in-exection self-debugging to mitigate test bias . |
| Outcome: | The proposed method improves the performance of large language models in code generation tasks by leveraging execution feedback from tests. |
Copied to clipboard
| Challenge: | Recent long-thought reasoning models adopt extended reasoning processes similar to how humans ponder over complex problems. |
| Approach: | They propose a model that uses RL-style fine-tuning to reduce inference overhead while maintaining accuracy. |
| Outcome: | The proposed model reduces inference overhead while maintaining accuracy. |
Copied to clipboard
| Challenge: | OpenAI's O1 and subsequent projects like DeepSeek R1 have significantly advanced research on complex reasoning in LLMs. |
| Approach: | They analyze existing reasoning studies from the perspective of self-evolution and summarize O1-like works from open-source projects like DeepSeek R1 and Kimi-k1.5. |
| Outcome: | The proposed models are based on open-source models and pioneer advanced methodologies like Scaling Reinforcement Learning (RL). |
Copied to clipboard
| Challenge: | Entity alignment (EA) is critical for knowledge graph (KG) integration. |
| Approach: | They propose a taxonomy that categorizes methods in three stages: data preparation, feature embedding, and alignment. |
| Outcome: | The proposed taxonomy categorizes methods in three key stages: data preparation, feature embedding, and alignment. |
Copied to clipboard
| Challenge: | Existing methods for event forecasting focus on the most probable outcomes, neglecting the intrinsic uncertainty of real-world events. |
| Approach: | They propose a reinforcement learning framework that optimizes inclusiveness and diversity of the hypothesis by integrating validity-gated score into the overall objective. |
| Outcome: | The proposed framework outperforms baselines on two real-world benchmark datasets. |
Copied to clipboard
| Challenge: | Recent studies explore the possibility of unsupervised machine translation with monolingual data only. |
| Approach: | They propose a method to mine bilingual sentences from weakly paired documents . they use word distribution-level alignments to constrain word distributions of two weakly-paired documents. |
| Outcome: | The proposed method outperforms previous results on six translation tasks using weakly paired bilingual documents and a large number of bilingual sentences. |
Copied to clipboard
| Challenge: | Neural machine translation suffers from exposure bias and error propagation problem. |
| Approach: | They conduct a series of analyses to deeply understand the accuracy drop problem . they find that the left part of the translated sentence is often better than its right part . |
| Outcome: | The results show that the left part of the translated sentence is often better than its right part in left-to-right decoding models. |
Copied to clipboard
| Challenge: | Pretrain-finetuned models are increasingly complex and require more parameters to match the performance of full fine-tuning. |
| Approach: | They propose an efficient Adapter Tuning technique that freezes pretrained language models and fine-tunes a few extra modules. |
| Outcome: | The proposed setting outperforms the standard Adapter Tuning by 80% . the proposed setting is easy to use and has a high sparse ratio . |
Copied to clipboard
| Challenge: | Existing approaches to building generalizable verifiable data are task-specific and lack a principled, universal evaluator of verifikatability. |
| Approach: | They propose a task-agnostic, strategy-guided, executably-checkable data synthesis framework that synthesizes problems, diverse candidate solutions and verification artifacts from a single source. |
| Outcome: | The proposed framework synthesizes problems, candidates, and verification artifacts from human-annotated and strategy-induced checks and iteratively discovers strategies. |
Copied to clipboard
| Challenge: | Recent studies explore approaches to synthesize instruction data with open-sourced LLMs but require high-quality human-crafted seed data. |
| Approach: | They propose an end-to-end framework to synthesize high-quality instruction data with open-sourced LLMs and sampled unlabeled documents, eliminating the need for seed data. |
| Outcome: | The proposed framework synthesizes high-quality instruction data with open-sourced LLMs and sampled unlabeled documents, eliminating the need for seed data. |
Copied to clipboard
| Challenge: | Existing pruning methods rely on sequential revisions and unreliable critique signals . Existing methods fail to detect the loss of answer-critical data . |
| Approach: | They propose a table pruning framework which transforms table pruning to gold trajectory-supervised parallel search. |
| Outcome: | The proposed framework outperforms the strongest baseline pruning framework by 3.2% on various tabular reasoning tasks. |
Copied to clipboard
| Challenge: | AutoRegressive Translation models have to generate tokens sequentially during decoding and thus suffer from high inference latency. |
| Approach: | They propose to use hidden states and word alignments to help train NART models. |
| Outcome: | The proposed model improves on the WMT14 En-De and De-En datasets but is faster in inference than the current models. |
Copied to clipboard
| Challenge: | Existing methods for supervised fine-tuning are limited due to labeled data . existing methods require long adaptation times and batch statistics are unavailable in streaming settings . |
| Approach: | They propose a plug-and-play, signer-aware Mixture-of-Experts (MoE) TTA architecture for SLT . they use a combination of lightweight MoE modules and unsupervised regularizers to decouple domain shift . |
| Outcome: | The proposed test-time adaptation outperforms existing TTA methods in sign language translation . the proposed architecture can be used in real-world deployments without labeling . |
Copied to clipboard
| Challenge: | Existing solutions for text-to-image synthesis are sensitive on textual prompts, posing a challenge for novice users. |
| Approach: | They propose a dialogue-based TIS prompt generation model that emphasizes user experience for novice users. |
| Outcome: | The proposed model emphasizes user experience for novice users . it improves user-centricity score while maintaining a competitive quality of synthesized images. |
Copied to clipboard
| Challenge: | Existing approaches for Sequence to Sequence learning have been developed . convolutional neural networks and self-attention networks are the most popular . |
| Approach: | They propose to integrate convolutional and self-attention layers into a double path network for sequence to sequence learning. |
| Outcome: | The proposed method significantly improves performance over state-of-the-art systems. |
Copied to clipboard
| Challenge: | Existing methods that rely on limited demos and out-of-demonstration (OOD) queries fail when faced with out- of-demotion queries. |
| Approach: | They propose a query-aware prompting method that elicits the inherent generalizability of large language models by query-based demo generation. |
| Outcome: | The proposed method outperforms state-of-the-art methods in the OOD setting and two public math benchmarks. |
Copied to clipboard
| Challenge: | Existing backdoor models are limited in coverage of attack, system integrity and backdoor alignment . ELBA-Bench provides over 1300 experiments encompassing 12 attack methods, 18 datasets, and 12 LLMs. |
| Approach: | They propose a framework that allows attackers to inject backdoor through parameter efficient fine-tuning or without fine-uning techniques. |
| Outcome: | ELBA-Bench provides over 1300 experiments encompassing 12 attack methods, 18 datasets, and 12 LLMs. |
Copied to clipboard
| Challenge: | Document-level relation extraction (DocRE) solves problems of document quality . number of entities and entity-pair relations increases, causing incomplete annotations . |
| Approach: | a framework that reduces the problem space using a graph-enhanced Transformer-based model is proposed . GLiM leverages large language models for reasoning to reduce the problem-space . |
| Outcome: | GLiM boosts average recall and F1 scores on biomedical datasets . compared with existing models, GLim outperforms existing models on biomedicine benchmarks compared to existing models . |
Copied to clipboard
| Challenge: | Recent studies have revealed that chain-of-thought prompting significantly enhances LLM’s reasoning capabilities, which attracts widespread attention from both academics and industry. |
| Approach: | They propose to summarize advanced methods through a taxonomy that offers novel perspectives. |
| Outcome: | The proposed method delineates the challenges and future directions, thereby shedding light on future research. |
Copied to clipboard
| Challenge: | Mixture of Experts (MoE) models have been a promising paradigm for scaling model capacity through top-k routing mechanisms. |
| Approach: | They propose a plug-and-play single-layer compensation framework that strategically inserts a lightweight trainable Hook module immediately preceding selected transformer blocks. |
| Outcome: | The proposed framework reduces the number of activated experts by more than 50% and achieves a 1.42 inference speed-up during the prefill stage. |
Copied to clipboard
| Challenge: | Existing work on multilingual neural machine translation has been neglected due to its burdensome training process. |
| Approach: | They develop a framework that clusters languages into different groups and trains one multilingual model for each cluster. |
| Outcome: | The proposed model reduces the cost of training and improves translation accuracy. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved remarkable performance on various NLP tasks, yet their potential in more challenging task like finance, has not been fully explored. |
| Approach: | They propose a benchmark to assess the financial knowledge of large language models (LLMs) in China. |
| Outcome: | The proposed benchmark is the most comprehensive evaluation benchmark to date for LLMs in finance. |
Copied to clipboard
| Challenge: | Existing methods to improve computational efficiency are under-explored and face several critical challenges. |
| Approach: | They propose a method that selectively activates only a subset of the model's layers, skipping those deemed less important. |
| Outcome: | The proposed method significantly improves performance on Attention layers and MoE layers while reducing redundant computation and memory usage. |
Copied to clipboard
| Challenge: | a new method for generating chart annotations is proposed to improve visual reasoning in multimodal large language models. |
| Approach: | They propose a code-as-intermediary translation method for distilling visual reasoning abilities from LLMs to MLLMs. |
| Outcome: | The proposed method is cost-effective, efficient and scalable. |
Copied to clipboard
| Challenge: | Sparse autoencoders (SAEs) extract interpretable and monosemantic features in large language models . prior work focused on feature extraction from a single layer, failing to capture activations that span multiple layers. |
| Approach: | They propose a framework that integrates a routing mechanism with a shared SAE to efficiently extract features from multiple layers. |
| Outcome: | The proposed framework extracts features from multiple layers while incurring minimal parameter overhead while achieving high interpretability and flexibility. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation reduces hallucination by grounding outputs in external evidence. |
| Approach: | They propose a lightweight inference-time attention intervention that amplifies evidence-aligned value states to enhance contextual faithfulness and reduce hallucination. |
| Outcome: | The proposed model reduces hallucination by grounding model outputs in external evidence. |