Pith. sign in

REVIEW 4 cited by

Structure Discovery in Nonparametric Regression through Compositional Kernel Search

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1302.4922 v4 pith:3ONNCYUW submitted 2013-02-20 stat.ML cs.LGstat.ME

Structure Discovery in Nonparametric Regression through Compositional Kernel Search

classification stat.ML cs.LGstat.ME
keywords kernelstructuresdiscoverykernelsmethodnonparametricregressionsearch
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Despite its importance, choosing the structural form of the kernel in nonparametric regression remains a black art. We define a space of kernel structures which are built compositionally by adding and multiplying a small number of base kernels. We present a method for searching over this space of structures which mirrors the scientific discovery process. The learned structures can often decompose functions into interpretable components and enable long-range extrapolation on time-series datasets. Our structure search method outperforms many widely used kernels and kernel combination methods on a variety of prediction tasks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. VESTA: Visual Exploration with Statistical Tool Agents

    cs.AI 2026-05 unverdicted novelty 6.0

    VESTA introduces dynamic tool creation for VLMs that outperforms static-tool and no-tool baselines on distribution fitting, time series, and astronomy tasks in the new DAWN benchmark.

  2. Machine Learning Approaches to Building Quantum Circuits for Sets of Matrices

    quant-ph 2026-05 unverdicted novelty 4.0

    Interpretable machine learning yields a universal shortest analytic quantum algorithm for arbitrary diagonal matrices of any size.

  3. Machine Learning Approaches to Building Quantum Circuits for Sets of Matrices

    quant-ph 2026-05 unverdicted novelty 3.0

    Interpretable machine learning is used to extract a universal shortest analytic quantum algorithm for arbitrary diagonal matrices of any size.

  4. Efficient and Principled Scientific Discovery through Bayesian Optimization: A Tutorial

    cs.LG 2026-04 accept novelty 2.0

    Bayesian optimization automates the scientific discovery cycle by modeling observations with surrogate models and using acquisition functions to select experiments that balance known information with new exploration.