Related papers: Membrane topology and matrix regularization
When considering flows in biological membranes, they are usually treated as flat, though more often than not, they are curved surfaces, even extremely curved, as in the case of the endoplasmic reticulum. Here, we study the topological…
Regularization is a core component of modern inverse problems, as it helps establish the well-posedness of the solution of interest. Popular regularization approaches include variational regularization and iterative regularization. The…
Unsupervised representation learning methods are widely used for gaining insight into high-dimensional, unstructured, or structured data. In some cases, users may have prior topological knowledge about the data, such as a known cluster…
The need to blend observational data and mathematical models arises in many applications and leads naturally to inverse problems. Parameters appearing in the model, such as constitutive tensors, initial conditions, boundary conditions, and…
Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for…
We suggest that the static configurations of M-theory may be described by the matrix regularisation of the supermembrane theory in static regime. We compute the long range interaction between a M2-brane and an anti-M2-brane in agreement…
Matrix factorization models have been extensively studied as a valuable test-bed for understanding the implicit biases of overparameterized models. Although both low nuclear norm and low rank regularization have been studied for these…
We give a method for constructing a regularizing decomposition of a matrix pencil, which is formulated in terms of the linear mappings. We prove that two pencils are topologically equivalent if and only if their regularizing decompositions…
Our goal here is to see the space of matrices of a given size from a geometric and topological perspective, with emphasis on the families of various ranks and how they fit together. We pay special attention to the nearest orthogonal…
To capture the global structure of a dynamical system we reformulate dynamics in terms of appropriately constructed topologies, which we call flow topologies; we call this process topologization. This yields a description of a semi-flow in…
Regularization techniques are widely employed in optimization-based approaches for solving ill-posed inverse problems in data analysis and scientific computing. These methods are based on augmenting the objective with a penalty function,…
A proposal for the matrix model formulation of the M-theory on a space with a boundary is given. A general machinery for modding out a symmetry in M(atrix) theory is used for a Z_2 symmetry changing the sign of the X_1 coordinate. The…
In this thesis, a Bayes linear methodology for the adjustment of covariance matrices is presented and discussed. A geometric framework for quantifying uncertainties about covariance matrices is set up, and an inner-product for spaces of…
We examine the algebraic structure of the matrix regularization for the wrapped membrane on $R^{10}\times S^1$ in the light-cone gauge. We give a concrete representation for the algebra and obtain the matrix string theory having the…
Positive definite kernels and their associated Reproducing Kernel Hilbert Spaces provide a mathematically compelling and practically competitive framework for learning from data. In this paper we take the approximation theory point of view…
In this paper, we consider linear ill-posed problems in Hilbert spaces and their regularization via frame decompositions, which are generalizations of the singular-value decomposition. In particular, we prove convergence for a general class…
The representation problem of finite-dimensional Markov matrices in Markov semigroups is revisited, with emphasis on concrete criteria for matrix subclasses of theoretical or practical relevance, such as equal-input, circulant, symmetric or…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
A long-standing challenge is designing multi-scale structures with good connectivity between cells while optimizing each cell to reach close to the theoretical performance limit. We propose a new method for direct multi-scale topology…
We use convex relaxation techniques to provide a sequence of solutions to the matrix completion problem. Using the nuclear norm as a regularizer, we provide simple and very efficient algorithms for minimizing the reconstruction error…