High Dimensional Data Enrichment: Interpretable, Fast, and Data-Efficient

06/11/2018
by   Amir Asiaee T., et al.
0

High dimensional structured data enriched model describes groups of observations by shared and per-group individual parameters, each with its own structure such as sparsity or group sparsity. In this paper, we consider the general form of data enrichment where data comes in a fixed but arbitrary number of groups G. Any convex function, e.g., norms, can characterize the structure of both shared and individual parameters. We propose an estimator for high dimensional data enriched model and provide conditions under which it consistently estimates both shared and individual parameters. We also delineate sample complexity of the estimator and present high probability non-asymptotic bound on estimation error of all parameters. Interestingly the sample complexity of our estimator translates to conditions on both per-group sample sizes and the total number of samples. We propose an iterative estimation algorithm with linear convergence rate and supplement our theoretical analysis with synthetic and real experimental results. Particularly, we show the predictive power of data-enriched model along with its interpretable results in anticancer drug sensitivity analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2017

High Dimensional Structured Superposition Models

High dimensional superposition models characterize observations using pa...
research
01/22/2019

A Fast Iterative Algorithm for High-dimensional Differential Network

Differential network is an important tool to capture the changes of cond...
research
06/07/2023

Efficient sparsity adaptive changepoint estimation

We propose a new, computationally efficient, sparsity adaptive changepoi...
research
03/02/2019

High-Dimensional Learning under Approximate Sparsity: A Unifying Framework for Nonsmooth Learning and Regularized Neural Networks

High-dimensional statistical learning (HDSL) has been widely applied in ...
research
03/10/2015

Learning the Structure for Structured Sparsity

Structured sparsity has recently emerged in statistics, machine learning...
research
01/23/2017

Iterative Thresholding for Demixing Structured Superpositions in High Dimensions

We consider the demixing problem of two (or more) high-dimensional vecto...
research
08/08/2017

Demixing Structured Superposition Signals from Periodic and Aperiodic Nonlinear Observations

We consider the demixing problem of two (or more) structured high-dimens...

Please sign up or login with your details

Forgot password? Click here to reset