Meta-Statistical Learning: Supervised Learning of Statistical Estimators
Maxime Peyrard, Kyunghyun Cho

TL;DR
This paper introduces meta-statistical learning, a supervised neural network-based framework that automates the design of statistical estimators, enabling empirical discovery of estimators for tasks like normality testing and mutual information estimation.
Contribution
It presents a novel amortized learning approach that formulates estimator design as an optimization problem, allowing for empirical, data-driven discovery of statistical estimators.
Findings
Achieved strong results in normality testing and mutual information estimation.
Demonstrated effectiveness with small neural network models.
Provided a new paradigm for automating estimator discovery.
Abstract
Statistical inference, a central tool of science, revolves around the study and the usage of statistical estimators: functions that map finite samples to predictions about unknown distribution parameters. In the frequentist framework, estimators are evaluated based on properties such as bias, variance (for parameter estimation), accuracy, power, and calibration (for hypothesis testing). However, crafting estimators with desirable properties is often analytically challenging, and sometimes impossible, e.g., there exists no universally unbiased estimator for the standard deviation. In this work, we introduce meta-statistical learning, an amortized learning framework that recasts estimator design as an optimization problem via supervised learning. This takes a fully empirical approach to discovering statistical estimators; entire datasets are input to permutation-invariant neural networks,…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification
