Picture for Steven de Rooij

Steven de Rooij

A tutorial on MDL hypothesis testing for graph analysis

Add code
Oct 31, 2018
Figure 1 for A tutorial on MDL hypothesis testing for graph analysis
Viaarxiv icon

An Expectation-Maximization Algorithm for the Fractal Inverse Problem

Add code
Jun 30, 2017
Figure 1 for An Expectation-Maximization Algorithm for the Fractal Inverse Problem
Figure 2 for An Expectation-Maximization Algorithm for the Fractal Inverse Problem
Figure 3 for An Expectation-Maximization Algorithm for the Fractal Inverse Problem
Figure 4 for An Expectation-Maximization Algorithm for the Fractal Inverse Problem
Viaarxiv icon

Finding Network Motifs in Large Graphs using Compression as a Measure of Relevance

Add code
Jun 09, 2017
Figure 1 for Finding Network Motifs in Large Graphs using Compression as a Measure of Relevance
Figure 2 for Finding Network Motifs in Large Graphs using Compression as a Measure of Relevance
Figure 3 for Finding Network Motifs in Large Graphs using Compression as a Measure of Relevance
Figure 4 for Finding Network Motifs in Large Graphs using Compression as a Measure of Relevance
Viaarxiv icon

Universal Codes from Switching Strategies

Add code
Nov 26, 2013
Figure 1 for Universal Codes from Switching Strategies
Figure 2 for Universal Codes from Switching Strategies
Figure 3 for Universal Codes from Switching Strategies
Figure 4 for Universal Codes from Switching Strategies
Viaarxiv icon

Follow the Leader If You Can, Hedge If You Must

Add code
Jan 17, 2013
Figure 1 for Follow the Leader If You Can, Hedge If You Must
Figure 2 for Follow the Leader If You Can, Hedge If You Must
Figure 3 for Follow the Leader If You Can, Hedge If You Must
Figure 4 for Follow the Leader If You Can, Hedge If You Must
Viaarxiv icon

Adaptive Hedge

Add code
Oct 28, 2011
Figure 1 for Adaptive Hedge
Viaarxiv icon

Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma

Add code
Jul 07, 2008
Figure 1 for Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma
Viaarxiv icon

Combining Expert Advice Efficiently

Add code
Feb 15, 2008
Figure 1 for Combining Expert Advice Efficiently
Figure 2 for Combining Expert Advice Efficiently
Figure 3 for Combining Expert Advice Efficiently
Figure 4 for Combining Expert Advice Efficiently
Viaarxiv icon

Asymptotic Log-loss of Prequential Maximum Likelihood Codes

Add code
Feb 01, 2005
Figure 1 for Asymptotic Log-loss of Prequential Maximum Likelihood Codes
Viaarxiv icon

An Empirical Study of MDL Model Selection with Infinite Parametric Complexity

Add code
Jan 14, 2005
Figure 1 for An Empirical Study of MDL Model Selection with Infinite Parametric Complexity
Figure 2 for An Empirical Study of MDL Model Selection with Infinite Parametric Complexity
Figure 3 for An Empirical Study of MDL Model Selection with Infinite Parametric Complexity
Figure 4 for An Empirical Study of MDL Model Selection with Infinite Parametric Complexity
Viaarxiv icon