atlas

Research map / Learning theory and algorithms / Kernels and regression theory

Deterministic equivalent and error universality of deep random features learning

ICML 2023 · Learning theory and algorithms › Kernels and regression theory · approach: High-dimensional asymptotic generalization · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace deep random features with a Gaussian covariate model matched on second momentsDeep random features learning with generic architectures and convex loss · Generic target/learner architecturestest errorNo clear effect
Increase depth with tanh activationsDeep random features learner · Ridge regression learning curvestest error at the linear peakHurt
Increase depth with tanh activationsDeep random features learner · Ridge regression learning curvestest error at the nonlinear peakHelped
Increase depth with clipped linear activationsDeep random features learner · Ridge regression learning curvestest error at the linear peakHelped
Increase depth with clipped linear activationsDeep random features learner · Ridge regression learning curvestest error at the nonlinear peakHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy