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

Trend · papers per month

185370554739 · Jun 202019922001200920172026
48 results for Bayesian decision analysis

Paper proposes a new method to attack Bayesian forecasting models.

problem Lack of research on adversarial attacks against time series forecasting systems.
method Decision analysis based attacking strategy for Bayesian forecasting models.
result Demonstrates the vulnerability of Bayesian forecasting models to adversarial attacks.

Optimizes predictions for specific tasks using parametrized decision analysis.

problem Optimizing predictions for specific decision tasks of interest.
method Designs a class of parametrized actions for Bayesian decision analysis.
result Derives efficient and interpretable solutions for various action parametrizations and loss functions.

Bayesian hybrid models fuse physics-based insights with machine learning constructs to correct for systematic bias. In this paper, we compare Bayesian hybrid models against physics-based glass-box and Gaussian process black-box surrogate models. We consider ballistic firing as an illustrative case study for a Bayesian …

2019-12-12abs ↗pdf ↗

Bayesian method improves quantile estimation and subset selection.

problem Estimating specific percentiles of the response distribution.
method Bayesian decision analysis perspective, optimal point estimates, interpretable uncertainty quantification, scalable subset selection.
result Substantial gains in quantile estimation accuracy, inference, and variable selection over competitors.

New algorithm reduces regret in sequential decision-making problems.

problem Balancing exploration and exploitation in online sequential decision problems.
method Variational Bayesian optimistic sampling (VBOS) for optimizing policies.
result VBOS achieves ildeO(AT) ilde O(\sqrt{AT}) Bayesian regret for stochastic multi-armed bandits.

The paper analyzes and proposes a new stopping criterion for recursive Bayesian classification.

problem Limitations of conventional stopping criteria in recursive Bayesian classification.
method Geometric interpretation of state posterior progression and analysis of conventional criteria.
result Proposes a new stopping criterion to overcome limitations of conventional methods.

The study analyzes when Bayesian averaging over decision trees is reliable.

problem When do Bayesian model averaging weights over decision trees provide reliable information?
method Closed-form solution for Bayesian decision trees with Catalan-exponential priors.
result Established a complete non-asymptotic theory of rational commitment thresholds.

Bayesian algorithms perform well even with misspecified priors, especially in meta-learning.

problem Performance degradation of Bayesian algorithms with misspecified priors.
method Thompson sampling and meta-learning analysis with misspecified priors.
result Thompson sampling's performance degrades gracefully with misspecification, with a bound of ildeO(H2ε) ilde{\mathcal{O}}(H^2 ε).

The paper corrects Bayesian neural network approximations to improve decision quality.

problem Inaccurate posterior approximations in Bayesian neural networks lead to suboptimal decisions.
method Develops methods to calibrate approximate posterior predictive distributions for better decision making.
result Empirically produces higher quality decisions compared to previous methods.

Develops Bayesian approach for end-to-end learning in stochastic optimization.

problem Stochastic optimization problems under uncertainty.
method Bayesian interpretation and new end-to-end learning algorithms.
result Improved decision maps for empirical risk minimization and distributionally robust optimization.

MINTS uses a minimalist Bayesian framework to tackle multi-armed bandits with structural constraints.

problem Sequential decision-making under uncertainty with complex structural constraints.
method Minimalist Bayesian framework with profile likelihood to eliminate nuisance parameters.
result MINTS achieves near-optimal regret guarantees and adapts to unimodal structure.

The paper tackles mean-variance analysis in Bayesian optimization under uncertainty.

problem Optimizing decisions in uncertain environments considering trade-offs between average and variance of risk.
method Developed bounds for mean and variance risk measures in Gaussian Process models and proposed AL algorithms for multi-task, multi-objective, and constrained optimization scenarios.
result Proposed AL algorithms effectively address the mean-variance trade-off in uncertain optimization scenarios.

In typical applications of Bayesian optimization, minimal assumptions are made about the objective function being optimized. This is true even when researchers have prior information about the shape of the function with respect to one or more argument. We make the case that shape constraints are often appropriate in at…

2016-12-28abs ↗pdf ↗

Unified Bayesian framework for PTA data analysis tackles hierarchical model issues.

problem Hierarchical Bayesian modeling challenges in PTA data analysis.
method Reparameterization strategy using Normalizing Flows (NFs) and i-nessai nested sampler.
result Improved statistical robustness and computational efficiency in PTA analysis.

Study on Bayesian reinforcement learning performance bounds.

problem Achieving optimal performance in model-based Bayesian reinforcement learning.
method Defining minimum Bayesian regret, deriving upper bounds using relative entropy and Wasserstein distance, and applying these to specific MDP cases.
result Upper bounds on minimum Bayesian regret for MDPs, including specific cases like MAB and online optimization with partial feedback.

New algorithms for fast online decision making using neural networks and martingale posteriors.

problem Online sequential decision making under uncertainty.
method Martingale posterior neural networks for fast online learning and decision making.
result Achieves competitive performance-speed trade-offs in non-stationary contextual bandits and Bayesian optimization.

