arXiv research

New relation on paths is not transitive.

Study on inflection points of plane curve shadows with fixed embedded shapes.

We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also present some upper and lower bounds for the minimal number of inflection points …

A novel OT-based method for aligning hyperbolic representations.

Bayesian hyperbolic MDS improves tree-like data representation.

We prove that a continuum $X$ is tree-like (resp. circle-like, chainable) if and only if for each open cover $\U_4=\{U_1,U_2,U_3,U_4\}$ of $X$ there is a $\U_4$-map $f:X\to Y$ onto a tree (resp. onto the circle, onto the interval). A continuum $X$ is an acyclic curve if and only if for each open cover $\U_3=\{U_1,U_2,U…

New model uses PEPS for image classification, outperforming tree-like networks.

Learning graph representations via low-dimensional embeddings that preserve relevant network properties is an important class of problems in machine learning. We here present a novel method to embed directed acyclic graphs. Following prior work, we first advocate for using hyperbolic spaces which provably model tree-li…

Signature uniquely identifies piecewise linear surfaces up to thin homotopy.

We associate an open book with any connected plane checkerboard graph, thus providing a common extension of the classes of prime positive braid links and positive tree-like Hopf plumbings. As an application, we prove that the link type of a prime positive braid closure is determined by the linking graph associated with…

PIN models feature interactions using a neural network that mimics decision trees.

Different from the traditional classification tasks which assume mutual exclusion of labels, hierarchical multi-label classification (HMLC) aims to assign multiple labels to every instance with the labels organized under hierarchical relations. Besides the labels, since linguistic ontologies are intrinsic hierarchies, …

In their study of fundamental groups of one-dimensional path-connected compact metric spaces, Cannon and Conner have asked: Is there a tree-like object that might be considered the topological Cayley graph? We answer this question in the positive and provide a combinatorial description of such an object.

In this paper we construct Riemannian metrics and weight functions over Casson handles. We show that the corresponding Atiyah-Hitchin-Singer complexes are Fredholm for some class of Casson handles of bounded type. Using these, the Yang-Mills moduli spaces are constructed as finite dimensional smooth manifolds over Cass…

Paper develops a new method to analyze 3D tree-like objects.

Among all torus links, we characterise those arising as links of simple plane curve singularities by the property that their fibre surfaces admit only a finite number of cutting arcs that preserve fibredness. The same property allows a characterisation of Coxeter-Dynkin trees (i.e., $A_n$, $D_n$, $E_6$, $E_7$ and $E_8$…

Generalizes Rips' result on hyperbolic spaces to metric spaces, showing collapses for tree metrics.

By a theorem of A'Campo, the eigenvalues of certain Coxeter transformations are positive real or lie on the unit circle. By optimally bounding the signature of tree-like positive Hopf plumbings from below by the genus, we prove that at least two thirds of them lie on the unit circle. In contrast, we show that for divid…

Study on network flow singularities, focusing on Type-0 singularities.

Lasso proves consistent model selection for high-dimensional Ising models.

We study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes exactly the unwheeled rational Kontsevich integral of torus knots, and that it beh…

Efficiently models tree-like data with coupled branches using HMMs.

This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as possible. An explanation based on that is given for a previously investigated colla…

A new drug embedding method using hierarchical drug relations and chemical structures.

We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the duality gives a version of global calibrations for 1-chains with coefficients in $…

When 1 -> H -> G -> Q -> 1 is a short exact sequence of three infinite, word-hyperbolic groups, Mahan Mitra (Mj) has shown that the inclusion map from H to G extends continuously to a map between the Gromov boundaries of H and G. This boundary map is known as the Cannon-Thurston map. In this context, Mitra associates t…

In the preceding paper we presented empirical results describing the growth of publicly-traded United States manufacturing firms within the years 1974--1993. Our results suggest that the data can be described by a scaling approach. Here, we propose models that may lead to some insight into these phenomena. First, we st…

The variational auto-encoder (VAE) is a popular method for learning a generative model and embeddings of the data. Many real datasets are hierarchically structured. However, traditional VAEs map data in a Euclidean latent space which cannot efficiently embed tree-like structures. Hyperbolic spaces with negative curvatu…

Finding a good compromise between the exploitation of known resources and the exploration of unknown, but potentially more profitable choices, is a general problem, which arises in many different scientific disciplines. We propose a stylized model for these exploration-exploitation situations, including population or e…

Let $F$ be a non-singular foliation on the plane with all leaves being closed subsets, $H^{+}(F)$ be the group of homeomorphisms of the plane which maps leaves onto leaves endowed with compact open topology, and $H^{+}_{0}(F)$ be the identity path component of $H^{+}(F)$. The quotient $π_0 H^{+}(F) = H^{+}(F)/H^{+}_{0}…

It is very useful to integrate human knowledge and experience into traditional neural networks for faster learning speed, fewer training samples and better interpretability. However, due to the obscured and indescribable black box model of neural networks, it is very difficult to design its architecture, interpret its …

Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph, we present an algorithm for learning word embeddings in hyperbolic space from fr…

In this paper we investigate the computational complexity of learning the graph structure underlying a discrete undirected graphical model from i.i.d. samples. We first observe that the notoriously difficult problem of learning parities with noise can be captured as a special case of learning graphical models. This lea…

Study validates numerical method for singular FBSDEs convergence.

We study the problem of recovering the structure underlying large Gaussian graphical models or, more generally, partial correlation graphs. In high-dimensional problems it is often too costly to store the entire sample covariance matrix. We propose a new input model in which one can query single entries of the covarian…

The convolution method for the numerical solution of forward-backward stochastic differential equations (FBSDEs), introduced in [21], uses a uniform space grid. In this paper we utilize a tree-like spatial discretization that approximates the BSDE on the tree, so that no spatial interpolation procedure is necessary. In…

The paper introduces a new geometric representation for data.

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 1…

New method for curve comparison using iterated integrals and moving frames.

Euclidean geometry has historically been the typical "workhorse" for machine learning applications due to its power and simplicity. However, it has recently been shown that geometric spaces with constant non-zero curvature improve representations and performance on a variety of data types and downstream tasks. Conseque…

Model financial markets with social media influences using hierarchical networks.

Clustering partitions a dataset such that observations placed together in a group are similar but different from those in other groups. Hierarchical and $K$-means clustering are two approaches but have different strengths and weaknesses. For instance, hierarchical clustering identifies groups in a tree-like structure b…

Hughes has defined a class of groups, which we call FSS (finite similarity structure) groups. Each FSS group acts on a compact ultrametric space by local similarities. The best-known example is Thompson's group V. Guided by previous work on Thompson's group V, we establish a number of new results about FSS groups. Our …

Model financial default cascades on sparse graphs via hitting times.

Explicit BCH series radii found for special Banach-Malcev shift algebras.

This paper makes a substantial step towards cloning the functionality of black-box models by introducing a Machine learning (ML) architecture named Deep Neural Trees (DNTs). This new architecture can learn to separate different tasks of the black-box model, and clone its task-specific behavior. We propose to train the …

To deal with various datasets over different complexity, this paper presents an self-adaptive learning model that combines the proposed Dynamic Connected Neural Decision Networks (DNDN) and a new pruning method--Dynamic Soft Pruning (DSP). DNDN is a combination of random forests and deep neural networks that enjoys bot…

We study the problem of black-box optimization of a noisy function in the presence of low-cost approximations or fidelities, which is motivated by problems like hyper-parameter tuning. In hyper-parameter tuning evaluating the black-box function at a point involves training a learning algorithm on a large data-set at a …