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

Trend · papers per month

83167250333 · Jun 202019922001200920172026
48 results for Bayesian Interpretation

Bayesian explanations are more resilient to adversarial attacks than deterministic ones.

problem Stability of saliency-based explanations under adversarial attacks in Neural Networks.
method Empirical and theoretical analysis of Bayesian vs deterministic Neural Networks.
result Bayesian explanations are more stable under adversarial perturbations and direct attacks.

Bayesian uncertainty quantification is flawed, according to new research.

problem Flawed interpretation of Bayesian uncertainty quantification.
method Discussion of Bayesian updating and optimization-based perspective, proposing measures of quality.
result Bayesian uncertainty quantification is not coherent with optimization-based perspective.

We show that the multi-class support vector machine (MSVM) proposed by Lee et. al. (2004), can be viewed as a MAP estimation procedure under an appropriate probabilistic interpretation of the classifier. We also show that this interpretation can be extended to a hierarchical Bayesian architecture and to a fully-Bayesia…

2012-06-27abs ↗pdf ↗

Sparse Bayesian Optimization (SEBO) finds interpretable configurations.

problem Optimizing black-box functions for recommendation systems while maintaining interpretability.
method Regularization-based approaches, including a differentiable relaxation for L0L_0 regularization, and a hyperparameter-free method SEBO.
result SEBO efficiently optimizes for sparsity without hyperparameters.

Bayesian neural networks with Mercer priors for interpretable uncertainty quantification.

problem Uncertainty quantification in neural networks, especially for complex input-to-output mappings.
method Introducing Mercer priors for BNNs, which approximate a specified GP and are scalable.
result BNNs with Mercer priors can approximate the uncertainty of a specified GP, making them interpretable and scalable.

Causal Bayesian networks interpret actions as interventions to connect models to real-world outcomes.

problem Connecting causal model predictions to real-world outcomes.
method Formal framework to interpret actions as interventions and prove impossibility results.
result No non-circular interpretation exists that satisfies natural desiderata without violating some.

Bayesian approach selects subsets of variables for interpretable prediction and identifies key factors in educational outcomes.

problem Challenges in subset selection for stability, regularization, and inference.
method Bayesian perspective on subset selection, deriving optimal subsets and variable importance metrics.
result Better prediction, interval estimation, and variable selection compared to competing methods.

New method improves HPO interpretability without sacrificing performance.

problem Difficulty in understanding HPO algorithms due to black-box nature.
method Coupling Bayesian optimization with Bayesian Algorithm Execution.
result More reliable IML explanations without compromising optimization performance.

VALC provides concept-level interpretations of FLMs, overcoming word-level limitations.

problem Lack of higher-level structure interpretation in FLMs' attention weights.
method Formal definition of conceptual interpretation, variational Bayesian framework (VALC).
result VALC finds optimal language concepts for FLM predictions, providing concept-level interpretations.

A new clustering method using Bayesian techniques improves robustness and interpretability.

problem Improving clustering techniques for better robustness and interpretability.
method The paper proposes a novel Bayesian clustering method using the proper Bayesian bootstrap, which combines k-means clustering and ensemble clustering.
result The method provides clear indication on the optimal number of clusters and a better representation of the clustered data.

Bayesian TNKMs automatically infer model complexity and feature relevance.

problem Manual tuning of TN rank and feature dimensions is error-prone and computationally expensive.
method Bayesian approach with hierarchical priors on TN factors for automatic rank and feature selection.
result Superior performance in prediction accuracy, uncertainty quantification, interpretability, and scalability.

Entropy regularization improves interpretability of probabilistic clustering models.

problem Bayesian nonparametric mixture models often produce unbalanced cluster frequencies.
method Interpreting the posterior as penalized likelihood, entropy regularization reduces sparsely-populated clusters.
result The proposed entropy-regularized estimator enhances interpretability without sacrificing computational convenience.

