Efficient basis selection for smoothing splines via rotated lattices

DOI10.1002/STA4.581MaRDI QIDQ6548830FDOQ6548830

Huaimin Diao, Yubin Tian, Mengtong Ai, Jun Yu

Publication date: 3 June 2024

Published in: Stat (Search for Journal in Brave)

zbMATH Keywords

massive datasmoothing splinerotated latticeprojective uniformityspace-filling basis selection

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Title not available (Why is that?)
• Maximum projection designs for computer experiments
• Variable Selection and Model Building via Likelihood Basis Pursuit
• Hybrid Adaptive Splines
• Penalized likelihood regression: General formulation and efficient approximation
• A note on optimal unimodular lattices
• Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
• Smoothing Spline ANOVA Models
• Efficient computation of smoothing splines via adaptive basis sampling
• Title not available (Why is that?)
• Soft sensors for monitoring and control of industrial processes.
• More efficient approximation of smoothing splines via space-filling basis selection
• Divide and Recombine Approaches for Fitting Smoothing Spline Models with Large Datasets

This page was built for publication: Efficient basis selection for smoothing splines via rotated lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548830)