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

4285127169 · Jun 202019922001200920172026
48 results for disjoint support

We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).

2008-07-23abs ↗pdf ↗

Multitwists cannot generate all compactly supported mapping class groups on infinite-type surfaces.

problem Generating compactly supported mapping class groups on infinite-type surfaces.
method Analyzing closure of compactly supported mapping class groups and their relation to multitwists.
result Closure of compactly supported mapping class groups is not generated by multitwists.

Neural Bayes simplifies computing complex stats for unsupervised learning.

problem Computing mutual information and optimal labeling of disjoint manifolds in unsupervised learning.
method Parameterization using neural networks to express statistical quantities in closed form.
result Neural Bayes enables efficient computation of mutual information and optimal labeling of disjoint manifolds.

In this paper, under the assumption of Gauss curvature vanishing at infinity, we will prove Meeks' conjecture: the number of disjointly supported minimal graphs in R3\mathbb{R}^3 is at most two.

2011-08-26abs ↗pdf ↗

We give a maximal set of disjoint (1)(-1)-sections of the well-known Lefschetz fibration constructed by Matsumoto, Cadavid and Korkmaz. In fact, we obtain several such sets for a fixed genus, which implies that the Matsumoto-Cadavid-Korkmaz Lefschetz fibration has more than one supporting minimal Lefschetz pencils. We a…

2016-10-26abs ↗pdf ↗

Paper studies regularized KKL divergence for distributions with disjoint supports.

problem Inability of original KKL divergence to handle distributions with disjoint supports.
method Proposes a regularized variant of KKL divergence, derives bounds, and provides closed-form expression.
result Regularized KKL divergence is well-defined for all distributions and has finite-sample bounds.

Study links in contact manifolds using open books and overtwisted disks.

problem Understanding transverse links in contact manifolds.
method Using open book decompositions and overtwisted disks, the support genus of transverse links is studied.
result The support genus of a transverse knot is zero if there is an overtwisted disk disjoint from it.

As a model problem for clustering, we consider the densest k-disjoint-clique problem of partitioning a weighted complete graph into k disjoint subgraphs such that the sum of the densities of these subgraphs is maximized. We establish that such subgraphs can be recovered from the solution of a particular semidefinite re…

2016-03-16abs ↗pdf ↗

We study nn-dimensional area-minimizing currents TT in Rn+1,\mathbb{R}^{n+1}, with boundary T\partial T satisfying two properties: T\partial T is locally a finite sum of (n1)(n-1)-dimensional C1,αC^{1,α} orientable submanifolds which only meet tangentially and with same orientation, for some α(0,1]α\in (0,1]; T\partial T has…

2018-05-02abs ↗pdf ↗

We consider an inverse problem for a hyperbolic partial differential equation on a compact Riemannian manifold. Assuming that Γ1Γ_1 and Γ2Γ_2 are two disjoint open subsets of the boundary of the manifold we define the restricted Dirichlet-to-Neumann operator ΛΓ1,Γ2Λ_{Γ_1,Γ_2}. This operator corresponds the boundary measure…

2010-01-27abs ↗pdf ↗

BDSG generates samples on distribution boundaries, improving anomaly detection.

problem Difficulty in capturing multimodal supports and approximating distribution tails.
method Invertible Residual Network (IResNet) and Residual Flow (ResFlow) for density estimation; compound loss function for boundary samples.
result Competitive performance on synthetic and multimodal data compared to existing methods.

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…

2004-01-28abs ↗pdf ↗

We propose a method for unsupervised domain adaptation that trains a shared embedding to align the joint distributions of inputs (domain) and outputs (classes), making any classifier agnostic to the domain. Joint alignment ensures that not only the marginal distributions of the domain are aligned, but the labels as wel…

2019-05-26abs ↗pdf ↗

Solves a triangulation problem by showing minimum tetrahedra equals minimum integral 3-chain.

problem Finding the minimum number of tetrahedra to extend a triangulation of a 2-sphere to a 3-ball.
method Relates the minimum number of tetrahedra to the minimum integral 3-chain norm, proving them equal and showing how to achieve the minimum.
result The minimum number of tetrahedra needed to extend a triangulation of a 2-sphere to a 3-ball equals the minimum integral 3-chain norm.

We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and def…

2015-08-04abs ↗pdf ↗

