@article {665054,
	title = {Universality Laws for High-Dimensional Learning with Random Features},
	journal = {IEEE Transactions on Information Theory, in press},
	year = {2022},
	abstract = {We prove a universality theorem for learning with random features. Our result shows that, in terms of training and generalization errors, the random feature model with a nonlinear activation function is asymptotically equivalent to a surrogate Gaussian model with a matching covariance matrix. This settles a conjecture based on which several recent papers develop their results. Our method for proving the universality builds on the classical Lindeberg approach. Major ingredients of the proof include a leave-one-out analysis for the optimization problem associated with the training process and a central limit theorem, obtained via Stein{\textquoteright}s method, for weakly correlated random variables.},
	url = {https://arxiv.org/abs/2009.07669},
	author = {Hong Hu and Yue M. Lu}
}
@article {633825,
	title = {Asymptotics and Optimal Designs of SLOPE for Sparse Linear Regression},
	journal = {IEEE Transactions on Information Theory},
	volume = {68},
	number = {11},
	year = {2022},
	pages = {7627--7664},
	abstract = {In sparse linear regression, the SLOPE estimator generalizes LASSO by assigning magnitude-dependent regularizations to different coordinates of the estimate. In this paper, we present an asymptotically exact characterization of the performance of SLOPE in the high-dimensional regime where the number of unknown parameters grows in proportion to the number of observations. Our asymptotic characterization enables us to derive optimal regularization sequences to either minimize the MSE or to maximize the power in variable selection under any given level of Type-I error. In both cases, we show that the optimal design can be recast as certain infinite-dimensional convex optimization problems, which have efficient and accurate finite-dimensional approximations. Numerical simulations verify our asymptotic predictions. They also demonstrate the superiority of our optimal design over LASSO and a regularization sequence previously proposed in the literature.},
	url = {https://arxiv.org/abs/1903.11582},
	author = {Hong Hu and Yue M. Lu}
}
@conference {694891,
	title = {Precise Learning Curves and Higher-Order Scaling Limits for Dot Product Kernel Regression},
	booktitle = {Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS)},
	year = {2022},
	abstract = {As modern machine learning models continue to advance the computational frontier, it has become increasingly important to develop precise estimates for expected performance improvements under different model and data scaling regimes. Currently, theoretical understanding of the learning curves that characterize how the prediction error depends on the number of samples is restricted to either large-sample asymptotics ($m\to\infty$) or, for certain simple data distributions, to the high-dimensional asymptotics in which the number of samples scales linearly with the dimension ($m\propto d$). There is a wide gulf between these two regimes, including all higher-order scaling relations $m\propto d^r$, which are the subject of the present paper. We focus on the problem of kernel ridge regression for dot-product kernels and present precise formulas for the mean of the test error, bias, and variance, for data drawn uniformly from the sphere with isotropic random labels in the $r$th-order asymptotic scaling regime $m\to\infty$ with $m/d^r$ held constant. We observe a peak in the learning curve whenever $m \approx d^r/r!$ for any integer $r$, leading to multiple sample-wise descent and nontrivial behavior at multiple scales.\&nbsp;},
	author = {Lechao Xiao and Hong Hu and Theodor Misiakiewicz and Yue M. Lu and Pennington, Jeffrey}
}
@article {690094,
	title = {Sharp Asymptotics of Kernel Ridge Regression Beyond the Linear Regime},
	journal = {technical report},
	year = {2022},
	abstract = {The generalization performance of kernel ridge regression (KRR) exhibits a multi-phased pattern that crucially depends on the scaling relationship between the sample size\&nbsp;n\&nbsp;and the underlying dimension\&nbsp;d. This phenomenon is due to the fact that KRR sequentially learns functions of increasing complexity as the sample size increases; when\&nbsp;dk-1<<n<<dk, only polynomials with degree less than\&nbsp;k\&nbsp;are learned. In this paper, we present sharp asymptotic characterization of the performance of KRR at the critical transition regions with\&nbsp;n≍dk, for\&nbsp;k∈ℤ+. Our asymptotic characterization provides a precise picture of the whole learning process and clarifies the impact of various parameters (including the choice of the kernel function) on the generalization performance. In particular, we show that the learning curves of KRR can have a delicate "double descent" behavior due to specific bias-variance trade-offs at different polynomial scaling regimes.},
	url = {https://arxiv.org/abs/2205.06798},
	author = {Hong Hu and Yue M. Lu}
}
@article {688200,
	title = {Analysis of Random Sequential Message Passing Algorithms for Approximate Inference},
	journal = {Journal of Statistical Mechanics: Theory and Experiments},
	number = {073401},
	year = {2022},
	abstract = {We analyze the dynamics of a random sequential message passing algorithm for approximate inference with large Gaussian latent variable models in a student-teacher scenario. To model nontrivial dependencies between the latent variables, we assume random covariance matrices drawn from rotation invariant ensembles. Moreover, we consider a model mismatching setting, where the teacher model and the one used by the student may be different. By means of dynamical functional approach, we obtain exact dynamical mean-field equations characterizing the dynamics of the inference algorithm. We also derive a range of model parameters for which the sequential algorithm does not converge. The boundary of this parameter range coincides with the de Almeida Thouless (AT) stability condition of the replica symmetric ansatz for the static probabilistic model.},
	url = {https://arxiv.org/abs/2202.08198},
	author = {B. {\c C}akmak and Yue M. Lu and Manfred Opper}
}
