Uncertainty quantification for distributed regression
Not on the map. Why?
Abstract (arXiv)
The ever-growing size of the datasets renders well-studied learning techniques, such as Kernel Ridge Regression, inapplicable, posing a serious computational challenge. Divide-and-conquer is a common remedy, suggesting to split the dataset into disjoint partitions, obtain the local estimates and average them, it allows to scale-up an otherwise ineffective base approach. In the current study we suggest a fully data-driven approach to quantify uncertainty of the averaged estimator. Namely, we construct simultaneous element-wise confidence bands for the predictions yielded by the averaged estimator on a given deterministic prediction set. The novel approach features rigorous theoretical guaranties for a wide class of base learners with Kernel Ridge regression being a special case. As a by-product of our analysis we also obtain a sup-norm consistency result for the divide-and-conquer Kernel Ridge Regression. The simulation study supports the theoretical findings.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 40 references that are in the map. First posted on arXiv 24 May 2021.
Builds on
7 of 40 references.
References · 7
- 2015Less is More: Nystr"om Computational Regularizationcited by 91
- 2015Distributed Gaussian Processescited by 84
- 2016Distributed learning with regularized least squarescited by 42
- 2017Frequentist coverage and sup-norm convergence rate in Gaussian process regressioncited by 17
- 2014On the Optimality of Averaging in Distributed Statistical Learningcited by 15
- 2017Bayesian model selection consistency and oracle inequality with intractable marginal likelihoodcited by 4
- 2017Nonparametric Inference via Bootstrapping the Debiased Estimatorcited by 1
Built on by
Not cited yet.