This review examines bandit problems in AI using statistical methods.

problem Sequential decision-making under uncertainty in AI environments.
method Foundational models, concentration inequalities, minimax regret bounds, frequentist and Bayesian algorithms, K-armed contextual bandits, SCAB, functional data analysis.
result Exploration-exploitation trade-offs and regret analyses in various bandit problems.

Paper presents a Bayesian-decision-theory framework for long-tailed classification.

problem Heavy imbalance and asymmetric misprediction costs in long-tailed datasets.
method Bayesian-decision-theory perspective, unifying re-balancing and ensemble methods.
result Improves accuracy for all classes, especially tails, with provably optimal decisions.

This paper improves Bayesian decision tree learning using HMC.

problem Bayesian decision tree learning is challenging due to a large parameter space.
method Develops and compares HMC-based algorithms for exploring Bayesian decision tree posteriors.
result HMC-based methods outperform existing methods in predictive accuracy and tree complexity.

Develops robust ML systems for predictive uncertainties and adversarial examples.

problem Uncertainties and vulnerabilities in ML predictions and adversarial examples.
method Bayesian structural time series models, SG-MCMC, SVGD, Markov chain samplers, reinforcement learning.
result Improved robustness and efficiency in Bayesian inference and adversarial machine learning.

The paper addresses frequentist regret of Linear Thompson Sampling in stochastic linear bandits.

problem The frequentist regret of Linear Thompson Sampling (LinTS) is worse than its Bayesian counterpart.
method The paper proves the fundamental nature of the frequentist regret bound for LinTS and proposes a data-driven version of LinTS to achieve minimax optimal frequentist regret.
result The frequentist regret bound for LinTS is O~(ddT)\widetilde{\mathcal{O}}(d\sqrt{dT}), which is the best possible under certain conditions.

FSL-BDP models time-to-default without centralizing data, improving privacy mechanisms in federated settings.

problem Traditional credit risk models ignore default timing and violate data-protection rules.
method Federated Survival Learning with Bayesian Differential Privacy (FSL-BDP).
result FSL-BDP improves privacy mechanisms in federated settings, outperforming classical DP in most clients.

Optimizes portfolio construction using Bayesian methods and variational techniques.

problem Balancing reward and risk in portfolio construction.
method Bayesian decision-theoretic formulation, saddle-point problem, variational Bayes relaxation, efficient algorithm, provable convergence.
result Proves statistical consistency of proposed decision with optimal Bayesian decision.

Low-dimensional probability models for local distribution functions in a Bayesian network include decision trees, decision graphs, and causal independence models. We describe a new probability model for discrete Bayesian networks, which we call an embedded Bayesian network classifier or EBNC. The model for a node YY g…

2019-10-22abs ↗pdf ↗

Bayesian framework for learning optimal action-value function in MDPs.

problem Uncertainty quantification in MDPs for optimal decision-making strategies.
method Full Bayesian framework including modelling, inference, and decision-making.
result Demonstrates exploration benefits of posterior sampling in MDPs.

Bayesian models quantify uncertainty and facilitate optimal decision-making in downstream applications. For most models, however, practitioners are forced to use approximate inference techniques that lead to sub-optimal decisions due to incorrect posterior predictive distributions. We present a novel approach that corr…

2019-09-11abs ↗pdf ↗

qEUBO optimizes decision-making with noisy feedback.

problem Optimizing decision-making with noisy preference feedback.
method Introduces qEUBO as a novel acquisition function for preferential Bayesian optimization.
result qEUBO is one-step Bayes optimal and enjoys an approximation guarantee under noise.

Infinite BART model selects number of trees and allows different functions for clusters.

problem Regression and classification analysis with automatic tree selection and cluster-specific functions.
method Incorporates an Indian Buffet process prior to select a subset of decision trees for each observation.
result Infinite BART model outperforms classic BART on simulated and real datasets.

We consider the problem of how decision making can be fair when the underlying probabilistic model of the world is not known with certainty. We argue that recent notions of fairness in machine learning need to explicitly incorporate parameter uncertainty, hence we introduce the notion of {\em Bayesian fairness} as a su…

2017-05-31abs ↗pdf ↗

Improves DRO with Bayesian Ambiguity Sets for model misspecification.

problem Overly conservative decisions due to misspecified models in DRO.
method Introduces DRO-RoBAS with robust posterior predictive distribution.
result Outperforms other Bayesian and empirical DRO approaches in out-of-sample performance.

Diffusion approximations optimize sequential experimentation for uncertain parameters.

problem Maximizing reward from unknown parameter Θ with delayed action.
method Bayesian sequential experimentation framework, dynamic programming, diffusion asymptotics.
result Derives diffusion approximation for optimal experimentation strategy.

GoBOED optimizes experiments for specific decision-making objectives, improving downstream outcomes.

problem Reducing parameter uncertainty does not always improve decision-making in critical settings.
method Combines variational posterior surrogate and differentiable convex decision layer for gradient-based design optimization.
result GoBOED identifies designs that better align with specific decision objectives and reveals wider optimal design windows.