Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
On Confidence Sequences for Bounded Random Processes via Universal Gambling Strategies
by
Bhatt, Alankrita
, Ryu, J Jon
in
Algorithms
/ Gambling
/ Lower bounds
/ Random processes
2024
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
On Confidence Sequences for Bounded Random Processes via Universal Gambling Strategies
by
Bhatt, Alankrita
, Ryu, J Jon
in
Algorithms
/ Gambling
/ Lower bounds
/ Random processes
2024
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
On Confidence Sequences for Bounded Random Processes via Universal Gambling Strategies
Paper
On Confidence Sequences for Bounded Random Processes via Universal Gambling Strategies
2024
Request Book From Autostore
and Choose the Collection Method
Overview
This paper considers the problem of constructing a confidence sequence, which is a sequence of confidence intervals that hold uniformly over time, for estimating the mean of bounded real-valued random processes. This paper revisits the gambling-based approach established in the recent literature from a natural two-horse race perspective, and demonstrates new properties of the resulting algorithm induced by Cover (1991)'s universal portfolio. The main result of this paper is a new algorithm based on a mixture of lower bounds, which closely approximates the performance of Cover's universal portfolio with constant per-round time complexity. A higher-order generalization of a lower bound on a logarithmic function in (Fan et al., 2015), which is developed as a key technique for the proposed algorithm, may be of independent interest.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.