Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

137274410547 · Jun 202019922001200920172026
48 results for end structure

This paper proves unique determination of certain non-quasi-Fuchsian manifolds by their end structure and bending lamination.

problem Unique determination of non-quasi-Fuchsian manifolds by their end structure and bending lamination.
method Analysis of the end structure (parabolic locus, ending laminations, conformal structures) and bending lamination.
result Non-quasi-Fuchsian manifolds are uniquely determined by their end structure and bending lamination.

Deep NLP models benefit from underlying structures in the data---e.g., parse trees---typically extracted using off-the-shelf parsers. Recent attempts to jointly learn the latent structure encounter a tradeoff: either make factorization assumptions that limit expressiveness, or sacrifice end-to-end differentiability. Us…

2018-09-03abs ↗pdf ↗

Structured Prediction Energy Networks (SPENs) are a simple, yet expressive family of structured prediction models (Belanger and McCallum, 2016). An energy function over candidate structured outputs is given by a deep network, and predictions are formed by gradient-based optimization. This paper presents end-to-end lear…

2017-03-16abs ↗pdf ↗

Infinite-genus surfaces have many isospectral hyperbolic structures.

problem Finding many isospectral hyperbolic structures on infinite-genus surfaces.
method Constructing families of isospectral hyperbolic structures on infinite-type surfaces without planar ends.
result Uncountable families of isospectral and quasiconformally distinct hyperbolic structures on infinite-genus surfaces with self-similar end spaces.

Real projective structures on nn-orbifolds are useful in understanding the space of representations of discrete groups into SL(n+1,R)\mathrm{SL}(n+1, \mathbb{R}) or PGL(n+1,R)\mathrm{PGL}(n+1, \mathbb{R}). A recent work shows that many hyperbolic manifolds deform to manifolds with such structures not projectively equivalent to the o…

2015-01-02abs ↗pdf ↗

Real projective structures on nn-orbifolds are useful in understanding the space of representations of discrete groups into SL(n+1,R)\mathrm{SL}(n+1, \mathbb{R}) or PGL(n+1,R)\mathrm{PGL}(n+1, \mathbb{R}). A recent work shows that many hyperbolic manifolds deform to manifolds with such structures not projectively equivalent to the o…

2015-07-03abs ↗pdf ↗

A real projective orbifold is an nn-dimensional orbifold modeled on RPn\mathbb{RP}^n with the group PGL(n+1,R)PGL(n+1, \mathbb{R}). We concentrate on an orbifold that contains a compact codimension 00 submanifold whose complement is a union of neighborhoods of ends, diffeomorphic to closed (n1)(n-1)-dimensional orbifolds times …

2010-11-04abs ↗pdf ↗

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…

2018-12-12abs ↗pdf ↗

We use Furuta's result, usually referred to as ``10/8-conjecture'', to show that for any compact 3-manifold MM the open manifold $M\times\r$ has infinitely many different smooth structures. Another consequence of Furuta's result is existence of infinitely many smooth structures on open topological 4-manifolds with a t…

1996-04-26abs ↗pdf ↗

Kaleidoscope matrices improve model quality and inference speed.

problem Choosing structured linear transformations for efficiency and accuracy.
method Introduce kaleidoscope matrices that can capture any structured matrix with near-optimal space and time complexity. Learn these matrices automatically within end-to-end pipelines.
result Kaleidoscope matrices can improve model quality and inference speed.

Study geometric structure of Ricci shrinker ends without global curvature assumptions.

problem Understand the geometric structure of Ricci shrinker ends without global curvature constraints.
method Analyze blow-up sequences of Ricci shrinkers at points with Type I scalar curvature bound, extending F-convergence theory.
result Limits of Ricci shrinkers at points with Type I scalar curvature bound split a line in four dimensions.

This paper is devoted to introducing coarse structures in a very simple way, namely as an equivalence relation on the set of simple ends. As an application we show that Gromov boundary of every hyperbolic space is an example of a Higson corona and each Freundenthal compactification is an example of a Higson compactific…

2018-01-29abs ↗pdf ↗

This research studies end-periodic mapping tori and their hyperbolic structures.

problem Understanding the geometry and dynamics of end-periodic mapping tori.
method Analyzes invariant laminations and hyperbolic structures of mapping tori.
result Establishes a relationship between the geodesic length of boundary components and the infimum of geodesic lengths in hyperbolic structures.

Despite an explosion in the number of experimentally determined, atomically detailed structures of biomolecules, many critical tasks in structural biology remain data-limited. Whether performance in such tasks can be improved by using large repositories of tangentially related structural data remains an open question. …

2018-07-03abs ↗pdf ↗

Study circle patterns and polyhedral surfaces in hyperbolic ends, proving manifold properties.

problem Understanding the space of complex projective structures on surfaces with circle patterns.
method Analyzing ideal polyhedral surfaces in hyperbolic ends, proving manifold properties and Lagrangian immersions.
result The space of complex projective structures on surfaces with circle patterns is a manifold of dimension 6g-6.

