Pages that link to "Item:Q5247618"

The following pages link to Learning to Optimize via Posterior Sampling (Q5247618):

Displaying 44 items.

• Gaussian process bandits with adaptive discretization (Q1711556) (← links)
• A unified framework for stochastic optimization (Q1719609) (← links)
• On Bayesian index policies for sequential resource allocation (Q1750289) (← links)
• Bayesian adversarial multi-node bandit for optimal smart grid protection against cyber attacks (Q2021298) (← links)
• Improved regret for zeroth-order adversarial bandit convex optimisation (Q2035748) (← links)
• Multi-armed bandit with sub-exponential rewards (Q2060366) (← links)
• Best arm identification in generalized linear bandits (Q2060547) (← links)
• IntelligentPooling: practical Thompson sampling for mHealth (Q2071414) (← links)
• Bayesian optimization with partially specified queries (Q2673324) (← links)
• Multi-fidelity cost-aware Bayesian optimization (Q2693418) (← links)
• On the Prior Sensitivity of Thompson Sampling (Q2831392) (← links)
• On the Convergence Rates of Expected Improvement Methods (Q2957473) (← links)
• Decomposable Markov Decision Processes: A Fluid Optimization Approach (Q2957475) (← links)
• Optimal Learning in Linear Regression with Combinatorial Feature Selection (Q2960366) (← links)
• Optimal Learning with Local Nonlinear Parametric Models over Continuous Designs (Q3303989) (← links)
• Variance Regularization in Sequential Bayesian Optimization (Q3387910) (← links)
• Optimal Information Blending with Measurements in the <i>L</i>² Sphere (Q3465948) (← links)
• Optimal Learning for Nonlinear Parametric Belief Models Over Multidimensional Continuous Spaces (Q4554064) (← links)
• Practical Bayesian support vector regression for financial time series prediction and market condition change detection (Q4555150) (← links)
• Multi-Armed Bandit for Species Discovery: A Bayesian Nonparametric Approach (Q4690972) (← links)
• Learning to Optimize via Information-Directed Sampling (Q4969321) (← links)
• The Local Time Method for Targeting and Selection (Q4971570) (← links)
• Bayesian Exploration for Approximate Dynamic Programming (Q4971589) (← links)
• Game of Thrones: Fully Distributed Learning for Multiplayer Bandits (Q4991671) (← links)
• (Q5053221) (← links)
• Bandit Theory: Applications to Learning Healthcare Systems and Clinical Trials (Q5072150) (← links)
• Infinite Arms Bandit: Optimality via Confidence Bounds (Q5089465) (← links)
• Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning (Q5089723) (← links)
• Online Resource Allocation with Personalized Learning (Q5106359) (← links)
• Online Decision Making with High-Dimensional Covariates (Q5130496) (← links)
• Technical Note—Consistency Analysis of Sequential Learning Under Approximate Bayesian Inference (Q5130497) (← links)
• Online Network Revenue Management Using Thompson Sampling (Q5131540) (← links)
• Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
• Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors (Q5144779) (← links)
• (Q5149240) (← links)
• Complete expected improvement converges to an optimal budget allocation (Q5203897) (← links)
• (Q5214215) (← links)
• Efficient Simulation of High Dimensional Gaussian Vectors (Q5219708) (← links)
• ON THE IDENTIFICATION AND MITIGATION OF WEAKNESSES IN THE KNOWLEDGE GRADIENT POLICY FOR MULTI-ARMED BANDITS (Q5358114) (← links)
• Satisficing in Time-Sensitive Bandit Learning (Q5870357) (← links)
• Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
• Online learning of network bottlenecks via minimax paths (Q6097144) (← links)
• Reward Maximization Through Discrete Active Inference (Q6136191) (← links)
• Online learning of energy consumption for navigation of electric vehicles (Q6157210) (← links)