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

104208312416 · Jun 202019922001200920172026
48 results for Bayesian score metrics

This dissertation uses ILP to learn Bayesian network structures efficiently.

problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.

We describe algorithms for learning Bayesian networks from a combination of user knowledge and statistical data. The algorithms have two components: a scoring metric and a search procedure. The scoring metric takes a network structure, statistical data, and a user's prior knowledge, and returns a score proportional to …

2013-02-27abs ↗pdf ↗

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.

Recent reports have described that the equivalent sample size (ESS) in a Dirichlet prior plays an important role in learning Bayesian networks. This paper provides an asymptotic analysis of the marginal likelihood score for a Bayesian network. Results show that the ratio of the ESS and sample size determine the penalty…

2012-03-15abs ↗pdf ↗

CCE improves anomaly detection metrics by measuring both confidence and consistency.

problem Existing anomaly detection metrics lack discriminative power, hyperparameter dependency, and robustness to perturbations.
method CCE uses Bayesian estimation to quantify uncertainty and constructs global and event-level confidence and consistency scores.
result CCE demonstrates strict boundedness, robustness, and linear time complexity.

This work introduces a new data-driven estimator for the Bayesian Cramér-Rao bound using score matching.

problem Benchmarking the performance of statistical estimators and providing a principled metric for system design and optimization.
method Score matching technique to estimate the Bayesian Cramér-Rao bound from training data.
result Developed novel non-asymptotic bounds on the score matching error and the Bayesian CRB estimator.

The paper improves experimental design by weighting diversity metrics with quality, leading to more diverse and effective discoveries.

problem Existing experimental design techniques favor exploitation over exploration, leading to local optima and insufficient diversity.
method The paper extends Vendi scores to account for quality and applies them to various experimental design problems.
result Quality-weighted Vendi scores allow for better balance between quality and diversity, resulting in 70%-170% more effective discoveries.

Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distributions (CPDs) stored at each node. The majority of this work has concentrated on using decision-tree representations for the CPDs. In addition, re…

2013-02-06abs ↗pdf ↗

We develop a scoring and classification procedure based on the PAC-Bayesian approach and the AUC (Area Under Curve) criterion. We focus initially on the class of linear score functions. We derive PAC-Bayesian non-asymptotic bounds for two types of prior for the score parameters: a Gaussian prior, and a spike-and-slab p…

2014-10-07abs ↗pdf ↗

Approaches to learning Bayesian networks from data typically combine a scoring function with a heuristic search procedure. Given a Bayesian network structure, many of the scoring functions derived in the literature return a score for the entire equivalence class to which the structure belongs. When using such a scoring…

2013-02-13abs ↗pdf ↗

Bayesian optimization improves DRL for ESG portfolio management.

problem Optimizing hyperparameters of DRL agents for ESG metrics.
method Bayesian optimization for noisy, expensive-to-evaluate functions.
result Multi-objective optimization yields optimal Pareto set of portfolios.

Proposes a new Bayesian score for learning network structure from related datasets.

problem Learning network structure from heterogeneous related data sets.
method Bayesian Hierarchical Dirichlet (BHD) score based on a hierarchical model.
result BHD outperforms BDeu in reconstruction accuracy and sparsity for related datasets.

Bayesian scores improve structure learning in probabilistic circuits.

problem Improper structure learning in probabilistic circuits based on heuristics.
method Developed Bayesian structure scores for deterministic PCs, using them in a greedy cutset algorithm.
result Effective protection against overfitting and fast, almost hyper-parameter-free structure learner.

Many algorithms for score-based Bayesian network structure learning (BNSL), in particular exact ones, take as input a collection of potentially optimal parent sets for each variable in the data. Constructing such collections naively is computationally intensive since the number of parent sets grows exponentially with t…

2019-05-23abs ↗pdf ↗

Bayesian network structure learning is often performed in a Bayesian setting, by evaluating candidate structures using their posterior probabilities for a given data set. Score-based algorithms then use those posterior probabilities as an objective function and return the maximum a posteriori network as the learned mod…

2016-05-12abs ↗pdf ↗

A new method for signal recovery in high dimensions using projections and diffusion models.

problem Recovering a latent signal from noisy observations with unknown support.
method Metric projection estimator based on score matching in a diffusion model.
result The posterior distribution concentrates near the metric projection of the observed signal.

In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a belief network from incomplete data- that is, in the presence of missing values or hidden variables. In a recent paper, I introduced an algorithm…

2013-01-30abs ↗pdf ↗

MIRA scores assess conditional distribution accuracy using joint samples.

problem Assessing the accuracy of candidate conditional distributions.
method Analytic expression for Mira score based on equal probability mass regions.
result Mira enables Bayesian model comparison by quantifying alignment with true process.

Bayesian network structure learning is often performed in a Bayesian setting, evaluating candidate structures using their posterior probabilities for a given data set. Score-based algorithms then use those posterior probabilities as an objective function and return the maximum a posteriori network as the learned model.…

2017-04-12abs ↗pdf ↗

Method solves Bayesian inverse problems in function space without assuming log-concavity.

problem Bayesian inverse problems in infinite-dimensional nonlinear settings.
method Score-based diffusion models as a prior, Langevin-type MCMC on function spaces.
result Provable convergence bound for posterior sampling, dependent on score approximation.

Proposes a new method to measure epistemic uncertainty in Bayesian neural networks.

problem Measuring epistemic uncertainty in Bayesian neural networks for out-of-distribution detection.
method Proposes measuring disagreement between logits and their pre-softmax counterparts as an epistemic uncertainty measure.
result Proposed epistemic uncertainty scores outperform mutual information and equal predictive entropy performance.

Study uses BNs to predict cryptocurrency prices, improving accuracy with discretisation.

problem Predicting price movements in volatile cryptocurrency markets.
method Discretisation-aware Bayesian Networks with three methods and multiple bin counts.
result Equal interval with two bins provides best predictive performance.

EPICSCORE improves conformal scores by explicitly accounting for epistemic uncertainty.

problem Overconfident predictions in data-sparse regions due to lack of epistemic uncertainty.
method Model-agnostic approach using Bayesian techniques like Gaussian Processes, Dropout, and Regression Trees.
result Enhanced predictive intervals that adaptively expand in sparse data regions and maintain compact intervals in abundant data.

A novel diffusion method for Bayesian posterior sampling with theoretical guarantees.

problem Efficiently sampling from complex posterior distributions in Bayesian inversion.
method Diffusion-based posterior sampling using Langevin dynamics and PnP framework.
result The method converges even for multi-modal posterior distributions with theoretical error bounds.

In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a scoring criterion that favors the simplest model able to represent the generative distribution exactly. Our results therefore hold whenever t…

2012-10-19abs ↗pdf ↗

Bayesian deep learning improves out-of-distribution detection but not always.

problem Improving the reliability of deep learning models in uncertain or novel data.
method Validation of likelihood-based Bayesian models for out-of-distribution detection.
result Bayesian deep learning models can marginally outperform conventional neural networks in certain conditions.

ASVGD accelerates SVGD for efficient sampling from Gaussian targets.

problem Efficient sampling from Gaussian distributions using SVGD.
method Accelerated gradient flow in a metric space of probability densities, including momentum and Wasserstein regularization.
result ASVGD achieves optimal convergence rate for Gaussian targets, independent of covariance.

A Bayesian network is a widely used probabilistic graphical model with applications in knowledge discovery and prediction. Learning a Bayesian network (BN) from data can be cast as an optimization problem using the well-known score-and-search approach. However, selecting a single model (i.e., the best scoring BN) can b…

2018-11-12abs ↗pdf ↗