Related papers: Membrane topology and matrix regularization
In many scenarios, especially biomedical applications, the correct delineation of complex fine-scaled structures such as neurons, tissues, and vessels is critical for downstream analysis. Despite the strong predictive power of deep learning…
The theory of random matrices with eigenvalues distributed in the complex plane and more general "beta-ensembles" (logarithmic gases in 2D) is reviewed. The distribution and correlations of the eigenvalues are investigated in the large N…
Regularization is crucial to the success of many practical deep learning models, in particular in a more often than not scenario where there are only a few to a moderate number of accessible training samples. In addition to weight decay,…
Spectral methods are popular in detecting global structures in the given data that can be represented as a matrix. However when the data matrix is sparse or noisy, classic spectral methods usually fail to work, due to localization of…
Nowadays, multiscale modelling is recognized as the most suitable way to study biological processes. Indeed, almost every phenomenon in nature exhibits a multiscale behaviour, i.e., it is the outcome of interactions that occur at different…
In this work we classify the at-point regularities of set-valued mappings into two categories and then we analyze their relationship through several implications and examples. After this theoretical tour, we use the subregularity properties…
We discuss how to construct open membranes in the recently proposed matrix model of M theory. In order to sustain an open membrane, two boundary terms are needed in the construction. These boundary terms are available in the system of the…
This book is about solving matrix nearness problems that are related to eigenvalues or singular values or pseudospectra. These problems arise in great diversity in various fields, be they related to dynamics, as in questions of robust…
Recent studies have shown that regularization techniques using soft labels, e.g., label smoothing, Mixup, and CutMix, not only enhance image classification accuracy but also mitigate miscalibration due to overconfident predictions, and…
We introduce a unified framework based on bi-level optimization schemes to deal with parameter learning in the context of image processing. The goal is to identify the optimal regularizer within a family depending on a parameter in a…
A mechanical model and numerical method for structural membranes implied by all isosurfaces of a level-set function in a three-dimensional bulk domain are proposed. The mechanical model covers large displacements in the context of the…
The cell complex structure is one of the most fundamental structures in topology and combinatorics, the Morse decomposition of a dynamical system analyzes the global gradient behavior, and the Reeb graph of a function is an elementary tool…
We consider the number of configurations of a surface in two dimensions that has a prescribed length and encloses a prescribed perimeter with respect to a baseline. An approximate analytical treatment in a semi--continuum compares…
Using the diagrammatic method, we derive a set of self-consistent equations that describe eigenvalue distributions of large correlated asymmetric random matrices. The matrix elements can have different variances and be correlated with each…
Branching architecture characterizes numerous systems, ranging from synthetic (hyper)branched polymers and biomolecules such as lignin, amylopectin, and nucleic acids to tracheal and neuronal networks. Its ubiquity reflects the many…
Tubular and membranous shapes display a wide range of morphologies that are difficult to analyze within a common framework. By generalizing the classical Helfrich energy of biomembranes, we model them as solutions to a curvature…
Numerical computations involving rational matrices often benefit from preserving underlying matrix structures such as symmetry, Hermitian properties, or sparsity that reflect physical, geometric, or algebraic characteristics of the system.…
The problem of approximating a matrix by a low-rank one has been extensively studied. This problem assumes, however, that the whole matrix has a low-rank structure. This assumption is often false for real-world matrices. We consider the…
The convergence behaviour and the design of numerical methods for modelling the flow of light in photonic crystal fibres depend critically on an understanding of the regularity of solutions to time-harmonic Maxwell equations in a…
We give a new framework for solving the fundamental problem of low-rank matrix completion, i.e., approximating a rank-$r$ matrix $\mathbf{M} \in \mathbb{R}^{m \times n}$ (where $m \ge n$) from random observations. First, we provide an…