• Login
    View Item 
    •   Home
    • Research
    • Preprints
    • View Item
    •   Home
    • Research
    • Preprints
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Optimal Importance Sampling via Stochastic Optimal Control for Stochastic Reaction Networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Preprintfile1.pdf
    Size:
    1.024Mb
    Format:
    PDF
    Description:
    Pre-print
    Download
    Type
    Preprint
    Authors
    Hammouda, Chiheb Ben
    Rached, Nadhir Ben
    Tempone, Raul cc
    Wiechert, Sophia
    KAUST Department
    Applied Mathematics and Computational Science Program
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Stochastic Numerics Research Group
    KAUST Grant Number
    OSR-2019-CRG8-4033
    Date
    2021-10-27
    Permanent link to this record
    http://hdl.handle.net/10754/673032
    
    Metadata
    Show full item record
    Abstract
    Herein, we explore the efficient estimation of statistical quantities, particularly rare event probabilities, for stochastic reaction networks and biochemical systems. To this end, we propose a novel importance sampling (IS) approach to improve the efficiency of Monte Carlo (MC) estimators when based on an approximate tau-leap scheme. The crucial step in the IS framework is choosing an appropriate change of probability measure for achieving substantial variance reduction. Typically, this is challenging and often requires insights into the given problem. Based on an original connection between finding the optimal IS parameters within a class of probability measures and a stochastic optimal control (SOC) formulation, we propose an automated approach to obtain a highly efficient path-dependent measure change. The optimal IS parameters are obtained by solving a variance minimization problem. We begin by deriving an associated backward equation solved by these optimal parameters. Given the challenge of analytically solving this backward equation, we propose a numerical dynamic programming algorithm to approximate the optimal control parameters. In the one-dimensional case, our numerical results show that the variance of our proposed estimator decays at a rate of O(∆t) for a step size of ∆t, compared to O(1) for a standard MC estimator. For a given prescribed error tolerance, TOL, this implies an improvement in the computational complexity to become O(TOL−2) instead of O(TOL−3) when using a standard MC estimator. To mitigate the curse of dimensionality issue caused by solving the backward equation in the multi-dimensional case, we propose an alternative learning-based method that approximates the value function using a neural network, the parameters of which are determined via a stochastic optimization algorithm. The learning process uses the optimality criterion of our SOC problem, which relates the optimal controls to the value function. In this exploratory work, our numerical experiments demonstrate that our learning-based IS approach substantially reduces the variance of the MC estimator.
    Sponsors
    This publication is based upon work supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research (OSR) under Award No. OSR-2019-CRG8-4033. This work was partially performed as part of the Helmholtz School for Data Science in Life, Earth and Energy (HDS-LEE) and received funding from the Helmholtz Association of German Research Centres and the Alexander von Humboldt Foundation.
    Publisher
    arXiv
    arXiv
    2110.14335
    Additional Links
    https://arxiv.org/pdf/2110.14335.pdf
    Collections
    Preprints; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.