Papers by Yu Kang
Copied to clipboard
| Challenge: | Comparative Opinion Quintuple Extraction (COQE) aims to predict comparative opinion quintuples from comparative sentences. |
| Approach: | They propose a low-resource approach to extract comparative opinion quintuples from comparative sentences . they propose augmentation using ChatGPT and a data-centric approach . |
| Outcome: | The proposed approach improves the existing pipeline-based method and achieves state-of-the-art results. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown nearly saturated performance on many NLP tasks. |
| Approach: | They construct multiple sensitive factors time QA which encompasses three temporal factors . they test current mainstream LLMs with different parameter sizes . |
| Outcome: | The proposed model incorporates three temporal factors with 2,853 samples . the results show that LLMs fall behind smaller models on these factors . |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a fundamental task in Natural Language Processing (NLP) that aims to detect the entity spans of text and classify them into pre-defined set of entity types. |
| Approach: | They propose a boundary-aware contrastive learning strategy to enhance the LLM’s ability to perceive entity boundaries for generalized entity spans. |
| Outcome: | The proposed framework outperforms prior methods and validates its effectiveness across a range of LLM architectures. |
Copied to clipboard
| Challenge: | Continual learning (CL) for large language models (LLMs) aims to enable sequential knowledge acquisition without catastrophic forgetting. |
| Approach: | They propose a framework that aligns replay schedules with a model-centric notion of time. |
| Outcome: | Experiments on three benchmarks show that FOREVER consistently mitigates catastrophic forgetting. |
Copied to clipboard
| Challenge: | TexSmart supports fine-grained named entity recognition (NER) Large-scale fine-granular entity types are expected to provide richer semantic information for downstream NLP applications. |
| Approach: | They introduce TexSmart, a text understanding system that supports fine-grained named entity recognition (NER) and enhanced semantic analysis functionalities. |
| Outcome: | The proposed system supports fine-grained named entity recognition (NER) and enhanced semantic analysis functions. |
Copied to clipboard
| Challenge: | Existing code translation benchmarks focus on individual functions, overlooking repository-level challenges like intermodule coherence and dependency management. |
| Approach: | They propose a framework for benchmarking Java-to-C# translation at the repository level . it uses a translation framework guided by skeletons and fine-grained quality evaluation . |
| Outcome: | The proposed framework improves Java-to-C# translation quality at the repository level. |
Copied to clipboard
| Challenge: | Existing interpretation methods only support tasks with specific inputs, limiting their practical applications. |
| Approach: | They propose an extensible module that matches different input data with interpretation methods and consolidates the interpreting outputs. |
| Outcome: | The proposed module can match different input data with interpretation methods and consolidate the interpreting outputs. |
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: | Existing defense methods rely on fine-tuning or inefficient post-hoc interventions, limiting their ability to address novel attacks. |
| Approach: | They propose a decoding-level defense mechanism that employs a lightweight discriminator to iteratively steer the decoding process toward safety. |
| Outcome: | The proposed method improves safety performance by up to 33.40% without fine-tuning on multiple MLLMs. |
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 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 datasets for conversational recommender systems lack specific user preferences and explanations for recommendations . current datasets lack specific preferences, hindering high-quality recommendations despite advances in large language models . |
| Approach: | They propose to synthesize a conversational recommendation dataset with persona- and knowledge-augmented LLM simulators to address these challenges. |
| Outcome: | The proposed dataset outperforms baselines in human and automatic evaluations. |
Copied to clipboard
| Challenge: | Existing studies on recommendation dialog systems lack a study on communication strategies used by human speakers for making successful and persuasive recommendations. |
| Approach: | They propose to annotate a dataset of human-human movie recommendation dialogs with sociable recommendation strategies. |
| Outcome: | The proposed model outperforms the baseline model in automatic and human evaluation. |
Copied to clipboard
| Challenge: | Autoregressive modeling is a common method for processing language sequences and is effective in token prediction. |
| Approach: | They propose a text-to-speech model based on continuous speech tokens and a continuous tokenizer for speech compression. |
| Outcome: | The proposed model has better continuity and higher estimated Mean Opinion Scores (MoS) this is attributed to better information preservation rate across low and high frequencies in the frequency domain. |
Copied to clipboard
| Challenge: | Existing training data is sparse, with each document associated with one or a few labeled queries. |
| Approach: | They propose a training-free potential query retrieval framework to address this problem . they use a Gaussian mixture distribution to model all potential queries for a document . |
| Outcome: | The proposed method is able to capture comprehensive semantic information from a document with multiple queries. |
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 approaches to design LLM-based Multi-agent systems are constrained by homogeneous LLMs. |
| Approach: | They propose an automated design of heterogeneous-LLMs-based MAS with a binary-star transformer and an autoregressive graph generation pipeline. |
| Outcome: | The proposed pipeline is high-performing on various benchmarks and extensible to unseen LLMs and roles. |
Copied to clipboard
| Challenge: | Existing methods for large language model reasoning suffer from exploration collapse due to the semantic homogeneity of random rollouts. |
| Approach: | They propose to use latent policy optimization via iterative information bottleneck to optimize reasoning trajectories by diversifying reasoning . |
| Outcome: | Empirical results show that the proposed method achieves state-of-the-art performance with margins of up to 5.3% in accuracy and 7.4% in diversity metrics. |
Copied to clipboard
| Challenge: | Existing active learning models for text spam detection tasks are based on pool-based active learning, but the annotating process is laborious and time consuming for humans. |
| Approach: | They propose a semi-supervised active learning model to address spam imbalances . they propose masked attention learning approach and character variation graph-enhanced augmentation procedure . |
| Outcome: | The proposed model can improve the performance of existing models for Chinese spam detection task. |
Copied to clipboard
| Challenge: | Existing knowledge graphs suffer from incompleteness and miss important facts, jeopardizing their usefulness in downstream tasks such as question answering. |
| Approach: | They propose a method which is trained by utilizing local typing knowledge from existing entity type assertions and global triple knowledge in KGs. |
| Outcome: | The proposed model favors inferences that agree with both entity type instances and triple knowledge in KGs. |
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 approaches to retrieval augmented generation neglect PDF structure and layout . individual PDFs often exceed prompt limits and user queries may span multiple documents. |
| Approach: | They propose a hybrid neural symbolic retrieval framework which combines both paradigms in an interactive process. |
| Outcome: | The proposed framework organizes semi-structured PDF content into relational database and vectorstore . it defeats both RAG and structured baselines on three PDF-based QA datasets . |
Copied to clipboard
| Challenge: | State-of-the-art vision-language models require massive scaling that limits practical deployment. |
| Approach: | They propose to use supervised fine-tuning to train small-scale vision-language models but face out-of-domain collapse when trained with traditional supervised learning (SFT). |
| Outcome: | Experiments show that curr-reFT achieves state-of-the-art performance across visual tasks in both in- and out-of domain settings and benchmarks. |
Copied to clipboard
| Challenge: | Academic paper search often struggles to match underlying academic concepts between queries and documents. |
| Approach: | They propose a framework that extracts key concepts from papers and organizes them as a semantic index guided by an academic taxonomy. |
| Outcome: | The proposed framework can be flexibly employed to enhance existing retrieval frameworks. |
Copied to clipboard
| Challenge: | Existing work reveals only randomly permuted activations to the client, allowing adversaries to extract model weights. |
| Approach: | They propose an attack that aligns differently shuffled activations to a common permutation and exploits them to extract model weights. |
| Outcome: | The proposed attack can align shuffled activations to a common permutation and exploit them to extract model weights with a query cost of approximately $1. |
Copied to clipboard
| Challenge: | Large Language Models fail to recognize fallacious reasoning in real-world interactions despite strong performance on static fallacy detection tasks. |
| Approach: | They propose a Chinese benchmark to assess fallacy awareness without explicit cues . they propose 'fate' evaluation framework that assesses fallacy without explicit . |
| Outcome: | The proposed framework assesses fallacy awareness without explicit cues, combining natural dialogue responses and reasoning-based decisions. |
Copied to clipboard
| Challenge: | Existing methods for retrieval-augmented generation fail to provide explicit supervision for internal reasoning process. |
| Approach: | They propose an Evaluation-driven Retrieval-Augmented Reasoning framework that uses reinforcement learning and a fine-grained evaluation reward to optimize the process. |
| Outcome: | Eval-RAR outperforms existing methods on QA benchmarks on seven single-hop and multi-hop tasks. |
Copied to clipboard
| Challenge: | Existing models that use large language models are not available due to ethical concerns, and data privacy concerns are a concern. |
| Approach: | They propose a multi-turn dialogue dataset that emulates real-life counseling interactions using the goal-oriented approach of Cognitive Behavioral Therapy (CBT). |
| Outcome: | The proposed model outperforms other models in counseling skills, highlighting its effectiveness and potential as a counseling agent. |
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: | 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: | 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: | Knowledge graph question answering (KGQA) aims to provide factual answers to natural language questions by leveraging structured information stored in a knowledge graph. |
| Approach: | They propose a Question-guided Knowledge Graph Re-scoring method to eliminate noisy pathways for the input question, thereby focusing specifically on pertinent factual knowledge. |
| Outcome: | The proposed method eliminates noisy pathways for the input question, thereby focusing specifically on pertinent factual knowledge. |
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: | Existing methods to mitigate hallucinations in siMT generate fluency but unfaithful translation. |
| Approach: | They propose a method that utilizes the OMT model to mitigate hallucinations in SiMT. |
| Outcome: | The proposed method reduces hallucinations and improves the SiMT performance. |
Copied to clipboard
| Challenge: | Existing methods for simultaneous machine translation fail to optimize the policy . existing methods require building a decision path to learn the policy, but they cannot explore all potential paths . |
| Approach: | They propose a new training paradigm that uses a read/write policy to optimize the policy . existing methods usually require building a decision path to learn a suitable policy a user makes . |
| Outcome: | The proposed model outperforms strong baselines and allows offline models to acquire SiMT ability with fine-tuning. |
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: | Mainstream VLPs have significant security implications, but their security implications have not been thoroughly examined. |
| Approach: | a study evaluates the security of visual language projectors by comparing them to uncompressed projector. |
| Outcome: | The evaluation reveals significant differences in security profiles between compressed and uncompressed projectors. |
Copied to clipboard
| Challenge: | a human-like chatbot requires commonsense reasoning to comprehend and respond to information . however, identifying and aggregating key evidence within a single hop is a challenge . a knowledge distillation framework is proposed that leverages LLMs as unreliable teachers . |
| Approach: | They propose a framework that leverages large language models as unreliable teachers to facilitate multi-hop reasoning over a dialogue context. |
| Outcome: | The proposed framework leverages LLMs as unreliable teachers and selectively distills consistent and helpful rationales via alignment filters. |
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: | Knowledge Tracing (KT) models a learner's evolving knowledge state over time, but lacks the rich information embedded in students' problem-solving processes. |
| Approach: | They propose a framework that uses a teacher-student-teacher pipeline to extract students’ Mathematical Proficiency (MP) as intermediate representation. |
| Outcome: | The proposed framework improves the prediction performance of existing KT methods and provides interpretable explanations by explicitly modeling students’ mathematical proficiency. |
Copied to clipboard
| Challenge: | generating high-quality charts with Large Language Models presents significant challenges due to limited data and the high cost of curation. |
| Approach: | They propose a referencefree automatic feedback generator to generate high-quality charts with Large Language Models. |
| Outcome: | The proposed framework outperforms baselines and shows that it significantly improves data diversity. |
Copied to clipboard
| Challenge: | Comparative Opinion Quintuple Extraction (COQE) aims to extract all comparative sentiment quintuples from product review text. |
| Approach: | They propose a model-unaware adaptive chain-of-feedback method to extract quintuples from product review text. |
| Outcome: | The proposed method improves performance on three benchmarks. |
Copied to clipboard
| Challenge: | Prior methods to retrieve demonstrations based on embedding similarity or generation probability, resulting in irrelevant or redundant examples. |
| Approach: | They propose a topic coverage-based retrieval framework that selects demonstrations to comprehensively cover topic-level knowledge relevant to both the test input and the model. |
| Outcome: | The proposed framework covers all the necessary knowledge for the test input and the model. |
Copied to clipboard
| Challenge: | TKGF is a technique that requires experience during testing and relying on a single short-term history. |
| Approach: | They propose a framework that integrates dynamic causal rule mining and dual history augmented generation to enhance event prediction. |
| Outcome: | The proposed framework shows significant performance improvements across diverse datasets and significantly improves Hit@k. |
Copied to clipboard
| Challenge: | Autoregressive decoding requires a full forward pass for each generated token, increasing inference latency. |
| Approach: | They propose a lossless self-speculative decoding method that embeds a compressed model within selected decoder layers of the original model. |
| Outcome: | The proposed method achieves substantial speed-ups (up to 2.47) over standard autoregressive decoding. |
Copied to clipboard
| Challenge: | Existing research on PTQ spans three primary directions. |
| Approach: | They conduct a systematic analysis of post-training quantization failures using PTQ . they show that targeted repair can mitigate Signal Degradation but remains ineffective for Computation Collapse . |
| Outcome: | The proposed method mitigates Signal Degradation but remains ineffective for Computation Collapse. |
Copied to clipboard
| Challenge: | Existing scaling laws focus on general performance, overlooking crucial fine-grained factors and how quantization differentially impacts diverse knowledge capabilities. |
| Approach: | They propose a framework that unifies model size, bit-width, and fine-grained factors into memorization, application, and reasoning. |
| Outcome: | The proposed framework shows strong fit and cross-architecture consistency on 293 different PTQ configurations. |
Copied to clipboard
| Challenge: | Currently, large vision-language models are limited in their ability to provide correct answers for multimodal tasks . however, they can still provide correct responses for multiple images associated with a single image . a query-agnostic visual attack (QAVA) provides robust adversarial examples that generate incorrect responses to unspecified and unknown questions. |
| Approach: | They propose a query-agnostic visual attack to create adversarial examples that generate incorrect answers to unspecified and unknown questions. |
| Outcome: | The proposed model improves performance on images when the question is unknown compared to known target questions . |
Copied to clipboard
| Challenge: | Experimental results show that large language models exhibit a negative bias in binary decision tasks . hallucination is a factor that degrades reliability of LLMs . |
| Approach: | They propose a negative attention score to systematically and quantitatively formulate negative bias by using a parameter-efficient fine-tuning technique. |
| Outcome: | The proposed method reduces the gap between precision and recall caused by negative bias while preserving generalization abilities. |
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: | Recent advances in large language models have influenced the development of video large multimodal models (VLMMs). |
| Approach: | They propose a method that integrates video descriptions as context into a multimodal AI system to enrich the understanding of video content. |
| Outcome: | Empirical evaluations show that the proposed approach outperforms existing approaches for video large multimodal models (VLMMs) |
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: | LVLMs have been shown to perform well on simple uni-modal benchmarks, but their detailed study on multi-modal models is still lacking. |
| Approach: | They propose a framework to analyze the impact of compression on LVLMs on multi-modal input driven tasks. |
| Outcome: | The proposed framework analyzes the impact of compression on generative performance of large vision language models on multi-modal input driven tasks. |
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: | Existing methods to fact tracing rely on assessing the similarity between training samples and the query along a certain dimension, such as lexical similarity, gradient, or embedding space. |
| Approach: | They propose a new approach that harnesses the capabilities of Large Language Models to validate supportive evidence for queries and clusters the training database towards a reduced extent for LLMs to trace facts. |
| Outcome: | The proposed approach outperforms existing methods in accuracy and efficiency while being x33 faster than TracIn. |
Copied to clipboard
| Challenge: | Existing audio-language task-specific predictive approaches focus on building complicated late-fusion mechanisms. |
| Approach: | They propose a cross-modal transformer for audio-and-language that learns inter-modal connections between audio and language through two proxy tasks on a large amount of audio- and-language pairs. |
| Outcome: | The proposed model improves on multiple audio-and-language tasks and can be used in fine-tuning phase. |