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

Lujia Bai

dblp:339/8707 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0008-5900-0685ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Information theory · 38% Graph algorithms and graph theory · 38% Mathematical optimization · 23%
Artificial intelligence
1 paper
Generative modeling · 50% Reinforcement learning · 50%

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

TopicWeightPapersLastEvidence papers
Information theory
statistical inference
0.912025
Uniform Variance Reduced Simultaneous Inference of Time-Varying Correlation Networks · IEEE Trans. Inf. Theory 2025
Graph algorithms and graph theory
temporal graph
0.912025
Uniform Variance Reduced Simultaneous Inference of Time-Varying Correlation Networks · IEEE Trans. Inf. Theory 2025
Machine learning › Generative modeling
diffusion model
0.712023
UniPC: A Unified Predictor-Corrector Framework for Fast Sampling of Diffusion Models · NeurIPS 2023
Machine learning › Reinforcement learning
sample efficiency
0.712023
UniPC: A Unified Predictor-Corrector Framework for Fast Sampling of Diffusion Models · NeurIPS 2023
Mathematical optimization › multiple hypothesis testing
family-wise error rate control
0.312025
Uniform Variance Reduced Simultaneous Inference of Time-Varying Correlation Networks · IEEE Trans. Inf. Theory 2025
Mathematical optimization
simultaneous inference
0.312025
Uniform Variance Reduced Simultaneous Inference of Time-Varying Correlation Networks · IEEE Trans. Inf. Theory 2025

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

variance reduction · 0.9difference-based estimators · 0.9asymptotic analysis · 0.9predictor-corrector framework · 0.7denoising network · 0.7
YearPublicationVenuePosition
2025 Uniform Variance Reduced Simultaneous Inference of Time-Varying Correlation Networks
abstract
This paper proposes a unified framework for inferring large-scale time-varying correlation networks via data-driven time-varying thresholds that can control uncertainty simultaneously. The framework allows the dimension of time series vectors to be fixed or diverging at a high polynomial rate of the sample size. It also allows the time series to exhibit changing temporal characteristics beyond stationarity without specific structural assumptions. Motivated by the practical issue that the confidence band of non-parametric estimators of correlations can exceed their natural domain [−1, 1] (see, for example [1])), we propose a simple uniform variance reduction technique. When applied to the construction of a correlation network, the new device yields more accurate thresholds, which enhance the probability of recovering the time-varying network structures. We broaden the applicability of our method by developing difference-based estimators of cross-correlations that are robust to structure breaks in the time-varying mean functions, and by allowing both a fixed and a diverging number of lags in the correlation functions. We prove the asymptotic validity of the proposed method, especially in achieving accurate family-wise error control when disclosing flexible time-varying network structures. The effectiveness of our method in finite samples is demonstrated through simulation studies and data analysis.
Lujia Bai, Weichi Wu
IEEE Trans. Inf. Theory1
2023 UniPC: A Unified Predictor-Corrector Framework for Fast Sampling of Diffusion Models
abstract
Diffusion probabilistic models (DPMs) have demonstrated a very promising ability in high-resolution image synthesis. However, sampling from a pre-trained DPM is time-consuming due to the multiple evaluations of the denoising network, making it more and more important to accelerate the sampling of DPMs. Despite recent progress in designing fast samplers, existing methods still cannot generate satisfying images in many applications where fewer steps (e.g., $<$10) are favored. In this paper, we develop a unified corrector (UniC) that can be applied after any existing DPM sampler to increase the order of accuracy without extra model evaluations, and derive a unified predictor (UniP) that supports arbitrary order as a byproduct. Combining UniP and UniC, we propose a unified predictor-corrector framework called UniPC for the fast sampling of DPMs, which has a unified analytical form for any order and can significantly improve the sampling quality over previous methods, especially in extremely few steps. We evaluate our methods through extensive experiments including both unconditional and conditional sampling using pixel-space and latent-space DPMs. Our UniPC can achieve 3.87 FID on CIFAR10 (unconditional) and 7.51 FID on ImageNet 256$\times$256 (conditional) with only 10 function evaluations. Code is available at https://github.com/wl-zhao/UniPC.
Wenliang Zhao, Lujia Bai, Yongming Rao, Jie Zhou 0001, Jiwen Lu
NeurIPS2