Papers by Zheng Jiang
Copied to clipboard
| Challenge: | Existing methods to answer complex questions require reasoning over knowledge graphs (KGs) state-of-the-art methods constrain retrieved knowledge in local subgraphs and discard more diverse triplets that are disconnected but useful for question answering. |
| Approach: | They propose a method to retrieve the most relevant triplets from KGs and then rerank them, which are then concatenated with questions to be fed into language models. |
| Outcome: | The proposed method outperforms state-of-the-art methods on commonsenseQA and OpenbookQA datasets with 4.6% absolute accuracy. |
Copied to clipboard
| Challenge: | Existing studies have focused on the interpretability of Grammatical Error Correction (GEC) evaluation metrics, but the interpretabilty of these metrics has been neglected. |
| Approach: | They propose a reference-based metric that describes four aspects of GEC systems: hit-correction, wrong-corrections, under-correcties, and over-corrects. |
| Outcome: | The proposed metric reveals critical qualities and locates drawbacks of GEC systems. |
Copied to clipboard
| Challenge: | emergence of tool agent paradigm has broadened capability boundaries of the Large Language Model (LLM) but effectiveness of tool agents limited due to parameter failure during execution . |
| Approach: | They propose a parameter failure taxonomy to investigate parameter failure . they propose suggestions for standardizing tool return formats and improving error feedback mechanisms . |
| Outcome: | The proposed model is based on a tool agent invocation chain and a mainstream tool agent . it shows that parameter name hallucination failure stems from inherent limitations . |
Copied to clipboard
| Challenge: | Existing text watermarking methods disrupt visual-textual alignment, leaving semantic-critical concepts vulnerable. |
| Approach: | They propose a vision-aligned framework that embeds detectable watermarks into outputs . they combine localized patch affinity, global semantic coherence, contextual attention patterns . |
| Outcome: | The proposed framework shows lower PPL and higher BLEU than conventional methods with near-perfect detection (98.8% AUC). |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) is widely used to ground large language models in external knowledge and improve factual accuracy. |
| Approach: | They propose a framework that integrates neuro-symbolic verification with reinforcement learning to optimize logical consistency. |
| Outcome: | The proposed framework outperforms strong RAG baselines on hotpotQA, ASQA, and TriviaQA. |
Copied to clipboard
| Challenge: | Existing code sandboxes fail to provide accurate verification and efficiency under high-concurrency workloads. |
| Approach: | They propose a high-fidelity code verification system that provides sandbox feedback for RL training and evaluation. |
| Outcome: | The proposed system outperforms heuristic-matching baselines on LiveCodeBench and training stability on high-concurrency workloads. |
Copied to clipboard
| Challenge: | Existing work on question-answer extraction fails to integrate incomplete utterances from dialog context for composite QA retrieval. |
| Approach: | They propose a task where questions and corresponding answers might be separated across different utterances. |
| Outcome: | The proposed methods perform well on 5 customer service datasets and set a benchmark for N-to-N DialogQAE with utterance and session level evaluation metrics. |
Copied to clipboard
| Challenge: | Reinforcement learning (RL) is the main dialogue policy learning method in recent years. |
| Approach: | They propose a Gaussian Process based Deep Dyna-Q approach to dialogue policy learning . they propose evaluating the quality of experiences generated by the world model using a discriminator . |
| Outcome: | The proposed approach improves the effectiveness and efficiency of dialogue policy learning by 20% with fewer human-machine interactions. |
Copied to clipboard
| Challenge: | Existing studies focus on misspelled characters, ignoring faked characters which are more common and difficult to correct. |
| Approach: | They propose to use Chinese character checking to identify and correct wrong characters in texts by human annotation. |
| Outcome: | The proposed dataset is the first real-world visual and the largest human-crafted dataset for the Chinese character checking scenario. |
Copied to clipboard
| Challenge: | Experimental results show that, as the instruction data increases, LoRAMoE can significantly improve the ability to process downstream tasks, while maintaining the world knowledge stored in the LLM. |
| Approach: | They propose a framework that introduces several low-rank adapters and integrates them by using a router network to freeze the backbone model and force a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks. |
| Outcome: | The proposed framework freezes the backbone model and forces a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks, to alleviate world knowledge forgetting. |
Copied to clipboard
| Challenge: | Existing event extraction methods are limited to extract event arguments within the sentence scope. |
| Approach: | They propose a model which generates an entity-based directed acyclic graph to fulfill document-level EE effectively. |
| Outcome: | The proposed model can generate entity-based directed acyclic graph to fulfill document-level EE effectively. |
Copied to clipboard
| Challenge: | TexSmart supports fine-grained named entity recognition (NER) Large-scale fine-granular entity types are expected to provide richer semantic information for downstream NLP applications. |
| Approach: | They introduce TexSmart, a text understanding system that supports fine-grained named entity recognition (NER) and enhanced semantic analysis functionalities. |
| Outcome: | The proposed system supports fine-grained named entity recognition (NER) and enhanced semantic analysis functions. |
Copied to clipboard
| Challenge: | Existing preference learning methods rely heavily on curated data from humans or advanced LLMs, which is costly and difficult to scale. |
| Approach: | They propose a framework that leverages implicit preferences in unlabeled user-generated content to generate preference data. |
| Outcome: | The proposed framework transforms user-generated content into user queries and generates responses from the policy model. |
Copied to clipboard
| Challenge: | Existing LLMs often rely on complex prompting or extensive fine-tuning to introduce new capabilities while preserving strong generalizability. |
| Approach: | They propose a large-scale pre-training corpus to enhance LLM agents' capabilities . they use 103B agent-specific data encompassing 76,537 APIs . |
| Outcome: | The proposed training corpus outperforms open-source LLMs and commercial LLM agents on three agent benchmarks. |
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: | Recent advances in Vision-Language Models (VLMs) have enabled mobile agents to perceive and interact with real-world mobile environments based on human instructions. |
| Approach: | They propose a vision-language model that actively seeks human confirmation at critical decision points and a model inspired by reinforcement learning. |
| Outcome: | The proposed model achieves an improvement of 46.8% in inquiry success rate and the best overall success rate among existing baselines on InquireBench. |
Copied to clipboard
| Challenge: | Existing RAG systems struggle with the quality of retrieval documents, causing performance degradation and reducing performance. |
| Approach: | They propose a training-free RAG framework that leverages multiple LLM agents to collaboratively filter and score retrieved documents. |
| Outcome: | The proposed framework outperforms existing RAG frameworks in QA benchmarks and shows superior answer consistency and answer accuracy over baseline methods. |
Copied to clipboard
| Challenge: | Existing training data is sparse, with each document associated with one or a few labeled queries. |
| Approach: | They propose a training-free potential query retrieval framework to address this problem . they use a Gaussian mixture distribution to model all potential queries for a document . |
| Outcome: | The proposed method is able to capture comprehensive semantic information from a document with multiple queries. |
Copied to clipboard
| Challenge: | Pretrained large language models excel in a variety of natural language processing tasks . however, they pose significant security risks due to their tendency to memorize training data . |
| Approach: | They propose a method to estimate LLM memorization using dynamic, prefix-dependent soft prompts. |
| Outcome: | The proposed method can achieve maximum relative improvement of 135.3% and 39.8% over baseline compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing methods to predict missing facts in knowledge graphs are limited in language alignment . SS-AGA uses seed alignment as an edge type to fuses all KGs as a whole graph . |
| Approach: | They propose a self-supervised adaptive graph alignment method that fuses all KGs as a whole graph by regarding alignment as 'a new edge type' they propose SS-AGA method that uses relation-aware attention weights to capture potential alignment pairs in a new paradigm. |
| Outcome: | The proposed method can predict missing facts in a knowledge graph (KG) but language alignment is scarce and new alignment identification is noisy. |
Copied to clipboard
| Challenge: | Existing foundation models for tabular transactional data rely on index-based representations for categorical merchant fields. |
| Approach: | They propose a framework that uses LLM-generated embeddings as semantic initializations for lightweight transaction models. |
| Outcome: | The proposed framework improves performance on large transaction datasets. |
Copied to clipboard
| Challenge: | Existing methods for AVE are limited on rare attributes due to poor generalization ability. |
| Approach: | They propose to leverage pretraining and transfer learning to address weaknesses in existing methods. |
| Outcome: | The proposed method achieves new state-of-the-art performance without pretraining on rare attributes with limited training resources. |
Copied to clipboard
| Challenge: | Massive Open Online Courses (MOOCs) have experienced a rapid development since 2012 . many MOOC platforms have been launched, including Coursera1 , edX2 , and Udacity3 etc. |
| Approach: | They present a personal knowledge assistant system called MAssistant for MOOC learners . MAsistants has a large-scale concept graph built from open data . it also provides a browser extension which interacts with users during video lectures . |
| Outcome: | The proposed system helps users trace the concepts they have learned in MOOCs, and to build their own concept graphs. |
Copied to clipboard
| Challenge: | Existing approaches to understanding tables rely on textual inputs and table images are difficult to access in real-world scenarios. |
| Approach: | They propose a multimodal table understanding problem where the model needs to generate correct responses to various table-related requests based on the given table image. |
| Outcome: | The proposed model outperforms open-source MLLMs on 23 benchmarks under held-in and held-out settings. |
Copied to clipboard
| Challenge: | Existing studies see memorization as hindering generalization in deep learning models. |
| Approach: | They propose a long-tail theory to explain the memorization behavior of deep learning models . they use three different NLP tasks to test whether the theory holds . |
| Outcome: | The proposed long-tail theory is validated in three NLP tasks and shows it is faithful. |
Copied to clipboard
| Challenge: | Speculative decoding (SD) is a powerful and efficient way to accelerate autoregressive generation. |
| Approach: | They propose a training-free framework that recovers valid tokens discarded by standard verification . they use online correction memory and Semantic Consistency Gating to analyze rejections . |
| Outcome: | The proposed framework outperforms existing methods and achieves peak throughput speedup of 2.33x. |
Copied to clipboard
| Challenge: | Instruction-tuned language models (LMs) are increasingly deployed as interactive services across various applications. |
| Approach: | They propose a benchmark to evaluate models' ability to follow the instruction hierarchy by comparing their models to a set of benchmarks. |
| Outcome: | The proposed benchmark covers 3,538 examples across nine tasks covering cases where instructions in different priorities either align or conflict. |
Copied to clipboard
| Challenge: | Existing parameter-efficient fine-tuning methods require training a separate adapter for each user, making them computationally expensive and impractical for real-time updates. |
| Approach: | They propose a scalable framework that maps a user's profile directly to a full set of adapter parameters. |
| Outcome: | The proposed framework outperforms prompt-based personalization and OPPU while using substantially fewer computational resources at deployment. |
Copied to clipboard
| Challenge: | Recent advances in large language models have enabled generated texts to closely mimic human writing, posing significant challenges to the detection of AI-generated content. |
| Approach: | They propose a human-machine prediction discrepancy adapter for AI-generated text detection . they use a joint fine-tuning strategy and a discrepany-aware reweighting mechanism . |
| Outcome: | The proposed framework improves the detection performance of five representative models under various evaluation scenarios. |
Copied to clipboard
| Challenge: | Existing conversational search systems are usually built with two different models . this separation restricts the system from leveraging the model's intrinsic knowledge simultaneously . Existing studies for developing unified models cannot fully address the aspects of understanding conversational context, managing retrieval independently, and generating responses. |
| Approach: | They propose to unify dense retrieval and response generation for large language models in conversation by fine-tuning and mitigating data discrepancy. |
| Outcome: | The proposed model can outperform existing models on five conversational search datasets and reduce inconsistency risks while mitigating data discrepancy. |
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: | a survey of RAG-based reasoning-based approaches shows that it is not effective for multi-step inferences. |
| Approach: | They map how advanced reasoning optimizes each stage of RAG . they show how retrieved knowledge supply missing premises and expand context for complex inference . |
| Outcome: | The proposed frameworks achieve state-of-the-art across knowledge-intensive benchmarks. |
Copied to clipboard
| Challenge: | Existing Process Reward Models (PRMs) are vulnerable to reward hacking and require expensive, large-scale annotation of reasoning steps. |
| Approach: | They propose a reward model approach which evaluates both individual and consecutive reasoning steps from fine-grained and coarse-grounded level. |
| Outcome: | Empirical results show that the proposed model performs better than existing PRMs and is more robust than existing models. |
Copied to clipboard
| Challenge: | Existing datasets for open KG canonicalization only provide gold entity-level canonization for noun phrases. |
| Approach: | They propose a complete benchmark for open KG canonicalization that provides gold ontology-level canonization for relation phrases and source sentences for extraction. |
| Outcome: | The proposed method improves relation canonicalization and ontology-level canonization of the noun phrase. |
Copied to clipboard
| Challenge: | Recent efforts to accelerate inference in Multimodal Large Language Models have focused on visual token compression. |
| Approach: | They propose a framework that leverages downsampling as a discriminator to denoise existing benchmarks. |
| Outcome: | The proposed evaluation framework leverages downsampling as a discriminator to denoise existing benchmarks. |
Copied to clipboard
| Challenge: | Despite of significant achievements in improving instruction-following capabilities of large language models, the ability to process multiple potentially entangled or conflicting instructions remains a considerable challenge. |
| Approach: | They construct multi-turn instruction with 1.1K high-quality multi-turned conversations using the human-in-the-loop approach and examine their capabilities. |
| Outcome: | The proposed model shows that it is difficult to integrate multiple turns and balance competing objectives when instructions intersect or conflict. |
Copied to clipboard
| Challenge: | Large pretrained language models (LLMs) have shown surprising In-Context Learning ability. |
| Approach: | They propose a locally differentially private framework of in-context learning for LLMs that can be augmented with a private database for some specific task. |
| Outcome: | The proposed framework can predict labels without additional parameter modifications without input-label pairs . |
Copied to clipboard
| Challenge: | Vision-Language Models struggle with hallucinations, inefficient reasoning, and limited real-world validation hinders accurate perception and robust step-by-step reasoning. |
| Approach: | AgentThink integrates Chain-of-Thought reasoning with dynamic, agent-style tool invocation for autonomous driving tasks. |
| Outcome: | Experiments on the DriveLMM-o1 benchmark show AgentThink significantly boosts overall reasoning scores by 53.91% and enhances answer accuracy by 33.54% . |
Copied to clipboard
| Challenge: | Existing studies focus on posthoc alignment techniques, but the underlying safety mechanisms within LVLMs remain unexplored. |
| Approach: | They propose a tuning-free framework that leverages internal activations to enhance safety. |
| Outcome: | The proposed framework outperforms state-of-the-art methods in detecting jailbreak attacks against large vision-language models. |
Copied to clipboard
| Challenge: | Efficient instruction tuning aims to enhance the ultimate performance of large language models (LLMs) current methods suffer from the curriculum rigidity, resulting in a fixed and potentially sub-optimal learning trajectory. |
| Approach: | a framework for efficient instruction tuning is proposed to address the issue of curriculum rigidity . current methods rely on static heuristic difficulty metrics and fail to adapt to evolving capabilities . |
| Outcome: | Efficient instruction tuning aims to enhance the ultimate performance of large language models . current methods suffer from the curriculum rigidity, resulting in a fixed learning trajectory . |
Copied to clipboard
| Challenge: | Chinese Spelling Correction (CSC) is a model that detects and corrects spelling errors in given sentences. |
| Approach: | They propose a model-agnostic model with an evolving teacher model and dynamic distillation weights for knowledge transfer in each domain rather than focusing solely on new domain knowledge. |
| Outcome: | The proposed model-agnostic framework is based on an evolving teacher model and dynamic distillation weights for knowledge transfer in each domain, rather than focusing solely on new domain knowledge. |
Copied to clipboard
| Challenge: | Existing approaches for sequence labeling use a feature extractor and sequence tagger . a recent study shows that SLGAN is versatile and highly effective . |
| Approach: | They propose a framework that harnesses the capabilities of Generative Adversarial Networks to address sequence labeling challenges. |
| Outcome: | The proposed framework exhibits strong adaptability to various sequence labeling tasks. |
Copied to clipboard
| Challenge: | Existing solutions for visual document understanding lack granularity of document textlines. |
| Approach: | They propose a supervised pre-training program to leverage structural knowledge nested in document textlines to achieve fine-grained alignment between visual regions and texts. |
| Outcome: | The proposed system performs better on various VDU tasks in English and Chinese. |
Copied to clipboard
| Challenge: | Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings. |
| Approach: | They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data. |
| Outcome: | Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base. |
Copied to clipboard
| Challenge: | Current methods for training Large Language Model agents rely on static or offline critic models, which fail to adapt as the policy evolves. |
| Approach: | They propose a framework that integrates a critique and a policy to optimize the policy and critic through a synchronized co-evolutionary loop. |
| Outcome: | The proposed framework yields more stable training and higher long-horizon task success across open-world environments. |
Copied to clipboard
| Challenge: | Recent studies have shown that Large Language Models’ performance as correctors on Chinese Grammatical Error Correction (CGEC) remains unsatisfactory due to the challenging nature of the task. |
| Approach: | They propose a training framework EXAM that uses LLMs as explainers to enhance CGEC small models and a novel evaluation method SEE that utilizes LLM as evaluators to bring more reasonable evaluations. |
| Outcome: | The proposed methods improve the performance of LLMs on Chinese Grammatical Error Correction (CGEC) task. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) struggle with capturing long-distance dependencies within sequences to deeply understand semantics. |
| Approach: | They propose a system that captures relevant information within a fixed window size and provides precise answers to queries. |
| Outcome: | The proposed system can read Harry Potter within 30s and accurately answer the questions. |
Copied to clipboard
| Challenge: | Current outcome-centric verification paradigms neglect potential errors in the derivation process. |
| Approach: | They propose a process-aware RLVR training paradigm utilizing verifiers selected via **PRIME**. |
| Outcome: | The proposed approach outperforms the baseline verification paradigm on AIME24, AIME25, and Beyond-AIME models. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have evolved from statistical sequence predictors to sophisticated autonomous agents capable of reasoning, planning, and sustaining multi-turn conversa-tions. |
| Approach: | They propose a system that instantiates a "Sentient Agent" that simulates human-like emotional changes and inner thoughts to provide a more realistic evaluation of the model in multi-turn conversations. |
| Outcome: | The proposed framework measures the agent's higher-order social cognition in multi-turn conversations. |
Copied to clipboard
| Challenge: | Existing studies focus on multimodal dialogue models but neglect generation methods. |
| Approach: | They propose a multimodal dialogue response generation task which requires multimodal dialogs containing both texts and images which are difficult to obtain. |
| Outcome: | Experiments show that the proposed model can generate informative text and high-resolution image responses. |
Copied to clipboard
| Challenge: | Existing systems for conversational recommender systems (CRS) have strong results in movies, but games present distinct challenges . MATCHA framework provides specialized agents for intent parsing, tool-augmented retrieval, multi-LLM ranking, and stronger safety. |
| Approach: | They propose a framework for conversational recommender systems that assigns specialized agents for intent parsing, tool-augmented retrieval, multi-LLM ranking and risk control. |
| Outcome: | MATCHA outperforms baselines on real user request dataset, improves Hit@5 by 20%, reduces popularity bias by 24%, and achieves 97.9% adversarial defense. |
Copied to clipboard
| Challenge: | Recent studies have discovered notable disparities in their performance across different languages. |
| Approach: | They conduct a systematic investigation into the behaviors of large language models across 27 different languages on 3 different scenarios and reveals a Linguistic Map correlates with the richness of available resources and linguistic family relations. |
| Outcome: | The proposed model demonstrates that there are significant disparities in performance across languages across 27 different languages on 3 different scenarios. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) often generate hallucinations, producing outputs that are contextually inaccurate or factually incorrect. |
| Approach: | They propose a method that selects attention heads crucial to the model's prediction as inducing heads and induces hallucinations by dispersing attention of these inducers. |
| Outcome: | The proposed method significantly improves performance on tasks requiring contextual faithfulness, reading comprehension, and question answering. |
Copied to clipboard
| Challenge: | Document Structured Extraction (DSE) is a field of document structure analysis that aims to extract structured content from raw documents. |
| Approach: | They propose a benchmark to evaluate document structured extraction systems by converting unstructured PDFs into semantically rich Markdown. |
| Outcome: | The proposed benchmark is based on 3,576 diverse and real-world documents from arXiv, GitHub, and Zenodo. |
Copied to clipboard
| Challenge: | Text generated by Large Language Models (LLMs) now rivals human writing, raising concerns about its misuse. |
| Approach: | They propose a framework for sentence-level AI-generated text detection via style and context fusion. |
| Outcome: | The proposed framework outperforms baseline models in detection accuracy while exhibiting transferability and robustness. |
Copied to clipboard
| Challenge: | Existing knowledge selection models are limited by the context, but the difference between selected knowledge at different turns is often overlooked. |
| Approach: | They propose a difference-aware knowledge selection method that computes the difference between the candidate knowledge sentences provided at the current turn and those chosen in the previous turns. |
| Outcome: | The proposed method outperforms the state-of-the-art methods in a knowledge-grounded dialog. |
Copied to clipboard
| Challenge: | Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task. |
| Approach: | They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5. |
| Outcome: | The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers. |
Copied to clipboard
| Challenge: | Large vision-language models have been widely used but stereotypical biases are unexplored. |
| Approach: | They propose a framework to SCAN stereotypical bias within large vision-language models . they examine stereotype biases with respect to gender and race in three scenarios . |
| Outcome: | The proposed framework can reduce stereotypical biases in large vision-language models . the currently popular models show significant stereotype biase . |
Copied to clipboard
| Challenge: | Existing EE research uses the role-averaged evaluation metric, but it is misleading to downstream applications. |
| Approach: | They propose two new evaluation metrics that explicitly penalize wrongly identified event arguments. |
| Outcome: | The proposed evaluation metrics improve the initial evaluation by 10% . the proposed training scheme is better than the existing one, the authors show . |
Copied to clipboard
| Challenge: | Domain-specific datasets of harmful prompts are scarce and often rely on manual construction. Existing efforts to improve domain knowledge and reduce harmful prompt generation are lacking. |
| Approach: | They propose a framework that transforms domain knowledge into actionable constraints and increases the implicitness of generated harmful prompts. |
| Outcome: | The proposed framework yields high-quality datasets combining strong domain relevance with implicitness, enabling more realistic red-teaming and advancing LLM safety research. |
Copied to clipboard
| Challenge: | Existing recommendations systems are limited in generalizing to new tasks due to model scale and data size constraints. |
| Approach: | They propose an LLM-powered autonomous recommender agent, RecMind, which is capable of leveraging external knowledge to provide zero-shot personalized recommendations. |
| Outcome: | The proposed model outperforms existing zero/few-shot LLM-based recommendation baseline methods in various tasks and achieves comparable performance to a fully trained recommendation model P5. |
Copied to clipboard
| Challenge: | Existing approaches to dialog generation suffer from the over-confidence issue, which leads to poor generation diversity. |
| Approach: | They propose an Adaptive Label Smoothing approach that can adaptively estimate a target label distribution at each time step for different dialog contexts. |
| Outcome: | The proposed approach outperforms competing models on two benchmark datasets in producing diverse responses. |
Copied to clipboard
| Challenge: | Recent advances in multimodal large language models have seen remarkable progress for medical decision-making, however, they are designated for specific classification or generative tasks and require model training or finetuning on large-scale datasets with sizeable parameters and tremendous computing. |
| Approach: | They propose a framework that tackles discriminative and generative multimodal medical tasks using multimodal alignment, instruction tuning and routing. |
| Outcome: | The proposed model can achieve superior performance to or on par with state-of-the-art baselines while only requiring 30%-50% of activated model parameters. |
Copied to clipboard
| Challenge: | Emotional support is a crucial ability for many conversation scenarios, including social interactions, mental health support, and customer service chats. |
| Approach: | They propose an Emotional Support Conversation task and an ESC Framework to train emotional support into dialog systems. |
| Outcome: | The proposed framework provides an example of an Emotional Support Conversation task and shows that it is more effective than existing models. |
Copied to clipboard
| Challenge: | Existing approaches to extend chain-of-thought reasoning into large language models are not viable in the scenario of privatization deployment or limited resources. |
| Approach: | They propose a framework that extends chain-of-thought reasoning into tabular language models . framework coordinates two TaLMs responsible for CoT generation and answer inference . |
| Outcome: | The proposed framework outperforms the state-of-the-art ChatGPT on the TABMWP dataset by 9.55% (82.60%92.15% in accuracy) with less parameters (0.8B). |
Copied to clipboard
| Challenge: | Existing studies focus on evaluating large language models in close-ended QA tasks, but many clinical decisions involve answering open-ended questions without pre-set options. |
| Approach: | They construct a benchmark to better understand large language models in the clinic . they use existing datasets to evaluate LLMs in clinical situations . |
| Outcome: | The proposed model outperforms human experts in multiple medical tasks. |
Copied to clipboard
| Challenge: | Experiments show that reinforcement learning (RL) can refine the reasoning abilities of large language models (LLMs) but requires a key prerequisite: the model must already be able to generate high-utility reasoning paths with non-negligible probability. |
| Approach: | They propose a framework that uses answer-conditioned reasoning as a variational surrogate for question-only reasoning. |
| Outcome: | Experiments on 11 benchmarks and 3 models show that RAVR reduces hesitation, strengthens conclusion consolidation, and promotes problem-specific strategies in reasoning. |
Copied to clipboard
| Challenge: | Existing studies treat prompts as flat text, overlooking their internal structure, and different components within a prompt contribute unequally to robustness. |
| Approach: | They propose a framework that decomposes prompts into functional components and a method that selectively modifies components to expose component-wise vulnerabilities. |
| Outcome: | The proposed framework exposes component-wise vulnerabilities while ensuring linguistic plausibility through perplexity-based filtering. |
Copied to clipboard
| Challenge: | Existing benchmarks only evaluate model performance on tables with explicit table structures, which means headers are explicitly annotated and treated as model input during inference. |
| Approach: | They propose a new Table Question Answering (TQA) dataset with implicit and multi-type table structures that requires the model to understand tables without directly available header annotations. |
| Outcome: | The proposed framework outperforms baselines on a dataset with implicit and multi-type table structures and can handle multi-table tables including previously neglected complex tables. |
Copied to clipboard
| Challenge: | Recent interest has surged in applying natural language processing (NLP) and machine learning (ML) to evaluate language development in both first (L1) and second (L2) language acquisition. |
| Approach: | They propose to use an Indonesian corpus as a benchmark for LDA tasks and to use existing large-scale language models to improve performance. |
| Outcome: | The proposed model extracts language-independent features, relieving laborious computation and reliance on specific language. |
Copied to clipboard
| Challenge: | a dataset for many-hop evidence extraction and fact verification challenges models to reason with information from multiple Wikipedia articles. |
| Approach: | They propose a dataset for many-hop evidence extraction and fact verification . they challenge models to extract facts from Wikipedia articles relevant to a claim . |
| Outcome: | The proposed dataset shows that state-of-the-art models degrade as the number of reasoning hops increases. |
Copied to clipboard
| Challenge: | In the age of mobile internet, personal information is constantly being generated on smartphones. |
| Approach: | They propose a novel task of crafting personalized agents powered by large language models that leverage a user's smartphone memories to enhance downstream applications with LLM capabilities. |
| Outcome: | The proposed approach improves 10% over the best existing approach on a real-world dataset and improves usability. |
Copied to clipboard
| Challenge: | Prior zero-shot TTS models only mimic the speaker’s voice without further control and adjustment capabilities while prior controllable TTS systems cannot perform speaker-specific voice generation. |
| Approach: | They propose a style control module that captures codec representations corresponding to timbre, content, and style in a discrete decoupling codec space. |
| Outcome: | The proposed system can fully clone the speaker's voice and perform speech-specific adjustment and control functions. |
Copied to clipboard
| Challenge: | Existing methods for domain adaptation of abstractive dialogue summarization lack generalization ability on new domains. |
| Approach: | They propose a domain-oriented prefix-tuning model that uses a prefix module to alleviate domain entanglement and discrete prompts to guide the model to focus on key contents of dialogues. |
| Outcome: | The proposed model can be generalized to two multi-domain dialogue summarization datasets. |
Copied to clipboard
| Challenge: | Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation. |
| Approach: | They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets. |
| Outcome: | The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are powerful at question-answering but prone to hallucinations due to limited domain-specific or up-to-date knowledge. |
| Approach: | They propose a framework for IDentifying RAG properties in LLM services that integrates LLMs with retrieval systems and adds an external retriever and knowledge database to mitigate hallucinations. |
| Outcome: | The proposed framework detects RAG-enhanced LLMs with 99.97% accuracy with partial or no optional knowledge and nearly 100% when the LLM and database are known. |
Copied to clipboard
| Challenge: | Existing efforts focus on activation within ongoing dialogues, while overlooking a key real-world bottleneck. |
| Approach: | They propose a conversation starter generation system that generates personalized starters to guide users into conversation without explicit user intent. |
| Outcome: | The proposed system improves user active days by +1.84 and click-through rate by +94.25 and has been deployed in production. |
Copied to clipboard
| Challenge: | Existing methods for OOD detection are based on labeled in-domain data . detecting out-of-domain (OOD) or unknown intents is challenging . |
| Approach: | They propose a novel reassigned contrastive learning method to discriminate IND intents for over-confident OOD and an adaptive class-dependent local threshold mechanism to separate similar IND and OOD intents. |
| Outcome: | The proposed method is effective for both aspects of overconfidence issues. |
Copied to clipboard
| Challenge: | In-context learning (ICL) enables large language models to perform tasks with only a few examples as demonstrations. |
| Approach: | They propose a generative preference learning framework that leverages LLM feedback to directly optimize demonstration selection for ICL. |
| Outcome: | Experiments on 19 datasets across 11 task categories show that GenICL achieves superior performance than existing methods in selecting the most effective demonstrations. |
Copied to clipboard
| Challenge: | Existing methods for detection of misinformation generated by large language models fail to mitigate societal risks . authors propose a paradigm shift from passive detection to anticipatory mitigation strategies . existing defenses remain reactionary in an era demanding proactive defense, authors say . |
| Approach: | They propose a three-pillar approach to prevent misinformation by fortifying integrity of training data and inference reliability by embedding self-corrective mechanisms during reasoning. |
| Outcome: | The proposed framework improves existing methods in misinformation prevention by 63% . it demonstrates that existing methods exhibit false negative rates against misinformation . |
Copied to clipboard
| Challenge: | Recent work has noted that due to the extremely high cost of iterative updates of LLMs, they are often unable to answer dynamic questions well. |
| Approach: | They propose a Chinese Dynamic QA benchmark containing question-answer pairs related to the latest dynamic questions on the Chinese Internet. |
| Outcome: | The proposed benchmark will be one of the key data resources for improving LLMs’ Chinese question-answering ability in the future. |
Copied to clipboard
| Challenge: | Knowledge graph question answering (KGQA) aims to answer natural language questions using knowledge graphs. |
| Approach: | They propose a framework that retrieves refined reasoning paths and evaluates their sufficiency. |
| Outcome: | The proposed framework outperforms existing baselines while enabling small open-source LLMs to achieve competitive results without fine-tuning LLM. |
Copied to clipboard
| Challenge: | Existing studies on the ability of a model to make consistently correct predictions in the presence of perturbations have not been conducted in open-domain question answering (OpenQA). |
| Approach: | They propose a query-side contrastive loss to improve the dense passage retriever (DPR) to improve DPR training. |
| Outcome: | The proposed approach improves the density of the dense passage retriever (DPR) training set without sacrificing accuracy on standard test sets. |
Copied to clipboard
| Challenge: | Existing methods for relation classification suffer from the scarcity of manually annotated data. |
| Approach: | They propose a novel relation classification model that incorporates query representation into the encoding of novel prototypes and utilizes iteratively to achieve more interaction. |
| Outcome: | The proposed model outperforms the state-of-the-art model on two benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods for MU forget quality and model utility are not fully explored for safety in MLLMs. |
| Approach: | They propose a safety unlearning benchmark for MLLMs to measure over-forgetting . they propose MU methods to forget quality and model utility . |
| Outcome: | The proposed method reduces over-forgetting by 79.5% while maintaining forget quality and model utility. |
Copied to clipboard
| Challenge: | Existing memory-efficient methods require second-moment estimates of the per-parameter gradients to maintain their performance. |
| Approach: | They propose to use memory-efficient optimizers to reduce memory usage by preserving second-moment estimates of gradients. |
| Outcome: | The proposed method achieves fast convergence and lower memory usage across training tasks. |
Copied to clipboard
| Challenge: | Defective queries impact the robustness of conversational AI systems such as Alexa, Siri or Google Assistant. |
| Approach: | They propose a Personalized Query Rewriting system that takes into account individual preferences or unique error patterns identified from a user's historical interactions with the conversational AI. |
| Outcome: | The proposed approach has been proven on a large-scale real-world dataset and online A/B experiments. |
Copied to clipboard
| Challenge: | Existing approaches to machine reading comprehension treat documents at their hierarchical nature, ignoring their dependencies. |
| Approach: | They propose a machine reading comprehension benchmark with two-grained answers . they use graph attention networks to model documents at their hierarchical nature . |
| Outcome: | The proposed framework outperforms existing systems at long and short answer criteria. |
Copied to clipboard
| Challenge: | Prompt tuning on a few data samples presents security issues, e.g., Trojan attacks. |
| Approach: | They propose a method to transfer established data poisoning attacks directly to few-shot prompt tuning, a technique to address the poisoned imbalance issue. |
| Outcome: | The proposed method achieves an ASR of over 99% while maintaining negligible decreases in CDA. |
Copied to clipboard
| Challenge: | Existing approaches to deep search training lack high-quality training trajectories, prohibitive computational costs and lack of high-fidelity training data. |
| Approach: | They propose a framework that synthesizes high-quality training data by simulating real user interactions in live web search environments. |
| Outcome: | The proposed framework synthesizes high-quality training data by simulating user interactions in live web search environments. |
Copied to clipboard
| Challenge: | Recent advances in reasoning models have demonstrated remarkable capabilities on mathematical and coding tasks, but their effectiveness in embodied domains remains largely unexplored. |
| Approach: | They propose a reasoning model for interactive embodied tasks that synthesizes 9.3k coherent Observation-Thought-Action trajectories containing 64k ego-centric images and 90k diverse reasoning processes. |
| Outcome: | The proposed model outperforms existing visual reasoning models by +9%, 24%, and +13% on long-horizon tasks. |
Copied to clipboard
| Challenge: | Large Multimodal Models (LMMs) have demonstrated impressive performance on general video comprehension benchmarks, but their robustness needs to be thoroughly investigated for broader applications. |
| Approach: | They propose a temporal robustness benchmark which introduces temporal inconsistency perturbations separately at the visual and textual modalities to assess the robustness of models. |
| Outcome: | The proposed method improves the model’s robustness and reliability in temporal analysis. |
Copied to clipboard
| Challenge: | a key intent behind many emails is to get a reply from the recipient. |
| Approach: | They propose to model the intents, expectations, and responsiveness in email exchanges by using a dataset containing 1800 emails annotated with nuanced types of intents and expectations. |
| Outcome: | The proposed model is based on 1800 emails annotated with nuanced types of intents and expectations . it shows that social status, argumentation, and strength of social connection influence email response rates . |
Copied to clipboard
| Challenge: | examining the behaviors of Large Language Models as artificial social actors is underexplored, especially in unverifiable scenarios where conventional benchmarking has little to help improve their abilities. |
| Approach: | They propose a method to collect, compare, and reason about human and LLMs' decisions in an unverifiable scenario and use it to examine their behaviors. |
| Outcome: | The proposed method compared human and LLM decisions in an unverifiable scenario on GitHub and found that proprietary LLMs behave more like humans than open-source LLM systems. |
Copied to clipboard
| Challenge: | Clinical notes have a long time span over multiple long documents. |
| Approach: | They propose a framework to analyze clinical notes with high predictive power . they propose to combine different types of notes to improve performance . |
| Outcome: | The proposed framework could be used to extract information from clinical notes . it shows that the sample size can be optimized for large contexts . |
Copied to clipboard
| Challenge: | Existing medical Large Language Models (LLMs) follow a reactive paradigm, risking diagnostic errors by answering before seeking sufficient details. |
| Approach: | They propose a reinforcement learning framework that transitions LLMs toward a proactive paradigm, enabling them to ask clinically valuable questions before decision-making. |
| Outcome: | Experiments on partial-information medical benchmarks show that ProMed outperforms state-of-the-art methods by 6.29% on average and delivers a 54.45% gain over the reactive paradigm. |
Copied to clipboard
| Challenge: | Existing methods focus on benchmarking general instruction following while overlooking how to improve specific format following ability for small LLMs. |
| Approach: | They propose to synthesize massive datasets to improve LLMs' format following abilities by using a verifiable format following feature. |
| Outcome: | The proposed method improves the format following ability of small LLMs with about 7B parameters. |
Copied to clipboard
| Challenge: | Existing methods to augment vocabularies ignore the disparities between model representation and frequency distributions. |
| Approach: | They propose an Entropy-Consistency Word Selection method which integrates semantic and frequency metrics for vocabulary augmentation. |
| Outcome: | The proposed method improves performance for low-resource languages compared to high-resourced ones . it integrates semantic and frequency metrics for vocabulary augmentation . |
Copied to clipboard
| Challenge: | Recent Vision Language Models (VLMs) have shown tremendous promise in a wide range of realworld applications, but their size has made at-scale deployment and operation challenging due to high consumption of cloud computing resource, high latency, and expensive API calls. |
| Approach: | They propose a master–apprentice framework for collaborative inference between large and small vision language models. |
| Outcome: | The proposed framework improves reasoning performance on widely-recognized and challenging general reasoning benchmarks and specifically boosts reasoning of apprentice VLMs by 36.6%. |
Copied to clipboard
| Challenge: | Existing selection methods rely on static, heuristic quality scores and are executed only once before training. |
| Approach: | They propose a dynamic selection framework that integrates selection into every training step. |
| Outcome: | The proposed framework integrates selection into every training step. |
Copied to clipboard
| Challenge: | Extensive experiments demonstrate that treating attention as a feature map and applying convolution as . a processing method significantly enhances Transformer performance. |
| Approach: | They propose to use the convolution operator to mimic the processing methods in computer vision to treat attention as a feature map and apply it to neighboring attention scores across different heads. |
| Outcome: | The proposed model can be adapted to various attention-related models and achieves high performance. |
Copied to clipboard
| Challenge: | Developing monolingual large Pre-trained Language Models (PLMs) is shown to be very successful in handling different tasks in Natural Language Processing (NLP). |
| Approach: | They present AraMUS, the largest Arabic PLM with 11B parameters trained on 529GB of high-quality Arabic textual data. |
| Outcome: | The proposed model achieves state-of-the-art performance on a diverse set of Arabic classification and generative tasks. |
Copied to clipboard
| Challenge: | Existing text mining models are fine-tuned by fine-timing a large pre-trained language model (PLM) in downstream tasks. |
| Approach: | They propose a semi-supervised learning framework for fine-tuning a cohort of small student models generated from a large pre-trained language model using knowledge distillation. |
| Outcome: | The proposed framework outperforms baseline models on semi-supervised text classification and extractive summarization tasks while maintaining comparable performance. |
Copied to clipboard
| Challenge: | Existing approaches to training agents for visual-language models trap them in local optima, hindering exploration and error correction with the environment. |
| Approach: | They propose a hierarchical training recipe that bridges atomic action execution and strategic task completion. |
| Outcome: | The proposed training recipe bridges atomic action execution and strategic task completion. |
Copied to clipboard
| Challenge: | Vision-Language Models (VLMs) perform on par with larger models in general domain visual grounding and question-answering benchmarks. |
| Approach: | They propose a "Uncontextualized Uncommon Objects" benchmark to evaluate their performance on common datasets. |
| Outcome: | The proposed benchmark focuses on systematically testing VLMs with both large and small parameter counts on rare and specialized objects. |