{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T15:16:40Z","timestamp":1777735000432,"version":"3.51.4"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1617986"],"award-info":[{"award-number":["CCF-1617986"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute for Advanced Computational Science at Stony Brook University","award":["OAC-1531492"],"award-info":[{"award-number":["OAC-1531492"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3093792","type":"journal-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T19:31:03Z","timestamp":1625081463000},"page":"4245-4256","source":"Crossref","is-referenced-by-count":9,"title":["Policy Gradient Importance Sampling for Bayesian Inference"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0728-737X","authenticated-orcid":false,"given":"Yousef","family":"El-Laham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2963-1474","authenticated-orcid":false,"given":"Monica F.","family":"Bugallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-016-9642-5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2440215"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2014.04.002"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1049\/iet-its.2017.0153"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1285773"},{"key":"ref30","article-title":"Convex optimization for Monte Carlo: Stochastic optimization for importance sampling","author":"ryu","year":"2016"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2000.10473909"},{"key":"ref36","first-page":"5581","article-title":"Yes, but did it work","author":"yao","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref35","article-title":"Pareto smoothed importance sampling","author":"vehtari","year":"2021"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682284"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2288355"},{"key":"ref27","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref2","author":"robert","year":"2013","journal-title":"Monte Carlo Statistical Methods"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/1913641"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1028905934"},{"key":"ref22","first-page":"885","article-title":"Safe and adaptive importance sampling: A mixture approach","volume":"49","author":"delyon","year":"2021","journal-title":"Annals"},{"key":"ref21","first-page":"1","article-title":"Particle filters, the &#x201C;optimal&#x201D; proposal and high-dimensional systems","author":"snyder","year":"2011","journal-title":"Proc ECMWF Seminar Data Assimilation Atmos Ocean"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref23","author":"liang","year":"2011","journal-title":"Advanced Markov Chain Monte Carlo Methods Learning from Past Samples"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.1991.185710"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729392"},{"key":"ref50","author":"rudin","year":"1986","journal-title":"Real and Complex Analysis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2015.05.014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9059-x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1198\/106186004X12803"},{"key":"ref12","article-title":"Adaptive importance sampling via stochastic convex programming","author":"ryu","year":"2014"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683152"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9469.2011.00756.x"},{"key":"ref15","first-page":"3134","article-title":"Asymptotic optimality of adaptive importance sampling","author":"portier","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.063303"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1914"},{"key":"ref18","article-title":"Schr&#x00F6;dinger bridge samplers","author":"bernton","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/2200000074"},{"key":"ref4","first-page":"316","article-title":"Curse-of-dimensionality revisited: Collapse of importance sampling in very large scale systems","volume":"85","author":"li","year":"2005","journal-title":"Technical Rapport"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/9781119125495"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1201\/b10905"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2005.01.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.strusafe.2013.01.006"},{"key":"ref7","first-page":"656","article-title":"A tutorial on particle filtering and smoothing: Fifteen years later","volume":"12","author":"doucet","year":"2009"},{"key":"ref49","author":"weiss","year":"2006","journal-title":"A Course in Probability"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/00949659208810398"},{"key":"ref46","first-page":"1057","article-title":"Policy gradient methods for reinforcement learning with function approximation","author":"sutton","year":"2000","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282564"},{"key":"ref48","article-title":"An overview of gradient descent optimization algorithms","author":"ruder","year":"2017"},{"key":"ref47","article-title":"The optimal reward baseline for gradient-based reinforcement learning","author":"weaver","year":"2013"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2016.07.012"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2954048"},{"key":"ref44","article-title":"Meta-reinforcement learning of structured exploration strategies","volume":"31","author":"gupta","year":"2018","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s001800050022"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/9307529\/9468927-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09468927.pdf?arnumber=9468927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:39Z","timestamp":1652194239000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9468927\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3093792","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}