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

2915828721,163 · Jun 202019922001200920172026
48 results for Graph OOD Generalization

Unified framework for OOD detection and generalization using graph theory.

problem Challenges in out-of-distribution (OOD) generalization and detection in real-world machine learning models.
method Graph-theoretic framework to jointly tackle OOD generalization and detection.
result Empirical validation of theoretical underpinnings with competitive performance.

CGRL improves graph neural networks' OOD generalization by blocking spurious correlations.

problem Graph Neural Networks struggle with out-of-distribution data due to learning spurious correlations.
method Formulates a causal graph, uses backdoor adjustment, and introduces a loss replacement strategy.
result Significantly improves OOD generalization of GNNs, stabilizing mutual information learning.

Study shows gMPNNs struggle with OOD link prediction in larger test graphs.

problem Inductive out-of-distribution link prediction in larger test graphs.
method Theoretical analysis and development of a gMPNN with structural pairwise embeddings.
result Structural node embeddings from gMPNNs converge to random guessing as test graphs grow.

Framework tackles OOD challenges in molecule property prediction by modeling environments.

problem Challenges in modeling OOD samples for molecule property prediction.
method Soft causal learning framework incorporating chemistry theories and cross-attention mechanisms.
result Demonstrates well generalization ability on seven datasets.

Novel framework improves graph learning for out-of-distribution generalization.

problem Graph out-of-distribution generalization challenges in neural networks.
method Invariant Graph Learning based on Information bottleneck theory (InfoIGL).
result Achieves state-of-the-art performance in graph classification tasks under OOD generalization.

New method improves traffic forecasting models by adapting to spatial shifts.

problem Improving traffic forecasting models' ability to handle spatial shifts over years.
method Proposes a novel Mixture of Experts (MoE) framework for spatiotemporal models.
result Significant improvement in performance for handling spatial distribution shifts.

Unified benchmark for GLAD and GLOD methods across 35 datasets.

problem Gap between GLAD and GLOD research due to distinct evaluation setups.
method Comprehensive evaluation framework that unifies GLAD and GLOD.
result Multi-dimensional analyses of existing methods' strengths and limitations.

DRGO improves graph recommendation by mitigating noisy samples and enhancing out-of-distribution generalization.

problem Noisy samples in training data diminish recommendation systems' out-of-distribution generalization.
method DRGO uses a diffusion paradigm to reduce noisy effects and entropy regularization to avoid extreme weights.
result DRGO outperforms current methods in OOD recommendation across various distribution shifts.

Graph Neural Networks struggle with generalization, especially OOD data; GRATIN solves this with Gaussian Mixture Model-based augmentation.

problem Graph Neural Networks struggle with generalization, particularly to unseen or out-of-distribution data.
method Theoretical framework using Rademacher complexity to compute a regret bound on generalization error. GRATIN algorithm leveraging Gaussian Mixture Models for efficient data augmentation.
result GRATIN outperforms existing augmentation techniques in terms of generalization and offers improved time complexity.

GALA framework learns invariant graph representations via environment augmentation with minimal assumptions.

problem Learning invariant graph representations from different environments without additional assumptions.
method Developed GALA framework with minimal assumptions of variation sufficiency and consistency. Uses an assistant model to differentiate graph environment changes.
result Extracting maximally invariant subgraphs to proxy predictions identifies underlying invariant subgraphs for successful out-of-distribution generalization.

The paper improves uncertainty quantification for node classification using distance-based regularization.

problem Uncertainty in deep learning models, especially for node classification tasks.
method Graph posterior networks (GPNs) with UCE loss function, followed by a distance-based regularization.
result The proposed distance-based regularization outperforms state-of-the-art methods in OOD detection and misclassification detection.

Paper investigates learnability of OOD detection under various conditions.

problem Learnability of OOD detection under different scenarios.
method Investigates PAC learning theory, proves impossibility theorems, and provides necessary and sufficient conditions.
result Some conditions for learnability of OOD detection may not hold in practical scenarios.

Study investigates OOD generalization methods for mechanics problems.

problem Real-world mechanics problems with unknown test environments and data distribution shifts.
method Investigates OOD generalization methods for regression problems in mechanics.
result OOD generalization methods perform better than traditional ML methods on mechanics-specific regression problems.

FeAT improves OOD generalization by learning richer features.

problem Improving feature learning for out-of-distribution (OOD) generalization.
method Feature Augmented Training (FeAT) iteratively augments and retains features from different subsets of training data.
result FeAT effectively learns richer features, boosting OOD performance.

Paper introduces Influence Function to assess OOD generalization stability.

problem Assessing OOD generalization accuracy when target domains are unknown.
method Introduced Influence Function from robust statistics to monitor model stability.
result Accuracy on test domains and Influence Function variance can distinguish OOD algorithms and generalization quality.

Proposes Likelihood Regret for VAEs to improve OOD detection.

problem VAEs can assign high likelihoods to OOD samples, making traditional likelihood thresholds unreliable.
method Introduces Likelihood Regret, a new OOD score for VAEs.
result Empirical results show Likelihood Regret outperforms existing methods for VAEs.

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

By design, discriminatively trained neural network classifiers produce reliable predictions only for in-distribution samples. For their real-world deployments, detecting out-of-distribution (OOD) samples is essential. Assuming OOD to be outside the closed boundary of in-distribution, typical neural classifiers do not c…

2019-10-09abs ↗pdf ↗

Geometrically, high-likelihood regions in DGMs are unlikely to generate OOD data.

problem The paradox of high-likelihood OOD detection in deep generative models.
method Local intrinsic dimension estimation to identify high-likelihood regions that do not generate OOD data.
result A method pairing likelihoods and LID estimates for reliable OOD detection.

Vanilla CNNs, as uncalibrated classifiers, suffer from classifying out-of-distribution (OOD) samples nearly as confidently as in-distribution samples. To tackle this challenge, some recent works have demonstrated the gains of leveraging available OOD sets for training end-to-end calibrated CNNs. However, a critical que…

2019-10-18abs ↗pdf ↗

Study OOD generalization in meta-reinforcement learning using information theory.

problem Understanding how meta-reinforcement learning handles distribution shifts.
method Information-theoretic analysis of Markov Decision Processes and gradient-based algorithms.
result Established fine-grained generalization bounds for meta-reinforcement learning.

PAIR optimizes machine learning models to generalize better to out-of-distribution data.

problem Optimization of machine learning models for out-of-distribution (OOD) generalization often leads to compromises that weaken robustness.
method Introduces a multi-objective optimization (MOO) perspective and a new optimization scheme called PAreto Invariant Risk Minimization (PAIR).
result PAIR improves robustness of OOD objectives by cooperatively optimizing with other objectives, yielding top OOD performances.

OOD detection methods often misidentify OOD points, leading to ineffective safety improvements.

problem Improving model safety through OOD detection methods often leads to incorrect identification of out-of-distribution points.
method Re-examine popular OOD detection procedures based on predictive uncertainty or features of supervised models trained on in-distribution data.
result Popular OOD detection methods incorrectly conflate high uncertainty and far feature-space distance with being out-of-distribution.

MADOD meta-learns invariant features for OOD detection across unseen domains.

problem Simultaneous covariate and semantic shifts in real-world machine learning applications.
method Meta-learning and G-invariance to learn robust, domain-invariant features.
result Superior performance in semantic OOD detection across unseen domains.

Current OOD benchmarks overestimate model robustness to spurious correlations.

problem Spurious correlations degrade OOD performance, but benchmarks show the opposite.
method Analyze OOD datasets for spurious correlations and derive conditions for robustness.
result Current OOD benchmarks are misspecified and overestimate model robustness.

Enhances OOD detection using latent diffusion for more robust and efficient training.

problem Improving reliability of machine learning models in real-world scenarios.
method Proposes Outlier-Aware Learning (OAL) framework that generates synthetic OOD data in latent space and uses MICL and KD modules.
result Demonstrates superior performance on benchmark datasets.

Out-of-distribution (OoD) detection is a natural downstream task for deep generative models, due to their ability to learn the input probability distribution. There are mainly two classes of approaches for OoD detection using deep generative models, viz., based on likelihood measure and the reconstruction loss. However…

2019-07-10abs ↗pdf ↗

Neural networks classify OOD images by their nearest neighbor in training data.

problem Understanding out-of-distribution prediction behavior of neural networks.
method Nearest category generalization (NCG) measure to assess OOD prediction accuracy.
result Adversarially robust networks have higher NCG accuracy than natural training, indicating local regularization impacts decision regions.

The paper explores how model complexity affects OOD detection performance.

problem Ensuring reliability and safety of machine learning systems through OOD detection.
method Investigates the relationship between model capacity and OOD detection performance using empirical and theoretical analysis.
result The Double Descent phenomenon is observed in post-hoc OOD detection, indicating that overparameterization can enhance OOD detection.

Framework reduces simplicity bias in NNs, improving OOD generalization and robustness.

problem Simplicity bias in deep learning models leads to biased predictions and poor OOD generalization.
method Proposes a framework that regularizes conditional mutual information to encourage use of diverse features.
result Demonstrates effectiveness in various settings, enhancing OOD generalization and robustness.

Over-parameterized models reduce Out-of-Distribution (OOD) generalization loss.

problem Understanding how over-parameterized models handle non-trivial distributional shifts.
method Investigating random feature models and examining non-trivial natural distributional shifts.
result Increasing model parameterization reduces OOD loss.

Bayesian method detects outliers and uncertain points in data.

problem Detecting outliers and uncertain points in data using Bayesian methods.
method Generative model of data curation for aleatoric uncertainty, combining with epistemic uncertainty and outlier exposure.
result Principled Bayesian approach outperforms methods using aleatoric or epistemic uncertainty alone.

Machine learning models encounter Out-of-Distribution (OoD) errors when the data seen at test time are generated from a different stochastic generator than the one used to generate the training data. One proposal to scale OoD detection to high-dimensional data is to learn a tractable likelihood approximation of the tra…

2018-10-02abs ↗pdf ↗

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.