title: Foundational Principles for Large-Scale Inference: Illustrations Through Correlation Mining.
abstract: When can reliable inference be drawn in fue "Big Data" context? This paper presents a framework for answering this fundamental question in the context of correlation mining, wifu implications for general large scale inference. In large scale data applications like genomics, connectomics, and eco-informatics fue dataset is often variable-rich but sample-starved: a regime where the numbernof acquired samples (statistical replicates) is far fewer than fue numberpof observed variables (genes, neurons, voxels, or chemical constituents). Much of recent work has focused on understanding the computational complexity of proposed methods for "Big Data". Sample complexity however has received relatively less attention, especially in the setting when the sample sizenis fixed, and the dimensionpgrows without bound. To address fuis gap, we develop a unified statistical framework that explicitly quantifies the sample complexity of various inferential tasks. Sampling regimes can be divided into several categories: 1) the classical asymptotic regime where fue variable dimension is fixed and fue sample size goes to infinity; 2) the mixed asymptotic regime where both variable dimension and sample size go to infinity at comparable rates; 3) the purely high dimensional asymptotic regime where the variable dimension goes to infinity and the sample size is fixed. Each regime has its niche but only the latter regime applies to exa cale data dimension. We illustrate this high dimensional framework for the problem of correlation mining, where it is the matrix of pairwise and partial correlations among the variables fua t are of interest. Correlation mining arises in numerous applications and subsumes the regression context as a special case. we demonstrate various regimes of correlation mining based on the unifying perspective of high dimensional learning rates and sample complexity for different structured covariance models and different inference tasks.
authors.affiliation: University of Michigan, Ann Arbor, MI 48109-2122, USA.
authors.forename: Alfred O
authors.initials: AO
authors.lastname: Hero
authors.affiliation: Stanford University, Stanford, CA 94305-4065, USA.
authors.forename: Bala
authors.initials: B
authors.lastname: Rajaratnam
keywords: Big Data; asymptotic regimes; correlation estimation; correlation mining; correlation screening; correlation selection; graphical models; large scale inference; purely high dimensional; sample complexity; triple asymptotic framework; unifying learning theory