Maximum Probability Theorem: A Framework for Probabilistic Learning
Amir Emad Marvasti, Ehsan Emad Marvasti, Ulas Bagci, Hassan Foroosh

TL;DR
This paper introduces a novel probabilistic learning framework based on the Maximum Probability Theorem, which quantifies model probabilities without relying on priors, offering a new perspective on model inference.
Contribution
The paper develops a theoretical framework for probabilistic learning that defines models as events with quantifiable probabilities, independent of prior assumptions, and clarifies the nature of objective functions.
Findings
Models are defined as events with quantifiable probabilities.
Probability measures are invariant to reparameterization.
The framework provides a new interpretation of objective functions in probabilistic learning.
Abstract
We present a theoretical framework of probabilistic learning derived by Maximum Probability (MP) Theorem shown in the current paper. In this probabilistic framework, a model is defined as an event in the probability space, and a model or the associated event -- either the true underlying model or the parameterized model -- have a quantified probability measure. This quantification of a model's probability measure is derived by the MP Theorem, in which we have shown that an event's probability measure has an upper-bound given its conditional distribution on an arbitrary random variable. Through this alternative framework, the notion of model parameters is encompassed in the definition of the model or the associated event. Therefore, this framework deviates from the conventional approach of assuming a prior on the model parameters. Instead, the regularizing effects of assuming prior over…
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.
