The time until the final zero crossing of random sums with application to nonparametric bandit theory

DOI10.1016/0096-3003(94)90197-XzbMATH Open0819.62062MaRDI QIDQ1335239FDOQ1335239

Authors: V. Pereyra 

Publication date: 28 September 1994

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Recommendations

• Nonparametric bandit methods
• Machine learning and nonparametric bandit theory
• scientific article; zbMATH DE number 4078557
• An optimal stopping zero-sum game in discrete-time multi-armed bandit processes
• Bayesian nonparametric bandits

zbMATH Keywords

probability boundsrandom sumszero crossingsnon-Bayesian nonparametric problemsnonparametric bandit theorysums of biased independent identically distributed random variables

Mathematics Subject Classification ID

Sequential statistical design (62L05) Design of statistical experiments (62K99) Nonparametric inference (62G99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotically efficient adaptive allocation rules
• Some aspects of the sequential design of experiments
• On Deviations of the Sample Mean
• Title not available (Why is that?)
• Integral Limit Theorems Taking Large Deviations Into Account When Cramér’s Condition Does Not Hold. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonparametric bandit methods
• A Problem on Large Deviations in a Space of Trajectories
• Nonlinear renewal theory for conditional random walks
• Convergence rates related to the strong law of large numbers
• Large deviation probabilities in the strong law of large numbers
• On the time and the excess of liner boundary crossing of sample sums

Cited In (1)

• Sequential design with applications to the trim-loss problem

This page was built for publication: The time until the final zero crossing of random sums with application to nonparametric bandit theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335239)