Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Junhao Liu 0001

dblp:98/8858-1 · DBLP profile ↗
← Back
17ranked-venue papers
6as first author
10since 2021 · last 2025
0009-0007-3694-7799ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 13 · 5 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 6 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
8 papers
Language models and text generation · 40% Trustworthy machine learning · 20% Question answering and dialogue systems · 13%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 77% Computational science and engineering · 23%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

Topics — the 21 heaviest of 23, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
code language models
0.912025
Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability
feature interpretation
0.912025
Identifying Combinatorial Regulatory Genes for Cell Fate Decision via Reparameterizable Subset Explanations · KDD (2) 2025
Computer vision › Vision and language
image captioning
0.922020
An Ensemble of Generation- and Retrieval-Based Image Captioning With Dual Generator Generative Adversarial Network · IEEE Trans. Image Process. 2020
Interactive Dual Generative Adversarial Networks for Image Captioning · AAAI 2020
Machine learning › Trustworthy machine learning
interpretability
0.912025
Identifying Combinatorial Regulatory Genes for Cell Fate Decision via Reparameterizable Subset Explanations · KDD (2) 2025
Bioinformatics and computational biology › single-cell analysis
cell fate decision
0.912025
Identifying Combinatorial Regulatory Genes for Cell Fate Decision via Reparameterizable Subset Explanations · KDD (2) 2025
Bioinformatics and computational biology
single-cell analysis
0.912025
Identifying Combinatorial Regulatory Genes for Cell Fate Decision via Reparameterizable Subset Explanations · KDD (2) 2025
Program synthesis and code generation
code completion
0.912025
Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs · AAAI 2025
Program synthesis and code generation › code completion
repository-level code completion
0.912025
Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs · AAAI 2025
Natural language and speech › Language models and text generation › instruction tuning
instruction data selection
0.812024
One-Shot Learning as Instruction Data Prospector for Large Language Models · ACL (1) 2024
Natural language and speech › Language models and text generation
instruction tuning
0.812024
One-Shot Learning as Instruction Data Prospector for Large Language Models · ACL (1) 2024
Natural language and speech › Language models and text generation
long context
0.812024
Marathon: A Race Through the Realm of Long Context with Large Language Models · ACL (1) 2024
Natural language and speech › Language models and text generation › large language model evaluation › capability evaluation
long-context evaluation
0.812024
Marathon: A Race Through the Realm of Long Context with Large Language Models · ACL (1) 2024
Computational science and engineering › graph learning
graph neural network
0.812024
Impeller: a path-based heterogeneous graph learning method for spatial transcriptomic data imputation · Bioinform. 2024
Bioinformatics and computational biology › transcriptomics
spatial transcriptomics
0.812024
Impeller: a path-based heterogeneous graph learning method for spatial transcriptomic data imputation · Bioinform. 2024
Natural language and speech › Information extraction and text analysis › sentiment analysis
multimodal sentiment analysis
0.512021
Multi-perspective Coherent Reasoning for Helpfulness Prediction of Multimodal Reviews · ACL/IJCNLP (1) 2021
Natural language and speech › Question answering and dialogue systems
dialogue generation
0.412020
Improving Knowledge-Aware Dialogue Generation via Knowledge Base Question Answering · AAAI 2020
Machine learning › Generative modeling
generative adversarial network
0.412020
Interactive Dual Generative Adversarial Networks for Image Captioning · AAAI 2020
Natural language and speech › Question answering and dialogue systems
knowledge base question answering
0.412020
Improving Knowledge-Aware Dialogue Generation via Knowledge Base Question Answering · AAAI 2020
Natural language and speech › Question answering and dialogue systems › dialogue generation
knowledge-grounded dialogue generation
0.412020
Improving Knowledge-Aware Dialogue Generation via Knowledge Base Question Answering · AAAI 2020
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations
0.312025
Identifying Combinatorial Regulatory Genes for Cell Fate Decision via Reparameterizable Subset Explanations · KDD (2) 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › commonsense reasoning
commonsense knowledge integration
0.112020
Improving Knowledge-Aware Dialogue Generation via Knowledge Base Question Answering · AAAI 2020

Methods — techniques the papers use, named apart from their topics

