arXiv research

Paper proposes a clustering algorithm for nonnegative data.

In this short note we extend some of the recent results on matrix completion under the assumption that the columns of the matrix can be grouped (clustered) into subspaces (not necessarily disjoint or independent). This model deviates from the typical assumption prevalent in the literature dealing with compression and r…

We discuss an "extrinsic" property of knots in a 3-subspace of the 3-sphere $S^3$ to characterize how the subspace is embedded in $S^3$. Specifically, we show that every knot in a subspace of the 3-sphere is transient if and only if the exterior of the subspace is a disjoint union of handlebodies, i.e. regular neighbor…

Subspace clustering aims to find groups of similar objects (clusters) that exist in lower dimensional subspaces from a high dimensional dataset. It has a wide range of applications, such as analysing high dimensional sensor data or DNA sequences. However, existing algorithms have limitations in finding clusters in non-…

With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing \emph{cancelable biometric} technologies is on the rise. Because the problem of cancelable template generation deals with the trade-off between template security and matching performance, many …

In a 1983 paper with Frank Warner, we proved that the space of all great circle fibrations of the 3-sphere S^3 deformation retracts to the subspace of Hopf fibrations, and so has the homotopy type of a pair of disjoint two-spheres. Since that time, no generalization of this result to higher dimensions has been found, a…

Memory-efficient optimizers fail to track a subspace, leading to unpredictable model performance.

Sequential learning of multiple tasks in artificial neural networks using gradient descent leads to catastrophic forgetting, whereby previously learned knowledge is erased during learning of new, disjoint knowledge. Here, we propose a new approach to sequential learning which leverages the recent discovery of adversari…

Introduces new limit spaces for degenerating Calabi-Yau families.

An expansion is developed for the Weil-Petersson Riemann curvature tensor in the thin region of the Teichmüller and moduli spaces. The tensor is evaluated on the gradients of geodesic-lengths for disjoint geodesics. A precise lower bound for sectional curvature in terms of the surface systole is presented. The curvatur…

A Heegaard splitting of a closed, orientable three-manifold satisfies the disjoint curve property if the splitting surface contains an essential simple closed curve and each handlebody contains an essential disk disjoint from this curve [Thompson, 1999]. A splitting is full if it does not have the disjoint curve proper…

We explore the geometry of nonpositively curved spaces with isolated flats, and its consequences for groups that act properly discontinuously, cocompactly, and isometrically on such spaces. We prove that the geometric boundary of the space is an invariant of the group up to equivariant homeomorphism. We also prove that…

Approximates cycles in planar and bounded-genus graphs.

We show that all finite-dimensional resolvable generalized manifolds with the piecewise disjoint arc-disk property are codimension one manifold factors. We then show how the piecewise disjoint arc-disk property and other general position properties that detect codimension one manifold factors are related. We also note …

Extreme multi-label classification aims to learn a classifier that annotates an instance with a relevant subset of labels from an extremely large label set. Many existing solutions embed the label matrix to a low-dimensional linear subspace, or examine the relevance of a test instance to every label via a linear scan. …

We present a new property, the Disjoint Path Concordances Property, of an ENR homology manifold X which precisely characterizes when X times R has the Disjoint Disks Property. As a consequence, X times R is a manifold if and only if X is resolvable and it possesses this Disjoint Path Concordances Property.

A new classification method using disjoint centroids and normalized distance.

Variational autoencoders (VAEs) defined over SMILES string and graph-based representations of molecules promise to improve the optimization of molecular properties, thereby revolutionizing the pharmaceuticals and materials industries. However, these VAEs are hindered by the non-unique nature of SMILES strings and the c…

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

Uniform bounds found for Sierpinski carpet hyperbolic components.

A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch which we call non-classical interval exchanges, form a subclass of linear involutions without flips. They are analogs of classical interval exchanges, and are…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number of circles meeting in a given cyclic order given 6 disjoint smooth closed curves…

The paper introduces MU for NMF with $β$-divergences and disjoint constraints.

We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).

We note a simple algebraic proof of Frolkina's result that $\mathbb R^3$ does not contain uncountably many pairwise disjoint copies of the Möbius band, and of a similar result in higher dimensions.

We show that many algebraic actions of higher-rank abelian groups on zero-dimensional groups are mutually disjoint. The proofs exploit differences in the entropy geometry arising from subdynamics and a form of Abramov--Rokhlin formula for half-space entropies.

New theorem on embedding Moebius bands in 3D space.

The study bounds the excess of disjoint nonorientable surfaces in a 4-manifold.

A fibration of ${\mathbb R}^n$ by oriented copies of ${\mathbb R}^p$ is called skew if no two fibers intersect nor contain parallel directions. Conditions on $p$ and $n$ for the existence of such a fibration were given by Ovsienko and Tabachnikov. A classification of smooth fibrations of ${\mathbb R}^3$ by skew oriente…

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

Satellite knots can be trivialized by a single band move.

New embeddings show answer to Baker-Laidacker question can be yes or no.

In this paper, we classify three-dimensional complex Abelian varieties isogenous to a product $A_1 \times A_2$, where one of the factors admits real multiplication by a real quadratic order $\mathcal{O}_D$ of discriminant $D$. We show that the moduli space $X_D^{(3)}$ of these varieties essentially is the disjoint unio…

Embeddings of pairs of disjoint nonparallel primitive simple closed curves in the boundary of a genus two handlebody are classified. Briefly, two disjoint primitives either lie on opposite ends of a product $F \boldsymbol{\times} I$, or they lie on opposite ends of a kind of "twisted" product $F \widetilde{\boldsymbol{…

The following problem was proposed in 2010 by S. Lando. Let $M$ and $N$ be two unions of the same number of disjoint circles in a sphere. Do there always exist two spheres in 3-space such that their intersection is transversal and is a union of disjoint circles that is situated as $M$ in one sphere and as $N$ in the ot…

Study shows moduli space of fibrations has specific homotopy types.

Using first principles from inference, we design a set of functionals for the purposes of \textit{ranking} joint probability distributions with respect to their correlations. Starting with a general functional, we impose its desired behaviour through the \textit{Principle of Constant Correlations} (PCC), which constrai…

Simple curves enclose two small disks if they're wide and bend moderately.

The study examines how bias affects hypothesis formation in neural networks.

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

Neural Bayes simplifies computing complex stats for unsupervised learning.

New method neutralizes gender bias in word embeddings without losing semantic information.

Paper bounds subspace estimator error from noisy projections.

PCA is one of the most widely used dimension reduction techniques. A related easier problem is "subspace learning" or "subspace estimation". Given relatively clean data, both are easily solved via singular value decomposition (SVD). The problem of subspace learning or PCA in the presence of outliers is called robust su…

Union of Subspaces (UoS) is a popular model to describe the underlying low-dimensional structure of data. The fine details of UoS structure can be described in terms of canonical angles (also known as principal angles) between subspaces, which is a well-known characterization for relative subspace positions. In this pa…

Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an infinite family of distinct Ricci-flat graphs of girth four with edge-disjoint 4-cycles…

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an undirected graph can be connected by $k$ pairwise edge-disjoint paths if, and only…

Study $Sp(n)$-orbits in complex and $Σ$-complex subspaces of Hermitian quaternionic vector spaces.