arXiv research

A CAE improves DNN's outlier and adversary defense.

The paper shows how to transform certain 3-manifold Heegaard splittings into simpler forms.

Let L be a link in the 3-sphere that is in thin position but not in bridge position and let P be a thin level sphere. We generalize a result of Wu by giving a bound on the number of disjoint irreducible compressing disks that P can have, including identifying thin spheres with unique compressing disks. We also give con…

We analyze the mapping class group of extendible automorphisms of the exterior boundary W of a compression body of dimension 3 or 4, which extend over the compression body (Q,V), where V is the interior boundary. Those that extend as automorphisms of (Q,V) rel V are called discrepant automorphisms, forming the mapping …

Model compression has emerged as an important area of research for deploying deep learning models on Internet-of-Things (IoT). However, for extremely memory-constrained scenarios, even the compressed models cannot fit within the memory of a single device and, as a result, must be distributed across multiple devices. Th…

A Heegaard splitting which admits a unique pair of disjoint compression disks on distinct sides is said to be keen weakly reducible. This paper provides an construction of keen weakly reducible Heegaard splittings of arbitrary genus except 2. Furthermore, critical Heegaard splittings may yield if we change some conditi…

Distributed sensors compress and send features to a fusion center for linear regression.

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…

The paper provides examples of keen weakly reducible bridge spheres for links in b-bridge position.

Efficient algorithms for monophonic halfspaces in graphs simplify learning and compression.

In this article we show that for any given Riemann surface $Σ$ of genus $g$, we can bound (from above) the renormalized volume of a (hyperbolic) Schottky group with boundary at infinity conformal to $Σ$ in terms of the genus and the combined extremal lengths on $Σ$ of $(g-1)$ disjoint, non-homotopic, simple closed comp…

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…

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…

New theorem on embedding Moebius bands in 3D space.

Overcomplete representations and dictionary learning algorithms kept attracting a growing interest in the machine learning community. This paper addresses the emerging problem of comparing multivariate overcomplete representations. Despite a recurrent need to rely on a distance for learning or assessing multivariate ov…

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.

Reduces connectivity problem for genus-4 Heegaard surface in 3-sphere.

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…

BDC compresses both sample size and dimensionality of large datasets.

We give first examples of finitely generated groups having an intermediate, with values in (0,1), Hilbert space compression (which is a numerical parameter measuring the distortion required to embed a metric space into Hilbert space). These groups include certain diagram groups. In particular, we show that the Hilbert …

Suppose N is a compressible boundary component of a compact orientable irreducible 3-manifold M and Q is an orientable properly embedded essential surface in M in which each component is incident to N and no component is a disk. Let VN and QN denote respectively the sets of vertices in the curve complex for N represent…

OptiNet achieves near-minimax error rates with compression in Euclidean space.

Study on planar graph braid groups' second homology.

Avoids noncompact hypersurfaces from touching in evolving flows.

Adaptive sampling method optimizes DNN compression for resource-constrained platforms.

We provide a self-contained treatment of set-theoretic subsolutions to flow by mean curvature, or, more generally, to flow by mean curvature plus an ambient vector field. The ambient space can be any smooth Riemannian manifold. Most importantly, we show that if two such set-theoretic subsolutions are initially disjoint…

It was proved in 1998 by Ben-David and Litman that a concept space has a sample compression scheme of size d if and only if every finite subspace has a sample compression scheme of size d. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same…

CSDM integrates compressed sensing into diffusion models for faster data generation.

Infinite volume found in the thick part of $\mathrm{PSL}_n(\mathbb{R})$-Hitchin-Riemann moduli space.

Model-based compression is an effective, facilitating, and expanded model of neural network models with limited computing and low power. However, conventional models of compression techniques utilize crafted features [2,3,12] and explore specialized areas for exploration and design of large spaces in terms of size, spe…

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

New method compresses facial videos using GANs and latent space optimization.

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…

A manifold is T-embedded into an affine space if its tangent spaces at distinct points are disjoint. We prove that an n-dimensional disc cannot be T-embedded into 2n-dimensional space.

New proof confirms 4-manifolds with weakly reducible genus-three trisections are standard.

We study the space of "link maps": the space of maps of a disjoint union of compact, closed manifolds P_1, . . ., P_k into a manifold N whose images are pairwise disjoint. We apply the manifold calculus of functors developed by Goodwillie and Weiss to study the difference between it and its linear and quadratic approxi…

For links with vanishing pairwise linking numbers, the link components bound pairwise disjoint surfaces in $B^{4}$. In this paper, we describe the set of genera of such surfaces in terms of the $h$-function, which is a link invariant from Heegaard Floer homology. In particular, we use the $h$-function to give lower bou…

Deep learning models have significantly improved the visual quality and accuracy on compressive sensing recovery. In this paper, we propose an algorithm for signal reconstruction from compressed measurements with image priors captured by a generative model. We search and constrain on latent variable space to make the m…

Determining the space of free discrete two generator groups of Möbius transformations is an old and difficult problem. In this paper we show how to construct large balls of full dimension in this space. To do this, we begin with a marked discrete group of non-separating disjoint circle type. Such a group determines thr…

Solves Plateau-Douglas problem for singular configurations in general metric spaces.

We describe a simple and general neural network weight compression approach, in which the network parameters (weights and biases) are represented in a "latent" space, amounting to a reparameterization. This space is equipped with a learned probability model, which is used to impose an entropy penalty on the parameter r…

2D complexes can be almost-embedded in 4D space without self-intersections.

If one tries to embed a metric space uniformly in Hilbert space, how close to quasi-isometric could the embedding be? We answer this question for finite dimensional CAT(0) cube complexes and for hyperbolic groups. In particular, we show that the Hilbert space compression of any hyperbolic group is 1.

The paper provides a converse to linking theorems for graphs in 3-space and higher dimensions.

Approximates cycles in planar and bounded-genus graphs.

This paper is devoted to dualization of paracompactness to the coarse category via the concept of $R$-disjointness. Property A of G.Yu can be seen as a coarse variant of amenability via partitions of unity and leads to a dualization of paracompactness via partitions of unity. On the other hand, finite decomposition com…

We show that any two disjoint crooked planes in R^3 are leaves of a crooked foliation. This answers a question asked by Charette and Kim.