← Search

Xiaoshuang Shi

20 accepted papers

2026

A Linear Expectation Constraint for Selective Prediction and Routing with False-Discovery Control

ICML 2026poster

Foundation models often generate unreliable answers, while heuristic uncertainty estimators fail to fully distinguish correct from incorrect outputs, causing users to accept erroneous answers without statistical guarantees. We address this through the lens of false discovery rate (FDR) control, ensu…

Cited by 0SourceScholar
2026

COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees

AAAI 2026technical

Uncertainty quantification (UQ) in foundation models is crucial for identifying and mitigating hallucinations in automatically generated text. However, heuristic UQ approaches lack statistical guarantees for key metrics such as the false discovery rate (FDR) in selective prediction tasks. Previous

Cited by 0SourcePDFScholar
2026

Revisiting Confidence Calibration for Misclassification Detection in VLMs

ICLR 2026poster

Confidence calibration has been widely studied to improve the trustworthiness of predictions in vision-language models (VLMs). However, we theoretically reveal that standard confidence calibration inherently _impairs_ the ability to distinguish between correct and incorrect predictions (i.e., Miscla…

Cited by 0SourceScholar
2025

Enhancing the Influence of Labels on Unlabeled Nodes in Graph Convolutional Networks

ICML 2025poster

The message-passing mechanism of graph convolutional networks (i.e., GCNs) enables label information to reach more unlabeled neighbors, thereby increasing the utilization of labels. However, the additional label information does not always contribute positively to the GCN. To address this issue, we…

2025

Meta Label Correction with Generalization Regularizer

IJCAI 2025

Deep neural networks can easily lead to the over-fitting issue due to the influence of noisy labels. However, previous label correction methods for dealing with noisy labels often need expensive computation cost to achieve effectiveness and ignore the generalization ability of the model. To address

Cited by 0SourcePDFScholar
2025

SConU: Selective Conformal Uncertainty in Large Language Models

ACL 2025long

As large language models are increasingly utilized in real-world applications, guarantees of task-specific metrics are essential for their reliable deployment. Previous studies have introduced various criteria of conformal uncertainty grounded in split conformal prediction, which offer user-specifie…

2025

TruthPrInt: Mitigating Large Vision-Language Models Object Hallucination Via Latent Truthful-Guided Pre-Intervention

ICCV 2025poster

Object Hallucination (OH) has been acknowledged as one of the major trustworthy challenges in Large Vision-Language Models (LVLMs). Recent advancements in Large Language Models (LLMs) indicate that internal states, such as hidden states, encode the "overall truthfulness" of generated responses. Howe…

2024

ACT-Diffusion: Efficient Adversarial Consistency Training for One-step Diffusion Models

CVPR 2024poster

Though diffusion models excel in image generation their step-by-step denoising leads to slow generation speeds. Consistency training addresses this issue with single-step sampling but often produces lower-quality generations and requires high training costs. In this paper we show that optimizing con…

2024

An Efficient Membership Inference Attack for the Diffusion Model by Proximal Initialization

ICLR 2024poster

Recently, diffusion models have achieved remarkable success in generating tasks, including image and audio generation. However, like other generative models, diffusion models are prone to privacy issues. In this paper, we propose an efficient query-based membership inference attack (MIA), namely Pro…

2024

ConU: Conformal Uncertainty in Large Language Models with Correctness Coverage Guarantees

EMNLP 2024finding

Uncertainty quantification (UQ) in natural language generation (NLG) tasks remains an open challenge, exacerbated by the closed-source nature of the latest large language models (LLMs). This study investigates applying conformal prediction (CP), which can transform any heuristic uncertainty notion i…

2024

Exploring the Role of Node Diversity in Directed Graph Representation Learning

IJCAI 2024poster

Many methods of Directed Graph Neural Networks (DGNNs) are designed to equally treat nodes in the same neighbor set (i.e., out-neighbor set and in-neighbor set) for every node, without considering the node diversity in directed graphs, so they are often unavailable to adaptively acquire suitable inf…

Cited by 3SourcePDFScholar
2024

On Which Nodes Does GCN Fail? Enhancing GCN From the Node Perspective

ICML 2024poster

The label smoothness assumption is at the core of Graph Convolutional Networks (GCNs): nodes in a local region have similar labels. Thus, GCN performs local feature smoothing operation to adhere to this assumption. However, there exist some nodes whose labels obtained by feature smoothing conflict w…

Cited by 7SourcePDFScholar
2023

Are Diffusion Models Vulnerable to Membership Inference Attacks?

ICML 2023poster

Diffusion-based generative models have shown great potential for image synthesis, but there is a lack of research on the security and privacy risks they may pose. In this paper, we investigate the vulnerability of diffusion models to Membership Inference Attacks (MIAs), a common privacy concern. Our…

2023

Disentangled Multiplex Graph Representation Learning

ICML 2023poster

Unsupervised multiplex graph representation learning (UMGRL) has received increasing interest, but few works simultaneously focused on the common and private information extraction. In this paper, we argue that it is essential for conducting effective and robust UMGRL to extract complete and clean c…

Cited by 45SourcePDFScholar
2023

Improve Video Representation with Temporal Adversarial Augmentation

IJCAI 2023poster

Recent works reveal that adversarial augmentation benefits the generalization of neural networks (NNs) if used in an appropriate manner. In this paper, we introduce Temporal Adversarial Augmentation (TA), a novel video augmentation technique that utilizes temporal attention. Unlike conventional adve…

2023

Multiplex Graph Representation Learning via Common and Private Information Mining

AAAI 2023technical

Self-supervised multiplex graph representation learning (SMGRL) has attracted increasing interest, but previous SMGRL methods still suffer from the following issues: (i) they focus on the common information only (but ignore the private information in graph structures) to lose some essential characte…

Cited by 8SourcePDFScholar
2023

Self-Weighted Contrastive Learning among Multiple Views for Mitigating Representation Degeneration

NeurIPS 2023poster

Recently, numerous studies have demonstrated the effectiveness of contrastive learning (CL), which learns feature representations by pulling in positive samples while pushing away negative samples. Many successes of CL lie in that there exists semantic consistency between data augmentations of the s…

2022

Deep Incomplete Multi-View Clustering via Mining Cluster Complementarity

AAAI 2022technical

Incomplete multi-view clustering (IMVC) is an important unsupervised approach to group the multi-view data containing missing data in some views. Previous IMVC methods suffer from the following issues: (1) the inaccurate imputation or padding for missing data negatively affects the clustering perfor…

2022

Simple Unsupervised Graph Representation Learning

AAAI 2022technical

In this paper, we propose a simple unsupervised graph representation learning method to conduct effective and efficient contrastive learning. Specifically, the proposed multiplet loss explores the complementary information between the structural information and neighbor information to enlarge the in…

2016

SemiContour: A Semi-Supervised Learning Approach for Contour Detection

CVPR 2016poster

Supervised contour detection methods usually require many labeled training images to obtain satisfactory performance. However, a large set of annotated data might be unavailable or extremely labor intensive. In this paper, we investigate the usage of semi-supervised learning (SSL) to obtain competit…

Cited by 62PDFScholar