B1075
Title: Optimal subsampling algorithms for big data generalized linear models
Authors: HaiYing Wang - University of Connecticut (United States) [presenting]
Abstract: To fast approximate the maximum likelihood estimator with massive data, an Optimal Subsampling Method has been previously proposed under the A-optimality Criterion (OSMAC) for logistic regression. The scope of the OSMAC framework is extended to include generalized linear models with canonical link functions. The consistency and asymptotic normality of the estimator from a general subsampling algorithm are established, and optimal subsampling probabilities under the A- and L-optimality criteria are derived. Furthermore, using Frobenius norm matrix concentration inequality, finite sample properties of the subsample estimator based on optimal subsampling probabilities are derived. Since the optimal subsampling probabilities depend on the full data estimate, an adaptive two-step algorithm is developed. Asymptotic normality and optimality of the estimator from this adaptive algorithm are established. The proposed methods are illustrated and evaluated through numerical experiments on simulated and real datasets.
