Papers by Kun Wu
Copied to clipboard
| Challenge: | Autoregressive (AR) and diffusion language models (DLMs) suffer from insufficient reasoning capabilities. |
| Approach: | They propose a fully connected Diffusion Language Model that uses a concept-level causal graph to guide attention to learn causal relationships between concepts. |
| Outcome: | The proposed model achieves a 12% improvement and 3.2 training speedup on the COT-OrderPerturb task, along with an average gain of 1.31% across six downstream reasoning tasks. |
Copied to clipboard
| Challenge: | Existing top-k attention methods struggle to strike a balance between efficiency and accuracy. |
| Approach: | They propose a top-k attention approach that integrates low-overhead techniques into the Top-k Attention process to achieve 7.2 speedup compared to vanilla full attention. |
| Outcome: | The proposed approach achieves 7.2 speedup compared to current top-k attention methods while maintaining model accuracy. |
Copied to clipboard
| Challenge: | Domain Large Language Models (LLMs) are developed for domain-specific tasks based on general LLMs, but it still requires professional knowledge to facilitate the expertise for some domain- specific tasks. |
| Approach: | They propose a pipeline to solve domain-specific calculation problems with KIPG . they use it to extract key variables and calculate outcomes dependent on domain knowledge . |
| Outcome: | The proposed pipeline solves domain-specific calculation problems more effectively . it generates knowledge-intensive programs according to the domain- specific documents . |
Copied to clipboard
| Challenge: | Existing methods for dependency parsing address the issue that edges should be constructed at the text span/subtree level rather than word level. |
| Approach: | They propose a method that constructs dependency trees by directly modeling span-span relations by modeling subtree-subtree relationships. |
| Outcome: | The proposed method constructs dependency trees by modeling span-span relations . it can retrieve missing spans in the span proposal stage, which leads to higher recall . |
Copied to clipboard
| Challenge: | Existing large language models (LLMs) have a tendency to hallucinate and provide creative and fluent responses that are not factually accurate. |
| Approach: | They propose a tool that automatically extracts factual claims from text, gathers evidence from external knowledge sources, evaluates the factuality of each claim, and suggests revisions for identified errors. |
| Outcome: | The proposed tool detects errors in text and evaluates their factuality and suggests revisions based on the collected evidence. |
Copied to clipboard
| Challenge: | Existing attentive models attend to all words without prior focus, which results in inaccurate concentration on some dispensable words. |
| Approach: | They propose to use semantic role labeling to provide additional guidance for multi-turn dialogue rewriting models. |
| Outcome: | The proposed model outperforms existing models on multi-turn dialogue rewriting tasks. |
Copied to clipboard
| Challenge: | Existing jailbreak methods create a forced instruction-following scenario, or search adversarial prompts with prefix or suffix tokens to achieve a specific representation manually or automatically. |
| Approach: | They propose a method that rewrites the original instruction to achieve a jailbreak . they propose rewriting the original instructions to improve the attack strategy . |
| Outcome: | The proposed method is more efficient and easier to identify since no additional features are introduced. |
Copied to clipboard
| Challenge: | Current distractor generation methods produce shared distractors for all students, ignoring individual variations in reasoning, which limits their diagnostic effectiveness. |
| Approach: | They propose a method which tailors distractors to each student’s specific cognitive flaws, inferred from their past question-answering (QA) history. |
| Outcome: | The proposed framework outperforms existing methods in generating plausible distractors and adapts to group-level settings. |
Copied to clipboard
| Challenge: | Existing methods to incorporate retriever’s preference during the training of query rewriting models rely on extensive annotations such as in-domain rewrites and/or relevant passage labels, limiting their generalization and adaptation capabilities. |
| Approach: | They propose a framework for training query rewriting models with limited rewrite annotations from seed datasets and completely no passage label. |
| Outcome: | The proposed approach decontexualizes conversational queries into self-contained questions suitable for off-the-shelf retrievers. |
Copied to clipboard
| Challenge: | Existing studies have focused on the direct use of large language models for text generation and labeling, without fully exploring their potential to comprehend the target task and acquire valuable knowledge. |
| Approach: | They propose to distill the knowledge of large language models into smaller models by generating annotated data. |
| Outcome: | The proposed method improves the performance of small domain models while enhancing the ability of large language models. |
Copied to clipboard
| Challenge: | Scientific literature review generation aims to extract and organize important information from an abundant collection of reference papers and produces corresponding reviews while lacking a clear and logical hierarchy. |
| Approach: | They propose a task to generate a hierarchical catalogue of a review paper given various references by using a database of 7.6k literature review catalogues and 389k reference papers. |
| Outcome: | The proposed method produces a hierarchical catalogue of a review paper given various references. |
Copied to clipboard
| Challenge: | Existing approaches to court’s view generation can be used to address this problem, but neglecting the confounding bias in data can limit the model performance and pollute learning outcomes. |
| Approach: | They propose a novel Attentional and Counterfactual based Natural Language Generation method consisting of an attentional encoder and a pair of innovative counterfactual decoders to generate judgment-discriminative court's views. |
| Outcome: | The proposed method is able to generate judgment-discriminative court's views (both supportive and non-supportive views) under both quantitative and qualitative evaluation metrics. |
Copied to clipboard
| Challenge: | Existing methods of natural language generation (NLG) rely on the extensive parameters of pretrained language models (PLMs) but their effectiveness may be compromised by insufficient domain-specific knowledge. |
| Approach: | They propose a knowledge-injected prompt encoder to incorporate domain knowledge during the training stage, thereby reducing computational overhead. |
| Outcome: | The proposed approach outperforms established baselines on real-world data in responsivity of claims and in the ability to transfer domain knowledge. |
Copied to clipboard
| Challenge: | Existing approaches to generate SQL-to-text using seq2seq models do not capture graph-structured information in SQL query. |
| Approach: | They propose a graph-to-sequence model to encode global structure information into node embeddings. |
| Outcome: | The proposed model outperforms the Seq2Seq and Tree2Sq baselines on the WikiSQL and Stackoverflow datasets. |
Copied to clipboard
| Challenge: | Existing charge prediction methods have shown impressive performance, but they face significant challenges when dealing with confusing charges, such as Snatch and Robbery. |
| Approach: | They propose a novel approach which introduces domain knowledge regarding constituent elements to guide the model in making judgments on confusing charges, much like a judge’s reasoning process. |
| Outcome: | The proposed approach maintains exceptional performance in imbalanced label distributions. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) struggle when it comes to specialized domains due to limited domain-specific knowledge. |
| Approach: | They propose an adaptive method that automatically identifies valuable words from a given domain vocabulary. |
| Outcome: | The proposed method has been validated on three Chinese datasets and performed on general tasks. |
Copied to clipboard
| Challenge: | Existing research on emotion recognition in conversation does not reach a consensus on classification theories . despite this, there is no clear consensus on how to recognize previously unseen emotions in real-world applications. |
| Approach: | They propose a prototype-based emotion transfer framework that can be used in real-world applications. |
| Outcome: | The proposed framework shows promise but still faces key challenges in the field of emotion recognition in conversation. |
Copied to clipboard
| Challenge: | Task-oriented dialogs (TOD) require a model to generate a response that optimizes for task-related metrics. |
| Approach: | They propose a faster generation procedure that samples from independent next-word distributions and introduce a fine-grained reward function to help the model focus on learning key information in a dialog. |
| Outcome: | The proposed algorithm achieves state-of-the-art performance on an offline task with 15% training time reduction compared to a standard RL algorithm using auto-regressive generation. |
Copied to clipboard
| Challenge: | Molecular Relational Learning (MRL) is a promising way to understand interactions between molecular pairs. |
| Approach: | They propose a novel LLM-based multi-modal framework for molecular interaction modeling following Chain-of-Thought (CoT) theory which integrates graphical information of two molecules in pair. |
| Outcome: | The proposed framework integrates graphical information of two molecules in pair. |
Copied to clipboard
| Challenge: | Existing CSRL parsers struggle to handle conversational structural information. |
| Approach: | They propose a conversational semantic role labeling task which explicitly encodes speaker dependent information and proposes a multi-task learning method to further improve the model. |
| Outcome: | The proposed model outperforms baselines on benchmark datasets on conversation-based tasks. |
Copied to clipboard
| Challenge: | Existing models lack interpretability due to the neglect of rationale in the prediction process. |
| Approach: | They propose a rationale-based legal judgment prediction framework that follows the judge's real trial logic and provides good interactivity and interpretability. |
| Outcome: | The proposed framework provides good interactivity and interpretability which enables practical use. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is an effective yet efficient solution for fine-tuning large language models. |
| Approach: | They propose a low-rank Adaptation framework that retrieves and composes multiple LoRAs according to input prompts. |
| Outcome: | Experimental results show that LoraRetriever outperforms baselines in terms of performance and versatility. |
Copied to clipboard
| Challenge: | Recent studies have shown that powerful pre-trained language models can be fooled by small perturbations or intentional attacks. |
| Approach: | They propose a framework for fine-tuning PLMs using a masked language model and Gaussian noise to augment semantically relevant examples with sufficient diversity. |
| Outcome: | The proposed framework improves the robustness of pre-trained language models and alleviates performance degradation under adversarial attacks. |
Copied to clipboard
| Challenge: | Existing news recommendation methods learn a single representation for each user, which may be insufficient. |
| Approach: | They propose a neural news recommendation approach which can learn both long- and short-term user representations by using a news encoder and a user encoder. |
| Outcome: | The proposed approach can learn both long- and short-term user representations on a real-world dataset. |
Copied to clipboard
| Challenge: | Existing methods for knowledge distillation use Chain-of-Thought (CoT) and answer pairs, but they lack appropriate supervision signals. |
| Approach: | They propose a framework that decouples CoT and answer supervision . the framework applies semantic similarity constraints while maintaining strict literal matching for the answer . |
| Outcome: | The proposed framework decouples CoT and answer supervision while maintaining strict literal matching for the answer. |
Copied to clipboard
| Challenge: | State-of-the-art methods based on pre-trained models have achieved remarkable performance on the standard test dataset. |
| Approach: | They propose to incorporate hierarchical structure of logical forms into the model and exploit automatically generated counterfactual data for training. |
| Outcome: | The proposed method is effective to alleviate spurious correlations between the headers of the tables and operators of the logical form. |
Copied to clipboard
| Challenge: | Recent advances in computer-using agents have created new safety and security risks . despite the impressive capabilities of CUAs, there are still significant security risks. |
| Approach: | They propose a systematization of knowledge on the safety and security threats of Computer-Using Agents. |
| Outcome: | The proposed framework provides a framework for assessing the safety and security risks of computer-using agents. |
Copied to clipboard
| Challenge: | Existing retrieval methods are designed for general domains, struggling with legal knowledge, or tailored for specific legal tasks, unable to handle diverse legal knowledge types. |
| Approach: | They propose a novel retrieval method that integrates specialized knowledge into LLMs. |
| Outcome: | The proposed method can perform multiple legal retrieval tasks for LLMs. |
Copied to clipboard
| Challenge: | 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: | Large Language Models (LLMs) have made remarkable strides in language generation, but they encounter difficulties in the knowledge-intensive legal domain. |
| Approach: | They propose to decompose court views into different parts, stimulate internal knowledge, and incorporate external information to unleash the power of LLMs in the task. |
| Outcome: | The proposed method generates more accurate and reliable court views on two real-world datasets LAIC2021 and CJO2022. |
Copied to clipboard
| Challenge: | Existing automated writing evaluation systems only detect incoherence in writing . a recent study has found that incorporating specific reasons for incohence improves the quality of rewrites . |
| Approach: | They propose a benchmark that includes expert annotations for detecting incoherence in L2 English writing, identifying the underlying reasons, and rewriting the incoerent sentences. |
| Outcome: | The proposed benchmark improves coherence in L2 English writing by fine-tuning models . the authors find that incorporating specific reasons improves quality of rewrites . |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) and Relation Extraction (RE) models have limited success when extracting general schemas such as quadruples and quintuples. |
| Approach: | They propose a formal formulation that covers almost all extraction schemas and a Recursive Method with Explicit Schema Instructor for UIE. |
| Outcome: | The proposed method shows strong performance under full-shot and few-shot settings and achieves state-of-the-art results on the tasks of extracting complex schemas. |
Copied to clipboard
| Challenge: | Existing methods to improve context faithfulness in large language models are either inadequate or overlook the potential for self-improvement. |
| Approach: | They propose a framework that enhances context faithfulness through fine-grained sentence-level optimization. |
| Outcome: | Experiments on ASQA and ConFiQA datasets show that GenDiE surpasses baselines in faithfulness and correctness and exhibits robust performance for domain adaptation. |
Copied to clipboard
| Challenge: | a recent study shows that performance on general tasks decreases after Large Language Models are fine-tuned on domain-specific tasks. |
| Approach: | They propose a general capability integration approach to integrate general capabilities and domain knowledge within a single instance. |
| Outcome: | The proposed method improves performance on domain-specific tasks by integrating general capabilities and domain knowledge. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks rely on direct prompting of resource-intensive models with complex multi-stage prompts, introducing significant computational cost and underutilizing models’ reasoning capabilities. |
| Approach: | They propose a framework that trains evaluators with reinforcement learning to generate comprehensive and sound assessments with detailed explanation in one-pass. |
| Outcome: | The proposed framework outperforms baseline evaluation frameworks that rely on LLMs with 10-100 more parameters and achieves the strongest correlation with human judgments. |
Copied to clipboard
| Challenge: | Existing approaches to decode large language models (LLMs) often over-reject benign information, limiting their generalizability in real-world scenarios where harmful and benign information coexist. |
| Approach: | They propose a framework to regulate decoding alignments for Large Language Models (LLMs) they employ a reward-guided branch decoding paradigm to incorporate safety awareness during generation. |
| Outcome: | The proposed framework achieves superior performance on four attack benchmarks and two neutral datasets. |
Copied to clipboard
| Challenge: | Recent work has demonstrated that Word Mover’s Distance (WMD) that aligns semantically similar words yields unprecedented KNN classification accuracy. |
| Approach: | They propose a Word Mover’s Distance (WMD) method that aligns semantically similar words to generate unsupervised sentences or documents embeddings. |
| Outcome: | The proposed method consistently outperforms state-of-the-art techniques on 9 benchmark text classification datasets and 22 textual similarity tasks. |
Copied to clipboard
| Challenge: | Recent methods to enhance queries by generating intermediary elements can degrade retrieval performance . combining LLMs and retrievers can be difficult, resulting in unreliable or irrelevant intermediaries . |
| Approach: | They propose a framework that facilitates the coevolution of large language models and retrieval models. |
| Outcome: | The proposed framework facilitates the coevolution of LLMs and retrieval models. |
Copied to clipboard
| Challenge: | Recent advances in deep learning have enabled a variety of techniques to be used to solve the LJP task. |
| Approach: | They propose a framework that leverages the strength of both LLMs and domain-specific models in the context of precedents. |
| Outcome: | The proposed framework leverages the strength of both LLM and domain models in the context of precedents. |
Copied to clipboard
| Challenge: | Recent methods to reduce the KV cache size fail to identify crucial KVs for generation while excluding others accurately, resulting in severe information loss. |
| Approach: | They propose an intention-aware KV cache eviction method that identifies and retains crucial KVs according to the attention distribution of intention, which semantically reflects the user’s goal and determines which part of the context is relevant. |
| Outcome: | The proposed method can maintain the model performance while reducing the KV cache size from 128K to 2K, leading to a 6.3x increase in decoding speed and 7.8x enhancement in memory efficiency compared to the default setting. |
Copied to clipboard
| Challenge: | Existing video large language models (LMMs) employ an impedance of thousands of frames to understand long videos. |
| Approach: | They propose a plug-and-play module integrated with VideoLLMs to facilitate efficient lengthy video perception. |
| Outcome: | The proposed module boosts the performance of open-source VideoLLMs and proprietary assistants on long-form video benchmarks. |
Copied to clipboard
| Challenge: | Genereal domain large models lack nuanced multimodal understanding of social media . general domain models focus more on text than other modalities, which is not consistent with real-world user habits. |
| Approach: | They propose a Large Vision Language Model for Social Media Processing that combines five key capabilities to understand and generate real social media behavior. |
| Outcome: | The proposed model achieves state-of-the-art performance in multiple social media tasks. |
Copied to clipboard
| Challenge: | Existing approaches to model conversation context have drawbacks, such as lack of coreferences and long dependency. |
| Approach: | They propose a context rewriting method which explicitly rewrites the last utterance by considering context history. |
| Outcome: | The proposed method outperforms baselines in terms of rewriting quality, multi-turn response generation, and end-to-end retrieval-based chatbots. |
Copied to clipboard
| Challenge: | Xu et al., 2021: conversational semantic role labeling is under-explored in non-Chinese languages due to the lack of multilingual CSRL annotations for the parser training. |
| Approach: | They propose a model that implicitly learns conversational structure-aware representations with hierarchical encoders and elaborately designed pre-training objectives. |
| Outcome: | The proposed model outperforms baselines on English CSRL tests by large margins . it will facilitate the research of non-Chinese dialogue tasks which suffer from ellipsis and anaphora . |
Copied to clipboard
| Challenge: | Existing research on the utilization of Knowledge Graphs (KGs) for large language models (LLMs) relies on subgraph retriever or iterative prompting, overlooking the potential synergy of LLMs’ step-wise reasoning capabilities and KGs’ structural nature. |
| Approach: | They propose a graph-aware constrained decoding framework that facilitates a deep synergy between LLMs and KGs by constraint derived from the topology of the KG. |
| Outcome: | The proposed framework can provide faithful and sound reasoning for KGQA. |
Copied to clipboard
| Challenge: | Experimental results show that Memformer uses 8.1x less memory space and 3.2x faster on inference. |
| Approach: | They propose an efficient neural network that utilizes an external dynamic memory to encode and retrieve past information. |
| Outcome: | The proposed model achieves comparable performance against baselines with 8.1x less memory space and 3.2x faster on inference. |
Copied to clipboard
| Challenge: | Existing methods target instruction dialogues as learning goal and fine-tune user simulators to pose instructions. |
| Approach: | They propose to use real instruction dialogues to model complex dialogue flows and pose high-quality instructions. |
| Outcome: | The proposed method generates diverse, in-depth, and insightful instructions for a given dialogue history. |
Copied to clipboard
| Challenge: | Currently, legal claims are not being used by non-professionals. |
| Approach: | They construct a dataset for Chinese legal claim generation task and then use it to evaluate the generated claims. |
| Outcome: | The proposed dataset is the first for the Chinese legal claim generation task and will be made publicly available. |
Copied to clipboard
| Challenge: | Rapid advances in Large Language Models have spurred demand for processing extended context sequences . however, performance degradation due to sequence lengths out-of-distribution and excessively long inference times are limiting LLMs in long-context scenarios. |
| Approach: | They propose a training-free method for efficient and accurate long-context inference . they selectively involves a few critical KV cache tokens in attention calculation . |
| Outcome: | The proposed method speeds up attention computation and accelerates inference time while reducing selection overhead. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have revolutionized various domains, offering unprecedented performance across numerous tasks. |
| Approach: | They propose a new Mixture of Low-Rank Experts (MoRE) for multi-task PEFT to improve performance of LLMs with fewer parameters. |
| Outcome: | The proposed method improves performance over multiple tasks and no additional inference cost. |
Copied to clipboard
| Challenge: | Hallucination remains a critical challenge in large language models (LLMs) in high-stake domains such as legal question answering. |
| Approach: | They propose a method to mitigate hallucination in legal question answering by using behavior cloning and a novel Hard Sample-aware Direct Preference Optimization. |
| Outcome: | The proposed method improves non-hallucinated Statute Rate, Statute Relevance Rate, Legal Claim Truthfulness, and traditional metrics. |
Copied to clipboard
| Challenge: | Aspect-based sentiment analysis (ABSA) predicts sentiment polarity towards a specific aspect in a sentence. |
| Approach: | They propose to use a dynamic aspect-oriented semantics-based method to learn ABSA. |
| Outcome: | The proposed method can learn dynamic aspect-oriented semantics for ABSA on three benchmark datasets. |
Copied to clipboard
| Challenge: | Existing Knowledge-Enhanced Large Language Models (K-LLMs) toolkits focus on free-textual knowledge and lack robust datasets, models, and user-friendly experience. |
| Approach: | They propose a flexible heterogeneous knowledge enhancement toolkit to enhance Large Language Models (LLMs) using external knowledge. |
| Outcome: | KMatrix: a flexible heterogeneous knowledge enhancement toolkit for LLMs includes verbalizing-retrieval and parsing-query methods. |
Copied to clipboard
| Challenge: | Existing studies on K-LLMs systems focus on declarative knowledge and procedural knowledge (rules) . |
| Approach: | They propose to build a toolkit that supports comprehensive heterogeneous knowledge collaborative enhancement for Large Language Models (LLMs). |
| Outcome: | The proposed toolkit provides unified knowledge integration and joint knowledge retrieval methods to achieve more comprehensive heterogeneous knowledge collaborative enhancement. |
Copied to clipboard
| Challenge: | Existing domain adaptation methods train heterogeneous skills together, making it difficult to reliably coordinate multiple skills when solving complex tasks. |
| Approach: | They propose a framework that decomposes domain competence into atomic skills and composes them dynamically during generation. |
| Outcome: | The proposed framework decomposes domain competence into atomic skills, trains them independently, and composes them dynamically during generation. |
Copied to clipboard
| Challenge: | Existing approaches to cross-prompt automated essay scoring use all available sources . however, using multiple sources for continual adaptation raises privacy concerns . |
| Approach: | They propose a source-free adaptation approach that selectively merges the parameters of individual models without further access to the source datasets. |
| Outcome: | The proposed method outperforms joint-training methods on all sources while maintaining computational efficiency. |
Copied to clipboard
| Challenge: | Existing datasets with verifiable answers are limited in reliability, diversity, and scalability . a new approach to generate verifikatable data at scale is needed to improve models' performance . |
| Approach: | They propose a formal framework for synthesizing verifiable data at scale using a novel DSL-driven approach. |
| Outcome: | The proposed framework improves performance on a wide range of puzzles and logic benchmarks. |
Copied to clipboard
| Challenge: | Text classification is a core task in natural language processing (NLP) Graph neural networks (GNNs) serve as an effective approach for transductive learning. |
| Approach: | They propose a model that combines large scale pretraining and transductive learning for text classification. |
| Outcome: | The proposed model achieves SOTA performance on a wide range of datasets. |
Copied to clipboard
| Challenge: | under the pandemic of COVID-19, people experiencing COVI D19-related symptoms have a pressing need to consult doctors. |
| Approach: | They develop a medical dialog system that can provide COVID19-related consultations . they use two dialog datasets containing conversations between doctors and patients . |
| Outcome: | The proposed system can provide COVID19-related consultations, but is too small compared with general-domain dialog datasets. |
Copied to clipboard
| Challenge: | Existing methods to improve ICD coding focus on a single type of knowledge and design specialized modules that are complex and incompatible with each other. |
| Approach: | They propose a general knowledge injection framework that integrates three key types of knowledge without specialized design of additional modules. |
| Outcome: | The proposed framework outperforms baseline models and is comparable to models relying on extra human annotations. |
Copied to clipboard
| Challenge: | In-context learning (ICL) is a powerful tool for enhancing large language models (LLMs) by mimicking the human learning process. |
| Approach: | They propose a Chain-of-Quizzes framework that uses LLMs to answer a quiz to sift 'good' examples, combine them iteratively with the increasing complexity, and utilize a final exam to gauge the combined example chains. |
| Outcome: | The proposed framework outperforms baseline models on diverse reasoning datasets and shows that it is scalable and can be used in future research. |
Copied to clipboard
| Challenge: | Existing studies fail to distinguish different classification errors with a standard cross-entropy classification loss and ignore the numbers in the fact description for predicting the term of penalty. |
| Approach: | They propose to extract crime amounts from fact description and use them to learn distinguishable representations to exploit the numbers in the fact description for predicting the term of penalty. |
| Outcome: | The proposed method achieves state-of-the-art results on real-world datasets and ablation studies demonstrate the effectiveness of each component. |
Copied to clipboard
| Challenge: | LLM-based multi-agent systems (MAS) have demonstrated remarkable capabilities in solving complex tasks. |
| Approach: | They propose a communication inference attack that constructs new adversarial queries to induce intermediate agents’ reasoning outputs and models their semantic correlations through the global bias disentanglement and LLM-guided weak supervision. |
| Outcome: | The proposed attack achieves an average AUC of 0.87 and a peak AUC up to 0.99, revealing the privacy risk in MAS. |
Copied to clipboard
| Challenge: | Existing neural semantic parsers extract word order features while neglecting other valuable syntactic information. |
| Approach: | They propose to use syntactic graph to represent three types of syntaktic information . they then employ a graph-to-sequence model to encode the syntastic graph and decode a logical form . |
| Outcome: | The proposed model is comparable to the state-of-the-art on Jobs640, ATIS, and Geo880. |
Copied to clipboard
| Challenge: | Existing methods to select demonstrations based on surface-level semantic similarities fall short of identifying the most fitting ones. |
| Approach: | They propose a method that characterizes latent learningscape features of demonstrations and uses them to create more effective prompts. |
| Outcome: | The proposed method outperforms leading models in arithmetic, commonsense, and symbolic reasoning tasks showing an average increase in scores by 7.4 percentage points. |
Copied to clipboard
| Challenge: | Legal judgment prediction (LJP) is an essential task for legal AI, aiming at predicting judgments based on the facts of a case. |
| Approach: | They propose a knowledge-enhanced approach that incorporates 'label-level knowledge' to enhance the representation of case facts for each task and 'task-level' knowledge to improve synergy. |
| Outcome: | The proposed method is effective in comparison to state-of-the-art (SOTA) baselines. |
Copied to clipboard
| Challenge: | Existing text-to-SQL parsing methods mainly focus on English, but there is no labeled data available for the language . a larges-scale and pragmatic Chinese dataset is used for cross-domain text- to-Sql task . |
| Approach: | They propose a larges-scale Chinese dataset for a cross-domain text-to-SQL task . they analyze questions from several representative applications and use an effective data construction framework . |
| Outcome: | The proposed dataset contains 200 databases, 813 tables, and 23,797 question/SQL pairs. |
Copied to clipboard
| Challenge: | Existing studies have incorporated different digital traces to better learn the representations of social media users, limited by overloaded text information and hard-to-collect social network information. |
| Approach: | They propose a Pre-training Architecture for Social Media User Modeling based on Text Graph and combine microblogs to represent social media users based upon the text graph model. |
| Outcome: | The proposed framework can represent users based on text even without social network information on microblogs. |
Copied to clipboard
| Challenge: | Existing approaches to parse text-to-SQL data are lacking labeled data for unseen evaluation databases. |
| Approach: | They propose a framework for enhancing SQL queries by automatically producing large numbers of SQL queries based on an abstract syntax tree grammar. |
| Outcome: | The proposed framework can produce high-quality natural language questions over strong baselines. |
Copied to clipboard
| Challenge: | Recent advances in pretraining methods have achieved promising results on NLP tasks . however, it is unclear which pretraining objective is the most effective for each downstream task . |
| Approach: | They evaluate the effectiveness of domain-adaptive pretraining objectives on downstream tasks . they use open-domain data to pretrain language models like BERT and SpanBERT . |
| Outcome: | The proposed model improves on two dialogue understanding tasks with domain-adaptive pretraining objectives. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are becoming increasingly popular in education, enabling researchers to simulate students' learning patterns and learning patterns. |
| Approach: | They propose a training-free framework for student simulation that takes into account student cognitive diversity and realism. |
| Outcome: | The proposed model outperforms baseline models and achieves 100% improvement in simulation accuracy and realism. |
Copied to clipboard
| Challenge: | Existing studies on response generation focus on relevance and fluency, rarely paying attention to the focus. |
| Approach: | They propose a Focus-aware response generation method that takes the focus into consideration and optimizes a multi-level encoder and focal decoder to generate multiple candidate responses. |
| Outcome: | The proposed method generates candidate responses that correspond to different focuses and performs better on two orthogonal inquiry conversation datasets. |
Copied to clipboard
| Challenge: | Experimental results show that Legal-R1 delivers competitive performance across diverse tasks. |
| Approach: | They propose to evaluate 12 large language models across 17 legal tasks across statutory and case-law traditions to determine their general reasoning performance. |
| Outcome: | The proposed model performs well across 17 legal tasks across statutory and case-law traditions. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have greatly expanded the scope of legal AI. |
| Approach: | They propose a method that generates questionnaires to help users refine queries . they leverage an iterative training process that collects valuable questionnaires . |
| Outcome: | The proposed method improves the completeness of queries and ensures the performance of domain-specific models in downstream legal tasks. |
Copied to clipboard
| Challenge: | a new generation of (M)LLMs is enabling the creation of superintelligent AI assistants . OS Agents can complete tasks autonomously and have the potential to significantly enhance the lives of billions of users worldwide. |
| Approach: | They propose to build OS Agents that operate within operating systems' GUIs and GUIs . they examine evaluation metrics and benchmarks to identify promising directions . |
| Outcome: | The proposed agents are based on operating systems (OS) and operating systems frameworks. |
Copied to clipboard
| Challenge: | Large language model (LLM) agents execute tasks through multi-step workflows that combine planning, memory, and tool use. |
| Approach: | They propose a modular framework that provides a unified view of backdoor threats in LLM agents. |
| Outcome: | The proposed framework provides a unified, agent-centric view of backdoor threats in LLM agents. |
Copied to clipboard
| Challenge: | Existing generative models lack the capacity for explicit and controllable reasoning, a key advantage of LLMs. |
| Approach: | They propose a framework that integrates dialogue, reasoning, and personalized recommendation. |
| Outcome: | Experiments across public benchmarks show state-of-the-art performance. |