Technical Note—Consistency Analysis of Sequential Learning Under Approximate Bayesian Inference
From MaRDI portal
Publication:5130497
DOI10.1287/opre.2019.1850zbMath1445.90043OpenAlexW2998422691MaRDI QIDQ5130497
Publication date: 4 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1850
incomplete informationapproximate Bayesian inferencestatistical learningBayesian logistic regressioncensored information
Learning and adaptive systems in artificial intelligence (68T05) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- A new proof of convergence of MCMC via the ergodic theorem
- Approximate Bayesian computational methods
- Asynchronous stochastic approximation and Q-learning
- \({\mathcal Q}\)-learning
- Random effects logistic regression model for default prediction of technology credit guarantee fund
- SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy
- On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes
- General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm
- On the Convergence Rates of Expected Improvement Methods
- Gaussian MAP Filtering Using Kalman Optimization
- Approximate Dynamic Programming
- Sequential Selection with Unknown Correlation Structures
- Sequential updating of conditional probabilities on directed graphical structures
- On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
- Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms
- Pricing and the Newsvendor Problem: A Review with Extensions
- The stochastic root-finding problem
- A Stochastic Approximation Algorithm with Varying Bounds
- The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
- Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem
- Frequentist Consistency of Variational Bayes
- Learning to Optimize via Posterior Sampling
- Approximate Bayesian inference for simulation and optimization
- Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems
- A Stochastic Approximation Method
- Stochastic approximation
- An adaptive Metropolis algorithm
- Moment-Matching-Based Conjugacy Approximation for Bayesian Ranking and Selection
