Papers by Jianxin Li
Few-Shot Multimodal Named Entity Recognition Based on Mutlimodal Causal Intervention Graph (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for multimodal named entity recognition are limited due to limited resources. |
| Approach: | They propose a Few-shot Multimodal Named Entity Recognition task to address these relation types by constructing a multimodal graph and a new multimodal causal intervention strategy. |
| Outcome: | The proposed model improves on two multimodal named entity recognition datasets. |
IW-Bench: Evaluating Large Multimodal Models for Converting Image-to-Web (2025.findings-acl)
Copied to clipboard
Hongcheng Guo, Wei Zhang, Junhao Chen, Yaonan Gu, Jian Yang, Junjia Du, Shaosheng Cao, Binyuan Hui, Tianyu Liu, Jianxin Ma, Chang Zhou, Zhoujun Li
| Challenge: | Existing models have been introduced to improve image comprehension, but there is no robust benchmark for imagetoweb conversion. |
| Approach: | They propose a benchmark to assess imagetoweb conversion proficiency of large multimodal models . they propose to measure layout information of web pages by parsing the Document Object Model tree . |
| Outcome: | The proposed benchmark measures the layout information of web pages—i.e., the positional relationships between elements—which has been overlooked by prior work. |
ClusterAttn: KV Cache Compression under Intrinsic Attention Clustering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for sparse attention apply the same pattern across different attention heads and inputs, but fail to capture the intrinsic attention clustering in large language models. |
| Approach: | They propose a training-free sparse attention method that provides an efficient prompt cache compression scheme under intrinsic attention clustering for efficient LLM inference. |
| Outcome: | The proposed method reduces memory usage by 10%–65% and increases throughput by 2.6–4.8 times with no accuracy loss. |
Modeling Aspect Correlation for Aspect-based Sentiment Analysis via Recurrent Inverse Learning Guidance (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to learn complex sentence with multiple aspects do not consider correlation between aspects to distinguish overlapped feature. |
| Approach: | They propose a method that uses aspect correlation to improve aspect correlation modeling . they use Recurrent Mechanism to improve the joint representation of aspects . |
| Outcome: | The proposed method is state-of-the-art in multiaspect scenarios. |
Multi-Modal Knowledge Graph Transformer Framework for Multi-Modal Entity Alignment (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Multi-modal entity alignment (MMEA) is a critical task that aims to identify equivalent entity pairs across multi-modal knowledge graphs (MMKGs). |
| Approach: | They propose a novel MMEA transformer that hierarchically introduces neighbor features, multi-modal attributes, and entity types to enhance alignment task. |
| Outcome: | The proposed transformer hierarchically introduces neighbor features, multi-modal attributes, and entity types to enhance the alignment task. |
LATENTLOGIC: Learning Logic Rules in Latent Space over Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for learning logic rules for knowledge graph reasoning face limitations such as searching in vast search space and inefficient optimization. |
| Approach: | They propose a framework to efficiently mine logic rules by controllable generation in the latent space by a pre-trained VAE and a discriminator. |
| Outcome: | The proposed framework efficiently mines logic rules by controllable generation in the latent space. |
Beyond Task-Level Context: Class-Conditional Context Vectors for Implicit In-Context Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches aggregate demonstrations from all classes into a shared, task-level context vector, capturing global task information but without explicitly preserving fine-grained, class-conditional semantic distinctions. |
| Approach: | They propose a class-conditional context vector extension to implicit in-context learning that explicitly models class-specific contextual information by constructing separate context vectors for each class. |
| Outcome: | The proposed extension outperforms task-level context vector baselines and achieves higher average accuracy than conventional few-shot learning on most models. |
Dual-Gated Fusion with Prefix-Tuning for Multi-Modal Relation Extraction (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for multi-modal relation extraction lack useful visual information. |
| Approach: | They propose a novel multi-modal relation extraction framework to capture deeper correlations of text, entity pair, and image/objects. |
| Outcome: | The proposed framework captures the deeper correlations of text, entity pair, and image/objects, and extracts useful information. |
Bipartite Graph Pre-training for Unsupervised Extractive Summarization with Graph Convolutional Auto-Encoders (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to rank sentences using pre-trained embeddings create a gap due to different optimization objectives. |
| Approach: | They propose a pre-trained embedding process that optimizes informative sentences . they use sentence-word bipartite graphs to model intra-sentential distinctive features . |
| Outcome: | The proposed model outperforms heavy BERT- or RoBERTa-based sentence ranking methods by providing summary-worthy representations. |
Noise-injected Consistency Training and Entropy-constrained Pseudo Labeling for Semi-supervised Extractive Summarization (2022.coling-1)
Copied to clipboard
| Challenge: | Existing studies on semi-supervised learning methods focus on how to effectively utilize abundant unlabeled data. |
| Approach: | They propose a semi-supervised consistency training method to regularize model predictions and a pseudo-labeling strategy to obtain high-confidence labels from unlabeled predictions. |
| Outcome: | The proposed method improves extractive summarization over an insufficient labeled dataset. |
Enhancing Transformers for Generalizable First-Order Logical Entailment (2025.acl-long)
Copied to clipboard
Tianshi Zheng, Jiazheng Wang, Zihao Wang, Jiaxin Bai, Hang Yin, Zheye Deng, Yangqiu Song, Jianxin Li
| Challenge: | Moreover, transformers have demonstrated proficiency in logical reasoning over natural language. |
| Approach: | They propose a logic-aware architecture that improves the performance in generalizable first-order logical entailment by combining distribution shifts and unseen knowledge. |
| Outcome: | The proposed architecture outperforms methods designed specifically for knowledge graph query answering on a dataset with a large dataset. |
Towards Objective Fine-tuning: How LLMs’ Prior Knowledge Causes Potential Poor Calibration? (2025.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have enabled powerful domain-specific applications through supervised fine-tuning. |
| Approach: | They propose a cognition-aware framework that applies targeted learning strategies according to the model’s prior knowledge to improve calibration. |
| Outcome: | The proposed framework significantly improves calibration while maintaining performance, achieving an average 57% reduction in ECE compared to standard fine-tuning in Llama3-8B. |
ALW: Adaptive Layer-Wise contrastive decoding enhancing reasoning ability in Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing research has demonstrated that contrast decoding of two different models can improve text quality in open-ended text generation but with limited gains on reasoning tasks. |
| Approach: | They propose a framework that dynamically disentangles noise in shallow layers from critical signals in deep layers to enhance reasoning ability. |
| Outcome: | The proposed framework improves answer accuracy while maintaining inference efficiency. |
THE-X: Privacy-Preserving Transformer Inference with Homomorphic Encryption (2022.findings-acl)
Copied to clipboard
Tianyu Chen, Hangbo Bao, Shaohan Huang, Li Dong, Binxing Jiao, Daxin Jiang, Haoyi Zhou, Jianxin Li, Furu Wei
| Challenge: | enabling pre-trained models inference on ciphertext data is difficult due to the complex computations in transformer blocks. |
| Approach: | They propose an approximation approach for transformers which enables inference on ciphertext data. |
| Outcome: | The proposed approach can infer pre-trained models on encrypted data with negligible performance drop but enjoy theory-guaranteed privacy-preserving advantage. |
HTCInfoMax: A Global Model for Hierarchical Text Classification via Information Maximization (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing models for hierarchical text classification do not consider statistical constraint on label representations learned by structure encoder. |
| Approach: | They propose a new hierarchical text classification model called HTCInfoMax which incorporates two modules to improve the model's representations. |
| Outcome: | The proposed model can model the interaction between each text sample and its ground truth labels explicitly which filters out irrelevant information. |
CDA: A Contrastive Data Augmentation Method for Alzheimer’s Disease Detection (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for detecting AD are challenging and time-consuming due to lack of data and generalizability of the models. |
| Approach: | They propose a contrastive data augmentation method which simulates the cognitive impairment of a patient by randomly deleting a proportion of text from the transcript to create negative samples. |
| Outcome: | The proposed method achieves the best performance among language-based models on the benchmark ADReSS Challenge dataset. |
Lightweight Contenders: Navigating Semi-Supervised Text Mining through Peer Collaboration and Self Transcendence (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing frameworks for semi-supervised text mining with lightweight models are limited by label data scarcity. |
| Approach: | They propose a framework for semi-supervised text mining with lightweight models . it incorporates online distillation to train lightweight student models by imitating the Teacher model . |
| Outcome: | The proposed framework exhibits notable performance enhancements over existing frameworks. |
Co-Eval: Augmenting LLM-based Evaluation with Machine Metrics (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing LLMs suffer from biases and misalignment due to limited functional understanding and knowledge gaps. |
| Approach: | They introduce a framework that leverages a criteria planner model and optimized machine metrics to enhance the scalability and fairness of LLM-based evaluation. |
| Outcome: | The proposed framework reduces biases and improves alignment with human preferences, with gains of up to 0.324 in Spearman correlation. |
Path Spuriousness-aware Reinforcement Learning for Multi-Hop Knowledge Graph Reasoning (2023.eacl-main)
Copied to clipboard
| Challenge: | Multi-hop reasoning is a common approach for query answering, but can be biased to spurious paths which coincidentally lead to the correct answer with poor explanation. |
| Approach: | They propose a method that quantitatively estimates to what extent a path is spurious by a metric called Path Spuriousness (PS) they propose KG reasoning, which infers new facts along existing paths in KGs. |
| Outcome: | The proposed model significantly improves the agent’s ability to prevent spurious paths while keeping comparable to state-of-the-art performance. |
Curriculum Learning based Hierarchical Scoring and Analysis Framework for Question Answering Task Evaluation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing evaluation methods rely on rule-based matching with shallow semantic understanding or adopt LLM-as-a-Judge approaches that incur high cost and latency while offering limited error interpretability. |
| Approach: | They propose a curriculum learning based hierarchical framework for QA task evaluation that supports quick scoring and fine-grained error analysis. |
| Outcome: | The proposed framework outperforms baseline methods on quick scoring and error analysis tasks while being 25 faster. |
Hierarchical Bi-Directional Self-Attention Networks for Paper Review Rating Recommendation (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for review rating prediction ignore hierarchies among data . paper review rating predictions are important for improving paper review process . |
| Approach: | They propose a Hierarchical bi-directional self-attention Network framework for paper review rating prediction and recommendation . they leverage hierarchical structure of paper reviews with three levels of encoders . |
| Outcome: | The proposed approach can be used to make an effective decision-making tool for the academic paper review process. |
DisCo: Distilled Student Models Co-training for Semi-supervised Text Mining (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing text mining models are fine-tuned by fine-timing a large pre-trained language model (PLM) in downstream tasks. |
| Approach: | They propose a semi-supervised learning framework for fine-tuning a cohort of small student models generated from a large pre-trained language model using knowledge distillation. |
| Outcome: | The proposed framework outperforms baseline models on semi-supervised text classification and extractive summarization tasks while maintaining comparable performance. |
Example Quality Matters: Multi-Aspects Example Augmentation for Private Library Programming (2026.acl-long)
Copied to clipboard
Yuhao Li, Haifeng Sun, Xuesong Zhang, Shu Yao, Haoyu Zheng, Yvchuan Wang, Huazheng Wang, Zirui Zhuang, Qi Qi, Jianxin Liao, Jingyu Wang
| Challenge: | Existing approaches to code generation fail to consider the quality of retrieved examples. |
| Approach: | They propose a retrieval-augmented generation method that combines existing API examples to improve complexity and readability. |
| Outcome: | The proposed method achieves up to 22% accuracy improvement over baseline methods. |
ModularMoE: Fast LLM Customization with Parameter-Sharing Mixture-of-Experts for Low-Resource Settings (2026.findings-acl)
Copied to clipboard
Jiaxing Liu, Qi Qi, Haifeng Sun, Dunjun Li, Zirui Zhuang, Bo He, Xiang Yang, Cong Liu, Jianxin Liao, Jingyu Wang
| Challenge: | Large Language Models impose significant computational and storage burdens on personal devices . existing customization approaches incur excessive computational costs or lead to suboptimal performance . |
| Approach: | They propose a training framework that converts pre-trained LLMs into parameter-sharing MoE models for lightweight deployment. |
| Outcome: | The proposed training framework outperforms state-of-the-art training frameworks at the same sparsity level while delivering up to 2.71 inference speedup. |