Novel Rapid Approach for Adaptive Gaussian Kernel Density Estimation: Gridpoint-wise Propagation of Anisotropic Diffusion Equation | 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 Novel Rapid Approach for Adaptive Gaussian Kernel Density Estimation: Gridpoint-wise Propagation of Anisotropic Diffusion Equation Christian Sustay Martinez, Patrick K. Quoika, Martin Zacharias This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8038701/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 9 You are reading this latest preprint version Abstract Anyone who works with data is regularly faced with the issue of how to represent the distribution of the collected data. Nowadays histogramming is still the standard method of choice. Yet, more sophisticated methods exist, such as Kernel Density Estimation (KDE). In comparison, KDE enables smoother and more accurate representation of the data distribution. However, some challenges remain, most of which center around the optimal choice of kernel bandwidth, and the adaptiveness of this bandwidth. Here, we propose a novel method for Gaussian KDE(GKDE) that improves upon classical approaches in terms of accuracy and computational efficiency. Our approach is parallelizable and therefore fast. This parallelizability enables implementation on modern computational hardware, such as GPU, which is a great advantage incomparison to other methods, especially if large amounts of data need to be processed. Furthermore, it automatically chooses the kernel bandwidth based on the collected data and is bydesign adaptive, i.e., the bandwidth varies across the data range. This allows smooth representation of broad features, without oversmoothing sharp features in the distribution. Moreover, ourmethod is applicable in an arbitrary number of dimensions. The approach is—similar to other novel methods—based on the propagation of the heat equation. We propose a novel measure for the detection of the optimal bandwidth, which is the variance to mean ratio of the density estimate on the grid points, for different bootstrapped samples of the original data. Apart from the introduction of the method itself, we show some illustrating examples on the performance of the approach. To this end, we evaluate various different data distributions in one and two dimensions, observing good accuracy across the board. We call this promising new approach Gridpoint-wise Adaptive Density Propagation KDE (GradePro). Full Text Additional Declarations No competing interests reported. Supplementary Files supplementaryinfo.pdf Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 12 Mar, 2026 Reviews received at journal 12 Mar, 2026 Reviewers agreed at journal 12 Mar, 2026 Reviews received at journal 13 Jan, 2026 Reviewers agreed at journal 28 Dec, 2025 Reviewers invited by journal 24 Nov, 2025 Editor assigned by journal 23 Nov, 2025 Submission checks completed at journal 06 Nov, 2025 First submitted to journal 05 Nov, 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-8038701","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":541075793,"identity":"fab7816a-0522-4ec7-8e8c-45fcb2628616","order_by":0,"name":"Christian Sustay Martinez","email":"","orcid":"","institution":"Technical University of Munich","correspondingAuthor":false,"prefix":"","firstName":"Christian","middleName":"Sustay","lastName":"Martinez","suffix":""},{"id":541075796,"identity":"70f24b7a-7e9b-40fe-a58a-75332d3e88a6","order_by":1,"name":"Patrick K. Quoika","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA50lEQVRIiWNgGAWjYLCCBCAEgYMNDDZghgR+9cwoWtIkiNPCANXC2MBwmLAWc/bzxz48qElj4LuRfPDgjJrzdQbXDjDe+IBHi2VPMvOMhGM5DJI30hIObjh2W8LgdgKz5Qw8WgwOJDMzJDZUMBjcyDE4+IANrIVNmgeflvOPkbX8OwfR8geflhtgW3IgWja2HYBowed9yxmPjRkSjqXxSJ55lnBwZl+y5Mzbic2WPXi0mPMnPmb8UZMsx3c8+fDHnm92/Hy3kw/e+IHPYVCah+EAXAwYPfiAAZx1ALeiUTAKRsEoGOEAAJUaVFvQ9aOXAAAAAElFTkSuQmCC","orcid":"","institution":"Technical University of Munich","correspondingAuthor":true,"prefix":"","firstName":"Patrick","middleName":"K.","lastName":"Quoika","suffix":""},{"id":541075797,"identity":"b81be7e5-1a86-41b8-8638-a60f37be2fc5","order_by":2,"name":"Martin Zacharias","email":"","orcid":"","institution":"Technical University of Munich","correspondingAuthor":false,"prefix":"","firstName":"Martin","middleName":"","lastName":"Zacharias","suffix":""}],"badges":[],"createdAt":"2025-11-05 13:08:15","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8038701/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8038701/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":95625567,"identity":"0432f242-1b7b-42bb-b4c3-eb8f5fbb193a","added_by":"auto","created_at":"2025-11-11 10:31:10","extension":"json","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":6136,"visible":true,"origin":"","legend":"","description":"","filename":"735217f4d9b24acfa13ce1db92c7bd19.json","url":"https://assets-eu.researchsquare.com/files/rs-8038701/v1/5aed4a1a9a3e9d1d7f7217e4.json"},{"id":95657917,"identity":"15fa318f-09bf-422c-b589-c3b0912151e2","added_by":"auto","created_at":"2025-11-11 16:22:26","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":3408333,"visible":true,"origin":"","legend":"","description":"","filename":"manuscripttex.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8038701/v1_covered_7ecaf671-d566-46b0-a5dc-a62e9279c092.pdf"},{"id":95625566,"identity":"e4ee2164-afd3-420b-8955-384cdb7975a9","added_by":"auto","created_at":"2025-11-11 10:31:10","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"supplement","size":403843,"visible":true,"origin":"","legend":"","description":"","filename":"supplementaryinfo.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8038701/v1/581d1d4048f8d80f7b139ebe.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Novel Rapid Approach for Adaptive Gaussian Kernel Density Estimation: Gridpoint-wise Propagation of Anisotropic Diffusion Equation","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"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":"international-journal-of-data-science-and-analytics","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jdsa","sideBox":"Learn more about [International Journal of Data Science and Analytics](http://link.springer.com/journal/41060)","snPcode":"41060","submissionUrl":"https://submission.nature.com/new-submission/41060/3","title":"International Journal of Data Science and Analytics","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-8038701/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8038701/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Anyone who works with data is regularly faced with the issue of how to represent the distribution of the collected data. Nowadays histogramming is still the standard method of choice. Yet, more sophisticated methods exist, such as Kernel Density Estimation (KDE). In comparison, KDE enables smoother and more accurate representation of the data distribution. However, some challenges remain, most of which center around the optimal choice of kernel bandwidth, and the adaptiveness of this bandwidth. Here, we propose a novel method for Gaussian KDE(GKDE) that improves upon classical approaches in terms of accuracy and computational efficiency. Our approach is parallelizable and therefore fast. This parallelizability enables implementation on modern computational hardware, such as GPU, which is a great advantage incomparison to other methods, especially if large amounts of data need to be processed. Furthermore, it automatically chooses the kernel bandwidth based on the collected data and is bydesign adaptive, i.e., the bandwidth varies across the data range. This allows smooth representation of broad features, without oversmoothing sharp features in the distribution. Moreover, ourmethod is applicable in an arbitrary number of dimensions. The approach is—similar to other novel methods—based on the propagation of the heat equation. We propose a novel measure for the detection of the optimal bandwidth, which is the variance to mean ratio of the density estimate on the grid points, for different bootstrapped samples of the original data. Apart from the introduction of the method itself, we show some illustrating examples on the performance of the approach. To this end, we evaluate various different data distributions in one and two dimensions, observing good accuracy across the board. We call this promising new approach Gridpoint-wise Adaptive Density Propagation KDE (GradePro).","manuscriptTitle":"Novel Rapid Approach for Adaptive Gaussian Kernel Density Estimation: Gridpoint-wise Propagation of Anisotropic Diffusion Equation","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-11-11 10:31:05","doi":"10.21203/rs.3.rs-8038701/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2026-03-13T03:24:52+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-12T21:27:24+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"276652602454557010799536366012199402372","date":"2026-03-12T14:07:43+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-01-14T01:09:22+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"324979203926758704838357660716595971245","date":"2025-12-28T17:58:42+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-11-24T08:34:24+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-11-23T19:13:43+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-11-06T14:52:27+00:00","index":"","fulltext":""},{"type":"submitted","content":"International Journal of Data Science and Analytics","date":"2025-11-05T12:55:44+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"international-journal-of-data-science-and-analytics","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jdsa","sideBox":"Learn more about [International Journal of Data Science and Analytics](http://link.springer.com/journal/41060)","snPcode":"41060","submissionUrl":"https://submission.nature.com/new-submission/41060/3","title":"International Journal of Data Science and Analytics","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"7d667a9a-aa85-4c89-a24f-838798f20310","owner":[],"postedDate":"November 11th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-04-08T11:40:08+00:00","versionOfRecord":[],"versionCreatedAt":"2025-11-11 10:31:05","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8038701","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8038701","identity":"rs-8038701","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.