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

Trend · papers per month

3857711,1561,541 · Jun 202019922001200920172026
48 results for open-world learning

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.

Neural approach enhances AI trustworthiness, generalization, and robustness.

problem Challenges in explaining, generalizing, and adapting AI models to uncertain environments.
method Customized trustworthy networks, flexible learning regularizers, open-world recognition losses.
result Significant performance improvements across various open-world multimedia recognition scenarios.

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.

OwMatch improves open-world semi-supervised learning by self-labeling and consistency.

problem Misclassification of unseen classes in open-world semi-supervised learning.
method Conditional self-labeling and open-world hierarchical thresholding.
result OwMatch enhances performance across known and unknown classes.

As we enter into the big data age and an avalanche of images have become readily available, recognition systems face the need to move from close, lab settings where the number of classes and training data are fixed, to dynamic scenarios where the number of categories to be recognized grows continuously over time, as we…

2016-04-08abs ↗pdf ↗

This paper evaluates knowledge graph completion models under the open-world assumption, revealing unexpected behavior of metrics.

problem Evaluation of knowledge graph completion models often assumes a closed-world assumption, which can lead to misleading results.
method The paper studies KGC evaluation under the open-world assumption, analyzing the behavior of metrics like MRR and Hits@K.
result Metrics like MRR and Hits@K can show significant degradation under the open-world assumption, leading to incorrect model comparisons.

We present a framework capable of tackilng the problem of continual object recognition in a setting which resembles that under whichhumans see and learn. This setting has a set of unique characteristics:it assumes an egocentric point-of-view bound to the needs of a singleperson, which implies a relatively low diversity…

2019-12-06abs ↗pdf ↗

In a real-world setting, visual recognition systems can be brought to make predictions for images belonging to previously unknown class labels. In order to make semantically meaningful predictions for such inputs, we propose a two-step approach that utilizes information from knowledge graphs. First, a knowledge-graph r…

2017-08-28abs ↗pdf ↗

For a broad variety of critical applications, it is essential to know how confident a classification prediction is. In this paper, we discuss the drawbacks of softmax to calculate class probabilities and to handle uncertainty in Bayesian neural networks. We introduce a new kind of prediction layer called radial predict…

2019-05-27abs ↗pdf ↗

ATOM improves robust OOD detection by mining informative auxiliary examples.

problem Robust OOD detection in open-world settings is challenging due to adversarial inputs.
method ATOM combines adversarial training with outlier mining to improve robustness.
result ATOM achieves state-of-the-art performance in OOD detection, reducing FPR by up to 57.99%.

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.

A new OOD detector using an overlap index improves accuracy without high computational costs.

problem Effective OOD detection for machine learning models in open-world scenarios.
method Proposes an overlap index-based confidence score function for OOD detection.
result The proposed method achieves competitive accuracy with lower computational costs compared to state-of-the-art detectors.

OBSER framework infers sub-environments from objects, outperforming scene-based methods.

problem Zero-shot recognition of environments from object distributions.
method Bayesian framework using metric and self-supervised learning models to estimate object distributions in latent space.
result OBSER framework reliably performs inference in open-world and photorealistic environments, outperforming scene-based methods.

TULiP estimates uncertainty for deep learning models safely.

problem Reliable uncertainty estimation for deep learning models in the open world.
method TULiP considers a hypothetical perturbation, bounds its effect, and computes uncertainty from sampled predictions.
result TULiP achieves state-of-the-art performance in OOD detection benchmarks.

P-OCS detects OOD samples in a low-dimensional subspace, outperforming existing methods.

problem Efficient OOD detection for deep learning models in open-world environments.
method P-OCS operates in the orthogonal complement of the principal subspace, applying a single projected perturbation.
result P-OCS achieves state-of-the-art OOD detection with negligible computational cost and without requiring model retraining.

In real-world recognition/classification tasks, limited by various objective factors, it is usually difficult to collect training samples to exhaust all classes when training a recognizer or classifier. A more realistic scenario is open set recognition (OSR), where incomplete knowledge of the world exists at training t…

2018-11-21abs ↗pdf ↗

The sample inefficiency of standard deep reinforcement learning methods precludes their application to many real-world problems. Methods which leverage human demonstrations require fewer samples but have been researched less. As demonstrated in the computer vision and natural language processing communities, large-scal…

2019-07-29abs ↗pdf ↗

Study how actions affect perception in embodied agents using group theory.

problem Understanding how actions influence perception in autonomous agents.
method Mathematical formalism of group theory applied to sensory commutativity of action sequences.
result Introduced Sensory Commutativity Probability (SCP) to measure action effects on perception.

At present, object recognition studies are mostly conducted in a closed lab setting with classes in test phase typically in training phase. However, real-world problem is far more challenging because: i) new classes unseen in the training phase can appear when predicting; ii) discriminative features need to evolve when…

2019-08-26abs ↗pdf ↗

The study proposes a framework to accept OOD data based on competence scores.

problem Silent failures in Domain Generalization where models reject OOD data without proper justification.
method A learning to reject framework using proxy incompetence scores to predict trustworthiness.
result Increasing incompetence scores are predictive of reduced accuracy, but not always favorable for accuracy/rejection trade-off.

Framework uses human feedback to safely set OOD detection thresholds, reducing false positives.

problem Challenges in setting OOD detection thresholds for safety-critical applications.
method Mathematically grounded framework leveraging expert feedback to dynamically update thresholds.
result Guaranteed to meet FPR constraint while minimizing human feedback, maintaining FPR at most 5%.

Medix uses the median to detect outliers from unlabeled data for robust OOD detection.

problem Challenges in using unlabeled data for OOD detection due to mixed InD and OOD samples.
method Introduces Medix, a framework using the median operation to identify outliers from unlabeled data.
result Empirical results show Medix outperforms existing methods in open-world settings.

Self-consistency improves the accuracy of model comparison methods.

problem Improving the accuracy of model comparison methods when simulation models are misspecified.
method Supplement traditional simulation-based training with a self-consistency loss on unlabeled real data.
result Self-consistency training improves model comparison accuracy, especially in open-world scenarios.

New framework detects near vs. far out-of-distribution samples for AI safety.

problem Binary OOD detection fails to distinguish between semantically close and distant unknown risks.
method Ternary classification based on Low-Entropy Semantic Manifolds and Semantic Surprise Vector.
result Framework achieves state-of-the-art performance on ternary OOD detection task.

Meta-learning improves neural networks by adapting learning algorithms.

problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.

Machine learning models adapt to motor learning but face challenges.

problem Adapting machine learning to handle motor variability and differentiate new movements from known ones.
method Parameter adaptation, transfer and meta-learning, reinforcement learning.
result Challenges in applying machine learning models for motor learning support systems.

New method uses bi-level optimization to learn useful representations for imitation learning.

problem Learning useful representations for multiple tasks in imitation learning settings.
method Formulates representation learning as a bi-level optimization problem.
result Bi-level optimization framework provides sample complexity benefits for imitation learning.

Tabular Q-Learning with learned state abstractions solves continuous control tasks.

problem Challenging reinforcement learning problems in continuous control.
method Learned state abstraction to transform continuous state-space into discrete.
result Tabular Q-Learning with learned abstractions achieves efficient learning in unseen tasks.

Study Whittle index learning algorithms for restless bandits with constant stepsizes.

problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.

New unsupervised learning technique learns independent kernels for better machine learning tasks.

problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.

New self-imitation learning method improves performance in continuous control tasks.

problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.

Deep reinforcement learning finds optimal learning policies for adaptive systems.

problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.