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.
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.
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 information theory in open-world machine learning.
problem Lack of a unified theoretical foundation for open-world machine learning.
method Synthesis of information theoretic approaches.
result Established a pathway toward provable and trustworthy open world intelligence.
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.
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…
A large body of recent work has investigated the phenomenon of evasion attacks using adversarial examples for deep learning systems, where the addition of norm-bounded perturbations to the test inputs leads to incorrect output classification. Previous work has investigated this phenomenon in closed-world systems where …
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…
COME replaces entropy minimization to prevent model collapse.
problem Overconfidence in entropy minimization leads to model collapse.
method COME explicitly models uncertainty with a Dirichlet prior distribution.
result COME achieves state-of-the-art performance on various TTA settings.
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.
WILD-SCAV benchmarks AI in complex 3D FPS environments.
problem Lack of complexity and diversity in RL environments.
method Developed a 3D open-world FPS game environment.
result Demonstrates effectiveness in benchmarking RL algorithms.
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…
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…
DreamerV3 learns diverse tasks with a single configuration.
problem Generalizing reinforcement learning across multiple domains.
method World model and farsighted strategies.
result Outperforms specialized methods across 150 diverse tasks.
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%.
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.
Method monitors neural networks using topological properties.
problem Detecting data shifts and out-of-distribution samples.
method Topological Uncertainty based on activation graphs.
result Validates network predictions without retraining.
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…
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.
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…
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.
Federated Learning (FL) systems are gaining popularity as a solution to training Machine Learning (ML) models from large-scale user data collected on personal devices (e.g., smartphones) without their raw data leaving the device. At the core of FL is a network of anonymous user devices sharing training information (mod…
As machine learning systems move from computer-science laboratories into the open world, their accountability becomes a high priority problem. Accountability requires deep understanding of system behavior and its failures. Current evaluation methods such as single-score error metrics and confusion matrices provide aggr…
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…
Perception of artificial agents is one the grand challenges of AI research. Deep Learning and data-driven approaches are successful on constrained problems where perception can be learned using supervision, but do not scale to open-worlds. In such case, for autonomous embodied agents with first-person sensors, percepti…
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.
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.
Graphs evolve; GNNs learn from past tasks.
problem Learning from evolving graphs and new classes.
method Incremental training method for lifelong learning on graphs.
result Less than 50% of the GNN's receptive field is needed for 95% accuracy.
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%.
Novel approach trains LLMs for inductive reasoning using probabilistic programs.
problem Training LLMs for inductive reasoning with sparse, ambiguous data.
method Program-based Posterior Training (PPT) using probabilistic inference.
result Significant improvement in estimation accuracy and alignment with human judgments.
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.
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.
Proposes a weaker faithfulness assumption for causal discovery.
problem Violation of the faithfulness assumption in causal discovery.
method Proposes a new assumption called 2-adjacency faithfulness and a modified Grow and Shrink algorithm.
result Proves the correctness of the modified algorithm under weaker assumptions.
Paper simplifies balancing weights by relaxing outcome assumptions.
problem Estimating missing outcomes in a target population.
method Relaxes outcome assumptions to simplify balancing weights.
result Balancing weights can be simplified with convex loss and minimum worst-case bias.
Study finds rigidity of biconservative hypersurfaces in space forms without curvature assumptions.
problem Investigating biconservative hypersurfaces in space forms without scalar curvature assumptions.
method Introduced a novel divergence-free tensor to derive results without curvature assumptions.
result Rigidity results for biconservative hypersurfaces in space forms without scalar curvature assumptions.
Directed graphical models provide a useful framework for modeling causal or directional relationships for multivariate data. Prior work has largely focused on identifiability and search algorithms for directed acyclic graphical (DAG) models. In many applications, feedback naturally arises and directed graphical models …
Paper relaxes independence assumption for non-centered data.
problem Failing to account for dependencies in data leads to model failures.
method Proposes 'Kronecker-sum-structured mean' assumption to relax zero-mean requirement.
result Models with nonconvex but unimodal log-likelihoods can be solved efficiently.
New algorithm estimates causal effects for non-Gaussian data.
problem Estimating causal effects in non-Gaussian distributions.
method Generalized k-Triangle Faithfulness Assumption and Edge Estimation Algorithm.
result Uniformly consistent estimates of causal effects.
For many interesting tasks, such as medical diagnosis and web page classification, a learner only has access to some positively labeled examples and many unlabeled examples. Learning from this type of data requires making assumptions about the true distribution of the classes and/or the mechanism that was used to selec…
The paper clarifies the distinction between CATE and ITE under ignorability assumptions.
problem Confusion between CATE and ITE hinders personalized effect estimation.
method Clarifies the distinction between CATE and ITE under ignorability assumptions.
result CATE and ITE are not necessarily the same under ignorability assumptions.
New assumptions and algorithm solve offline two-player zero-sum Markov games.
problem Solving offline two-player zero-sum Markov games under insufficient assumptions.
method Proposed unilateral concentration assumption and pessimism-type algorithm.
result Algorithm efficiently learns Nash equilibrium under unilateral concentration.
The paper relaxes assumptions for analyzing stochastic optimization algorithms.
problem Analyzing the convergence of stochastic gradient algorithms under weaker variance assumptions.
method Building on and extending a connection to the Halpern iteration, the paper analyzes algorithms for convex nonsmooth optimization and min-max problems.
result Rates for optimality measures are obtained without requiring boundedness of the feasible set for problems beyond simple constrained optimization.
Unified parametric assumption improves convergence guarantees for nonconvex optimization.
problem Weak convergence guarantees for nonconvex optimization.
method Introducing a novel unified parametric assumption.
result Unified convergence theorem for gradient-based methods.
Revisits causal inference identifiability with positivity assumption.
problem General identifiability in causal inference without positivity assumption.
method Introduces new algorithm sound and complete under positivity assumption.
result New algorithm connects general identifiability to classical identifiability.
Causal inference from observational data requires assumptions. These assumptions range from measuring confounders to identifying instruments. Traditionally, causal inference assumptions have focused on estimation of effects for a single treatment. In this work, we construct techniques for estimation with multiple treat…
Emputation learns imputation models guided by missingness assumptions.
problem Learning imputation models for missing data given observed data.
method Guided by specific missingness assumptions, Emputation trains a deep generative model to learn the extrapolation distribution of missing variables.
result The population minimizer of the emputation risk recovers the target extrapolation distribution under various identification assumptions.