Papers by Kang He
Copied to clipboard
| Challenge: | Existing methods for numerical reasoning are not flexible enough to handle diverse expressions. |
| Approach: | They propose a Relational Graph enhanced Hybrid table-text Numerical reasoning model with Tree decoder which captures relationship between numerical value, table schema, and text information on the encoder side. |
| Outcome: | The proposed model outperforms the baseline model and achieves state-of-the-art results on the publicly available tabletext hybrid QA benchmark. |
Copied to clipboard
| Challenge: | Existing methods focus on normal class and fail to extract relational triplets precisely. |
| Approach: | They propose an end-to-end model which can jointly extract relational triplets from sentences . they employ two different strategies in decoding process: employing only one united decoder or applying multiple separated decodeurs. |
| Outcome: | The proposed model outperforms the baseline method significantly in two datasets. |
Copied to clipboard
| Challenge: | a novel post-training pruning method relies on the Hessian matrix to perform pruning . current pruning methods are computationally intensive and lack performance due to second-order derivative calculations. |
| Approach: | They propose a Hessian-free weight pruning method that reduces computational burden . they use an Exponentially Weighted Moving Average technique to bypass weight sorting . |
| Outcome: | The proposed method achieves hardware-efficient model compression by eliminating computational intensive calculations. |
Copied to clipboard
| Challenge: | Causality explanation generation is a generative task that aims to explain why a given cause-effect pair is true using natural language. |
| Approach: | They propose a multi-agent framework with role-playing and iterative feedback for causality explanation generation. |
| Outcome: | The proposed framework is superior to existing frameworks on WIKIWHY and e-CARE datasets. |
Copied to clipboard
| Challenge: | Existing methods to integrate LLMs with Knowledge Graphs (KGs) however, these methods are often incomplete to cover all the knowledge required to answer questions. |
| Approach: | They propose to integrate LLMs with Knowledge Graphs (KGs) to address insufficient knowledge and hallucination issues in Large Language Models. |
| Outcome: | The proposed method outperforms existing methods on two datasets. |
Copied to clipboard
| Challenge: | Complex Query Answering (CQA) is a challenge task of Knowledge Graphs due to incompleteness of KGs. |
| Approach: | They propose a query embedding approach that decouples the training for simple and complex queries. |
| Outcome: | The proposed approach decouples training for simple and complex queries and achieves state-of-the-art performance over three public benchmarks. |
Copied to clipboard
| Challenge: | Large language models have enabled the development of coding agents for real-world code generation. |
| Approach: | They propose a novel LLM-driven test case generator that analyzes codebases and dependencies to generate test cases for real-world Python projects. |
| Outcome: | The proposed framework improves the performance of SWE-Bench by analyzing codebases and dependencies. |
Copied to clipboard
| Challenge: | UFO is a UI-Fcused agent designed to fulfill user requests tailored to Windows OS applications . it decomposes user requests using divide-and-conquer approach, enabling seamless navigation and addressing sub-tasks across multiple applications. |
| Approach: | They propose a UI-Fcused Windows OS agent that decomposes user requests using a divide-and-conquer approach and incorporates a control interaction module tailored for Windows OS. |
| Outcome: | The proposed agent decomposes user requests using divide-and-conquer approach, enabling seamless navigation and addressing sub-tasks across multiple applications. |
Copied to clipboard
| Challenge: | Existing stance detection datasets are limited to a limited set of specific targets . current models are limited in their ability to detect large numbers of unseen targets based on a large number of unidentified targets. |
| Approach: | They propose a speaker interaction and target-aware prototypical contrastive learning model that can detect public opinion towards specific targets using social media data. |
| Outcome: | The proposed model achieves state-of-the-art in zero-shot conversational stance detection with only an F1-macro score of 43.81%. |
Copied to clipboard
| Challenge: | Existing studies highlight that dependency-related issues cause over 40% of observed runtime errors on the generated repository. |
| Approach: | They propose a large-scale benchmark and evaluation framework specifically designed to assess LLMs’ capability on dependency inference. |
| Outcome: | The proposed model achieves only a 48% execution pass rate on Python, indicating room for improvement. |
Copied to clipboard
| Challenge: | Existing multimodal sentence representation learning methods focus on aligning images and text at a coarse level, resulting in cross-modal misalignment bias and intra-modal semantic divergence. |
| Approach: | They propose a dual-level alignment learning framework for multimodal sentence representation learning that promotes cross-modal and intra-modal alignment. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on semantic textual similarity and transfer tasks on semantic similarity, ranking distillation and global intra-modal alignment learning. |
Copied to clipboard
| Challenge: | Currently, Chinese characters share glyph and phonetic variations to escape detection algorithms due to their complexity and complexity. |
| Approach: | They propose a Chinese variation-enhanced Graph Embedding algorithm that can learn Chinese character embeddings and latent variation families. |
| Outcome: | The proposed model outperforms state-of-the-art models on Chinese spam detection datasets and review datasets. |
Copied to clipboard
| Challenge: | Prompt-based learning is susceptible to intrinsic bias present in pre-trained language models (LMs), leading to sub-optimal performance in prompt-based zero/few-shot settings. |
| Approach: | They propose a null-input prompting method to calibrate intrinsic bias encoded in pre-trained language models (LMs) they leverage a diverse set of auto-selected null meaning inputs generated from GPT-4 to probe intrinsic bias. |
| Outcome: | The proposed method significantly improves zero/few-shot learning performance of LMs for both in-context learning and prompt-based fine-tuning (on average 9% and 2%, respectively). |
Copied to clipboard
| Challenge: | Existing continual learning paradigms prioritize instant performance through dense updates, leading to catastrophic forgetting and rapid exhaustion of model capacity. |
| Approach: | They propose a method that preserves previously acquired knowledge and acquires new task-specific skills while preserving sufficient parameter capacity for subsequent adaptation. |
| Outcome: | The proposed method is based on the brain's functional partitioning and can be used to map tasks between specialized and generalist neurons. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown great power in solving various tasks but fail in many specific tasks. |
| Approach: | They propose a framework to help black-box LLMs better adapt to unfamiliar tasks by reflecting and noting experiences from training data and retrieving them from external memory during testing. |
| Outcome: | The proposed framework improves the performance of black-box Large Language Models on multiple tasks and demonstrates that it is a good choice for the future. |
Copied to clipboard
| Challenge: | Existing benchmarks fail to evaluate extremely long-context LLMs or analyze their limitations. |
| Approach: | They propose a Synthetic, Scalable, Systematic evaluation suite for LLMs using SQL execution. |
| Outcome: | The proposed evaluation suite is able to scale text length and difficulty across scenarios and provides strong correlations with real-world benchmarks. |
Copied to clipboard
| Challenge: | Existing benchmarks for agentic programming in long-horizon command-line interface tasks are limited by short task horizons, data contamination from GitHub scraping, and a lack of fine-grained evaluation metrics. |
| Approach: | They propose a benchmark to evaluate agentic capabilities across long-horizon command-line interface tasks. |
| Outcome: | The proposed benchmarks cover four engineering categories: from scratch, feature addition, bug fixing, and refactoring. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have remarkable multi-step reasoning capabilities, but they still face challenges in complex logical reasoning. |
| Approach: | They propose an algorithm-guided search framework that automates structured proof exploration and ensures logical coherence. |
| Outcome: | The proposed framework outperforms o3-mini and chain-of-thought with average gains of 23.6% and 12.5% on five datasets. |
Copied to clipboard
| Challenge: | Existing taxonomies focus on adding concepts to the leaf nodes of the existing tree, which does not fully utilize the taxonomy’s knowledge and is unable to update the original taxomy structure. |
| Approach: | They propose a two-stage method called ATTEMPT for taxonomy completion that inserts new concepts into the correct position by finding a parent node and labeling child nodes. |
| Outcome: | The proposed method performs best on taxonomy completion and extension tasks, surpassing existing methods. |
Copied to clipboard
| Challenge: | Structured knowledge grounding (SKG) tasks are a key part of many NLP applications. |
| Approach: | They propose a framework for enhancing LLMs' ability to handle structured data . they represent various types of structured data in a unified hypergraph format . |
| Outcome: | The proposed framework outperforms existing methods on SKG tasks using LoRA finetuning. |
Copied to clipboard
| Challenge: | Recent studies have shown that large language models (LLMs) can be effective for correcting factual inaccuracies but can still suffer from hallucinations. |
| Approach: | They propose a queue-based self-correction framework that addresses parameter bias during sequential model editing. |
| Outcome: | The proposed framework outperforms baseline models while maintaining competitive performance in single-turn editing. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have a transparent brain with accessible parameters that encode extensive knowledge, which can be analyzed, located and transferred. |
| Approach: | They propose a new paradigm that aligns parametric spaces of LLMs using several training steps without following training. |
| Outcome: | The proposed model aligns parametric spaces across scales using only training steps without following training. |
Copied to clipboard
| Challenge: | Simple question answering over knowledge bases is one of the most important natural language processing tasks. |
| Approach: | They propose to conduct pattern extraction and entity linking first and put forward pattern revising procedure to mitigate the error propagation problem. |
| Outcome: | The proposed method outperforms the current state-of-the-art in this task by an absolute large margin. |
Copied to clipboard
| Challenge: | Recent studies indicate that Large Language Models model rich knowledge, but it is often not activated and awakened. |
| Approach: | They propose a framework that leverages richer context to enhance question answering . Explicit awakening fine-tunes a context generator to create a synthetic, compressed document that functions as symbolic context. |
| Outcome: | The proposed framework mimics the human ability to answer questions using only thinking and recalling to compensate for knowledge gaps. |
Copied to clipboard
| Challenge: | Text-to-SQL parsing aims to parse natural language questions into SQL queries . current attention-based approaches can only model alignments at the token level . |
| Approach: | They propose a method to leverage explicit lexico-logical alignments by identifying possible phrase-level alignments and injecting them as additional contexts into the parsing procedure. |
| Outcome: | The proposed approach improves performance by 3.4% on Squall. |
Copied to clipboard
| Challenge: | Recent techniques such as Generation-Augmented Retrieval (GAR) and Generative Document Retrieleval (GDR) leverage LLMs to enhance retrieval performance but face key challenges: GAR’s generated content may not always align with the target document corpus, while GDR limits the generative capacity of LLM. |
| Approach: | They propose a Context-Aware Generation-Augmented Retrieval approach which integrates corpus information into their generation process. |
| Outcome: | Experimental results show that CA-GAR outperforms existing methods on seven tasks and four non-English languages. |
Copied to clipboard
| Challenge: | Existing medical dialogue systems have the problems of weak scalability, insufficient knowledge, and poor controllability. |
| Approach: | They propose a medical conversational question-answering system based on the knowledge graph to improve scalability and controllability. |
| Outcome: | The proposed system can conduct knowledge-grounded dialogues with users, using a Chinese medical knowledge graph and a large-scale dataset. |
Copied to clipboard
| Challenge: | Existing typography solutions lack adaptability, creativity, and computational efficiency. |
| Approach: | They propose a user-driven framework for artistic typography synthesis based on the Large Language Model (LLM) the LLM Engine interprets user inputs and generates actionable prompts for the other modules, transforming abstract concepts into tangible designs. |
| Outcome: | The proposed framework incorporates four key modules: the LLM Engine, SemTypo, StyTyPo, and TexTyPO. |
Copied to clipboard
| Challenge: | Existing methods for knowledge Graph Completion (KGC) fail in unseen relation representations. |
| Approach: | They propose to use three kinds of graphs to obtain unseen relation representations . they propose to decouple mixture-of-graph experts (DMoG) for unseened relations learning . |
| Outcome: | The proposed method outperforms the state-of-the-art methods on unseen relation representations. |
Copied to clipboard
| Challenge: | Conventional methods employ a fixed vocabulary and one-pass decoding, which make them prone to safe and general responses and lack further refinement to the first generated raw sequence. |
| Approach: | They propose a Vocabulary Pyramid Network which integrates multi-pass encoding and decoding with multi-level vocabularies into response generation. |
| Outcome: | The proposed system outperforms strong baselines on English Twitter and Chinese Weibo datasets. |
Copied to clipboard
| Challenge: | Existing offline DST models require a fixed dataset to train . Existing domain-lifelong learning methods are impractical in real-world applications . |
| Approach: | They propose a domain-lifelong learning method to continuously train a DST model on new data to learn incessantly emerging new domains while avoiding catastrophically forgetting old learned domains. |
| Outcome: | The proposed method outperforms state-of-the-art lifelong learning methods by 4.25% and 8.27% on the MultiWOZ and the SGD benchmarks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities in comprehensively handling various types of natural language processing (NLP) tasks. |
| Approach: | They propose a method for task-specific neuron localization based on Causal Gradient Variation with Special Tokens (CGVST) this method identifies task- specific neurons by concentrating on the most significant tokens during task processing, eliminating redundant tokens and minimizing interference from non-essential neurons. |
| Outcome: | The proposed method can locate task-specific neurons across eight public tasks. |
Copied to clipboard
| Challenge: | Large language models can teach small language models to solve complex reasoning tasks by Chain-of-thought Distillation (CoTD) e.g., mathematical question answering. |
| Approach: | They propose a method that distills two student models to solve a multi-hop question . they use chain-of-thought distillation to generate step-by-step reasoning paths . |
| Outcome: | The proposed method surpasses existing methods on knowledge-intensive multi-hop questions. |
Copied to clipboard
| Challenge: | Despite their distinct external representations, a deeper analysis reveals their intrinsic nature: instructions serve as a natural language compression devised by humans for data governing specific mapping patterns, whereas parameters act as 'neuro compression' of the same task data. |
| Approach: | They propose a neural network framework to model and learn the bi-directional mappings between instructions and parameters of large language models by evaluating it on the tasks of instruction deduction and induction. |
| Outcome: | The proposed framework can map one of the instructions/parameters to the other by evaluating it on the tasks of instruction deduction and induction. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can improve commonsense reasoning by generating intermediate knowledge, but the effectiveness of this knowledge introspection is not always guaranteed. |
| Approach: | They propose a training-free strategy that optimizes introspection via two stages: Knowledge Detection and Knowledge Regeneration. |
| Outcome: | The proposed approach mitigates the limitations of standard introspection and has consistent performance gains across all settings. |
Copied to clipboard
| Challenge: | Existing intent detection models can only handle predefined intent classes in the offline environment. |
| Approach: | They propose a method that continually learns new intent classes from new data . structure-based retrospection and contrastive knowledge distillation are used to solve these problems . |
| Outcome: | The proposed method outperforms existing models on three benchmarks. |
Copied to clipboard
| Challenge: | Existing benchmarks for textual question answering only focus on single-chain or single-hop retrieval . Existing approaches to answer complex questions have limitations . |
| Approach: | They propose to conduct Graph-Hop, a novel multi-chains and multi-hops retrieval paradigm in complex question answering. |
| Outcome: | The proposed model provides explicit and fine-grained evidence graphs for complex question to support comprehensive and detailed reasoning. |
Copied to clipboard
| Challenge: | Existing active learning approaches for natural language processing ignore the characteristics of natural language. |
| Approach: | They propose a pre-trained language model based active learning approach for sentence matching that provides linguistic criteria to measure instances and help select more effective instances for annotation. |
| Outcome: | The proposed approach can achieve greater accuracy with fewer labeled training instances. |
Copied to clipboard
| Challenge: | Existing code translation models only learn the contextual semantics of code during pre-training, neglecting executability information closely related to the execution state of the code. |
| Approach: | They propose an LLM specifically designed for code translation called ExeCoder . it uses executability representations such as functional semantics and syntax structures to enhance LLMs' capabilities. |
| Outcome: | The proposed model outperforms existing open-source code translation models on two metrics. |
Copied to clipboard
| Challenge: | Shortcuts such as APIs and deep-links have emerged as efficient complements to flexible GUI operations, but systematic evaluation of GUI–shortcut hybrid agents remains underexplored. |
| Approach: | They propose a benchmark that evaluates GUI-shortcut hybrid agents with a specific focus on the mobile domain. |
| Outcome: | MAS-Bench evaluates agent's ability to generate shortcuts by discovering and creating reusable, low-cost workflows. |
Copied to clipboard
| Challenge: | Existing methods to detect medical intents require fixed pre-defined intent categories . however, novel medical intent categories incessantly emerge with new data and intents in the real world . |
| Approach: | They propose to incrementally learn emerged medical intents from continually arriving data of new intents while avoiding catastrophically forgetting old ones. |
| Outcome: | The proposed method outperforms the state-of-the-art model on two benchmarks by 5.7% and 9.1% accuracy. |
Copied to clipboard
| Challenge: | Recent studies have shown that Large Language Models (LLMs) have limited ability to conduct induction. |
| Approach: | They propose a framework to enable LLMs to teach themselves induction through deduction. |
| Outcome: | The proposed framework improves performance on two induction benchmarks and shows that it can be used to teach induction through deduction. |
Copied to clipboard
| Challenge: | Existing works didn’t consider the extraction order of relational facts in a sentence. |
| Approach: | They propose to take the extraction order into consideration by applying reinforcement learning into a sequence-to-sequence model. |
| Outcome: | The proposed model could generate relational facts freely. |
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 toolsets that use large language models are limited to single-task settings. |
| Approach: | They propose a framework that dynamically constructs and evolves a hierarchical graph of reusable tools across multiple scenarios. |
| Outcome: | The proposed framework achieves up to 4.3 faster milestone completion in Minecraft compared to the previous state-of-the-art method and provides an average improvement of 9.23% over existing tool-making methods in code generation tasks and 10.03% in agent tasks. |
Copied to clipboard
| Challenge: | Current Chain-of-thought Distillation methods hinder CoT reasoning performance . student models are separately distilled from specific reasoning tasks . parameter update of student models severely harms CoT ability on unseen reasoning tasks. |
| Approach: | They propose a method which distills Chain-of-thought reasoning ability of large language models to much smaller student models. |
| Outcome: | The proposed method improves the reasoning ability of large language models on 14 datasets. |
Copied to clipboard
| Challenge: | Existing studies focus on sentence-level ECI with high-resource languages, leaving document-level DECI with low-resourced languages under-explored. |
| Approach: | They propose a Heterogeneous Graph Interaction Model with Multi-granularity Contrastive Transfer Learning for zero-shot cross-lingual ECI. |
| Outcome: | The proposed model outperforms the state-of-the-art model on monolingual and multilingual scenarios by 9.4% and 8.2% of average F1 score. |
Copied to clipboard
| Challenge: | Existing methods for document comprehension rely on uniform supervision, resulting in a performance degradation in the intermediate sections. |
| Approach: | They propose a framework driven by Focal Preference Optimization to detect reading order in document layouts. |
| Outcome: | The proposed framework outperforms competing baselines and surpasses large-scale general VLMs. |
Copied to clipboard
| Challenge: | Existing methods for multimodal sentiment analysis are often dynamically incomplete. |
| Approach: | They propose a new uncertainty-calibrated elastic alignment framework to address these issues by employing probabilistic imputation to capture cross-modal ambiguity and leverage the estimated uncertainty to drive elastic alignment. |
| Outcome: | The proposed framework outperforms state-of-the-art models in multiple benchmarks and consistently outperformed existing models. |
Copied to clipboard
| Challenge: | Existing question answering systems use a retriever-reader framework to answer multi-hop questions . existing models lack retrieval, selector, and reasoner capabilities . |
| Approach: | They propose a three-stage text tableQA framework which comprises of retriever, selector, and reasoner. |
| Outcome: | The proposed framework outperforms baseline methods in the few-shot setting and ranks first on the HybridQA leaderboard. |
Copied to clipboard
| Challenge: | Existing models of moral evolution must abstract away cognitive processes . et al. (2017): evolution of morality presents a puzzle: natural selection favors selfish . |
| Approach: | They propose an LLM-based agent simulation framework that manipulates cognitive factors to understand moral evolution. |
| Outcome: | The proposed model exploits cognitive realism to explore moral evolution in a hunter-gatherer society. |
Copied to clipboard
| Challenge: | Recent efforts to predict chatbot failure hatches vital apprehensions due to complexity of human conversation. |
| Approach: | They propose a model that integrates dialogue satisfaction estimation and handoff prediction in one multi-task learning framework. |
| Outcome: | The proposed model integrates dialogue satisfaction estimation and handoff prediction in one multi-task learning framework. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have high computational costs and privacy concerns due to their high computational expenses and data privacy. |
| Approach: | They propose a method that empowers SLMs to internalize symbolic knowledge and few-shot examples gradually through a progressive fine-tuning process. |
| Outcome: | The proposed approach outperforms state-of-the-art baselines by over 5% while reducing inference costs by up to 4 across a wide range of SLMs in both in-domain (ID) and out-of domain (OOD) tasks. |
Copied to clipboard
| Challenge: | Knowledge graphs (KGs) organize world knowledge as interlinked triples which describe entities and their relationships. |
| Approach: | They propose a bi-directional Directed Acyclic Graph neural network that splits the reasoning process into prediction and calibration. |
| Outcome: | The proposed model outperforms previous QE models on FB15k, FB16k-237, and NELL995 on prediction and calibration. |
Copied to clipboard
| Challenge: | Continual learning and zero-shot learning approaches have not been adopted to scale to novel-emerging types. |
| Approach: | They propose a method to recognize entities in novel types by their textual names or descriptions. |
| Outcome: | The proposed method outperforms the state-of-the-art methods on three challenging OVNER benchmarks by 9.7%, 9.5%, and 1.8% F1-score of novel types. |
Copied to clipboard
| Challenge: | DA-Code is a code generation benchmark designed to assess LLMs on agent-based data science tasks. |
| Approach: | They propose a code generation benchmark specifically designed for LLMs on agent-based data science tasks. |
| Outcome: | The benchmark performs better than existing frameworks, but lacks accuracy . it is based on real-world data, and includes examples that cover a wide range of tasks . |
Copied to clipboard
| Challenge: | Existing SEA-focused benchmarks miss Lao-specific cultural grounding and linguistic properties. |
| Approach: | They propose a multi-dimensional benchmark for assessing large language models in Lao . they use open-source and held-out subsets to evaluate languages with a hybrid pipeline . |
| Outcome: | LaoBench is the first large-scale, high-quality, and multidimensional benchmark for assessing LLM language understanding and reasoning in Lao. |
Copied to clipboard
| Challenge: | Semantic parsing (SP) maps a natural language utterance into a formal language . standard Seq2Seq models ignore underlying grammars and may give ill-formed results. |
| Approach: | They propose an end-to-end model for semantic parsing that transduces a natural language sentence to the formal semantic representation. |
| Outcome: | The proposed model outperforms the state-of-the-art models and does not need expertise like predefined grammar or sketches in the meantime. |
Copied to clipboard
| Challenge: | Existing methods for multilingual knowledge graph completion do not align with mKGC tasks because of their English-centric bias. |
| Approach: | They propose to use multilingual pretrained language models to solve queries in different languages by reasoning a tail entity. |
| Outcome: | The proposed method outperforms the previous SOTA on Hits@1 and Hits @10 by 12.32% and 16.03% on public datasets. |
Copied to clipboard
| Challenge: | Large language models perform well on tasks that have undergone fine-tuning of instructions, but performance on completely unseen tasks is often less than ideal. |
| Approach: | They propose a task-level LoRAs combination which learns the LoRA modules combination weights based on a small number of samples to form the task model. |
| Outcome: | The proposed method outperforms the typical method, LoraHub, on 16 out of 27 tasks. |
Copied to clipboard
| Challenge: | Aspect-based Sentiment Analysis (ABSA) data augmentation has attracted increasing attention in recent years due to data sparsity. |
| Approach: | They propose a framework to augment ABSA data using pseudo labels for target domain . they refine generated labeled data using a natural language inference filter . |
| Outcome: | The proposed framework outperforms 7 strong baselines on 4 kinds of ABSA tasks. |
Copied to clipboard
| Challenge: | Recent advances in deep learning have significantly impacted the legal domain. |
| Approach: | They propose a multi-agent framework for judicial decision-making that simulates the court trial process . they propose 420 Chinese judgment documents to support their framework and build a large-scale legal knowledge base . |
| Outcome: | The proposed framework outperforms existing methods in various aspects, especially in generating legal articles. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are powerful automatic evaluators for natural language generation (NLG) tasks, but their uncertainty may limit their deployment in many applications. |
| Approach: | They propose a conformal prediction framework that provides a prediction interval with coverage guarantees and a midpoint-based score as a low-bias alternative to raw model score and weighted average. |
| Outcome: | The proposed framework provides a prediction interval with coverage guarantees and a midpoint-based score as a low-bias alternative to raw model score and weighted average. |
Copied to clipboard
| Challenge: | Conventional methods for question generation neglect two crucial research issues: 1) the given predicate needs to be expressed; 2) the answer to the generated question needs to have a definitive answer. |
| Approach: | They propose a neural encoder-decoder model with multi-level copy mechanisms to generate questions . they also introduce answer-aware loss to make generated questions correspond to more definitive answers. |
| Outcome: | The proposed model achieves state-of-the-art performance while corresponding to more definitive answers. |
Copied to clipboard
| Challenge: | Existing methods to solve complex natural language processing tasks require multiple steps to verify the answers. |
| Approach: | They propose to use chain of thought prompting to solve reasoning tasks with large language models. |
| Outcome: | The proposed method can improve reasoning performance on arithmetic, commonsense, and logical reasoning datasets. |
Copied to clipboard
| Challenge: | Continual Learning (CL) for Large Language Models faces a fundamental Stability-Plasticity Dilemma . Rank-Blindness enforces a single rank constraint across diverse tasks, leading to catastrophic forgetting of earlier tasks and underfitting on complex new ones. |
| Approach: | They propose a rank-spectrum-based rehearsal-free framework that explicitly disentangles knowledge into two orthogonal subspaces. |
| Outcome: | The proposed framework achieves a superior stability-plasticity balance compared to single-rank baselines. |
Copied to clipboard
| Challenge: | Existing MKGC research ignores the shareability of cross-lingual knowledge. |
| Approach: | They propose a multilingual knowledge Graph Completion framework that leverages multilingual shared knowledge to significantly enhance performance through two components: Knowledge-level Grouped Mixture of Experts (KL-GMoE) and Iterative Entity Reranking (IER). |
| Outcome: | The proposed framework achieves improvements of 5.47%, 3.27%, and 1.01% in the Hits@1, Hits @3, and Hits_10 metrics, respectively, compared with existing state-of-the-art (SOTA) MKGC method. |
Copied to clipboard
| Challenge: | Recent advances in reinforcement learning (RL) have shown promise in improving LALMs’ reasoning abilities, but their performance in affective computing tasks remains suboptimal. |
| Approach: | They propose a framework incorporating reinforcement learning with two key innovations: Emotion Similarity-Weighted Reward (ESWR) and Explicit Structured Reasoning (ESR). |
| Outcome: | The proposed framework improves LALMs' reasoning abilities on MELD and IEMOCAP datasets and shows strong generalization. |
Copied to clipboard
| Challenge: | Existing approaches to multihop question answering (MHQA) over long contexts are often neglecting explicit reasoning or incurring expensive computational costs due to full-attention mechanisms over long contextuals. |
| Approach: | They propose a framework that integrates Monte Carlo Tree Search (MCTS) with dynamic key-value retrieval to enable iterative, context-aware reasoning. |
| Outcome: | The proposed framework integrates Monte Carlo Tree Search (MCTS) with dynamic key-value (KV) retrieval to enable iterative, context-aware reasoning. |