pith. sign in

arxiv: 1809.09087 · v2 · pith:6E2CSCSInew · submitted 2018-09-24 · 💻 cs.LG · cs.NE· stat.ML

Implicit Maximum Likelihood Estimation

classification 💻 cs.LG cs.NEstat.ML
keywords likelihoodimplicitmodelsfunctioncannotcapacityconditionsdata
0
0 comments X
read the original abstract

Implicit probabilistic models are models defined naturally in terms of a sampling procedure and often induces a likelihood function that cannot be expressed explicitly. We develop a simple method for estimating parameters in implicit models that does not require knowledge of the form of the likelihood function or any derived quantities, but can be shown to be equivalent to maximizing likelihood under some conditions. Our result holds in the non-asymptotic parametric setting, where both the capacity of the model and the number of data examples are finite. We also demonstrate encouraging experimental results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. AutoSpeed: Annotation-Free Stage-Adaptive Motion Speed Learning for Robot Manipulation

    cs.RO 2026-07 unverdicted novelty 6.0

    AutoSpeed optimizes visuomotor policies over candidate trajectories at varying speeds using a composite cost of prediction error versus horizon length, with DCT-based modulation, yielding shorter execution times and h...

  2. Chronos: A Physics-Informed Full-History Framework for Non-Markovian Long-Horizon Manipulation

    cs.RO 2026-06 unverdicted novelty 6.0

    Chronos elevates full observation history to the policy's latent state via selective SSM tokens and a Schrödinger-inspired acceleration bridge, achieving large gains on memory-dependent robot tasks with fewer parameters.

  3. One Pass Is Not Enough: Recursive Latent Refinement for Generative Models

    cs.CV 2026-05 unverdicted novelty 6.0

    RTM uses iterative refinement of latent codes in generative models to improve both precision and recall alongside competitive FID scores on CIFAR-10, CelebA-HQ, and few-shot datasets.