Conference Agenda

Algebraic Statistics

Chair(s): Jose Israel Rodriguez (UW Madison), Elizabeth Gross (University of Hawaiʻi at Mānoa)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Testing model fit for networks: algebraic statistics of mixture models and beyond

Sonja Petrovic
IIT

Oriented Gaussoids

Thomas Kahle
OvGU Magdeburg

Ideals of Gaussian Graphical Models

Seth Sullivant
NCSU

Combinatorial matrix theory in structural equation models

Marc Harkonen
Georgia Tech

Graphical Models

Chair(s): Elina Robeva (Massachusetts Institute of Technology, United States of America)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Brownian motion tree models are toric

Piotr Zwiernik
Universitat Pompeu Fabra

Algebra and statistical learning for inferring phylogenetic networks

Elizabeth Gross
University of Hawaii at Manoa

Geometry of max-linear graphical models

Carlos Amendola
Technical University Munich

Maximum Likelihood Estimation of Toric Fano Varieties motivated by phylogenetics

Dimitra Kosta
University of Glasgow

Algebraic Statistics

Chair(s): Jose Israel Rodriguez (UW Madison), Elizabeth Gross (University of Hawaiʻi at Mānoa)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Moment Varieties of Measures on Polytopes

Kathlén Kohn
University of Oslo

The stratification of the maximum likelihood degree for toric varieties

Serkan Hosten
SFSU

Nested Determinantal Constraints in Linear Structural Equation Models

Elina Robeva
MIT

Graphical Models

Chair(s): Elina Robeva (Massachusetts Institute of Technology, United States of America)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Interventional Markov Equivalence for Mixed Graph Models

Liam Solus
KTH Royal Institute of Technology

Sequential Monte Carlo-based inference in decomposable graphical models

Jimmy Olsson
KTH Royal Institute of Technology

CausalKinetiX: Learning stable structures in kinetic systems

Jonas Peters
University of Copenhagen

Autoencoders memorize training images

Caroline Uhler
MIT

Latent graphical models

Chair(s): Piotr Zwiernik (Universitat Pompeu Fabra, Spain)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Representation of Markov kernels with deep graphical models

Guido Montúfar
University of California Los Angeles

Conditional independence statements with hidden variables

Fatemeh Mohammadi
Bristol University

Combinatorics and algorithms in decision and reason

Chair(s): Liam Solus (KTH Royal Institute of Technology, Sweden), Svante Linusson (KTH Royal Institute of Technology)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

(Machine) Learning Non-Linear Algebra

Jesus De Loera
University of California, Davis

Network Flows in Semi-Supervised Learning via Total Variation Minimization

Alexander Jung
Aalto University

Scalably vertex-programmable ideological forests from certain political twitterverses around US (2016), UK(2017) and Swedish (2018) national elections

Raazesh Sainudiin
Uppsala University

The Kingman Coalescent as a density on a space of trees

Lena Walter
Freie Universität Berlin

Positive and negative association

Chair(s): Caroline Uhler (MIT), Cynthia Vinzant (North Carolina State)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Negative dependence and sampling

Stephanie Jegelka
MIT

Log-concave polynomials: Polynomials that a drunkard can (almost) evaluate

Nima Anari¹, Kuikui Liu², Shayan Oveis Gharan², Cynthia Vinzant^3
1Stanford, ²U. Washington, ³North Carolina State

Total positivity in structured binary distributions

Steffen Lauritzen¹, Caroline Uhler², Piotr Zwiernik^3
1University of Copenhagen, ²MIT, ³Universitat Pompeu Fabra

Geometric problems in non-parametric statistics

Elina Robeva¹, Bernd Sturmfels², Ngoc Tran³, Caroline Uhler^1
1MIT, ²MPI Leipzig, UC Berkeley, ³U Texas, Austin

Algebro-geometric methods for social network modelling

Chair(s): Kayvan Sadeghi (University College London, United Kingdom)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Goodness-of-fit testing for log-linear network models

Despina Stasi
Illinois Institute of Technology

Cores, shell indices and the degeneracy of a graph limit

Johannes Rauh
Max-Plack Institute

On Exchangeability in Network Models

Kayvan Sadeghi
University College London, United Kingdom

Combinatorics and algorithms in decision and reason

Chair(s): Liam Solus (KTH Royal Institute of Technology, Sweden), Svante Linusson (KTH Royal Institute of Technology)

(25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise)

Stability and Convergence Trade-off of Iterative Optimization Algorithms

Yuansi Chen
UC Berkeley

Probabilistic tensors and opportunistic Boolean matrix multiplication

Petteri Kaski
Aalto University

On attempts to characterize facets of the chordal graph polytope

Milan Studeny
Academy of Sciences of the Czech Republic