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,878 papers · 148 categories

Trend · papers per month

2356 · Nov 201919922001200920172026
48 results for looseness

A Legendrian or transverse knot in an overtwisted contact 3-manifold is non-loose if its complement is tight and loose if its complement is overtwisted. We define three measures of the extent of non-looseness of a non-loose knot and show they are distinct.

2013-12-19abs ↗pdf ↗

Research shows that certain metric spaces cannot contain rigid structures and provides evidence for loose embeddings into Euclidean spaces.

problem The inability of certain metric spaces to contain rigid structures like regular simplices or equidistant sequences.
method Proof of non-embeddability of certain metric spaces into finite-dimensional Euclidean spaces and a local-to-global principle for loose embeddability.
result Compact Riemannian manifolds cannot contain arbitrarily large regular simplices or long equidistant sequences, suggesting loose embeddings into Euclidean spaces.

Quantum isometry groups extend to all countable metric spaces, and loose embeddings help understand metric space relationships.

problem Understanding the quantum isometry groups of all countable metric spaces.
method Defining and studying loose embeddability, showing that 0-dimensional compact metric spaces are generically loosely embeddable into the real line.
result 0-dimensional compact metric spaces are generically loosely embeddable into the real line.

We prove that loose Legendrian knots in a rational homology contact 3-sphere, satisfying some additional hypothesis, are Legendrian isotopic if and only if they have the same classical invariants. The proof requires a result of Dymara on loose Legendrian knots and Eliashberg's classification of overtwisted contact stru…

2017-07-16abs ↗pdf ↗

This article introduces the notion of a loose family of Engel structures and shows that two such families are Engel homotopic if and only if they are formally homotopic. This implies a complete h-principle when some auxiliary data is fixed. As a corollary, we show that Lorentz and orientable Cartan prolongations are cl…

2017-12-26abs ↗pdf ↗

We show that the presence of a plastikstufe induces a certain degree of flexibility in contact manifolds of dimension 2n+1>3. More precisely, we prove that every Legendrian knot whose complement contains a "nice" plastikstufe can be destabilized (and, as a consequence, is loose). As an application, it follows in certai…

2012-11-16abs ↗pdf ↗

We show the homotopy spheres Σn=WfnWΣ_{n} = -W\smile_{f^{n}}W, formed by doubling the infinite order loose-cork (W,f)(W,f) by iterates of the cork diffeomorphism f:WWf: \partial W \to \partial W is S4S^4. To do this we first show that ΣnΣ_{n} are obtained by Gluck twistings of S4S^4; then from this we show how to cancel 33-han…

2019-01-24abs ↗pdf ↗

We introduce a notion of "quasi-right-veering" for closed braids, which plays an analogous role to "right-veering" for open books. We show that a transverse link KK in a contact 3-manifold (M,ξ)(M,ξ) is non-loose if and only if every braid representative of KK with respect to every open book decomposition that supports …

2016-01-26abs ↗pdf ↗

Loose bounds found for least-norm interpolant in over-parameterized settings.

problem Failures of model-dependent generalization bounds for least-norm interpolation.
method Analysis of generalization performance of least-norm linear regressor in over-parameterized regime.
result Generalization bounds for least-norm interpolant can be very loose, even when true excess risk goes to zero.

New algorithm learns coordinated decisions in loosely-coupled multi-agent systems.

problem Learning coordinated decisions in multi-agent systems with sparse interactions.
method Multi-Agent Thompson Sampling (MATS) for multi-agent multi-armed bandits.
result MATS achieves sublinear regret and outperforms MAUCE on synthetic and real benchmarks.

We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test based algorithm for learning the underlying graph structure. The novel maximization …

2012-04-25abs ↗pdf ↗

This paper centers around two basic problems of topological coincidence theory. First, try to measure (with help of Nielsen and minimum numbers) how far a given pair of maps is from being loose, i.e. from being homotopic to a pair of coincidence free maps. Secondly, describe the set of loose pairs of homotopy classes. …

2006-06-01abs ↗pdf ↗

We describe various handle moves in contact surgery diagrams, notably contact analogues of the Kirby moves. As an application of these handle moves, we discuss the respective classifications of long and loose Legendrian knots.

