← Search

Zhan Shi

28 accepted papers

2026

Exploring Spatiotemporal Feature Propagation for Video-Level Compressive Spectral Reconstruction: Dataset, Model and Benchmark

CVPR 2026

Recently, Spectral Compressive Imaging (SCI) has achieved remarkable success, unlocking significant potential for dynamic spectral vision. However, existing reconstruction methods, primarily image-based, suffer from two limitations: (i) Encoding process masks spatial-spectral features, leading to un

Cited by 0SourcecodeScholar
2026

Seeing but Not Believing: Probing the Disconnect Between Visual Attention and Answer Correctness in VLMs

ICLR 2026poster

Vision-Language Models (VLMs) achieve strong results on multimodal tasks such as visual question answering, yet they can still fail even when the correct visual evidence is present. In this work, we systematically investigate whether these failures arise from not perceiving the evidence or from not…

Cited by 0SourceScholar
2025

CoT-RAG: Integrating Chain of Thought and Retrieval-Augmented Generation to Enhance Reasoning in Large Language Models

EMNLP 2025

Chain-of-thought (CoT) reasoning boosts large language models’ (LLMs) performance on complex tasks but faces two key limitations: a lack of reliability when solely relying on LLM-generated reasoning chains and interference from natural language reasoning steps with the models’ inference process, als

2025

Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor

NeurIPS 2025poster

Estimating the density of a distribution from its samples is a fundamental problem in statistics. \emph{Hypothesis selection} addresses the setting where, in addition to a sample set, we are given $n$ candidate distributions---referred to as \emph{hypotheses}---and the goal is to determine which one…

Cited by 0SourceScholar
2024

DiG-In-GNN: Discriminative Feature Guided GNN-Based Fraud Detector against Inconsistencies in Multi-Relation Fraud Graph

AAAI 2024technical

Fraud detection on multi-relation graphs aims to identify fraudsters in graphs. Graph Neural Network (GNN) models leverage graph structures to pass messages from neighbors to the target nodes, thereby enriching the representations of those target nodes. However, feature and structural inconsistency…

2024

HydraLoRA: An Asymmetric LoRA Architecture for Efficient Fine-Tuning

NeurIPS 2024oral

Adapting Large Language Models (LLMs) to new tasks through fine-tuning has been made more efficient by the introduction of Parameter-Efficient Fine-Tuning (PEFT) techniques, such as LoRA. However, these methods often underperform compared to full fine-tuning, particularly in scenarios involving comp…

2024

MR-Ben: A Meta-Reasoning Benchmark for Evaluating System-2 Thinking in LLMs

NeurIPS 2024poster

Large language models (LLMs) have shown increasing capability in problem-solving and decision-making, largely based on the step-by-step chain-of-thought reasoning processes. However, evaluating these reasoning abilities has become increasingly challenging. Existing outcome-based benchmarks are begin…

Cited by 14SourcePDFScholar
2024

ProxyQA: An Alternative Framework for Evaluating Long-Form Text Generation with Large Language Models

ACL 2024long

Large Language Models (LLMs) have succeeded remarkably in understanding long-form contents. However, exploring their capability for generating long-form contents, such as reports and articles, has been relatively unexplored and inadequately assessed by existing benchmarks. The prevalent evaluation m…

2024

Ranking-based Client Imitation Selection for Efficient Federated Learning

ICML 2024poster

Federated Learning (FL) enables multiple devices to collaboratively train a shared model while ensuring data privacy. The selection of participating devices in each training round critically affects both the model performance and training efficiency, especially given the vast heterogeneity in traini…

Cited by 3SourcePDFScholar
2023

Aperture Diffraction for Compact Snapshot Spectral Imaging

ICCV 2023poster

We demonstrate a compact, cost-effective snapshot spectral imaging system named Aperture Diffraction Imaging Spectrometer (ADIS), which consists only of an imaging lens with an ultra-thin orthogonal aperture mask and a mosaic filter sensor, requiring no additional physical footprint compared to comm…

Cited by 4PDFcodeScholar
2023

Boosting Spectral Clustering on Incomplete Data via Kernel Correction and Affinity Learning

