TY - JOUR A1 - Hanik, Martin A1 - Hege, Hans-Christian A1 - von Tycowicz, Christoph T1 - Bi-invariant Dissimilarity Measures for Sample Distributions in Lie Groups JF - SIAM Journal on Mathematics of Data Science N2 - Data sets sampled in Lie groups are widespread, and as with multivariate data, it is important for many applications to assess the differences between the sets in terms of their distributions. Indices for this task are usually derived by considering the Lie group as a Riemannian manifold. Then, however, compatibility with the group operation is guaranteed only if a bi-invariant metric exists, which is not the case for most non-compact and non-commutative groups. We show here that if one considers an affine connection structure instead, one obtains bi-invariant generalizations of well-known dissimilarity measures: a Hotelling $T^2$ statistic, Bhattacharyya distance and Hellinger distance. Each of the dissimilarity measures matches its multivariate counterpart for Euclidean data and is translation-invariant, so that biases, e.g., through an arbitrary choice of reference, are avoided. We further derive non-parametric two-sample tests that are bi-invariant and consistent. We demonstrate the potential of these dissimilarity measures by performing group tests on data of knee configurations and epidemiological shape data. Significant differences are revealed in both cases. Y1 - 2022 U6 - https://doi.org/10.1137/21M1410373 VL - 4 IS - 4 SP - 1223 EP - 1249 ER - TY - CHAP A1 - Harth, Philipp A1 - Vohra, Sumit A1 - Udvary, Daniel A1 - Oberlaender, Marcel A1 - Hege, Hans-Christian A1 - Baum, Daniel T1 - A Stratification Matrix Viewer for Analysis of Neural Network Data T2 - Eurographics Workshop on Visual Computing for Biology and Medicine (VCBM) N2 - The analysis of brain networks is central to neurobiological research. In this context the following tasks often arise: (1) understand the cellular composition of a reconstructed neural tissue volume to determine the nodes of the brain network; (2) quantify connectivity features statistically; and (3) compare these to predictions of mathematical models. We present a framework for interactive, visually supported accomplishment of these tasks. Its central component, the stratification matrix viewer, allows users to visualize the distribution of cellular and/or connectional properties of neurons at different levels of aggregation. We demonstrate its use in four case studies analyzing neural network data from the rat barrel cortex and human temporal cortex. Y1 - 2022 U6 - https://doi.org/10.2312/vcbm.20221194 CY - Vienna, Austria ER - TY - JOUR A1 - Udvary, Daniel A1 - Harth, Philipp A1 - Macke, Jakob H. A1 - Hege, Hans-Christian A1 - de Kock, Christiaan P. J. A1 - Sakmann, Bert A1 - Oberlaender, Marcel T1 - The Impact of Neuron Morphology on Cortical Network Architecture JF - Cell Reports N2 - The neurons in the cerebral cortex are not randomly interconnected. This specificity in wiring can result from synapse formation mechanisms that connect neurons depending on their electrical activity and genetically defined identity. Here, we report that the morphological properties of the neurons provide an additional prominent source by which wiring specificity emerges in cortical networks. This morphologically determined wiring specificity reflects similarities between the neurons’ axo-dendritic projections patterns, the packing density and cellular diversity of the neuropil. The higher these three factors are the more recurrent is the topology of the network. Conversely, the lower these factors are the more feedforward is the network’s topology. These principles predict the empirically observed occurrences of clusters of synapses, cell type-specific connectivity patterns, and nonrandom network motifs. Thus, we demonstrate that wiring specificity emerges in the cerebral cortex at subcellular, cellular and network scales from the specific morphological properties of its neuronal constituents. Y1 - 2022 U6 - https://doi.org/10.1016/j.celrep.2022.110677 VL - 39 IS - 2 ER - TY - GEN A1 - Sagnol, Guillaume A1 - Hege, Hans-Christian A1 - Weiser, Martin T1 - Using sparse kernels to design computer experiments with tunable precision N2 - Statistical methods to design computer experiments usually rely on a Gaussian process (GP) surrogate model, and typically aim at selecting design points (combinations of algorithmic and model parameters) that minimize the average prediction variance, or maximize the prediction accuracy for the hyperparameters of the GP surrogate. In many applications, experiments have a tunable precision, in the sense that one software parameter controls the tradeoff between accuracy and computing time (e.g., mesh size in FEM simulations or number of Monte-Carlo samples). We formulate the problem of allocating a budget of computing time over a finite set of candidate points for the goals mentioned above. This is a continuous optimization problem, which is moreover convex whenever the tradeoff function accuracy vs. computing time is concave. On the other hand, using non-concave weight functions can help to identify sparse designs. In addition, using sparse kernel approximations drastically reduce the cost per iteration of the multiplicative weights updates that can be used to solve this problem. T3 - ZIB-Report - 16-33 KW - Optimal design of computer experiments KW - Sparse kernels KW - Gaussian Process Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-59605 SN - 1438-0064 ER -