Learning Kolmogorov Models for Binary Random Variables

06/06/2018
by   Hadi Ghauch, et al.
0

We summarize our recent findings, where we proposed a framework for learning a Kolmogorov model, for a collection of binary random variables. More specifically, we derive conditions that link outcomes of specific random variables, and extract valuable relations from the data. We also propose an algorithm for computing the model and show its first-order optimality, despite the combinatorial nature of the learning problem. We apply the proposed algorithm to recommendation systems, although it is applicable to other scenarios. We believe that the work is a significant step toward interpretable machine learning.

READ FULL TEXT

page 6

page 8

research
10/18/2010

The Common Information of N Dependent Random Variables

This paper generalizes Wyner's definition of common information of a pai...
research
03/02/2018

On some discrete random variables arising from recent study on statistical analysis of compressive sensing

The recent paper [27] provides a statistical analysis for efficient dete...
research
09/17/2022

Some stochastic comparison results for frailty and resilience models

Frailty and resilience models provide a way to introduce random effects ...
research
06/21/2022

Copula bounds for circular data

We propose the extension of Fréchet-Hoeffding copula bounds for circular...
research
06/22/2023

Robust Statistical Comparison of Random Variables with Locally Varying Scale of Measurement

Spaces with locally varying scale of measurement, like multidimensional ...
research
03/15/2022

Comparing two samples through stochastic dominance: a graphical approach

Non-deterministic measurements are common in real-world scenarios: the p...
research
11/24/2021

Lossy Compression of General Random Variables

This paper is concerned with the lossy compression of general random var...

Please sign up or login with your details

Forgot password? Click here to reset