Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Orbispaces as differentiable stratified spaces.

ABSTRACT: We present some features of the smooth structure and of the canonical stratification on the orbit space of a proper Lie groupoid. One of the main features is that of Morita invariance of these structures-it allows us to talk about the canonical structure of differentiable stratified space on the orbispace (an object analogous to a separated stack in algebraic geometry) presented by the proper Lie groupoid. The canonical smooth structure on an orbispace is studied mainly via Spallek's framework of differentiable spaces, and two alternative frameworks are then presented. For the canonical stratification on an orbispace, we extend the similar theory coming from proper Lie group actions. We make no claim to originality. The goal of these notes is simply to give a complementary exposition to those available and to clarify some subtle points where the literature can sometimes be confusing, even in the classical case of proper Lie group actions.

SUBMITTER: Crainic M

PROVIDER: S-EPMC5818699 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Orbispaces as differentiable stratified spaces.

Crainic Marius M Mestre João Nuno JN

Letters in mathematical physics 20171101 3

We present some features of the smooth structure and of the canonical stratification on the orbit space of a proper Lie groupoid. One of the main features is that of Morita invariance of these structures-it allows us to talk about the canonical structure of differentiable stratified space on the orbispace (an object analogous to a separated stack in algebraic geometry) presented by the proper Lie groupoid. The canonical smooth structure on an orbispace is studied mainly via Spallek's framework o ...[more]

PMID: 29497239

Similar Datasets

SpikePropamine: Differentiable Plasticity in Spiking Neural Networks.

Project description:The adaptive changes in synaptic efficacy that occur between spiking neurons have been demonstrated to play a critical role in learning for biological neural networks. Despite this source of inspiration, many learning focused applications using Spiking Neural Networks (SNNs) retain static synaptic connections, preventing additional learning after the initial training period. Here, we introduce a framework for simultaneously learning the underlying fixed-weights and the rules governing the dynamics of synaptic plasticity and neuromodulated synaptic plasticity in SNNs through gradient descent. We further demonstrate the capabilities of this framework on a series of challenging benchmarks, learning the parameters of several plasticity rules including BCM, Oja's, and their respective set of neuromodulatory variants. The experimental results display that SNNs augmented with differentiable plasticity are sufficient for solving a set of challenging temporal learning tasks that a traditional SNN fails to solve, even in the presence of significant noise. These networks are also shown to be capable of producing locomotion on a high-dimensional robotic learning task, where near-minimal degradation in performance is observed in the presence of novel conditions not seen during the initial training period.

| S-EPMC8493296 | biostudies-literature

Differentiable rotamer sampling with molecular force fields.

Project description:Molecular dynamics is the primary computational method by which modern structural biology explores macromolecule structure and function. Boltzmann generators have been proposed as an alternative to molecular dynamics, by replacing the integration of molecular systems over time with the training of generative neural networks. This neural network approach to MD samples rare events at a higher rate than traditional MD, however critical gaps in the theory and computational feasibility of Boltzmann generators significantly reduce their usability. Here, we develop a mathematical foundation to overcome these barriers; we demonstrate that the Boltzmann generator approach is sufficiently rapid to replace traditional MD for complex macromolecules, such as proteins in specific applications, and we provide a comprehensive toolkit for the exploration of molecular energy landscapes with neural networks.

| S-EPMC9980192 | biostudies-literature

Differentiable rotamer sampling with molecular force fields.

Project description:Molecular dynamics (MD) is the primary computational method by which modern structural biology explores macromolecule structure and function. Boltzmann generators have been proposed as an alternative to MD, by replacing the integration of molecular systems over time with the training of generative neural networks. This neural network approach to MD enables convergence to thermodynamic equilibrium faster than traditional MD; however, critical gaps in the theory and computational feasibility of Boltzmann generators significantly reduce their usability. Here, we develop a mathematical foundation to overcome these barriers; we demonstrate that the Boltzmann generator approach is sufficiently rapid to replace traditional MD for complex macromolecules, such as proteins in specific applications, and we provide a comprehensive toolkit for the exploration of molecular energy landscapes with neural networks.

| S-EPMC10720392 | biostudies-literature

End-to-End Differentiable Learning of Protein Structure.

Project description:Predicting protein structure from sequence is a central challenge of biochemistry. Co-evolution methods show promise, but an explicit sequence-to-structure map remains elusive. Advances in deep learning that replace complex, human-designed pipelines with differentiable models optimized end to end suggest the potential benefits of similarly reformulating structure prediction. Here, we introduce an end-to-end differentiable model for protein structure learning. The model couples local and global protein structure via geometric units that optimize global geometry without violating local covalent chemistry. We test our model using two challenging tasks: predicting novel folds without co-evolutionary data and predicting known folds without structural templates. In the first task, the model achieves state-of-the-art accuracy, and in the second, it comes within 1-2 Å; competing methods using co-evolution and experimental templates have been refined over many years, and it is likely that the differentiable approach has substantial room for further improvement, with applications ranging from drug discovery to protein design.

| S-EPMC6513320 | biostudies-literature

Parametric-rate inference for one-sided differentiable parameters.

Project description:Suppose one has a collection of parameters indexed by a (possibly infinite dimensional) set. Given data generated from some distribution, the objective is to estimate the maximal parameter in this collection evaluated at the distribution that generated the data. This estimation problem is typically non-regular when the maximizing parameter is non-unique, and as a result standard asymptotic techniques generally fail in this case. We present a technique for developing parametric-rate confidence intervals for the quantity of interest in these non-regular settings. We show that our estimator is asymptotically efficient when the maximizing parameter is unique so that regular estimation is possible. We apply our technique to a recent example from the literature in which one wishes to report the maximal absolute correlation between a prespecified outcome and one of p predictors. The simplicity of our technique enables an analysis of the previously open case where p grows with sample size. Specifically, we only require that log p grows slower than n , where n is the sample size. We show that, unlike earlier approaches, our method scales to massive data sets: the point estimate and confidence intervals can be constructed in O(np) time.

