Papers by Li Ming
Copied to clipboard
| Challenge: | Self-disclosure can provide psychological comfort but can also pose privacy concerns . a lack of high-quality corpora, analysis, and methods for detection is limiting research . |
| Approach: | They construct a high-quality text-image corpus on Chinese multimodal social media platforms . they analyze the distribution of self-disclosure types, modality preferences, user intent . |
| Outcome: | The proposed corpus analyzes self-disclosure behaviors on Chinese social media platforms . it fine-tunes five multimodal large language models to enhance self-discovery detection . |
Copied to clipboard
| Challenge: | Existing benchmarks and MLLMs focus on single-image input scenarios, leaving performance of ML models when handling multiple images underexplored. |
| Approach: | They propose a benchmark to evaluate fine-grained abilities of multimodal large language models in multi-image scenarios. |
| Outcome: | The proposed benchmark categorizes the multi-image abilities into three scenarios: MII, MKS and MIC. |
Copied to clipboard
| Challenge: | Existing approaches to enhance text-attributed hypergraph self-supervised learning are limited by label scarcity. |
| Approach: | They propose a data-centric approach that leverages large language models to enhance hypergraph self-supervised learning by integrating hyperedges into a self-representation framework. |
| Outcome: | The proposed approach generates informative nodes and hyperedges through multi-round interaction with LLM-based agents. |
Copied to clipboard
| Challenge: | Autoregressive (AR) decoding in large language models is latency-bounded by strictly sequential token generation. |
| Approach: | They propose a diffusion-based drafter that proposes multi-token candidates and then verifies them in parallel by the target model. |
| Outcome: | The proposed drafter generates multi-token proposals in a single forward pass while remaining compatible with standard AR verifiers. |
Copied to clipboard
| Challenge: | Reinforcement Learning with Verifiable Rewards (RLVR) has proven effective in enhancing LLMs’ short-context reasoning but falters in long-contemporal scenarios requiring precise grounding and multi-hop reasoning. |
| Approach: | They propose a framework that constructs high-difficulty, multi-hop long-context QA pairs with inherent reasoning chains to overcome this bottleneck. |
| Outcome: | The proposed framework outperforms RLVR baselines and matches frontier LLMs while using far fewer parameters. |
Copied to clipboard
| Challenge: | Existing methods rely on entity vector matching, but the purpose of the question is abstract and difficult to match with specific entities. Existing approaches rely only on entity-vector matching, and there is a problem with multi-hop reasoning. |
| Approach: | They propose a framework that constructs reasoning paths from purposes back to conditions using the KG ontology. |
| Outcome: | Experiments on the WebQSP and CWQ datasets show that ORT significantly improves the capability of large language models in knowledge graph question answering tasks (KGQA). |
Copied to clipboard
| Challenge: | Recent commercial systems such as Suno demonstrate strong capabilities in long-form song generation, but academic research remains non-reproducible due to the lack of publicly available training data. |
| Approach: | They propose a system for long-form song generation with fine-grained style conditioning that includes a licensed synthetic dataset and a song generation model, Muse. |
| Outcome: | The proposed system achieves competitive performance on phoneme error rate, text–music style similarity, and audio aesthetic quality while enabling controllable segment-level generation across different musical structures. |
Copied to clipboard
| Challenge: | Existing methods struggle to capture coherent event narratives due to fragmented descriptions . Existing approaches accumulate noise through iterative retrieval strategies that lack relevance evaluation. |
| Approach: | They propose a reflective retrieval-augmented timeline summarization with Causal-Semantic Intergration approach for open-domain timeline summarizing . |
| Outcome: | The proposed approach outperforms the best prior published approaches. |
Copied to clipboard
| Challenge: | Existing studies show that neural MT achieves much worse translation quality than statistical MT with a small number of corpora. |
| Approach: | They propose a visual pivoting method for alignment between distant language pairs . they first construct a dataset and then apply it to pre-training and fine-tuning . |
| Outcome: | The proposed method outperforms baselines on DLPs and close language pairs. |
Copied to clipboard
| Challenge: | a growing need for long document summarization datasets with 16k input is causing problems. |
| Approach: | They propose to use a dataset to analyze salient information in long document summarizations. |
| Outcome: | The proposed dataset outperforms existing models and LLMs in the distribution form of salient information and the distribution of salinal information is an indicator of quality. |
Copied to clipboard
| Challenge: | Existing methods for creating versatile MLLMs rely on joint training with paired instruction data, which is resource-intensive and challenging to extend to new modalities. |
| Approach: | They propose a new paradigm for multimodal large language models by reusing modality encoders and merging LLM parameters. |
| Outcome: | The proposed model retains the modal understanding capabilities of each original model. |
Copied to clipboard
| Challenge: | Experimental results show that pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
| Approach: | They conduct experiments on an English essay dataset using Chinese-GPT2 . they find that the model can generate better continuations by learning to generate the in the fine-tuning stage. |
| Outcome: | The pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
Copied to clipboard
| Challenge: | Existing supervised learning methods in natural language processing require large amounts of data. |
| Approach: | They propose an active learning loop that takes LLMs as annotators and puts them into an active loop to determine what to annotate efficiently. |
| Outcome: | The proposed model outperforms existing models with few-shot performance in two NLP tasks. |
Copied to clipboard
| Challenge: | Multimodal Entity Linking (MEL) is an essential task for many multimodal applications. |
| Approach: | They propose to use a human-annotated Wikipedia-based multimodal entity linking dataset to improve the quality of existing MEL models. |
| Outcome: | The proposed model uses the visual information of images more effectively than existing models. |
Copied to clipboard
| Challenge: | Existing LLMs lack sufficient controllability to generate statements supporting diverse or even controversial perspectives. |
| Approach: | They develop a pipeline that fine tunes LLMs to generate statements generated via debate. |
| Outcome: | The proposed pipeline improves the controllability of LLMs in generating statements supporting an argument the user defined in the prompt. |
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) are vital for event prediction, yet current methods face limitations. |
| Approach: | They propose a training-free Analogical Replay reasoning framework that uses LLMs to extract historical contexts and generate analogical reasoning examples as contextual inputs. |
| Outcome: | The proposed model outperforms existing training-free methods on four benchmarks. |
Copied to clipboard
| Challenge: | Existing approaches to mathematical reasoning rely on static heuristics or pre-determined reasoning strategies. |
| Approach: | They propose an adaptive framework that integrates fuzzy theory into LLM-based mathematical reasoning. |
| Outcome: | The proposed framework outperforms state-of-the-art models while offering effective and interpretable diagnostics of intermediate problem-solving states. |
Copied to clipboard
| Challenge: | Pre-trained code models have made significant strides in the field of neural code intelligence, but they are susceptible to adversarial attacks that subtly modify the input sequence and can impair generalization. |
| Approach: | They propose a set of novel robustness evaluation methods based on the intrinsic structure of the code to explore the impact of imperceptible perturbation. |
| Outcome: | The proposed methods have demonstrated their effectiveness across a wide range of models and tasks, and are able to predict the performance of perturbed models. |
Copied to clipboard
| Challenge: | Existing studies on vision-language models aligned with general human objectives have not been successful because people with diversified backgrounds have different cognition even in the same situation. |
| Approach: | They propose to characterize individuals based on the sociological concept of Role-Set and then evaluate their actions to see whether personalized alignment is achieved. |
| Outcome: | The proposed framework constructs a cognition-aware and action-based reward model for personalized alignment. |
Copied to clipboard
| Challenge: | Large language models expose reasoning traces, yet their underlying cognitive structure and steps remain difficult to identify and analyze beyond surface-level statistics. |
| Approach: | They propose a framework that explicitly abstracts reasoning traces into functional reasoning steps such as Analysis, Explore, Implement, Verify, etc. |
| Outcome: | The proposed framework reveals reproducible thinking dynamics and structural differences between reasoning and non-reasoning models, which are not apparent from token-level views. |
Copied to clipboard
| Challenge: | Existing speech codecs struggle to balance high-quality reconstruction with semantically rich representations, limiting their effectiveness in both generative and understanding tasks. |
| Approach: | They propose a neural speech codec with semantic-acoustic dual-stream quantization that disentangles semantic and acousian modeling into two dedicated streams. |
| Outcome: | The proposed codec outperforms state-of-the-art speech tokenizers in auto-propagating text-to-speech models. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown increasing power on NLP tasks. however, tuning these models for downstream tasks usually requires exorbitant costs. |
| Approach: | They propose a black-box tuning technique that optimizes task-specific prompts without accessing gradients and hidden representations. |
| Outcome: | The proposed method improves performance under few-shot learning scenarios. |
Copied to clipboard
| Challenge: | Recent advances in fine-tuning Vision-Language Models have seen the success of prompt tuning and adapter tuning. |
| Approach: | They propose a method to fine-tune CLIP without introducing any overhead of extra parameters. |
| Outcome: | The proposed method improves CLIP by 7.27% average harmonic mean accuracy. |
Copied to clipboard
| Challenge: | Existing methods for enhancing sequential recommendation use long interaction sequences, but they lack the ability to extract user preferences from long sequences. |
| Approach: | They propose a plugin that integrates LLMs to infer user preferences from interaction sequences. |
| Outcome: | The proposed algorithms improve user semantic embedding extraction and utilization on three benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods for budget-constrained tool learning have been overlooked . et al., 2023b) compared tool learning with other methods to improve performance . |
| Approach: | They propose a method for budget-constrained tool learning by creating a preferable plan under the budget constraint before utilizing the tools. |
| Outcome: | The proposed method reduces the cost of tool learning and reaches competitive Pass Rate. |
Copied to clipboard
| Challenge: | Existing studies on role-playing agents have focused on enhancing their conversational capability, role-specific knowledge and style, but there has been a gap in assessing their social intelligence. |
| Approach: | They propose a benchmark to evaluate the sociality of role-playing agents using LLMs. |
| Outcome: | The proposed benchmark is constructed from various sources and covers a wide range of 500 characters and over 6,000 question prompts and 30,800 multi-turn role-playing utterances. |
Copied to clipboard
| Challenge: | Existing studies have shown that Pretrained Language Models (PLMs) perform poorly under noise due to subword segmentation. |
| Approach: | They propose a framework for subword segmentation that provides a systematic categorization of segmentation corruption under noise and evaluation protocols by generating contrastive datasets with canonical-noisy word pairs. |
| Outcome: | The proposed framework provides a systematic categorization of segmentation corruption under noise and evaluation protocols by generating contrastive datasets with canonical-noisy word pairs. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities, but their capabilities in cryptographic decryption tasks remain underexplored. |
| Approach: | They propose a benchmark to evaluate the reasoning capabilities of large language models in cryptographic decryption tasks. |
| Outcome: | The proposed benchmark examines the reasoning capabilities of large language models in cryptographic decryption tasks. |
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 approaches to reading comprehension systems are vulnerable to adversarial attacks. |
| Approach: | They propose to use knowledge distillation to transfer knowledge from an ensemble to a single model. |
| Outcome: | The proposed methods outperform the teacher on adversarial datasets and NarrativeQA benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have made significant strides towards Artificial General Intelligence, but training them from scratch is prohibitively expensive. |
| Approach: | They propose to continuously pre-train LLMs from existing pre-trained LLM models by using a set of parameters instead of randomly initializing them. |
| Outcome: | The proposed approach saves significant resources and accelerates convergence and performance. |
Copied to clipboard
| Challenge: | Large Language Models exhibit strong capabilities in single-turn instruction following but suffer from Lost-in-Conversation (LiC) when instructions are revealed progressively in multi-turn settings, models get "Lost in Conversation" |
| Approach: | They propose a framework that encourages models to generate correct answers and judge solvability in multi-turn conversations. |
| Outcome: | The proposed framework improves models' ability to balance problem-solving with abstention . it reduces premature answering behaviors that cause lost-in-conversation (LiC) |
Copied to clipboard
| Challenge: | Existing techniques for table detection and recognition are limited to document types and layouts. |
| Approach: | They propose to build a table detection and recognition dataset with weak supervision from Word and Latex documents on the internet. |
| Outcome: | The proposed dataset contains 417K high quality labeled tables and is publicly available. |
Copied to clipboard
| Challenge: | Existing approaches focus on improving the quality of correct training data, neglecting the value contained in error data, thereby hindering the model’s reflective ability. |
| Approach: | They propose to improve LLM's reasoning ability by learning from error data and a grounded mistake augmentation method to collect representative errors. |
| Outcome: | The proposed model achieves significant performance improvements over other strong models with less than 90k data. |
Copied to clipboard
| Challenge: | Existing knowledge editing approaches struggle with sequential editing scenarios and harm the general capabilities of the model. |
| Approach: | They propose a framework that combines robust supervised fine-tuning and model merging for knowledge editing to combine supervised and supervised learning. |
| Outcome: | The proposed approach outperforms existing methods in sequential editing while preserving the original performance of the model. |
Copied to clipboard
| Challenge: | Existing multimodal large language models lack the ability to memorize, recall, and reason in sustained interactions. |
| Approach: | They propose a multimodal real-world conversation benchmark for evaluating open-ended abilities of multimodal large language models. |
| Outcome: | The proposed benchmarks show that the models perform better in open-ended conversations. |
Copied to clipboard
| Challenge: | Existing approaches to learning from errors synthesize training data by extrapolating from isolated bad cases, thereby failing to generalize the extensive patterns inherent within these cases. |
| Approach: | They propose a framework that synthesizes more generalized training data from isolated bad cases by extrapolating from isolated cases. |
| Outcome: | The proposed framework synthesizes more generalized training data to address these model weaknesses. |
Copied to clipboard
| Challenge: | Reaction Miner is a system designed to extract chemical reactions from raw scientific PDFs. |
| Approach: | They propose a system that extracts chemical reactions directly from raw scientific PDFs. |
| Outcome: | The proposed system can extract chemical reactions from raw scientific PDFs. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have enabled strong performance in long-form writing, but current training paradigms remain limited. |
| Approach: | They propose an Adaptive Curriculum Reinforcement Learning framework to advance long-form writing capabilities beyond SFT. |
| Outcome: | Experiments on 7B-scale writer models show that Writing-RL improves long-form writing performance over strong SFT baselines. |
Copied to clipboard
| Challenge: | a new technique allows paraphrase generation to be user-controlled . a user looking for cheap hotels in New York would not find the other answer helpful . |
| Approach: | They propose a method that provides a user with explicit tags that can be placed around any arbitrary segment of text to mean "don't change me!" they propose allowing user-controllable paraphrase generation by fine-tuning model that exhibits this behavior . |
| Outcome: | The proposed technique is language agnostic and tested in English and Chinese. |
Copied to clipboard
| Challenge: | Existing methods of natural language generation (NLG) rely on the extensive parameters of pretrained language models (PLMs) but their effectiveness may be compromised by insufficient domain-specific knowledge. |
| Approach: | They propose a knowledge-injected prompt encoder to incorporate domain knowledge during the training stage, thereby reducing computational overhead. |
| Outcome: | The proposed approach outperforms established baselines on real-world data in responsivity of claims and in the ability to transfer domain knowledge. |
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: | Existing charge prediction methods have shown impressive performance, but they face significant challenges when dealing with confusing charges, such as Snatch and Robbery. |
| Approach: | They propose a novel approach which introduces domain knowledge regarding constituent elements to guide the model in making judgments on confusing charges, much like a judge’s reasoning process. |
| Outcome: | The proposed approach maintains exceptional performance in imbalanced label distributions. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) lack understanding of multi-image and interleaved inputs due to the visual features encoded by frozen encoders before being fed into the LLM backbone. |
| Approach: | They propose a two phase paradigm to enable in-depth multimodal context fusion prior to feeding the features into LLMs. |
| Outcome: | The proposed paradigm boosts the performance on 7 multi-image scenarios, contributing to increments on average accuracy by 2.13% and 7.60% against strong MLLMs baselines with 3B and 11B LLMs, respectively. |
Copied to clipboard
| Challenge: | Existing neural machine translation models adopt a monotonic decoding order of either left-to-right or right-to left. |
| Approach: | They propose a method that starts decoding target words from the right side of a median word and generates words on the left. |
| Outcome: | The proposed method outperforms baseline models on three datasets. |
Copied to clipboard
| Challenge: | Existing methods for enhancing large language models lack clear metrics for evaluating data characteristics. |
| Approach: | They propose a method that integrates models, data, and tasks to refine datasets. |
| Outcome: | The proposed method achieves comparable results to full-scale fine-tuning using only half the data in mathematical tasks and exhibits strong generalization across different models and domains. |
Copied to clipboard
| Challenge: | Recent studies employ large language models as auxiliary tools for humancentered NLP. |
| Approach: | They construct a model to capture human writing preferences by fine-tuning pre-trained models with data and designing prompts to optimize the output of large language models. |
| Outcome: | The proposed model captures human writing preferences through the dimensions of length, content depth, tone & style, and summary format. |
Copied to clipboard
| Challenge: | Existing methods for Word Sense Disambiguation rely heavily on manually annotated data, which limits coverage and generalization. |
| Approach: | They propose a framework that leverages large language models as knowledge distillers to build silver-standard WSD corpora by combining generation-based distillation and annotation-based disambiguation. |
| Outcome: | The proposed framework outperforms existing methods on general-domain benchmarks by 50% on the most challenging test set and by 1000 times fewer parameters. |
Copied to clipboard
| Challenge: | Existing methods for chain-of-thought prompting rely on manual demonstrations . experimental results show that GCR outperforms baseline methods without performance degradation . |
| Approach: | They propose a method that uses random samples to generate demonstrations in zero-shot settings. |
| Outcome: | The proposed method outperforms baseline methods on ten datasets without demonstration bias. |
Copied to clipboard
| Challenge: | Existing techniques for natural language understanding and generation use autoencoding and/or autoregressive objectives to train models. |
| Approach: | They propose a self-supervised pre-training scheme that pre-trains an autoencoding and autoregressive language model on a large unlabeled corpus for generating new text conditioned on context. |
| Outcome: | The proposed scheme achieves state-of-the-art results on a variety of language generation benchmarks covering generative question answering, abstractive summarization and conversational response generation. |
Copied to clipboard
| Challenge: | Existing knowledge-aware QA models do not have commonsense and background knowledge to answer nontrivial questions. |
| Approach: | They propose a new neural model which exploits external knowledge to generate answers in natural language for a given question with context. |
| Outcome: | The proposed model improves answer quality over existing models without knowledge and knowledge-aware models, a study shows . state officials in Hawaii confirmed that president Barack Obama was born in the U.S. |
Copied to clipboard
| Challenge: | Recent studies have shown that simpler, properly tuned models are at least competitive across NLP tasks. |
| Approach: | They propose to use a table-to-text and neural question generation tasks to generate text from structured and unstructured data. |
| Outcome: | The proposed task generates biographies based on Wikipedia infoboxes . the proposed model can achieve the state of the art in both tasks . |
Copied to clipboard
| Challenge: | Existing studies on robustness to explicit noise (e.g., document semantics) but overlook implicit noise (spurious features). |
| Approach: | They propose a framework to quantify the robustness of RAGs against spurious features by integrating a data synthesis pipeline and a taxonomy. |
| Outcome: | The proposed framework quantifies the robustness of RALMs against spurious features. |
Copied to clipboard
| Challenge: | Existing approaches to improve the likelihood of sequence prediction models are based on MLE and teacher forcing. |
| Approach: | They propose a Generative Bridging Network (GBN) that extends the point-wise ground truth to a bridge distribution conditioned on it and optimizes their KL-divergence. |
| Outcome: | The proposed bridge module can improve on two recognized sequence prediction tasks and minimize learning burden. |
Copied to clipboard
| Challenge: | Existing vision-language pre-training methods use a two-step training procedure to learn visual features from image-text pairs. |
| Approach: | They propose a vision-language pre-trained model for V+L understanding and generation using a unified Transformer framework. |
| Outcome: | The proposed model can learn visual representation and semantic alignments between image and text on visual-text pairs and on visual processing tasks. |
Copied to clipboard
| Challenge: | Experimental results show that unified model outperforms other models that treat encoding and matching separately. |
| Approach: | They evaluate a unified model with Transformer layers for machine reading comprehension . they find that the model learns different modeling strategies compared with previous models . |
| Outcome: | The unified model outperforms models with Transformer layers on the machine reading comprehension task. |
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 studies on aspect extraction focus on sequence tagging models trained on human-annotated data. |
| Approach: | They propose a novel neural model capable of coupling global and local representations to discover aspect words by combining global and locale contexts. |
| Outcome: | The proposed model outperforms state-of-the-art models on laptop and restaurant reviews on two benchmarks. |
Copied to clipboard
| Challenge: | Mathematical reasoning has long been a key benchmark for evaluating large language models. |
| Approach: | They propose a framework that transforms math word problems into scalable tabular reasoning tasks. |
| Outcome: | The proposed framework transforms math word problems into scalable and verified tabular reasoning tasks. |
Copied to clipboard
| Challenge: | Entropy-Guided Stepwise Scaling (EGSS) is a novel TTS framework for software engineering tasks. |
| Approach: | They propose an entropy-guided stepwise scaling framework that balances efficiency and effectiveness through entropic-guide encoding and robust test-suite augmentation. |
| Outcome: | EGSS boosts performance by 5–10% across all evaluated models, and reduces inference-time token usage by over 28% . compared to existing methods, EGS reduces token usage and reduce inference time by over 20% . |
Copied to clipboard
| Challenge: | Existing methods for error identification often overlook validation of generated results . text-to-SQL is a technology that converts natural language questions into executable SQL queries . |
| Approach: | They propose to integrate a multi-grained error identification method into existing methods to detect SQL errors. |
| Outcome: | The proposed method can be integrated as a plugin into various methods, providing effective error identification and correction capabilities. |
Copied to clipboard
| Challenge: | Chain-of-Thought prompting has improved the reasoning capabilities of Large Language Models (LLMs) but it is ineffective or detrimental to the performance on reasoning tasks in Smaller Language Model (SLMs) with less than 10 billion parameters. |
| Approach: | They propose a Dialogue-guided Chain-of-Thought method to improve the reasoning capabilities of Large Language Models (LLMs) by generating intermediate reasoning steps in a dialogue format to guide the model to the final answer. |
| Outcome: | The proposed method can achieve significant performance gains over state-of-the-art competitors on four arithmetic reasoning datasets. |
Copied to clipboard
| Challenge: | Existing Large Language Models (LLMs) struggle with implicit modality alignment and suboptimal graph linearization. |
| Approach: | They propose a training-free, test-time adaptive framework that reframes TKG prediction as explicit evidence-driven reasoning. |
| Outcome: | ExE-LLM outperforms fully trained graph neural networks on four benchmarks . it achieves SOTA performance in inductive settings, significantly outperforming fully trained neural networks . |
Copied to clipboard
| Challenge: | Existing studies for understanding programs do not take human behaviors as reference. |
| Approach: | They propose a graph neural network model that takes human behaviors as reference in understanding programs. |
| Outcome: | The proposed model performs better on code summarization and code clone detection tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized natural language processing with impressive capabilities, but they lack domain specificity, real-time information and face challenges in solving specialized problems. |
| Approach: | They propose a multi-LLM approach that decomposes the aforementioned capabilities into a planner, caller, and summarizer. |
| Outcome: | The proposed model outperforms existing models by demonstrating its effectiveness and advantages in tool learning. |
Copied to clipboard
| Challenge: | Existing approaches to constraint-aware planning fail to enhance the model’s intrinsic focus on constraints. |
| Approach: | They propose a constraint-aware reinforcement learning framework that encourages constraint focus and penalizes neglect of LLMs. |
| Outcome: | The proposed framework outperforms existing frameworks and state-of-the-art reasoning models in a number of real-world applications. |
Copied to clipboard
| Challenge: | Existing approaches to optimize RAG generators fail to align with RAG requirements thoroughly. |
| Approach: | They propose a method for optimizing the RAG generator from multiple preference perspectives to align with RAG requirements comprehensively. |
| Outcome: | The proposed method improves the performance of RAG generators by incorporating retrieved documents into the prompt. |
Copied to clipboard
| Challenge: | Existing methods for large language model reasoning suffer from exploration collapse due to the semantic homogeneity of random rollouts. |
| Approach: | They propose to use latent policy optimization via iterative information bottleneck to optimize reasoning trajectories by diversifying reasoning . |
| Outcome: | Empirical results show that the proposed method achieves state-of-the-art performance with margins of up to 5.3% in accuracy and 7.4% in diversity metrics. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) can grasp the intention of a question and decomposing it to a series of visual recognition sub-tasks to find out the answer with the help of an agent. |
| Approach: | They propose a framework for multimodal large language models to grasp the intention of a question and decompose it into a series of visual recognition sub-tasks to find out the answer. |
| Outcome: | The proposed framework improves the accuracy of complex video-related questions by 29.6% and 17.2% on CVQA and the existing VQA datasets. |
Copied to clipboard
| Challenge: | Large language models with instruction-following capabilities are not suitable for long-tail ad hoc extraction use cases for non-expert users. |
| Approach: | They propose a task that follows instructions to extract the desired content from the associated text and present it in a structured tabular format. |
| Outcome: | The proposed paradigm outperforms existing open-source models of similar size in terms of information extraction. |
Copied to clipboard
| Challenge: | Automated theorem proving (ATP) benchmarks focus on symbolic inference but rarely involve understanding complex number combination reasoning. |
| Approach: | They propose a benchmark that requires a model to reduce a trigonometric expression with step-by-step proof and evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms. |
| Outcome: | The proposed benchmark evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms. |
Copied to clipboard
| Challenge: | Existing methods for video-text retrieval capture fine-grained semantic concepts . however, they lack the ability to capture finer-grain concepts such as objects and actions. |
| Approach: | They propose a dual-encoder architecture for fast video-text retrieval that learns lexicon representations to capture fine-grained semantics. |
| Outcome: | The proposed framework outperforms existing methods with 4.8% and 8.2% improvement on MSR-VTT and DiDeMo respectively. |
Copied to clipboard
| Challenge: | Existing retrieval methods are designed for general domains, struggling with legal knowledge, or tailored for specific legal tasks, unable to handle diverse legal knowledge types. |
| Approach: | They propose a novel retrieval method that integrates specialized knowledge into LLMs. |
| Outcome: | The proposed method can perform multiple legal retrieval tasks for LLMs. |
Copied to clipboard
| Challenge: | Existing supervised fine-tuning datasets are composed of general instructions without userspecified constraints. |
| Approach: | They propose a data augmentation method incorporating multiple constraints into the original data samples according to predefined rules to create new training tasks. |
| Outcome: | The proposed method improves LLM controllability while maintaining general instruction-following capabilities. |
Copied to clipboard
| Challenge: | Existing studies for visually-situated language understanding have shown shallow zero-shot visual text recognition ability when fed a low-resolution image with salient text information. |
| Approach: | They propose a model for universal OCR-free visually-situated language understanding based on the Multimodal Large Language Model (MLLM) their model is jointly finetuned on a wide range of visually situated language understanding tasks via a unified instruction format. |
| Outcome: | The proposed model achieves state-of-the-art ocr-free performance in 8 out of 10 visually-situated language understanding tasks across 5 domains: documents, tables, charts, natural images, and webpage screenshots. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly aligned with human preferences through Reinforcement Learning from Human Feedback (RLHF). |
| Approach: | a new study proposes a domain-informed self-consistency policy optimization extension to GRPO that addresses inter-group imbalance. |
| Outcome: | a new extension of GRPO addresses inter-group imbalance with two key innovations . the proposed method outperforms existing GR PO variants by 5% on Qwen3 models . |
Copied to clipboard
| Challenge: | Prior studies on identifying the existence or the type of complaints focus on building automatic classification models for identifying complaints. |
| Approach: | They propose to measure the intensity of complaints from text using Best-Worst Scaling method to estimate the popularity of posts on social media. |
| Outcome: | The proposed model can estimate the popularity of complaints on social media with best-worst scaling (BWS) method. |
Copied to clipboard
| Challenge: | a survey of large language models (LLMs) aims to ensure outputs adhere to human values, ethical standards, and legal norms. |
| Approach: | They present the first systematic review of TF alignment methods . they categorize them by stages of pre-decoding, in-decoder and post-decoration . |
| Outcome: | The proposed methods are based on training-free (TF) alignment techniques . they are able to be used in open-source and closed-source environments without retraining . |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) often hallucinate due to fragile, linear reasoning and weak visual grounding. |
| Approach: | They propose a framework that reformulates reasoning as a hierarchical search with self-verification and replaces linear Chain-of-Thought with a tree-search policy capable of backtracking to correct logical errors. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on hallucination and safety benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for vision-language pre-training lack high-level semantics and text is not sufficiently involved in masked modeling. |
| Approach: | They propose a semantics-enhanced cross-modal MIM framework for vision-language representation learning that harvests high-level semantics from global image features via self-supervised agreement learning and transfers them to local patch encodings by sharing the encode space. |
| Outcome: | The proposed model achieves state-of-the-art or competitive performance on multiple vision-language tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized the landscape of artificial intelligence. |
| Approach: | They propose a self-guided method to identify and select cherry samples from open-source datasets, minimizing manual curation and potential cost for instruction tuning an LLM. |
| Outcome: | The proposed method enables LLMs to identify discrepancies between expected responses and intrinsic generation capability, and a marked uptick in model training efficiency. |
Copied to clipboard
| Challenge: | Instruction tuning is critical to large language models but its success heavily relies on the training data quality. |
| Approach: | They propose a paradigm that synergizes a teacher LLM’s reflection and introspection with the data selection capability of the student LLM to automatically refine existing instruction-tuning data. |
| Outcome: | The proposed method achieves much stronger and top-tier 7B and 13B LLMs without collecting brand-new data. |
Copied to clipboard
| Challenge: | Recent work focuses on question answering based on machine reading comprehension . current approaches treat QA as extracting a consecutive piece of text to a given question. |
| Approach: | They propose a generative QA model that incorporates an extractive mechanism into a model. |
| Outcome: | The proposed model improves quality and semantic accuracy over baseline models. |
Copied to clipboard
| Challenge: | Existing multimodal large language model (MLLM) approaches struggle to align query tokens with visual–text patches, heavily relying on lengthy OCR inputs. |
| Approach: | They propose an OCR-free approach that leverages the MLLM's inherent multi-head attention for multi-patch grounding. |
| Outcome: | Empirical results show that the proposed approach outperforms existing approaches on challenging document grounding benchmarks. |
Copied to clipboard
| Challenge: | Recent advances in neural machine translation (NMT) depend on source text to generate translation. |
| Approach: | They propose to use extracted templates from tree structures as soft target templates to guide the translation procedure. |
| Outcome: | The proposed model outperforms baseline models on four benchmarks and demonstrates the effectiveness of soft target templates. |
Copied to clipboard
| Challenge: | Existing approaches to scaling up parameter counts are impractical for users with limited computational resources. |
| Approach: | They propose a decoupled parameter cycling strategy that employs a head-tail decoupling strategy to decouple the first (head) and last (tail) layers from the parameter cycling process. |
| Outcome: | The proposed approach achieves superior performance under strict parameter constraints and significantly reduces computational overhead via early exits. |
Copied to clipboard
| Challenge: | Existing research on long-context scaling in language models has focused on managing lengthy input prompts instead of producing long outputs. |
| Approach: | They propose a sequence-level curriculum learning framework that shifts a model’s focus from interpreting long chain-of-thoughts to generating them. |
| Outcome: | Experiments on rigorous reasoning benchmarks, including AIME24 and GPQA Diamond, show that the proposed approach surpasses standard fine-tuning by over 10% while maintaining robust performance on understanding tasks. |
Copied to clipboard
| Challenge: | Existing methods to fine-tune code intelligence models to individual tasks are costly and require large data sets. |
| Approach: | They propose a Transferable fine-tuning strategy for Code representation learning that uses a tunable prefix encoder to capture cross-task and cross-language transferable knowledge and apply it to downstream adaptation. |
| Outcome: | The proposed method can lead to superior performance on code-related tasks and encourage mutual reinforcement. |
Copied to clipboard
| Challenge: | Spectral properties of low/high-quality instruction and reasoning data are used to explain finetuning dynamics in large language models. |
| Approach: | They propose to analyze layer-wise gradients induced by low/high-quality instruction and reasoning data for LLM post-training. |
| Outcome: | The results show that higher-quality data are associated with lower nuclear norms and higher effective ranks. |
Copied to clipboard
| Challenge: | Text-to-Image Synthesis (TIS) is a popular task to convert natural language texts into realistic images. |
| Approach: | They propose a transformer-based Chinese text-to-image synthesizer for high-resolution image generation that incorporates linguistic and relational knowledge facts into the model to ensure better performance without the usage of ultra-large models. |
| Outcome: | The proposed model outperforms existing models in Chinese with linguistic and relational knowledge facts. |
Copied to clipboard
| Challenge: | Document-level context is crucial for speech translation due to noise from ASR . incorporating document-level contextual information into ST remains a challenge . |
| Approach: | They develop an online framework that integrates document-level context into machine translation . they use document-based modules to integrate document- level context into ST . |
| Outcome: | The proposed framework outperforms baselines in sentence and discourse metrics . it can correct ASR transcription errors and improve translation performance . |
Copied to clipboard
| Challenge: | Current instruction tuning relies on teacher models or human intervention to generate and refine the instructions and responses for training, which are costly, non-sustainable, and may lack diversity. |
| Approach: | They propose a human/model-free compositional data synthesis method that can create rich and diverse augmentations from existing instruction tuning data to enhance large language models. |
| Outcome: | The proposed method improves performance over benchmarks and reduces training costs by 80% compared with original instruction tuning. |
Copied to clipboard
| Challenge: | Existing legal judgment prediction methods only consider one case fact description as input, which may not fully utilize information in the data such as case relations and frequency. |
| Approach: | They propose a new perspective that introduces some contrastive case relations to construct case triples as input and a corresponding judgment prediction framework with case triple modeling. |
| Outcome: | The proposed framework can be used to refine encoding and decoding processes using three customized modules on two public datasets. |
Copied to clipboard
| Challenge: | Recent methods to enhance queries by generating intermediary elements can degrade retrieval performance . combining LLMs and retrievers can be difficult, resulting in unreliable or irrelevant intermediaries . |
| Approach: | They propose a framework that facilitates the coevolution of large language models and retrieval models. |
| Outcome: | The proposed framework facilitates the coevolution of LLMs and retrieval models. |
Copied to clipboard
| Challenge: | Existing context window extension methods obstruct scaling external knowledge input. |
| Approach: | They develop a multi-agent framework to overcome two core bottlenecks in existing agent orchestration designs. |
| Outcome: | The proposed framework overcomes two core bottlenecks and improves inference-time knowledge integration without longer-context training. |
Copied to clipboard
| Challenge: | Existing approaches for document layout analysis are based on rule-based or machine learning methods that ignore textual information. |
| Approach: | They present a benchmark document layout analysis dataset using a computer vision model . they build strong baselines and manually split train/dev/test sets for evaluation . |
| Outcome: | The proposed model trains on DocBank accurately recognize layout information for a variety of documents. |
Copied to clipboard
| Challenge: | Existing evaluation protocols for few-shot natural language understanding (NLU) tasks are inconsistent and hinder fair comparison and measuring progress. |
| Approach: | They propose an evaluation framework that improves previous evaluation procedures in three key aspects, i.e., test performance, dev-test correlation, and stability. |
| Outcome: | The proposed framework improves evaluation procedures in three key aspects, i.e., performance, dev-test correlation, and stability. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are too large to be fine-tuned with budget constraints and some are only accessible via APIs. |
| Approach: | They propose a pluggable Reward-Driven Contextual Adapter that integrates large language models as generators and trains them to refine the retrieved information. |
| Outcome: | The proposed method improves ReQA performance on three datasets by up to 20% compared to existing methods. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities to comprehend human intentions, engage in reasoning, and design planning-like behavior. |
| Approach: | They propose a framework that equips large language models with tool-use capabilities . they propose LLaMA and Chat-GLM as controllers, and a model-based agent framework . |
| Outcome: | The proposed framework equips open-source LLMs with tool-use capabilities . it provides a user-friendly system library with a customizable engine design . |
Copied to clipboard
| Challenge: | Protein language models pose significant risks of generating harmful sequences, e.g., viral transmissibility, drug resistance, environmental imbalances, public health crises, etc. |
| Approach: | They propose a protein-based model that integrates prior knowledge via a Protein Safety Knowledge Graph to minimize the risk of generating harmful sequences. |
| Outcome: | The proposed framework reduces the likelihood of producing hazardous sequences while maintaining high functionality. |
Copied to clipboard
| Challenge: | Existing work performs code repair and commit message generation independently. |
| Approach: | They propose a cascaded method to repair program codes and generate commit messages in a unified framework. |
| Outcome: | The proposed model significantly outperforms baselines on a buggy-fixed-commit dataset. |
Copied to clipboard
| Challenge: | Existing methods for sentence ordering tasks rely on linguistic knowledge and are domain specific. |
| Approach: | They propose a deep attentive sentence ordering network which integrates self-attention mechanism with LSTMs in the encoding of input sentences. |
| Outcome: | The proposed model outperforms the state-of-the-art models on Sentence Ordering and Order Discrimination tasks and is shown to be highly efficient. |
Copied to clipboard
| Challenge: | Existing evaluations of large language models fail to reflect fine-grained capabilities . existing benchmarks are manually curated or domain-generic, limiting scalability and alignment with real use cases. |
| Approach: | They propose a framework that allows custom construction of benchmarks from large-scale scientific data to evaluate application-specific scientific capabilities in LLMs. |
| Outcome: | The proposed framework reveals fine-grained differences in scientific capabilities that standard benchmarks overlook . it allows custom construction of benchmarks from large-scale scientific data to evaluate application-specific capabilities in LLMs. |
Copied to clipboard
| Challenge: | Text summarization is a key natural language generation task, but the high cost of inaccurate summaries raises concerns about the reliability of uncertainty estimation on text summarisation (UE-TS) evaluation methods. |
| Approach: | They propose a UE-TS benchmark that evaluates the uncertainty estimation capabilities of two large language models and one pre-trained language model on three datasets. |
| Outcome: | The proposed benchmark evaluates the uncertainty estimation capabilities of two large language models and one pre-trained language model on three datasets, with human-annotation analysis incorporated where applicable. |
Copied to clipboard
| Challenge: | Existing studies have improved the performance of Large language models on well-defined mathematical benchmarks, but they often overlook ill-defined problems. |
| Approach: | They develop a large-scale benchmark that contains over 5,000 ill-defined mathematical problems. |
| Outcome: | The proposed framework improves the accuracy of identifying unsolvable problems by at least 12% across different LLMs, thus achieving stronger robust mathematical reasoning ability. |
Copied to clipboard
| Challenge: | Existing methods to learn matching models for retrieval-based chatbots are lacking. |
| Approach: | They propose a method that uses a sequence-to-sequence architecture model as a weak annotator to judge the matching degree of unlabeled pairs and performs learning with both the weak signals and the unlabed data. |
| Outcome: | The proposed method improves on two public data sets on matching models on retrieval-based chatbots. |
Copied to clipboard
| Challenge: | Pre-Trained Models (PTMs) have reshaped the development of natural language processing (NLP) but it is not easy to obtain high-performing PTMs without a large amount of labeled training data and deploy them online with fast inference speed. |
| Approach: | They propose to make it easy to build NLP applications with knowledge-enhanced pre-training and knowledge distillation. |
| Outcome: | EasyNLP supports a comprehensive suite of NLP algorithms and features knowledge-enhanced pre-training, knowledge distillation and few-shot learning functionalities. |
Copied to clipboard
| Challenge: | Existing studies have not noticed the safety risks of large language models . authors evaluated 1,400 questions in multi-turn dialogue coreference . |
| Approach: | They are the first to evaluate LLM safety in multi-turn dialogue coreference . they created a dataset of 1,400 questions and tested five open-source models . |
| Outcome: | The study shows that model safety decreases in multi-turn dialogue coreference scenarios . the highest success rate was with the LLaMA2-Chat-7b model, while the lowest was with mistral-7B-Instruct model . |
Copied to clipboard
| Challenge: | Recent studies have shown that Chain-of-Thought (CoT) prompting can be effective on complex reasoning tasks but generates unfaithful and unfactual reasoning chains. |
| Approach: | They propose a chain-of-knowledge prompting that elicits Large Language Models to generate explicit pieces of knowledge evidence in the form of structure triple. |
| Outcome: | The proposed method improves commonsense, factual, symbolic, and arithmetic reasoning tasks by estimating the reliability of the reasoning chains in terms of factuality and faithfulness. |
Copied to clipboard
| Challenge: | Existing methods for pre-trained language models rely on noisy data, which can be expensive if all parameters are updated. |
| Approach: | They propose a self-training framework that incorporates Monte Carlo dropouts into the model and judiciously selects reliable pseudo-labeled examples based on confidence and certainty. |
| Outcome: | The proposed framework improves performance and efficiency over multiple tasks over multiple datasets. |
Copied to clipboard
| Challenge: | Existing pre-trained language models produce large sentence embeddings, resulting in performance gap between large and small models. |
| Approach: | They propose a method that augments a small Transformer encoder model with learnable projection layers to produce compact sentences while mimicking a large pre-trained language model to retain the sentence representation quality. |
| Outcome: | The proposed method achieves 2.7-4.5 points performance gain on STS and SR tasks while maintaining the quality of the pre-trained language models. |
Copied to clipboard
| Challenge: | Existing studies formalize MWP as a generation task but mathematical expressions are prone to minor mistakes. |
| Approach: | They propose a ranking task for math word problem (MWP) that learns from its own mistakes and distinguishes between correct and incorrect expressions. |
| Outcome: | The proposed model outperforms baselines on the classical Math23k dataset and is 7% higher than the state-of-the-art. |
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: | Existing knowledge-enhanced pre-trained language models (PLMs) introduce redundant factual knowledge from knowledge bases and require complex modules. |
| Approach: | They propose a knowledge prompting-based PLM framework that incorporates factual knowledge into PLMs. |
| Outcome: | The proposed framework can be flexibly combined with existing mainstream PLMs. |
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 approaches to pre-trained language models require fine-tuning on labeled datasets or manually constructing proper prompts. |
| Approach: | They propose a nonparametric prompting PLM for fully zero-shot language understanding . they compare it to previous methods for text classification and text entailment . |
| Outcome: | The proposed method outperforms previous methods on diverse tasks. |
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: | Large-scale code generation models such as Copilot and CodeT5 are expensive to train and re-train. |
| Approach: | They propose a benchmark for Continual Learning (CL) that covers a wide range of tasks with different input and output programming languages. |
| Outcome: | The proposed method improves on Prompt Pooling with Teacher Forcing, which suffers catastrophic forgetting due to stark distribution shifts in coding tasks. |
Copied to clipboard
| Challenge: | Existing methods for learning representations of structured knowledge are limited to the minority of people with technical skills. |
| Approach: | They propose a large pretraining dataset and strategy for learning representations of text, tables, and SQL code that leverages the entire context of the problem. |
| Outcome: | The proposed model improves on two SQL tasks and shows a 1.7 and 2.2 percentage point improvement over existing methods. |
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: | Existing approaches to multitask dense retrieval are not effective due to corpus inconsistency. |
| Approach: | They propose to train individual dense passage retrievers for different open-domain question-answering tasks and aggregate their predictions during test time. |
| Outcome: | The proposed method achieves state-of-the-art performance on 5 benchmark QA datasets, with up to 10% improvement in top-100 accuracy compared to a joint-training multi-task DPR on SQuAD. |
Copied to clipboard
| Challenge: | Existing methods for QA in industrial environments are inherently relational and often updated. |
| Approach: | They propose a framework that optimizes retrieval and generation through two components: Graph-aware Retrieval and evidence-constrained reinforcement learning. |
| Outcome: | Experiments on an internal advertising QA dataset show consistent gains across expert-judged dimensions including accuracy, completeness, safety, and URL validity. |
Copied to clipboard
| Challenge: | Multiparty dialog applications such as discourse parsing and meeting summarization are now mainstream research. |
| Approach: | They propose to annotate a machine reading comprehension dataset with discourse structure built over multiparty dialog using a modified Segmented Discourse Representation Theory (SDRT) style. |
| Outcome: | The proposed dataset contributes large-scale discourse dependency annotations in a modified Segmented Discourse Representation Theory (SDRT) style for all of its multiparty dialogs, and achieves only 67.7% F1 on Molweni’s questions, a 20+% significant drop as compared against its SQuAD 2.0 performance. |
Copied to clipboard
| Challenge: | Earlier studies of instruction tuning on Large Language Models focus on creating large, varied, and high-quality datasets with responses curated by human experts. |
| Approach: | They propose to use a smaller and weaker model to fine tune a larger and stronger model . they find it can largely speed up the data filtering and improve performance . |
| Outcome: | The proposed model can filter instruction data faster and better on benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for MLLMs struggle with fine-grained temporal reasoning . despite advances in video understanding, current methods struggle with time-sensitive tasks . |
| Approach: | They propose a time-stamp-aware multi-segment grounding method that enhances temporal understanding by introducing timestamps. |
| Outcome: | The proposed method outperforms existing methods on time-sensitive tasks and generalizes well across diverse temporal understanding scenarios. |
Copied to clipboard
| Challenge: | Existing approaches to learn better unsupervised sentence representations have been successful . over-smoothing problem in unsupervised sentences reduces the capacity of powerful PLMs . |
| Approach: | They propose a method to solve the over-smoothing problem in unsupervised sentence representations by combining negatives from PLMs intermediate layers. |
| Outcome: | The proposed method improves on different strong baselines on Semantic Textual Similarity and Transfer datasets. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning domain adaptation have overfitting problem in low-resource domains . lack of parallel data makes it difficult for model to learn domain-specific knowledge . |
| Approach: | They propose a Reinforcement Learning Domain Adaptation method for Neural Machine Translation that uses in-domain source monolingual data to make up for the lack of parallel data. |
| Outcome: | The proposed method can alleviate overfitting and reinforce the model to learn domain-specific knowledge. |
Copied to clipboard
| Challenge: | Unlike other data augmentation methods, thoughts of words (TOW) views next-word prediction as a core reasoning task and injects fine-grained thoughts into pre-training texts. |
| Approach: | They propose a training-time data-augmentation method called thoughts of words (TOW) that injects fine-grained thoughts directly into a next-word prediction task and teaches the model to understand how the observed next word is related to previous contexts. |
| Outcome: | The proposed method reduces model hallucination by 10% and improves reasoning performance by 7% to 9% on average. |
Copied to clipboard
| Challenge: | Recent studies have encountered limitations in leveraging large language models to generate symbolic world models. |
| Approach: | They propose a benchmarking framework based on planning domain definition language (PDDL) that employs multi-criteria, execution-based metrics for a more robust evaluation. |
| Outcome: | The proposed model outperforms models trained with large-scale reinforcement learning, but lacks the robustness needed to perform in world modeling. |
Copied to clipboard
| Challenge: | Current medical benchmarks have limitations in question design, data sources and evaluation methods. |
| Approach: | They propose a new benchmark covering five core medical areas . it includes 2,996 questions created from real-world electronic health records . |
| Outcome: | The proposed model covers five core medical areas and includes 2,996 questions created from real-world electronic health records and expert-designed clinical scenarios. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown impressive progress in mathematical problem-solving . current approaches to enhance mathematical reasoning focus on instance-level modifications . |
| Approach: | They propose a framework that enhances mathematical reasoning through cross-problem instruction synthesis. |
| Outcome: | The proposed framework boosts mathematical reasoning by 18.0 points while maintaining high data efficiency. |
Copied to clipboard
| Challenge: | toxicity evaluation tasks require annotations to accurately reflect opinions of subgroups . toxicity tasks require annotators to take the opinions of a subgroup simultaneously . |
| Approach: | They propose to use perspective taking to obtain opinions from subgroups . they propose to prompt annotators to take perspectives of contrasting subgroup simultaneously . |
| Outcome: | The proposed approach can be cost-effective and improve quality under limited budget. |
Copied to clipboard
| Challenge: | Competitive programming has become a key task for training and evaluating large language models . but test cases of competitive programming problems are often difficult to obtain . |
| Approach: | They propose an LLM-based agent system that creates high-quality test cases for competitive programming problems. |
| Outcome: | The proposed system improves code tests on a CodeContests dataset with pass/fail labels. |
Copied to clipboard
| Challenge: | Model merging is an effective technique for composing the capabilities of a multilingual model and a reasoning model. |
| Approach: | They propose a model merging framework that modulates the contribution of each source model. |
| Outcome: | Experiments show that the proposed model merging framework outperforms strong baselines on multilingual reasoning benchmarks across 21 different languages. |
Copied to clipboard
| Challenge: | Existing studies on ERC focus on context modeling but ignore representation of contextual emotional tendency. |
| Approach: | They propose to use Emoformer to extract multi-modal emotion vectors from different modalities and fuse them with sentence vector to be an emotion capsule. |
| Outcome: | The proposed model outperforms the state-of-the-art models on two benchmark datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable reasoning capabilities, but they still face challenges in knowledge-intensive multi-hop reasoning. |
| Approach: | They propose a method that uses self-critique feedback to guide iterative reasoning by enabling iteration and self-evaluation of its intermediate reasoning steps. |
| Outcome: | The proposed method surpasses the previous SOTA by 8.6% on three multi-hop reasoning datasets. |
Copied to clipboard
| Challenge: | Existing methods to train multilingual language models using pretraining tasks like mask language modeling have yielded promising results on a wide range of downstream tasks. |
| Approach: | They propose a new task to align the structural words in a parallel sentence, enhancing models’ ability to comprehend cross-lingual representations. |
| Outcome: | The proposed task improves model's ability to comprehend cross-lingual representations by increasing the frequency of negative pairings. |
Copied to clipboard
| Challenge: | In this paper, we describe our approach for the Bacteria Biotopes relation extraction subtask in the BioNLP Shared Task 2019 . |
| Approach: | They propose a novel approach for dependency graph construction based on lexical chains . they then propose 'neuro network' model which uses short-term memories and syntax information . |
| Outcome: | The proposed approach achieves the best F1 (66.3%) in the official evaluation participated by 7 teams. |
Copied to clipboard
| Challenge: | Existing methods for predicting linguistic structures require labeled data . unsupervised chunking is useful for understanding linguistic structure of human languages . |
| Approach: | They propose a knowledge-transfer approach that heuristically induces chunk labels from unsupervised parsing models and a hierarchical recurrent neural network (HRNN) they show that their approach bridges the gap between supervised and unsupervised chunking. |
| Outcome: | The proposed method bridges the gap between supervised and unsupervised chunking. |
Copied to clipboard
| Challenge: | Empirical analyses show that pre-trained sequence-to-sequence models can achieve a 16.5x model footprint compression ratio with little performance drop relative to full-precision counterparts. |
| Approach: | They propose to distill and quantize pre-trained sequence-to-sequence models to reduce memory and latency requirements. |
| Outcome: | Empirical results show that the proposed model achieves 16.5x model footprint compression ratio with little performance drop relative to full-precision counterparts on multiple summarization and QA datasets. |
Copied to clipboard
| Challenge: | Existing LLMs break down on long-horizon tasks due to unbounded context growth and accumulated errors. |
| Approach: | They propose a framework that externalizes persistent state into a file-centric state abstraction and keeps the agent’s reasoning context strictly bounded regardless of task duration. |
| Outcome: | Experiments on DeepResearch and an 80-paper literature review show that the proposed framework maintains higher long-horizon coverage than baseline models without task-specific fine-tuning. |
Copied to clipboard
| Challenge: | Empirical results show that Neural Machine Translation (NMT) performs poor on low-resource pairs especially when Z is a rare language. |
| Approach: | They propose a triangular triangulation technique to leverage bilingual data to optimize the translation performance of low-resource pairs. |
| Outcome: | Empirical results show that the proposed architecture significantly improves translation quality of rare languages on MultiUN and IWSLT2012 datasets and even better when combining back-translation methods. |
Copied to clipboard
| Challenge: | Existing research focuses on developing powerful large language models for mathematical reasoning within monolingual languages. |
| Approach: | They propose to use translation to build powerful multilingual math reasoning models . they propose different training strategies to build xMR LLMs that outperform open-source LLM . |
| Outcome: | The proposed model outperforms open-source LLMs and surpasses ChatGPT in few-shot scenarios. |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) enhances large language models by incorporating external knowledge, yet traditional singleround retrieval struggles with complex multistep reasoning. |
| Approach: | They propose a framework that introduces path-centric reward shaping for agentic RAG training. |
| Outcome: | The proposed framework improves on existing methods with an average accuracy gain of 7.7 points. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can solve complex tasks through iterative information retrieval. |
| Approach: | They propose a turn-level stage-aware policy optimization approach to solve this problem . they introduce a first-occurrence latent reward mechanism to allocate partial rewards . |
| Outcome: | Experiments show that TSPO outperforms state-of-the-art models on Qwen2.5-3B and 7B models. |
Copied to clipboard
| Challenge: | Structured knowledge grounding (SKG) uses structured knowledge to complete user requests . since inputs and outputs of SKG tasks are heterogeneous, they have been studied separately . |
| Approach: | They propose a framework that unifies 21 SKG tasks into a text-to-text format . they use unifiedSKG to benchmark T5 with different sizes . |
| Outcome: | The proposed framework unifies 21 SKG tasks into a text-to-text format . it achieves state-of-the-art performance on almost all of the 21 tasks, the authors show . |
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods are complex and require time for training and inference. |
| Approach: | They propose an atrous convolution based knowledge graph embedding method that increases feature interactions by using atrous . they evaluate method on six benchmark datasets with different evaluation metrics . |
| Outcome: | The proposed method achieves better results on six benchmark datasets than state-of-the-art methods on most evaluation metrics. |
Copied to clipboard
| Challenge: | Existing tokenizers fail to explicitly leverage historical tokenization results . large language models (LLMs) have demonstrated remarkable effectiveness across NLP tasks . |
| Approach: | They propose a tokenizer that integrates spiking neurons to explicitly leverage historical tokenization results. |
| Outcome: | The proposed tokenizer leverages historical tokenization results, but does not selectively leverage history based on contextual relevance. |
Copied to clipboard
| Challenge: | a new open-domain question answering system integrates best practices from IR with a BERT-based reader to identify answers from a large corpus of Wikipedia articles. |
| Approach: | They propose an end-to-end question answering system that integrates BERT with an IR reader. |
| Outcome: | The proposed system improves on a standard benchmark test collection. |
Copied to clipboard
| Challenge: | Recent advances in visual-language pre-trained (VLP) models have greatly improved cross-modal retrieval performance . however, the fine-grained interactions between objects from different modalities are far from well-established . e-commerce domain lacks sufficient training data and fine-granular cross-modulal knowledge . |
| Approach: | They propose a visual-language pre-trained (VLP) image-text retrieval model that integrates cross-modal knowledge into the model to improve performance. |
| Outcome: | The proposed model improves performance on e-commerce image-text retrieval task by a large margin. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are a promising new approach to understanding biological sequences such as proteins. |
| Approach: | They propose an LLM that can generate protein sequences in human and protein languages by pre-training an Lm on protein and natural language corpora and supervised instruction tuning to facilitate alignment. |
| Outcome: | The proposed model outperforms state-of-the-art LLMs on protein-text generation tasks by a large margin. |
Copied to clipboard
| Challenge: | Existing approaches to solving mathematical problems fall into two broad categories: informal methods and formal methods. |
| Approach: | They propose to use LLM natural-language reasoning to discover answers . they introduce Discover And Prove framework that rewrites Hard Mode statements into Easy Mode ones for existing ATP provers. |
| Outcome: | The proposed framework can be used to prove hard mode statements on ATP benchmarks. |
Copied to clipboard
| Challenge: | Sentence-level translation, document-level and terminology constrained translations are important in machine translation. |
| Approach: | They propose a multi-task machine translation model that integrates translation memory sentences . they propose 'in-context learning' paradigm that allows translation-specific context learning . |
| Outcome: | The proposed model improves translation memory, document-level translation, and document-constrained translation tasks. |
Copied to clipboard
| Challenge: | Existing CodePTMs are mainly structure-free and structurebased, but how to fine-tune them remains a challenge. |
| Approach: | They propose a plug-and-play fine-tuning method that incorporates structural knowledge into pre-trained code models. |
| Outcome: | The proposed method can benefit CodePTMs more with limited training data. |
Copied to clipboard
| Challenge: | Large Reasoning Models (LRMs) generate extensive chain-of-thought reasoning, but we lack a principled framework for understanding how these thoughts are structured. |
| Approach: | They propose a method to analyze the reasoning traces of Large Reasoning Models using Schoenfeld’s Episode Theory. |
| Outcome: | The proposed framework provides a theoretically grounded methodology for interpreting LRM cognition and enables future work on more controllable and transparent reasoning systems. |
Copied to clipboard
| Challenge: | Existing efforts to improve medical question answering performance follow two directions. |
| Approach: | They propose a framework that combines a generalist with a domain-specific specialist without any model fine-tuning or parameter updates. |
| Outcome: | The proposed framework boosts GPT-4o accuracy by 13.8%, deepseek-R1 by 16.8%, and improves a vanilla 7B model from 14.1% to 23.9%. |
Copied to clipboard
| Challenge: | Existing pre-trained language models focus on text-only representation, neglecting cell-level layout information. |
| Approach: | They propose a pre-training approach to leverage cell and layout information from scanned documents. |
| Outcome: | The proposed model achieves state-of-the-art in various downstream tasks . it uses 2Dposition embeddings to model word-level layout information . |
Copied to clipboard
| Challenge: | Legal judgment prediction (LJP) is an essential task for legal AI, aiming at predicting judgments based on the facts of a case. |
| Approach: | They propose a knowledge-enhanced approach that incorporates 'label-level knowledge' to enhance the representation of case facts for each task and 'task-level' knowledge to improve synergy. |
| Outcome: | The proposed method is effective in comparison to state-of-the-art (SOTA) baselines. |
Copied to clipboard
| Challenge: | Existing studies show that causal language models lack expressiveness due to poor discrimination ability. |
| Approach: | They propose a contrastive learning framework that enhances discrimination of representations and bridges the gap with encoder-only models. |
| Outcome: | The proposed framework improves discrimination and source code generation capabilities on a variety of downstream tasks. |
Copied to clipboard
| Challenge: | Existing work on cross-lingual summarization (CLS) does not consider crosslingual sources for summarizing. |
| Approach: | They propose a cross-lingual conversation summarization benchmark that explicitly considers source context. |
| Outcome: | The proposed method surpasses baselines on ConvSumX and 3 widely-used manual annotations. |
Copied to clipboard
| Challenge: | Existing pre-trained vision-language models suffer from inefficiency and linguistic signal overwhelmed by long visual sequences in cross-modal alignment. |
| Approach: | They propose a vision-language foundation model with cross-modal skip-connections that can be pre-trained end-to-end on large-scale image-text pairs with both discriminative and generative objectives. |
| Outcome: | The proposed model achieves state-of-the-art results on a wide range of vision-language downstream tasks, including image captioning, image-text retrieval, visual grounding and visual question answering. |
Copied to clipboard
| Challenge: | Accurate estimation of item (question or task) difficulty suffers from the cold start problem. |
| Approach: | They propose to use large-scale empirical analysis to examine human-AI Difficulty Alignment . they find that models struggle to simulate the capability limitations of students . |
| Outcome: | The proposed model size is not reliably helpful for human-AI alignment . high performance often impedes accurate difficulty estimation, the authors say . |
Copied to clipboard
| Challenge: | Code pre-trained models have been proposed and widely applied in the domain of code intelligence. |
| Approach: | They propose a method that uses a plug-and-play graph neural network module as a tunable prefix to exploit structural information of source code. |
| Outcome: | The proposed method exploits structural information of source code and could replace full fine-tuning. |
Copied to clipboard
| Challenge: | Existing document understanding models focus on single-modal inputs such as images or texts. |
| Approach: | They propose to use a spatial-aware adapter to adapt transformer-based language models to document domain to exploit multi-modal information. |
| Outcome: | The proposed model significantly improves the OOD detection performance compared to using a standard language model and to competitive baselines. |
Copied to clipboard
| Challenge: | Existing code pre-trained models fail to consider inherent characteristics of codes . Existing methods to interpret code pretrained model fail to take into account inherent characteristics . |
| Approach: | They propose a probing method to quantitatively interpret how CodePTMs attend code structure. |
| Outcome: | The proposed method denoises input code sequences and measures commonality between token-level attention scores and pair-wise distances between corresponding AST nodes. |
Copied to clipboard
| Challenge: | Existing work generates long videos segment by segment sequentially, which is inefficient. |
| Approach: | They propose a Diffusion over Difference architecture for eXtremely Long video generation. |
| Outcome: | The proposed architecture reduces the average inference time from 7.55min to 26s (94.26%) and generates high-quality long videos with both global and local coherence. |
Copied to clipboard
| Challenge: | Chinese spelling correction (CSC) is a crucial task that aims to correct character errors in text. |
| Approach: | They propose a task that handles missing and redundant characters and an additional prompt-based large language model to improve performance. |
| Outcome: | The proposed task is based on a high-quality dataset and a prompt-based large language model. |
Copied to clipboard
| Challenge: | Xu et al., 2024) study shows that slow thinking can distinguish correct and irrelevant reasoning paths. |
| Approach: | They investigate how fast vs. slow thinking affects layer-wise gradients in large language models . they find that slow thinking can distinguish correct and irrelevant reasoning paths . |
| Outcome: | The results show that slow thinking can distinguish correct and irrelevant reasoning paths. |
Copied to clipboard
| Challenge: | Recent studies have explored using large language models to generate synthetic datasets . however, the effectiveness of the LLM-generated synthetic data is inconsistent across different classification tasks. |
| Approach: | They propose to use large language models to generate synthetic datasets to better understand factors that moderate the effectiveness of LLM-generated synthetic data. |
| Outcome: | The results show that subjectivity is negatively associated with the performance of the model trained on synthetic data. |
Copied to clipboard
| Challenge: | QA-LIGN decomposes monolithic rewards into interpretable principle-specific evaluations . scalar rewards obscure which objectives drive the training signal . |
| Approach: | a new method decomposes monolithic rewards into interpretable principle-specific evaluations . QA-LIGN reduces attack success rates by up to 68.7% while maintaining a 0.67% false refusal rate . |
| Outcome: | QA-LIGN reduces attack success rates by up to 68.7% while maintaining a 0.67% false refusal rate . the results outperform DPO and GRPO with state-of-the-art reward models given equivalent training . |
Copied to clipboard
| Challenge: | Experimental results show that the MOS-aware GRM significantly improves fine-grained speech quality discrimination. |
| Approach: | They propose a MOS-aware reward model that incorporates MOS gap into reward function during reinforcement learning. |
| Outcome: | The proposed model significantly improves fine-grained speech quality discrimination. |
Copied to clipboard
| Challenge: | e-commerce companies often have the option of escalating complaints by filing grievances with a government authority . this is detrimental to an ecommerce company, but this problem is challenging to solve by integrating recurrent neural networks with manually-engineered features. |
| Approach: | They propose a model that integrates recurrent neural networks with manually-engineered features to identify cases where the customer expresses such an intent. |
| Outcome: | The proposed model outperforms baseline models and provides better recall and triage for specialized agents. |
Copied to clipboard
| Challenge: | Existing vision-and-language pre-training models suffer from long visual sequences . experimental results show that TRIPS gains a speedup of 40% over previous similar VLP models . |
| Approach: | They propose an efficient vision-and-language pre-training model with text-relevant image patch selection, TRIPS, which reduces the visual sequence progressively with a text-guided patch-selection layer in the visual backbone for efficient training and inference. |
| Outcome: | The proposed model can speed up training and inference by 40% over previous models. |
Copied to clipboard
| Challenge: | Existing methods to predict the start and end positions of answer spans generate two probability vectors. |
| Approach: | They propose a method that extends the probability vector to a probability matrix. |
| Outcome: | The proposed method improves on SQuAD 1.1 and three other question answering benchmarks. |
Copied to clipboard
| Challenge: | Recent advances in generative AI technologies like large language models have boosted the incorporation of AI assistance in writing workflows. |
| Approach: | They conduct an experimental study to determine whether disclosure of AI assistance in the writing process would affect people's evaluation on the quality of the writing and ranking of different writings. |
| Outcome: | The disclosure of AI assistance decreases the average quality ratings for argumentative essays and creative stories, and increases the quality of the writings. |
Copied to clipboard
| Challenge: | Existing prompt-based NER models fail to detect entity boundaries, causing performance degradation. |
| Approach: | They propose a model which consists of a BART encoder and a parabiotic decoder and propose ' boundary expansion strategy' to enhance the model's capability in entity type classification. |
| Outcome: | The proposed model can achieve significant performance gains over state-of-the-art models. |
Copied to clipboard
| Challenge: | Large pre-trained language models (PLMs) are expensive and may not be open-sourced due to commercial considerations and potential risks of misuse. |
| Approach: | They propose to introduce gradient descent into black-box tuning scenario . they propose a method which integrates gradient descent and derivative-free optimization . |
| Outcome: | The proposed method achieves significant performance gains over previous state-of-the-art methods. |
Copied to clipboard
| Challenge: | Multiple-choice question answering (MCQA) is widely used to assess the understanding capability of Large Multimodal Models (LMMs). |
| Approach: | They propose a task to evaluate the robust understanding capability of Large Multimodal Models (LMMs) they introduce a benchmark to assess performance across various ability dimensions . |
| Outcome: | The proposed model can withhold answers when encountering unsolvable problems of MCQA, proving it understands the answer. |
Copied to clipboard
| Challenge: | Existing sparse self-attention fine-tuning models have been used to improve sentiment analysis, question answering, and natural language inference tasks. |
| Approach: | They propose a Sparse Self-Attention Fine-tuning model which integrates sparsity into self-attention mechanism to enhance the fine-tune performance of BERT. |
| Outcome: | The proposed model outperforms the baseline models on sentiment analysis, question answering, and natural language inference tasks and is able to interpret the input better. |
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: | Existing models perform poorly on many languages and cross-lingual tasks due to typological differences and contradictions between some languages. |
| Approach: | They propose to pre-train multilingual pre-trained models to handle cross-lingual tasks in one model. |
| Outcome: | The proposed model improves performance on cross-lingual tasks compared to baselines on multiple languages . |
Copied to clipboard
| Challenge: | Large Language Models have demonstrated impressive capabilities in text generation but raise concerns regarding potential copyright infringement. |
| Approach: | They propose a structured persuasion workflow to analyze the influence of persuasive prompts on LLM outputs. |
| Outcome: | The proposed method analyzes the influence of persuasive prompts on LLM outputs. |
Copied to clipboard
| Challenge: | Large language models have demonstrated considerable capabilities across various tasks . however, they often fall short of the performance achieved by domain-specific state-of-the-art models . |
| Approach: | They propose a tuning-free method to augment domain-specific abilities of Large language models . they leverage insights from the response preference of expert models to augment LLMs . |
| Outcome: | The proposed method outperforms the expert model on 4 ScienceWorld tasks. |
Copied to clipboard
| Challenge: | Existing methods to learn informative user and news representations fail to consider high-order connectivity underlying the user-news interactions. |
| Approach: | They propose a novel Graph Neural News Recommendation model with Unsupervised Preference Disentanglement which can encode high-order relationships into user and news representations by information propagation along the graph. |
| Outcome: | The proposed model can encode high-order relationships into user and news representations by information propagation along the graph and disentangle latent preference factors by a neighborhood routing algorithm. |
Copied to clipboard
| Challenge: | Existing methods for learning cross-lingual representations are lacking in the field of NLP. |
| Approach: | They propose a framework that formulates cross-lingual language model pre-training as maximizing mutual information between multilingual-multi-granularity texts. |
| Outcome: | The proposed approach improves cross-lingual transferability on benchmarks. |
Copied to clipboard
| Challenge: | Existing parallel code localization agents suffer from a 34.9% redundant tool invocation rate . specialized localization agent that operate as dedicated search components is needed to achieve high localization accuracy. |
| Approach: | They propose a parallel code localization system that reframes parallel code execution as a quality–efficiency co-optimization problem. |
| Outcome: | The proposed method matches SOTA performance while being 93.6% faster. |
Copied to clipboard
| Challenge: | Existing studies on event extraction depend on pre-defined argument roles . despite great progress, many studies still rely on hand-crafted ontologies . |
| Approach: | They propose an unsupervised framework for customizing argument roles for event extraction . they propose a human-annotated event extraction dataset with 143 customized argument roles . |
| Outcome: | The proposed framework outperforms existing methods on an event extraction dataset. |