atlas

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

How Good Are Low-Rank Approximations in Gaussian Process Regression?

AAAI 2022 · Learning theory and algorithms › Kernels and regression theory · approach: RKHS kernel methods · 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
Use Mercer truncation instead of random Fourier features at the same rankGP regression · Seven UCI datasetsNLPDHelped
Use Mercer truncation instead of sparse GP regressionGP regression · Seven UCI datasetsNLPDMixed
Increase rank from 6 to 300FGP and MGP · Seven UCI datasetsNLPDHelped
Use Mercer truncation rather than random Fourier features at fixed rankGaussian-kernel GP · Simulated dataKL divergenceHelped
Use Mercer truncation for a Gaussian kernel rather than a Matérn kernelGP regression · Simulated dataKL divergenceHelped
Use fewer Mercer components (lower rank) rather than more componentsMercer GP · Real-data benchmarksNLPDMixed

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