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.

169,051 papers · 148 categories

Trend · papers per month

17.7%35.4%53.1%70.7% · Jun 202019922001200920182026
48 results for open set learning

Study on diagnosing unseen medical conditions using open-set learning.

problem Training models for unseen medical conditions is impractical.
method Frame diagnosis as an open-set learning problem, compare state-of-the-art approaches, and experiment with distributed training data.
result Explicitly modeling unseen conditions leads to consistent gains, but optimal training strategy varies.

Paper tackles open set domain adaptation with theoretical bounds and algorithms.

problem Improving model performance on target domain with unknown classes.
method Theoretical investigation and regularization of open set difference, leading to DAOD algorithm.
result Proposed learning bound and algorithm show superior performance compared to existing methods.

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.

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.

Improved deep learning for one-shot and open-set classification using alignment-based matching.

problem Limited data for one-shot classification and open-set recognition.
method Aligns images to reference images for classification, learns alignment mechanism.
result Significantly improved classification accuracy (e.g., 1.4% error rate in Omniglot, 46.5% in MiniImageNet).

OpenHAIV integrates OOD detection and incremental learning for open-world models.

problem Challenges in open-world recognition, especially in model knowledge updates and OOD detection.
method Unified pipeline combining OOD detection, new class discovery, and incremental fine-tuning.
result Models can autonomously acquire and update knowledge in open-world environments.

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.

This paper reviews FSL for open-world learning, addressing uncertainties and dynamic conditions.

problem Adapting FSL for open-world settings with varying instances, classes, and distributions.
method Categorizes existing open-world FSL methods into three types and discusses their challenges and strengths.
result Standardized experimental settings and benchmarks for comparative analysis of methods.

The VC-dimension of a set system is a way to capture its complexity and has been a key parameter studied extensively in machine learning and geometry communities. In this paper, we resolve two longstanding open problems on bounding the VC-dimension of two fundamental set systems: kk-fold unions/intersections of half-s…

2018-07-20abs ↗pdf ↗

Method transfers knowledge between partially labeled domains to classify all samples.

problem Weakly supervised open-set domain adaptation between partially labeled domains.
method Collaborative Distribution Alignment (CDA) method for bilaterally knowledge transfer and outlier identification.
result Achieves state-of-the-art performance on Office benchmark and person reidentification.

The novel unseen classes can be formulated as the extreme values of known classes. This inspired the recent works on open-set recognition \cite{Scheirer_2013_TPAMI,Scheirer_2014_TPAMIb,EVM}, which however can have no way of naming the novel unseen classes. To solve this problem, we propose the Extreme Value Learning (E…

2017-05-28abs ↗pdf ↗

OpenViewer tackles multi-view learning challenges with interpretability and generalization.

problem Lack of interpretability and insufficient generalization in multi-view learning models.
method OpenViewer introduces a Pseudo-Unknown Sample Generation Mechanism, Expression-Enhanced Deep Unfolding Network, and Perception-Augmented Open-Set Training Regime.
result OpenViewer effectively addresses openness challenges and enhances recognition performance for both known and unknown samples.

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.

Unified approach to continual learning using generative replay and open set recognition.

problem Catastrophic interference and recognition of out-of-distribution data in deep neural networks.
method Probabilistic approach based on variational inference in a deep autoencoder model, using generative replay and open set recognition.
result The approach significantly alleviates catastrophic interference and distinguishes out-of-distribution data.

Despite significant progress in object categorization, in recent years, a number of important challenges remain, mainly, ability to learn from limited labeled data and ability to recognize object classes within large, potentially open, set of labels. Zero-shot learning is one way of addressing these challenges, but it …

2016-04-24abs ↗pdf ↗

Apache Spark is a popular open-source platform for large-scale data processing that is well-suited for iterative machine learning tasks. In this paper we present MLlib, Spark's open-source distributed machine learning library. MLlib provides efficient functionality for a wide range of learning settings and includes sev…

2015-05-26abs ↗pdf ↗

ProSub uses angles in feature space to classify data as in- or out-of-distribution.

problem Open-set semi-supervised learning with unknown classes.
method Probabilistic approach based on angles in feature space, estimating conditional distributions of scores.
result ProSub achieves state-of-the-art performance on benchmark problems.

Skew-Fit learns goal distributions for reinforcement learning, enabling state coverage.

problem Learning flexible skills without manual reward design.
method Formal exploration objective for maximizing state coverage, combined with entropy maximization.
result Skew-Fit converges to a uniform state distribution, enabling new skill learning.

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.

HRL improves open-domain dialog models by optimizing long-term conversational goals.

problem Challenges in open-domain dialog generation, including repetitive outputs, difficulty tracking conversational goals, and inappropriate text.
method Proposes VHRL, a hierarchical reinforcement learning approach using policy gradients to tune utterance-level embeddings of a variational sequence model.
result Significant improvements in human evaluation and automatic metrics over state-of-the-art dialog models.

Study tackles open-set camera model identification, improving over state-of-the-art.

problem Identifying camera models from unknown ones in open-set scenarios.
method Feature extraction algorithms and classifiers for open-set recognition, evaluating different training protocols.
result A simple open-set training protocol yields the best results, improving over state-of-the-art solutions.

Open and discrete maps with specific branch set images are equivalent to PL branched covers.

problem Understanding the equivalence of open and discrete maps and PL branched covers.
method Demonstrated that an open and discrete map f ⁣:SnoSnf \colon \mathbb{S}^n o \mathbb{S}^n with a specific branch set image is equivalent to a PL branched cover up to homeomorphism.
result Open and discrete maps with a specific branch set image are equivalent to PL branched covers.

New analysis shows uncertainty-based methods alone aren't enough for open set recognition.

problem Overcoming the challenge of recognizing out-of-distribution data.
method Comparing predictive uncertainty with extreme value theory and generative models.
result Generative model-based open set recognition outperforms other methods.