pith. sign in

arxiv: 1606.01473 · v4 · pith:TBEIAEBSnew · submitted 2016-06-05 · 📊 stat.AP · stat.ML

Confidence Intervals for Algorithmic Leveraging in Linear Regression

classification 📊 stat.AP stat.ML
keywords dataconfidenceintervalsalgorithmicleveragingcoverageregressionrepresentative
0
0 comments X
read the original abstract

The age of big data has produced data sets that are computationally expensive to analyze and store. Algorithmic leveraging proposes that we sample observations from the original data set to generate a representative data set and then perform analysis on the representative data set. In this paper, we present efficient algorithms for constructing finite sample confidence intervals for each algorithmic leveraging estimated regression coefficient, with asymptotic coverage guarantees. In simulations, we confirm empirically that the confidence intervals have the desired coverage probabilities, while bootstrap confidence intervals may not.

This paper has not been read by Pith yet.

discussion (0)

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