Log In Sign Up

Rational partition models under iterative proportional scaling

by   Jane Ivy Coons, et al.

In this work we investigate partition models, the subset of log-linear models for which one can perform the iterative proportional scaling (IPS) algorithm to numerically compute the maximum likelihood estimate (MLE). Partition models include families of models such as hierarchical models and balanced, stratified staged trees. We define a sufficient condition, called the Generalized Running Intersection Property (GRIP), on the matrix representation of a partition model under which IPS algorithm produces the exact MLE in one cycle. Additionally we connect the GRIP to the toric fiber product and to previous results for hierarchical models and balanced, stratified staged trees. This leads to a characterization of balanced, stratified staged trees in terms of the GRIP.


page 1

page 2

page 3

page 4


Quasi-independence models with rational maximum likelihood estimates

We classify the two-way independence quasi-independence models (or indep...

A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees

We present an algorithm that allows for find-closest-point and kNN-style...

Iterative proportional scaling revisited: a modern optimization perspective

This paper revisits the classic iterative proportional scaling (IPS) fro...

On the maximum likelihood estimation in general log-linear models

General log-linear models specified by non-negative integer design matri...

Approximation algorithms for maximally balanced connected graph partition

Given a simple connected graph G = (V, E), we seek to partition the vert...

Families of polytopes with rational linear precision in higher dimensions

In this article we introduce a new family of lattice polytopes with rati...

Compact Representation of Uncertainty in Hierarchical Clustering

Hierarchical clustering is a fundamental task often used to discover mea...