MLLGMay 18, 2018

Fisher Efficient Inference of Intractable Models

arXiv:1805.07454v514 citations
Originality Highly original
AI Analysis

This work addresses a fundamental bottleneck in statistical inference for researchers and practitioners dealing with complex, intractable models, offering a novel estimator with theoretical guarantees.

The paper tackles the problem of inferring intractable models where maximum likelihood estimation is infeasible due to normalization terms, by proposing a Discriminative Likelihood Estimator (DLE) derived from KL divergence minimization via density ratio estimation and a Stein operator, proving its consistency and asymptotic efficiency under mild conditions.

Maximum Likelihood Estimators (MLE) has many good properties. For example, the asymptotic variance of MLE solution attains equality of the asymptotic Cram{é}r-Rao lower bound (efficiency bound), which is the minimum possible variance for an unbiased estimator. However, obtaining such MLE solution requires calculating the likelihood function which may not be tractable due to the normalization term of the density model. In this paper, we derive a Discriminative Likelihood Estimator (DLE) from the Kullback-Leibler divergence minimization criterion implemented via density ratio estimation and a Stein operator. We study the problem of model inference using DLE. We prove its consistency and show that the asymptotic variance of its solution can attain the equality of the efficiency bound under mild regularity conditions. We also propose a dual formulation of DLE which can be easily optimized. Numerical studies validate our asymptotic theorems and we give an example where DLE successfully estimates an intractable model constructed using a pre-trained deep neural network.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes