atlas

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

Scalable and adaptive prediction bands with kernel sum-of-squares

NeurIPS 2025 · Learning theory and algorithms › Kernels and regression theory · approach: Kernel regression under shift · 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.

Builds scalable, adaptive split-conformal prediction bands by learning a kernel sum-of-squares scaling function via a representer theorem and an accelerated-gradient dual, and tunes its lengthscale with an HSIC-based local-coverage criterion.

Problem

Standard split conformal prediction yields constant-width bands, lacking adaptivity to local variability, and existing kernel sum-of-squares approaches for learning adaptive bands rely on SDP solvers that scale only to a few hundred samples; tuning kernel lengthscales for test-conditional coverage i

Approach

Learn the rescaling function of the conformal score as a non-negative kernel sum-of-squares, derive a representer theorem and a dual with only n+1 variables solved by accelerated gradient ascent, and tune the scaling-function lengthscale by maximizing HSIC between residuals and the scale function (a bound on local coverage).

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Tune the kernel lengthscale with HSIC rather than MIKernel SoS · Test case 2, n=100lengthscale-selection stabilityHelped
Use HSIC-optimized lengthscale for adaptive score scalingKernel SoS · Test case 1, n=100mean interval widthHelped
Use Kernel SoS instead of heteroscedastic GPSplit conformal prediction · Test case 1, n=100mean interval widthHelped
Use Kernel SoS instead of heteroscedastic GPSplit conformal prediction · Test case 2, n=100mean interval widthHelped
Use Kernel SoS instead of homoscedastic GPSplit conformal prediction · Test case 3, n=100local coverageHelped
Use Kernel SoS instead of GP methodsSplit conformal prediction · Test case 4, n=100mean interval widthHurt
Use the dual solver instead of an off-the-shelf SDP solverKernel SoS · Test case 1, large-scale trainingscalable training size: SDP: n=200; dual: n=2000Helped
Use an overly small kernel lengthscale instead of the HSIC-optimized lengthscale (ablation)Kernel SoS · Test case 2, n=100adaptivityHurt
Set a=0 in the symmetric-noise setting (ablation)Kernel SoS · Symmetric-noise test casesRMSENo clear effect
Vary λ₂ while keeping λ₂ positive (ablation)Kernel SoS · Hyperparameter studymean interval widthNo clear effect
Set λ₁=1 (ablation)Kernel SoS · Hyperparameter studysolution shapeNo clear effect
Increase b (ablation)Kernel SoS · Hyperparameter studymean interval widthHelped

Surprising findings

Limitations

Experimental setup

Datasets: synthetic test cases 1-4

Benchmarks: synthetic test cases 1-4

Metrics: mean interval width mutual information R2_SQI local coverage RMSE HSIC solve time

Baselines: CQR rescaled GP (homoscedastic) heteroscedastic GP SDP solver (SCS)

Builds on: kernel sum-of-squares conformalized quantile regression split conformal prediction rlcp

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