TL;DR
This paper introduces a fast, scalable method for likelihood inference in exponential families where the maximum likelihood estimator (MLE) does not exist traditionally, by leveraging convergence properties of likelihood sequences and the Fisher information matrix.
Contribution
The authors develop a new methodology that efficiently finds the MLE in the completion of exponential families, improving speed over existing linear programming approaches.
Findings
Method is faster than existing algorithms for large problems.
Provides confidence intervals when the MLE exists in the completion.
Demonstrated on multiple real-world examples.
Abstract
In a regular full exponential family, the maximum likelihood estimator (MLE) need not exist in the traditional sense. However, the MLE may exist in the completion of the exponential family. Existing algorithms for finding the MLE in the completion solve many linear programs; they are slow in small problems and too slow for large problems. We provide new, fast, and scalable methodology for finding the MLE in the completion of the exponential family. This methodology is based on conventional maximum likelihood computations which come close, in a sense, to finding the MLE in the completion of the exponential family. These conventional computations construct a likelihood maximizing sequence of canonical parameter values which goes uphill on the likelihood function until they meet a convergence criteria. Nonexistence of the MLE in this context results from a degeneracy of the canonical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
