back to list

Project: Complexity of MAP in simple mixture models

Description

This is a theoretical project that will connect

Minimizing Low-Rank Models of High-Order Tensors: Hardness, Span, Tight Relaxation, and Applications (https://ieeexplore.ieee.org/document/10342630)

and

Almost No News on the Complexity of MAP in Bayesian Networks (https://proceedings.mlr.press/v138/campos20a.html) 

generating new theoretical results and fixing imprecisions on existing one. It requires a student with good background and interest in computational complexity.

Details

Supervisor

Cassio de Campos

Interested?

Get in contact