The following pages link to Aurélien Garivier (Q591115):
Displaying 22 items.
- (Q325012) (redirect page) (← links)
- Bregman superquantiles. Estimation methods and applications (Q325014) (← links)
- Kullback-Leibler upper confidence bounds for optimal sequential allocation (Q366995) (← links)
- Sequential Monte Carlo smoothing for general state space hidden Markov models (Q657691) (← links)
- Context tree selection: a unifying view (Q719769) (← links)
- A lower-bound for the maximin redundancy in pattern coding (Q845432) (← links)
- A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification (Q1007478) (← links)
- Conditional quantile sequential estimation for stochastic codes (Q2321791) (← links)
- (Q2810758) (← links)
- On Upper-Confidence Bound Policies for Switching Bandit Problems (Q3093948) (← links)
- Consistency of the Unlimited BIC Context Tree Estimator (Q3548030) (← links)
- Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes (Q3548057) (← links)
- On Approximate Maximum-Likelihood Methods for Blind Identification: How to Cope With the Curse of Dimensionality (Q4569951) (← links)
- Learning the distribution with largest mean: two bandit frameworks (Q4606431) (← links)
- A minimax and asymptotically optimal algorithm for stochastic bandits (Q4645646) (← links)
- Joint Estimation of Intersecting Context Tree Models (Q4923058) (← links)
- Coding on Countably Infinite Alphabets (Q4975701) (← links)
- Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm (Q4982617) (← links)
- Nonasymptotic sequential tests for overlapping hypotheses applied to near-optimal arm identification in bandit models (Q4987192) (← links)
- A note on perfect simulation for Exponential Random Graph Models (Q5110215) (← links)
- Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (Q5219722) (← links)
- (Q5405258) (← links)