2008-05-21abs ↗pdf ↗

Given two maps f1 and f2 from the sphere Sm to an n-manifold N, when are they loose, i.e. when can they be deformed away from one another? We study the geometry of their (generic) coincidence locus and its Nielsen decomposition. On the one hand the resulting bordism class of coincidence data and the corresponding Niels…

2010-02-18abs ↗pdf ↗

The study explores Legendrian invariants and half Giroux torsion in contact structures.

problem Understanding Legendrian invariants and their behavior with half Giroux torsion.
method Analysis of Legendrian links with non-vanishing contact invariants and the study of half Giroux torsion.
result Null-homologous links with irreducible complements have non-loose Legendrian realizations with non-zero invariants.

InfoNCE objective is equivalent to ELBO in RPM, linking to self-supervised learning.

problem Improving self-supervised learning methods by connecting them to variational inference.
method Recognizing RPM and showing InfoNCE as a simplified lower bound on MI, equal to ELBO in infinite sample limit.
result The actual InfoNCE objective is equal to the ELBO (up to a constant) in the infinite sample limit.

We set forth a definition of hyperfinite knots. Loosely speaking, these are limits of certain sequences of knots with increasing crossing number. These limits exist in appropriate closures of quotient spaces of knots. We give examples of hyperfinite knots. These examples stem from an application of the Thermodynamic Li…

2006-07-07abs ↗pdf ↗

We prove a complete classification theorem for loose Legendrian knots in an oriented 3-manifold, generalizing results of Dymara and Ding-Geiges. Our approach is to classify knots in a 33-manifold MM that are transverse to a nowhere-zero vector field VV up to the corresponding isotopy relation. Such knots are called …

2014-05-22abs ↗pdf ↗

This is a survey on contact open books and contact Dehn surgery. The relation between these two concepts is discussed, and various applications are sketched, e.g. the monodromy of Stein fillable contact 3-manifolds, the Giroux-Goodman proof of Harer's conjecture on fibred links, construction of symplectic caps to filli…

2010-04-19abs ↗pdf ↗

Recent work used importance sampling ideas for better variational bounds on likelihoods. We clarify the applicability of these ideas to pure probabilistic inference, by showing the resulting Importance Weighted Variational Inference (IWVI) technique is an instance of augmented variational inference, thus identifying th…

2018-08-27abs ↗pdf ↗

We prove a structural theorem that provides a precise local picture of how a sequence of closed embedded minimal hypersurfaces with uniformly bounded index (and volume if the ambient dimension is greater than three) in a Riemannian manifold of dimension at most seven, can degenerate. Loosely speaking, our results show …

2015-09-22abs ↗pdf ↗

We derive a novel norm that corresponds to the tightest convex relaxation of sparsity combined with an 2\ell_2 penalty. We show that this new {\em kk-support norm} provides a tighter relaxation than the elastic net and is thus a good replacement for the Lasso or the elastic net in sparse prediction problems. Through …

2012-04-23abs ↗pdf ↗

We provide sharp lower bounds for the simplicial volume of compact 33-manifolds in terms of the simplicial volume of their boundaries. As an application, we compute the simplicial volume of several classes of 33-manifolds, including handlebodies and products of surfaces with the interval. Our results provide the firs…

2012-08-02abs ↗pdf ↗

This note addresses the construction of a notion of parallel transport along superpaths arising from the concept of a superconnection on a vector bundle over a manifold MM. A superpath in MM is, loosely speaking, a path in MM together with an odd vector field in MM along the path. We also develop a notion of parall…

2007-11-18abs ↗pdf ↗

The power of neural networks lies in their ability to generalize to unseen data, yet the underlying reasons for this phenomenon remain elusive. Numerous rigorous attempts have been made to explain generalization, but available bounds are still quite loose, and analysis does not always lead to true understanding. The go…

2019-06-07abs ↗pdf ↗

We present a confidence-based single-layer feed-forward learning algorithm SPIRAL (Spike Regularized Adaptive Learning) relying on an encoding of activation spikes. We adaptively update a weight vector relying on confidence estimates and activation offsets relative to previous activity. We regularize updates proportion…

2016-11-18abs ↗pdf ↗