Papers by Ming Wu
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 advances in natural language processing focus on acquiring lexico-semantic information. |
| Approach: | They propose a construction grammar which highlights the pairings of form and meaning to enrich language representation. |
| Outcome: | The proposed model is superior to existing models on a variety of NLU tasks. |
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: | 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: | 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: | Recent work shows successful methods for unsupervised machine translation (UMT) initialization stage is important since bad initialization may wrongly squeeze the search space and too much noise may hurt the final performance. |
| Approach: | They propose a retrieval and rewriting based method to better initialize unsupervised translation models. |
| Outcome: | The proposed method improves translation performance by over 4 BLEU scores. |
Copied to clipboard
| Challenge: | achieving data-efficient post-training of Large Language Models is a key research question. |
| Approach: | They propose a taxonomy of data-efficient LLM post-training methods from a data-centric perspective. |
| Outcome: | The proposed methods cover data selection, data quality enhancement, synthetic data generation, data distillation and compression, and self-evolving data ecosystems. |
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 methods for truthfulness enhancement in English are limited to multilingual scenarios. |
| Approach: | They propose a method for cross-lingual truthfulness transfer that uses language bias and transfer contributions to select an optimal subset of all tested languages and employ translation instruction tuning for cross language truthfulness transfers. |
| Outcome: | The proposed method reduces multilingual representation disparity and boosts cross-lingual truthfulness transfer of LLMs. |
Copied to clipboard
| Challenge: | Existing methods to distill knowledge from cross-encoder re-ranker to dual-encoding retriever are lacking in the cross-lingual setting. |
| Approach: | They propose to use a query generator as the teacher in the cross-lingual setting to distill knowledge to a dual-encoder retrieval model. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two benchmark datasets. |
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: | End-to-end speech translation requires a powerful encoder to transcribe, understand and learn cross-lingual semantics simultaneously. |
| Approach: | They propose a curriculum pre-training method that includes an elementary course for transcription learning and two advanced courses for understanding the utterance and mapping words in two languages. |
| Outcome: | The proposed method improves on En-De and En-Fr speech translation benchmarks. |
Copied to clipboard
| Challenge: | Current datasets cater to user-led systems and are limited to predefined specific scenarios and slots. |
| Approach: | They propose to use a Chinese dialogue dataset to train a model that authentically simulates human-computer dialogues in 30 popular life service scenarios. |
| Outcome: | The proposed model achieves a joint accuracy of 75.09% in out-of-domain evaluations . it also achieves notable abilities in slot filling and questioning . |
Copied to clipboard
| Challenge: | Existing datasets that focus on natural language tasks are not considered as a general evaluation benchmark for multimodal tasks. |
| Approach: | They present a general evaluation benchmark for multimodal tasks, GEM 1 . they compare it with existing multimodal vision-language datasets . |
| Outcome: | The proposed model is compared with existing vision-language datasets focusing on natural language tasks . it is the largest vision-linguistic dataset covering image-language tasks and video-language task at the same time . |
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: | 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 approaches to recognize relational relationships with a few support samples are limited for unlimited queries. |
| Approach: | They propose a simple but effective framework that uses relation descriptions as external knowledge to enhance the model’s comprehension of the relation semantics. |
| Outcome: | The proposed framework outperforms strong baselines while being robust against various NOTA rates. |
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 models of seeker simulations are limited by the cost and ethical concerns of involving real seekers in mental health research. |
| Approach: | They propose an emotional and cognitive dynamic agent system equipped with tertiary memory to enable dynamic control of the simulator's configurations. |
| Outcome: | The proposed system achieves more realistic seeker simulation compared to baselines. |
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: | Large Language Models (LLMs) have shown remarkable progress in dialogue and reasoning, but they struggle to solve strictly constrained dialogue tasks. |
| Approach: | They construct a dataset that contains 12,705 high-quality Chinese dialogue instructions from 440 flowcharts containing 5,055 process nodes. |
| Outcome: | The proposed model outperforms GPT-4o models on backward transitions and outperformed GPT-42 models on the same dataset. |
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: | Large language models have shown significant promise in question-answering tasks . noisy reference documents hinder performance of LLMs, causing disproportionate attention to irrelevant content . |
| Approach: | They propose an adaptive large language model that allocates disproportionate attention to irrelevant documents . they use transformers to train the model and integrate it into pre-trained Transformer blocks . |
| Outcome: | The proposed model outperforms state-of-the-art models on noisy-context benchmarks. |
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: | MPLSandbox is an out-of-the-box multi-programming language sandbox designed to provide unified and comprehensive feedback from compiler and analysis tools for Large Language Models (LLMs). |
| Approach: | They propose a multi-programming language sandbox that provides unified feedback from compilers and analysis tools for Large Language Models. |
| Outcome: | The proposed multi-language sandbox can provide comprehensive feedback from compilers and analysis tools for large language models (LLMs). |
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: | grammatical error correction (GEC) is a complex task that requires high-quality data from native speakers. |
| Approach: | They propose a human-annotated corpus to detect, identify and correct grammatical errors in Chinese examinations. |
| Outcome: | The proposed model outperforms other models in low-resource settings, but there is a significant gap between the models and humans that encourages future models to bridge it. |
Copied to clipboard
| Challenge: | Large language models (LLMs) inherit contamination from training corpora, directional bias under social-desirability framing, and limited responsiveness to context beyond the item text. |
| Approach: | They propose a paradigm that reformulates TAT, Rorschach, and SCT with newly generated stimuli and organises assessment as a three-stage pipeline. |
| Outcome: | The proposed paradigm reformulates TAT, Rorschach, and SCT with newly generated stimuli and organises assessment as a three-stage pipeline. |
Copied to clipboard
| Challenge: | Current methods embed factual knowledge into continuous vector space and apply geometric operations to learn potential patterns in temporal knowledge graphs. |
| Approach: | They propose a temporal knowledge graph completion method that uses two geometric operations to learn missing facts in temporal graphs. |
| Outcome: | The proposed method significantly outperforms existing temporal knowledge graph embedding models. |
Copied to clipboard
| Challenge: | Existing non-task oriented dialogue systems can yield a relevant and fluent response, but sometimes make logical mistakes because of weak reasoning capabilities. |
| Approach: | They propose a dataset for multi-turn dialogue reasoning that uses annotated dialogues to train a machine to handle various reasoning problems. |
| Outcome: | Empirical results show that state-of-the-art methods only reach 71%, far behind human performance of 94%. |
Copied to clipboard
| Challenge: | Experimental results show that Generative pre-trained Transformers (GPT) have great success in natural language processing. |
| Approach: | They propose a unified language model of text and molecules pre-trained on SMILES wrapped by text. |
| Outcome: | The proposed model outperforms strong baselines of molecular property prediction on MoleculeNet and performs comparably to the best model in text-molecule translation while using less than half of its parameters. |
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 evaluation of Large Language Models on static benchmarks is vulnerable to data contamination and leaderboard overfitting. |
| Approach: | LLMEval-Fair framework provides a framework for dynamic evaluation of Large Language Models . evaluators use a proprietary bank of 220k graduate-level questions to analyze model data . |
| Outcome: | LLMEval-Fair provides robust and credible evaluation framework for Large Language Models . it provides a strong empirical validation for the dynamic evaluation paradigm . |
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: | Multimodal foundation models have demonstrated significant success in tasks such as visual captioning, question answering, and image-text retrieval. |
| Approach: | They propose a specialized cognitive module, temporal working memory, which selectively retains task-relevant information across temporal dimensions. |
| Outcome: | The module retains task-relevant information across temporal dimensions, ensuring that critical details are preserved throughout the processing of video and audio content. |
Copied to clipboard
| Challenge: | Recent multilingual pre-trained models perform poorly on multilingual retrieval tasks due to lack of multilingual training data. |
| Approach: | They propose to mine and generate self-supervised training data based on large-scale unlabeled corpus and introduce query generator to generate more queries in target languages for unlabed passages. |
| Outcome: | The proposed method performs better than baselines on a Mr. TYDI dataset and an industrial dataset from a commercial search engine. |
Copied to clipboard
| Challenge: | Existing Music AVQA methods rely on dense and unoptimized representations, leading to inefficiencies in the isolation of key information, reduction of redundancy, and prioritization of critical samples. |
| Approach: | They propose a sparse learning framework specifically designed for Music AVQA to address these challenges. |
| Outcome: | The proposed framework reduces training time by 28.32% while maintaining accuracy while maintaining state-of-the-art performance on the Music AVQA datasets. |
Copied to clipboard
| Challenge: | Tool-integrated reasoning (TIR) enables large language models to invoke external tools for tasks beyond their internal capacity but often suffers from tool overuse. |
| Approach: | They propose an algorithm that uses a composite reward to model tool costs and tool efficiency. |
| Outcome: | The proposed algorithm models heterogeneous tool costs and encourages more cost-effective tool-use strategies. |
Copied to clipboard
| Challenge: | Existing methods to summarize health questions are not able to capture well question focus and lack the ability to understand sentence-level semantics. |
| Approach: | They propose a question focus-driven contrastive learning framework to capture question focus and exploit contrastive training at both encoder and decoder to obtain better sentence representations. |
| Outcome: | The proposed model achieves 5.33, 12.85 and 3.81 points over the baseline model on three medical benchmark datasets. |
Copied to clipboard
| Challenge: | Existing approaches to build initial unsupervised machine translation models with cross-lingual n-gram embeddings are inexplicit and limited. |
| Approach: | They propose a cross-lingual pre-training method that incorporates cross-linguistic training signals into pre-trained models by randomly choosing source n-grams in the input text stream. |
| Outcome: | The proposed method significantly improves the performance of unsupervised machine translation. |
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: | 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: | 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: | 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: | Music audio-visual question answering presents unique challenges with dense audio-visual content, intricate temporal dynamics, and the need for domain-specific knowledge. |
| Approach: | They analyze Music AVQA datasets and analyze their results to identify key design patterns . they propose concrete future directions for incorporating musical priors . |
| Outcome: | The proposed architectures are critical for success in Music AVQA, the authors argue . they suggest concrete future directions for incorporating musical priors . |
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 approaches to read comprehension style question answering are limited by the volume of annotated datasets. |
| Approach: | They propose a hierarchical attention network for reading comprehension style question answering . they first encode the question and paragraph with fine-grained language embeddings . then propose fusion approach to fuse information from both global and attended representations based on the hierarchic attention network . |
| Outcome: | The proposed method achieves state-of-the-art on the SQuAD and TriviaQA Wiki leaderboards and two adversarial SQu AD datasets. |
Copied to clipboard
| Challenge: | Multi-task benchmarks focus on a range of Natural Language Understanding (NLU) tasks without considering the Natural Language Generation (NLG) models. |
| Approach: | They propose a multi-task benchmark for evaluating the generalization capabilities of NLG models across eight language generation tasks. |
| Outcome: | The proposed benchmarks are based on GLUE and Su-perGLUE for English and several other languages. |
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: | Large Action Models (LAMs) face challenges due to the need for high-quality training data, especially for multi-steps tasks that involve planning, executing tool calls, and responding to feedback. |
| Approach: | They propose a framework for online exploration of agentic tasks with high-quality feedback . they use a dynamic task query generator and an extensive collection of tools to create a high-level feedback environment for LLM Agents. |
| Outcome: | The proposed framework achieves 49.3% performance improvement over baselines on toolbench and CRMArena. |
Copied to clipboard
| Challenge: | Existing approaches involve models iterating and improving their previous responses based on internal reflection ability or external feedback. |
| Approach: | They propose a reflection framework that leverages meta-thoughts and self-consistency to enhance the iterative reflection capability of Large LanguageModels. |
| Outcome: | The proposed framework achieves an average improvement of 10.1% over established baselines in mathematical and commonsense reasoning tasks, highlighting its efficacy and applicability. |
Copied to clipboard
| Challenge: | Existing methods for document summarization use graphs and unlabeled documents . Existing models require labeled data, and it is expensive to create summarized documents. |
| Approach: | They propose to rank sentences using transformer attentions and pre-training objectives by unlabeled documents. |
| Outcome: | The proposed model achieves state-of-the-art on unsupervised summarization and is less dependent on sentence positions. |
Copied to clipboard
| Challenge: | Existing studies on prompt engineering have focused on optimizing models for performance under stylistic perturbations. |
| Approach: | They conduct the first analysis of n-gram token-level mechanisms . they find that higher average performance is inherently associated with lower variance and greater stability. |
| Outcome: | The proposed model reduces the variance of the generated code by 40% . the proposed model is based on a large-scale dataset of 132,000 prompt variants . |
Copied to clipboard
| Challenge: | Existing approaches to theorem proving in large language models rely on value functions and/or Monte Carlo Tree Search (MCTS), but the potential of simpler methods like Best-First Tree Search remains underexplored. |
| Approach: | They propose a scalable expert iteration framework that implements strategic data filtering at each expert iteration round, excluding problems solvable via beam search node expansion to focus on harder cases. |
| Outcome: | The proposed framework achieves a state-of-the-art score of 72.95 on the MiniF2F test set and challenges the perceived necessity of complex tree search methods. |
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: | XGLUE provides a benchmark dataset to train large-scale cross-lingual pre-trained models . XCLUE provides 11 diversified tasks that cover both understanding and generation scenarios . |
| Approach: | They introduce a new benchmark dataset to train large-scale cross-lingual pre-trained models using multilingual and bilingual corpora. |
| Outcome: | The proposed dataset is labeled in English and includes only natural language understanding tasks. |
Copied to clipboard
| Challenge: | Existing methods for audio-visual learning fail to consider the distinctive characteristics of instruments and music. |
| Approach: | They propose to integrate multimodal interactions within the context of music data and annotate and release rhythmic and music sources in the current music datasets to enable the model to learn music characteristics. |
| Outcome: | The proposed model can learn music characteristics from the current music datasets and align its predictions with the temporal dimension. |
Copied to clipboard
| Challenge: | Existing research on reinforcement learning for LLMs under data scarcity has not been unified. |
| Approach: | They propose a top-up hierarchical framework built around three complementary perspectives: data-centric, training-centric and framework-centric. |
| Outcome: | The proposed framework provides a clear conceptual foundation for understanding the design space of data-efficient RL for large language models and to guide researchers working in this emerging area. |
Copied to clipboard
| Challenge: | Existing entity disambiguation methods struggle to capture explicit discourse-level dependencies, resulting in incoherent predictions at the abstract level. |
| Approach: | They propose an unsupervised variational autoencoder to extract latent topic vectors of context sentences to enhance coherence of entity predictions. |
| Outcome: | The proposed system achieves state-of-the-art on popular ED benchmarks with an average improvement of 1.3 F1 points. |
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: | a novel graph convolutional network (GCN) is proposed for the task of joint entity relation extraction. |
| Approach: | They propose a graph convolutional network running on an entity-relation bipartite graph . they propose combining two different methods to perform joint entity relation extraction . |
| Outcome: | The proposed model outperforms existing joint models in entity performance and is competitive with the state-of-the-art in relation performance. |
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 benchmarks focus on basic abilities using nonverbal methods, such as yes-no and multiple-choice questions. |
| Approach: | They propose a benchmark that provides more nuanced evaluations of alignment capabilities for large Vision-Language Models (VLMs) they use a rule-calibrated evaluator that exceeds GPT-4's evaluation ability and a “alignment score” to assess the robustness and stability of models across diverse prompts. |
| Outcome: | The proposed benchmark covers 13 tasks across three categories and includes both single-turn and multi-turn dialogue scenarios. |
Copied to clipboard
| Challenge: | Existing approaches to scale out spoken language understanding to low-resource languages are noisy. |
| Approach: | They propose a method for mitigating noise in augmented data by training models with augmented datasets. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two benchmark datasets. |
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: | Existing methods use contrastive learning (CL) to learn effective sentence representations, but require extensive human annotation. |
| Approach: | They propose a reinforcement learning approach for fine-tuning small-parameter LLMs to generate high-quality hard contrastive data without human feedback. |
| Outcome: | The proposed method achieves state-of-the-art on seven semantic text similarity tasks. |
Copied to clipboard
| Challenge: | Existing large language models (LLMs) can solve graph reasoning and generation tasks with parameter updates without sacrificing performance. |
| Approach: | They propose a structured format verbalizer to unify all graph data into a universal code-like format, which can simply represent the graph without any external graph-specific encoders. |
| Outcome: | The proposed framework outperforms GPT-4 and LLaMA2 in graph reasoning and generation tasks by more than 13% and 38%, respectively. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated potential reasoning capabilities through prompt design, such as the Chain of Thought (CoT). |
| Approach: | They propose a new reasoning approach that predicts key entities which work as important “anchors” and employs a ranking algorithm to ensure the logical sequence of the predicted answers. |
| Outcome: | The proposed approach outperforms existing methods in multi-hop question reasoning and provides more accurate reasoning results in multihop question answering tasks. |
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: | 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 methods for extractive and abstractive summarization use token-level or sentence-level training objectives. |
| Approach: | They propose a Contrastive Learning based re-ranking framework for one-stage summarization called CoLo. |
| Outcome: | The proposed framework boosts extractive and abstractive results on CNN/DailyMail benchmarks while maintaining inference efficiency. |
Copied to clipboard
| Challenge: | Personalized news recommendation is an important technique for personalized news service. |
| Approach: | They propose to build a large-scale news recommendation dataset from Microsoft News . they demonstrate that news recommendation relies on the quality of news content understanding . |
| Outcome: | The proposed dataset contains 1 million users and more than 160k English news articles, each of which has rich textual content such as title, abstract and body. |
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: | Visual Question Answering (VQA) is increasingly used in diverse applications where models must provide accurate answers and explanations that humans can easily understand and verify. |
| Approach: | They propose a unified prototypical framework that learns question-aware prototypes that serve as reasoning anchors and applies spatially constrained matching to ensure that the selected evidence is coherent and semantically relevant. |
| Outcome: | The proposed framework yields faithful, fine-grained explanations while maintaining competitive accuracy. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable abilities in complex reasoning through chain of thought (CoT) prompting. |
| Approach: | They propose to generate multiple rationales for each question and enforce consistency among their predictions by minimizing the bidirectional KL-divergence between the answer distributions. |
| Outcome: | The proposed model achieves superior performance on in-distribution and commonsense reasoning benchmarks. |
Copied to clipboard
| Challenge: | Large Multimodal Models (LMMs) exhibit impressive cross-modal understanding and reasoning abilities, but many benchmarks suffer from systematic biases. |
| Approach: | They propose a benchmark to avoid Type-I errors by creating one perception question and one knowledge anchor question through a meticulous annotation process. |
| Outcome: | The proposed benchmark avoids Type-I errors while maintaining reliability of MCQ evaluations. |
Copied to clipboard
| Challenge: | Current work on multi-modal semantic understanding primarily exploits a dual-encoder structure to separate image and text, but fails to learn cross-modal feature alignment. |
| Approach: | They propose a CLIP-guided contrastive-learning-based architecture to perform multi-modal feature alignment by projecting features from different modalities into a unified deep space. |
| Outcome: | The proposed model outperforms baseline models on sarcasm detection and sentiment analysis tasks and is simple to implement without using task-specific external knowledge. |
Copied to clipboard
| Challenge: | Generative approaches powered by large language models have demonstrated emergent abilities in tasks that require complex reasoning abilities. |
| Approach: | They propose a sequence-to-sequence training objective with instruction-tuning that enables casual language models to perform entity linking over knowledge bases. |
| Outcome: | The proposed framework outperforms existing approaches with +6.8 F1 points gain on average and huge advantage in training data efficiency and compute consumption. |
Copied to clipboard
| Challenge: | Existing knowledge graphs focus on the representation and reasoning of general factual knowledge, while there are significant deficiencies in the understanding and reasoning for emotional knowledge. |
| Approach: | They propose a commonsense knowledge graph that can be used to represent emotional knowledge by combining theories from psychology, cognitive science, and linguistics. |
| Outcome: | The proposed model surpasses GPT-4-Turbo in the emotion-related tasks. |