Data assimilation using a global Girsanov nudged particle filter

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated deep summary by claude@2026-07, 2026-07-03 · read from full text

The paper presents a particle filtering algorithm for stochastic models defined on infinite-dimensional state spaces, using Girsanov perturbations to nudge an ensemble toward regions with higher likelihood. The authors formulate an optimization/control approach that couples control variables across all particles to maintain good effective sample size (ESS), and they split the optimization into three stages to separate nonlinearity from the ESS term versus the forward problem, enabling parallel computation over the control-variable space. They apply the method to the stochastic Kuramoto–Sivashinsky equation and compare it with a temper-jitter particle filter, reporting that the nudging filter is more over-spread but responds to extreme events more quickly and robustly. The main caveat stated is that the work is a preprint and has not yet been peer reviewed. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract We present a particle filtering algorithm for stochastic models on infinite dimensional state space, making use of Girsanov perturbations to nudge the ensemble of particles into regions of higher likelihood. We argue that the optimal control problem needs to couple control variables for all of the particles to maintain an ensemble with good effective sample size (ESS). We provide an optimisation formulation that separates the problem into three stages, separating the nonlinearity in the ESS term in the functional with the nonlinearity due to the forward problem, and allowing independent parallel computation for each particle when calculations are performed over control variable space. The particle filter is applied to the stochastic Kuramoto-Sivashinsky equation, and compared with the temper-jitter particle filter approach. We observe that whilst the nudging filter is over spread compared to the temper-jitter filter, it responds to extreme events in the assimilated data more quickly and robustly.
Full text 12,034 characters · extracted from preprint-html · click to expand
Data assimilation using a global Girsanov nudged particle filter | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Data assimilation using a global Girsanov nudged particle filter Maneesh Kumar Singh, Joshua Hope-Collins, Dan Crisan, Colin J. Cotter This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7207017/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 12 You are reading this latest preprint version Abstract We present a particle filtering algorithm for stochastic models on infinite dimensional state space, making use of Girsanov perturbations to nudge the ensemble of particles into regions of higher likelihood. We argue that the optimal control problem needs to couple control variables for all of the particles to maintain an ensemble with good effective sample size (ESS). We provide an optimisation formulation that separates the problem into three stages, separating the nonlinearity in the ESS term in the functional with the nonlinearity due to the forward problem, and allowing independent parallel computation for each particle when calculations are performed over control variable space. The particle filter is applied to the stochastic Kuramoto-Sivashinsky equation, and compared with the temper-jitter particle filter approach. We observe that whilst the nudging filter is over spread compared to the temper-jitter filter, it responds to extreme events in the assimilated data more quickly and robustly. Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 16 Nov, 2025 Reviews received at journal 16 Nov, 2025 Reviews received at journal 31 Oct, 2025 Reviewers agreed at journal 04 Aug, 2025 Reviewers agreed at journal 04 Aug, 2025 Reviewers agreed at journal 02 Aug, 2025 Reviewers agreed at journal 01 Aug, 2025 Reviewers agreed at journal 29 Jul, 2025 Reviewers invited by journal 28 Jul, 2025 Editor assigned by journal 28 Jul, 2025 Submission checks completed at journal 28 Jul, 2025 First submitted to journal 24 Jul, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7207017","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":492253704,"identity":"91df7113-02bd-40fc-bb0d-60ba9d81381d","order_by":0,"name":"Maneesh Kumar Singh","email":"","orcid":"","institution":"Imperial College London","correspondingAuthor":false,"prefix":"","firstName":"Maneesh","middleName":"Kumar","lastName":"Singh","suffix":""},{"id":492253705,"identity":"5cf86c93-e6d4-4129-b5be-517c46c43aa1","order_by":1,"name":"Joshua Hope-Collins","email":"","orcid":"","institution":"Imperial College London","correspondingAuthor":false,"prefix":"","firstName":"Joshua","middleName":"","lastName":"Hope-Collins","suffix":""},{"id":492253708,"identity":"9e452cdf-7e90-4750-9c96-599bea7480e7","order_by":2,"name":"Dan Crisan","email":"","orcid":"","institution":"Imperial College London","correspondingAuthor":false,"prefix":"","firstName":"Dan","middleName":"","lastName":"Crisan","suffix":""},{"id":492253709,"identity":"43423de3-7fdb-4426-9288-75233b4e9633","order_by":3,"name":"Colin J. Cotter","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABE0lEQVRIiWNgGAWjYFAC5oYDcPYHAxDJ2MDwAMxlw6GFEaKFByjPOAOmJYGAFgaYFmYemCA+LfztjY2HCxjs5Ozlm499tinYlscvfbjxQwKDnTyDRFoCNi0SZw42HJ7BkGzMw8aWPDvH4HaxZF9is0QCQ7Jhg0TaAWxaDCQSGw7zMBxI7GHjMWYGaknccIaxAaiFOYFBIr2BgBb+z8wWQC37zzA2/0hgqCdGCw8zMwPIFh7GNqAth4FasDsM7BceA6BfjqUZM/YA/SJxhrHNIsHguGEbzzOs3udvbz78mafCTo69+fBjhh9/bufx97A/vvGholqenz3NAJsWqPMQzAS4CK6IxABY3TIKRsEoGAUjGwAALNlYxVuFPoMAAAAASUVORK5CYII=","orcid":"","institution":"Imperial College London","correspondingAuthor":true,"prefix":"","firstName":"Colin","middleName":"J.","lastName":"Cotter","suffix":""}],"badges":[],"createdAt":"2025-07-24 15:23:20","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7207017/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7207017/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":87841870,"identity":"2a8bf3cb-c277-4009-85d9-d8a3c3899d27","added_by":"auto","created_at":"2025-07-29 14:18:39","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":911661,"visible":true,"origin":"","legend":"","description":"","filename":"nudge.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7207017/v1_covered_28e03e98-733b-4aa3-94f3-247410403ccd.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Data assimilation using a global Girsanov nudged particle filter","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"statistics-and-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"stco","sideBox":"Learn more about [Statistics and Computing](http://link.springer.com/journal/11222)","snPcode":"11222","submissionUrl":"https://submission.nature.com/new-submission/11222/3","title":"Statistics and Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-7207017/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7207017/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eWe present a particle filtering algorithm for stochastic models on infinite dimensional state space, making use of Girsanov perturbations to nudge the ensemble of particles into regions of higher likelihood. We argue that the optimal control problem needs to couple control variables for all of the particles to maintain an ensemble with good effective sample size (ESS). We provide an optimisation formulation that separates the problem into three stages, separating the nonlinearity in the ESS term in the functional with the nonlinearity due to the forward problem, and allowing independent parallel computation for each particle when calculations are performed over control variable space. The particle filter is applied to the stochastic Kuramoto-Sivashinsky equation, and compared with the temper-jitter particle filter approach. We observe that whilst the nudging filter is over spread compared to the temper-jitter filter, it responds to extreme events in the assimilated data more quickly and robustly.\u003c/p\u003e","manuscriptTitle":"Data assimilation using a global Girsanov nudged particle filter","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-29 14:10:34","doi":"10.21203/rs.3.rs-7207017/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-11-16T08:14:35+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-11-16T07:33:02+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-31T16:53:34+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"179326257974503144861403509565448328136","date":"2025-08-04T10:37:53+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"171622494168126800781851025467930428599","date":"2025-08-04T06:10:43+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"302991349615233056702337889806029660858","date":"2025-08-03T02:22:29+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"233607081174713630739785612467004819865","date":"2025-08-01T08:41:59+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"303124959719481793430830813620669254774","date":"2025-07-29T13:46:52+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-07-28T08:39:00+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-07-28T08:36:08+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-07-28T06:16:37+00:00","index":"","fulltext":""},{"type":"submitted","content":"Statistics and Computing","date":"2025-07-24T15:17:14+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"statistics-and-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"stco","sideBox":"Learn more about [Statistics and Computing](http://link.springer.com/journal/11222)","snPcode":"11222","submissionUrl":"https://submission.nature.com/new-submission/11222/3","title":"Statistics and Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"9df96122-6a89-4994-b7c5-435e315013c2","owner":[],"postedDate":"July 29th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-03-28T06:53:12+00:00","versionOfRecord":[],"versionCreatedAt":"2025-07-29 14:10:34","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7207017","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7207017","identity":"rs-7207017","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-29T02:00:03.542394+00:00
License: CC-BY-4.0