Cosmos models scenes using neural encodings and symbolic attributes for compositional generalization.
problem Modeling scenes with high performance on unseen input scenes composed of known visual elements.
method Neurosymbolic grounding with neurosymbolic scene encodings and attention mechanisms.
result Establishes a new state-of-the-art for compositional generalization in world modeling.
New research challenges the independence assumption in neurosymbolic learning, leading to overconfident predictions and unrepresentable uncertainty.
problem The independence assumption in neurosymbolic learning systems can lead to overconfident predictions and hinder uncertainty quantification.
method The study proves the limitations of the independence assumption and introduces new loss functions that are non-convex and difficult to optimise.
result Neurosymbolic learning systems using the independence assumption are prone to overconfidence and cannot represent uncertainty over multiple valid options.
A-NeSI scales approximate inference for probabilistic neurosymbolic learning.
problem Combining neural networks with symbolic reasoning for scalable inference.
method A-NeSI: a new framework for PNL using neural networks for approximate inference.
result A-NeSI achieves scalable approximate inference without semantic changes.
Survey of neurosymbolic AI methods for reasoning over knowledge graphs.
problem Combining symbolic reasoning with deep learning for graph data.
method Logically-informed embedding, embedding with logical constraints, and rule learning approaches.
result A novel taxonomy for classifying neurosymbolic reasoning methods on knowledge graphs.
Neurosymbolic predictors fail to model uncertainty under independence assumption.
problem Neurosymbolic predictors' reliance on independence assumption limits their ability to model uncertainty.
method Formal analysis of NeSy predictors under independence assumption.
result Assuming independence among symbolic concepts prevents NeSy predictors from representing uncertainty.
VERAFI improves financial AI by verifying calculations and compliance.
problem Financial AI systems generate errors and violations during reasoning.
method VERAFI combines dense retrieval, reranking, and automated reasoning policies.
result VERAFI achieves 94.7% factual correctness, 81% relative improvement.
Revel tackles safe exploration in RL with verified symbolic policies.
problem Computational infeasibility of verifying neural networks in RL learning loops.
method Two policy classes: neurosymbolic with approximate gradients and symbolic policies for efficient verification. Mirror descent over policies to safely update and project policies.
result Revel discovers policies that outperform prior approaches to verified exploration.
Novel framework for uncertainty quantification in neurosymbolic programs.
problem Lack of correctness guarantees in neurosymbolic programs due to machine learning model fallibility.
method Adapting conformal prediction to neurosymbolic programs using abstract interpretation.
result Framework provides probabilistic guarantees for correctness, compositionality, and structured values.
This paper explores how boolean formulas can be learned by deep neural networks.
problem Understanding the learnability of boolean formulas by deep neural networks.
method Analysis of boolean formulas associated with model-sampling benchmarks, combinatorial optimization problems, and random 3-CNFs.
result Neural networks outperform rule-based systems and pure symbolic approaches in learning boolean formulas.
Study characterizes and mitigates imbalances in neurosymbolic learning.
problem Characterizing and mitigating class-specific risks in neural classifiers.
method Theoretical analysis and practical techniques including estimating marginal gold labels and mitigating imbalances at training and testing time.
result Learning imbalances can be greatly impacted by the symbolic component σ, unlike in supervised and weakly supervised learning.
Unified framework for hierarchical image classification with epistemic uncertainty.
problem Overconfident predictions and lack of logical consistency in deep learning models.
method Neurosymbolic approach with epistemic deep learning, using focal set reasoning and differentiable fuzzy logic.
result Maintains accuracy on par with transformer baselines while providing more calibrated and interpretable predictions.
Study improves self-driving safety in dynamic environments.
problem Safe self-driving in non-stationary urban settings.
method Neurosymbolic Meta-Reinforcement Lookahead Learning (NUMERLA).
result Self-driving agents can adapt safely in real-time.
SATNet solves the Symbol Grounding Problem, enabling self-supervised learning.
problem Mapping visual inputs to symbolic variables without explicit supervision.
method Self-supervised pre-training pipeline and proofreading method.
result SATNet achieves full accuracy with no label leakage, surpassing state-of-the-art.
Significant strides have been made toward designing better generative models in recent years. Despite this progress, however, state-of-the-art approaches are still largely unable to capture complex global structure in data. For example, images of buildings typically contain spatial patterns such as windows repeating at…
We present a neurosymbolic framework for the lifelong learning of algorithmic tasks that mix perception and procedural reasoning. Reusing high-level concepts across domains and learning complex procedures are key challenges in lifelong learning. We show that a program synthesis approach that combines gradient descent w…
The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.
problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.
The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.
problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.
Gauge Flow Models use a learnable Gauge Field in Generative Flow Models.
problem Improving generative model performance.
method Integrates a learnable Gauge Field into Flow ODEs.
result Gauge Flow Models outperform traditional Flow Models in Flow Matching experiments.
The study examines how model predictions hold up under model extensions.
problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.
Revises Bayesian model averaging for foundation models.
problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.
Paper introduces symmetric divergence link models for probability distributions.
problem Symmetric divergence measures for probability distributions.
method Two general classes of link models: one for survival functions and another for cumulative probability distribution functions.
result Advantages of symmetric divergence measures over asymmetric measures for model averaging and feature assessment.
New method to handle credit portfolio model uncertainties.
problem Model risk in credit portfolio models.
method Demonstrates comprehensive yet easy-to-implement approach to uncertainty in model parameters.
result Comprehensive method to deal with model uncertainties.
The paper tests stock return models and uses LSTM to predict stock returns.
problem Validating stock return models and predicting stock returns.
method Used Fama-French three-factor, four-factor, and five-factor models; also used LSTM model.
result Fama-French five-factor model shows better validity for stock returns.
Researchers review challenges in interpreting additive models, especially neural additive models.
problem Challenges in interpreting additive models, particularly neural additive models.
method Review of generalized additive models and discussion of nonidentifiability.
result Challenges in claiming interpretability or suitability for safety-critical applications of additive models.
Proposes a decision-theoretic approach for enhancing model interpretability in Bayesian frameworks.
problem Challenges the traditional approach of restricting model structure for interpretability in Bayesian frameworks.
method Introduces an interpretability utility function and a two-step method involving a reference model and a proxy model.
result Demonstrates that the proposed method generates more accurate models with the same level of interpretability.
Novel hybrid modeling combines ML and physics for real-time diagnosis.
problem Real-time diagnosis of complex systems.
method Combines machine learning and physics-based models to create reduced-order models.
result Generated models are two orders of magnitude simpler, improving efficiency.
CRS model improves ranking data modeling with theoretical guarantees.
problem Lack of rich, multimodal models for ranking data.
method Contextual Repeated Selection (CRS) model for multimodal ranking data.
result CRS model significantly outperforms existing methods in various ranking contexts.
Interpretable machine learning has become a strong competitor for traditional black-box models. However, the possible loss of the predictive performance for gaining interpretability is often inevitable, putting practitioners in a dilemma of choosing between high accuracy (black-box models) and interpretability (interpr…
Sigma models linked to Gross-Neveu models via quiver varieties.
problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.
Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…
Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.
problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.
Eigen-stratified models reduce model size and improve performance.
problem Large model size in Laplacian-regularized stratified models.
method Formulate eigen-stratified models with linear combinations of bottom eigenvectors of the graph Laplacian.
result Significant reduction in model size with eigen-stratified models.
Seq2Seq models speed up epidemic model predictions.
problem Complex epidemic models are computationally expensive.
method Used deep seq2seq models as surrogates for complex models.
result Surrogates predict scenarios up to several thousand times faster.
This work develops scalable model selection methods with fast update and selection.
problem Efficient model selection for large pools of candidate models.
method Isolated model embedding, which supports asymptotically fast update and selection.
result Standardized Embedder achieves competitive model selection performances.
Paper proposes BMPO to optimize policies using bidirectional models.
problem Model-based reinforcement learning's reliance on forward model accuracy.
method Develops BMPO using both forward and backward models for policy optimization.
result BMPO outperforms state-of-the-art methods in sample efficiency and asymptotic performance.
Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of models.
problem Model risk in multivariate risk forecasting, especially during crises.
method Comprehensive empirical study comparing Copula-GARCH models with fixed marginals, copulas, or neither.
result Model risk is almost entirely due to copula choice, not marginal models.
This paper distills a complex travel mode choice model into simpler, interpretable models.
problem Lack of interpretability in complex machine learning models for travel behavior.
method Model distillation combined with market segmentation.
result Generated interpretable models that closely match the predictions of the original complex model.
BayesBlend blends multiple models' predictions for better insurance loss predictions.
problem Improving insurance loss predictions by combining multiple models.
method Pseudo-Bayesian model averaging, stacking, and hierarchical stacking.
result BayesBlend provides a user-friendly way to blend model predictions and estimate weights.
The paper identifies when larger models improve predictions and proposes a switcher model.
problem Understanding when larger models benefit from added complexity.
method Numerical studies on T5 architecture to analyze predictive uncertainty and model performance.
result Large models improve on examples where small models are uncertain, but not on certain examples.
Aggregates models from different datasets using shared latent structures.
problem Aggregating models from heterogeneous datasets with shared latent structures.
method Bayesian nonparametrics for identifying correspondences among local model parameterizations.
result Framework successfully aggregates various model types across different applications.
Improved diffusion model generation speed with speculative sampling.
problem Generating samples from computationally expensive diffusion models.
method Extending speculative sampling to diffusion models, using fast draft models for candidate token generation.
result Significant speedup in generation, halving the number of function evaluations.
DBNs improve accuracy of biological ODE models with missing data.
problem Uncertainty in biological ODE models with missing data.
method Converted ODE models to DBNs and used Particle Filtering for parameter estimation.
result DBNs can accurately infer model variables with missing data.
We propose a generalization of neural network sequence models. Instead of predicting one symbol at a time, our multi-scale model makes predictions over multiple, potentially overlapping multi-symbol tokens. A variation of the byte-pair encoding (BPE) compression algorithm is used to learn the dictionary of tokens that …
The paper extends statistical inference methods for black-box generative models.
problem Understanding and validating black-box generative models without access to their internal data.
method Develops model-level statistical inference tasks using generative model representations.
result Model-level representations are effective for multiple inference tasks.
PMM uses Bayesian inference to generate data from noisy approximations.
problem Creating flexible generative models for various data types.
method Bayesian inference and conjugate pairs of distributions.
result PMM achieves performance competitive with existing generative models.
Unified model improves sampling speed and quality.
problem Difficult to balance sampling speed and quality.
method Multistep Consistency Models combining consistency and diffusion models.
result Improved sampling quality with reduced steps.
In science and especially in economics, agent-based modeling has become a widely used modeling approach. These models are often formulated as a large system of difference equations. In this study, we discuss two aspects, numerical modeling and the probabilistic description for two agent-based computational economic mar…
Driven by an increasing need for model interpretability, interpretable models have become strong competitors for black-box models in many real applications. In this paper, we propose a novel type of model where interpretable models compete and collaborate with black-box models. We present the Model-Agnostic Linear Comp…