Data driven weak universal consistency
N. Santhanam, V. Anantharam, and W. Szpankowski

TL;DR
This paper introduces a new framework for analyzing estimators that are only pointwise consistent, allowing the inference of model accuracy directly from data, which broadens the applicability of estimation methods in complex model classes.
Contribution
It proposes a novel data-derived analysis framework that enables assessment of estimator performance without uniform guarantees, focusing on rich models with only pointwise consistency.
Findings
Framework applied to lossless compression problem
Estimates of model accuracy can be inferred from data
Broad applicability to complex estimation problems
Abstract
Many current applications in data science need rich model classes to adequately represent the statistics that may be driving the observations. But rich model classes may be too complex to admit estimators that converge to the truth with convergence rates that can be uniformly bounded over the entire collection of probability distributions comprising the model class, i.e. it may be impossible to guarantee uniform consistency of such estimators as the sample size increases. In such cases, it is conventional to settle for estimators with guarantees on convergence rate where the performance can be bounded in a model-dependent way, i.e. pointwise consistent estimators. But this viewpoint has the serious drawback that estimator performance is a function of the unknown model within the model class that is being estimated, and is therefore unknown. Even if an estimator is consistent, how well…
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 Algorithms · Statistical Methods and Inference · Distributed Sensor Networks and Detection Algorithms