| S-EPMC6075853 | biostudies-literature

Differentiable optimization layers enhance GNN-based mitosis detection.

Project description:Automatic mitosis detection from video is an essential step in analyzing proliferative behaviour of cells. In existing studies, a conventional object detector such as Unet is combined with a link prediction algorithm to find correspondences between parent and daughter cells. However, they do not take into account the biological constraint that a cell in a frame can correspond to up to two cells in the next frame. Our model called GNN-DOL enables mitosis detection by complementing a graph neural network (GNN) with a differentiable optimization layer (DOL) that implements the constraint. In time-lapse microscopy sequences cultured under four different conditions, we observed that the layer substantially improved detection performance in comparison with GNN-based link prediction. Our results illustrate the importance of incorporating biological knowledge explicitly into deep learning models.

| S-EPMC10471751 | biostudies-literature

Physarum Powered Differentiable Linear Programming Layers and Applications.

Project description:Consider a learning algorithm, which involves an internal call to an optimization routine such as a generalized eigenvalue problem, a cone programming problem or even sorting. Integrating such a method as a layer(s) within a trainable deep neural network (DNN) in an efficient and numerically stable way is not straightforward - for instance, only recently, strategies have emerged for eigendecomposition and differentiable sorting. We propose an efficient and differentiable solver for general linear programming problems which can be used in a plug and play manner within DNNs as a layer. Our development is inspired by a fascinating but not widely used link between dynamics of slime mold (physarum) and optimization schemes such as steepest descent. We describe our development and show the use of our solver in a video segmentation task and meta-learning for few-shot learning. We review the existing results and provide a technical analysis describing its applicability for our use cases. Our solver performs comparably with a customized projected gradient descent method on the first task and outperforms the differentiable CVXPY-SCS solver on the second task. Experiments show that our solver converges quickly without the need for a feasible initial point. Our proposal is easy to implement and can easily serve as layers whenever a learning procedure needs a fast approximate solution to a LP, within a larger network.

| S-EPMC8415120 | biostudies-literature

Joint entropy of continuously differentiable ultrasonic waveforms.

Project description:This study is based on an extension of the concept of joint entropy of two random variables to continuous functions, such as backscattered ultrasound. For two continuous random variables, X and Y, the joint probability density p(x,y) is ordinarily a continuous function of x and y that takes on values in a two dimensional region of the real plane. However, in the case where X=f(t) and Y=g(t) are both continuously differentiable functions, X and Y are concentrated exclusively on a curve, γ(t)=(f(t),g(t)), in the x,y plane. This concentration can only be represented using a mathematically "singular" object such as a (Schwartz) distribution. Its use for imaging requires a coarse-graining operation, which is described in this study. Subsequently, removal of the coarse-graining parameter is accomplished using the ergodic theorem. The resulting expression for joint entropy is applied to several data sets, showing the utility of the concept for both materials characterization and detection of targeted liquid nanoparticle ultrasonic contrast agents. In all cases, the sensitivity of these techniques matches or exceeds, sometimes by a factor of two, that demonstrated in previous studies that employed signal energy or alternate entropic quantities.

| S-EPMC3548839 | biostudies-other

A Differentiable Neural-Network Force Field for Ionic Liquids.

Project description:We present NeuralIL, a model for the potential energy of an ionic liquid that accurately reproduces first-principles results with orders-of-magnitude savings in computational cost. Built on the basis of a multilayer perceptron and spherical Bessel descriptors of the atomic environments, NeuralIL is implemented in such a way as to be fully automatically differentiable. It can thus be trained on ab initio forces instead of just energies, to make the most out of the available data, and can efficiently predict arbitrary derivatives of the potential energy. Using ethylammonium nitrate as the test system, we obtain out-of-sample accuracies better than 2 meV atom-1 (<0.05 kcal mol-1) in the energies and 70 meV Å-1 in the forces. We show that encoding the element-specific density in the spherical Bessel descriptors is key to achieving this. Harnessing the information provided by the forces drastically reduces the amount of atomic configurations required to train a neural network force field based on atom-centered descriptors. We choose the Swish-1 activation function and discuss the role of this choice in keeping the neural network differentiable. Furthermore, the possibility of training on small data sets allows for an ensemble-learning approach to the detection of extrapolation. Finally, we find that a separate treatment of long-range interactions is not required to achieve a high-quality representation of the potential energy surface of these dense ionic systems.

| S-EPMC8757435 | biostudies-literature

A smooth and differentiable bulk-solvent model for macromolecular diffraction.

Project description:Inclusion of low-resolution data in macromolecular crystallography requires a model for the bulk solvent. Previous methods have used a binary mask to accomplish this, which has proven to be very effective, but the mask is discontinuous at the solute-solvent boundary (i.e. the mask value jumps from zero to one) and is not differentiable with respect to atomic parameters. Here, two algorithms are introduced for computing bulk-solvent models using either a polynomial switch or a smoothly thresholded product of Gaussians, and both models are shown to be efficient and differentiable with respect to atomic coordinates. These alternative bulk-solvent models offer algorithmic improvements, while showing similar agreement of the model with the observed amplitudes relative to the binary model as monitored using R, R(free) and differences between experimental and model phases. As with the standard solvent models, the alternative models improve the agreement primarily with lower resolution (>6 A) data versus no bulk solvent. The models are easily implemented into crystallographic software packages and can be used as a general method for bulk-solvent correction in macromolecular crystallography.

| S-EPMC2935282 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data