We show that a neural network with arbitrary depth and non-linearities, with dropout applied before every weight layer, is mathematically equivalent to an approximation to a well known Bayesian model. This interpretation might offer an explanation to some of dropout's key properties, such as its robustness to over-fitt…

2015-06-06abs ↗pdf ↗

BaGGLS models biological interactions using Bayesian shrinkage for interpretability.

problem Interpreting complex interactions in high-dimensional biological data.
method Bayesian group global-local shrinkage prior with variational approximation.
result BaGGLS outperforms other methods in interaction detection and scalability.

Bayesian Scattering offers a simple baseline for image data uncertainty.

problem Lack of interpretable, mathematically grounded uncertainty quantification methods for image data.
method Coupling wavelet scattering transform with a simple probabilistic head.
result Bayesian Scattering provides sensible uncertainty estimates under distribution shifts.

Dropout has recently emerged as a powerful and simple method for training neural networks preventing co-adaptation by stochastically omitting neurons. Dropout is currently not grounded in explicit modelling assumptions which so far has precluded its adoption in Bayesian modelling. Using Bayesian entropic reasoning we s…

2015-08-12abs ↗pdf ↗

Bayesian neural networks benefit from fully marginalizing over all modes to improve generalization.

problem Bayesian neural networks suffer from multimodal posterior distributions that can lead to suboptimal generalization.
method Use appropriate Bayesian sampling tools to fully marginalize over all posterior modes.
result Training with full marginalization improves the ability of the network to reason between multiple candidate solutions.

Bayesian optimisation with graph kernels improves neural architecture search and provides interpretability.

problem Lack of insight into why architectures perform well and how to improve them.
method Combines Bayesian optimisation with Weisfeiler-Lehman graph kernels for highly data-efficient and interpretable architecture search.
result Demonstrates state-of-the-art performance on closed- and open-domain search spaces.

Bayesian approach improves AdaLoRA's performance and efficiency.

problem Improving the efficiency and performance of adaptive low-rank adaptation.
method Utilized Bayesian metrics and the Improved Variational Online Newton (IVON) optimizer for adaptive parameter budget allocation.
result Bayesian counterpart outperforms sensitivity-based importance metric and is faster than AdaLoRA.

BC-LLM uses LLMs to find concepts without predefined sets, improving interpretability and performance.

problem Finding a balance between interpretability and accuracy in concept extraction models.
method Bayesian approach with LLMs as both concept extractor and prior.
result BC-LLM outperforms interpretable and black-box models across various datasets.

The paper explores how to handle uncertain evidence in probabilistic models.

problem Handling uncertain evidence in probabilistic models and stochastic simulators.
method The paper considers distributional evidence, Jeffrey's rule, and virtual evidence as methods for interpreting uncertain evidence.
result The paper provides guidelines on how to account for uncertain evidence and highlights the importance of careful consideration.

Bayesian CART models improve insurance claims frequency prediction and interpretation.

problem Improving accuracy and interpretability in insurance pricing models.
method Introducing Bayesian CART models for claims frequency, implementing MCMC algorithm for posterior tree exploration, and using DIC for model selection.
result Bayesian CART models can better classify policy-holders into risk groups.

Bayesian attention modules improve model interpretability and performance.

problem Deterministic attention modules limit model interpretability and optimization.
method Proposes a scalable stochastic attention module using simplex-constrained distributions and Bayesian learning.
result Consistent improvements over baselines in various attention-based models.

The paper connects ABC to GBI, suggesting ABC as a robustification strategy.

problem Approximate Bayesian Computation struggles with tractability in complex simulators.
method Reinterpreting ABC as an implicitly defined error model and suggesting GBI.
result ABC can be seen as a robustification strategy for approximating Bayesian posteriors.

Bayesian-TPNN improves ANOVA-TPNN for detecting higher-order components.

