Approximate selective inference via maximum likelihood

02/21/2019
by   Snigdha Panigrahi, et al.
0

We consider an approximate version of the conditional approach to selective inference, exploiting the use of randomness for a more efficient use of information in data during inference. Approximation is used to bypass potentially expensive MCMC sampling from conditional distributions in moderate dimensions. In the current paper, we address the problem of computationally-tractable inference in many practical scenarios with more than one exploratory query conducted on the data to define and perhaps, redefine models and associated parameters. At the core of our maximum-likelihood based method is a convex optimization problem, motivated by a large-deviations bound from Panigrahi (2016). The solution to this optimization leads to an approximate pivot, yielding valid post-selective inference across a wide range of signal regimes. Efficient by orders of magnitude than MCMC sampling, adjusting for selection post multiple exploratory queries via our proposal involves solving only a single, tractable optimization-- which takes a separable form across queries. A much appealing feature of our method is that it allows the data analyst to pose several questions of the data before forming a target of interest, with questions being derived from a very general class of convex learning programs. Through an in-depth simulation analysis, we illustrate promise of our approach and provide comparisons with other post-selective methods in both randomized and non-randomized paradigms of inference.

READ FULL TEXT

page 23

page 24

page 28

research
06/24/2023

Selective inference using randomized group lasso estimators for general models

Selective inference methods are developed for group lasso estimators for...
research
03/13/2013

Reformulating Inference Problems Through Selective Conditioning

We describe how we selectively reformulate portions of a belief network ...
research
08/20/2023

An Exact Sampler for Inference after Polyhedral Model Selection

Inference after model selection presents computational challenges when d...
research
05/27/2022

Selective Inference for Sparse Multitask Regression with Applications in Neuroimaging

Multi-task learning is frequently used to model a set of related respons...
research
12/19/2012

A Practical Algorithm for Topic Modeling with Provable Guarantees

Topic models provide a useful method for dimensionality reduction and ex...
research
09/30/2015

Maximum Likelihood Learning With Arbitrary Treewidth via Fast-Mixing Parameter Sets

Inference is typically intractable in high-treewidth undirected graphica...
research
12/18/2022

Locally Simultaneous Inference

Selective inference is the problem of giving valid answers to statistica...

Please sign up or login with your details

Forgot password? Click here to reset