How to show a probabilistic model is better

02/11/2015
by   Mithun Chakraborty, et al.
0

We present a simple theoretical framework, and corresponding practical procedures, for comparing probabilistic models on real data in a traditional machine learning setting. This framework is based on the theory of proper scoring rules, but requires only basic algebra and probability theory to understand and verify. The theoretical concepts presented are well-studied, primarily in the statistics literature. The goal of this paper is to advocate their wider adoption for performance evaluation in empirical machine learning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2020

Formal modeling and performance evaluation for hybrid systems:a probabilistic hybrid process algebra-based approach

Probabilistic behavior is omnipresent in computer controlled systems, in...
research
01/23/2022

Machine Learning Symmetry

We review recent work in machine learning aspects of conformal field the...
research
11/06/2017

On the proper treatment of improper distributions

The axiomatic foundation of probability theory presented by Kolmogorov h...
research
09/17/2022

A review of probabilistic forecasting and prediction with machine learning

Predictions and forecasts of machine learning models should take the for...
research
07/27/2023

On the impossibility of discovering a formula for primes using AI

The present work explores the theoretical limits of Machine Learning (ML...
research
01/30/2023

On Second-Order Scoring Rules for Epistemic Uncertainty Quantification

It is well known that accurate probabilistic predictors can be trained t...
research
07/20/2022

An Introduction to Modern Statistical Learning

This work in progress aims to provide a unified introduction to statisti...

Please sign up or login with your details

Forgot password? Click here to reset