reparameterization · 1.7prompt construction · 1.7neural ODE surrogate · 1.7differentiable optimization · 1.7context pruning · 1.7path operator · 0.8one-shot learning · 0.8heterogeneous graph learning · 0.8graph neural network · 0.8data valuation · 0.8benchmarking · 0.8multi-perspective reasoning · 0.5coherent reasoning · 0.5
YearPublicationVenuePosition
2025 Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs
abstract
Some of the latest released Code Large Language Models (Code LLMs) have been trained on repository-level code data, enabling them to perceive repository structures and utilize cross-file code information. This capability allows us to directly concatenate the content of repository code files in prompts to achieve repository-level code completion. However, in real development scenarios, directly concatenating all code repository files in a prompt can easily exceed the context window of Code LLMs, leading to a significant decline in completion performance. Additionally, overly long prompts can increase completion latency, negatively impacting the user experience. In this study, we conducted extensive experiments, including completion error analysis, topology dependency analysis, and cross-file content analysis, to investigate the factors affecting repository-level code completion. Based on the conclusions drawn from these preliminary experiments, we proposed a strategy called **Hierarchical Context Pruning (HCP)** to construct high-quality completion prompts. We applied the **HCP** to six Code LLMs and evaluated them on the CrossCodeEval dataset. The experimental results showed that, compared to previous methods, the prompts constructed using our **HCP** strategy achieved higher completion accuracy on five out of six Code LLMs. Additionally, the **HCP** managed to keep the prompt length around 8k tokens (whereas the full repository code is approximately 50k tokens), significantly improving completion throughput. Our code and data will be publicly available.
Lei Zhang 0201, Yunshui Li, Jiaming Li 0004, Xiaobo Xia, Jiaxi Yang 0004, Run Luo, Minzheng Wang 0001, Longze Chen, Junhao Liu 0001, Qiang Qu 0001, Min Yang 0007
AAAI9
2025 Identifying Combinatorial Regulatory Genes for Cell Fate Decision via Reparameterizable Subset Explanations
abstract
Cell fate decisions are highly coordinated processes governed by complex interactions among numerous regulatory genes, while disruptions in these mechanisms can lead to developmental abnormalities and disease. Traditional methods often fail to capture such combinatorial interactions, limiting their ability to fully model cell fate dynamics. Here, we introduce MetaVelo, a global feature explanation framework for identifying key regulatory gene sets influencing cell fate transitions. MetaVelo models these transitions as a black-box function and employs a differentiable neural ordinary differential equation (ODE) surrogate to enable efficient optimization. By reparameterizing the problem as a controllable data generation process, MetaVelo overcomes the challenges posed by the non-differentiable nature of cell fate dynamics. Benchmarking across diverse stand-alone and longitudinal single-cell RNA-seq datasets and three black-box cell fate models demonstrates its superiority over 12 baseline methods in predicting developmental trajectories and identifying combinatorial regulatory gene sets. MetaVelo further distinguishes independent from synergistic regulatory genes, offering novel insights into the gene interactions governing cell fate. With the growing availability of high-resolution single-cell data, MetaVelo provides a scalable and effective framework for advancing developmental biology and therapeutic applications.
Junhao Liu 0001, Martin Renqiang Min, Jing Zhang 0062
KDD (2)1
2024 One-Shot Learning as Instruction Data Prospector for Large Language Models
abstract
Yunshui Li, Binyuan Hui, Xiaobo Xia, Jiaxi Yang, Min Yang, Lei Zhang, Shuzheng Si, Ling-Hao Chen, Junhao Liu, Tongliang Liu, Fei Huang, Yongbin Li. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.
Yunshui Li, Binyuan Hui, Xiaobo Xia, Jiaxi Yang 0004, Min Yang 0007, Lei Zhang 0201, Shuzheng Si, Junhao Liu 0001, Tongliang Liu, Fei Huang 0002, Yongbin Li 0001
ACL (1)9
2024 Marathon: A Race Through the Realm of Long Context with Large Language Models
abstract
Lei Zhang, Yunshui Li, Ziqiang Liu, Jiaxi Yang, Junhao Liu, Longze Chen, Run Luo, Min Yang. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.
Lei Zhang 0201, Yunshui Li, Jiaxi Yang 0004, Junhao Liu 0001, Longze Chen, Run Luo, Min Yang 0007
ACL (1)5
2024 Understanding Transcriptional Regulatory Redundancy by Learnable Global Subset Perturbations
Junhao Liu 0001, Siwei Xu, Dylan Riffle, Ziheng Duan, Martin Renqiang Min, Jing Zhang 0062
ACML1
2024 scACT: Accurate Cross-modality Translation via Cycle-consistent Training from Unpaired Single-cell Data
abstract
Single-cell sequencing technologies have revolutionized genomics by enabling the simultaneous profiling of various molecular modalities within individual cells. Their integration, especially cross-modality translation, offers deep insights into cellular regulatory mechanisms. Many methods have been developed for cross-modality translation, but their reliance on scarce high-quality co-assay data limits their applicability. Addressing this, we introduce scACT, a deep generative model designed to extract cross-modality biological insights from unpaired single-cell data. scACT tackles three major challenges: aligning unpaired multi-modal data via adversarial training, facilitating cross-modality translation without prior knowledge via cycle-consistent training, and enabling interpretable regulatory interconnections explorations via in-silico perturbations. To test its performance, we applied scACT on diverse single-cell datasets and found it outperformed existing methods in all three tasks. Finally, we have developed scACT as an individual open-source software package to advance single-cell omics data processing and analysis within the research community.
Siwei Xu, Junhao Liu 0001, Jing Zhang 0062
CIKM2
2024 Multi-View Multi-Focus Image Fusion: A Novel Benchmark Dataset and Method
abstract
Multi-focus image fusion fuses multiple images focused on different depths to generate a clear image covering the whole scene. However, the existing multi-focus image fusion methods do not consider the movement of the camera or objects in actual shooting. To address this, we propose an end-to-end deep learning network to generate the all-in-focus image from multi-view multi-focus images. Specifically, our method first warps the multi-view multi-focus images to a unified camera view by homography transformation matrices, and measures the defocus degree of co-located image patches through a focus information evaluation mechanism. Finally, our fusion network applies an adaptive fusion scheme to fuse the detected image patches into a clear image. For testing our fusion network, a multi-view multi-focus image benchmark dataset (MVMFI) is constructed with more than 1000 image sequences. Experiments results demonstrate that our method outperforms the state-of-the-art methods both qualitatively and quantitatively. MVMFI dataset is available at https://github.com/North-Li/MVMFI.
Zhilong Li, Kejun Wu, Junhao Liu 0001, Qiong Liu 0001, You Yang 0002
ICIP3
2024 Impeller: a path-based heterogeneous graph learning method for spatial transcriptomic data imputation
abstract
MOTIVATION: Recent advances in spatial transcriptomics allow spatially resolved gene expression measurements with cellular or even sub-cellular resolution, directly characterizing the complex spatiotemporal gene expression landscape and cell-to-cell interactions in their native microenvironments. Due to technology limitations, most spatial transcriptomic technologies still yield incomplete expression measurements with excessive missing values. Therefore, gene imputation is critical to filling in missing data, enhancing resolution, and improving overall interpretability. However, existing methods either require additional matched single-cell RNA-seq data, which is rarely available, or ignore spatial proximity or expression similarity information. RESULTS: To address these issues, we introduce Impeller, a path-based heterogeneous graph learning method for spatial transcriptomic data imputation. Impeller has two unique characteristics distinct from existing approaches. First, it builds a heterogeneous graph with two types of edges representing spatial proximity and expression similarity. Therefore, Impeller can simultaneously model smooth gene expression changes across spatial dimensions and capture similar gene expression signatures of faraway cells from the same type. Moreover, Impeller incorporates both short- and long-range cell-to-cell interactions (e.g. via paracrine and endocrine) by stacking multiple GNN layers. We use a learnable path operator in Impeller to avoid the over-smoothing issue of the traditional Laplacian matrices. Extensive experiments on diverse datasets from three popular platforms and two species demonstrate the superiority of Impeller over various state-of-the-art imputation methods. AVAILABILITY AND IMPLEMENTATION: The code and preprocessed data used in this study are available at https://github.com/aicb-ZhangLabs/Impeller and https://zenodo.org/records/11212604.
Ziheng Duan, Dylan Riffle, Junhao Liu 0001, Martin Renqiang Min, Jing Zhang 0062
Bioinform.4
2021 Multi-perspective Coherent Reasoning for Helpfulness Prediction of Multimodal Reviews
abstract
Junhao Liu, Zhen Hai, Min Yang, Lidong Bing. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2021.
Junhao Liu 0001, Zhen Hai, Min Yang 0007, Lidong Bing
ACL/IJCNLP (1)1
2021 Improving Cross-Modal Image-Text Retrieval With Teacher-Student Learning
abstract
Cross-modal image-text retrieval has emerged as a challenging task that requires the multimedia system to bridge the heterogeneity gap between different modalities. In this paper, we take full advantage of image-to-text and text-to-image generation models to improve the performance of the cross-modal image-text retrieval model by incorporating the text-grounded and image-grounded generative features into the cross-modal common space with a “Two-Teacher One-Student” learning framework. In addition, a dual regularizer network is designed to distinguish the mismatched image-text pairs from the matched ones. In this way, we can capture the fine-grained correspondence between modalities and distinguish the best-retrieved result from a candidate set. Extensive experiments on three benchmark datasets (i.e., MIRFLICKR-25K, NUS-WIDE, and MS COCO) show that our model can achieve state-of-the-art cross-modal retrieval results. In particular, our model improves the image-to-text and text-to-image retrieval accuracy by more than 22% over the best competitors on the MS COCO dataset.
Junhao Liu 0001, Min Yang 0007, Chengming Li 0004, Ruifeng Xu 0001
IEEE Trans. Circuits Syst. Video Technol.1
2020 Interactive Dual Generative Adversarial Networks for Image Captioning
abstract
Image captioning is usually built on either generation-based or retrieval-based approaches. Both ways have certain strengths but suffer from their own limitations. In this paper, we propose an Interactive Dual Generative Adversarial Network (IDGAN) for image captioning, which mutually combines the retrieval-based and generation-based methods to learn a better image captioning ensemble. IDGAN consists of two generators and two discriminators, where the generation- and retrieval-based generators mutually benefit from each other's complementary targets that are learned from two dual adversarial discriminators. Specifically, the generation- and retrieval-based generators provide improved synthetic and retrieved candidate captions with informative feedback signals from the two respective discriminators that are trained to distinguish the generated captions from the true captions and assign top rankings to true captions respectively, thus featuring the merits of both retrieval-based and generation-based approaches. Extensive experiments on MSCOCO dataset demonstrate that the proposed IDGAN model significantly outperforms the compared methods for image captioning.
Junhao Liu 0001, Kai Wang 0036, Chunpu Xu, Zhou Zhao 0001, Ruifeng Xu 0001, Ying Shen 0001, Min Yang 0007
AAAI1
2020 Improving Knowledge-Aware Dialogue Generation via Knowledge Base Question Answering
abstract
Neural network models usually suffer from the challenge of incorporating commonsense knowledge into the open-domain dialogue systems. In this paper, we propose a novel knowledge-aware dialogue generation model (called TransDG), which transfers question representation and knowledge matching abilities from knowledge base question answering (KBQA) task to facilitate the utterance understanding and factual knowledge selection for dialogue generation. In addition, we propose a response guiding attention and a multi-step decoding strategy to steer our model to focus on relevant features for response generation. Experiments on two benchmark datasets demonstrate that our model has robust superiority over compared methods in generating informative and fluent dialogues. Our code is available at https://github.com/siat-nlp/TransDG.
Jian Wang 0054, Junhao Liu 0001, Wei Bi, Xiaojiang Liu, Kejing He 0001, Ruifeng Xu 0001, Min Yang 0007
AAAI2
2020 Cross-lingual Machine Reading Comprehension with Language Branch Knowledge Distillation
abstract
Cross-lingual Machine Reading Comprehension (CLMRC) remains a challenging problem due to the lack of large-scale annotated datasets in low-source languages, such as Arabic, Hindi, and Vietnamese.Many previous approaches use translation data by translating from a rich-source language, such as English, to low-source languages as auxiliary supervision.However, how to effectively leverage translation data and reduce the impact of noise introduced by translation remains onerous.In this paper, we tackle this challenge and enhance the cross-lingual transferring performance by a novel augmentation approach named Language Branch Machine Reading Comprehension (LBMRC).A language branch is a group of passages in one single language paired with questions in all target languages.We train multiple machine reading comprehension (MRC) models proficient in individual language based on LBMRC.Then, we devise a multilingual distillation approach to amalgamate knowledge from multiple language branch models to a single model for all target languages.Combining the LBMRC and multilingual distillation can be more robust to the data noises, therefore, improving the model's cross-lingual ability.Meanwhile, the produced single multilingual model can apply to all target languages, which saves the cost of training, inference, and maintenance for multiple models.Extensive experiments on two CLMRC benchmarks clearly show the effectiveness of our proposed method.
Junhao Liu 0001, Linjun Shou, Jian Pei 0001, Ming Gong 0001, Min Yang 0007, Daxin Jiang
COLING1
2020 Dual Dynamic Memory Network for End-to-End Multi-turn Task-oriented Dialog Systems
abstract
Existing end-to-end task-oriented dialog systems struggle to dynamically model long dialog context for interactions and effectively incorporate knowledge base (KB) information into dialog generation. To conquer these limitations, we propose a Dual Dynamic Memory Network (DDMN) for multi-turn dialog generation, which maintains two core components: dialog memory manager and KB memory manager. The dialog memory manager dynamically expands the dialog memory turn by turn and keeps track of dialog history with an updating mechanism, which encourages the model to filter irrelevant dialog history and memorize important newly coming information. The KB memory manager shares the structural KB triples throughout the whole conversation, and dynamically extracts KB information with a memory pointer at each turn. Experimental results on three benchmark datasets demonstrate that DDMN significantly outperforms the strong baselines in terms of both automatic evaluation and human evaluation. Our code is available at https://github.com/siat-nlp/DDMN.
Jian Wang 0054, Junhao Liu 0001, Wei Bi, Xiaojiang Liu, Kejing He 0001, Ruifeng Xu 0001, Min Yang 0007
COLING2
2020 Hierarchical fusion of common sense knowledge and classifier decisions for answer selection in community question answering
Min Yang 0007, Lei Chen 0072, Ziyu Lyu, Junhao Liu 0001, Ying Shen 0001, Qingyao Wu
Neural Networks4
2020 An Advanced Deep Generative Framework for Temporal Link Prediction in Dynamic Networks
abstract
Temporal link prediction in dynamic networks has attracted increasing attention recently due to its valuable real-world applications. The primary challenge of temporal link prediction is to capture the spatial-temporal patterns and high nonlinearity of dynamic networks. Inspired by the success of image generation, we convert the dynamic network into a sequence of static images and formulate the temporal link prediction as a conditional image generation problem. We propose a novel deep generative framework, called NetworkGAN, to tackle the challenging temporal link prediction task efficiently, which simultaneously models the spatial and temporal features in the dynamic networks via deep learning techniques. The proposed NetworkGAN inherits the advantages of the graph convolutional network (GCN), the temporal matrix factorization (TMF), the long short-term memory network (LSTM), and the generative adversarial network (GAN). Specifically, an attentive GCN is first designed to automatically learn the spatial features of dynamic networks. Second, we propose a TMF enhanced attentive LSTM (TMF-LSTM) to capture the temporal dependencies and evolutionary patterns of dynamic networks, which predicts the network snapshot at next timestamp based on the network snapshots observed at previous timestamps. Furthermore, we employ a GAN framework to further refine the performance of temporal link prediction by using a discriminative model to guide the training of the deep generative model (i.e., TMF-LSTM) in an adversarial process. To verify the effectiveness of the proposed model, we conduct extensive experiments on five real-world datasets. Experimental results demonstrate the significant advantages of NetworkGAN compared to other strong competitors.
Min Yang 0007, Junhao Liu 0001, Lei Chen 0072, Zhou Zhao 0001, Xiaojun Chen 0006, Ying Shen 0001
IEEE Trans. Cybern.2
2020 An Ensemble of Generation- and Retrieval-Based Image Captioning With Dual Generator Generative Adversarial Network
abstract
Image captioning, which aims to generate a sentence to describe the key content of a query image, is an important but challenging task. Existing image captioning approaches can be categorised into two types: generation-based methods and retrieval-based methods. Retrieval-based methods describe images by retrieving pre-existing captions from a repository. Generation-based methods synthesize a new sentence that verbalizes the query image. Both ways have certain advantages but suffer from their own disadvantages. In the paper, we propose a novel EnsCaption model, which aims at enhancing an ensemble of retrieval-based and generation-based image captioning methods through a novel dual generator generative adversarial network. Specifically, EnsCaption is composed of a caption generation model that synthesizes tailored captions for the query image, a caption re-ranking model that retrieves the best-matching caption from a candidate caption pool consisting of generated captions and pre-retrieved captions, and a discriminator that learns the multi-level difference between the generated/retrieved captions and the ground-truth captions. During the adversarial training process, the caption generation model and the caption re-ranking model provide improved synthetic and retrieved candidate captions with high ranking scores from the discriminator, while the discriminator based on multi-level ranking is trained to assign low ranking scores to the generated and retrieved image captions. Our model absorbs the merits of both generation-based and retrieval-based approaches. We conduct comprehensive experiments to evaluate the performance of EnsCaption on two benchmark datasets: MSCOCO and Flickr-30K. Experimental results show that EnsCaption achieves impressive performance compared to the strong baseline methods.
Min Yang 0007, Junhao Liu 0001, Ying Shen 0001, Zhou Zhao 0001, Xiaojun Chen 0006, Qingyao Wu, Chengming Li 0004
IEEE Trans. Image Process.2