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

Chenguang Duan

dblp:289/1067 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
0009-0009-0815-6281ORCID · corroborated

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

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

Artificial intelligence
3 papers
Learning theory · 52% Representation and self-supervised learning · 24% Optimization for machine learning · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
adversarial self-supervised learning
0.912025
Adv-SSL: Adversarial Self-Supervised Representation Learning with Theoretical Guarantees · NeurIPS 2025
Machine learning › Optimization for machine learning
minimax optimization
0.912025
Adv-SSL: Adversarial Self-Supervised Representation Learning with Theoretical Guarantees · NeurIPS 2025
Machine learning › Learning theory
nonparametric regression
0.912025
Semi-Supervised Deep Sobolev Regression: Estimation and Variable Selection by ReQU Neural Network · IEEE Trans. Inf. Theory 2025
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
self-supervised representation learning
0.912025
Adv-SSL: Adversarial Self-Supervised Representation Learning with Theoretical Guarantees · NeurIPS 2025
Machine learning › Learning paradigms
semi-supervised learning
0.912025
Semi-Supervised Deep Sobolev Regression: Estimation and Variable Selection by ReQU Neural Network · IEEE Trans. Inf. Theory 2025
Machine learning › Learning theory
excess risk bounds
0.712023
Fast Excess Risk Rates via Offset Rademacher Complexity · ICML 2023
Machine learning › Learning theory › generalization bounds › rademacher complexity
offset rademacher complexity
0.712023
Fast Excess Risk Rates via Offset Rademacher Complexity · ICML 2023
Machine learning › Learning theory › generalization bounds
rademacher complexity
0.712023
Fast Excess Risk Rates via Offset Rademacher Complexity · ICML 2023
Machine learning › Learning theory
statistical learning theory
0.712023
Fast Excess Risk Rates via Offset Rademacher Complexity · ICML 2023
Machine learning › Learning theory › model selection
variable selection
0.312025
Semi-Supervised Deep Sobolev Regression: Estimation and Variable Selection by ReQU Neural Network · IEEE Trans. Inf. Theory 2025

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

empirical risk minimization · 1.5minimax optimization · 0.9gradient norm regularization · 0.9deep ReQU neural networks · 0.9covariance alignment · 0.9adversarial training · 0.9offset rademacher complexity · 0.7
YearPublicationVenuePosition
2025 Adv-SSL: Adversarial Self-Supervised Representation Learning with Theoretical Guarantees
abstract
Learning transferable data representations from abundant unlabeled data remains a central challenge in machine learning. Although numerous self-supervised learning methods have been proposed to address this challenge, a significant class of these approaches aligns the covariance or correlation matrix with the identity matrix. Despite impressive performance across various downstream tasks, these methods often suffer from biased sample risk, leading to substantial optimization shifts in mini-batch settings and complicating theoretical analysis. In this paper, we introduce a novel \underline{\bf Adv}ersarial \underline{\bf S}elf-\underline{\bf S}upervised Representation \underline{\bf L}earning (Adv-SSL) for unbiased transfer learning with no additional cost compared to its biased counterparts. Our approach not only outperforms the existing methods across multiple benchmark datasets but is also supported by comprehensive end-to-end theoretical guarantees. Our analysis reveals that the minimax optimization in Adv-SSL encourages representations to form well-separated clusters in the embedding space, provided there is sufficient upstream unlabeled data. As a result, our method achieves strong classification performance even with limited downstream labels, shedding new light on few-shot learning.
Chenguang Duan, Yuling Jiao, Huazhen Lin, Wensen Ma, Jerry Zhijian Yang
NeurIPS1
2025 Deep contrastive representation learning for supervised tasks
Chenguang Duan, Yuling Jiao, Lican Kang, Jerry Zhijian Yang, Fusheng Zhou
Pattern Recognit.1
2025 Semi-Supervised Deep Sobolev Regression: Estimation and Variable Selection by ReQU Neural Network
abstract
We propose SDORE, asemi-superviseddeep Sobolevregressor, for the nonparametric estimation of the underlying regression function and its gradient. SDORE employs deep ReQU neural networks to minimize the empirical risk with gradient norm regularization, allowing the approximation of the regularization term by unlabeled data. Our study includes a thorough analysis of the convergence rates of SDORE in$L^{2}$-norm, achieving the minimax optimality. Further, we establish a convergence rate for the associated plug-in gradient estimator, even in the presence of significant domain shift. These theoretical findings offer valuable insights for selecting regularization parameters and determining the size of the neural network, while showcasing the provable advantage of leveraging unlabeled data in semi-supervised learning. To the best of our knowledge, SDORE is the first provable neural network-based approach that simultaneously estimates the regression function and its gradient, with diverse applications such as nonparametric variable selection. The effectiveness of SDORE is validated through an extensive range of numerical simulations.
Zhao Ding, Chenguang Duan, Yuling Jiao, Jerry Zhijian Yang
IEEE Trans. Inf. Theory2
2023 Fast Excess Risk Rates via Offset Rademacher Complexity
abstract
Based on the offset Rademacher complexity, this work outlines a systematical framework for deriving sharp excess risk bounds in statistical learning without Bernstein condition. In addition to recovering fast rates in a unified way for some parametric and nonparametric supervised learning models with minimum identifiability assumptions, we also obtain new and improved results for LAD (sparse) linear regression and deep logistic regression with deep ReLU neural networks, respectively.
Chenguang Duan, Yuling Jiao, Lican Kang, Xiliang Lu, Jerry Zhijian Yang
ICML1