problem Difficulty in incorporating higher-order components in ANOVA-TPNN due to computational and memory constraints.
method Bayesian inference procedure for functional ANOVA model with TPNN basis functions.
result Bayesian-TPNN detects higher-order components with reduced computational cost.

New algorithms learn and interpret asymmetry-labeled DAGs for COVID-19 fear.

problem Bayesian networks' strict symmetric independence assumption limits their applicability in real-world scenarios.
method Developed novel structural learning algorithms for asymmetry-labeled DAGs.
result Efficient algorithms allow for straightforward interpretation of the underlying dependence structure.

Simplified Bayesian neural networks reduce model complexity and improve interpretability.

problem Over-parameterization and interpretability issues in deep learning models.
method Input-skip Latent Binary Bayesian Neural Networks (LBBNNs) that allow covariates to skip layers or be excluded.
result Significant reduction in model complexity (over 99%) with minimal loss in accuracy and uncertainty.

Novel Bayesian model improves EEG-based BCI character selection.

problem Accurately identifying target-related responses in EEG-based BCIs.
method Probit-link Split-and-merge Gaussian Process (P-SMGP) prior for feature selection.
result Reduces computational complexity and provides interpretable statistical interpretations.

Bayesian approach for handling incomplete clinical data.

problem Challenges in machine learning with multimodal, incomplete clinical data.
method Generative and discriminative learning, semi-supervised strategy, imputation of missing views.
result Automatic imputation of missing views and robust inference across different data sources.

This paper improves dependency networks using information geometry.

problem Technical disadvantage in dependency networks' learned distribution.
method Interpret pseudo-Gibbs sampling as iterative m-projections onto manifolds.
result Dependency networks can learn faster and have similar performance to Bayesian networks.

Graphical normalizing flows use Bayesian networks to improve normalizing flows' interpretability and performance.

problem Improving the interpretability and performance of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models, proposing graphical normalizing flows with either prescribed or learnable graph structures.
result Graphical conditioners lead to competitive white box density estimators.

Dropout is one of the key techniques to prevent the learning from overfitting. It is explained that dropout works as a kind of modified L2 regularization. Here, we shed light on the dropout from Bayesian standpoint. Bayesian interpretation enables us to optimize the dropout rate, which is beneficial for learning of wei…

2014-12-22abs ↗pdf ↗

Proposes DSM priors for Bayesian neural networks to improve interpretability and robustness.

problem Bayesian neural networks struggle with interpretability, overconfidence, and adversarial attacks.
method Introduces Dirichlet scale mixture (DSM) priors to address these issues.
result DSM priors lead to sparse networks, robustness against adversarial attacks, and competitive predictive performance.

CLUE method interprets uncertainty from BNNs by showing how inputs change to increase confidence.

problem Lack of work on interpreting uncertainty estimates from probabilistic models.
method CLUE method uses counterfactual explanations to interpret uncertainty from BNNs.
result CLUE outperforms baselines and helps practitioners understand predictive uncertainty.

Identifies interpretable generative model for multivariate data.

problem Black-box architectures of deep generative models are often unidentified and difficult to interpret.
method Introduces Deep Discrete Encoder (DDE) Copula, a hierarchical binary latent variable model inside a copula framework.
result Establishes conditions for identification of DDE copula parameters and proves posterior consistency.

sBayFDNN bridges deep learning and functional data analysis for complex, structured data.

problem Challenges in functional data analysis, especially for complex, continuously structured data.
method Sparse Bayesian functional deep neural network (sBayFDNN) that learns adaptive functional embeddings and interpretable region selection.
result First theoretical guarantees for a Bayesian deep functional model, ensuring reliability and statistical rigor.

Bayesian deep learning uses function-space priors to improve model uncertainty and robustness.

problem Bayesian deep learning struggles with model-specific weight-space priors that are hard to interpret and specify.
method Apply a Dirichlet prior in predictive space and perform approximate function-space variational inference.
result The approach improves uncertainty quantification, scalability, and adversarial robustness in large-scale image classification.