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

Trend · papers per month

219437656874 · Jun 202019922001200920172026
48 results for open set

This paper proposes a method to use deep neural networks as end-to-end open-set classifiers. It is based on intra-class data splitting. In open-set recognition, only samples from a limited number of known classes are available for training. During inference, an open-set classifier must reject samples from unknown class…

2019-03-12abs ↗pdf ↗

The study connects periodic surface homeomorphisms to contact structures using rational open books.

problem Understanding the properties of contact structures associated with periodic surface homeomorphisms.
method Associate rational open books to marked data sets, study contact structures, and prove Stein fillability conditions.
result A class of data sets gives rise to Stein fillable contact structures under certain combinatorial conditions.

A new method trains deep neural networks for open set domain adaptation without negative open set difference.

problem Training deep neural networks for open set domain adaptation without negative open set difference.
method Proposes a new upper bound of target-domain risk, including source-domain risk, ε-open set difference (ΔεΔ_ε), distributional discrepancy, and constant. Uses gradient descent for source-domain risk and ΔεΔ_ε, and adversarial training for distributional discrepancy. Trains DNNs via minimizing the new upper bound.
result Shows state-of-the-art performance on benchmark datasets.

Integrates multiple datasets to solve open set crowdsourcing problems.

problem Crowdsourcing with unknown label space and unfamiliar tasks.
method Integrates multiple crowdsourced datasets, weights them based on category correlation, and uses open set transfer learning.
result Proves OSCrowd solves open set crowdsourcing problems and outperforms related solutions.

The aim of unsupervised domain adaptation is to leverage the knowledge in a labeled (source) domain to improve a model's learning performance with an unlabeled (target) domain -- the basic strategy being to mitigate the effects of discrepancies between the two distributions. Most existing algorithms can only handle uns…

2019-07-19abs ↗pdf ↗

Minimal topology on surface homeomorphisms proven.

problem Proving the compact-open topology is minimal for surface homeomorphisms.
method Combining Hausdorff group topology properties and automatic continuity results.
result Compact-open topology is unique Hausdorff separable group topology on surface homeomorphisms.

Camera model identification refers to the problem of linking a picture to the camera model used to shoot it. As this might be an enabling factor in different forensic applications to single out possible suspects (e.g., detecting the author of child abuse or terrorist propaganda material), many accurate camera model att…

2019-04-11abs ↗pdf ↗

Often, when dealing with real-world recognition problems, we do not need, and often cannot have, knowledge of the entire set of possible classes that might appear during operational testing. In such cases, we need to think of robust classification methods able to deal with the "unknown" and properly reject samples belo…

2016-06-13abs ↗pdf ↗

This work bridges continual learning, active learning, and open set recognition in deep neural networks.

problem Protecting previously acquired representations from catastrophic forgetting in deep neural networks.
method Surveying the literature and proposing a consolidated view to integrate open set recognition and active learning principles.
result Joint improvement in alleviating catastrophic forgetting, querying data, selecting task orders, and robust open world application.

CGDL improves open set recognition by learning conditional Gaussian distributions.

problem Handling unknown samples in real-world recognition tasks.
method Conditional Gaussian Distribution Learning (CGDL) with probabilistic ladder architecture.
result CGDL significantly outperforms baseline methods on standard image datasets.

Proposes a new framework for open set recognition using conditional probabilistic generative models.

problem Unknown samples can mislead traditional deep neural networks during testing.
method Conditional Probabilistic Generative Models (CPGM) that combine generative models with discriminative information.
result Significantly outperforms baselines on multiple benchmark datasets.

Machine-learned diagnosis models have shown promise as medical aides but are trained under a closed-set assumption, i.e. that models will only encounter conditions on which they have been trained. However, it is practically infeasible to obtain sufficient training data for every human condition, and once deployed such …

2019-10-07abs ↗pdf ↗

Free groups can be end homogeneity groups of 3-manifolds.

problem Tackling the possibility of free groups as end homogeneity groups of 3-manifolds.
method Constructing specific 3-manifolds with end homogeneity groups isomorphic to free groups.
result For every finitely generated free group, there exists an irreducible open 3-manifold with that group as its end homogeneity group.

New bounds on inscribed triangles in arbitrary planar domains.

problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.

This paper introduces a new type of open book decomposition for a contact three-manifold with a specified characteristic foliation Fξ\mathcal{F}_ξ on its boundary. These \textit{foliated open books} offer a finer tool for studying contact manifolds with convex boundary than existing models, as the boundary foliation ca…

2020-02-05abs ↗pdf ↗

New method for estimating class proportions in open-set label shift data.

problem Estimating class proportions and distributions when test data includes novel classes.
method Semiparametric density ratio model framework with maximum empirical likelihood estimators and confidence intervals.
result Improved estimation accuracy and classification performance compared to existing methods.

In the paper arXiv:1411.4887 [math.AP] it is shown that the set of Riemannian metrics which do not admit global limiting Carleman weights is open and dense, by studying the conformally invariant Weyl and Cotton tensors. In the paper arXiv:1011.2507 [math.DG] it is shown that the set of Riemannian metrics which do not a…

2015-09-07abs ↗pdf ↗

Paper develops a new method for open-set and imbalanced classification with valid prediction sets.

problem Tackles open-set and imbalanced classification with new prediction methods.
method Develops a new family of conformal p-values and a selective sample splitting algorithm.
result Valid prediction sets with valid coverage in open-set scenarios and informative predictions under extreme class imbalance.

This paper presents some partial answers to the following question. QUESTION. If a normal space X is the union of an increasing sequence of open sets U(1), U(2), U(3) ... such that each U(n) contracts to a point in X, must X be contractible? The main results of the paper are: THEOREM 1. If a normal space X is the union…

2016-06-16abs ↗pdf ↗

Open category detection is the problem of detecting "alien" test instances that belong to categories or classes that were not present in the training data. In many applications, reliably detecting such aliens is central to ensuring the safety and accuracy of test set predictions. Unfortunately, there are no algorithms …

2018-08-01abs ↗pdf ↗

In open set learning, a model must be able to generalize to novel classes when it encounters a sample that does not belong to any of the classes it has seen before. Open set learning poses a realistic learning scenario that is receiving growing attention. Existing studies on open set learning mainly focused on detectin…

2018-09-20abs ↗pdf ↗

We propose a list of open problems in pluripotential theory partially motivated by their applications to complex differential geometry. The list includes both local questions as well as issues related to the compact complex manifold setting.

2015-11-02abs ↗pdf ↗

The paper proves removable singularity for nonlocal minimal graphs.

problem Proving removable singularities for nonlocal minimal graphs.
method Analyzing (s,1)(s, 1)-capacity zero compact sets to ensure graphs are minimal in the entire domain.
result Nonlocal minimal graphs are removable in the entire domain if they are minimal in a set of (s,1)(s, 1)-capacity zero.