We present a new property, the Disjoint Path Concordances Property, of an ENR homology manifold X which precisely characterizes when X times R has the Disjoint Disks Property. As a consequence, X times R is a manifold if and only if X is resolvable and it possesses this Disjoint Path Concordances Property.

2009-03-17abs ↗pdf ↗

New study on time series anomaly detection shows overlapping inference improves performance.

problem Heterogeneous evaluation practices and inference procedures in time series anomaly detection.
method Unified training, tuning, and evaluation protocol on TSB-AD benchmark, analyzing overlapping vs. disjoint inference.
result Overlapping inference yields consistent improvements, with average relative gain up to +28%.

We present DCSVM, an efficient algorithm for multi-class classification using Support Vector Machines. DCSVM is a divide and conquer algorithm which relies on data sparsity in high dimensional space and performs a smart partitioning of the whole training data set into disjoint subsets that are easily separable. A singl…

2018-10-23abs ↗pdf ↗

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…

2019-08-11abs ↗pdf ↗

Neural Processes (NPs) are a class of models that learn a mapping from a context set of input-output pairs to a distribution over functions. They are traditionally trained using maximum likelihood with a KL divergence regularization term. We show that there are desirable classes of problems where NPs, with this loss, f…

2019-10-01abs ↗pdf ↗

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…

2005-11-21abs ↗pdf ↗

Let SS be a compact, connected, oriented surface, possibly with boundary, of negative Euler characteristic. In this article we extend Lindenstrauss-Mirzakhani's and Hamenstädt's classification of locally finite mapping class group invariant ergodic measures on the space of measured laminations $\mathcal{M}\mathcal{L}(…

2018-07-05abs ↗pdf ↗

The paper introduces MU for NMF with ββ-divergences and disjoint constraints.

problem Nonnegative matrix factorization with constraints.
method Design multiplicative updates for NMF based on ββ-divergences with disjoint constraints.
result Multiplicative updates satisfy constraints and decrease the objective function.

New theorem on embedding Moebius bands in 3D space.

problem Proving the impossibility of placing uncountably many disjoint Moebius bands in 3D space.
method Generalization of Grushin and Palamodov's result to tame subsets in R^N and arbitrary topological embeddings in R^3.
result The impossibility of embedding uncountably many pairwise disjoint Moebius bands in 3D space, even for arbitrary topological embeddings.

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

problem Bounding the excess of disjoint nonorientable surfaces in a 4-manifold.
method Combining tubing construction with signature and Euler-characteristic formulas for 2-fold branched covers.
result The normal-Euler excess is bounded by a constant depending only on the ambient 4-manifold.

Natural images may lie on a union of disjoint manifolds rather than one globally connected manifold, and this can cause several difficulties for the training of common Generative Adversarial Networks (GANs). In this work, we first show that single generator GANs are unable to correctly model a distribution supported on…

2018-06-03abs ↗pdf ↗

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.

An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well as over the choice of tractable families used for the variational approximation. In this paper, we present a novel combination of graph part…

2012-07-11abs ↗pdf ↗

A new associative memory uses Sinkhorn divergence for efficient pattern retrieval.

problem Efficiently retrieving patterns from large datasets of weighted point clouds.
method Derived retrieval dynamics as a SHK gradient flow, discretized for a deterministic algorithm.
result Proved basin invariance, geometric convergence, and robust recovery from perturbations.

The following problem was proposed in 2010 by S. Lando. Let MM and NN 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 MM in one sphere and as NN in the ot…

2012-10-27abs ↗pdf ↗

The family of f-divergences is ubiquitously applied to generative modeling in order to adapt the distribution of the model to that of the data. Well-definedness of f-divergences, however, requires the distributions of the data and model to overlap completely in every time step of training. As a result, as soon as the s…

2019-06-01abs ↗pdf ↗

The study classifies solutions to a specific eigenvalue problem and identifies the critical catenoid.

problem Eigenvalue problem on the sphere with boundary conditions.
method Classifying positive solutions as rotationally symmetric and analyzing boundary conditions.
result Characterization of the critical catenoid as the only embedded free boundary minimal annulus.

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

problem Improving classification performance with disjoint labeled datasets using unlabeled data.
method Proposes MTL-SA method to select and augment unlabeled data with confident pseudo labels and close distribution to labeled data.
result Extensive experiments show the effectiveness of MTL-SA method in improving classification performance.