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

Trend · papers per month

20395978 · Jun 202019922001200920172026
48 results for disjoint faces

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.

A zigzag in a map (a 22-cell embedding of a connected graph in a connected closed 22-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a common vertex, 2) for any three consecutive edges the first and the third edges are …

2017-08-14abs ↗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.

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 ↗

The topological Tverberg conjecture was considered a central unsolved problem of topological combinatorics. The conjecture asserts that for any integers r,d>1r,d>1 and any continuous map f:ΔRdf:Δ\to\mathbb R^d of the (d+1)(r1)(d+1)(r-1)-dimensional simplex there are pairwise disjoint faces σ1,,σrΔσ_1,\ldots,σ_r\subsetΔ such that $f(σ_1)…

2016-05-17abs ↗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 ↗

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 ↗

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 ↗

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.

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 ↗

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.

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.

In this paper, we provide a construction of a state-sum model for finite gauge-group Dijkgraaf-Witten theory on surfaces with codimension 1 defects. The construction requires not only that the triangulation be subordinate to the filtration, but flag-like: each simplex of the triangulation is either disjoint from the de…

2015-07-03abs ↗pdf ↗

With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing \emph{cancelable biometric} technologies is on the rise. Because the problem of cancelable template generation deals with the trade-off between template security and matching performance, many …

2014-01-17abs ↗pdf ↗

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 paper determines the structure of Kakimizu complexes for genus one hyperbolic knots.

problem Understanding the structure of Kakimizu complexes for genus one hyperbolic knots.
method Analyzing the simplicial complex of minimal genus Seifert surfaces in the exterior of the knots.
result The Kakimizu complex for genus one hyperbolic knots consists of a single dd-simplex for d=0,4d=0,4 and otherwise of at most two dd-simplices which intersect in a common (d1)(d-1)-face.

SASE improves attributed graph clustering for large graphs with linear time and space complexity.

problem Challenges in clustering large attributed graphs due to high computational and memory costs.
method SASE combines node features smoothing, scalable spectral clustering, and adaptive order selection.
result SASE achieves a 6.9% improvement in ACC and a 5.87x speedup on the ArXiv dataset.

Developed a theory for SU3SU_3-skein algebras on surfaces, proving finitely generated property.

problem Quantization of SL(3)SL(3)-character varieties of surfaces.
method Theory of canonical forms of webs, ideal triangulations, and crossbar moves.
result Reduced SU3SU_3-skein algebra of any surface of finite type is finitely generated.

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.

Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an infinite family of distinct Ricci-flat graphs of girth four with edge-disjoint 4-cycles…

2018-07-19abs ↗pdf ↗

A biclustering algorithm finds dense disjoint subgraphs in weighted bipartite graphs.

problem Finding dense disjoint bicliques in a weighted bipartite graph.
method Semidefinite programming-based branch-and-cut algorithm with upper and lower bounds.
result The algorithm can solve much larger instances than general-purpose solvers.

Optimizes master faces for 2D and 3D face verification using evolutionary algorithms and neural networks.

problem Impersonation attacks using master faces for face-based identity authentication.
method Evolutionary algorithm in latent space of StyleGAN, neural network to direct search, 2D and 3D face reconstruction.
result Obtains high impersonation rates with fewer master faces for 2D and 3D face verification.

Denote by ΔMΔ_M the MM-dimensional simplex. A map f ⁣:ΔMRdf\colon Δ_M\to\mathbb R^d is an almost rr-embedding if fσ1fσr=fσ_1\cap\ldots\cap fσ_r=\emptyset whenever σ1,,σrσ_1,\ldots,σ_r are pairwise disjoint faces. A counterexample to the topological Tverberg conjecture asserts that if rr is not a prime power and d2r+1d\ge2r+1, then th…

2019-08-23abs ↗pdf ↗

We study the structure of finite quandles in terms of subquandles. Every finite quandle QQ decomposes in a natural way as a union of disjoint QQ-complemented subquandles; this decomposition coincides with the usual orbit decomposition of QQ. Conversely, the structure of a finite quandle with a given orbit decomposit…

2005-08-14abs ↗pdf ↗

Let Y be a compact, oriented 3-manifold with a contact form a. For any Dirac operator D, we study the asymptotic behavior of the spectral flow between D and D+cl(-ira) as r very large. If a is the Thurston-Winkelnkemper contact form whose monodromy is the product of Dehn twists along disjoint circles, we prove that the…

2011-04-26abs ↗pdf ↗

Face recognition systems are vulnerable to composite face reconstruction attacks.

problem Vulnerability of face recognition systems to composite face reconstruction attacks.
method Assumed attacker uses composite face parts to reconstruct faces faster and more efficiently.
result Current face recognition systems are extremely vulnerable to random search attacks.

Improved defense against data poisoning attacks by aggregating smaller subsets.

problem Mitigating the impact of poisoned data on model robustness.
method Finite Aggregation method that combines duplicates of smaller disjoint subsets for training.
result Consistent improvement in certified robustness bounds, up to 4.77% on GTSRB.

In this paper we study how to distinguish two embeddings of a finite collection of disjoint circles into the plane up to planar isotopy. We adopt the spirit of the approach by V. Turaev, Operator Invariants of Tangles, Math. USSR-Izv. 35 (1990), 411--444, by considering a category of planar tangles and representing it …

2005-04-17abs ↗pdf ↗