← Search

Jianzhong Qi

23 accepted papers

2026

CARPRT: Class-Aware Zero-Shot Prompt Reweighting for Vision-Language Model

ICLR 2026poster

Pre-trained vision-language models (VLMs) enable zero-shot image classification by computing the similarity score between an image and textual descriptions, typically formed by inserting a class label (e.g., "cat") into a prompt (e.g., "a photo of a").Existing studies have shown that the score betwe…

Cited by 0SourceScholar
2026

Generalising Traffic Forecasting to Regions Without Traffic Observations

AAAI 2026technical

Traffic forecasting is essential for intelligent transportation systems. Accurate forecasting relies on continuous observations collected by traffic sensors. However, due to high deployment and maintenance costs, not all regions are equipped with such sensors. This paper aims to forecast for region

Cited by 0SourcePDFScholar
2026

Hybrid Routing for a Mixture of LoRA Experts

AAAI 2026technical

Combining Mixture of Experts (MoE) with Low-Rank Adaptation (LoRA) has shown promising efficiency in multi-task instruction tuning for Large Language Models (LLMs). While existing routing schemes for such MoE systems employ auxiliary functions to ensure both expert selection certainty and workload b

Cited by 0SourcePDFScholar
2026

Position: Embodied AI Requires a Privacy-Utility Tradeoff

ICML 2026poster

Embodied AI (EAI) systems are rapidly transitioning from simulations into real-world domestic and other sensitive environments. However, recent EAI solutions have largely demonstrated advancements within \emph{isolated stages} such as instruction, perception, planning and interaction, without consid…

Cited by 0SourceScholar
2025

Accurate and Regret-Aware Numerical Problem Solver for Tabular Question Answering

AAAI 2025technical

Question answering on free-form tables (a.k.a. TableQA) is a challenging task because of the flexible structure and complex schema of tables. Recent studies use Large Language Models (LLMs) for this task, exploiting their capability in understanding the questions and tabular data, which are typicall…

2025

Attribute-based Visual Reprogramming for Vision-Language Models

ICLR 2025poster

*Visual reprogramming* (VR) reuses pre-trained vision models for downstream image classification tasks by adding trainable noise patterns to inputs. When applied to vision-language models (e.g., CLIP), existing VR approaches follow the same pipeline used in vision models (e.g., ResNet, ViT), where g…

2025

Beyond Seen Data: Improving KBQA Generalization Through Schema-Guided Logical Form Generation

EMNLP 2025

Knowledge base question answering (KBQA) aims to answer user questions in natural language using rich human knowledge stored in large KBs. As current KBQA methods struggle with unseen knowledge base elements and their novel compositions at test time, we introduce SG-KBQA — a novel model that injects

2025

DualCast: A Model to Disentangle Aperiodic Events from Traffic Series

IJCAI 2025

Traffic forecasting is crucial for transportation systems optimisation. Current models minimise the mean forecasting errors, often favouring periodic events prevalent in the training data, while overlooking critical aperiodic ones like traffic incidents. To address this, we propose DualCast, a dual-

2025

Factual Dialogue Summarization via Learning from Large Language Models

COLING 2025main

Factual consistency is an important quality in dialogue summarization. Large language model (LLM)-based automatic text summarization models generate more factually consistent summaries compared to those by smaller pretrained language models, but they face deployment challenges in real-world applicat…

2025

FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning

AAAI 2025technical

Recent studies have highlighted significant fairness issues in Graph Transformer (GT) models, particularly against subgroups defined by sensitive features. Additionally, GTs are computationally intensive and memory-demanding, limiting their application to large-scale graphs. Our experiments demonstr…

2025

Understanding Model Reprogramming for CLIP via Decoupling Visual Prompts

ICML 2025poster

Model reprogramming adapts pretrained models to downstream tasks by modifying only the input and output spaces. *Visual reprogramming* (VR) is one instance for vision tasks that adds a trainable noise pattern (i.e., a visual prompt) to input images to facilitate downstream classification. The existi…

