No article text was recorded for this version.
parametric distribution constraints (prior knowledge requirement)
Version 1 of 135 papers40 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Variational inference for the multi-armed contextual bandit
- Blog: Leveraging priors on distribution functions for multi arm bandits
- Blog: Sample complexity of partition identification using multi-armed bandits
- Blog: Profitable Bandits
- Blog: Sub-sampling for Efficient Non-Parametric Bandit Exploration
- Blog: Bandit algorithms: Letting go of logarithmic regret for statistical robustness
- Blog: Efficient Pure Exploration in Adaptive Round model
- Blog: On Stochastic Contextual Bandits with Knapsacks in Small Budget Regime
- Blog: A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis
- Blog: Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness
- Blog: Regret Minimization in Heavy-Tailed Bandits
- Blog: Extreme Bandits using Robust Statistics
- Blog: Quantile-Regret Minimisation in Infinitely Many-Armed Bandits
- Blog: Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting
- Blog: An optimal algorithm for the Thresholding Bandit Problem
- Blog: On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits
- Blog: Fixed Budget Bayesian Best Arm Identification in Unimodal Bandits
- Blog: Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits
- Blog: Diffusion Prior for Online Decision Making: A Case Study of Thompson Sampling
- Blog: What You See May Not Be What You Get: UCB Bandit Algorithms Robust to ε-Contamination
- Blog: Empirical Bound Information-Directed Sampling for Norm-Agnostic Bandits
- Blog: Replication-proof Bandit Mechanism Design with Bayesian Agents
- Blog: Pure Exploration with Multiple Correct Answers
- Blog: Tracking Most Significant Shifts in Nonparametric Contextual Bandits
- Blog: Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
- Blog: Top Two Algorithms Revisited
- Blog: Bayesian Mixture Modelling and Inference based Thompson Sampling in Monte-Carlo Tree Search
- Blog: From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits
- Blog: Epsilon Best Arm Identification in Spectral Bandits
- Blog: Learning to Stop with Surprisingly Few Samples
- Blog: Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
- Blog: Piecewise Stationary Bandits under Risk Criteria
- Blog: Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits
- Blog: An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
- Blog: On Limited-Memory Subsampling Strategies for Bandits
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_parametric_distribution_constraints_prio_5d80c4cb,
title = {parametric distribution constraints (prior knowledge requirement)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/parametric-distribution-constraints-prior-knowledge-requirement/rdr_5d80c4cb06c74981af66324ca514b3a7},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_parametric_distribution_constraints_prio_5d80c4cb_v1,
title = {parametric distribution constraints (prior knowledge requirement)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/parametric-distribution-constraints-prior-knowledge-requirement/rdr_5d80c4cb06c74981af66324ca514b3a7/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}