Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Zhang, Dechen, Shi, Zhenmei, Zhang, Yi, Liang, Yingyu, Zou, Difan
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915559374848000
author Zhang, Dechen
Shi, Zhenmei
Zhang, Yi
Liang, Yingyu
Zou, Difan
author_facet Zhang, Dechen
Shi, Zhenmei
Zhang, Yi
Liang, Yingyu
Zou, Difan
contents 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. By developing a novel blockwise decomposition method that enables precise concentration analysis for dependent data, 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.
format Preprint
id arxiv_https___arxiv_org_abs_2510_15363
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning
Zhang, Dechen
Shi, Zhenmei
Zhang, Yi
Liang, Yingyu
Zou, Difan
Machine Learning
Artificial Intelligence
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. By developing a novel blockwise decomposition method that enables precise concentration analysis for dependent data, 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.
title Kernel Regression in Structured Non-IID Settings: Theory and Implications for Denoising Score Learning
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2510.15363