Papers by Wei Cheng
Copied to clipboard
| Challenge: | Large language models (LLMs) have been studied for their ability to store and utilize positive knowledge. |
| Approach: | They propose to use a constrained keywords-to-sentence generation task and a Boolean question answering task to probe large language models on negative commonsense knowledge. |
| Outcome: | The proposed tasks show that LLMs fail to generate valid sentences grounded in negative commonsense knowledge, yet they can correctly answer yes-or-no questions. |
Copied to clipboard
| Challenge: | Existing domain-specific knowledge of domain-related tasks is lacking in pre-trained language models. |
| Approach: | They propose a domain-adaptation method which can dynamically select domain-specific tokens and guide the discriminator to emphasize them, without introducing new training parameters. |
| Outcome: | The proposed method can capture domain-specific knowledge of domain-related tasks without introducing new training parameters. |
Copied to clipboard
| Challenge: | Existing models for TKG reasoning focus on modeling fact sequences of a fixed length, which cannot discover complex evolutional patterns that vary in length. |
| Approach: | They propose to use a length-aware Convolutional Neural Network to handle evolutional patterns of different lengths via an easy-to-difficult curriculum learning strategy. |
| Outcome: | The proposed model improves performance under both offline and online learning strategies. |
Copied to clipboard
| Challenge: | Inductive reasoning is a core component of human intelligence. |
| Approach: | They propose a task to induce natural language rules from natural language facts using natural language as representation for knowledge instead of formal language. |
| Outcome: | The proposed task surpasses baselines in both automatic and human evaluations. |
Copied to clipboard
| Challenge: | Existing IE tools lack multi-task support and automatic updates for KG and EKG construction. |
| Approach: | They propose a human-machine-cooperative IE toolkit for KG and EKG construction that unifies different IE subtasks and integrates LLMs as the assistant machine. |
| Outcome: | The proposed tool improves annotation quality, efficiency, and stability simultaneously. |
Copied to clipboard
| Challenge: | Existing models consisting of multiple steps of visual and language processing are limited in the visual and visual processing community . a visual reasoner is a plug-and-play approach that can be used to improve VLMs' reasoning abilities. |
| Approach: | They propose a least-to-most visual reasoning paradigm that divides a question into sub-questions and invokes external tools for resolving sub-questions. |
| Outcome: | The proposed method can improve four VLMs on four VQA benchmarks. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have demonstrated remarkable capabilities across diverse domains, such as code generation, mathematical problem-solving, and general-purpose human instruction following. |
| Approach: | They propose to use large language models to process questions expressed in natural language to automate tourism-booking prices when multiple, overlapping farerules apply. |
| Outcome: | The proposed model can automate tourism-booking prices when multiple, overlapping farerules apply. |
Copied to clipboard
| Challenge: | a comparative analysis of paper (meta-)reviews by large language models (LLMs) aims to identify and distinguish LLMs from human activities . |
| Approach: | They present a comparative analysis to identify and distinguish LLM activities from human activities. |
| Outcome: | The proposed analysis aims to improve recognition of instances when someone implicitly uses LLMs for reviewing activities. |
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) are used in many different areas of research. |
| Approach: | They propose to use a beam search policy to induce multiple clues from historical facts . they propose to adopt a graph convolution network based sequence method to deduce answers from clues . |
| Outcome: | The proposed model can predict future facts in two stages, Clue Searching and Temporal Reasoning. |
Copied to clipboard
| Challenge: | Existing LLMs model overly capable learners who over-apply feedback, resulting in pedagogically implausible behavior. |
| Approach: | They propose a framework that decouples cognitive ability from writing proficiency and models their interaction during writing and revision. |
| Outcome: | The proposed model produces distinguishable proficiency levels and is consistent with instructional theories. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly used for code editing, yet the full-code generation paradigm suffers from severe efficiency bottlenecks. |
| Approach: | They propose to use a structure-aware diff format to train LLMs to choose the most token-efficient format between a given diff format and full code. |
| Outcome: | The proposed approach matches the most token-efficient format with full-code generation while reducing latency and cost by over 30% on long-code editing tasks. |
Copied to clipboard
| Challenge: | acquiring domain-specific knowledge often requires professional expert manpower. |
| Approach: | They propose a generic framework for generating evaluation datasets for domain-specific LLMs. |
| Outcome: | The proposed framework reduces the reliance on expert manpower while ensuring that the collected data is uniformly distributed. |
Copied to clipboard
| Challenge: | Chinese word segmentation datasets have ambiguous annotation criteria resulting in multi-grained compounds. |
| Approach: | They propose a domain adaptive segmenter to exploit diverse annotation criteria of datasets . they use bidirectional encoder representations from transformers to introduce open-domain knowledge . |
| Outcome: | The proposed model outperforms the state-of-the-art models on 10 Chinese word datasets with superior efficiency. |
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: | Existing benchmarks fail to reflect real-world communication needs and are limited in their coverage. |
| Approach: | They present a comprehensive index of sign-language datasets, covering 120 resources across 35 sign languages. |
| Outcome: | The proposed index covers 120 resources across 35 sign languages. |
Copied to clipboard
| Challenge: | Existing studies focus on specialized agents designed for particular tasks. |
| Approach: | They propose to scale annotated interaction trajectories and fine-tune LLMs on AgentBank to get a series of agent models, Samoyed. |
| Outcome: | The proposed model can scale to get generalized agent capabilities. |
Copied to clipboard
| Challenge: | Recent studies highlight a fundamental dichotomy in deep learning optimization: parameter updates along the top eigendirections of the loss Hessian (Dom-space) capture most of the update magnitude, while updates in the orthogonal component (Bulk-space), have smaller magnitudes but drive most learning progress. |
| Approach: | They propose a plug-and-play framework that scales update components projected onto distinct subspaces and a block-wise strategy that applies this estimation on a per-parameter-block basis. |
| Outcome: | The proposed framework accelerates training by differentially scaling update components projected onto distinct subspaces, while enhancing stability by moderating updates in dominant subspace and boosting convergence speed by amplifying updates in bulk-space. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have shown impressive capabilities in various downstream tasks but typically face Catastrophic Forgetting (CF) during fine-tuning. |
| Approach: | They propose a pruning-based approach to balance CF and downstream task performance by integrating the ratio of the task vector to pre-trained model parameters into the pruning criteria. |
| Outcome: | The proposed pruning-based approach limits CF to just 0.25% while maintaining 99.67% accuracy on downstream tasks. |
Copied to clipboard
| Challenge: | a number of attention-based large language models (LLMs) focus on individual head contributions, but the precise interaction mechanisms between attention heads remain poorly understood. |
| Approach: | They propose a game-theoretic attention calibration method that uses the Harsanyi dividend . they selectively retain heads demonstrating significant cooperative gains and apply fine-grained adjustments to remaining heads . |
| Outcome: | The proposed framework is based on the Harsanyi dividend, a concept from cooperative game theory. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have attracted significant interest from the research community due to their broad applicability in many language-oriented tasks. |
| Approach: | They propose a framework which uses pre-training datasets to rewrite instructions and generate negative responses to preserve the performance of the original LLM. |
| Outcome: | The proposed framework can erase the pre-training data while maintaining the performance of the original model. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) achieve high accuracy on established Classical Chinese Poetry benchmarks, but it remains challenging to distinguish transferable Linguistic-Aesthetic Reasoning from reliance on familiar pre-training patterns. |
| Approach: | They propose a benchmark that combines a constructionist Out-of-Sample dataset with reverse understanding probes to evaluate large-scale large-format models. |
| Outcome: | The proposed model performs well on classical Chinese poetry benchmarks, but a performance gap persists . the model can complete famous couplets and can be used to understand a variety of texts. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) excel in various domains but face challenges when applied to data science workflows due to their complex, multi-stage nature. |
| Approach: | They propose a hierarchical graph-based agent that represents complexity and a progressive strategy for step-by-step verification, refinement, and consistent context management. |
| Outcome: | The proposed agent surpasses state-of-the-art baselines on the MATH dataset and performs better on InfiAgent-DABench. |
Copied to clipboard
| Challenge: | Existing approaches to personalized dialogue generate pre-defined profiles that are time-consuming and labor-intensive to create. |
| Approach: | They propose a framework that leverages dialogue history to characterize personas without pre-defined profiles. |
| Outcome: | The proposed framework improves BLEU and ROUGE scores on three datasets and human evaluations further validate the proposed method. |
Copied to clipboard
| Challenge: | Large language models are a scaleable solution for the generation of synthetic data . however, the utility of such data is capped by a critical tension between diversity and factual reliability. |
| Approach: | They propose a framework which leverages a probabilistic factor graph modeling the universe of attributes. |
| Outcome: | The proposed framework outperforms state-of-the-art models with a high structural integrity and a boost in performance on downstream tasks. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) have shown strong potential in various downstream tasks. |
| Approach: | They propose to model adversarial attack task as a sequential decision-making problem where the whole attack process is sequential with two decision- making problems, i.e., word finder and word substitution. |
| Outcome: | The proposed approach achieves the highest attack success rate with a comparable modification rate and semantic similarity to attack fine-tuned BERT. |
Copied to clipboard
| Challenge: | Language model hallucinations and limited availability of labeled datasets often result in misaligned formulations, code errors and feasibility failures. |
| Approach: | They propose a Monte Carlo Tree Search framework that automates optimization problems from natural language descriptions with efficiency and reliability. |
| Outcome: | The proposed framework achieves state-of-the-art solution accuracy and reduces token usage. |
Copied to clipboard
| Challenge: | Existing studies focus on partial aspects of knowledge abstraction, concretization, and completion (KACC). |
| Approach: | They propose a unified knowledge graph benchmark to improve existing benchmarks . they collect new datasets that contain larger concept graphs and cross-view links . |
| Outcome: | The proposed benchmark improves existing benchmarks in terms of dataset scale, task coverage, and difficulty. |
Copied to clipboard
| Challenge: | Existing studies on knowledge editing focus on monolingual scenarios, neglecting the complexities presented by multilingual contexts and multi-hop reasoning. |
| Approach: | They propose a benchmark to evaluate the adaptability of multilingual knowledge editing methods. |
| Outcome: | The proposed benchmark evaluates the adaptability of multilingual knowledge editing methods across five languages. |
Copied to clipboard
| Challenge: | Existing evaluation metrics for large language models yield numerical scores that ignore user experience. |
| Approach: | They propose a metric that suggests revision edits that mimic the human writing process . their results show that the metric offers more insightful feedback and distinguishes between texts . |
| Outcome: | The proposed metric can provide a self-explained text evaluation result in a human-understandable manner beyond the context-independent score. |
Copied to clipboard
| Challenge: | Existing methods for automatic essay scoring are based on hand-crafted surface-level features, but recent advances in representation learning have improved performance. |
| Approach: | They propose a pre-training based automated Chinese essay scoring method with weakly supervised pre- training, supervised cross- prompt fine-tuning and supervised target- prompt refine-tuneing. |
| Outcome: | The proposed method improves a state-of-the-art neural essay scorer in terms of effectiveness and domain adaptation ability, while in-depth analysis also reveals its limitations. |
Copied to clipboard
| Challenge: | Text-to-image (T2I) generation models have advanced in recent years, but effective interaction with these models is challenging for average users due to the need for specialized prompt engineering knowledge and the inability to perform multi-turn image generation. |
| Approach: | They propose to use off-the-shelf MLLMs and T2I models to build a multi-modal interactive dialogue system (MIDS) that can generate correct output modalities and coherence of output images. |
| Outcome: | The proposed pipeline can generate correct output modalities and coherent multi-modal outputs compared with other state-of-the-art models. |
Copied to clipboard
| Challenge: | Existing code generation approaches represent code as a linear sequence of tokens, but positional encodings compromise generalization . explicit positional encoders sacrifice permutation invariance, imposes a strict order on the input sequence . |
| Approach: | They propose to represent code snippets as two-dimensional entities with explicit encodings . they propose to use dictionary learning to perform semantic matching between code lines . |
| Outcome: | The proposed model captures the hierarchical and spatial structure of code, especially the dependencies between code lines. |
Copied to clipboard
| Challenge: | In-battle commentary is an important component of live streaming of e-sports competitions and is applicable to a wide range of scenarios like combat information analysis and live streaming. |
| Approach: | They propose a generative system for in-battle real-time commentary in mobile MOBA games and propose 'transform' method to convert match statistics and utterances into consistent encoding space. |
| Outcome: | The proposed system is based on real-time match statistics and events and can be used for live streaming, e-sports commentary and combat information analysis. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have significantly impacted various domains, especially through organized LLM-driven autonomous agents. |
| Approach: | They propose a framework that enables orchestrated teams to jointly propose various task-oriented solutions and interact with their insights in a self-independence while cross-team collaboration environment for superior solutions generation. |
| Outcome: | Experiments show that the framework can generate better software quality compared to state-of-the-art frameworks. |
Copied to clipboard
| Challenge: | Existing studies focus on coarse-grained response selection in retrieval-based dialogue systems. |
| Approach: | They propose a Contextual Fine-to-Coarse (CFC) distilled model for coarse-grained response selection in open-domain conversations. |
| Outcome: | The proposed model improves over baseline methods on two datasets based on the Reddit comments dump and Twitter corpus compared with baseline methods. |
Copied to clipboard
| Challenge: | Mathematical reasoning has long been a key benchmark for evaluating large language models. |
| Approach: | They propose a framework that transforms math word problems into scalable tabular reasoning tasks. |
| Outcome: | The proposed framework transforms math word problems into scalable and verified tabular reasoning tasks. |
Copied to clipboard
| Challenge: | a new text classification framework for large language models addresses the problem of boundary ambiguity and inherent biases in LLMs. |
| Approach: | They propose a two-stage classification framework for large language models to mitigate bottlenecks . their approach uses pairwise comparisons to efficiently narrow down options . |
| Outcome: | The proposed framework reduces the number of options and improves on four datasets. |
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) store facts as triples in the form of subject, relation, object, timestamps. |
| Approach: | They propose a Temporal Knowledge Graph (TKG) model that extends each triple with a timestamp to describe dynamic facts. |
| Outcome: | The proposed model improves on six benchmark datasets with up to 5.6% performance improvement compared to the state-of-the-art models. |
Copied to clipboard
| Challenge: | Existing methods for large language models focus on post-training stage or inference time, while few tackle the source of toxicity, namely, the dataset itself. |
| Approach: | They propose to localize and rewrite toxic spans in raw corpora with SoCD, which guides an LLM to localized and preserving semantics while preserving toxicity. |
| Outcome: | The proposed method reduces TP from 0.42 to 0.18 and Expected Maximum Toxicity (EMT) from 0.43 to 0.20 on three LLMs. |
Copied to clipboard
| Challenge: | Existing document similarity approaches suffer from the information gap caused by context and vocabulary mismatches when comparing varying-length texts. |
| Approach: | They propose an unsupervised concept representation learning approach to address this issue . they propose a concept-based document matching method to leverage recognition of local phrase features . |
| Outcome: | The proposed method achieves a better F1 score than baseline models on real-world data sets. |
Copied to clipboard
| Challenge: | Existing methods for controllable text generation are guided by coarse-grained feedback, which may lead to suboptimal performance owing to semantic twists or progressions within sentences. |
| Approach: | They propose a reinforcement learning algorithm which formulates TOken-LEvel rewards for controllable text generation and employs a "first-quantize-then-noise" paradigm to enhance the robustness of the RL algorithm. |
| Outcome: | The proposed algorithm can achieve superior performance on single-attribute and multi-attract control tasks. |
Copied to clipboard
| Challenge: | Existing offline approaches to improve an LLM-based customer support system rely on batch annotations. |
| Approach: | They propose an agent-in-the-loop framework that integrates four key types of annotations directly into live customer operations: (1) pairwise response preferences, (2) agent adoption and rationales, (3) knowledge relevance checks, and (4) identification of missing knowledge. |
| Outcome: | The proposed framework reduces retraining cycles from months to weeks by integrating four key types of annotations directly into live customer operations. |
Copied to clipboard
| Challenge: | Existing studies have shown that large language models (LLMs) can elicit implicit biases that hurt certain demographics without explicit harmful words. |
| Approach: | They propose three attack approaches to elicit agreements to biased viewpoints from LLMs from a psychometric perspective and built two benchmarks to compare them. |
| Outcome: | The proposed methods elicit agreements to biased viewpoints more effectively than baselines. |
Copied to clipboard
| Challenge: | Existing safeguards for large language models are inadequate for open-weight models as minimal fine-tuning can bypass them. |
| Approach: | They propose a framework that prioritizes maximizing generative utility rather than a singular optimization metric and integrates prospect theory into LLM training to strengthen LLMs against misuse and weaponization. |
| Outcome: | The proposed framework strengthens LLMs against misuse and weaponization while maintaining high performance even after extensive fine-tuning. |
Copied to clipboard
| Challenge: | None. None.. None! |
| Approach: | None. None.. None! |
| Outcome: | None. None. No. : |
Copied to clipboard
| Challenge: | Financial documents are filled with specialized terminology, arcane jargon, and curious acronyms that pose challenges for general-purpose text embeddings. |
| Approach: | They propose to fine tune financial text embeddings finetuned on a carefully constructed dataset of 14.3M query-passage pairs including both public and proprietary financial documents. |
| Outcome: | The proposed embeddings achieve Recall@1 of 62.8% on a held-out test set, vs. only 39.2% for the best general-purpose text embeddING from OpenAI. |
Copied to clipboard
| Challenge: | Randomly concatenating data points can lead to cross-contamination due to the significant difference in their subject matter. |
| Approach: | They propose a method that randomly concatenates data of varying lengths until reaching the designed maximum length to optimize context length and reduce padding. |
| Outcome: | The proposed method significantly improves performance on GSM8K and HumanEval, and also improves fairness and accuracy by 15%. |
Copied to clipboard
| Challenge: | Code large language models (LLMs) are becoming tool-interactive agents . quantity-centric scaling exhibits an early bottleneck that underutilizes trajectory data . et al.: a new approach to scale trajectory diversity improves tool-use generalization . |
| Approach: | They propose a Trajectory Diversity Scaling-based data synthesis framework for code agents that scales performance through diversity rather than raw volume. |
| Outcome: | Experiments on general tool-use benchmarks and code agent tasks show that TDScaling improves tool-user generalization and inherent coding proficiency. |
Copied to clipboard
| Challenge: | Existing research focuses on Python for code-style simulation, overlooking the potential of other widely-used PLs during the supervised fine-tuning phase. |
| Approach: | They propose a framework that incorporates programming languages into IE tasks . they introduce function-prompt with virtual running to simulate code-style inputs . |
| Outcome: | The proposed framework exploits the potential of different programming languages during the supervised fine-tuning phase. |
Copied to clipboard
| Challenge: | Existing approaches to tool learning rely on hand-crafted prompts and natural language reasoning, making multi-step planning difficult and lacking precise error diagnosis and reflection mechanisms. |
| Approach: | They propose a framework that reformulates tool learning as a code generation task. |
| Outcome: | The proposed framework achieves superior performance in task completion accuracy and execution reliability compared to existing approaches. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable capabilities, yet their transition to real-world applications reveals a critical limitation: the inability to adapt to individual preferences while maintaining alignment with universal human values. |
| Approach: | They propose a framework that enables LLMs to adapt their behavior within ethical boundaries based on individual preferences. |
| Outcome: | The proposed framework analyzes implementation approaches and evaluates their effectiveness across various scenarios. |
Copied to clipboard
| Challenge: | Theory of mind evaluations currently focus on testing models using machine-generated data or game settings prone to shortcuts and spurious correlations. |
| Approach: | They propose a benchmark to stress-test machine ToM in real-world negotiation surrounding covered multi-dimensional mental states. |
| Outcome: | The proposed benchmark builds upon the Belief-Desire-Intention theory and conducts the necessary empirical experiments to evaluate large language models. |
Copied to clipboard
| Challenge: | Existing studies focus on learning global or local correspondence, but lack fine-grained local-global alignment. |
| Approach: | They propose a High Order Semantic Alignment (HOSA) model that can provide complementary and comprehensive semantic clues to infer correlation scores. |
| Outcome: | The proposed model outperforms state-of-the-art models in retrieving the most relevant results. |
Copied to clipboard
| Challenge: | a production-grade pricing system for tourism is challenging due to unstructured nature of travel orders and ever-evolving pricing policies. |
| Approach: | They propose a production-grade pricing system with a strict decision boundary . they propose to combine structured extraction and bounded policy/path selection with interpretable condition trees . |
| Outcome: | The proposed system processed 3,960 orders in six months and reduced the order management team from 15-20 to 3 . the system reduced the per-order handling time from 10 minutes to 2 minutes. |
Copied to clipboard
| Challenge: | Existing methods to predict missing elements in hyper-relational facts require high-quality data. |
| Approach: | They propose a task to predict a missing entity in a hyper-relational fact with limited support instances. |
| Outcome: | The proposed model outperforms existing models on three datasets. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have exhibited remarkable proficiency across a wide array of NLP tasks. |
| Approach: | They propose a method for pruning large language models using general or task-specific weights to extract a compressed, task-agnostic LLM. |
| Outcome: | The proposed method extracts a compressed, domain-specific, and task- agnostic LLM by identifying LLM weights that are pivotal for general capabilities, like linguistic capability and multi-task solving, and domain- specific knowledge. |
Copied to clipboard
| Challenge: | Experimental results show that self-attentive neural models are more robust against adversarial perturbations compared to recurrent neural networks. |
| Approach: | They propose an adversarial attack algorithm that generates more natural adversarials . they propose to use the attention mechanism to learn a context-dependent representation . |
| Outcome: | The proposed attack algorithm generates more natural adversarial examples that could mislead models but not humans. |
Copied to clipboard
| Challenge: | Text2Sql is a task that translates natural language questions and database schemas into SQL queries. |
| Approach: | They employ pure fine-tuning strategy to reduce redundancy by using only 53% of the baseline prompt length to fine- tune the model. |
| Outcome: | The model outperforms the baseline model by 8.2% and 8.6% in Test-suite accuracy (TS) and exact-set-match accuracy (EM) under the most refined Spider dev set of prompts, the model achieves 73.5% and 75.4%, respectively, approaching state-of-the-art (SOTA) levels. |
Copied to clipboard
| Challenge: | Existing methods for WS-NLVL rarely consider complex temporal relations enclosing the language query, yielding illogical predictions. |
| Approach: | They propose a plug-and-play method to exploit temporal relations and logical rules for WS-NLVL. |
| Outcome: | The proposed method is able to retrieve the moment corresponding to a language query in a video with only video-language pairs utilized during training. |
Copied to clipboard
| Challenge: | Existing methods train one encoder-decoder-based model to fit all questions . however, such a one-size-fits-all strategy may not perform well for complex questions involving multiple KB relations or functional constraints. |
| Approach: | They propose a meta-learning framework for complex question generation over knowledge bases . they propose he meta-trained generator can acquire universal meta-knowledge . |
| Outcome: | The proposed framework can acquire universal and transferable meta-knowledge and quickly adapt to long-tailed samples under different dimensions. |
Copied to clipboard
| Challenge: | Existing methods to improve code translation depend on abundant parallel code of high quality, which may not always be available. |
| Approach: | They propose a method that leverages functional invariance and cross-lingual portability of test suites to serve as universal verification oracles for multilingual reinforcement learning. |
| Outcome: | The proposed method leverages functional invariance and cross-lingual portability of test suites to serve as universal verification oracles for multilingual reinforcement learning (RL) training. |
Copied to clipboard
| Challenge: | Existing approaches to exploit LLMs' inherent safety mechanism, including GCG and AutoDAN, are ineffective for certain malicious requests. |
| Approach: | They propose a method that generates jailbreak prompts to suppress a refusal stance and induce affirmative responses by modifying adversarial prompts. |
| Outcome: | The proposed method outperforms the best baseline approach in Llama-2-7b-chat and achieves a 92.2% success rate across all models. |
Copied to clipboard
| Challenge: | Existing attacks are classified into end-to-end and pre-training types based on the attack phase . Existing backdoor attacks are based upon perplexity, fine-pruning, and maxEntropy. |
| Approach: | They propose an entropy-based poisoning filter that mitigates backdoor attacks . they propose an invisible and universal task-agnostic backdoor attack via syntactic transfer . |
| Outcome: | The proposed attack can transfer backdoors to various downstream tasks while preserving pre-trained language models' pre-training capabilities. |
Copied to clipboard
| Challenge: | Existing methods focus on knowledge and linguistic patterns of characters. |
| Approach: | They propose to evaluate character fidelity of role-playing agents with psychological scales . they propose to use psychological scale to measure personality traits of RPAs based on personality traits. |
| Outcome: | The proposed model reproduces character fidelity with psychological scales and shows that it is effective in measuring personality traits. |
Copied to clipboard
| Challenge: | Existing approaches lack mechanisms to balance linguistic expressivity with formal guarantees regarding validity and coverage. |
| Approach: | They propose a neuro-symbolic framework that decouples semantic reasoning from surface realization. |
| Outcome: | The proposed framework achieves 100% Schema Validity even in complex logic puzzles where unconstrained baselines fail (12.4%) while outperforming state-of-the-art methods in rare-combination coverage. |
Copied to clipboard
| Challenge: | Existing LLMs are primarily used for simple text-related tasks, but LLM-based agents can undertake more complex tasks that require planning and interaction with the physical world and humans. |
| Approach: | They propose an Agent-Constitution-based agent framework with a particular focus on improving the LLM-based agents' safety. |
| Outcome: | The proposed framework can enhance an LLM agent’s safety across multiple domains by identifying and mitigating potential dangers during the planning process. |
Copied to clipboard
| Challenge: | Large Vision-Language Models (LVLMs) have impressive capabilities in multi-modal context comprehension, but they still suffer from hallucination problems due to inconsistent outputs with the image content. |
| Approach: | They propose a training-free framework MVP to reduce hallucinations in Large Vision-Language Models . they propose multi-view information-seeking strategy to perceive the comprehensive information in the image . |
| Outcome: | The proposed framework reduces hallucinations in large vision-language models by combining multi-view multi-path reasoning with multi-vision multi-path reasoning. |
Copied to clipboard
| Challenge: | Existing methods for concept-level grounding and instruction-level reasoning use coarse representations and iterative mask filtering. |
| Approach: | They propose an instruction-following extension of the Segment Anything Model 3 family that unifies concept-level grounding and instruction-level reasoning within a single segmentation framework. |
| Outcome: | Experiments show that SAM3-I achieves appealing performance across referring and reasoning-based segmentation while maintaining its strong concept recall ability. |
Copied to clipboard
| Challenge: | Existing frameworks that focus on static tools and static assets are ineffective for self-evolving agents. |
| Approach: | They propose a paradigm of co-evolutionary Capability Expansion and Experience Distillation that leverages accumulated experience to guide dynamic creation of assets. |
| Outcome: | The proposed framework improves performance in single-task and cross-task settings by 18.53% over standard LLMs, 11.80% over agents evolving solely through experience, and 6.46% over those evolving solelly through asset creation. |
Copied to clipboard
| Challenge: | Recent approaches to enhance agent performance focus on outcome rewards, which may lead to errors or suboptimal actions due to the absence of process supervision signals. |
| Approach: | They propose a step-level framework that provides detailed step-by-step guidance to enhance agent training by using Monte Carlo methods. |
| Outcome: | The proposed framework outperforms strong baselines on three tasks and shows that it is effective in augmenting efficiency and its applicability to diverse models. |
Copied to clipboard
| Challenge: | Existing methods to generate correct code completions in private repositories are insufficiently relevant. |
| Approach: | They propose a dataflow-guided retrieval augmentation approach for repository-level code completion . they parses a private repository into code entities and establishes their relations through an extended dataflow analysis . |
| Outcome: | The proposed method improves code exact match and identifier F1-score by 3.43% compared to the state-of-the-art approach. |
Copied to clipboard
| Challenge: | Large Language Models have exceptional capabilities in open generation, yet they encounter difficulties with tasks that require intensive knowledge. |
| Approach: | They propose a framework that integrates unknown knowledge into LLMs without overlap . they propose integrating domain-specific knowledge graphs into Llms to reduce knowledge forgetting . |
| Outcome: | The proposed framework outperforms state-of-the-art baselines in integrating new knowledge into LLMs. |
Copied to clipboard
| Challenge: | Numerical reasoning requires both natural language understanding and arithmetic computation. |
| Approach: | They propose a graph representation for the context of the passage and question needed for numerical reasoning. |
| Outcome: | The proposed model achieves remarkable results in benchmark datasets such as DROP. |
Copied to clipboard
| Challenge: | Prompt tuning is effective in extracting knowledge from foundation models, but its effectiveness is uncertain. |
| Approach: | They propose a parametric prompt tuning strategy that dynamically determines different factors of prompts based on specific tasks or instances. |
| Outcome: | The proposed approach improves performance across a wide range of tasks including NLP, vision recognition, and vision-language tasks. |
Copied to clipboard
| Challenge: | Current approaches to commonsense reasoning are limited due to limited answer scope. |
| Approach: | They propose to solve a commonsense question without a pre-defined answer scope . they leverage pre-trained language models to iteratively retrieve reasoning paths on the external knowledge base . |
| Outcome: | The proposed method achieves better performance on two commonsense benchmark datasets. |
Copied to clipboard
| Challenge: | Existing literature on temporal knowledge Graph Forecasting lacks in-depth investigation into how confidence evolves with time. |
| Approach: | They propose a framework to model the temporal validity of rules for Temporal Knowledge Graph Forecasting (TKGF) they propose rule-adversarial negative sampling and time-aware negative sampling strategies to facilitate TempValid learning. |
| Outcome: | The proposed framework outperforms state-of-the-art (SOTA) rule-based methods on six TKGF datasets. |
Copied to clipboard
| Challenge: | Existing methods focus on point-wise memory, losing durative information that captures persistent states and evolving patterns. |
| Approach: | They propose a memory framework that models semantic time for point-wise memory and supports the construction and utilization of durative memory. |
| Outcome: | Experiments on LongMemEval and LoCoMo show that the proposed method outperforms existing methods and achieves up to 12.2% improvement in accuracy. |
Copied to clipboard
| Challenge: | Existing vision-language models struggle to disentangle information scattered across complex visual inputs, leading to performance degradation. |
| Approach: | They propose a focus-centric visual chain paradigm that enhances VLMs’ perception, comprehension, and reasoning abilities in multi-image scenarios. |
| Outcome: | The proposed approach achieves average performance gains of 3.16% and 2.24% across two distinct model architectures, without compromising the general vision-language capabilities. |
Copied to clipboard
| Challenge: | Natural language is the de facto communication medium for LLM-based agents, but it presents a fundamental constraint . natural language downsampling limits the depth and nuance of information that can be transmitted . et al.: inter-agent latent space communication is a promising paradigm for solving complex tasks . |
| Approach: | They propose a paradigm that leverages the last hidden states of an LLM as a representation of its thought for direct communication. |
| Outcome: | The proposed paradigm outperforms fine-tuned chain-of-thought prompting and single-agent baselines even across heterogeneous models. |
Copied to clipboard
| Challenge: | Existing multilingual table benchmarks suffer from geolinguistic imbalance - overrepresenting certain languages and lacking sufficient scale for rigorous cross-lingual analysis. |
| Approach: | They propose a framework for massively multilingual table question answering that includes tables expanded to 97 languages from Chinese and English sources. |
| Outcome: | Experiments on state-of-the-art LLMs show that synthetically generated training data significantly boosts performance, especially for low-resource languages. |
Copied to clipboard
| Challenge: | Existing approaches to multi-aspect controllable text generation require expensive iteration / searching within the discrete text space during the decoding stage, resulting in a degradation of text quality due to the domain discrepancies between different aspects. |
| Approach: | They propose a framework that estimates compact latent space for multiple aspects and performs efficient Sampling with a fast sampler to eliminate domain discrepancies. |
| Outcome: | The proposed framework outperforms baselines on attribute relevance and textual quality while maintaining a high inference speed. |
Copied to clipboard
| Challenge: | Chain-of-Thought reasoning has driven recent gains of large language models (LLMs) on reasoning-intensive tasks by externalizing intermediate steps. |
| Approach: | They propose a training-free framework that adaptively determines when to stop reasoning to mitigate overthinking. |
| Outcome: | The proposed framework reduces token usage by 20-55% while maintaining or improving accuracy compared to standard CoT prompting. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have brought significant changes to various domains, especially through autonomous agents. |
| Approach: | They propose a framework that lets agents learn shortcuts from their past tasks and use them for future task execution. |
| Outcome: | The proposed framework enables agents to tackle unseen software-developing tasks more effectively. |
Copied to clipboard
| Challenge: | a lack of systematic studies on the robustness of language understanding models in task-oriented dialog systems is limiting . authors propose a model-agnostic toolkit LAUG to approximate natural language perturbations . |
| Approach: | They propose a model-agnostic toolkit LAUG to approximate natural language perturbations for testing the robustness of language understanding models in task-oriented dialog systems. |
| Outcome: | The proposed toolkit reveals critical robustness issues in state-of-the-art models. |
Copied to clipboard
| Challenge: | Existing aspect extraction methods suffer from boundary errors, but they hurt performance severely. |
| Approach: | They propose to use a pointer network to reposition the boundaries of extracted aspects . they conduct experiments on laptop and restaurant benchmark datasets . |
| Outcome: | The proposed method outperforms state-of-the-art methods on benchmark datasets . it achieves substantial improvements over baseline and outperformed existing methods . |
Copied to clipboard
| Challenge: | Recent advances in large language models have led to an increase in synthetic content generation . the ability to detect LLMs-generated content has become of paramount importance . |
| Approach: | They propose to provide a detailed overview of existing detection strategies and benchmarks, scrutinizing their differences and advocating for more adaptable and robust models to enhance detection accuracy. |
| Outcome: | The proposed model will be able to detect human-written content in real time. |
Copied to clipboard
| Challenge: | Existing methods for visual storytelling construct text description independently for each image and roughly concatenate them as a story, which leads to the problem of generating semantically incoherent content. |
| Approach: | They propose a topic description task to detect the global semantic context of an image stream and a story is then constructed with the guidance of the topic description. |
| Outcome: | The proposed framework can generate stories with higher quality compared to state-of-the-art methods on a VIST dataset. |
Copied to clipboard
| Challenge: | Existing RAG methods lack fine-grained control over query and source sides, resulting in noisy retrieval and shallow reasoning. |
| Approach: | They propose an agentic RAG framework that integrates information sieving via LLM-as-a-knowledge-router. |
| Outcome: | Experiments on multi-hop QA tasks across heterogeneous sources demonstrate improved reasoning depth, retrieval precision, and interpretability over conventional approaches. |
Copied to clipboard
| Challenge: | Existing methods to predict missing elements in NKGs are fixed and therefore cannot be used in real-world situations. |
| Approach: | They propose a task to predict missing elements in unseen facts involving unseent entities and roles in emerging NKGs by embedding unseense entities and role-encoding neural networks. |
| Outcome: | The proposed task outperforms representative models across all datasets. |
Copied to clipboard
| Challenge: | Existing methods to remove undesirable data from Large Language Models suffer from cumulative catastrophic utility loss under continuous unlearning requests. |
| Approach: | They propose a method that leverages the rotational salience weight of RCU to quantify and control the unlearning degree in the continuous unlearning process. |
| Outcome: | The proposed method achieves SOTA performance without a retained dataset. |
Copied to clipboard
| Challenge: | EV battery supply chain is vulnerable to disruptions caused by natural disasters and geopolitical tensions. |
| Approach: | They propose a system integrating Large Language Models with domain expertise for EV supply chain risk assessment. |
| Outcome: | Evaluated on 12,070 paragraphs from 365 sources (2022-2023), SHIELD outperforms baseline GCNs and LLM+prompt methods in disruption prediction. |
Copied to clipboard
| Challenge: | Existing review-based recommenders favor large and complex language encoders that can only learn latent and uninterpretable text representations. |
| Approach: | They propose a tightly coupled two-stage approach to extract latent user sentiments and item properties from reviews and an Attention-Property-aware Rating Estimator (APRE). |
| Outcome: | Extensive experiments on seven real-world Amazon review datasets show that the proposed approach extracts the latent user sentiments, item properties, and the complicated interactions between the two components. |
Copied to clipboard
| Challenge: | Unsupervised multitask pre-training has been the key to the success of language models (LMs) however, scaling it in the post-training stage trends towards better generalization. |
| Approach: | They propose a framework that augments massive raw corpora with instruction-response pairs to pre-train LMs. |
| Outcome: | The proposed framework augments massive raw corpora with instruction-response pairs to pre-train LMs. |
Copied to clipboard
| Challenge: | Large Language Model Unlearning (LLMU) is a promising way to remove private or sensitive information from large language models. |
| Approach: | They propose a Fully Probabilistic Evaluation framework that incorporates input and output distributions in LLMU evaluation. |
| Outcome: | The proposed framework improves unlearning effectiveness by 50.1% and robustness by 37.2% on Llama-2-7B. |
Copied to clipboard
| Challenge: | Existing studies on in-context learning have focused on quantifying the uncertainty associated with the model's response, but they neglect the complexity of the LLM and the uniqueness of in-constitut learning. |
| Approach: | They propose a method to quantify the uncertainty associated with in-context learning and propose corresponding estimation method to quantify both types of uncertainties. |
| Outcome: | The proposed method offers an unsupervised way to understand the prediction of in-context learning in a plug-and-play fashion. |
Copied to clipboard
| Challenge: | SQA is an emerging application of NLP in the medical, geography, and legal domains. |
| Approach: | They propose a dataset of 1,981 scenarios and 4,110 multiple-choice questions in geography domain at high school level. |
| Outcome: | The proposed dataset consists of 1,981 scenarios and 4,110 multiple-choice questions in the geography domain at high school level. |
Copied to clipboard
| Challenge: | Large language models have demonstrated exceptional performance across a wide range of tasks . however, selecting the optimal LLM to respond to a user query often necessitates a delicate balance between performance and cost. |
| Approach: | They propose a multi-LLM routing framework that efficiently routes user queries to the most suitable LLM. |
| Outcome: | The proposed framework outperforms baseline methods in terms of effectiveness and interpretability. |
Copied to clipboard
| Challenge: | Despite its importance, discourse element identification is challenging due to the ambiguity of sentences . the number of elaboration sentences could be 10 times more than the number edna sentences. |
| Approach: | They propose to use sentence positional encodings to explicitly represent sentence positions and inter-sentence attentions to capture sentence interactions and enhance sentence representation. |
| Outcome: | The proposed model improves on a Chinese and English dataset. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) show potential for graph extraction, but often yield ill-formed structures or misinterpret logical constructs such as gateways. |
| Approach: | They propose a framework that treats procedural graph extraction as a multi-round reasoning process with structural and logical refinement agents. |
| Outcome: | The proposed framework achieves significant improvements in structural correctness and logical consistency over strong baselines. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have reshaped machine translation, but multilingual MT still relies heavily on parallel data for supervised fine-tuning. |
| Approach: | They propose a framework that leverages only monolingual data and the intrinsic multilingual knowledge of Large Language Models (LLMs). |
| Outcome: | The proposed framework matches models trained on large-scale parallel data and excels in non-English translation directions. |
Copied to clipboard
| Challenge: | Existing methods for evaluating expressive speech focus on word accuracy, naturalness, signal quality, or emotional intensity at the utterance level. |
| Approach: | They propose a framework for Evaluating Expressive Appropriateness in speech that assesses whether a speech sample aligns with the underlying communicative intent implied by its discourse-level narrative context. |
| Outcome: | The proposed framework outperforms existing speech evaluation and analysis systems on a human-annotated test set. |
Copied to clipboard
| Challenge: | Learning to Instruct is a new paradigm for black-box LLMs with inaccessible internal states. |
| Approach: | They propose a new paradigm that formulates instruction optimization as an LLM fine-tuning objective for a white-box “instruction engineer” LLM. |
| Outcome: | The proposed framework outperforms strong baselines in performance and efficiency. |
Copied to clipboard
| Challenge: | In this paper, we introduce SCALE, a collaborative framework that connects a compact Specialized Translation Model (STM) and a general-purpose Large Language Model (LLM) as one unified translation engine. |
| Approach: | They propose a collaborative framework that connects a Specialized Translation Model (STM) and a general-purpose Large Language Model (LLM) as one unified translation engine. |
| Outcome: | The proposed framework outperforms both LLMs and supervised models in high-resource or challenging low-resourced settings. |
Copied to clipboard
| Challenge: | Explicit reasoning trajectories increase performance but often trigger overthinking . despite its importance, this study examines how each step of reasoning affects the final outcome . |
| Approach: | They propose a Reasoning Completion Point Detector that detects the RCP by monitoring rank dynamics of termination tokens. |
| Outcome: | The proposed method reduces token usage by up to 44% while preserving accuracy. |
Copied to clipboard
| Challenge: | Existing methods for estimating uncertainty in large language models (LLMs) focus on final-step outputs, which fail to account for cumulative uncertainty over multi-step decision-making process and dynamic interactions between agents and their environments. |
| Approach: | They propose a framework that propagates uncertainty through each step of an LLM-based agent’s reasoning process. |
| Outcome: | Extensive experiments on benchmark datasets show that the proposed framework outperforms state-of-the-art methods by 20%. |
Copied to clipboard
| Challenge: | Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence. |
| Approach: | They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included . |
| Outcome: | The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable linguistic comprehension and generation capability, but when applied to specialized industries, they face challenges such as hallucination, insufficient domain knowledge, and failing to incorporate the latest domain knowledge. |
| Approach: | They propose a paradigm for fine-tuning LLMs that effectively injects domain-specific knowledge while safeguarding inference-time data privacy. |
| Outcome: | The proposed model protects private data while enhancing the model's knowledge. |
Copied to clipboard
| Challenge: | Recent years have witnessed a growing interest in the development of explainable recommendation models. |
| Approach: | They propose a model that combines prediction and generation tasks to produce more persuasive explanations by obtaining additional information from the training sets. |
| Outcome: | The proposed model outperforms state-of-the-art models on three datasets and shows that it is more persuasive than previous models. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) exhibit potential artificial generic intelligence, however, their usage is costly with high response latency. |
| Approach: | They develop a dynamic contextual-bandit-based routing system for query-LLM assignment that leverages query tags to enhance query embeddings. |
| Outcome: | The proposed model maximizes response quality and minimizes cost and latency. |
Copied to clipboard
| Challenge: | Existing methods to detect and correct spelling errors in Chinese take external input or just heuristic rules. |
| Approach: | They propose to incorporate phonological and visual similarity knowledge into Chinese language models by using a specialized graph convolutional network. |
| Outcome: | The proposed method outperforms existing models on three human-annotated datasets. |
Copied to clipboard
| Challenge: | Experimental results demonstrate that our method significantly outperforms traditional contrastive learning approaches when using the same amount of data. |
| Approach: | They propose a new contrastive learning method built on embedding conditional probability distributions that integrates two tasks: information compression and conditional distribution alignment. |
| Outcome: | The proposed method outperforms traditional contrastive learning approaches and achieves comparable performance to state-of-the-art models when using the same amount of data. |
Copied to clipboard
| Challenge: | Recent advances in Automatic Speech Recognition (ASR) have been fueled by massive speech corpora, but extending coverage to diverse languages with limited resources remains a formidable challenge. |
| Approach: | They propose a pipeline that converts large-scale text corpora into synthetic speech using off-the-shelf text-to-speech (TTS) models. |
| Outcome: | The proposed pipeline generates 500,000 hours of synthetic speech in ten languages and achieves transcription error reductions of over 30%. |
Copied to clipboard
| Challenge: | Recent advances in model distillation show that data from advanced reasoning models can effectively train smaller student models. |
| Approach: | They propose a method to use both positive and negative distilled reasoning traces to maximize LLM reasoning performance in offline settings. |
| Outcome: | The proposed model outperforms existing methods in the distillation context. |
Copied to clipboard
| Challenge: | Existing reasoning models are limited by inefficiency and computational redundancy . PRISM-MCTS integrates a process reward model with a dynamic shared memory . |
| Approach: | They propose a reasoning framework that integrates a process reward model with a dynamic shared memory. |
| Outcome: | PRISM-MCTS integrates a process reward model with a dynamic shared memory . it halves trajectory requirements on GPQA while surpassing MCTS-RAG and Search-o1 . |
Copied to clipboard
| Challenge: | Existing Multimodal Large Language Models (MLLMs) fail under RDEI, leading to disrupted structure and evidence-unsupported hallucinations. |
| Approach: | They propose a backbone-agnostic, evidence-driven pipeline that treats off-the-shelf MLLMs as interchangeable components to improve stem consistency and figure consistency. |
| Outcome: | The proposed pipeline improves stem consistency by 1.01-3.18%, figure consistency by 0.50-49.16%, and refusal F1 by 1.06-10.88% across question types. |
Copied to clipboard
| Challenge: | Existing privacy studies focus on sub-fields, but they focus on a few sub-domains. |
| Approach: | They propose to use the Health Insurance Portability and Accountability Act of 1996 as an example to develop a checklist that covers social identities, private attributes, and existing privacy regulations. |
| Outcome: | The proposed checklist covers social identities, private attributes, and existing privacy regulations. |
Copied to clipboard
| Challenge: | Metaphor identification is a core task in metaphor processing, which involves recognizing and analyzing metaphorical expressions in text. |
| Approach: | They propose a new formulation of metaphor identification as a relation extraction problem . they use a dataset to analyze metaphorical relations between two spans, a target and a source . |
| Outcome: | The proposed model can capture the properties of the target and source in Chinese sentences. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have impressive capabilities but need for task-specific prompt engineering can hinder their generalization. |
| Approach: | They propose a lightweight and versatile retriever that automatically retrieves prompts for a given zero-shot task input. |
| Outcome: | The proposed model is universally applicable across tasks and models . it mitigates hallucination problem in chatGPT, and it improves even the strongest LLMs. |
Copied to clipboard
| Challenge: | Recent research has demonstrated that goal-oriented dialogue agents can achieve striking performance when interacting with human users. |
| Approach: | They develop algorithms to evaluate the robustness of a goal-oriented dialogue agent by carefully designed attacks using adversarial agents. |
| Outcome: | The proposed attacks reduce the advantage of rewards between the attacker and the trained agent from 2.68 to -5.76 on a scale from -10 to 10 for randomized goals. |
Copied to clipboard
| Challenge: | Recent work has leveraged probing-based approaches to study the separability of malicious and benign inputs in Large Language Models’ internal representations. |
| Approach: | They propose to use probing-based methods to study separability of malicious and benign inputs in LLMs' internal representations to detect harmful and benign content. |
| Outcome: | The proposed methods show that they learn superficial patterns rather than semantic harmfulness. |
Copied to clipboard
| Challenge: | Existing models do not distinguish hard tasks from easy ones in the learning process. |
| Approach: | They propose a novel approach that exploits relation label information to learn better representations by focusing on hard tasks. |
| Outcome: | Experiments on two standard datasets show the proposed approach performs better than previous methods. |
Copied to clipboard
| Challenge: | a few-shot text classification task requires a large number of output classes, with few training examples per class. |
| Approach: | They propose a data augmentation technique suitable for training with limited data for few-shot, highly-multiclass text classification scenarios. |
| Outcome: | The proposed technique improves performance on four classification tasks by 3.0% on average. |
Copied to clipboard
| Challenge: | N-ary Knowledge Graphs (NKGs) capture n-ary facts containing more than two entities. |
| Approach: | They present the first comprehensive survey of link prediction in NKGs . they provide an overview of the field and analyze their performance and application scenarios . |
| Outcome: | The proposed methods provide an overview of the field and analyze performance and application scenarios. |
Copied to clipboard
| Challenge: | Existing studies focus on causality existence, but ignore causal direction. |
| Approach: | They propose a new *identifying while learning* mode for the ECI task that takes care of the causal direction and updates events’ representations for boosting next round of causality identification. |
| Outcome: | The proposed method outperforms the state-of-the-art methods on two public datasets. |
Copied to clipboard
| Challenge: | Existing models for knowledge-to-text generation use RDF triples or key-value pairs to generate a natural language description. |
| Approach: | They propose a large-scale dataset to facilitate the study of KG-to-text . they propose MGCN model architecture that incorporates aggregation methods to extract the rich graph information. |
| Outcome: | The proposed model can represent the original graph information more comprehensively and integrates multiple aggregation methods to extract the rich graph information. |
Copied to clipboard
| Challenge: | Argument mining is an important research field that attracts growing attention in recent years. |
| Approach: | They propose a new task to extract argument pairs from peer review and rebuttal . they use an open review platform to analyze the contents, structure and connections . |
| Outcome: | The proposed task is based on a dataset of 4,764 fully annotated review-rebuttal passage pairs . it is able to detect argumentative propositions and extract argument pairs from the corpus . |
Copied to clipboard
| Challenge: | Existing pruning strategies struggle to enhance robustness against adversarial attacks when continually increasing model sparsity and require a retraining process. |
| Approach: | They propose a pruning strategy that replicates embedding space and feature space of dense language models and aims to conserve more pre-trained knowledge during the pruning process. |
| Outcome: | The proposed pruning strategy replicates embedding space and feature space of dense language models, aiming to conserve more pre-trained knowledge during the pruning process. |
Copied to clipboard
| Challenge: | Existing prompt tuning methods for RC are limited by label spaces and rigid prompt restrictions. |
| Approach: | They propose a generative prompt tuning method to reformulate relation classification as an infilling problem by adding cloze-style phrases to masked language modeling problems. |
| Outcome: | The proposed method exploits rich semantics of entity and relation types and can predict label verbalizations with varying lengths at multiple predicted positions. |
Copied to clipboard
| Challenge: | Mamba-based SSL models are promising for long-sequence modeling, speech unit extraction, and speech self-supervised learning. |
| Approach: | They propose to use Mamba-based HuBERT models as an alternative to Transformer-based SSL architectures. |
| Outcome: | The proposed models outperform Transformer-based models in language modeling tasks while showing superior performance on streaming ASR. |
Copied to clipboard
| Challenge: | a new framework for training data processing for Chinese medical language models is proposed . experimental results show that the framework significantly improves model accuracy . |
| Approach: | They propose a data processing framework for Chinese medical language models training and deployment . the framework is based on a question-oriented model training strategy and privacy preservation . |
| Outcome: | The proposed framework significantly improves model accuracy and reduces privacy leakage by 27%. |
Copied to clipboard
| Challenge: | Developing monolingual large Pre-trained Language Models (PLMs) is shown to be very successful in handling different tasks in Natural Language Processing (NLP). |
| Approach: | They present AraMUS, the largest Arabic PLM with 11B parameters trained on 529GB of high-quality Arabic textual data. |
| Outcome: | The proposed model achieves state-of-the-art performance on a diverse set of Arabic classification and generative tasks. |
Copied to clipboard
| Challenge: | Existing pre-trained dialog models shed light on various downstream tasks in natural language processing (NLP). |
| Approach: | They propose a dialog pre-training framework that introduces latent variables into the enhanced encoder-decoder pre-train framework to increase relevance and diversity of responses. |
| Outcome: | The proposed model achieves state-of-the-art on personaChat, DailyDialog, and DSTC7-AVSD datasets. |