Bures-Wasserstein Geometry

The Bures-Wasserstein distance is a Riemannian distance on the space of positive definite Hermitian matrices and is given by: $d(\Sigma,T) = \left[\text{tr}(\Sigma) + \text{tr}(T) - 2 \text{tr} \left(\Sigma^{1/2}T\Sigma^{1/2}\right)^{1/2}\right]^{1/2}$. This distance function appears in the fields of optimal transport, quantum information, and optimisation theory. In this paper, the geometrical properties of this distance are studied using Riemannian submersions and quotient manifolds. The Riemannian metric and geodesics are derived on both the whole space and the subspace of trace-one matrices. In the first part of the paper a general framework is provided, including different representations of the tangent bundle for the SLD Fisher metric. The last part of the paper unifies up till now independent arguments and results from quantum information theory and optimal transport. The Bures-Wasserstein geometry is related to the Fubini-Study metric and the Wigner-Yanase information

A method for clustering surgical cases to allow master surgical scheduling

Master surgical scheduling can improve manageability and efficiency of operating room departments. This approach cyclically executes a master surgical schedule of surgery types. These surgery types need to be constructed with low variability to be efficient. Each surgery type is scheduled based upon its frequency per cycle. Surgery types that cannot be scheduled repetitively are put together in so-called dummy surgeries. Narrow defined surgery types, with low variability, lead to a large volume of such dummy surgeries that reduce the benefits of a master surgical scheduling approach. In this paper we propose a method, based on Ward's hierarchical cluster method, to obtain surgery types that minimizes the weighted sum of the dummy surgery volume and the variability in resource demand of surgery types. The resulting surgery types (clusters) are thus based on logical features and can be used in master surgical scheduling. The approach is successfully tested on a case study in a regional hospital.operating room;health care efficiency;master surgical scheduling;Ward's hierarchical cluster method

On the Fisher-Rao Gradient of the Evidence Lower Bound

This article studies the Fisher-Rao gradient, also referred to as the natural gradient, of the evidence lower bound, the ELBO, which plays a crucial role within the theory of the Variational Autonecoder, the Helmholtz Machine and the Free Energy Principle. The natural gradient of the ELBO is related to the natural gradient of the Kullback-Leibler divergence from a target distribution, the prime objective function of learning. Based on invariance properties of gradients within information geometry, conditions on the underlying model are provided that ensure the equivalence of minimising the prime objective function and the maximisation of the ELBO

Limiting the valence: advancements and new perspectives on patchy colloids, soft functionalized nanoparticles and biomolecules

Limited bonding valence, usually accompanied by well-defined directional interactions and selective bonding mechanisms, is nowadays considered among the key ingredients to create complex structures with tailored properties: even though isotropically interacting units already guarantee access to a vast range of functional materials, anisotropic interactions can provide extra instructions to steer the assembly of specific architectures. The anisotropy of effective interactions gives rise to a wealth of self-assembled structures both in the realm of suitably synthesized nano- and micro-sized building blocks and in nature, where the isotropy of interactions is often a zero-th order description of the complicated reality. In this review, we span a vast range of systems characterized by limited bonding valence, from patchy colloids of new generation to polymer-based functionalized nanoparticles, DNA-based systems and proteins, and describe how the interaction patterns of the single building blocks can be designed to tailor the properties of the target final structures

Inversion of Bayesian Networks

Variational autoencoders and Helmholtz machines use a recognition network (encoder) to approximate the posterior distribution of a generative model (decoder). In this paper we study the necessary and sufficient properties of a recognition network so that it can model the true posterior distribution exactly. These results are derived in the general context of probabilistic graphical modelling / Bayesian networks, for which the network represents a set of conditional independence statements. We derive both global conditions, in terms of d-separation, and local conditions for the recognition network to have the desired qualities. It turns out that for the local conditions the property perfectness (for every node, all parents are joined) plays an important role

Facility location on terrains

Given a terrain defined as a piecewise-linear function with n triangles, and m point sites on it, we would like to identify the location on the terrain that minimizes the maximum distance to the sites. The distance is measured as the length of the Euclidean shortest path along the terrain. To simplify the problem somewhat, we extend the terrain to (the surface of) a polyhedron. To compute the optimum placement, we compute the furthest-site Voronoi diagram of the sites on the polyhedron. The diagram has maximum combinatorial complexity Q(mn2), and the algorithm runs in O(mn² log²m log n) time

Geometric algorithms for geographic information systems

A geographic information system (GIS) is a software package for storing geographic data and performing complex operations on the data. Examples are the reporting of all land parcels that will be flooded when a certain river rises above some level, or analyzing the costs, benefits, and risks involved with the development of industrial activities at some place. A substantial part of all activities performed by a GIS involves computing with the geometry of the data, such as location, shape, proximity, and spatial distribution. The amount of data stored in a GIS is usually very large, and it calls for efficient methods to store, manipulate, analyze, and display such amounts of data. This makes the field of GIS an interesting source of problems to work on for computational geometers. In chapters 2-5 of this thesis we give new geometric algorithms to solve four selected GIS problems.These chapters are preceded by an introduction that provides the necessary background, overview, and definitions to appreciate the following chapters. The four problems that we study in chapters 2-5 are the following: Subdivision traversal: we give a new method to traverse planar subdivisions without using mark bits or a stack. Contour trees and seed sets: we give a new algorithm for generating a contour tree for d-dimensional meshes, and use it to determine a seed set of minimum size that can be used for isosurface generation. This is the first algorithm that guarantees a seed set of minimum size. Its running time is quadratic in the input size, which is not fast enough for many practical situations. Therefore, we also give a faster algorithm that gives small (although not minimal) seed sets. Settlement selection: we give a number of new models for the settlement selection problem. When settlements, such as cities, have to be displayed on a map, displaying all of them may clutter the map, depending on the map scale. Choices have to be made which settlements are selected, and which ones are omitted. Compared to existing selection methods, our methods have a number of favorable properties. Facility location: we give the first algorithm for computing the furthest-site Voronoi diagram on a polyhedral terrain, and show that its running time is near-optimal. We use the furthest-site Voronoi diagram to solve the facility location problem: the determination of the point on the terrain that minimizes the maximal distance to a given set of sites on the terrain

Annotatie bij Hoge Raad 24 september 2021, ECLI:NL:HR:2021:1359, Jurisprudentie Onderneming & Recht 2021/307

Hoge Raad2021/307Coherent privaatrech