Papers by Ming Liu
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: | Few/zero-shot learning is a big challenge of many classification tasks, where a classifier is required to recognise instances of classes that have very few or even no training samples. |
| Approach: | They propose a multi-graph aggregation model that fuses knowledge from multiple label graphs encoding different semantic label relationships to improve multi-label zero/few-shot document classification. |
| Outcome: | The proposed model improves on two large clinical datasets and the EU legislation dataset on few/zero-shot labels. |
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: | 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: | Recent advances in large language models (LLMs) focus on replicating human cognition in specific contexts, overlooking the inherently dynamic nature of cognition. |
| Approach: | They propose a task to assess cognitive dynamics of large language models (LLMs) they introduce a benchmark and two evaluation metrics to validate the benchmark and evaluate it through participant surveys. |
| Outcome: | The proposed task overcomes the limitations of existing methods and is available for download. |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) is widely used to ground large language models in external knowledge and improve factual accuracy. |
| Approach: | They propose a framework that integrates neuro-symbolic verification with reinforcement learning to optimize logical consistency. |
| Outcome: | The proposed framework outperforms strong RAG baselines on hotpotQA, ASQA, and TriviaQA. |
Copied to clipboard
| Challenge: | 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: | Chain-of-Thought prompting is a de facto method to elicit reasoning capabilities from large language models (LLMs). |
| Approach: | They propose a step-aware formal verification framework Safe to address hallucinations in CoT prompting . they propose 'formal step' as a benchmark for step correctness theorem proving with 30,809 formal statements. |
| Outcome: | The proposed framework shows significant performance improvement while offering interpretable and verifiable evidence. |
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: | 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: | Experimental results show that the proposed cross-modal attention distillation is crucial to the success of our framework. |
| Approach: | They propose a framework that distills knowledge of fusion-encoder teacher into dual-encoding student model. |
| Outcome: | The proposed model is competitive with the fusion-encoder teacher model in performance, but suffers from a lack of deep cross-modal interactions. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks for natural language generation are dominated by similarity-based metrics. |
| Approach: | They propose a multi-dimensional evaluator for natural language generation that integrates multiple dimensions into one evaluer. |
| Outcome: | The proposed evaluator improves on three typical NLG tasks and improves with external knowledge. |
Copied to clipboard
| Challenge: | Natural language inference (NLI) tasks are difficult to perform on large datasets . a small number of simple sentences can improve model performance, authors say . |
| Approach: | They propose to use syntactically simple sentences to test the inference ability of NLI models. |
| Outcome: | The proposed set of simple sentences shows that the models fine-tuned on MNLI and SNLI perform poorly on Simple Pair. |
Copied to clipboard
| Challenge: | Lack of large-scale terminology definition dataset hinders definition generation . lack of precise terminology definitions poses great challenges in scientific communication . |
| Approach: | They propose a large-scale terminology definition dataset Graphine that exploits the graph structure of terminologies to generate graph-aware text generation models. |
| Outcome: | The proposed model outperforms existing models by exploiting graph structure of terminologies. |
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 infrastructure for efficient agentic data processing and model training remains underdeveloped. |
| Approach: | They propose a lightweight and extensible data and training framework for large action models . they propose to unify diverse agent trajectories using Unified Format 2.0 . |
| Outcome: | The proposed framework shows 9 higher throughput than existing frameworks and performs well across public and realistic agent benchmarks. |
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 benchmarks lack discriminative complexity and ground-truth rubric annotations required for rigorous evaluation. |
| Approach: | They propose a curated benchmark with 1,147 pairwise comparisons to assess the reliability of rubric-based evaluation. |
| Outcome: | The proposed benchmarks show that they support diverse domains, exhibit discriminative ability, provide high-quality annotations, and include human-authored rubrics. |
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: | 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 CodePre-trained models struggle to generalize due to superficial mapping from source code to labels instead of understanding the root causes of code vulnerabilities. |
| Approach: | They propose a framework that integrates multi-task learning with Large Language Models to effectively mine deep-seated vulnerability features. |
| Outcome: | The proposed framework surpasses seven state-of-the-art models in effectiveness, generalization, and robustness. |
Copied to clipboard
| Challenge: | Existing feature-based model selection methods are vulnerable to fine-tuning and are not reliable indicators for the PTM’s transferability. |
| Approach: | They propose feature-based model selection methods which assess PTMs’ transferability to a specific task in a fast way without fine-tuning. |
| Outcome: | The proposed methods can make FMS mistakenly judge transferability of models and can be combined with the backdoor attack to misguide the FMS to select poisoned models. |
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: | Existing QA research on question answering is focused on specific question types, knowledge domains, or reasoning skills. |
| Approach: | They propose a unified QA paradigm that solves various tasks through a single model. |
| Outcome: | The proposed model improves QA-centric ability on 11 QA benchmarks. |
Copied to clipboard
| Challenge: | Existing benchmarks focus primarily on pure graph understanding, lacking a comprehensive evaluation across all graph types and detailed capability definitions. |
| Approach: | They propose a benchmark to evaluate LLMs' graph comprehension and reasoning abilities using a three-tier hierarchical taxonomy and a granular taxonomies. |
| Outcome: | The proposed model includes 11 datasets with 5,140 graphs of varying complexity. |
Copied to clipboard
| Challenge: | Existing research lacks direct access to such data, making benchmarking difficult due to privacy concerns. |
| Approach: | They propose a synthetic data pipeline that generates realistic user profiles and private documents and a benchmark to evaluate models' ability to understand personal information. |
| Outcome: | The proposed pipeline generates realistic user profiles and private documents, enabling PersonaBench, a benchmark for evaluating models’ ability to understand personal information. |
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 pretraining frameworks do not perform well for all tasks of three main categories, such as natural language understanding (NLU), unconditional generation, and conditional generation. |
| Approach: | They propose a general language model based on autoregressive blank infilling to address this challenge. |
| Outcome: | The proposed model outperforms BERT, T5, and GPT on a wide range of tasks across NLU, conditional and unconditional generation tasks. |
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: | 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: | Large language models (LLMs) have advanced the automation of data science workflows, yet it remains unclear whether they can critically leverage external domain knowledge as human data scientists do in practice. |
| Approach: | They propose a benchmark to evaluate how large language models handle external domain knowledge in tabular prediction tasks. |
| Outcome: | The proposed model evaluates whether it can critically leverage external domain knowledge as human data scientists do in practice. |
Copied to clipboard
| Challenge: | Neural topic models (NTMs) use deep neural networks to learn topic information. |
| Approach: | They propose a variational autoencoder model that reconstructs sentence and document word counts using bag-of-words embeddings and pre-trained semantic embedders. |
| Outcome: | The proposed model lowers reconstruction errors at sentence and document levels and finds more coherent topics from real-world datasets. |
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: | 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 methods for estimating maximum likelihood are limited by easily learned tokens . Existing systems that generate questions based on dialogue context are limited in their ability to learn tokens. |
| Approach: | They propose a framework that optimizes the minimum Levenshtein distance through explicit editing actions. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on two benchmark datasets and generalizes well on unseen data. |
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 RAG paradigms often overlook the cognitive step of applying knowledge, leaving a gap between retrieved facts and task-specific reasoning. |
| Approach: | They introduce a module extension that integrates application-aware reasoning into the RAG pipeline. |
| Outcome: | Experiments show that RAG+ outperforms standard RAG variants and achieves gains of 3–5% in complex scenarios. |
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: | 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 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 alignment methods struggle to balance general reasoning with instruction-following (IF) this is hindered by dependency on teacher models, reward hacking, and reasoning-answer inconsistencies. |
| Approach: | They propose a two-stage curriculum learning framework based on Reinforcement Learning from Verifiable Rewards to enhance both IF and general reasoning capabilities. |
| Outcome: | The proposed framework outperforms leading models on six representative IF tasks while achieving a 21.25% relative average improvement over the original model. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have produced models that exhibit remarkable performance across a variety of NLP tasks. |
| Approach: | They analyze a large-scale collection of user-GPT conversations to identify a significant gap between academic research in NLP and the needs of real-world NLP applications. |
| Outcome: | The proposed model outperforms existing models in a large-scale collection of user-GPT conversations and identifies a significant gap between the tasks that users frequently request from LLMs and the tasks commonly studied in academic research. |
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: | 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 methods for post-training quantization (PTQ) are limited by the complexity of the quantization parameter and performance degradations when tested on unseen datasets. |
| Approach: | They propose a learnable smooth-based PTQ framework that allows for rapid adaptation during testing. |
| Outcome: | The proposed framework improves performance on unseen datasets and reduces memory constraints. |
Copied to clipboard
| Challenge: | Existing sequence-to-sequence models are optimized for future n-gram prediction and n stream self-attention mechanism. |
| Approach: | They propose a self-supervised objective called future n-gram prediction and the proposed n stream self-attention mechanism to optimize the model for sequence-to-sequence learning. |
| Outcome: | The proposed model achieves state-of-the-art on CNN/DailyMail, Gigaword, and SQuAD 1.1 benchmarks compared to the models using the same scale pre-training corpus. |
Copied to clipboard
| Challenge: | Existing methods for Named Entity Recognition (NER) ignore the internal state of the target model. |
| Approach: | They propose a framework to repair model-specific errors by using a model-based approach . they employ cross-validation to identify model- specific Hard Data and a memory tree to induce macro-level error patterns from micro-level failures. |
| Outcome: | The proposed framework yields significant performance gains on Twitter and other platforms. |
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: | 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 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 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 studies on English-centric translation tasks have focused on multimodal large language models, but the exploration of many-to-many translation is limited by the scarcity of parallel data. |
| Approach: | They propose a three-stage curriculum learning strategy that leverages the machine translation capabilities of large language models and adapts them to S2TT tasks. |
| Outcome: | The proposed strategy achieves state-of-the-art average performance in 1514 language pairs, requiring fewer than 10 hours of speech data per language to achieve competitive results. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) operate in a reactive mode, often resulting in efficiency issues or suboptimal performance. |
| Approach: | They propose a dual-process dialogue planning framework that leverages the dual-process theory of human cognition and a deliberative Monte Carlo Tree Search mechanism to emulate human-like conversational dynamics. |
| Outcome: | The proposed framework outperforms existing methods in achieving high-quality dialogues and operational efficiency. |
Copied to clipboard
| Challenge: | Existing graph-based detection models are vulnerable to deceptive message propagation, where bots deliberately interact with legitimate users. |
| Approach: | They propose a framework to mitigate deceptive message propagation by node-level uncertainty estimation and graph structure purification. |
| Outcome: | The proposed framework improves on three benchmark datasets and six GNN backbones on real-world social bots. |
Copied to clipboard
| Challenge: | Existing frameworks for commonsense generation are lacking for pre-trained models. |
| Approach: | They propose a framework that uses concept matching to retrieve prototype sentences and trainable sentence retriever to enhance pre-training and fine-tuning. |
| Outcome: | The proposed framework achieves state-of-the-art on the large-scale Common-Gen benchmark. |
Copied to clipboard
| Challenge: | Existing structured pruning methods employ uniform compression rates across network layers, neglecting the varying importance of different network depths. |
| Approach: | They propose a pruning framework that minimizes global capability loss by layer-adaptive pruning rates. |
| Outcome: | The proposed approach achieves comparable performance with state-of-the-art methods at high pruning rates and shows significant advantages at low pruning rates. |
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 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: | Existing evaluation methods for text summarization systems are limited to in-domain setting, where supervised pre-trained models are evaluated on the same dataset. |
| Approach: | They propose to use a cross-dataset evaluation approach to evaluate different summarization systems in a multi-domain setting. |
| Outcome: | The proposed model can be used to evaluate text summarization systems on different datasets. |
Copied to clipboard
| Challenge: | MLLMs are able to integrate multiple modalities into a single model to tackle complex tasks in real-world scenarios. |
| Approach: | They propose a comprehensive survey of Omni-MLLMs to address the challenges and opportunities of multimodal modeling. |
| Outcome: | The proposed model can integrate multiple modalities into a single model and provide novel perspectives. |
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: | Instruction Fine-Tuning (IFT) has emerged as a critical technique for customizing Large Language Models (LLMs) however, recent studies have revealed that IFT can compromise the built-in security mechanisms of LLMs, posing significant security risks. |
| Approach: | They propose a method that shifts learning burden onto security-robust parameters and propose 'warm-up' phase that preferentially trains Mods_Rob to learn low-level features with minimal security risk. |
| Outcome: | The proposed method reduces security risks without sacrificing performance gains across knowledge-intensive datasets. |
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: | Existing methods for solving complex problems are expensive and inefficient when handling large-scale, high-complexity problems. |
| Approach: | They propose a multi-agent framework that decomposes complex problems through agent collaboration by mapping implicitly expressed graph data into clear, structured graph representations and dynamically selecting the most suitable algorithm based on problem constraints and graph structure scale. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on multiple benchmarks with robust performance on both closed- and open-source models. |
Copied to clipboard
| Challenge: | Existing activation sparsification methods rely on activation magnitude and weights for sparsity . authors propose a weight-aware activation-a-ware framework for large language models . |
| Approach: | They propose a weight-aware activation sparsity framework that uses weight-based scoring to measure activation importance in sparsification and a custom GPU sparse kernel to support it. |
| Outcome: | The proposed framework outperforms existing methods at 60% model-level sparsity and significantly outperfies them at higher sparsities. |
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: | 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: | ECom-Bench is a benchmark framework for evaluating LLM agent with multimodal capabilities in e-commerce customer support domain. |
| Approach: | They introduce a benchmark framework for evaluating LLM agent with multimodal capabilities in the e-commerce customer support domain. |
| Outcome: | The proposed benchmark features dynamic user simulation based on persona information from real e-commerce customer interactions and a realistic task dataset derived from authentic ecommerce dialogues. |
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: | Multimodal Large Language Models (MLLMs) have advanced Chinese Classical Studies (CCS) but the audio dimension of CCS remains underexplored due to a lack of high-quality, domain-specific audio corpora. |
| Approach: | They propose a 119-hour audio corpus comprising 22,000 audio samples to bridge this gap . it encompasses a diverse range of literary genres across six tasks . |
| Outcome: | The proposed corpus encompasses a diverse range of literary genres across six tasks: Automatic Speech Recognition (ASR), Speech-to-Text Translation (S2TT), Speech Emotion Captioning (SEC), Spoken Question Answering ( SQA), Speech Understanding (SU), and Speech Reasoning (SR). |
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: | 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: | Situational awareness is crucial for decision-making, anticipating potential issues, and adapting to dynamic circumstances. |
| Approach: | They propose a benchmark that covers three tiers of situational awareness capabilities . they conduct extensive experiments on advanced LLMs including GPT-4, LLaMA3, Qwen1.5 . |
| Outcome: | The proposed benchmark covers environment perception, situation comprehension and future projection. |
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 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: | Automated program repair (APR) aims to find an automatic solution to program language bugs without human intervention. |
| Approach: | They propose a grammar-based rule-rule model which regards the repair process as the transformation of grammar rules and employs a tree-based self-attention approach to guarantee grammar correctness. |
| Outcome: | The proposed model outperforms the state-of-the-art models on a Java dataset in terms of generated code accuracy. |
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: | Neural text generation is a novel technique to describe biomedical pathways without manually curation. |
| Approach: | They propose a new dataset Pathway2Text which contains 2,367 pairs of biomedical pathways and textual descriptions. |
| Outcome: | The proposed method improves on both Graph2Text and Text2Graph tasks and can be used as a benchmark for biomedical named entity recognition. |
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: | Existing methods for accelerating Large Vision-Language Models lack comprehensive evaluation across diverse backbones, benchmarks, and metrics. |
| Approach: | They propose EffiVLM-BENCH framework for evaluating absolute performance and generalization and loyalty. |
| Outcome: | The proposed framework offers insights into optimal strategies for accelerating LVLMs. |
Copied to clipboard
| Challenge: | Abstractive summarization has made tremendous progress in recent years . however, even under a short document setting, abstractive models often generate summaries that are repetitive, ungrammatical, and factually inconsistent with the source. |
| Approach: | They perform fine-grained human annotations to evaluate long document abstractive summarization systems and develop factual consistency metrics. |
| Outcome: | The proposed model can generate more relevant summaries but not factual ones. |
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: | Recent methods for bilingual lexicon induction are based on unsupervised cross-lingual word embeddings . previous methods only use word-level information, which is limited and inaccurate . |
| Approach: | They propose a graph-based approach to induce bilingual lexicons in a coarse-to-fine way . they use word cliques from graphs and aligned clique-level words to find initial translation solution . |
| Outcome: | The proposed method improves the performance of bilingual lexicon induction compared with previous methods. |
Copied to clipboard
| Challenge: | Recent years have seen success in the use of deep neural networks on text summarization, but there is no clear understanding of why they perform so well or how they might be improved. |
| Approach: | They propose to use different types of model architectures to improve extractive summarization systems. |
| Outcome: | The proposed framework achieves state-of-the-art on CNN/DailyMail by a large margin based on observations and analysis. |
Copied to clipboard
| Challenge: | Large vision-language models are often not open-source due to preventing abuse or commercial factors. |
| Approach: | They propose a method for parameter-efficient fine-tuning to improve model accessibility . large models are often not open-source due to preventing abuse or commercial factors . they propose implementing a lightweight adapter over the output feature of an inaccessible model . |
| Outcome: | The proposed methods improve on 11 benchmarks and are made publicly available. |
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: | 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 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: | High-dimensional dense embeddings extracted by large language models pose memory requirements and high computation time. |
| Approach: | They propose a method that maps high-dimensional dense embeddings to lower-dimensional sparse representations while preserving crucial anomaly characteristics. |
| Outcome: | The proposed method achieves better detection performance than 11 SOTA anomaly detection algorithms while maintaining computational efficiency and low memory cost. |
Copied to clipboard
| Challenge: | Existing methods to extract salient sentences from document are unsupervised and rely on graph-based methods for sentence ranking. |
| Approach: | They propose an unsupervised extractive approach to document level summarization based on the Information Bottleneck principle. |
| Outcome: | The proposed framework can be extended to a multi-view framework by different signals. |
Copied to clipboard
| Challenge: | Experimental results show that heuristic-based active learning methods are limited when the data distribution of the underlying learning problems vary. |
| Approach: | They propose a method that learns an AL "policy" using "imitation learning" they use an efficient "algorithmic expert" which provides the policy learner with good actions in the encountered AL situations. |
| Outcome: | The proposed method is more effective than previous methods on two tasks . labeled data is rare while unlabelled data is abundant . |
Copied to clipboard
| Challenge: | Existing models for text segmentation use supervised and unsupervised learning to perform tasks such as text summarization and keyword extraction. |
| Approach: | They propose a transformer over transformer framework to perform neural text segmentation. |
| Outcome: | The proposed framework outperforms state-of-the-art models in terms of semantic coherence measure . bottom-level sentence encoders pre-trained on specific languages yield better performance . |
Copied to clipboard
| Challenge: | Experimental results show that SmartTrim accelerates the original model by 2-3 times with minimal performance degradation. |
| Approach: | They propose an adaptive acceleration framework which prunes redundant token representations and attention heads within each layer of the original model. |
| Outcome: | The proposed framework accelerates the original model by 2-3 times with minimal performance degradation across vision-language tasks. |
Copied to clipboard
| Challenge: | a recent study has shown that large language models can be useful for cross-lingual applications. |
| Approach: | They propose to annotate Chinese word senses using English WordNet synsets . they examine the relationship between two annotators and find patterns among synset . |
| Outcome: | The proposed method shows that the annotators agree on 38% of the synsets compared with the original synset . the results highlight similarities between the synnotated synset and the WordNet structure . |
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: | XDTS is a cross-database context-dependent text-to-sql problem with wide range of applications. |
| Approach: | They present a large-scale Chinese dataset for cross-database context-dependent Text-to-SQL . they find that only 35% of questions are context-independent and 28% of SQL queries are easy . |
| Outcome: | The proposed approach achieves an exact match accuracy of 40% over all questions and 16% over all question sequences. |
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: | Existing methods for instruction tuning do not include associating instructions with existing datasets. |
| Approach: | They propose a dynamic growth paradigm for the automatic curation of instruction-tuning data . they use existing datasets to automatically construct instruction-uning datasets . |
| Outcome: | The proposed model reduces the API cost for generating instructions and provides high-quality data. |
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: | Large pre-trained models have improved performance on a variety of natural language processing tasks. |
| Approach: | They develop a bimodal pre-trained model for programming language (PL) and natural language (NL) it incorporates a hybrid objective function that detects replaced tokens from generators. |
| Outcome: | The proposed model performs better on two NL-PL applications by fine-tuning model parameters. |
Copied to clipboard
| Challenge: | Existing approaches generate a SQL query word-by-word but results are incorrect or not executable due to mismatch between question words and table contents. |
| Approach: | They propose a generative model to map natural language questions into SQL queries. |
| Outcome: | The proposed model significantly improves state-of-the-art execution accuracy from 69.0% to 74.4% on a large question- SQL dataset. |
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 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: | Existing work on meeting summarization tasks is limited to short summaries that cover all the content of a meeting. |
| Approach: | They propose a query-based multi-domain meeting summarization task that generates a single short summary of meetings based on a transcript. |
| Outcome: | The proposed task is based on 1,808 query-summary pairs over 232 meetings in multiple domains. |
Copied to clipboard
| Challenge: | Cross-lingual Machine Reading Comprehension (CLMRC) is a challenging problem due to the lack of large-scale annotated datasets in low-source languages, such as Arabic, Hindi, and Vietnamese. |
| Approach: | They propose a novel approach to augment cross-lingual machine reading comprehension by combining knowledge from multiple language branch models into a single model for all target languages. |
| Outcome: | Extensive experiments on two CLMRC benchmarks show the proposed method is effective and robust to data noises. |
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: | 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: | Standard evaluation metrics, e.g., BLEU, TER and METEOR, focus on the quality of translations at the sentence level and do not consider discourse-level features. |
| Approach: | They propose to use a metric to take discourse coherence into consideration by categorizing discourse-related spans and calculating the similarity-based F1 measure of categorized spans. |
| Outcome: | The proposed metric possesses better selectivity and interpretability at the document-level, and is more sensitive to document- level nuances. |
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: | 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: | Large language models (LLMs) are capable of performing tasks but are likely to be misused. |
| Approach: | They propose a zero-shot black-box method to detect LLM-generated texts . they revise the text to be detected using the ChatGPT model . |
| Outcome: | The proposed method can detect LLM-generated texts with a zero-shot black-box model . it is based on intuition that the model will make fewer revisions to LLMs than to human-written texts . |
Copied to clipboard
| Challenge: | Using pre-training methods for NMT models is difficult because of the cross-attention module . cross-linguistic embeddings are not used to pretrain a decoder . |
| Approach: | They propose a semantic interface between pre-trained encoder and pre-train decoder to improve NMT performance. |
| Outcome: | The proposed method improves on translation and unsupervised translation tasks. |
Copied to clipboard
| Challenge: | Existing meta-path generation methods cannot fully exploit rich textual information in HINs. |
| Approach: | They propose a text-infilling-based approach to generate meta-paths from textual information in HINs. |
| Outcome: | The proposed approach can classify edges in the zero-shot setting, where existing methods cannot generate meta-paths. |
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 domain adaptation paradigms for reading comprehension require large amounts of annotation data to achieve the desired task performance. |
| Approach: | They propose a few-shot domain adaptation paradigm for reading comprehension . they introduce self-attention attribution to weigh parameters and refine the lottery subnetwork . |
| Outcome: | The proposed model outperforms the full model fine-tuning adaptation on four out of five domains with a small amount of data available for adaptation. |
Copied to clipboard
| Challenge: | Currently, most of the neural extractive summarization systems score and extract sentences individually and model the relationship between sentences. |
| Approach: | They propose to instantiate a neural extractive summarization task as a semantic text matching problem and use it to match a source document and candidate summaries in a semantic space. |
| Outcome: | The proposed framework is faster and more efficient than existing frameworks. |
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: | 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: | Recent active learning methods are limited when the data distribution of learning problems vary. |
| Approach: | They propose a wake-and-dream-based active learning method that learns the AL policy directly on the target domain of interest by using wake and dream cycles. |
| Outcome: | The proposed method improves on cross-domain and cross-lingual tasks. |
Copied to clipboard
| Challenge: | In this paper, we examine the generalization behaviour of summarization models . we propose several properties of datasets that matter for generalization . |
| Approach: | They propose several properties of datasets which matter for generalization of summarization models. |
| Outcome: | The proposed approach improves the state-of-the-art model by rethinking the model design process on a typical dataset. |
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient fine-tuning excel in the context of single-backbone multi-tenant applications. |
| Approach: | They propose to integrate a lightweight vector generator within each Transformer layer to improve prompt-aware representation adjustment. |
| Outcome: | The proposed method surpasses current benchmarks in terms of performance despite having a similar number of adjustable parameters. |
Copied to clipboard
| Challenge: | Existing methods struggle to balance real-time adaptability and computational efficiency in continual learning scenarios. |
| Approach: | They propose a Continual Multimodal Entity and Relation Joint Extraction task and a Multimodal Prompt-based Boundary-enhanced Continuum framework that stores task-specific knowledge via learnable multimodal prompts. |
| Outcome: | The proposed framework outperforms baseline methods in real-world scenarios by 5.5% and 7.2%. |
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: | 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 approaches to recover and utilize negative samples have not been effective on all languages. |
| Approach: | They propose a multilingual dense passage retrieval framework to recover and utilize negative samples. |
| Outcome: | The proposed framework outperforms strong sparse, dense and hybrid baselines on a high-quality dataset covering eleven typologically diverse languages. |
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: | Grasping the concept of time is a fundamental facet of human cognition. |
| Approach: | They propose a hierarchical temporal reasoning benchmark that covers a broad spectrum of temporal phenomena. |
| Outcome: | The proposed benchmark shows that state-of-the-art LLMs are still far behind humans in temporal reasoning . |
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: | Recent studies show that providing meeting summaries does not align with current approaches to document summarization. |
| Approach: | They propose a framework for generating questionnaires for preference-based meeting exploration . they measure how much questions are answerable to ensure factual correctness . |
| Outcome: | The proposed framework provides a list of suggested questions reflecting user preferences . it measures how much questions are answerable to ensure factual correctness . |
Copied to clipboard
| Challenge: | Recent studies have revealed that chain-of-thought prompting significantly enhances LLM’s reasoning capabilities, which attracts widespread attention from both academics and industry. |
| Approach: | They propose to summarize advanced methods through a taxonomy that offers novel perspectives. |
| Outcome: | The proposed method delineates the challenges and future directions, thereby shedding light on future research. |
Copied to clipboard
| Challenge: | Recent advances have witnessed large language models (LLMs) achieving significant milestones across various domains of natural language processing. |
| Approach: | They introduce fine-grained attribution reasoning distillation (FARD) which incorporates grounded citations to consolidate the relationships between reasoning steps. |
| Outcome: | The proposed method outperforms CoT distillation methods on mathematical and general reasoning benchmarks. |
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: | 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: | Question answering (QA) and question generation (QG) are closely related tasks. |
| Approach: | They propose a training algorithm that generalizes both Generative Adversarial Network and Generating Domain-Adaptive Nets under the question answering scenario. |
| Outcome: | The proposed training algorithm generalizes both Generative Adversarial Network (GAN) and Generating Domain-Adaptive Nets (GDAN) under the question answering scenario. |
Copied to clipboard
| Challenge: | Existing approaches to machine reading comprehension treat documents at their hierarchical nature, ignoring their dependencies. |
| Approach: | They propose a machine reading comprehension benchmark with two-grained answers . they use graph attention networks to model documents at their hierarchical nature . |
| Outcome: | The proposed framework outperforms existing systems at long and short answer criteria. |
Copied to clipboard
| Challenge: | 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: | Autonomous agents powered by large language models (LLMs) have attracted significant research interest, but there are few standards for developing specialized models for agent tasks. |
| Approach: | They propose a series of large action models with dense and mixture-of-expert architectures that unifies, augments, and synthesizes diverse datasets to enhance agent generalizability and performance. |
| Outcome: | The proposed models outperform GPT-4, Claude-3, and many other models in terms of tool use and outperformed GPT-based models on multiple agent ability benchmarks. |
Copied to clipboard
| Challenge: | Experimental results confirm the substantial superiority of GranuSum on multi-granularity summarization over strong baselines. |
| Approach: | They propose to rank events by their salience and annotate a benchmark for GranuSum that contains multiple summaries at different granularities for each document cluster. |
| Outcome: | The proposed framework is capable of producing multi-granular summaries in unsupervised manner over strong baselines. |
Copied to clipboard
| Challenge: | Existing research on multi-modal Named Entity Recognition (MNER) does not integrate all multi-modal representations to provide rich contextual information to improve NER. |
| Approach: | They propose an iterative reasoning framework that integrates all the diverse multi-modal representations following the strategy of "decompose, prioritize, and eliminate" . they propose to use hierarchically connected fusion layers to prioritize transitions from "easy-to-hard" and "coarse-to fine" |
| Outcome: | The proposed framework integrates all the diverse multi-modal representations following the strategy of "decompose, prioritize, and eliminate". |
Copied to clipboard
| Challenge: | Prior work has explored step-level supervision using Shannon-entropy-based uncertainty signals, which conflate inherent state complexity with agent confidence. |
| Approach: | They propose a hierarchical group-based RL framework that leverages normalized entropy to locate outlier steps associated with trajectory neglect and optimizes them via a mechanism of trajectory-aware reward and trajectory-independent penalty. |
| Outcome: | Experiments on ALFWorld, WebShop, and Search-Augmented QA show that STAPO achieves state-of-the-art performance while substantially alleviating trajectory neglect. |
Copied to clipboard
| Challenge: | Existing methods to retrieve evidences from corpus are difficult due to table-text discrepancy and data sparsity problem. |
| Approach: | They propose an optimized OpenQA Table-Text Retriever to retrieve tabular and textual evidences from tabular resources. |
| Outcome: | The proposed OpenQA Table-Text Retriever significantly outperforms existing methods on QA tasks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated strong reasoning capabilities, but they still suffer from factual errors when tackling knowledge-intensive tasks. |
| Approach: | They propose a reasoning framework for knowledge-intensive multi-hop QA that prioritizes promising answers at each hop of question. |
| Outcome: | The proposed framework outperforms SOTA methods on four open-domain multi-hop reasoning datasets by 8.5%. |
Copied to clipboard
| Challenge: | Large Multimodal Models (LMMs) have demonstrated impressive performance on general video comprehension benchmarks, but their robustness needs to be thoroughly investigated for broader applications. |
| Approach: | They propose a temporal robustness benchmark which introduces temporal inconsistency perturbations separately at the visual and textual modalities to assess the robustness of models. |
| Outcome: | The proposed method improves the model’s robustness and reliability in temporal analysis. |
Copied to clipboard
| Challenge: | 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: | 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: | 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 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: | Existing methods for training generative models with minimal corpus are difficult . fine-tuning distinguishes tasks from parameter perspective but ignores model-structure perspective . |
| Approach: | They propose an algorithm that can customize a unique dialogue model for each task in the few-shot setting. |
| Outcome: | The proposed method outperforms baselines on two datasets in task consistency, response quality, diversity and consistency. |
Copied to clipboard
| Challenge: | Existing LLM pruning works focus on unstructured pruning, which typically requires special hardware support for a practical speed-up. |
| Approach: | They propose a network pruning framework that leverages both coarse and fine-grained activation information as an importance criterion to guide pruning. |
| Outcome: | The proposed framework outperforms existing pruning methods on diverse models across sparsity budgets. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) have experienced rapid development in recent years, but there is a notable lack of effective and specialized multimodal evaluation datasets in the financial domain. |
| Approach: | They introduce FinMME, a multimodal large language model with 11,000 financial research samples and 20 annotators. |
| Outcome: | The proposed model performs better than state-of-the-art models, highlighting its challenging nature. |
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 work models time implicitly, making it difficult to handle complex relationships . a novel temporal reasoning framework explicitly models the temporal relationships among facts by multi-view temporal graphs . |
| Approach: | They propose a multi-view temporal graph-based temporal reasoning framework that explicitly models the temporal relationships among facts by multi-visit temporal charts. |
| Outcome: | The proposed framework gives more consistent answers under question perturbations. |
Copied to clipboard
| Challenge: | Existing methods for infrared modeling ignore supervisory signals of infra-modality-specific attributes, which may lead to biased understanding of in-frarea images. |
| Approach: | They propose a multi-agent generation system which transfers knowledge from visible images to generate infrared image-text pairs and infra-instructional data. |
| Outcome: | The proposed system generates infrared image-text pairs and infra-response data and is able to answer common infreas tasks with the proposed model. |
Copied to clipboard
| Challenge: | Text normalization (TN) is an important step in conversational systems. |
| Approach: | They frame text normalization as a machine translation task and tackle it with sequence-to-sequence models. |
| Outcome: | The proposed model normalizes written text to its spoken form to facilitate speech recognition and text-to-speech synthesis. |
Copied to clipboard
| Challenge: | Existing methods for aspect-level sentiment classification are limited for dealing with overlapped features. |
| Approach: | They propose to use capsule network to construct vector-based feature representation and cluster features by an EM routing algorithm to model semantic relationship between aspect terms and context. |
| Outcome: | The proposed model achieves state-of-the-art on three datasets. |
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. |
Copied to clipboard
| Challenge: | Existing data augmentation techniques for natural language processing tasks are difficult to design. |
| Approach: | They propose a controllable rewriting based question data augmentation method for machine reading comprehension, question generation and question-answering natural language inference tasks. |
| Outcome: | The proposed method generates high-quality, high-quality question data samples on machine reading comprehension, question generation, and question-answering natural language inference tasks. |