NeurIPS 2023poster

Spectral clustering has gained popularity for clustering non-convex data due to its simplicity and effectiveness. It is essential to construct a similarity graph using a high-quality affinity measure that models the local neighborhood relations among the data samples. However, incomplete data can le…

Cited by 1SourcePDFScholar
2023

OssCSE: Overcoming Surface Structure Bias in Contrastive Learning for Unsupervised Sentence Embedding

EMNLP 2023long main

Contrastive learning has been demonstrated effective in unsupervised sentence representation learning. Given one sentence, positive pairs are obtained by passing the sentence to the encoder twice using the different dropout masks, and negative pairs are obtained by taking another sentence in the sam…

Cited by 0SourceScholar
2022

Distributionally Robust Structure Learning for Discrete Pairwise Markov Networks

AISTATS 2022poster

We consider the problem of learning the underlying structure of a general discrete pairwise Markov network. Existing approaches that rely on empirical risk minimization may perform poorly in settings with noisy or scarce data. To overcome these limitations, we propose a computationally efficient and…

2022

Improving Zero-Shot Phrase Grounding via Reasoning on External Knowledge and Spatial Relations

AAAI 2022technical

Phrase grounding is a multi-modal problem that localizes a particular noun phrase in an image referred to by a text query. In the challenging zero-shot phrase grounding setting, the existing state-of-the-art grounding models have limited capacity in handling the unseen phrases. Humans, however, can…

Cited by 9SourcePDFScholar
2021

Generalised Lipschitz Regularisation Equals Distributional Robustness

ICML 2021spotlight

The problem of adversarial examples has highlighted the need for a theory of regularisation that is general enough to apply to exotic function classes, such as universal approximators. In response, we have been able to significantly sharpen existing results regarding the relationship between distrib…

2021

Retrieval, Analogy, and Composition: A framework for Compositional Generalization in Image Captioning

EMNLP 2021finding

Image captioning systems are expected to have the ability to combine individual concepts when describing scenes with concept combinations that are not observed during training. In spite of significant progress in image captioning with the help of the autoregressive generation framework, current appr…

2020

Certified Robustness of Graph Convolution Networks for Graph Classification under Topological Attacks

NeurIPS 2020spotlight

Graph convolution networks (GCNs) have become effective models for graph classification. Similar to many deep networks, GCNs are vulnerable to adversarial attacks on graph topology and node attributes. Recently, a number of effective attack and defense algorithms have been designed, but no certifica…

2020

End-to-End Transition-Based Online Dialogue Disentanglement

IJCAI 2020poster

Dialogue disentanglement aims to separate intermingled messages into detached sessions. The existing research focuses on two-step architectures, in which a model first retrieves the relationships between two messages and then divides the message stream into separate clusters. Almost all existing wor…

2020

LEARNING EXECUTION THROUGH NEURAL CODE FUSION

ICLR 2020poster

As the performance of computer systems stagnates due to the end of Moore’s Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) to learn static representations of source…

Cited by 37SourceScholar
2019

Monge blunts Bayes: Hardness Results for Adversarial Training

ICML 2019oral

The last few years have seen a staggering number of empirical studies of the robustness of neural networks in a model of adversarial perturbations of their inputs. Most rely on an adversary which carries out local modifications within prescribed balls. None however has so far questioned the broader…

Cited by 21SourcePDFScholar
2018

Inductive Two-Layer Modeling with Parametric Bregman Transfer

ICML 2018oral

Latent prediction models, exemplified by multi-layer networks, employ hidden variables that automate abstract feature discovery. They typically pose nonconvex optimization problems and effective semi-definite programming (SDP) relaxations have been developed to enable global solutions (Aslan et al.,…

Cited by 7SourcePDFScholar
2017

Bregman Divergence for Stochastic Variance Reduction: Saddle-Point and Adversarial Prediction

NeurIPS 2017spotlight

Adversarial machines, where a learner competes against an adversary, have regained much recent interest in machine learning. They are naturally in the form of saddle-point optimization, often with separable structure but sometimes also with unmanageably large dimension. In this work we show that adv…

Cited by 33SourcePDFScholar