atlas

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

No Free Lunch from Random Feature Ensembles: Scaling Laws and Near-Optimality Conditions

ICML 2025 · Learning theory and algorithms › Kernels and regression theory · approach: Kernel ridge regression analysis · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Shows theoretically that, at fixed total random-feature budget, ridge-optimized RFRR ensembles never beat a single model, and characterizes when ensembles can nearly match it via deterministic-equivalent risk and growth-exponent scaling laws.

Problem

Whether, under a fixed total parameter budget, an ensemble of smaller random-feature ridge regression models can match a single large model in test risk.

Approach

Uses deterministic-equivalent risk estimates for RFRR ensembles to prove a no-free-lunch theorem (ridge-optimized risk increases with ensemble size at fixed total features), shows overparameterized ensembles depend only on total feature count M=KN, and derives scaling laws under a growth exponent ell for joint scaling of K and N.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Increase ensemble size K while keeping total feature count M fixedRFRR ensembles · Binarized CIFAR-10optimal test riskHurt
Allocate a fixed total feature count to one model instead of multiple modelsRFRR ensembles · RFRR tasksridge-optimized test riskHelped
Increase model size N with optimally tuned ridgeRFRR ensembles · RFRR taskstest riskHelped
Increase training sample size P with optimally tuned ridgeRFRR ensembles · RFRR taskstest riskHelped
Divide a fixed total feature count among overparameterized ensemble membersRFRR ensembles · Overparameterized regimetest risk: risk depends on K and N only through KNNo clear effect
Jointly increase ensemble size and model size with growth exponent ℓRFRR ensembles on difficult tasks · Underparameterized regime, r<1/2test-risk scaling exponent: s = min (2 α ℓ min(r, 1), 1−ℓ + 2 α ℓ min(r, 1/2))Mixed
Jointly scale ensemble size and model size with ℓ above the thresholdRFRR ensembles on easier tasks · Underparameterized regime, r>1/2test-risk scaling exponent: ℓ* = 1/(1+α(2r−1)) for 1/2<r<1; ℓ* = 1/(1+α) for r>1No clear effect

Surprising findings

Limitations

Experimental setup

Datasets: CIFAR-10 (binarized) MNIST (binarized) synthetic power-law Gaussian data

Benchmarks: binarized CIFAR-10 MNIST

Metrics: test risk (MSE) 0-1 classification error scaling exponents

Baselines: single RFRR model with M features

Builds on: random-feature ridge regression deterministic equivalent risk estimates Gaussian universality

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