Abstract
We address the question of how to construct optimal confidence bands with a predefined nominal coverage from a finite set of sample paths. We introduce a mixed-integer optimization algorithm to calculate globally optimal pathwise confidence bands. We illustrate the method with an example of realistic size.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
