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

Dechen Zhang

dblp:420/3613 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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.

Artificial intelligence
1 paper
Kernel, tree and ensemble methods · 50% Generative modeling · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › diffusion model
denoising training
0.912025
Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning · NeurIPS 2025
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.912025
Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning · NeurIPS 2025
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel ridge regression
0.912025
Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning · NeurIPS 2025
Machine learning › Generative modeling
score-based model
0.912025
Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning · NeurIPS 2025

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

spectral decomposition · 0.9concentration analysis · 0.9
YearPublicationVenuePosition
2025 Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning
abstract
Kernel ridge regression (KRR) is a foundational tool in machine learning, with recent work emphasizing its connections to neural networks. However, existing theory primarily addresses the i.i.d. setting, while real-world data often exhibits structured dependencies - particularly in applications like denoising score learning where multiple noisy observations derive from shared underlying signals. We present the first systematic study of KRR generalization for non-i.i.d. data with signal-noise causal structure, where observations represent different noisy views of common signals. Under standard spectral decay assumptions, we develop a novel blockwise decomposition method that enables precise concentration analysis for dependent data. Using this technique, we derive excess risk bounds for KRR that explicitly depend on: (1) the kernel spectrum, (2) causal structure parameters, and (3) sampling mechanisms (including relative sample sizes for signals and noises). We further apply our results to denoising score learning, establishing generalization guarantees and providing principled guidance for sampling noisy data points. This work advances KRR theory while providing practical tools for analyzing dependent data in modern machine learning applications.
Dechen Zhang, Zhenmei Shi, Yingyu Liang, Difan Zou
NeurIPS1