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

Trend · papers per month

237474711948 · Jun 202019922001200920172026
48 results for thin networks

The paper examines rigidity of thin domains under specific boundary conditions.

problem Linear geometric rigidity of shallow thin domains with zero Dirichlet boundary conditions.
method Analyzes two scaling regimes for ε in (h, √h] and (√h, 1), proving rigidity formulas.
result Rigidity does not depend on curvature in the small parameter regime ε ∈ (h, √h].

The pioneer deep neural networks (DNNs) have emerged to be deeper or wider for improving their accuracy in various applications of artificial intelligence. However, DNNs are often too heavy to deploy in practice, and it is often required to control their architectures dynamically given computing resource budget, i.e., …

2018-07-07abs ↗pdf ↗

We define a new notion of thin position for a graph in a 3-manifold which combines the ideas of thin position for manifolds first originated by Scharlemann and Thompson with the idea of thin position for knots first originated by Gabai. This thin position has the property that connect summing annuli and pairs-of-pants …

2016-06-10abs ↗pdf ↗

New method finds all thin film structures from reflectometry data.

problem Computational prohibitive for standard algorithms, leading to unreliable analysis.
method Prior-Amortized Neural Posterior Estimation (PANPE) combining simulation-based inference and adaptive priors.
result Identifies all realistic structures in seconds, setting new standards in reflectometry.

Let k be a knot in S3. In [8], H.N. Howards and J. Schultens introduced a method to construct a manifold decomposition of double branched cover of (S3, k) from a thin position of k. In this article, we will prove that if a thin position of k induces a thin decomposition of double branched cover of (S3,k) by Howards and…

2010-01-06abs ↗pdf ↗

Abby Thompson proved that if a link KK is in thin position but not in bridge position then the knot complement contains an essential meridional planar surface, and she asked whether some thin level surface must be essential. This note is to give a positive answer to this question, showing that the if a link is in thin…

2006-10-27abs ↗pdf ↗

New method characterizes thin links via Conway spheres and tangle decompositions.

problem Characterize thin links without relying on specific knot invariants.
method Developed a relative version of thinness for tangles and used it to characterize thinness via tangle decompositions along Conway spheres.
result Characterized thin links via Conway spheres and tangle decompositions.

Data thinning splits observations into independent parts for convolution-closed distributions.

problem Validation of unsupervised learning results in settings with limited data.
method Data thinning, splitting observations into independent parts following the same distribution.
result Data thinning provides an attractive alternative to cross-validation in settings with limited sample splitting.

Kernel thinning compresses distributions more effectively than i.i.d. sampling or standard thinning.

problem Efficiently compressing distributions for better sampling and integration accuracy.
method Introduces kernel thinning, a procedure that compresses an n-point approximation of a distribution into a sqrt(n)-point approximation with comparable integration error.
result Kernel thinning achieves a maximum discrepancy in integration error of O_d(n^(-1/2) sqrt(log n)) in probability for compactly supported distributions and O_d(n^(-1/2) (log n)^(d+1/2) sqrt(log log n)) for sub-exponential distributions.

Deep neural networks have become the default choice for many of the machine learning tasks such as classification and regression. Dropout, a method commonly used to improve the convergence of deep neural networks, generates an ensemble of thinned networks with extensive weight sharing. Recent studies that dropout can b…

2019-04-09abs ↗pdf ↗

Wu has shown that if a link or a knot LL in S3S^3 in thin position has thin spheres, then the thin sphere of lowest width is an essential surface in the link complement. In this paper we show that if we further assume that LS3L \subset S^3 is prime, then the thin sphere of lowest width also does not have any vertical c…

2008-01-12abs ↗pdf ↗

We show that every thin position for a connected sum of small knots is obtained in an obvious way: place each summand in thin position so that no two summands intersect the same level surface, then connect the lowest minimum of each summand to the highest maximum of the adjacent summand below.

2002-05-12abs ↗pdf ↗

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…

2004-04-15abs ↗pdf ↗

In this paper, we give an algorithm to build all compact orientable atoroidal Haken 3-manifolds with tori boundary or closed orientable Haken 3-manifolds, so that in both cases, there are embedded closed orientable separating incompressible surfaces which are not tori. Next, such incompressible surfaces are related to …

2015-11-03abs ↗pdf ↗

In this paper we produce many examples of thin subgroups of special linear groups that are isomorphic to the fundamental groups of non-arithmetic hyperbolic manifolds. Specifically, we show that the non-arithmetic lattices in SO(n,1)\mathrm{SO}(n,1) constructed by Gromov and Piatetski-Shapiro can be embedded into $\mathrm{S…

2019-11-16abs ↗pdf ↗

We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…

2014-08-15abs ↗pdf ↗

New PDMP samplers improve BNN inference with accelerated computation.

problem Inference on Bayesian Neural Networks violates independence and posterior assumptions.
method Piecewise Deterministic Markov Process (PDMP) with adaptive thinning for inhomogenous Poisson Process (IPPs) sampling.
result PDMP samplers accelerate inference in BNNs, improving accuracy and mixing performance.

This paper proposes learning to jump for generative modeling of sparse, skewed, heavy-tailed data.

problem Limited ability of diffusion models in modeling sparse, skewed, heavy-tailed data.
method Forward count thinning process and reverse count thickening process to train a deep neural network.
result Learning to jump performs better than learning to denoise for non-negative, sparse data.

We generalize the definition of thin position of Scharlemann and Thompson for compact orientable 3-manifolds with torus boundary components and introduce αα-sloped generalized Heegaard splittings. We examine its relationship to generalized Heegaard splittings of manifolds resulting from Dehn filling. We compare alpha-…

2011-02-15abs ↗pdf ↗

Let MM be a finite volume oriented Riemannian manifold of dimension n3n\geq 3 and curvature in [b2,1][-b^2,-1], with thick-thin decomposition M=M(thick)M(thin)M=M(thick)\cup M(thin). Denote by λk(M(thick))λ_k(M(thick)) the k-th eigenvalue for the Laplacian on M(thick)M(thick), with Neumann boundary conditdions. We show that λk(M(thick))/3λk(M)λ_k(M(thick))/3\leq λ_k(M)

2018-10-11abs ↗pdf ↗

Two subset germs of Euclidean spaces are called blow-spherically equivalent, if their spherical modifications are homeomorphic and the homeomorphism induces homeomorphic tangent links. Blow-spherical equivalence is stronger than the topological equivalence but weaker than the Lipschitz equivalence. We introduce the thi…

2015-05-27abs ↗pdf ↗

The study finds non-uniform lattices with thin Hitchin representations in specific Lie groups.

problem Finding thin Hitchin representations in non-uniform lattices of Lie groups.
method Arithmetic methods to construct thin Hitchin representations.
result Infinitely many orbits of thin Hitchin representations in non-uniform lattices.