Researchers create a parametrix for resolvents on manifolds with ends.

problem Essential self-adjointness of elliptic symmetric differential operators on manifolds with ends.
method Introduced semiclasical pseudodifferential operators compatible with the end structure.
result Essential self-adjointness of elliptic symmetric differential operators proved.

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

problem Limits on the number of ends of smooth metric measure spaces.
method Analyzes the Bakry-Émery Ricci tensor and function degeneration to set limits.
result Establishes gap theorems for ends of smooth metric measure spaces under specific conditions.

This note revisits recent results regarding the geometry and moduli of solutions of the heterotic string on manifolds YY with a G2G_2 structure. In particular, such heterotic G2G_2 systems can be rephrased in terms of a differential Dˇ\check {\cal D} acting on a complex Ωˇ(Y,Q)\checkΩ^*(Y , {\cal Q}), where ${\cal Q}=T^*Y\…

2017-09-20abs ↗pdf ↗

It is important to learn various types of classifiers given training data with noisy labels. Noisy labels, in the most popular noise model hitherto, are corrupted from ground-truth labels by an unknown noise transition matrix. Thus, by estimating this matrix, classifiers can escape from overfitting those noisy labels. …

2018-05-21abs ↗pdf ↗

Complex environments and tasks pose a difficult problem for holistic end-to-end learning approaches. Decomposition of an environment into interacting controllable and non-controllable objects allows supervised learning for non-controllable objects and universal value function approximator learning for controllable obje…

2019-01-27abs ↗pdf ↗

End-to-end algorithm for controlling bilinear systems with probabilistic noise.

problem Controlling bilinear systems with noisy data.
method Proposes an end-to-end algorithm using statistical learning theory and robust controller design.
result Derived finite sample identification error bounds and structurally suitable for control.

In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair s,ts, t where each of s,ts, t is either a vertex or an end in the original network. A Max-Flow Min-Cut Theorem is proved for any net…

2013-11-15abs ↗pdf ↗

In this paper, we propose an end-to-end deep learning model, called E2Efold, for RNA secondary structure prediction which can effectively take into account the inherent constraints in the problem. The key idea of E2Efold is to directly predict the RNA base-pairing matrix, and use an unrolled algorithm for constrained p…

2020-02-13abs ↗pdf ↗

Study examines LpL^p-boundedness of Hodge projection on manifolds with ends.

problem Understanding LpL^p-boundedness of Hodge projection on manifolds with ends.
method Investigates the relationship between Hodge projection, Riesz transform, and bounded harmonic functions.
result Connects LpL^p-boundedness of Hodge projection to the structure of L2L^2 harmonic one-forms and bounded harmonic functions.

Automated multi-task learning algorithm that optimizes network topology.

problem Over-sharing in multi-task learning leads to over-generalization and suboptimal performance.
method Tree-structured design space with gumbel-softmax sampling for differentiable network splitting.
result End-to-end trainable algorithm that optimizes network topology for multiple objectives across tasks.

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of infinite index. As a corollary, the same holds for limit groups. We also obtain a ch…

2011-02-14abs ↗pdf ↗

These revised lecture notes are an expository account of part of the proof of Thurston's Ending Lamination Conjecture for Kleinian surface groups, which states that such groups are uniquely determined by invariants that describe the asymptotic structure of the ends of their quotient manifolds.

2002-05-15abs ↗pdf ↗

This paper introduces the Differentiable Algorithm Network (DAN), a composable architecture for robot learning systems. A DAN is composed of neural network modules, each encoding a differentiable robot algorithm and an associated model; and it is trained end-to-end from data. DAN combines the strengths of model-driven …

2019-05-28abs ↗pdf ↗

Study of minimal surfaces in 4D with specific ends.

problem Characterize minimal surfaces in R4\mathbb{R}^4 with specific ends.
method Modification of Costa and Hoffman-Meeks method, generalized Weierstrass representation.
result Minimal surfaces with specific ends are JJ-holomorphic under certain conditions.

In this paper we describe the notion of an annular end of a Riemann surface being of finite type with respect to some harmonic function and prove some theoretical results relating the conformal structure of such an annular end to the level sets of the harmonic function. We then apply these results to understand and cha…

2009-09-10abs ↗pdf ↗

A key goal of computer vision is to recover the underlying 3D structure from 2D observations of the world. In this paper we learn strong deep generative models of 3D structures, and recover these structures from 3D and 2D images via probabilistic inference. We demonstrate high-quality samples and report log-likelihoods…

2016-07-03abs ↗pdf ↗

This paper presents a comparison of a traditional hybrid speech recognition system (kaldi using WFST and TDNN with lattice-free MMI) and a lexicon-free end-to-end (TensorFlow implementation of multi-layer LSTM with CTC training) models for German syllable recognition on the Verbmobil corpus. The results show that expli…

2019-09-19abs ↗pdf ↗