arXiv research

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

A new classification method using disjoint centroids and normalized distance.

Improved defense against data poisoning attacks by aggregating smaller subsets.

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…

In order to decode the human brain, Multivariate Pattern (MVP) classification generates cognitive models by using functional Magnetic Resonance Imaging (fMRI) datasets. As a standard pipeline in the MVP analysis, brain patterns in multi-subject fMRI dataset must be mapped to a shared space and then a classification mod…

Approximates cycles in planar and bounded-genus graphs.

We show that all finite-dimensional resolvable generalized manifolds with the piecewise disjoint arc-disk property are codimension one manifold factors. We then show how the piecewise disjoint arc-disk property and other general position properties that detect codimension one manifold factors are related. We also note …

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.

In a recent work, [19] studied the following "fair" variants of classical clustering problems such as $k$-means and $k$-median: given a set of $n$ data points in $\mathbb{R}^d$ and a binary type associated to each data point, the goal is to cluster the points while ensuring that the proportion of each type in each clus…

A collaborative algorithm reduces regret in federated linear contextual bandits.

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…

Uniform bounds found for Sierpinski carpet hyperbolic components.

A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch which we call non-classical interval exchanges, form a subclass of linear involutions without flips. They are analogs of classical interval exchanges, and are…

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…

The notion of task similarity is at the core of various machine learning paradigms, such as domain adaptation and meta-learning. Current methods to quantify it are often heuristic, make strong assumptions on the label sets across the tasks, and many are architecture-dependent, relying on task-specific optimal parameter…

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

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).

We note a simple algebraic proof of Frolkina's result that $\mathbb R^3$ does not contain uncountably many pairwise disjoint copies of the Möbius band, and of a similar result in higher dimensions.

We show that many algebraic actions of higher-rank abelian groups on zero-dimensional groups are mutually disjoint. The proofs exploit differences in the entropy geometry arising from subdynamics and a form of Abramov--Rokhlin formula for half-space entropies.

New theorem on embedding Moebius bands in 3D space.

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

We continue to develop our neural network (NN) based forecasting approach to anomaly detection (AD) using the Secure Water Treatment (SWaT) industrial control system (ICS) testbed dataset. We propose genetic algorithms (GA) to find the best NN architecture for a given dataset, using the NAB metric to assess the quality…

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

Satellite knots can be trivialized by a single band move.

New embeddings show answer to Baker-Laidacker question can be yes or no.

Embeddings of pairs of disjoint nonparallel primitive simple closed curves in the boundary of a genus two handlebody are classified. Briefly, two disjoint primitives either lie on opposite ends of a product $F \boldsymbol{\times} I$, or they lie on opposite ends of a kind of "twisted" product $F \widetilde{\boldsymbol{…

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

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

Simple curves enclose two small disks if they're wide and bend moderately.

Neural Bayes simplifies computing complex stats for unsupervised learning.

s-OTDD compares datasets efficiently without training, robust to class variations.

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…

Model compression has emerged as an important area of research for deploying deep learning models on Internet-of-Things (IoT). However, for extremely memory-constrained scenarios, even the compressed models cannot fit within the memory of a single device and, as a result, must be distributed across multiple devices. Th…

After giving a general introduction to the main known results on the anisotropic Calder{ó}n problem on n-dimensional compact Riemannian manifolds with boundary, we give a motivated review of some recent non-uniqueness results obtained in [5, 6] for the anisotropic Calder{ó}n problem at fixed frequency, in dimension n $…

A new algorithm for personalized recommendations adapts to changing user interests.

Current multi-reference style transfer models for Text-to-Speech (TTS) perform sub-optimally on disjoints datasets, where one dataset contains only a single style class for one of the style dimensions. These models generally fail to produce style transfer for the dimension that is underrepresented in the dataset. In th…

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

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

Paper proposes a clustering algorithm for nonnegative data.

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…

New method merges MCMC samples without distributional assumptions.

We study the problem of estimating the expected reward of the optimal policy in the stochastic disjoint linear bandit setting. We prove that for certain settings it is possible to obtain an accurate estimate of the optimal policy value even with a number of samples that is sublinear in the number that would be required…

Study on planar graph braid groups' second homology.

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 …

We provide a self-contained treatment of set-theoretic subsolutions to flow by mean curvature, or, more generally, to flow by mean curvature plus an ambient vector field. The ambient space can be any smooth Riemannian manifold. Most importantly, we show that if two such set-theoretic subsolutions are initially disjoint…

Short proofs for complex Tverberg theorems using prime powers.

In this paper we consider compact, Riemannian manifolds $M_1, M_2$ each equipped with a one-parameter family of metrics $g_1(t), g_2(t)$ satisfying the Ricci flow equation. Motivated by a characterization of the super Ricci flow developed by McCann-Topping, we introduce the notion of a super Ricci flow for a family of …

We use tropical curves and toric degeneration techniques to construct closed embedded Lagrangian rational homology spheres in a lot of Calabi-Yau threefolds. We apply this construction to the tropical curves obtained from the 2875 lines on the quintic Calabi-Yau threefold. Each admissible tropical curve gives a Lagrang…