Nonparametric Estimation and On-Line Prediction for General Stationary Ergodic Sources
Joe Suzuki

TL;DR
This paper introduces a nonparametric, measure-theoretic learning algorithm for online prediction of stationary ergodic sources, effective for both discrete and continuous data without requiring a density function.
Contribution
It presents a novel histogram-based estimator that converges for general stationary ergodic sources, extending nonparametric prediction methods to broader classes of sources.
Findings
Estimator converges for discrete and continuous sources.
No need for probability density functions in continuous case.
Measure-theoretic analysis guarantees convergence of Kullback-Leibler divergence.
Abstract
We proposed a learning algorithm for nonparametric estimation and on-line prediction for general stationary ergodic sources. We prepare histograms each of which estimates the probability as a finite distribution, and mixture them with weights to construct an estimator. The whole analysis is based on measure theory. The estimator works whether the source is discrete or continuous. If it is stationary ergodic, then the measure theoretically given Kullback-Leibler information divided by the sequence length converges to zero as goes to infinity. In particular, for continuous sources, the method does not require existence of a probability density function.
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 · Algorithms and Data Compression · Computability, Logic, AI Algorithms
