Papers by Zixuan Li
Copied to clipboard
| Challenge: | Existing models for TKG reasoning focus on modeling fact sequences of a fixed length, which cannot discover complex evolutional patterns that vary in length. |
| Approach: | They propose to use a length-aware Convolutional Neural Network to handle evolutional patterns of different lengths via an easy-to-difficult curriculum learning strategy. |
| Outcome: | The proposed model improves performance under both offline and online learning strategies. |
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) are used in many different areas of research. |
| Approach: | They propose to use a beam search policy to induce multiple clues from historical facts . they propose to adopt a graph convolution network based sequence method to deduce answers from clues . |
| Outcome: | The proposed model can predict future facts in two stages, Clue Searching and Temporal Reasoning. |
Copied to clipboard
| Challenge: | Existing Temporal Knowledge Graphs (TKGs) only contain their core entities and form them as quadruples. |
| Approach: | They propose to describe a temporal fact more accurately as an n-tuple . they propose to use a neural network to learn evolutional representations of entities . |
| Outcome: | The proposed model oversimplifies and causes information loss on two datasets. |
Copied to clipboard
| Challenge: | Existing methods to reason missing facts on Knowledge Graphs face with serious incompleteness due to their black-box nature. |
| Approach: | They propose a multi-hop reasoning method that injects high quality symbolic rules into the model's reasoning process and employs partially random beam search. |
| Outcome: | The proposed method outperforms existing multi-hop reasoning methods in terms of Hit@1 and MRR. |
Copied to clipboard
| Challenge: | Existing legal language models struggle with dynamic courtroom interactions, resulting in overfitting to standardized legal tasks. |
| Approach: | They propose a new adversarial evolutionary approach for agents that performs dynamic knowledge learning and evolution through structured adversarials in a simulated courtroom program. |
| Outcome: | The proposed approach outperforms existing LLM-based models in three critical dimensions: cognitive agility, professional knowledge, and logical rigor. |
Copied to clipboard
| Challenge: | LR-bench is a high-fidelity, up-to-date benchmark curated from 2024–2025 AI/NLP manuscripts with five-level self-assessed familiarity ratings collected via a large-scale email survey . |
| Approach: | They propose a reviewer-centric ranking framework that distills each reviewer’s recent publications into compact keyword-based profiles and fine-tunes an embedding model with weak preference supervision constructed from heuristic retrieval signals. |
| Outcome: | The proposed framework outperforms existing benchmarks and the CMU gold-standard dataset in the evaluation of AI/NLP manuscripts. |
Copied to clipboard
| Challenge: | Existing methods for achieving this alignment involve employing reinforcement learning from human feedback (RLHF) Existing approaches involve using RLHF to fine-tune LLMs based on human labels . however, RLRF is susceptible to instability during fine- tuning and presents challenges in implementation. |
| Approach: | They propose to use reinforcement learning from human feedback to fine-tune large language models with human preferences to achieve precise control of model behavior. |
| Outcome: | Experiments show that RAHF can be used to capture and manipulate representations to align with a broad spectrum of human preferences or values rather than being confined to a single concept or function. |
Copied to clipboard
| Challenge: | Recent industrial credit scoring models rely heavily on manually tuned statistical learning methods due to the complexity of heterogeneous financial data and the challenge of modeling evolving creditworthiness. |
| Approach: | They propose a framework that reformulates credit scoring as a multi-scale sequential learning problem. |
| Outcome: | FinLangNet improves KS and bad debt rate by 6.3 pp in real world deployments. |
Copied to clipboard
| Challenge: | Existing vector quantization methods incur inference overhead due to massive codebook storage and intensive index lookups. |
| Approach: | They propose a framework for vector quantization that incorporates a salience-aware weighted K-means clustering scheme with symmetry constraints to reduce codebook size and indexing costs. |
| Outcome: | The proposed framework achieves a perplexity of 5.78 on WikiText-2 for LLaMA-2-7B at 2-bit quantization while delivering a 1.4 speedup over existing baselines. |
Copied to clipboard
| Challenge: | Existing research has focused on post-training knowledge editing (KE) for language models to ensure that knowledge remains accurate and up-to-date. |
| Approach: | They propose to use a GradSim indicator to detect when and why updated knowledge ripples in language models. |
| Outcome: | The proposed indicator GradSim shows that LMs that fail to handle ripple effects have low GradSIM. |
Copied to clipboard
| Challenge: | Prompt tuning has been proven to be successful on various tasks by incorporating a small number of trainable parameters while freezing large pre-trained language models. |
| Approach: | They propose a token-wise prompt tuning method that uses a bank of finer-grained soft prompt tokens to generate an instance-dependent prompt. |
| Outcome: | The proposed method performs far better than full parameter fine-tuned models and achieves state-of-the-art by tuning only 0.035% parameters on 14 datasets. |
Copied to clipboard
| Challenge: | Instruction-tuned language models (LMs) are increasingly deployed as interactive services across various applications. |
| Approach: | They propose a benchmark to evaluate models' ability to follow the instruction hierarchy by comparing their models to a set of benchmarks. |
| Outcome: | The proposed benchmark covers 3,538 examples across nine tasks covering cases where instructions in different priorities either align or conflict. |
Copied to clipboard
| Challenge: | Existing parameter-efficient fine-tuning methods require training a separate adapter for each user, making them computationally expensive and impractical for real-time updates. |
| Approach: | They propose a scalable framework that maps a user's profile directly to a full set of adapter parameters. |
| Outcome: | The proposed framework outperforms prompt-based personalization and OPPU while using substantially fewer computational resources at deployment. |
Copied to clipboard
| Challenge: | Existing methods for inference-time steering fail to be effective, utility-preserving and training-efficient due to rigid, one-size-fits-all designs and limited adaptability. |
| Approach: | They propose a steering framework that decomposes inference-time steering into two stages . they propose 'conditional steering' mechanism that preserves model utility by avoiding unnecessary steering . a 'mixture-of-Steering-Experts' mechanism captures multimodal nature of desired steering behaviors . |
| Outcome: | The proposed framework outperforms the state-of-the-art methods on safety and truthfulness benchmarks. |
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) store facts as triples in the form of subject, relation, object, timestamps. |
| Approach: | They propose a Temporal Knowledge Graph (TKG) model that extends each triple with a timestamp to describe dynamic facts. |
| Outcome: | The proposed model improves on six benchmark datasets with up to 5.6% performance improvement compared to the state-of-the-art models. |
Copied to clipboard
| Challenge: | Existing knowledge editing approaches only operate on (subject, relation, object) triple . current methods are limited to (substance, relation) triple, causing low confidence in their answers. |
| Approach: | They propose a task of event-based knowledge editing that pairs facts with event descriptions to improve model confidence. |
| Outcome: | The proposed method improves model confidence by 55.6% while maintaining the naturalness of generation. |
Copied to clipboard
| Challenge: | Existing methods for Continual Learning (CL) have limited KT and catastrophic forgetting . a new method overcomes CF by isolating the knowledge of each task . |
| Approach: | They propose a method to overcome catastrophic forgetting and encourage knowledge transfer . they propose to discover a sub-network for each task and a soft-masking mechanism to preserve the previous knowledge. |
| Outcome: | The proposed method outperforms baselines in classification, generation, information extraction and their mixture. |
Copied to clipboard
| Challenge: | Existing robust benchmark datasets generate only a limited range of perturbations for a single Information Extraction (UIE) task, which fails to evaluate the robustness of UIE models effectively. |
| Approach: | They propose a new benchmark dataset that utilizes Large Language Models to generate more diverse and realistic perturbations across different IE tasks. |
| Outcome: | The proposed model performs better with only 15% of the data and is more robust with other models. |
Copied to clipboard
| Challenge: | None. None.. None! |
| Approach: | None. None.. None! |
| Outcome: | None. None. No. : |
Copied to clipboard
| Challenge: | Existing methods for event prediction are incomplete and noisy. |
| Approach: | They propose to use news-related event schemas to extract newsworthy events . they build a demo website and include a video demonstrating the framework . |
| Outcome: | The proposed framework can be applied to a wide variety of newsworthy scenarios. |
Copied to clipboard
| Challenge: | Conventional knowledge Graph Reasoning models learn the embeddings of KG components over the structure of a KG. |
| Approach: | They propose a pipeline to integrate knowledge from LLMs into KGs without fine-tuning . they propose knowledge alignment, KG reasoning and entity reranking to enhance conventional models . |
| Outcome: | The proposed pipeline can enhance the performance of conventional KGR models in incomplete and general situations. |
Copied to clipboard
| Challenge: | Empirical evidence indicates that Large Language Models exhibit spontaneous cross-lingual alignment in Information Extraction (IE) however, a significant imbalance across languages persists, highlighting an underlying deficiency. |
| Approach: | They propose a code LLM with advanced cross-lingual and multilingual capabilities for universal IE that standardizes the representation of multilingual schemas using Python classes and conducts IE alignment instruction tuning on translated instance prediction task. |
| Outcome: | The proposed model surpasses ChatGPT and SoTA by 30.17% without training in 29 unseen languages and significantly improves cross-lingual IE transferability. |
Copied to clipboard
| Challenge: | Existing models cannot abstain from uncertain predictions, which will bring risks in real-world applications. |
| Approach: | They propose to abstain from uncertain future facts by using a confidence estimator . they take both the certainty of the current prediction and the accuracy of historical predictions into account . |
| Outcome: | The proposed abstention mechanism helps existing models make selective predictions instead of indiscriminate ones. |
Copied to clipboard
| Challenge: | Existing retrieval-based methods compromise semantic integrity through fixed-size chunking and suffer from inefficient linear scanning. |
| Approach: | They propose a method that preserves local semantic coherence through boundary-aware chunking and constructs a recursive hierarchical index rooted in the triangle inequality. |
| Outcome: | The proposed method achieves 3.6 end-to-end inference speedup with negligible degradation in model performance. |
Copied to clipboard
| Challenge: | Existing approaches to longterm memory rely on rigid retrieval granularity, accumulation-heavy maintenance strategies, and coarse-grained update mechanisms. |
| Approach: | They propose a framework that leverages coordinated agents to manage memory across multiple granularities. |
| Outcome: | The proposed framework outperforms state-of-the-art benchmarks while reducing token consumption by approximately 80%. |
Copied to clipboard
| Challenge: | Despite the development of many subdirections, Cross-Document Cross-Lingual NLI remains largely unexplored. |
| Approach: | They propose a novel paradigm that extends traditional NLI capabilities to multi-document, multilingual scenarios by integrating RST-enhanced graph fusion with interpretability-aware prediction. |
| Outcome: | The proposed method improves on existing models and document-level NLI to multi-document, multilingual scenarios. |
Copied to clipboard
| Challenge: | Existing context condensing methods cannot accurately understand the full context, as there is a considerable amount of information loss in the condensed process. |
| Approach: | They propose a framework to extend the fixed context length of any decoder-only LLM by distilling crucial information from long sequences. |
| Outcome: | The proposed framework extends the fixed context length of any decoder-only LLM, allowing it to focus on relevant information from very long sequences. |
Copied to clipboard
| Challenge: | a new system extracts supporting and refuting claims from COVID-19 related news . the system is publicly available at GitHub and DockerHub, with complete documentation. |
| Approach: | They propose a COVID-19 Claim Radar system that extracts supporting and refuting claims . the system leverages Wikidata as the hub to consolidate coreferential knowledge elements . |
| Outcome: | The system extracts supporting and refuting claims from COVID-19 pandemic information . it leverages Wikidata as the hub to merge coreferential knowledge elements . |
Copied to clipboard
| Challenge: | Nested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively. |
| Approach: | They propose a new model that extracts nested events mainly based on recognizing PEs. |
| Outcome: | The proposed model can extract nested events based on recognizing PEs . it incorporates information from both event types and argument roles to improve performance . |
Copied to clipboard
| Challenge: | Existing IE tools for atomic events are limited when applied to such complex events. |
| Approach: | They propose to use event schemas to guide the organization of complex events and to edit hierarchical graphs. |
| Outcome: | The proposed tool outperforms existing IE visualization tools in both IE result analysis and general model improvements. |
Copied to clipboard
| Challenge: | Existing methods for Event Causality Identification (ECI) capture implicit associations between events, which are difficult because they lack the ability to understand the associations between two events. |
| Approach: | They propose a model that captures the implicit associations between two events and integrates the event-centric structure information into a GNN-based event aggregator. |
| Outcome: | The proposed model improves on three widely used datasets showing that it integrates event-centric and event-associated semantic elements and captures event associations. |
Copied to clipboard
| Challenge: | Event Extraction (EE) is a long-standing target, but lacks an efficient and effective annotation framework to construct the corresponding datasets. |
| Approach: | They propose an LLM-based collaborative annotation framework that refines annotations of triggers from distant supervision and carries out argument annotation. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on the largest EE dataset to date . it achieves the F1 scores of 90% and 85.3% on the human-annotated test set . |
Copied to clipboard
| Challenge: | Existing frameworks for fine-grained few-shot entity extraction are difficult to implement in the chemical domain due to the information overload of scientific papers. |
| Approach: | They propose a sequence-to-sequence based few-shot entity extraction approach . it uses a seq2seq entity extractor and a self-validation module to reconstruct original input sentence . |
| Outcome: | The proposed framework achieves 8.26% and 6.84% performance gains on two datasets. |
Copied to clipboard
| Challenge: | *visual text representations* are a practical and surprisingly effective form of input compression for decoder LLMs. |
| Approach: | They exploit visual representations to render long text inputs as a single image and provide it directly to the model. |
| Outcome: | The proposed method reduces token usage while preserving performance. |
Copied to clipboard
| Challenge: | Textual frequency is a topic of understudied research, but its relevance to Large Language Models is not well understood. |
| Approach: | They propose a framework to estimate textual data frequency using a paraphraser and a textual distillation method to refine LLMs. |
| Outcome: | The proposed framework can be used to estimate sentence-level frequency with word-level frequencies. |
Copied to clipboard
| Challenge: | Recent studies have introduced Large Language Models (LLMs) for this task to enhance the models’ generalization abilities. |
| Approach: | They propose a General-to-Specific learning framework that disentangles the learning processes of two kinds of knowledge in a temporal temporal structure. |
| Outcome: | The proposed framework disentangles the learning processes of the above two kinds of knowledge and improves their generalization abilities. |
Copied to clipboard
| Challenge: | Existing approaches to Knowledge Graph Question Answering (KGQA) use Retrieval-Augmented Generation (RAG) but subgraph selection process is non-differentiable, preventing end-to-end training of the retriever and the generator. |
| Approach: | They propose a Differentiable RAG approach that optimizes the retriever and the generator for KGQA. |
| Outcome: | The proposed approach outperforms state-of-the-art approaches on WebQSP and CWQ. |
Copied to clipboard
| Challenge: | Existing methods focus on point-wise memory, losing durative information that captures persistent states and evolving patterns. |
| Approach: | They propose a memory framework that models semantic time for point-wise memory and supports the construction and utilization of durative memory. |
| Outcome: | Experiments on LongMemEval and LoCoMo show that the proposed method outperforms existing methods and achieves up to 12.2% improvement in accuracy. |
Copied to clipboard
| Challenge: | Existing studies only consider a single event sequence corresponding to one common protagonist. |
| Approach: | They propose a Transformer-based model which integrates deep event-level and script-level information for script event prediction. |
| Outcome: | The proposed model is superior to existing models on the New York Times corpus . it utilizes rich information in the text to obtain more comprehensive representations . |
Copied to clipboard
| Challenge: | Entity Alignment (EA) is a crucial step in unifying data from heterogeneous sources and plays a critical role in data-driven AI applications. |
| Approach: | They propose a framework that incorporates large language models to improve EA. |
| Outcome: | The proposed framework incorporates large language models (LLMs) to improve EA accuracy while preserving efficiency. |
Copied to clipboard
| Challenge: | Existing datasets focus on relation extraction between two entities in one sentence, and some focus on cross-sentence relationships. |
| Approach: | They propose to use a Chinese multi-party dialogue dataset for automatic extraction of dialogue-based character relationships. |
| Outcome: | The proposed dataset extracts relationships between 140 entities on the CRECIL corpus and another existing relation extraction corpus. |
Copied to clipboard
| Challenge: | Existing methods for ERE rely on large language models, but they face limitations. |
| Approach: | They propose an LLM-based approach with rationales for the ERE task . LLMERE transforms ERE into a question-and-answer task that may have multiple answers . |
| Outcome: | Experimental results show that LLMERE improves over existing methods. |
Copied to clipboard
| Challenge: | Parameter Efficient Fine-Tuning (PEFT) has gained significant attention for its ability to achieve competitive results while updating only a small subset of trainable parameters. |
| Approach: | They propose a new approach to fine-tuning neural models that scales and biases the representation produced at each layer. |
| Outcome: | The proposed approach reduces the number of trainable parameters by a factor of 25,700 compared to full parameter fine-tuning and by . 32 compared with LoRA. |
Copied to clipboard
| Challenge: | Existing methods implicitly model time constraints by learning time-aware embeddings of questions and candidate answers, which is far from understanding the question comprehensively. |
| Approach: | They propose a temporal-based temporal programming method that leverages the in-context learning ability of Large Language Models to understand combinatory time constraints in questions. |
| Outcome: | The proposed method outperforms existing methods on multiTQ and CronQuestions datasets and is highly efficient on multi-level questions. |
Copied to clipboard
| Challenge: | Current evaluation methods for large language models rely on static benchmarks . limited knowledge coverage and fixed difficulties hinder the targeted optimizations resulting in superficial evaluations of LLMs - a problem that has been addressed by JudgeAgent . |
| Approach: | They propose a knowledge-driven and dynamic evaluation framework for large language models . judgeAgent leverages LLM agents equipped with context graphs to traverse knowledge structures . |
| Outcome: | The proposed framework can achieve comprehensive evaluations and facilitate effective model iterations. |
Copied to clipboard
| Challenge: | Existing large language models only support hundreds of languages, and they are usually limited in English. |
| Approach: | They propose a task to automatically select which dictionary to use to enhance translation . they call it Select Low-frequency Words!, which inherits advantage of dictionary-based methods . |
| Outcome: | The proposed method can save tokens and improve translation performance on 100 languages. |
Copied to clipboard
| Challenge: | Existing preference-based methods for medical large vision-Language Models face limitations in medical settings . existing methods are limited by overfitting to superficial cues and pseudo convergence of the preference signal. |
| Approach: | They propose a framework that enables evidence-aware and adaptive preference learning for Med-LVLMs. |
| Outcome: | The proposed framework improves evidence-aware and adaptive preference learning for Med-LVLMs. |
Copied to clipboard
| Challenge: | Existing studies on retrievers and LLMs treat them as separate components . a novel bridge model is proposed to optimize the relationship between the retriever and the LLM . |
| Approach: | They propose a framework that chains together supervised and reinforcement learning to train a bridge model that optimizes the connection between the retriever and the LLM. |
| Outcome: | Empirical results show that the proposed model optimizes the connection between the retriever and the LLM. |
Copied to clipboard
| Challenge: | Existing federated learning frameworks require substantial data and computational resources to develop large language models. |
| Approach: | They propose a method that distributes a quantized version of the model’s parameters during training and combine it with a popular fine-tuning method to significantly reduce communication costs. |
| Outcome: | The proposed method enables accurate estimations for parameter updates while preventing clients from accessing a model whose performance is comparable to the centrally hosted one. |