The need for feasible inference in Probabilistic Graphical Models (PGMs) has lead to tractable models like Sum-Product Networks (SPNs). Their highly expressive power and their abil...
Antonio Vergari, Nicola Di Mauro, Floriana Esposit...
Analyzing multimedia data is a challenging problem due to the quantity and complexity of such data. Mining for frequently recurring patterns is a task often ran to help discovering...
This paper studies precision matrix estimation for multiple related Gaussian graphical models from a dataset consisting of different classes, based upon the formulation of this pro...
In machine learning, hyperparameter optimization is a challenging task that is usually approached by experienced practitioners or in a computationally expensive brute-force manner ...
Nicolas Schilling, Martin Wistuba, Lucas Drumond, ...
When confronted to a clustering problem, one has to choose which algorithm to run. Building a system that automatically chooses an algorithm for a given task is the algorithm selec...
Dynamic Time Warping (DTW) is considered as a robust measure to compare numerical time series when some time elasticity is required. Even though its initial formulation can be slow...
Abstract. Approximate inference in large and densely connected graphical models is a challenging but highly relevant problem. Belief propagation, as a method for performing approxi...
Christian Knoll, Michael Rath, Sebastian Tschiatsc...
Real-world planning problems frequently involve mixtures of continuous and discrete state variables and actions, and are formulated in environments with an unknown number of object...
Abstract. Astrophysical experiments produce Big Data which need efficient and e↵ective data analytics. In this paper we present a general data analysis process which has been su...
We present a general formulation of metric learning for co-embedding, where the goal is to relate objects from different sets. The framework allows metric learning to be applied to...