Cited by 0SourcePDFScholar
2024

Bayesian-guided Label Mapping for Visual Reprogramming

NeurIPS 2024oral

*Visual reprogramming* (VR) leverages the intrinsic capabilities of pretrained vision models by adapting their input or output interfaces to solve downstream tasks whose labels (i.e., downstream labels) might be totally different from the labels associated with the pretrained models (i.e., pretraine…

2024

Federated Graph Learning for Cross-Domain Recommendation

NeurIPS 2024poster

Cross-domain recommendation (CDR) offers a promising solution to the data sparsity problem by enabling knowledge transfer across source and target domains. However, many recent CDR models overlook crucial issues such as privacy as well as the risk of negative transfer (which negatively impact model…

Cited by 2SourcePDFScholar
2024

Sample-specific Masks for Visual Reprogramming-based Prompting

ICML 2024spotlight

*Visual reprogramming* (VR) is a prompting technique that aims to re-purpose a pre-trained model (e.g., a classifier on ImageNet) to target tasks (e.g., medical data prediction) by learning a *small-scale pattern* added into input images instead of tuning considerable parameters within the model. Th…

2023

Annotating and Detecting Fine-grained Factual Errors for Dialogue Summarization

ACL 2023long

A series of datasets and models have been proposed for summaries generated for well-formatted documents such as news articles. Dialogue summaries, however, have been under explored. In this paper, we present the first dataset with fine-grained factual error annotations named DIASUMFACT. We define fi…

2023

Compressed Heterogeneous Graph for Abstractive Multi-Document Summarization

AAAI 2023technical

Multi-document summarization (MDS) aims to generate a summary for a number of related documents. We propose HGSum — an MDS model that extends an encoder-decoder architecture to incorporate a heterogeneous graph to represent different semantic units (e.g., words and sentences) of the documents. This…

2023

FedGS: Federated Graph-Based Sampling with Arbitrary Client Availability

AAAI 2023technical

While federated learning has shown strong results in opti- mizing a machine learning model without direct access to the original data, its performance may be hindered by in- termittent client availability which slows down the conver- gence and biases the final learned model. There are significant ch…

2021

Federated Learning with Fair Averaging

IJCAI 2021poster

Fairness has emerged as a critical problem in federated learning (FL). In this work, we identify a cause of unfairness in FL -- conflicting gradients with large differences in the magnitudes. To address this issue, we propose the federated fair averaging (FedFV) algorithm to mitigate potential confl…

2021

Grouped-Attention for Content-Selection and Content-Plan Generation

EMNLP 2021finding

Content-planning is an essential part of data-to-text generation to determine the order of data mentioned in generated texts. Recent neural data-to-text generation models employ Pointer Networks to explicitly learn content-plan given a set of attributes as input. They use LSTM to encode the input, w…

Cited by 1SourcePDFScholar
2020

Short-Term and Long-Term Context Aggregation Network for Video Inpainting

ECCV 2020poster

Video inpainting aims to restore missing regions of a video and has many applications such as video editing and object removal. However, existing methods either suffer from inaccurate short-term context aggregation or rarely explore long-term frame information. In this work, we present a novel conte…

Cited by 54SourcePDFScholar
2019

Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random

ICML 2019oral

In recommender systems, usually the ratings of a user to most items are missing and a critical problem is that the missing ratings are often missing not at random (MNAR) in reality. It is widely acknowledged that MNAR ratings make it difficult to accurately predict the ratings and unbiasedly estimat…

Cited by 282SourcePDFScholar
2018

KDGAN: Knowledge Distillation with Generative Adversarial Networks

NeurIPS 2018poster

Knowledge distillation (KD) aims to train a lightweight classifier suitable to provide accurate inference with constrained resources in multi-label learning. Instead of directly consuming feature-label pairs, the classifier is trained by a teacher, i.e., a high-capacity model whose training may be r…