← Search

Bingyi Jing

15 accepted papers

2026

Semi-Supervised Conformal Prediction With Unlabeled Nonconformity Score

CVPR 2026

Conformal prediction (CP) is a powerful framework for uncertainty quantification, generating prediction sets with coverage guarantees. Split conformal prediction relies on labeled data in the calibration procedure. However, the labeled data is often limited in real-world scenarios, leading to unstab

Cited by 0SourcecodeScholar
2025

AugKD: Ingenious Augmentations Empower Knowledge Distillation for Image Super-Resolution

ICLR 2025poster

Knowledge distillation (KD) compresses deep neural networks by transferring task-related knowledge from cumbersome pre-trained teacher models to more compact student models. However, vanilla KD for image super-resolution (SR) networks yields only limited improvements due to the inherent nature of SR…

Cited by 0SourcePDFScholar
2025

Diffusion Actor-Critic: Formulating Constrained Policy Iteration as Diffusion Noise Regression for Offline Reinforcement Learning

ICLR 2025poster

In offline reinforcement learning, it is necessary to manage out-of-distribution actions to prevent overestimation of value functions. One class of methods, the policy-regularized method, addresses this problem by constraining the target policy to stay close to the behavior policy. Although several…

2025

Exploring Learning Complexity for Efficient Downstream Dataset Pruning

ICLR 2025poster

The ever-increasing fine-tuning cost of large-scale pre-trained models gives rise to the importance of dataset pruning, which aims to reduce dataset size while maintaining task performance. However, existing dataset pruning methods require training on the entire dataset, which is impractical for lar…

Cited by 0SourcePDFScholar
2025

Fine-tuning can Help Detect Pretraining Data from Large Language Models

ICLR 2025poster

In the era of large language models (LLMs), detecting pretraining data has been increasingly important due to concerns about fair evaluation and ethical risks. Current methods differentiate members and non-members by designing scoring functions, like Perplexity and Min-k%. However, the diversity and…

Cited by 1SourcePDFScholar
2025

ForceFM: Enhancing Protein-Ligand Predictions through Force-Guided Flow Matching

NeurIPS 2025poster

Molecular docking is a fundamental technique in structure-based drug discovery, playing a critical role in predicting the binding poses of protein-ligand complexes. While traditional docking methods are generally reliable, they are often computationally expensive. Recent deep learning (DL) approache…

Cited by 0SourcecodeScholar
2025

Knowledge Distillation with Multi-granularity Mixture of Priors for Image Super-Resolution

ICLR 2025spotlight

Knowledge distillation (KD) is a promising yet challenging model compression approach that transmits rich learning representations from robust but resource-demanding teacher models to efficient student models. Previous methods for image super-resolution (SR) are often tailored to specific teacher-st…

Cited by 4SourcePDFScholar
2025

Parametric Scaling Law of Tuning Bias in Conformal Prediction

ICML 2025poster

Conformal prediction is a popular framework of uncertainty quantification that constructs prediction sets with coverage guarantees. To uphold the exchangeability assumption, many conformal prediction methods necessitate an additional hold-out set for parameter tuning. Yet, the impact of violating th…

2024

D2R2: Diffusion-based Representation with Random Distance Matching for Tabular Few-shot Learning

NeurIPS 2024poster

Tabular data is widely utilized in a wide range of real-world applications. The challenge of few-shot learning with tabular data stands as a crucial problem in both industry and academia, due to the high cost or even impossibility of annotating additional samples. However, the inherent heterogeneity…

Cited by 0SourcePDFScholar
2024

Q-Distribution guided Q-learning for offline reinforcement learning: Uncertainty penalized Q-value via consistency model

NeurIPS 2024poster

``Distribution shift'' is the primary obstacle to the success of offline reinforcement learning. As a learning policy may take actions beyond the knowledge of the behavior policy (referred to as Out-of-Distribution (OOD) actions), the Q-values of these OOD actions can be easily overestimated. Conseq…

2023

Constrained Policy Optimization with Explicit Behavior Density For Offline Reinforcement Learning

NeurIPS 2023poster

Due to the inability to interact with the environment, offline reinforcement learning (RL) methods face the challenge of estimating the Out-of-Distribution (OOD) points. Existing methods for addressing this issue either control policy to exclude the OOD action or make the $Q$ function pessimistic. H…