Portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2
Published in GRaM Workshop @ ICML 2024, 2024
Latent space geometry provides a rigorous and empirically valuable framework for interacting with the latent variables of deep generative models. This approach reinterprets Euclidean latent spaces as Riemannian through a pull-back metric, allowing for a standard differential geometric analysis of the latent space. Unfortunately, data manifolds are generally compact and easily disconnected or filled with holes, suggesting a topological mismatch to the Euclidean latent space. The most established solution to this mismatch is to let uncertainty be a proxy for topology, but in neural network models, this is often realized through crude heuristics that lack principle and generally do not scale to high-dimensional representations. We propose using ensembles of decoders to capture model uncertainty and show how to easily compute geodesics on the associated expected manifold. Empirically, we find this simple and reliable, thereby coming one step closer to easy-to-use latent geometries.
Recommended citation: Syrota, Stas, Pablo Moreno-Munoz, and Søren Hauberg. "Decoder ensembling for learned latent geometries." arXiv preprint arXiv:2408.07507 (2024).
Download Paper
Published:
This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!
Undergraduate course, University of Copenhagen, Department of Mathematics, 2019
Master's level course, University of Copenhagen, Department of Computer Science, 2020
Master's level course, Technical University of Denmark, Department of Mathematics and Computer Science, 2023
The purpose of the course is two-fold. First of all, the goal is to equip students with a deeper theoretical understanding of probabilistic machine learning and to enable them to read and understand the newest research literature in the field. Second, to enable students to discuss probabilistic models for practical problems and to discuss and apply appropriate inference algorithms.
Master's level course, Technical University of Denmark, Department of Mathematics and Computer Science, 2023
principal component analysis. Similarity measures and summary statistics. Visualization and interpretation of models. Overfitting and generalization. Classification (decision trees, nearest neighbor, naive Bayes, neural networks, and ensemble methods.) Linear regression. Clustering (k-means, hierarchical clustering, and mixture models.) Association rules. Density estimation and outlier detection. Applications in a broad range of engineering sciences.