Papers by Kai Wang
Copied to clipboard
| Challenge: | Using LSTM-CSS, we construct basic syntactic structure by completing syntastic structure. |
| Approach: | They propose a video captioning approach that progressively completes syntactic structure by a conditional random field to construct basic syntaktic structure. |
| Outcome: | The proposed method produces natural sentences with 42.3% and 28.5% accuracy compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing approaches to hierarchical text classification are limited by lack of domain knowledge, which leads to mistakes in a variety of situations. |
| Approach: | They propose a Knowledge-enabled Hierarchical Text Classification model which integrates knowledge graphs into HTC to address the knowledge limitations of traditional methods. |
| Outcome: | The proposed model integrates knowledge graphs into the hierarchical text classification process, addressing the knowledge limitations of traditional methods. |
Copied to clipboard
| Challenge: | Existing methods for testing time scales treat reasoning traces or tokens equally, ignoring substantial variations in trajectory quality and localized logical failures. |
| Approach: | They propose a chronological reasoning scorer that models each trajectory as a time series. |
| Outcome: | The proposed method achieves relative improvements of 34.21% over Pass@128 and 22.70% over Maj@135 on HMMT25, highlighting its effectiveness. |
Copied to clipboard
| Challenge: | End-to-end speech-to speech (S2S) dialogue systems face key challenges in incorporating external knowledge into their models. |
| Approach: | They propose a framework that directly retrieves relevant textual knowledge from speech queries. |
| Outcome: | The proposed framework improves the performance of end-to-end speech-tospeech dialogue systems while achieving higher retrieval efficiency. |
Copied to clipboard
| Challenge: | Recent studies have shown that Transformers is implicitly learning syntactic information from data, albeit is highly dependent on the quality and scale of the training data. |
| Approach: | They propose a syntax-guided localized self-attention model that allows directly incorporating grammar structures from an external constituency parser. |
| Outcome: | The proposed model improves translation performance on a variety of datasets, from small to large datasets and with different source languages. |
Copied to clipboard
| Challenge: | Existing approaches to simultaneous machine translation require a robust read/write policy . a standalone multi-path wait-k model performs competitively with adaptive policies . |
| Approach: | They propose a more flexible approach by decoupling the adaptive policy model from the translation model. |
| Outcome: | The proposed approach outperforms baseline approaches in translation tasks. |
Copied to clipboard
| Challenge: | Parameter-Efficient Fine-Tuning (PEFT) methods have gained popularity for adapting pre-trained Large Language Models (LLMs) to downstream tasks. |
| Approach: | They propose a method to optimize the importance of full layers with layer-wise importance scoring by leveraging the estimated importance scores. |
| Outcome: | The proposed method is compatible with PEFT methods that operate on a per-layer basis and achieves better performance. |
Copied to clipboard
| Challenge: | Existing automated review systems struggle with factual accuracy, rating consistency, and analytical depth. |
| Approach: | They propose a framework for generating comprehensive and factually grounded scientific paper reviews using supervised fine-tuning and reinforcement learning. |
| Outcome: | The proposed framework outperforms existing methods on ICLR 2025 papers. |
Copied to clipboard
| Challenge: | Existing methods for intent classification fail to distinguish new intents due to intertwined centers . a novel framework that learns geometry-aware representations to maximally separate all intents is proposed . |
| Approach: | They propose a new intent discovery framework that learns geometry-aware representations to maximally separate all intents. |
| Outcome: | The proposed framework achieves a new state-of-the-art performance on three benchmarking datasets. |
Copied to clipboard
| Challenge: | Existing long-text evaluation benchmarks, such as L-Eval and LongBench, focus on QA and summarization tasks. |
| Approach: | They propose a length-adaptable benchmark for evaluating the long-context understanding of large language models. |
| Outcome: | The proposed benchmarks do not cover ultralong settings (100k+ tokens) and are difficult to evaluate across different length ranges. |
Copied to clipboard
| Challenge: | Existing backdoor attacks against prompt-based learning involve injecting back doors into embedding layers or word embedders. |
| Approach: | They propose a backdoor attack against prompt-based learning that injects backdoors into embedding layers or word embeddable vectors. |
| Outcome: | The proposed backdoor attack outperforms two state-of-the-art models on six NLP tasks and three prompting strategies. |
Copied to clipboard
| Challenge: | Existing methods neglect domain-specific knowledge and use the same word embedding for each word in all domain-specified datasets. |
| Approach: | They propose a method to incorporate domain-specific and task-oriented information into meta-embeddings by combining pre-trained word embeddings. |
| Outcome: | The proposed method performs well on four text classification datasets and shows that it is compatible with existing methods. |
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: | Recent research in Text-to-Speech (TTS) has experienced great advancement . current models can synthesize speech for any given text and mimic the speaker of audio prompt. |
| Approach: | They propose a fully non-autoregressive text-to-speech system based on flow matching with Diffusion Transformer (DiT) without complex designs such as duration model, text encoder, and phoneme alignment, the text input is simply padded with filler tokens to the same length as input speech, and then denoising is performed for speech generation. |
| Outcome: | The proposed system achieves an inference RTF of 0.15, which is greatly improved compared to state-of-the-art diffusion-based models. |
Copied to clipboard
| Challenge: | Recent advances in vision-language models have unified perception and understanding tasks within Visual Question Answering paradigms. |
| Approach: | They propose to outline timeline, architecture, and pipeline of nearly all TIU MLLMs and review their performance on mainstream benchmarks. |
| Outcome: | The proposed models perform well on mainstream benchmarks and are compared with other models. |
Copied to clipboard
| Challenge: | Recent advances in agents have enabled multi-file, multi-language, and dependency-aware AI coding. |
| Approach: | They propose an SWE-level benchmark for AI coding in the Huawei Ascend CANN software stack. |
| Outcome: | The proposed benchmark is constructed from real-world CANN repositories and consists of over 400 task instances spanning multiple file, multi-language, and execution-aware coding challenges. |
Copied to clipboard
| Challenge: | In-context learning is a new learning paradigm where a language model conditions on a few input-output pairs (demonstrations) and a test input, and directly outputs the prediction. |
| Approach: | They propose a single model to retrieve demonstrations for a wide range of tasks by combining training signals from various tasks into a unified list-wise ranking formulation by language model’s feedback. |
| Outcome: | The proposed model outperforms baselines on 30+ tasks across 13 task families and multiple data domains. |
Copied to clipboard
| Challenge: | Existing approaches to personalize large language models (LLMs) rely on heuristic methods to compress user profiles but they ignore how LLMs process and prioritize different profile components. |
| Approach: | They propose an attention-guided context compression framework that leverages attention feedback from a marking model to mark important personalization sentences and guides a compression model to generate task-relevant compressed user contexts. |
| Outcome: | The proposed framework outperforms baselines across tasks, token limits, and settings while reducing token usage by 50 times. |
Copied to clipboard
| Challenge: | Existing methods for temporal knowledge graphs de-emphasize temporal correlations between facts sequences and ignore inferring clues from missing facts. |
| Approach: | They propose a Temporal PAth-based reasoning model that is robust to ambiguous temporal data. |
| Outcome: | The proposed model outperforms SOTA methods on the link prediction task. |
Copied to clipboard
| Challenge: | Existing dialogue systems focus on functional goals, open-domain chatbots on socially engaging conversations. |
| Approach: | They propose to add chit-chat to ENhance Task-ORiented dialogues by a human-assisted data collection approach to augment task-oriented dialogues with minimal annotation effort. |
| Outcome: | The proposed models can code-switch between task and chit-chat to be more engaging, interesting, knowledgeable, and humanlike while maintaining competitive task performance. |
Copied to clipboard
| Challenge: | Terminal simulation is a problem of symbolic language generation in dialogue and interactive systems. |
| Approach: | They propose a terminal command-level Turing test framework that improves realism, consistency and robustness in command-language generation. |
| Outcome: | The proposed framework outperforms state-of-the-art benchmarks by more than 9% on multi-turn terminal simulation. |
Copied to clipboard
| Challenge: | Existing models for document-level event argument extraction (D-EAE) lack key feature forgetting and cross-event argument confusion. |
| Approach: | They propose a document-level event argument extraction method based on guided summarization and reasoning that leverages the emergence capabilities of large language models to highlight key event information. |
| Outcome: | The proposed method outperforms baseline models by 1.3% F1 and 1.6% F1 on WIKIEVENTS and RAMS. |
Copied to clipboard
| Challenge: | Object navigation is a fundamental task in embodied artificial intelligence. |
| Approach: | They propose a region-aware Termination-Enhanced method that incorporates visual language models and exploration rates to enable efficient termination. |
| Outcome: | The proposed method achieves a success rate of 67.8% and an SPL of 31.3% on the HM3D dataset. |
Copied to clipboard
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Copied to clipboard
| Challenge: | Existing data arbitration strategies for large language model training rely on surface-level heuristics that fail to diagnose intrinsic learning needs. |
| Approach: | They propose a framework that arbitrates data based on its degree of cognitive conflict with the model's existing knowledge. |
| Outcome: | Extensive experiments on WebShop and ALFWorld show that PRISM outperforms state-of-the-art hybrid methods while reducing computational costs by up to 3.22 . |
Copied to clipboard
| Challenge: | Existing methods for selecting training data from general datasets fail to account for the joint distribution of instructions, resulting in inefficient learning and suboptimal knowledge transfer. |
| Approach: | They propose a method that constructs a mixed gradient-based instruction graph to capture the joint distribution and interdependencies among instructions. |
| Outcome: | The proposed method outperforms existing methods on domain adaptation tasks and in complex, data-scarce scenarios. |
Copied to clipboard
| Challenge: | Using neural machine translation to approximate human parity is difficult due to the lack of parallel training corpora. |
| Approach: | They propose an end-to-end deep learning framework for quality estimation and automatic post-editing of machine translation output. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the English–German dataset and human translators can significantly expedite their post-editing processing with the model. |
Copied to clipboard
| Challenge: | Existing methods for deep reinforcement learning lack the ability to learn the relationship between dialogue states and actions. |
| Approach: | They propose a graph-structured dialogue policy framework for task-oriented dialogue systems that uses bipartite graphs to construct two different bipartites and generate user-related and knowledge-related subgraphs. |
| Outcome: | The proposed framework significantly improves the effectiveness and stability of dialogue policies. |
Copied to clipboard
| Challenge: | Existing claims verification models rely on annotated data, which is expensive to create at a large scale. |
| Approach: | They propose a model that can verify complex claims without annotated data . they leverage the in-context learning ability of Large Language Models to translate a claim into a First-Order-Logic clause . |
| Outcome: | The proposed model outperforms baseline models on three datasets . it performs well on the datasets, and the results are published online. |
Copied to clipboard
| Challenge: | Existing methods to generate valid and fluent questions from text are limited and insufficient for training. |
| Approach: | They propose to generate multi-hop reasoning questions from the raw text in a low resource circumstance by deducing over multiple relations on several sentences in the text. |
| Outcome: | The proposed model can be applied to the task of machine reading comprehension and achieve significant performance improvements. |
Copied to clipboard
| Challenge: | Existing CRS datasets suffer from data inextensibility and semantic inconsistency . |
| Approach: | They introduce the LLM-REDIAL dataset to facilitate the research in CRS by leveraging large language models to generate high-quality dialogues. |
| Outcome: | The proposed dataset is the largest multi-domain CRS dataset which consists of 47.6k multi-turn dialogues with 482.6k utterances across 4 domains. |
Copied to clipboard
| Challenge: | Existing methods to train offline MT models require generating target tokens before source sentence is fully consumed. |
| Approach: | They propose a method that leverages traditional translation models as teachers to generate monotonic yet accurate reference translations for sequence-level knowledge distillation. |
| Outcome: | The proposed approach improves on strong baselines and on a monotonic version of the WMT15 De-En test set. |
Copied to clipboard
| Challenge: | Open-world knowledge graph completion (KGC) aims to infer novel facts by enriching existing graphs with external knowledge sources while maintaining semantic consistency under the open-world assumption (OWA). |
| Approach: | They propose a multi-source knowledge enhancement framework based on an open-world assumption (OWA) that integrates external knowledge sources and a new evaluation strategy to validate new facts. |
| Outcome: | The proposed model achieves SOTA performance across benchmarks and the evaluation strategy effectively assesses new facts under OWA. |
Copied to clipboard
| Challenge: | Critique Fine-Tuning (CFT) is a promising paradigm for unlocking the reasoning capabilities of large language models. |
| Approach: | They propose a method that leverages critique data generated from a single math problem to improve reasoning accuracy. |
| Outcome: | The proposed method surpasses one-shot RLVR while requiring 15 to 20 times less compute. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated proficiency across various NLP tasks but often require additional training, such as continual pre-training and supervised fine-tuning. |
| Approach: | They propose to leverage sparsity in pre-trained LLMs to accelerate training by disregarding computations for unimportant neurons. |
| Outcome: | The proposed framework achieves comparable or superior performance to standard training while significantly accelerating the process. |
Copied to clipboard
| Challenge: | Large language models suffer from knowledge gaps and hallucinations, resulting in incorrect or poor reasoning. |
| Approach: | They propose Graph retrieval-augmented generation (GraphRAG) which integrates structured knowledge from external graphs to enhance model's reasoning. |
| Outcome: | Experiments on knowledge graph QA tasks show that GraphRAG significantly improves reasoning performance across multiple backbone models. |
Copied to clipboard
| Challenge: | tense inconsistency is a common problem in machine translation systems. |
| Approach: | They propose a parallel tense test set, containing French-English 552 utterances, and introduce a benchmark, tence prediction accuracy. |
| Outcome: | The proposed model can measure the tense consistency performance of machine translation systems for the first time. |
Copied to clipboard
| Challenge: | Existing studies focus on evaluating large language models' ability to handle disagreement cases. |
| Approach: | They evaluate the performance of large language models in detecting offensive language at varying levels of agreement. |
| Outcome: | The proposed model improves detection accuracy and model alignment with human judgment by using disagreement samples in training. |
Copied to clipboard
| Challenge: | Existing approaches to deploy large language models (LLMs) into RecSys have limited prompt length, unstructured item information, and un-constrained generation of recommendations. |
| Approach: | They propose a taxonomy-guided recommendation framework that empowers LLMs with category information in a systematic approach. |
| Outcome: | The proposed framework significantly improves recommendation quality compared to zero-shot approaches. |
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: | Few-shot text matching is a more practical technique to determine whether two texts are semantically identical. |
| Approach: | They propose a pluggable prompt learning method for few-shot text matching . they use the semantics of instances to regulate the effects of the gate on the prompt tokens . |
| Outcome: | The proposed method outperforms baselines on MRPC and QQP. |
Copied to clipboard
| Challenge: | Recent advances in tool learning have enabled large language models to integrate external tools, enhancing their task performance by expanding their knowledge boundaries. |
| Approach: | They propose a framework that combines probabilistic knowledge boundary estimation with dynamic decision-making to allow LLMs to better assess when to invoke tools based on their confidence. |
| Outcome: | The proposed framework shows significant improvements in tool efficiency by reducing unnecessary tool usage. |
Copied to clipboard
| Challenge: | Existing methods for generating multi-turn dialogue data struggle to ensure both diversity and quality in instructions. |
| Approach: | They propose a framework that synthesizes multi-turn conversations through an iterative "Ask-Respond-Review" process involving three agent roles: a Candidate, multiple Reviewers, and a Chairman. |
| Outcome: | The proposed framework synthesizes multi-turn conversations through an iterative "Ask-Respond-Review" process involving three agent roles: a Candidate, multiple Reviewers, and a Chairman. |
Copied to clipboard
| Challenge: | Time series anomaly detection (TSAD) has traditionally focused on binary classification and lacks the fine-grained categorization and explanatory reasoning required for transparent decision-making. |
| Approach: | They propose a time-series reasoning task that reformulates TSAD from discriminative to reasoning-intensive paradigm. |
| Outcome: | The proposed task reformulates TSAD from discriminative to reasoning-intensive paradigm. |
Copied to clipboard
| Challenge: | Modern Large Language Models (LLMs) facilitate high-quality, multi-turn dialogues with humans, but human-based evaluation of such a capability requires substantial manual effort. |
| Approach: | They propose to evaluate LLMs' ability to emulate human-like, multi-turn conversations using an LLM-centric approach. |
| Outcome: | The proposed model emulates human-like, multi-turn conversations using an LLM-centric approach. |
Copied to clipboard
| Challenge: | Existing neural IR models do not have a mechanism for treating expansion terms differently from the original query terms, making it difficult to combine them with existing PRF approaches. |
| Approach: | They propose an end-to-end neural PRF framework that can be used with existing neural IR models by embedding different neural models as building blocks. |
| Outcome: | Extensive experiments on two standard test collections confirm the effectiveness of the proposed framework in improving the performance of two state-of-the-art neural IR models. |
Copied to clipboard
| Challenge: | Large language models (LLMs) can handle multilingual and cross-lingual text within a single input; however, previous studies focusing on using English as the pivot language to enhance language understanding and reasoning focus on using multiple languages. |
| Approach: | They propose to use parallel multilingual input to enhance the model's comprehension of the input and to examine how multilingual processing affects prediction. |
| Outcome: | The proposed model can handle multilingual and cross-lingual text within a single input, but previous studies focused on using English as the pivot language to enhance language understanding and reasoning. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) based on Mixture-of-Experts (MoE) enforce uniform expert sizes, creating a rigidity that fails to align computational costs with varying token-level complexity. |
| Approach: | They propose a mixture of heterogeneous grouped experts (MoHGE) that allows for flexible, resource-aware expert combinations. |
| Outcome: | The proposed model matches the performance of existing Mixture-of-Experts architectures while maintaining balanced GPU utilization. |
Copied to clipboard
| Challenge: | Existing pointwise LLMs provide noisy or biased answers for documents that are partially relevant to the query. |
| Approach: | They propose to incorporate fine-grained relevance labels into the LLM prompt . they propose to better differentiate between documents with different levels of relevance . |
| Outcome: | The proposed model can differentiate between documents with different levels of relevance to the query and derive a more accurate ranking. |
Copied to clipboard
| Challenge: | Existing studies in text-to-SQL do not require generating complex SQL queries with multiple clauses or sub-queries. |
| Approach: | They propose a syntax tree network to address the complex text-to-SQL generation task. |
| Outcome: | The proposed model outperforms the current state-of-the-art model by 9.5% on a large text-to-SQL corpus. |
Copied to clipboard
| Challenge: | Despite the promising performance of Large Vision Language Models, they sometimes generate incorrect outputs. |
| Approach: | They propose a multi-modal reward model that aligns LVLMs with human preferences. |
| Outcome: | The proposed model achieves excellent results on the latest multi-modal reward model benchmark and shows competitive performance on text-only reward model. |
Copied to clipboard
| Challenge: | Using data and data, self-improvement for Large Language Models has improved model capabilities without significantly increasing costs. |
| Approach: | This survey provides a comprehensive overview of self-improvement for Large Language Models . it includes commonly used evaluations and downstream applications . |
| Outcome: | The authors provide a comprehensive overview of self-improvement in Multimodal LLMs. |
Copied to clipboard
| Challenge: | Existing language evaluation benchmarks for English are limited to English . lack of such benchmarks makes it difficult to replicate success in other languages . |
| Approach: | They introduce a large-scale Chinese language understanding evaluation benchmark . the benchmark uses a set of current state-of-the-art pre-trained Chinese models . |
| Outcome: | The first large-scale Chinese Language Understanding Evaluation (CLUE) benchmark is released . the benchmark evaluates models across a wide range of tasks on original Chinese text . existing language evaluation benchmarks are mostly limited to English . |
Copied to clipboard
| Challenge: | Existing methods for offsite-tuning of large language models require high computational costs and lack theoretical analysis. |
| Approach: | They propose an offsite-tuning approach that selectively applies compression techniques such as rank compression and channel pruning to preserve the gradients of fine-tuned adapters while ensuring privacy. |
| Outcome: | The proposed method surpasses existing OT methods in privacy protection and model performance. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) have achieved remarkable performance gains across numerous downstream tasks in natural language understanding. |
| Approach: | They propose a Chinese pre-trained language model that implicitly encodes words into characters . they propose 'contrastive learning over word' and 'character' representations to improve learning . |
| Outcome: | The proposed model can encode words into fine-grained representations without modification of production pipelines. |
Copied to clipboard
| Challenge: | a multimodal protein language model (LLM) integrates sequence, structure, and function into functional annotation. |
| Approach: | They propose a multimodal protein language model that synergistically aligns bimodal representations with the textual modality to advance protein functional annotation. |
| Outcome: | The proposed model synergizes bimodal representations with the textual modality to advance protein functional annotation. |
Copied to clipboard
| Challenge: | Recent work on neural machine translation (NMT) has demonstrated impressive performance improvements and became the de-facto standard. |
| Approach: | They propose a dynamic curriculum learning method to reorder training samples in training using a Transformer-based system. |
| Outcome: | The proposed method outperforms baselines on three low-resource machine translation benchmarks and different sized data of WMT’16 En-De. |
Copied to clipboard
| Challenge: | Existing LLM agents are brittle in open-ended environments due to two limitations: 1) a closed action space; 2) myopic error recovery. |
| Approach: | They propose a novel architecture that augments the action space and revises global strategies by adding a reflective replanning mechanism to the system. |
| Outcome: | Experiments show that CAR outperforms baselines in a diagnostic benchmark with pruned toolsets to simulate tool scarcity. |
Copied to clipboard
| Challenge: | Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings. |
| Approach: | They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data. |
| Outcome: | Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base. |
Copied to clipboard
| Challenge: | Group-Relative Policy Optimization (GRPO) has emerged as an efficient paradigm for aligning Large Language Models (LLMs), but its efficacy is confined to domains with verifiable ground truths. |
| Approach: | They propose a meta-cognitive orchestration layer that treats reward scalarization as a dynamic latent policy, leveraging the model’s terminal hidden states as 'a semantic bottleneck' . Across seven benchmarks, MAESTRO consistently outperforms single-reward and static multi-objective baselines while preserving the efficiency advantages of GRPO. |
| Outcome: | The proposed model outperforms single-reward and static multi-objective baselines while preserving efficiency advantages. |
Copied to clipboard
| Challenge: | Existing models focus on a single therapy, but complex cases require flexible strategies among various therapies. |
| Approach: | They propose a multi-session, multi-therapy, and highly realistic benchmark . it is designed to address three key challenges: 1) can we train a highly realistic AI counselor? 2) How to systematically evaluate an AI counselor?" |
| Outcome: | The proposed benchmark is annotated with extensive professional skills and includes over 677 meta-skills and 4577 atomic skills. |
Copied to clipboard
| Challenge: | Existing methods for inference are expensive and lack spatial redundancy . Discrete Diffusion Language Models are a promising paradigm for multimodal generation . |
| Approach: | They propose a locality-aware dynamic rescue method that exploits spatial Markov property of images. |
| Outcome: | The proposed method achieves an approximate 4 speedup over baselines on four text-to-image generation benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for Named Entity Recognition (NER) use a similarity metric to measure semantic similarity between test samples and referents, but their performance is limited due to the label scarcity. |
| Approach: | They propose a novel approach to learn a similarity metric for measuring the semantic similarity between test samples and referents, where each referent represents an entity class. |
| Outcome: | The proposed approach outperforms state-of-the-art models with a significant margin in most cases. |
Copied to clipboard
| Challenge: | Entity Linking (EL) is the process of associating ambiguous textual mentions to specific entities in a knowledge base. |
| Approach: | They propose a framework that utilizes the few-shot learning capabilities of Large Language Models without the need for fine-tuning to improve the accuracy of EL. |
| Outcome: | The framework outperforms current state-of-the-art methods in a few-shot entity linking task. |
Copied to clipboard
| Challenge: | Existing methods for personality analysis treat corpus as a single unit for classification, but this approach presents several challenges. |
| Approach: | They propose a task paradigm for text-based personality representation learning that uses a triplet personality trend comparison dataset to learn single-sentence personality embeddings with desirable metric properties. |
| Outcome: | The proposed model significantly boosts performance across various applications, including personality detection, personality retrieval, and emotion translation prediction. |
Copied to clipboard
| Challenge: | a recent study shows that large language models have limited generalization in low-resource languages like Chinese. |
| Approach: | They propose to evaluate the zero-shot generalizability of large language models to the Chinese language . they release only half of the dataset publicly, with the remainder kept private . |
| Outcome: | The Chinese Instruction-Following Benchmark evaluates the generalizability of LLMs to the Chinese language. |
Copied to clipboard
| Challenge: | Recent knowledge graph embedding models based on hyperbolic geometry are complicated than Euclidean operations. |
| Approach: | They propose to use hyperbolic geometry to generate high-fidelity and parsimonious representations of hierarchical patterns in knowledge graphs. |
| Outcome: | The proposed models achieve state-of-the-art performance on two widely-used datasets and cost less than RotH. |
Copied to clipboard
| Challenge: | Traditional recommender systems focus on the user-platform paradigm, where users are directly exposed under the control of the platform's recommendation algorithms. |
| Approach: | They propose a user-agent-platform paradigm where agent serves as the protective shield between user and recommender system that enables indirect exposure. |
| Outcome: | The proposed model improves 16.6% over baselines on four datasets and mitigates echo chamber effects and reduces model bias in disadvantaged users. |
Copied to clipboard
| Challenge: | Existing approaches to conversational Query Reformulation (CQR) suffer from high dependency on external supervision from annotations or large language models and insufficient alignment between the rewriter and downstream retrievers. |
| Approach: | They propose a framework that transforms context-dependent queries into self-contained forms suitable for off-the-shelf retrievers. |
| Outcome: | The proposed framework outperforms existing methods on topiOCQA and QReCC datasets while using smaller 3B parameter models without external supervision. |
Copied to clipboard
| Challenge: | Existing evaluation protocols and metrics do not capture the full spectrum of LLM capabilities, especially in complex reasoning tasks. |
| Approach: | They propose a new evaluation metric that continuously assesses model performance across multiple sampling attempts, quantifying both the model’s potential capabilities and operational consistency. |
| Outcome: | The proposed evaluation metric measures model performance across multiple sampling attempts and provides comprehensive insights into their potential capabilities and operational consistency. |
Copied to clipboard
| Challenge: | Large language models have shown remarkable performances across a wide range of tasks, but mechanisms by which they encode tasks of varying complexity remain poorly understood. |
| Approach: | They propose to explore the possibility that LLMs process concepts in different layers . they propose to categorize concepts based on their level of abstraction . |
| Outcome: | The proposed model can process complex concepts in shallow layers, the authors show . the proposed model could be used to prob complex tasks in shallow ones . |
Copied to clipboard
| Challenge: | Existing video metrics are lagging behind in providing reliable scores over generated videos due to lack of large-scale human-annotated dataset. |
| Approach: | They propose to use VideoFeedback to train a human-annotated multi-aspect score over 37.6K synthesized videos from 11 existing video generative models. |
| Outcome: | The proposed model outperforms the prior best metrics by 50 points in the test. |
Copied to clipboard
| Challenge: | Autoregressive (AR) language models are a dominant paradigm in the field of parallelism and non-causal modeling. |
| Approach: | They propose a blockwise discrete diffusion model that preserves AR-compatible serving while enabling parallel intra-block generation. |
| Outcome: | The proposed model achieves theoretical speedups over 5 and wall-clock speedup of 2.3 on H200 GPUs in latency-critical regimes. |
Copied to clipboard
| Challenge: | Existing studies focus on multimodal dialogue models but neglect generation methods. |
| Approach: | They propose a multimodal dialogue response generation task which requires multimodal dialogs containing both texts and images which are difficult to obtain. |
| Outcome: | Experiments show that the proposed model can generate informative text and high-resolution image responses. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown promising advances in tackling human-level tasks, but generating workflows for collaborative AI systems remains a critical and challenging step. |
| Approach: | They propose a benchmark to evaluate LLMs’ ability to generate executable and instruction-following AIGC workflows in ComfyUI. |
| Outcome: | The proposed benchmarks show that LLMs can generate executable and instruction-following AIGC workflows in ComfyUI. |
Copied to clipboard
| Challenge: | GigaSpeech 2 is a large-scale, multi-domain, multilingual speech recognition corpus for low-resource languages. |
| Approach: | They propose a large-scale, multi-domain, multilingual speech recognition corpus for low-resource languages and an automated pipeline for data crawling, transcription, and label refinement. |
| Outcome: | The proposed corpus reduces the word error rate for Thai, Indonesian, and Vietnamese on a realistic YouTube test set by 25% to 40% compared to Whisper large-v3. |
Copied to clipboard
| Challenge: | Recent advances in speech translation (ST) research have focused on the unique characteristics of spontaneous speech, including accents and presentation quality. |
| Approach: | They propose to transform transcribed speech into a cleaner style more in line with the expectations of translation models built from written text. |
| Outcome: | Experiments on public and in-house translation models show that the proposed model can be effectively distilled into a standalone translation model. |
Copied to clipboard
| Challenge: | Recent work utilizes feedbacks generated from erroneous cases to guide prompt optimization . previous methods rely on computational resources and powerful GPUs . |
| Approach: | They propose an automatic prompt engineering method that leverages feedbacks from erroneous cases to guide prompt optimization. |
| Outcome: | The proposed method surpasses state-of-the-art methods with less steps and lower computational resources. |
Copied to clipboard
| Challenge: | Neural audio codecs have enabled high-fidelity reconstruction of speech, music and sound . however, speech-optimized codec systems suffer degradation on music or sound if they ignore spectral differences . |
| Approach: | They propose a neural audio codec that splits the spectral dimension into separate bands and compresses each band independently. |
| Outcome: | Experimental results show that BSCodec achieves better reconstruction quality on music and sound compared to existing codecs. |
Copied to clipboard
| Challenge: | Recent advances in multimodal large language models have led to progress in tackling complex reasoning tasks that combine textual and visual information. |
| Approach: | They introduce a robust version of the Massive Multi-discipline Multimodal Understanding and Reasoning (MMMU) benchmark. |
| Outcome: | The proposed model performs lower on MMMU-Pro than on the previous benchmark, ranging from 16.8% to 26.9%. |
Copied to clipboard
| Challenge: | Existing datasets for semantic parsing are too small in terms of number of programs for training modern data-intensive models. |
| Approach: | They propose a large-scale complex and cross-domain semantic parsing task for a database . they use a dataset with 10,181 questions and 5,693 unique complex SQL queries . |
| Outcome: | The proposed task is different from previous tasks because it uses the same database and program . the best model achieves only 9.7% exact matching accuracy on a database split setting. |
Copied to clipboard
| Challenge: | Existing systems focus on making autonomous driving decisions without human interaction, but human-like decision-making is still an important factor in designing autonomous driving systems. |
| Approach: | They propose a framework leveraging Large Language Models for learning human-centered driving decisions from diverse simulation scenarios and environments that incorporate human feedback. |
| Outcome: | The proposed framework can match baseline extensively trained reinforcement learning models in driving scenarios and store optimal driving programming policy using Retrieval Augmented Generation (RAG). |
Copied to clipboard
| Challenge: | Existing models that assume users to be static, rational agents with fixed preferences fail to capture rich behavioral heterogeneity in real-world debt collection scenarios. |
| Approach: | They propose a public persona-enriched debt collection benchmark that highlights behavioral heterogeneity in negotiation. |
| Outcome: | The proposed benchmark outperforms existing models in realistic scenarios using 16 state-of-the-art LLMs. |
Copied to clipboard
| Challenge: | Existing benchmarks explore aspects of threedimensional spatial reasoning and visual-language reasoning in dynamic environments, but they are unable to perform well on 3D spatial deformation reasoning. |
| Approach: | They propose to use a ladder competition format to assess the model's spatial deformation reasoning abilities to determine its performance. |
| Outcome: | The proposed framework assesses the performance of Vision-Language Models in spatial deformation reasoning tasks. |
Copied to clipboard
| Challenge: | Existing training-free methods for extrapolating beyond training context lengths are semantics-agnostic . Existing methods that focus on relative token distances can indiscriminately blur semantically relevant and irrelevant tokens . |
| Approach: | They propose an adaptive positional zooming method that uses semantic relevance to extrapolate beyond training context lengths. |
| Outcome: | Experiments show that RiPRA outperforms existing training-free extrapolation methods . relevant tokens get higher positional resolution, while irrelevant tokens are compressed . |
Copied to clipboard
| Challenge: | Long, multi-round, multirole interaction trajectories lead to severe information dilution and context window overload, triggering context collapse which destabilizes reasoning. |
| Approach: | They propose a multi-agent framework that compresses and reorganizes multi-round consensus. |
| Outcome: | The proposed framework outperforms baselines across text-based and multimodal tasks while demonstrating superior diagnostic performance and stability in complex clinical scenarios. |
Copied to clipboard
| Challenge: | Large-scale language models with prompts have shown remarkable performance on few-shot learning. |
| Approach: | They propose an approach to improve SMAll language models’ few-SHot ability by training on intermediate tasks before prompt-based fine-tuning on downstream tasks. |
| Outcome: | The proposed model improves on sentence-pair and sentiment classification tasks by training on intermediate tasks before fine-tuning on downstream tasks. |
Copied to clipboard
| Challenge: | Existing structured document understanding models only deal with document data of specific language(s) this is extremely limited for other languages, especially in the case of lacking pre-training structured document data. |
| Approach: | They propose a language-independent Layout Transformer (LiLT) for structured document understanding . they propose to pre-train structured documents in a single language and fine-tune them on other languages . |
| Outcome: | The proposed model achieves competitive or even superior performance on diverse downstream benchmarks on eight languages. |
Copied to clipboard
| Challenge: | Existing approaches to predict dialogue state from scratch are inefficient and lead to errors . empirical results show that our method achieves 56.93%, 60.73%, and 58.04% joint accuracy on multi-domain conversations . |
| Approach: | They propose a dual-stage dialogue state tracking method that uses a slot selector and a Slot Value generator to predict the current dialogue state. |
| Outcome: | The proposed method achieves 56.93%, 60.73%, and 58.04% joint accuracy on multi-domain conversations. |
Copied to clipboard
| Challenge: | Existing datasets focused on multiturn dialogue systems focus on text or table information. |
| Approach: | They propose a dataset that consists of crowdsourced conversations grounded on Wikipedia text and tables. |
| Outcome: | The proposed dataset shows that there is still ample opportunity for improvement in the current state of dialogue systems. |
Copied to clipboard
| Challenge: | Existing preference optimization methods such as DPO and KTO are inherently derived from PPO, requiring a reference model that adds GPU memory resources and relies heavily on abundant preference data. |
| Approach: | They propose an algorithm that leverages the average likelihood of model responses to fit the reward function and maximizes the utilization of preference data. |
| Outcome: | The proposed algorithm outperforms DPO, ORPO, and SimPO on MT-Bench and Arena-Hard. |
Copied to clipboard
| Challenge: | Tabular data preparation is a critical step in enhancing the usability of tabular data. |
| Approach: | They analyze how LMs can be combined with other components for different tabular data preparation tasks. |
| Outcome: | The proposed methods lack the ability to capture the relationships within tables and adapt to the tasks involved. |
Copied to clipboard
| Challenge: | Knowledge Graph (KG) inductive reasoning is widely adopted in various applications. |
| Approach: | They propose a framework for low-resource inductive reasoning using Large Language Models to generate a graph-structural prompt for pre-trained KGs. |
| Outcome: | The proposed framework outperforms previous methods in three-shot, one-shot and zero-shot reasoning tasks. |
Copied to clipboard
| Challenge: | k-Nearest-Neighbor Machine Translation (kNN-MT) is a non-parametric solution for domain adaptation . previous studies have shown that kNN retrieval is at the expense of high latency . |
| Approach: | They propose to use clustering to improve retrieval efficiency by combining a non-parametric MT with an in-domain feature-based retrieval module. |
| Outcome: | The proposed method reduces translation latency by 57% while maintaining the most useful information of the original datastore. |
Copied to clipboard
| Challenge: | Existing research has focused on role-playing agents’ ability to portray specified characters, but their ability to advance the plot requires substantial improvements to deliver more engaging interaction. |
| Approach: | They propose a role-playing framework to evaluate and enhance the plot-progression capabilities of role-players. |
| Outcome: | The proposed framework improves RPAs’ ability to time plot developments and yields a significant increase in conversation turns and sustained higher arousal levels. |
Copied to clipboard
| Challenge: | Large vision-language models often prioritize language knowledge over image information on visual reasoning tasks, incurring performance degradation. |
| Approach: | They propose a visual reasoning framework that decouples vision-reasoning capabilities and multi-run proactive perception. |
| Outcome: | The proposed framework outperforms existing models on benchmarks for open-source and closed-source models with 13.2% performance gain. |
Copied to clipboard
| Challenge: | Existing methods to improve factuality of large language models (LLMs) rely on human-engineered instructions. |
| Approach: | They propose a retrieval-augmented generation framework that trains the model with distractor-aware QA pairs mixing gold evidence with subtle distractor passages and instills reasoning-centric habits that make the LLM plan, rationalize, and synthesize without extensive human engineered instructions. |
| Outcome: | The proposed framework outperforms state-of-the-art solutions across 12 open-book RAG QA benchmarks and is being deployed in production. |
Copied to clipboard
| Challenge: | Existing methods for generating reward models focus on outcome-level supervision, neglecting analytical process quality, which constrains their potential. |
| Approach: | They propose a novel reward model that leverages self-reflection to assess analytical quality and enhance preference modeling. |
| Outcome: | The proposed model improves performance on four benchmarks and significantly mitigates positional bias. |
Copied to clipboard
| Challenge: | Evaluating software engineering capabilities is a core component of large language models (LLMs). |
| Approach: | They propose a benchmark to evaluate LLM-generated test suites that introduces mutated solutions that attempt to "fool" them. |
| Outcome: | The proposed test suites are based on 2,636 mutated variants derived from 800 original instances and include a multilingual subset spanning nine programming languages. |
Copied to clipboard
| Challenge: | Unsupervised sentence representation learning is one of the fundamental problems in natural language processing . contrastive learning methods fail to capture fine-grained ranking information among the sentences . |
| Approach: | They propose a novel approach for unsupervised sentence representation learning that integrates ranking consistency and ranking distillation with contrastive learning into a unified framework. |
| Outcome: | The proposed approach performs better over state-of-the-art models on STS and TR tasks. |
Copied to clipboard
| Challenge: | Existing claim verification datasets often do not require systems to perform complex reasoning or effectively interpret multimodal evidence. |
| Approach: | They propose a task that requires models to reason over multiple pieces of evidence . they construct a large-scale dataset comprising 15k multi-hop claims paired with multimodal evidence - generated and refined using large language models with additional input from human feedback. |
| Outcome: | The proposed method is based on human performance benchmarks and human reasoning hops. |
Copied to clipboard
| Challenge: | Existing causal datasets focus on the commonsense domain, but LLMs perform poorly when answering complex questions. |
| Approach: | They propose a multidisciplinary causal evaluation benchmark to assess LLMs' knowledge and skills. |
| Outcome: | The proposed model improves in domain specialization, structural diversity, and task complexity. |
Copied to clipboard
| Challenge: | Existing general-domain benchmarks do not capture complexity of real-world judicial cognition and decision-making. |
| Approach: | They propose a benchmark specifically designed to evaluate LLM Agents in the legal domain. |
| Outcome: | The proposed benchmark includes 17 corpora from real-world legal scenarios and provides 37 tools for interacting with external knowledge. |
Copied to clipboard
| Challenge: | Existing methods for predicting sentiment polarity of aspects are susceptible to interference caused by irrelevant contexts and lack sentiment knowledge at a data-specific level. |
| Approach: | They propose a novel Aspect-based sentiment analysis method that leverages attention scores to model the relationships between aspects and contexts. |
| Outcome: | The proposed method is able to predict sentiments from a set of five benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods for MU degrade model utility, especially when accessing the original training data. |
| Approach: | They propose a method that eliminates the influence of unlearned data by modulating the outputs of merely 1% of the neurons in the feed-forward network modules within the Transformer blocks. |
| Outcome: | The proposed method eliminates the influence of unlearned data from Large Language Models by modulating the outputs of 1% of the neurons in the feed-forward network modules within the Transformer blocks, minimizing disruption to the model’s performance. |
Copied to clipboard
| Challenge: | Existing approaches to optimize large language models for long-context inference are inefficient and consume memory. |
| Approach: | They propose a mixed-precision quantization method via mixture of experts that inputs tokens into router chunk by chunk to reduce inference overhead. |
| Outcome: | The proposed method outperforms state-of-the-art KV cache quantization methods on multiple benchmark datasets. |
Copied to clipboard
| Challenge: | Existing work on long document visual question answering is based on Retrieval-Augmented Generation (RAG) where textual or visual content is encoded into embeddings and relevance is determined by similarity scores with respect to the original query. |
| Approach: | They propose a framework that employs an agentic, vision-aware workflow to address long document visual question answering through iterative information discovery and synthesis. |
| Outcome: | The proposed framework outperforms existing RL systems by 10.4% on the MMLongbench-Doc benchmark and demonstrates superior training performance over GRPO. |
Copied to clipboard
| Challenge: | Prior research has found that only a few attention heads are important in each mono-lingual NLP task and pruning the remaining heads leads to comparable or improved performance of the model. |
| Approach: | They examine the relative importance of attention heads in Transformer-based models to aid their interpretability in cross-lingual and multi-lingual tasks. |
| Outcome: | The proposed model performs better with the remaining heads pruned than with the other models, the authors show . |
Copied to clipboard
| Challenge: | Existing benchmarks of large language models focus on error detection, neglecting other scenarios like reasoning search. |
| Approach: | et al. propose a multi-task, multimodal benchmark to assess effectiveness of PRMs . step correctness, answers aggregation and reasoning process search are evaluated . ethical principles of MPBench are based on a set of evaluation paradigms based in a text-based benchmark . |
| Outcome: | a new benchmark assesses the effectiveness of large language models (LLMs) in multiple scenarios . it uses three evaluation paradigms to assess the effectiveness and compares them with existing models . a the proposed model improves reasoning accuracy by providing stepwise feedback for multi-step reasoning results . |
Copied to clipboard
| Challenge: | Existing methods for predicting judgment results for multiple defendants are ineffective. |
| Approach: | They propose a method to predict the judgment results for each defendant in multi-defendant cases . they formalize the multi-diffendant judgment process as hierarchical reasoning chains . |
| Outcome: | The proposed method can predict the judgment results for multiple defendants in multi-defendant cases. |
Copied to clipboard
| Challenge: | Recent years have seen rapid growth in the MRC community . MRC is believed to be a crucial step in building a general intelligent agent . |
| Approach: | They propose an end-to-end neural model that enables multiple passages to verify each other based on their content representations. |
| Outcome: | The proposed model outperforms the baseline on the English MS-MARCO dataset and the Chinese DuReader dataset, and achieves state-of-the-art performance on both datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown exceptional capabilities across a wide range of tasks, but reliable evaluation remains a challenge due to data contamination, opaque operation, and subjective preferences. |
| Approach: | They propose a benchmark-free evaluation paradigm that organizes multiple LLMs into a self-governed league for multi-round mutual evaluation. |
| Outcome: | Experiments on eight mainstream LLMs in mathematics and programming show that the proposed model can distinguish capabilities while maintaining high internal ranking stability. |
Copied to clipboard
| Challenge: | Existing models fail to recall and accurately apply designated persona knowledge without explicit cues . memory-driven role-playing paradigms are attracting significant interest . |
| Approach: | They propose a memory-driven role-playing paradigm that frames persona knowledge as the LLM's internal memory store and a prompting architecture that guides structured memory retrieval and response generation. |
| Outcome: | The proposed paradigm provides a comprehensive diagnostic for four-stage role-playing abilities across 12 LLMs. |
Copied to clipboard
| Challenge: | Existing methods to rank documents using large language models do not understand these challenging ranking formulations. |
| Approach: | They propose to use Pairwise Ranking Prompting to improve ranking performance . they propose to outperform fine-tuned baseline rankers on benchmark datasets . |
| Outcome: | The proposed technique outperforms supervised baselines on benchmark datasets and outperformed other LLM-based solutions by over 10% on average. |
Copied to clipboard
| Challenge: | a topic classifier can understand only class labels when training for tasks that require a large amount of labeled documents. |
| Approach: | They propose an algorithm that can initialize a topic classifier using only class labels . they propose a method that combines word embedding and naive Bayes classification . |
| Outcome: | The proposed approach saves significant initial labeling effort by providing a "warm start" the proposed approach can be fine-tuned with more labeled documents to reach a certain performance level. |
Copied to clipboard
| Challenge: | Generative large language models (LLMs) incorporate external references to generate and support claims. however, evaluating the attribution remains an open problem. |
| Approach: | They investigate automatic evaluation of attribution given by large language models . they define different types of attributed errors and then explore two approaches . |
| Outcome: | The proposed methods highlight promising signals and challenges. |
Copied to clipboard
| Challenge: | Recent advances in slow-thinking reasoning models have shown exceptional performance in complex reasoning tasks. |
| Approach: | They propose a framework that enables models to automatically adjust Chain-of-Thought (CoT) length based on problem difficulty. |
| Outcome: | The proposed framework penalizes inefficiency on simple problems while incentivizing deep reasoning for complex ones. |
Copied to clipboard
| Challenge: | Large language models (LLMs) face excessive computational and memory requirements due to the commonly used Transformer architecture. |
| Approach: | They propose a method to enhance the flow of hidden information between layers in large language models by selectively integrating shallow-layer hidden states into deeper layers. |
| Outcome: | The proposed method maintains parallelizability and inference efficiency of SSMs while significantly boosting performance on public benchmarks. |
Copied to clipboard
| Challenge: | Existing frameworks that share entity embeddings of knowledge graphs (KGs) would incur a severe privacy leakage. |
| Approach: | They propose a new attack method that aims to recover the original embedding information based on the known entity embeddables of FedE. |
| Outcome: | The proposed framework can be used to infer whether a specific relation exists in a private client. |
Copied to clipboard
| Challenge: | Experimental results show that task-oriented dialogue systems have attracted growing attention and achieved substantial progress. |
| Approach: | They propose a method that dynamically selects relevant dialogue contents for each slot . they retrieve turn-level utterances and evaluate their relevance to the slot from three perspectives . |
| Outcome: | The proposed method achieves state-of-the-art performance on MultiWOZ 2.1 and MultiWOz 2.2 and superior performance on multiple mainstream benchmark datasets. |
Copied to clipboard
| Challenge: | Recent advances in Generative Reward Models have demonstrated that scaling the length of Chain-of-Thought reasoning enhances reliability of evaluation. |
| Approach: | They propose a framework that reconfigures raw rationales into structured Breadth-CoT and Depth-Co T through a modular synthesis pipeline. |
| Outcome: | The proposed framework surpasses open-source RMs by an average of 8.2%. |
Copied to clipboard
| Challenge: | Speculative decoding is a key technique for enhancing the inference speed of Large Language Models. |
| Approach: | They propose a method that adds padding tokens to ensure that the number of new tokens remains consistent across samples. |
| Outcome: | The proposed method can handle the issue of inconsistent prediction tokens without adding padding tokens. |
Copied to clipboard
| Challenge: | despite the adoption of Large Language Models (LLMs), contract revision remains impeded because generic models treat strict legal constraints as mere suggestions. |
| Approach: | They propose a risk-constrained bilevel Stackelberg framework that models high-stakes revision as a strategic interaction rather than an open-ended conversation. |
| Outcome: | The proposed framework achieves state-of-the-art performance with an average RRR of 84.21% and enhanced token efficiency. |
Copied to clipboard
| Challenge: | Existing human-machine dialogue systems are not able to provide diagnostic information for depression diagnosis due to stigma associated with mental illness. |
| Approach: | They propose to construct a Chinese Dialogue Dataset for depression-diagnosis-oriented chat based on clinical depression diagnostic criteria. |
| Outcome: | The proposed system can be used to diagnose depression using a Chinese Dialogue Dataset. |
Copied to clipboard
| Challenge: | Existing models for dialogue policy training consider one-step dialogues, leading to inaccurate simulations. |
| Approach: | They propose a framework for dialogue policy learning that trains an agent to select dialogue actions via deep reinforcement learning. |
| Outcome: | The proposed framework achieves state-of-the-art performance on three dialogue datasets . it uses model-based reinforcement learning with automatically constructed causal chains . |
Copied to clipboard
| Challenge: | Recent studies have demonstrated the ability of Large Language Models (LLMs) to process graph problems. |
| Approach: | They propose to decompose substructure counting into node-level tasks distributed among node agents and embed the knowledge of distributed algorithms and DP frameworks in the curator agent and privacy controller. |
| Outcome: | Extensive experiments on 6 real-world datasets validate the effectiveness of the proposed framework for substructure counting tasks under edge local differential privacy (LDP). |
Copied to clipboard
| Challenge: | Existing methods for semantics discovery focus on text, video, and audio, failing to leverage the rich multimodal information in the real world. |
| Approach: | They propose a method to construct augmentation views for multimodal data and use them to perform pre-training to establish well-initialized representations for subsequent clustering. |
| Outcome: | The proposed method improves on benchmark multimodal intent and dialogue act datasets by 2-6% over state-of-the-art methods. |
Copied to clipboard
| Challenge: | Abstractive summarization models are limited in size and noisy training data. |
| Approach: | They propose a bi-directional selective encoding with template model which leverages template from training data to softly select key information from each source article to guide its summarization process. |
| Outcome: | The proposed model improves the summarization performance significantly on a standard summarizing dataset. |
Copied to clipboard
| Challenge: | Existing approaches to retrieval-augmented generation still face problems with low context utilization and frequent hallucinations. |
| Approach: | They propose a framework that reformulates retrieval and generation as constrained optimization and path planning. |
| Outcome: | The proposed framework significantly improves reasoning accuracy on complex queries while reducing hallucinations. |
Copied to clipboard
| Challenge: | Existing pipeline approaches for task-oriented dialogue systems tend to predict multiple dialogue acts first and use them to assist response generation. |
| Approach: | They propose a neural co-generation model that generates dialogue acts and responses concurrently and preserves semantic structures of multi-domain dialogue acts. |
| Outcome: | The proposed model improves over state-of-the-art models in automatic and human evaluations on a large-scale dataset. |
Copied to clipboard
| Challenge: | Recent research has raised concerns about the controllability of large language models. |
| Approach: | They propose to define a "boundary bias" to depict KCR in large language models . they propose to quantify the boundary bias of LLMs and assess the KCR . |
| Outcome: | The proposed model is based on two new datasets to assess its performance. |
Copied to clipboard
| Challenge: | A key problem in multi-task learning (MTL) research is how to select high-quality auxiliary tasks automatically. |
| Approach: | They propose an automatic auxiliary task selection method based on gradient calculation in Transformer-based models that improves MT-DNN performance. |
| Outcome: | The proposed method improves MT-DNN performance on 8 natural language understanding (GLUE) tasks, while costing less than AUTOSEM and comparable GPU consumption. |
Copied to clipboard
| Challenge: | Existing studies show that large language models can be instructed to perform zero-shot passage re-ranking . Existing work like UPR demonstrate promising results for zero- shot ranking using LLMs . |
| Approach: | They propose a demonstration selection strategy based on difficulty rather than semantic similarity . they propose to include only one demonstration in the prompt to improve re-ranking . |
| Outcome: | The proposed method improves LLM-based re-ranking by adding one demonstration to the prompt. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are struggling with performing numeric operations accurately. |
| Approach: | They propose to use different numeral systems to scale different numerates in transformer-based large language models. |
| Outcome: | The proposed model is more data-efficient than base 10 and base 10 3 . the model is also more efficient on addition and multiplication . |
Copied to clipboard
| Challenge: | Existing methods for summarizing long-horizon agents rely on fixed, rule-based summarization strategies. |
| Approach: | They propose a framework that empowers agents to autonomously decide when and what to summarize by modeling it as an internal cognitive action unified with environmental actions. |
| Outcome: | The proposed framework outperforms no-summarization and rule-based training methods on long-horizon benchmarks and shows strong generalization gains. |
Copied to clipboard
| Challenge: | Existing attacks on LLM reasoning are constrained by specific settings or lack of imperceptibility, limiting their feasibility and generalizability. |
| Approach: | They propose a stepwise rEasoning error disruption attack that subtly injects errors into prior reasoning steps to mislead the model into producing incorrect subsequent reasoning and final answers. |
| Outcome: | The proposed attack is compatible with zero-shot and few-shot settings, maintains the natural reasoning flow, and ensures covert execution without modification of the instruction. |
Copied to clipboard
| Challenge: | Existing studies focus on prompt engineering or framework scheduling of one/multiple LLMs. |
| Approach: | They propose to integrate LLMs as agents into their training corpus by decomposition and redesigning the training corpu . they propose to use LLM-FLAN to effectively fine-tune LANguage models for Agents by reducing hallucinations. |
| Outcome: | The proposed model outperforms prior best models by 3.5% across agent evaluation datasets. |
Copied to clipboard
| Challenge: | Text summarization tasks employ Pre-trained Language Models (PLMs) to fit diverse datasets. |
| Approach: | They propose a human summarization preference alignment framework to align PLMs with human preferences. |
| Outcome: | The proposed framework narrows the gap between automatic and human evaluations by integrating three components. |
Copied to clipboard
| Challenge: | Existing urban itinerary planning studies focus on traditional tourism, but they lack the precision and accuracy needed to create a personalized itinerary. |
| Approach: | They propose an open-domain urban itinerary planning system that integrates spatial optimization with large language models to provide customized urban itineraries based on user needs. |
| Outcome: | The proposed system can generate personalized urban itineraries based on user needs and scale with existing methods. |
Copied to clipboard
| Challenge: | Existing methods to constrain NMT use placeholder tags for lexicon words and hard constraints during decoding. |
| Approach: | They propose to use placeholder tags to replace lexicon words with target translations . they use a data augmentation method to make code-switched training data . |
| Outcome: | The proposed method improves translation quality without hurting unconstrained words. |
Copied to clipboard
| Challenge: | Existing methods for temporal knowledge graphs can hardly model temporal relation patterns, lacking of interpretability. |
| Approach: | They propose a temporal modeling method which represents temporal entities as Rotations in Quaternion Vector Space and relations as complex vectors in Hamilton’s quaterniont space. |
| Outcome: | The proposed method can model key patterns of relations in TKG, such as symmetry, asymmetry, and inverse, and can capture time-evolved relations by theory. |
Copied to clipboard
| Challenge: | Existing methods for predicting the next item for an anonymous session do not capture user preferences and noisy irrelevant interactions. |
| Approach: | They propose to use social networks and historical sessions to provide personalized recommendations for the current session. |
| Outcome: | The proposed model outperforms existing models on two benchmark datasets. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) excel at general vision-language tasks, but precise coordinate prediction remains a challenge. |
| Approach: | They propose a training-free, inference-time correction method to correct VPEs . they isolate position-unconditioned tendencies by shuffling VPE and use it to steer digit decoding . |
| Outcome: | The proposed method is training-free, inference-time correction method . it effectively rectifies coordinate drift, yielding consistent improvements without retraining . |
Copied to clipboard
| Challenge: | Existing approaches to improve efficiency often enforce rigid structural constraints such as local attention windows. |
| Approach: | They propose a framework that augments sparse-attention mechanisms with dynamically integrated in-context information through an efficient retrieval system. |
| Outcome: | Empirical results show that MATCH significantly improves the performance of sparse-attention models on synthetic and real-world natural-language tasks. |
Copied to clipboard
| Challenge: | Existing knowledge graphs represent static facts but lack collaborative modeling of both . e.g., existing knowledge graph models lack a framework for integrating snapshots into knowledge graph. |
| Approach: | They propose a framework for high-fidelity modeling of evolving snapshots using concept of snapshots. |
| Outcome: | The proposed framework outperforms existing models on six benchmarks. |
Copied to clipboard
| Challenge: | Aspect-based sentiment analysis aims to determine the sentiment polarity towards a specific aspect in online reviews. |
| Approach: | They propose a relational graph attention network to encode a tree structure for sentiment prediction. |
| Outcome: | The proposed approach improves the performance of the graph attention network (GAT) on the SemEval 2014 and Twitter datasets. |
Copied to clipboard
| Challenge: | Large Language Models have revolutionized Natural Language Processing but their application in extracting information from visually rich documents has not been successful. |
| Approach: | They propose a language model-based document information extraction and localization methodology to reframe the document information extract task for a LLM. |
| Outcome: | The proposed method enables extraction of singular, repeated, and hierarchical entities with and without training data. |
Copied to clipboard
| Challenge: | Recent results show pre-trained language models (LMs) can improve machine reading comprehension (MRC) Experimental results indicate that KT-NET offers significant and consistent improvements over BERT . |
| Approach: | They propose a method that leverages external knowledge bases to improve machine reading comprehension (MRC) KT-NET employs an attention mechanism to select desired knowledge from KBs and fuses selected knowledge with BERT to enable context- and knowledge-aware predictions. |
| Outcome: | The proposed model outperforms baseline models on ReCoRD and SQuAD1.1 benchmarks and ranks 1st on the ReCoDR and SQUAD1.1 leaderboards. |
Copied to clipboard
| Challenge: | Open-domain question answering uses dense passage retrieval to find answers . however, it is difficult to effectively train a dual-encoder due to discrepancy between training and inference . |
| Approach: | They propose an optimized training approach to improve dense passage retrieval using RocketQA . they propose cross-batch negatives, denoised hard negatives and data augmentation . |
| Outcome: | The proposed approach outperforms state-of-the-art models on both MSMARCO and Natural Questions. |
Copied to clipboard
| Challenge: | Existing memory frameworks provide limited support for temporally structured information across hierarchical levels, leading to fragmented memories and unstable long-horizon personalization. |
| Approach: | They propose a temporal–hierarchical memory framework that organizes conversations through a Temporal Memory Tree. |
| Outcome: | The proposed framework outperforms baselines while reducing the recalled memory length by 52.20%. |
Copied to clipboard
| Challenge: | Despite advances in aligning LLMs with human values, current safety mechanisms remain vulnerable to jailbreak attacks. |
| Approach: | They propose a black-box jailbreak method that uses logical expression translation to bypass LLM safety mechanisms. |
| Outcome: | The proposed method exploits the distributional gap between alignment data and logic-expressed inputs while preserving the underlying semantic intent and readability while evading safety constraints. |
Copied to clipboard
| Challenge: | Despite the success of transformer-based large language models, understanding and enhancing their mathematical capabilities remains a significant challenge. |
| Approach: | They propose to use numerical precision as a key factor that influences LLMs' effectiveness in arithmetical tasks to determine their effectiveness. |
| Outcome: | The proposed models perform better in arithmetic tasks than transformer-based models with standard numerical precision. |
Copied to clipboard
| Challenge: | Existing approaches to low-rank Adaptation (LoRA) are limited in scalability and controllability. |
| Approach: | They propose a conditional recurrent diffusion framework that generates LoRA parameters directly . they integrate model architecture and textual task specifications to generate task-specific parameters . |
| Outcome: | The proposed framework scales to billions-of-parameter LLMs and maintains controllability. |
Copied to clipboard
| Challenge: | Existing RP-LLMs employ only a single role with numerous dialogues, but Crab enables dynamic configuration of desired roles, thereby enhancing related flexibility and adaptability. |
| Approach: | They propose a Configurable Role-Playing LLM with Assessing Benchmark that combines a Role dataset curation, persona-emodying Llm construction, and comprehensive benchmark creation for RP dialogue generation. |
| Outcome: | The proposed model outperforms existing LLMs in performing fine-grained evaluations of RP while keeping dialogue per role minimal. |
Copied to clipboard
| Challenge: | Existing open-source multi-modal large language models (MLLMs) focus on enhancing foundational capabilities, leaving a significant gap in human preference alignment. |
| Approach: | They propose a dataset of 200K high-quality training samples featuring diverse images, complex questions, and varied response formats to improve MLLMs’ alignment with human preferences. |
| Outcome: | The proposed dataset of 200K high-quality training samples improves human preference alignment while maintaining or enhancing performance on standard VQA benchmarks. |
Copied to clipboard
| Challenge: | Prior fake news datasets lack multimodal text and image data, metadata, comment data, and fine-grained classification at the scale and breadth of their datasets. |
| Approach: | They propose to use a multimodal dataset to build a machine learning classification model that uses text and image data to classify fake news. |
| Outcome: | The proposed model is based on a multimodal dataset consisting of over 1 million samples from multiple categories of fake news. |
Copied to clipboard
| Challenge: | Knowledge distillation (KD) is an effective compression technique to derive a smaller student model from a larger teacher model by transferring the knowledge embedded in the teacher's network. |
| Approach: | They propose a framework and loss function that preserves the semantic similarities of teacher and student training examples to enable the student to retrieve from the knowledge base effectively. |
| Outcome: | The proposed framework preserves the semantic similarities of teacher and student training examples to achieve state-of-the-art performance on the GLUE benchmark. |
Copied to clipboard
| Challenge: | ambiguity, polysemy, or uncertainty remain significant challenges in natural language processing. |
| Approach: | They introduce a framework that integrates LLM semantic priors with continuous fuzzy membership degrees to create an explicit interaction between probability-based reasoning and fuzzy membership reasoning. |
| Outcome: | The proposed framework integrates semantic priors with continuous fuzzy membership degrees . it allows ambiguous inputs to be gradually transformed into clear and interpretable decisions . |