FBFlorian Beier

Florian Beier

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Florian Beier has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Tangential Fixpoint Iterations for Gromov–Wasserstein Barycenters

    by Florian Beier, Robert Beinert

    The Gromov–Wasserstein (GW) transport problem is a generalization of classic optimal transport, which seeks a transport between two measures while preserving their internal geometry. Due to meeting this theoretical underpinning, it is a valuable tool for the analysis of objects that do not possess a natural embedding or should be studied independently of it. Prime applications can thus be found in, e.g., shape matching, classification, and interpolation tasks. To tackle the latter, one theoretically justified approach is the employment of multimarginal GW transport and GW barycenters, which are Fréchet means with respect to the GW distance. However, because the computation of GW itself already poses a quadratic and nonconvex optimization problem, the determination of GW barycenters is a hard task, and algorithms for their computation are scarce. In this paper, we revisit a known procedure for the determination of Fréchet means in Riemannian manifolds via tangential approximations in the context of GW. We provide a characterization of barycenters in the GW tangent space, which ultimately gives rise to a fixpoint iteration for approximating GW barycenters using multimarginal plans. We propose a relaxation of this fixpoint iteration and show that it monotonously decreases the barycenter loss. In certain cases our proposed method naturally provides us with barycentric embeddings. The resulting algorithm is capable of producing qualitative shape interpolations between multiple 3D shapes with support sizes of over thousands of points in reasonable time. In addition, we verify our method on shape classification and multigraph matching tasks.


  • Open Access

    Tangential Fixpoint Iterations for Gromov-Wasserstein Barycenters

    by Florian Beier, Robert Beinert

    The Gromov-Wasserstein (GW) transport problem is a relaxation of classic optimal transport, which seeks a transport between two measures while preserving their internal geometry. Due to meeting this theoretical underpinning, it is a valuable tool for the analysis of objects that do not possess a natural embedding or should be studied independently of it. Prime applications can thus be found in e.g. shape matching, classification and interpolation tasks. To tackle the latter, one theoretically justified approach is the employment of multi-marginal GW transport and GW barycenters, which are Fréchet means with respect to the GW distance. However, because the computation of GW itself already poses a quadratic and non-convex optimization problem, the determination of GW barycenters is a hard task and algorithms for their computation are scarce. In this paper, we revisit a known procedure for the determination of Fréchet means in Riemannian manifolds via tangential approximations in the context of GW. We provide a characterization of barycenters in the GW tangent space, which ultimately gives rise to a fixpoint iteration for approximating GW barycenters using multi-marginal plans. We propose a relaxation of this fixpoint iteration and show that it monotonously decreases the barycenter loss. In certain cases our proposed method naturally provides us with barycentric embeddings. The resulting algorithm is capable of producing qualitative shape interpolations between multiple 3d shapes with support sizes of over thousands of points in reasonable time. In addition, we verify our method on shape classification and multi-graph matching tasks.

  • Open Access

    Transfer Operators from Batches of Unpaired Points via Entropic Transport Kernels

    by Florian Beier, Hancheng Bi, Clément Sarrazin, Bernhard Schmitzer, Gabriele Steidl

    In this paper, we are concerned with estimating the joint probability of random variables $X$ and $Y$, given $N$ independent observation blocks $(\boldsymbol{x}^i,\boldsymbol{y}^i)$, $i=1,\ldots,N$, each of $M$ samples $(\boldsymbol{x}^i,\boldsymbol{y}^i) = \bigl((x^i_j, y^i_{σ^i(j)}) \bigr)_{j=1}^M$, where $σ^i$ denotes an unknown permutation of i.i.d. sampled pairs $(x^i_j,y_j^i)$, $j=1,\ldots,M$. This means that the internal ordering of the $M$ samples within an observation block is not known. We derive a maximum-likelihood inference functional, propose a computationally tractable approximation and analyze their properties. In particular, we prove a $Γ$-convergence result showing that we can recover the true density from empirical approximations as the number $N$ of blocks goes to infinity. Using entropic optimal transport kernels, we model a class of hypothesis spaces of density functions over which the inference functional can be minimized. This hypothesis class is particularly suited for approximate inference of transfer operators from data. We solve the resulting discrete minimization problem by a modification of the EMML algorithm to take addional transition probability constraints into account and prove the convergence of this algorithm. Proof-of-concept examples demonstrate the potential of our method.

  • Multi-marginal Gromov–Wasserstein transport and barycentres

    by Florian Beier, Robert Beinert, Gabriele Steidl

    Gromov–Wasserstein (GW) distances are combinations of Gromov–Hausdorff and Wasserstein distances that allow the comparison of two different metric measure spaces (mm-spaces). Due to their invariance under measure- and distance-preserving transformations, they are well suited for many applications in graph and shape analysis. In this paper, we introduce the concept of multi-marginal GW transport between a set of mm-spaces as well as its regularized and unbalanced versions. As a special case, we discuss multi-marginal fused variants, which combine the structure information of an mm-space with label information from an additional label space. To tackle the new formulations numerically, we consider the bi-convex relaxation of the multi-marginal GW problem, which is tight in the balanced case if the cost function is conditionally negative definite. The relaxed model can be solved by an alternating minimization, where each step can be performed by a multi-marginal Sinkhorn scheme. We show relations of our multi-marginal GW problem to (unbalanced, fused) GW barycentres and present various numerical results, which indicate the potential of the concept.


  • Open Access

    Gromov-Wasserstein Transfer Operators

    by Florian Beier

    Gromov-Wasserstein (GW) transport is inherently invariant under isometric transformations of the data. Having this property in mind, we propose to estimate dynamical systems by transfer operators derived from GW transport plans, when merely the initial and final states are known. We focus on entropy regularized GW transport, which allows to utilize the fast Sinkhorn algorithm and a spectral clustering procedure to extract coherent structures. Moreover, the GW framework provides a natural quantitative assessment on the shape-coherence of the extracted structures. We discuss fused and unbalanced variants of GW transport for labelled and noisy data, respectively. Our models are verified by three numerical examples of dynamical systems with governing rotational forces.

  • Open Access

    Multi-marginal Approximation of the Linear Gromov-Wasserstein Distance

    by Florian Beier, Robert Beinert

    Recently, two concepts from optimal transport theory have successfully been brought to the Gromov--Wasserstein (GW) setting. This introduces a linear version of the GW distance and multi-marginal GW transport. The former can reduce the computational complexity when computing all GW distances of a large set of inputs. The latter allows for a simultaneous matching of more than two marginals, which can for example be used to compute GW barycenters. The aim of this paper is to show an approximation result which characterizes the linear version as a limit of a multi-marginal GW formulation.

  • Top Cited Papers

    On a Linear Gromov–Wasserstein Distance

    by Florian Beier, Robert Beinert, Gabriele Steidl

    Gromov–Wasserstein distances are generalization of Wasserstein distances, which are invariant under distance preserving transformations. Although a simplified version of optimal transport in Wasserstein spaces, called linear optimal transport (LOT), was successfully used in practice, there does not exist a notion of linear Gromov–Wasserstein distances so far. In this paper, we propose a definition of linear Gromov–Wasserstein distances. We motivate our approach by a generalized LOT model, which is based on barycentric projection maps of transport plans. Numerical examples illustrate that the linear Gromov–Wasserstein distances, similarly as LOT, can replace the expensive computation of pairwise Gromov–Wasserstein distances in applications like shape classification.


  • Open Access

    Unbalanced Multi-marginal Optimal Transport

    by Florian Beier, Johannes von Lindheim, Sebastian Neumayer, Gabriele Steidl

    Entropy-regularized optimal transport and its multi-marginal generalization have attracted increasing attention in various applications, in particular due to efficient Sinkhorn-like algorithms for computing optimal transport plans. However, it is often desirable that the marginals of the optimal transport plan do not match the given measures exactly, which led to the introduction of the so-called unbalanced optimal transport. Since unbalanced methods were not examined for the multi-marginal setting so far, we address this topic in the present paper. More precisely, we introduce the unbalanced multi-marginal optimal transport problem and its dual and show that a unique optimal transport plan exists under mild assumptions. Furthermore, we generalize the Sinkhorn algorithm for regularized unbalanced optimal transport to the multi-marginal setting and prove its convergence. For cost functions decoupling according to a tree, the iterates can be computed efficiently. At the end, we discuss three applications of our framework, namely two barycenter problems and a transfer operator approach, where we establish a relation between the barycenter problem and the multi-marginal optimal transport with an appropriate tree-structured cost function.


  • Short- and long-term outcome after carotid artery stenting with neuroprotection: single-center experience within a prospective registry

    by Christoph H. Spes, Andreas Schwende, Florian Beier, Martin Hug, Ralph Hein, Henning Strohm, Wolfgang Büchele, Mathias C. Haufe, Harald Mudra

    Carotid artery stenting is an alternative method to surgical endarterectomy for treatment of carotid artery stenosis.