Papers by Meng Huang
Copied to clipboard
| Challenge: | Prior work typically decomposes inference into prefill and decode stages, with the decode stage dominating total latency. |
| Approach: | They propose an algorithm that detects threshold where information loss exceeds information gain during sparse decoding to reduce token consumption by up to 90% and a marginal accuracy degradation of less than 2%. |
| Outcome: | The proposed algorithm reduces token consumption by 90% with a marginal accuracy degradation of less than 2% across reasoning-intensive benchmarks. |
Copied to clipboard
| Challenge: | a comparative analysis of paper (meta-)reviews by large language models (LLMs) aims to identify and distinguish LLMs from human activities . |
| Approach: | They present a comparative analysis to identify and distinguish LLM activities from human activities. |
| Outcome: | The proposed analysis aims to improve recognition of instances when someone implicitly uses LLMs for reviewing activities. |
Copied to clipboard
| Challenge: | Existing data synthesis methods rely on static tools to generate queries . this approach fails to capture the implicit, event-driven nature of real-world needs . |
| Approach: | They propose a forward synthesis framework to generate high-quality financial dialogues . they construct a repository of 43,066 tools and synthesize over 148k dialogue instances . |
| Outcome: | Experiments show that models trained on FinToolSyn achieve a 21.06% improvement . the framework is designed to generate high-quality financial dialogues . |
Copied to clipboard
| Challenge: | Existing methods to improve instruction tuning for large language models may cause catastrophic forgetting (CF) CF is a problem where previously learned abilities are degraded . |
| Approach: | They propose a continual instruction tuning method that uses key-part information gain to replay data and refine training objective. |
| Outcome: | The proposed method achieves superior performance on both seen and held-out tasks. |
Copied to clipboard
| Challenge: | Existing work describes paragraph-level counter-argument generation task as paragraph-based . however, sentence-level generation can be quite different due to its unique constraints and brevity-focused challenges. |
| Approach: | They propose a benchmark framework for sentence-level counter-argument generation . they use an annotated debate forum dataset to generate high-quality counter-argments . |
| Outcome: | The proposed framework and evaluator are competitive in counter-argument generation tasks. |
Copied to clipboard
| Challenge: | Existing methods for aspect-based sentiment analysis of review text use only a few keywords describing each aspect/sentiment without using any labeled examples. |
| Approach: | They propose a weakly-supervised approach for aspect-based sentiment analysis which uses only a few keywords describing each aspect/sentiment without using any labeled examples. |
| Outcome: | The proposed method generates quality joint topics and outperforms baselines significantly on benchmark datasets. |
Copied to clipboard
| Challenge: | Existing theories of Spiral of Silence do not apply to large language models . |
| Approach: | They propose an evaluation framework for examining SoS in large language models . they consider four controlled conditions that vary the availability of "History" and "Persona" signals . |
| Outcome: | The proposed framework examines the SoS-like dynamics in large language models . it shows that history and persona together produce strong majority dominance . |
Copied to clipboard
| Challenge: | Experimental results show that Flow-matching generative models can scale training by increasing data, computational resources, and model size. |
| Approach: | They propose a flow-matching transformer with masked generative modeling for scaling text-to-audio inference-time prediction. |
| Outcome: | The proposed model scales inference-time computations by masking generation and re-predicting them through iterative decoding. |
Copied to clipboard
| Challenge: | Recent advances in large language models have led to discrete speech tokenization, but this discretization can be costly and impedes performance. |
| Approach: | They propose a new speech representation codec for semantic speech tokenization that reconstructs speech representations from speech encoders like HuBERT or data2vec. |
| Outcome: | The proposed method outperforms the widely used k-means clustering approach in speech understanding and generation. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are a widely-used decoding strategy that relies on the plurality voting rule, which focuses on the most frequent answer while overlooking all other minority responses. |
| Approach: | They propose to incorporate a ‘reflective mirror’ into the self-ensemble decoding process and enables LLMs to critically examine inconsistencies among multiple generations. |
| Outcome: | The proposed method incorporates a ‘reflective mirror’ into the self-ensemble decoding process and enables LLMs to critically examine inconsistencies among multiple generations. |
Copied to clipboard
| Challenge: | Existing supervised fine-tuning methods struggle to generalize across document types, leading to poor performance. |
| Approach: | They propose layoutRL, a reinforcement learning framework that optimizes layout understanding through composite rewards integrating normalized edit distance, paragraph count accuracy, and reading order preservation. |
| Outcome: | The proposed model outperforms specialized document parsing systems and general-purpose vision-language models on a broad range of document types, languages, and structural complexities. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can replicate insecure patterns from training data. |
| Approach: | They propose a framework that leverages distributed security-relevant cues by aggregating representations from multiple upper layers via an attention-based module. |
| Outcome: | Experiments show that the framework improves the secure-and-correct generation rate by 11.9% over baselines. |
Copied to clipboard
| Challenge: | Existing metrics for video captioning are based on text-based comparisons with ground-truth references. |
| Approach: | They propose a reference-free benchmark that assesses video captions based on their utility . they will release the benchmark to facilitate reproducible research . |
| Outcome: | The proposed benchmark improves on human-verified, fine-grained questions . it correlates significantly better with human judgments than existing metrics . |
Copied to clipboard
| Challenge: | Current text classification methods require a large number of labeled documents as training data. |
| Approach: | They propose a model that uses only the label name of each class to train classification models on unlabeled data without using any labeled examples. |
| Outcome: | The proposed model achieves 90% accuracy on four benchmark datasets using label names as the only supervision . |
Copied to clipboard
| Challenge: | Existing methods for inductive reasoning over knowledge graphs lack the ability to model the logical structures of complex queries. |
| Approach: | They propose a structure-modeled textual encoding framework for inductive logical reasoning over KGs that encodes linearized query structures and entities using pre-trained language models to find answers. |
| Outcome: | The proposed framework encodes query structures and entities using pre-trained language models to find answers. |
Copied to clipboard
| Challenge: | Existing methods for evaluating concepts from different perspectives lack a unified formalization. |
| Approach: | They propose a formal definition of concepts generalizing to diverse concept-based explanations’ settings and apply it to other types of explanations or tasks. |
| Outcome: | Extensive experimental analysis was carried out to determine the evaluation measures for explanation evaluation measures. |
Copied to clipboard
| Challenge: | Existing distillation-based approaches suffer from training-inference misalignment and fail to capture interdependencies among candidate documents. |
| Approach: | They propose a method to optimize rerankers by learning a stochastic, document-wise Top-k attention mask using the Gumbel Trick and Relaxed Top-K Sampling. |
| Outcome: | The proposed framework minimizes the overall language loss and improves recall on hotpotQA. |
Copied to clipboard
| Challenge: | Product review summarization aims to generate a concise summary based on product reviews . factual accuracy, aspect comprehensiveness, and content relevance are challenges . |
| Approach: | They propose an FB-Thinker framework to improve product review summarization ability . they propose two Chinese product review summary datasets for instruction-tuning and evaluation . |
| Outcome: | The proposed framework improves product review summarization with forward reasoning and backward refinement. |
Copied to clipboard
| Challenge: | Existing systems that provide detailed, constructive feedback on academic papers struggle with review fidelity. |
| Approach: | They explore factors that underlie the development of robust advising systems . large language models have shown remarkable progress in tasks from text generation to code synthesis . |
| Outcome: | The proposed model outperforms general-purpose language models in acceptance rates for self-ranked top-30% submissions to ICLR 2025. |
Copied to clipboard
| Challenge: | Recent QA with logical reasoning questions requires passage-level relations among the sentences. |
| Approach: | They propose a discourse-aware graph network that aggregates passage-level clues for QA by using discourse-based information. |
| Outcome: | The proposed model achieves competitive results on two logical reasoning QA datasets. |
Copied to clipboard
| Challenge: | Existing research has focused on constraint categories, offering little guidance for improving instruction following abilities. |
| Approach: | They propose a multi-dimensional constraint framework that allows for instruction following . they construct 9,106 code-verifiable samples and evaluate 18 LLMs . |
| Outcome: | The proposed framework improves instruction following performance without compromising general performance. |
Copied to clipboard
| Challenge: | Existing text embedding approaches often leverage the embeddment of the final token, typically a reserved special token such as ‘[EOS]‘. |
| Approach: | They propose to add a new training stage before contrastive learning to enrich the semantics of the final token embedding. |
| Outcome: | The proposed training stage improves performance on the Massive Text Embedding Benchmark (MTEB), achieving new state-of-the-art results across different LLM base models and scales. |
Copied to clipboard
| Challenge: | Large language models have shown remarkable performances across a wide range of tasks, but mechanisms by which they encode tasks of varying complexity remain poorly understood. |
| Approach: | They propose to explore the possibility that LLMs process concepts in different layers . they propose to categorize concepts based on their level of abstraction . |
| Outcome: | The proposed model can process complex concepts in shallow layers, the authors show . the proposed model could be used to prob complex tasks in shallow ones . |
Copied to clipboard
| Challenge: | Existing methods for long-video inference use compression or sparse attention . existing methods restrict LMMs from handling longer, more complex videos . |
| Approach: | They propose a sequence-parallel framework with optimized attention that accelerates long-video inference across multiple GPUs. |
| Outcome: | The proposed framework delivers speedups of 12.72x, 1.70x, and 1.18x over FlashAttn, ZigZagRing, and APB without significant performance loss. |
Copied to clipboard
| Challenge: | Existing approaches to multilingual retrieval-augmented generation (MRAG) use a single-turn retrieval and subsequent optimization to acquire and integrate beneficial external knowledge from multilingual collections. |
| Approach: | They propose a multilingual search-augmented reinforcement learning framework that integrates a language-coupled Group Relative Policy Optimization into the policy and reward models. |
| Outcome: | The proposed framework achieves competitive performance and is appropriate for various practical scenarios such as constrained training data and retrieval over collections encompassing a large number of languages. |
Copied to clipboard
| Challenge: | Recent studies have discussed its capability to assist language models for various applications. |
| Approach: | They propose a structure to organize arguments using the **Hi**erarchical **Ar**gumentation **G**raph (Hi-ArG) and propose two approaches to exploit Hi-AarG, including a text-graph multi-modal model GreaseArR and a framework augmented with graph information. |
| Outcome: | The proposed structure supersedes existing language models on two argumentation tasks while incorporating graph information during further training improves vanilla language models. |
Copied to clipboard
| Challenge: | MLLMs that use domain-specific data are limited in understanding cultural heritage artifacts such as ancient Greek pottery . supervised fine-tuning improves adaptation to domain knowledge, but it struggles with deeper reasoning tasks. |
| Approach: | They propose a visual question-answer tool that augments SFT with reinforcement learning using verifiable rewards. |
| Outcome: | The proposed model outperforms baseline models on reasoning-intensive questions on ancient Greek pottery. |
Copied to clipboard
| Challenge: | Existing LLMs do not possess consistent values, but many have been developed to align them at the behavioral level, including supervised fine-tuning (SFT) and reinforcement learning from human feedback (RLHF). |
| Approach: | They propose a Controlled Value Vector Activation method that directly aligns the internal values of Large Language Models by interpreting how a value is encoded in their latent representations. |
| Outcome: | The proposed method achieves highest success rate across 10 basic values without hurting model performance and fluency, and ensures target values even with opposite and potentially malicious input prompts. |
Copied to clipboard
| Challenge: | FinReporting is an agentic workflow for localized cross-jurisdiction financial reporting . existing approaches assume a single-market setting and overlook structural differences across jurisdictions . |
| Approach: | They propose a workflow that decomposes financial reporting into auditable stages . they use Large Language Models to extract and summarize corporate disclosures . |
| Outcome: | The proposed system decomposes reporting into auditable stages . it improves consistency and reliability under heterogeneous reporting regimes. |
Copied to clipboard
| Challenge: | Current Large Reasoning Models exhibit two critical limitations when processing non-English languages: (1) They struggle to maintain input-output language consistency; (2) They generally perform poorly with wrong reasoning paths and lower answer accuracy compared to English. |
| Approach: | They propose a language-consistency reward and a cross-lingual thinking alignment reward to improve the model's interpretability and accuracy. |
| Outcome: | The proposed model achieves nearly 100% language consistency and superior performance on two multilingual benchmarks (MMATH and PolyMath). |
Copied to clipboard
| Challenge: | Existing agent tuning approaches employ supervised finetuning on entire expert trajectories, but behavior-cloning of full traitories introduces expert bias and weakens generalization to states not covered by the expert data. |
| Approach: | They propose a method that finetunes LLMs on critical steps in expert trajectories and identifies and finetuns them on these steps with reduced costs. |
| Outcome: | The proposed method outperforms existing methods and open-source LLM agents on only 30% critical steps in extensive experiments. |
Copied to clipboard
| Challenge: | Existing metrics for question generation are based on human-written references . however, the results of the metrics on our study disprove the metrics themselves . |
| Approach: | They propose to use human-written references to evaluate question generation . they propose to combine criteria such as naturalness, answerability, and complexity . |
| Outcome: | The proposed model is based on multi-dimensional criteria such as naturalness, answerability, and complexity, utilizing large language models. |
Copied to clipboard
| Challenge: | Social networking services (SNS) are critical infrastructure for global interaction . supervised fine-tuning (SFT) can improve in-domain performance, but it often induces a ”seesaw” trade-off with out-of-domain robustness . |
| Approach: | They propose an SNS-oriented LLM with a progressive, RL-prioritized post-training paradigm for fast and stable adaptation. |
| Outcome: | The proposed model improves over the previous 7B model by 2.41 on average . it also yields an 8.74 average gain over its Qwen3-4B base . |
Copied to clipboard
| Challenge: | Context gates are effective to control the contributions from the source and target contexts in the recurrent neural network (RNN) based neural machine translation. |
| Approach: | They propose a method to identify source and target contexts and introduce a gate mechanism to control the contributions from source and targets in the advanced Transformer architecture. |
| Outcome: | The proposed model achieves an averaged gain of 1.0 BLEU score over a strong transformer baseline. |
Copied to clipboard
| Challenge: | Existing GNN-LLM approaches use large language models at inference time for processing text attributes, resulting in costly deployment. |
| Approach: | They propose a framework that internalizes LLM knowledge within graph models and supports inference-efficient TAG learning. |
| Outcome: | The proposed framework internalizes LLM knowledge within graph models and supports inference-efficient TAG learning. |
Copied to clipboard
| Challenge: | Existing toolsets that use large language models are limited to single-task settings. |
| Approach: | They propose a framework that dynamically constructs and evolves a hierarchical graph of reusable tools across multiple scenarios. |
| Outcome: | The proposed framework achieves up to 4.3 faster milestone completion in Minecraft compared to the previous state-of-the-art method and provides an average improvement of 9.23% over existing tool-making methods in code generation tasks and 10.03% in agent tasks. |
Copied to clipboard
| Challenge: | Large language models have achieved remarkable success in Natural Language Processing, yet their cross-lingual consistency remains a significant challenge. |
| Approach: | They propose a method to identify cross-lingual weaknesses in Large Language Models . they construct bilingual question pairs that expose performance discrepancies between English and target languages . |
| Outcome: | The proposed method uncovers over 50% accuracy drops in target languages across models. |
Copied to clipboard
| Challenge: | Existing literature on leveraging persona in large language models is disorganized and lacks a systematic taxonomy . leveraging peopleas has resurfaced as an ideal lens for adapting LLMs for specific contexts . |
| Approach: | They propose to categorize current research on leveraging persona in large language models . they propose to use a comprehensive survey to categorize existing studies . |
| Outcome: | The proposed framework is a promising framework for tailoring large language models to specific contexts. |
Copied to clipboard
| Challenge: | Existing code generation models model abstract syntax tree (AST) but not suitable for all multi-branch nodes. |
| Approach: | They propose to equip a Seq2Tree model with a branch selector to determine optimal expansion orders for multi-branch nodes. |
| Outcome: | The proposed model can determine optimal expansion orders of branches for multi-branch nodes. |
Copied to clipboard
| Challenge: | Social networking services (SNS) have experienced rapid growth, which has proposed significant challenges for platform content management and interaction quality improvement. |
| Approach: | They propose a domain-specific LLM to break the performance bottleneck of single-task baselines and establish a comprehensive foundation for social networking services. |
| Outcome: | The proposed model achieves an average improvement of 14.02% across 8 major tasks and 7.56% in bilingual evaluation benchmark, compared with baseline models. |
Copied to clipboard
| Challenge: | Existing methods for evaluating expressive speech focus on word accuracy, naturalness, signal quality, or emotional intensity at the utterance level. |
| Approach: | They propose a framework for Evaluating Expressive Appropriateness in speech that assesses whether a speech sample aligns with the underlying communicative intent implied by its discourse-level narrative context. |
| Outcome: | The proposed framework outperforms existing speech evaluation and analysis systems on a human-annotated test set. |
Copied to clipboard
| Challenge: | a number of safety concerns hinder the deployment of open-domain dialog systems, such as offensive languages and toxic behaviors, such social bias is difficult to detect. |
| Approach: | They propose a Dial-Bias Framework for analyzing social bias in conversations . they introduce a Chinese social bias dialog dataset and conduct in-depth ablation studies . |
| Outcome: | The proposed framework is the first annotated Chinese social bias dialog dataset . the proposed framework also provides a fine-grained dialog bias measurement benchmark . |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a fundamental NLP task that aims at classifying mention spans into entity types. |
| Approach: | They propose a variational memory-augmented few-shot named entity recognition model that uses a memory module to store information from source domain and retrieve relevant information from the memory to augment few-shot task in target domain. |
| Outcome: | The proposed model can adapt the learned knowledge from source domain to target domain and achieve superior performance on English and Chinese cross domain few-shot NER datasets. |
Copied to clipboard
| Challenge: | Existing studies on character-centric understanding of narratives focus on understanding the characters in the narrative, but these studies are limited to understanding only certain aspects of characters. |
| Approach: | They propose a dataset of literary pieces and their summaries paired with descriptions of characters that appear in them that are used to facilitate character-centric narrative understanding. |
| Outcome: | The proposed dataset includes literary pieces and their summaries paired with descriptions of characters that appear in them. |
Copied to clipboard
| Challenge: | Abstractive summarization models often distort or fabricate facts in articles . factual inconsistency is a common problem with abstractive summaries . |
| Approach: | They propose a fact-aware summarization model FASum to extract factual relations into the summary generation process via graph attention. |
| Outcome: | The proposed model can produce abstractive summaries with higher factual consistency compared with existing systems and corrects factual errors via modifying only a few keywords. |
Copied to clipboard
| Challenge: | Recent studies have focused on short dialogues, but mainly on short debates. |
| Approach: | They propose to use Large Language Models to construct an automated debate judge to evaluate multi-turn debates. |
| Outcome: | The proposed system improves on the PanelBench benchmark, which compares its performance to actual debate outcomes. |
Copied to clipboard
| Challenge: | Existing sentence ordering models can be classified into pairwise ordering models and set-to-sequence models. |
| Approach: | They propose a novel sentence ordering framework which introduces two classifiers to make better use of pairwise orderings for graph-based sentence ordering. |
| Outcome: | The proposed model achieves state-of-the-art performance on five commonly-used datasets. |
Copied to clipboard
| Challenge: | Offensive language detection is crucial for maintaining a civilized social media platform and deploying pre-trained language models. |
| Approach: | They propose a benchmark benchmark for Chinese offensive language analysis including a Chinese Offensive Language Dataset and a baseline detector which is trained on the dataset. |
| Outcome: | The proposed benchmark contributes to Chinese offensive language detection which is challenging for existing resources. |
Copied to clipboard
| Challenge: | Existing benchmarks rely on outcome-driven metrics such as profitability and look-ahead bias. |
| Approach: | They propose a diagnostic benchmark for instruction-grounded financial code generation under strict semantic and temporal constraints. |
| Outcome: | The proposed benchmarks show that the models fail under causal, structural, or functional constraints. |
Copied to clipboard
| Challenge: | With the rapid evolution of large language models (LLMs), many downstream NLP tasks can be well solved given appropriate prompts. |
| Approach: | They propose to integrate ChatGPT and Bing GPT3 into their applications to create a set of LLMs that can be used to generate NLP tasks with appropriate prompts. |
| Outcome: | The proposed models can be zero-shot or few-shot learners to solve specified tasks and can even be zero or few shot learners. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) often generate overconfident yet factually incorrect hallucinations. |
| Approach: | They propose a black-box-based framework that captures stubborn hallucinations by integrating internal geometric dynamics with output probability distributions. |
| Outcome: | The proposed framework outperforms white-box methods and reduces computational overhead by over 90%. |
Copied to clipboard
| Challenge: | k-Nearest-Neighbor Machine Translation (kNN-MT) is a popular research paradigm in machine translation. |
| Approach: | They propose a confidence-enhanced kNN-MT model with robust training to reduce noise . they introduce NMT confidence to refine the modeling of important components of kN-MT . |
| Outcome: | The proposed model improves on four benchmark datasets and is robust to training. |
Copied to clipboard
| Challenge: | Text-Video Retrieval (TVR) aims to align relevant video content with natural language queries. |
| Approach: | They propose to conduct efficient text-video Retrieval with a salient-and-correlated AdaPter . they propose a low-rank modulation module to refine per-image features from frozen CLIP backbone . |
| Outcome: | Experiments on four TVR datasets show that the proposed method performs better than other methods. |
Copied to clipboard
| Challenge: | Named entity recognition models require abundant high-quality annotations to train . distant supervision may induce incomplete and noisy labels, making supervised learning ineffective. |
| Approach: | They propose a noise-robust learning scheme for training named entity recognition models using only distantly-labeled data and a self-training method that uses contextualized augmentations created by pre-trained language models. |
| Outcome: | The proposed method outperforms existing supervised NER models on three datasets by significant margins. |
Copied to clipboard
| Challenge: | Existing methods for learning relational knowledge are replay-based and prioritize data uniformly . a pronounced bias towards new tasks can be caused by the introduction of new tasks . |
| Approach: | They propose a framework that decouples the process of prior information preservation and new knowledge acquisition. |
| Outcome: | Extensive experiments show that the framework outperforms baselines across two datasets. |
Copied to clipboard
| Challenge: | Recent Graph Neural Network (GNN) has been used as a promising tool in multi-hop question answering task. |
| Approach: | They propose a model of Breadth First Reasoning Graph that passes to next nodes hop by hop until all edges have been passed. |
| Outcome: | The proposed model achieves state-of-the-art on answer span prediction on hotpotQA leaderboard. |
Copied to clipboard
| Challenge: | Extensive experiments on a human-labeled golden set showed our tuned PaLM2-XS model achieved 85.56% good ratio. |
| Approach: | They propose a two-stage tuning approach to acquire the dedicated Large Language Model for the feature, followed by a reinforcement learning approach for targeted refinement. |
| Outcome: | The proposed model achieves 85.56% good quality on Rewrite and proofread tasks on human-labeled golden sets. |