arXiv research

We give a mathematical foundation for, and numerical demonstration of, the existence of mean curvature 1 surfaces of genus 1 with either two elliptic ends or two hyperbolic ends in de Sitter 3-space. An end of a mean curvature 1 surface is an ``elliptic end'' (resp. a ``hyperbolic end'') if the monodromy matrix at the …

Two results on end spaces of infinite type surfaces, answering questions about their topology and equivalence.

Suppose $M$ is a complete, embedded minimal surface in $\mathbb{R}^3$ with an infinite number of ends, finite genus and compact boundary. We prove that the simple limit ends of $M$ have properly embedded representatives with compact boundary, genus zero and with constrained geometry. We use this result to show that if …

We show that any complete, immersed self-expander to the inverse mean curvature flow, which has one end asymptotic to a cylinder, or has two ends asymptotic to two coaxial cylinders, must be rotationally symmetric.

Study end sum for surfaces and prove uniqueness results.

We construct a new five parameter family of constant mean curvature trinoids with two asymptotically Delaunay ends and one irregular end.

In this paper we construct an example of a complete immersed minimal surface in $\mathbb{R}^3$ of genus one with two embedded catenoid-type ends, one Enneper-type end and total Gauss curvature $-16π.$ The proof of the existence of this example, was obtained using the Weierstrass representation, the theory of elliptic f…

Unified approach to guided generation techniques.

Every connected, weighted graph with non-negative curvature has exactly two ends.

Recent work on discriminative segmental models has shown that they can achieve competitive speech recognition performance, using features based on deep neural frame classifiers. However, segmental models can be more challenging to train than standard frame-based approaches. While some segmental models have been success…

End-to-end neural network optimizes portfolios by directly learning allocations from features.

If $X$ is an orientable, strongly minimal $PD_4$-complex and $π_1(X)$ has one end then it has no nontrivial locally-finite normal subgroup. Hence if $π$ is a 2-knot group then (a) if $π$ is virtually solvable then either $π$ has two ends or $π\congΦ$, with presentation $\langle{a,t}|ta=a^2t\rangle$, or $π$ is torsion-f…

Ends and cohomology theory for noncompact spaces.

Proves unknottedness of certain 3D shapes with multiple ends.

Develops Bayesian approach for end-to-end learning in stochastic optimization.

Constructs a family of genus three minimal surfaces with parallel ends.

The study finds monotonic properties of harmonic functions on 3-manifolds with a flat end.

Suppose that S is a surface of genus two or more, with exactly one boundary component. Then the curve complex of S has one end.

In this paper, we consider complete non-catenoidal minimal surfaces of finite total curvature with two ends. A family of such minimal surfaces with least total absolute curvature is given. Moreover, we obtain a uniqueness theorem for this family from its symmetries.

Asymptotically cylindrical Ricci-flat manifolds play a key role in constructing Topological Quantum Field Theories. It is particularly important to understand their behavior at the cylindrical ends and the natural restrictions on the geometry. In this paper we show that an orientable, connected, asymptotically cylindri…

The paper explores curvature-free effects in manifolds with volume growth and ends-counting.

State-of-the-art sequence labeling systems traditionally require large amounts of task-specific knowledge in the form of hand-crafted features and data pre-processing. In this paper, we introduce a novel neutral network architecture that benefits from both word- and character-level representations automatically, by usi…

We provide in this note two relevant examples of Lagrangian cobordisms. The first one gives an example of two exact Lagrangian submanifolds which cannot be composed in an exact fashion. The second one is an example of an exact Lagrangian cobordism on which all primitive of the Liouville form is not constant on the nega…

We prove that a minimal oriented stable annular end in H^2 x R whose asymptotic boundary is contained in two vertical lines has finite total curvature and converges to a vertical plane. Furthermore, if the end is embedded then it is a horizontal graph.

New metrics with constant Q-curvature created by gluing.

It is known that all but finitely many leaves of a measured foliated 2-complex of thin type are quasi-isometric to an infinite tree with at most two topological ends. We show that if the foliation is cooriented, and the associated R-tree is self-similar, then a typical leaf has exactly one topological end. We also cons…

Proves existence of minimal surfaces of arbitrary genus with two ends.

The paper constructs surfaces of high genus with three ends.

In this paper, we prove two results. First, there is a family of sequences of embedded quarters of the hyperbolic plane such that any sequence converges to a limit which is an end of the hyperbolic plane. Second, there is no algorithm which would allow us to check whether two given ends are equal or not.

New 3D shapes can't be split into torus pieces.

The paper sets limits on the number of ends of certain geometric structures.

Embedding layers are commonly used to map discrete symbols into continuous embedding vectors that reflect their semantic meanings. Despite their effectiveness, the number of parameters in an embedding layer increases linearly with the number of symbols and poses a critical challenge on memory and storage constraints. I…

This paper develops new tools for understanding surfaces with more than one end (and usually, of infinite topology) which properly minimally embed into Euclidean three-space. On such a surface, the set of ends forms a compact Hausdorff space, naturally ordered by the relative heights of the ends in space. One of our ma…

End-to-End training (E2E) is becoming more and more popular to train complex Deep Network architectures. An interesting question is whether this trend will continue-are there any clear failure cases for E2E training? We study this question in depth, for the specific case of E2E training an ensemble of networks. Our str…

Neural network based approximate computing is a universal architecture promising to gain tremendous energy-efficiency for many error resilient applications. To guarantee the approximation quality, existing works deploy two neural networks (NNs), e.g., an approximator and a predictor. The approximator provides the appro…

An end sum is a non-compact analogue of a connected sum. Suppose we are given two connected, oriented $n$-manifolds $M_1$ and $M_2$. Recall that to form their connected sum one chooses an $n$-ball in each $M_i$, removes its interior, and then glues together the two $S^{n-1}$ boundary components thus created by an orien…

End-to-end policy learning improves statistical arbitrage trading.

End-to-end approach for weak supervision improves downstream model performance.

In this paper we prove that a complete minimal surface immersed in H^2xR, with finite total curvature and two ends, each one asymptotic to a vertical geodesic plane, must be a horizontal catenoid. Moreover, we give a geometric description of minimal ends of finite total curvature in H^2xR. We also prove that a minimal …

End-to-end training solves deep unsupervised contrastive learning problems.

End-to-end Text-to-speech (TTS) system can greatly improve the quality of synthesised speech. But it usually suffers form high time latency due to its auto-regressive structure. And the synthesised speech may also suffer from some error modes, e.g. repeated words, mispronunciations, and skipped words. In this paper, we…

We prove that for every nonnegative integer $g$, there exists a bound on the number of ends of a complete, embedded minimal surface $M$ in $\mathbb{R}^3$ of genus $g$ and finite topology. This bound on the finite number of ends when $M$ has at least two ends implies that $M$ has finite stability index which is bounded …

End-to-end autonomous driving models get better uncertainty estimates.

The paper extends end concepts to arbitrary groups and spaces.

End-to-end kernel learning using generative RFFs for improved performance.

DGC clusters data with side-information for better prediction.

End-to-end trainable graph matching using improved combinatorial solvers.

This paper presents KeypointNet, an end-to-end geometric reasoning framework to learn an optimal set of category-specific 3D keypoints, along with their detectors. Given a single image, KeypointNet extracts 3D keypoints that are optimized for a downstream task. We demonstrate this framework on 3D pose estimation by pro…