SearcharxivSearch

arXiv subjects

Yuqian Cheng

Publications and source records attributed to Yuqian Cheng.

5 recordsLinked to original sources

Risk Equivalence between RKHS Regression and Sequence Models for Lipschitz Spectral Algorithms

Kernel spectral algorithms are often summarized by convergence rates, which hide how their risk depends jointly on regularization, noise, the population spectrum, target coefficients, and the chosen filter. Gaussian sequence models arise as a simplified but characteristic setting for studying the interplay of these factors, where the kernel spectral algorithm corresponds to a coordinatewise shrinkage estimator. Under mild assumptions, we show that the risk of a kernel spectral estimator is asymptotically equivalent to that of the corresponding Gaussian sequence model estimator with the same filter. The explicit sequence model risk then yields a full characterization of the risk of kernel spectral algorithms in terms of the population spectrum, target coefficients, and filter. We establish this equivalence for a broad class of spectral filters, covering kernel ridge regression, generalized ridge regression, iterated kernel ridge regression, gradient flow, stable gradient descent, smoothed spectral cutoff, spectral clipping, and Pinsker shrinkage. Our risk equivalence not only holds in the classical fixed-dimensional regime but also applies to the high dimensional regime where the input dimension scales with the sample size. As applications, our risk equivalence recovers the minimax upper rates, and establishes the exact Pinsker constant in RKHS regression.

math.ST

Large Dimensional Kernel Ridge Regression: Extending to Product Kernels

Recent studies have reported $\textit{saturation effects}$ and $\textit{multiple descent behavior}$ in large dimensional kernel ridge regression (KRR). However, these findings are predominantly derived under restrictive settings, such as inner product kernels on sphere or strong eigenfunction assumptions like hypercontractivity. Whether such behaviors hold for other kernels remains an open question. In this paper, we establish a broad, new family of large dimensional kernels and derive the corresponding convergence rates of the generalization error. As a result, we recover key phenomena previously associated with inner product kernels on sphere, including: $i)$ the $\textit{minimax optimality}$ when the source condition $s\le 1$; $ii)$ the $\textit{saturation effect}$ when $s>1$; $iii)$ a $\textit{periodic plateau phenomenon}$ in the convergence rate and a $\textit {multiple-descent behavior}$ with respect to the sample size $n$.

stat.ML

Optimal Confidence Band for Kernel Gradient Flow Estimator

In this paper, we investigate the supremum-norm generalization error and the uniform inference for a specific class of kernel regression methods, namely the kernel gradient flows. Under the widely adopted capacity-source condition framework in the kernel regression literature, we first establish convergence rates for the supremum norm generalization error of both continuous and discrete kernel gradient flows under the source condition $s>\alpha_0$, where $\alpha_0\in(0,1)$ denotes the embedding index of the kernel function. Moreover, we show that these rates match the minimax optimal rates. Building on this result, we then construct simultaneous confidence bands for both continuous and discrete kernel gradient flows. Notably, the widths of the proposed confidence bands are also optimal, in the sense that their shrinkage rates are greater than, while can be arbitrarily close to, the minimax optimal rates.

math.ST

Regularity criteria for the surface growth model with a forcing term

Based on a compactness method, we establish regularity criteria for suitable weak solutions to the surface growth model with a forcing term. These criteria imply that the H\"older regularity of solutions follows from smallness conditions on several scale-invariant quantities. As a consequence, we obtain a partial regularity result stating that the one-dimensional biparabolic Hausdorff measure of the singular set is zero.

math.AP

New Lower Bounds for Testing Monotonicity and Log Concavity of Distributions

We develop a new technique for proving distribution testing lower bounds for properties defined by inequalities involving the bin probabilities of the distribution in question. Using this technique we obtain new lower bounds for monotonicity testing over discrete cubes and tight lower bounds for log-concavity testing. Our basic technique involves constructing a pair of moment-matching families of distributions by tweaking the probabilities of pairs of bins so that one family maintains the defining inequalities while the other violates them.

cs.LG