Related papers: Curvature as a tool for evaluating dimensionality …
The neural manifold hypothesis postulates that the activity of a neural population forms a low-dimensional manifold whose structure reflects that of the encoded task variables. In this work, we combine topological deep generative models and…
In recent years, network models have become more complex with the development of big data. Therefore, more advanced network analysis is required. In this paper, we introduce a new quantitative measure named combinatorial evaluation, which…
The curvature discussed in this paper is a rather far going generalization of the Riemannian sectional curvature. We define it for a wide class of optimal control problems: a unified framework including geometric structures such as…
Modern machine learning systems are increasingly trained on large amounts of data embedded in high-dimensional spaces. Often this is done without analyzing the structure of the dataset. In this work, we propose a framework to study the…
Data-driven methods play an increasingly important role in discovering geometric, structural, and semantic relationships between 3D shapes in collections, and applying this analysis to support intelligent modeling, editing, and…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…
A new dimension reduction (DR) method for data sets is proposed by autonomous deforming of data manifolds. The deformation is guided by the proposed deforming vector field, which is defined by two kinds of virtual interactions between data…
Dimensionality-reduction methods are a fundamental tool in the analysis of large data sets. These algorithms work on the assumption that the "intrinsic dimension" of the data is generally much smaller than the ambient dimension in which it…
This paper deals with the concept of curvature of framed space curves, their higher-order derivatives, variations, and co-rotational derivatives. We realize that parametrizing rotation tensor using the Gibbs vector is effective in deriving…
Neural networks appear to have mysterious generalization properties when using parameter counting as a proxy for complexity. Indeed, neural networks often have many more parameters than there are data points, yet still provide good…
The purpose of the present paper is to present the main applications of a new method for the determination of the fractal structure of plane curves. It is focused on the inverse problem, that is, given a curve in the plane, find its fractal…
$Anomaly$ $detection$ problems (also called $change$-$point$ $detection$ problems) have been studied in data mining, statistics and computer science over the last several decades in applications such as medical condition monitoring and…
We define Discrete Quasi-Einstein metrics (DQE-metrics) as the critical points of discrete total curvature functional on triangulated 3-manifolds. We study DQE-metrics by introducing some combinatorial curvature flows. We prove that these…
Machine learning algorithms using deep architectures have been able to implement increasingly powerful and successful models. However, they also become increasingly more complex, more difficult to comprehend and easier to fool. So far, most…
Discretizations of the mean curvature and extrinsic curvature components are constructed on piecewise flat simplicial manifolds, giving approximations for smooth curvature values in a mostly mesh-independent way. These constructions are…
The rapidly evolving field of engineering design of functional surfaces necessitates sophisticated tools to manage the inherent complexity of high-dimensional design spaces. This survey paper offers a scoping review, i.e., a literature…
In analogy to the concept of a non-metric dual connection, which is essential in defining statistical manifolds, we develop that of a torsion dual connection. Consequently, we illustrate the geometrical meaning of such a torsion dual…
A brief history of the investigation of the Weil-Petersson curvature and a summary of Teichm\"{u}ller theory are provided. A report is presented on the program to describe an intrinsic geometry with the Weil-Petersson metric and…
It is known that the curvature of the feasible set in convex optimization allows for algorithms with better convergence rates, and there has been renewed interest in this topic both for offline as well as online problems. In this paper,…
We introduce a neural implicit framework that exploits the differentiable properties of neural networks and the discrete geometry of point-sampled surfaces to approximate them as the level sets of neural implicit functions. To train a…