IP Library › Granted Patent US 12,585,957
Granted Patent B2
US 12,585,957 · App. 17/954,059 · Granted Mar 24, 2026

System and method for efficient estimation of cumulative distribution function

Inventors: Chandramouli Shama Sastry (Halifax, CA); Alexander Radomir Branislav Radovic (Toronto, CA); Marcus Anthony Brubaker (Toronto, CA); Andreas Steffen Michael Lehrmann (Vancouver, CA)
Assignee: ROYAL BANK OF CANADA
G06N3/09G06N7/01
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,585,957
App. No.
17/954,059
Granted
Mar 24, 2026
Kind
B2
Abstract

A computer-implemented system and method for estimating a Cumulative Distribution Function (CDF) are provided. The method includes: receive input data representing a volume V of a target space indicating a future target event; compute, using the trained neural network, an estimation of a first flux through a boundary of the volume V; compute, using the trained neural network, an estimation of a second flux through a boundary of a volume W of a base space based on the estimation of the first flux through the boundary of the volume V; generate, using the trained neural network, an estimation of a CDF for the volume V based on the second flux through the boundary of the volume W; compute a probability for the future target event based on the estimated CDF for the volume V; and generate a control command based on the probability for the future target event.

Claims (100)

1 . A computer-implemented system for estimating a Cumulative Distribution Function (CDF), the system comprising:

at least one processor; and

memory in communication with said at least one processor storing an CDF Estimator comprising a trained neural network and machine-readable instructions, wherein the instructions, when executed at said at least one processor, cause said system to:

receive input data representing a volume V of a target space indicating a future target event;

compute, using the trained neural network, an estimation of a first flux through a boundary of the volume V;

compute, using the trained neural network, an estimation of a second flux through a boundary of a volume W of a base space based on the estimation of the first flux through the boundary of the volume V;

generate, using the trained neural network, an estimation of a CDF for the volume V based on the second flux through the boundary of the volume W;

compute a probability for the future target event based on the estimated CDF for the volume V; and

generate a control command based on the probability for the future target event.

2 . The system of claim 1 , wherein, during training of the neural network, the instructions when executed at said at least one processor, cause said system to: receive, as training input, historical data representative of past target events and wherein the boundary of the volume V of the target space is defined based in part on the historical data.

3 . The system of claim 2 , wherein, during training of the neural network, the instructions when executed at said at least one processor, cause said system to: use a model fitting process to generate a Probability Distribution Function (PDF) based on the historical data.

4 . The system of claim 3 , wherein, during the training of the neural network, one or more weights of the neural network are iteratively updated to improve the estimation of the CDF by selecting points on the boundary of the volume V.

5 . The system of claim 1 , wherein the estimation of the CDF for the volume V is based on a flux through the transformed boundary of the volume V in the base space.

6 . The system of claim 1 , wherein the estimation the CDF for the volume V is based on a flux through the untransformed boundary of the volume V in the target space.

7 . The system of claim 1 , wherein the trained neural network is configured to compute:

P ( x∈V )=∫ V p X ( x ) dx,

wherein P(x∈V) is a cumulative density over the volume V, and x represents a random variable with the complex target distribution p X (x).

8 . The system of claim 7 , wherein:

p

X

(

x

)

=

p

Y

(

y

)

⁢

abs

⁡

(

❘

"\[LeftBracketingBar]"

d

⁢

g

dx

❘

"\[RightBracketingBar]"

)

,

wherein: |·| is a determinant, abs(·) denotes absolute value, g is inverse of f,

d

⁢

g

dx

is (d×d)—Jacobian J of g, x represents the random variable with the complex target distribution p X (x) using a bijective mapping f: d → d , y is a random variable with a base distribution p Y (y).

9 . The system of claim 8 , wherein p Y (y) comprises a Gaussian distribution.

10 . The system of claim 8 , wherein p Y (y) comprises a uniform distribution.

11 . A computer-implemented method for estimating a Cumulative Distribution Function (CDF), the method comprising:

receiving input data representing a volume V of a target space indicating a future target event;

computing, using a trained neural network, an estimation of a first flux through a boundary of the volume V;

computing, using the trained neural network, an estimation of a second flux through a boundary of a volume W of a base space based on the estimation of the first flux through the boundary of the volume V;

generating, using the trained neural network, an estimation of a CDF for the volume V based on the second flux through the boundary of the volume W;

computing a probability for the future target event based on the estimated CDF for the volume V; and

generating a control command based on the probability for the future target event.

12 . The method of claim 11 , wherein, during training of the neural network, historical data representative of past target events are used as training input, and wherein the boundary of the volume V of the target space is defined based in part on the historical data.

13 . The method of claim 12 , wherein method comprises: using a model fitting process to generate a Probability Distribution Function (PDF) based on the historical data.

14 . The method of claim 13 , wherein during the training of the neural network, one or more weights of the neural network are iteratively updated to improve the estimation of the CDF by selecting points on the boundary of the volume V.

15 . The method of claim 11 , wherein the estimation of the CDF for the volume V is based on a flux through the transformed boundary of the volume V in the base space.

16 . The method of claim 11 , wherein the estimation the CDF for the volume V is based on a flux through the untransformed boundary of the volume V in the target space.

17 . The method of claim 11 , wherein:

P ( x∈V )=∫ p X ( x ) dx,

wherein P(x∈V) is a cumulative density over the volume V, and x represents a random variable with the complex target distribution p X (x).

18 . The method of claim 17 , wherein:

p

X

(

x

)

=

p

Y

(

y

)

⁢

abs

⁡

(

❘

"\[LeftBracketingBar]"

d

⁢

g

dx

❘

"\[RightBracketingBar]"

)

,

wherein: |·| is a determinant, abs(·) denotes absolute value, g is inverse of f,

d

⁢

g

dx

is (d×d)—Jacobian J of g, x represents the random variable with the complex target distribution p X (x) using a bijective mapping f: d → d , y is a random variable with a base distribution p Y (y).

19 . The method of claim 18 , wherein p Y (y) comprises a Gaussian distribution.

20 . The method of claim 18 , wherein p Y (y) comprises a uniform distribution.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 13, 2025
From: SASTRY, CHANDRAMOULI SHAMA; RADOVIC, ALEXANDER RADOMIR BRANISLAV; BRUBAKER, MARCUS ANTHONY; LEHRMANN, ANDREAS STEFFEN MICHAEL
To: ROYAL BANK OF CANADA
Reel/Frame 072005/0738 →
Continuity (3)
Provisional Application 63303742 · Jan 27, 2022
Provisional Application 63248843 · Sep 27, 2021
Related Publication 20230100213A1 · Mar 30, 2023
References Cited (37)
US 9355062B2 · Marshall · 2016 [cited by examiner]
US 9702702B1 · Lane · 2017 [cited by examiner]
US 10578413B1 · Burke · 2020 [cited by examiner]
US 11322248B2 · Grantcharov · 2022 [cited by examiner]
US 20110163034A1 · Castellarnau · 2011 [cited by examiner]
US 20170068861A1 · Miller · 2017 [cited by examiner]
US 20200058407A1 · Balaban · 2020 [cited by examiner]
US 20230100213A1 · Sastry · 2023 [cited by examiner]
[Abdar et al.(2021) Abdar, Pourpanah, Hussain, Rezazadegan, Liu, Ghavamzadeh, Fieguth, Cao, Khosravi, Acharya, Makarenkov, and Nahavandi] Moloud Abdar, Farhad Pourpanah, Sadiq Hussain, Dana Rezazadegan, Li Liu, Mohammad… [cited by applicant]
[Richardson et al.(1997) Richardson, Boudoukh, and Whitelaw] Matthew Richardson, Jacob Boudoukh, and Robert F. Whitelaw. The Best of Both Worlds: A Hybrid Approach to Calculating Value at Risk, 1997. [cited by applicant]
[Botev l'Ecuyer(2015) Botev and l'Ecuyer] Zdravko | Botev and Pierre l'Ecuyer. Efficient Probability Estimation and Simulation of the Truncated Multivariate Student-t Distribution. Winter Simulation Conference (WSC), 20… [cited by applicant]
[Botev(2017)] Zdravko | Botev. The Normal Law Under Linear Restrictions: Simulation and Estimation via Minimax Tilting. Journal of the Royal Statistical Society, 2017. [cited by applicant]
[Chilinski Silva(2020) Chilinski and Silva] Pawel M. Chilinski and Ricardo Silva. Neural Likelihoods via Cumulative Distribution Functions. UAI, 2020. [cited by applicant]
[Cundy Ermon(2020) Cundy and Ermon] Chris Cundy and Stefano Ermon. Flexible Approximate Inference via Stratified Normalizing Flows. UAI, 2020. [cited by applicant]
[Cunningham et˜al.(2013) Cunningham, Hennig, and Lacoste-Julien] John P. Cunningham, Philipp Hennig, and Simon Lacoste-Julien. Gaussian Probabilities and Expectation Propagation. JMLR, 2013. [cited by applicant]
[Dai Seljak(2021) Dai and Seljak] Biwei Dai and Uros Seljak. Sliced Iterative Normalizing Flows. ICML Workshop on Invertible Neural Networks, Normalizing Flows, and Explicit Likelihood Models, 2021. [cited by applicant]
[Press et al.(1988)Press, Teukolsky, Vetterling, and Flannery] William H Press, Saul A Teukolsky, William T Vetterling, and Brian P Flannery. Numerical Recipes in C. Cambridge University Press, 1988.[. [cited by applicant]
[Evans(2010)] Lawrence C Evans. Partial Differential Equations. Graduate Studies in Mathematics, 2010. [cited by applicant]
[Papamakarios et al.(2021) Papamakarios, Nalisnick, Rezende, Mohamed, and Lakshminarayanan] George Papamakarios, Eric Nalisnick, Danilo Jimenez Rezende, Shakir Mohamed, and Balaji Lakshminarayanan. Normalizing Flows for… [cited by applicant]
[Grathwohl et al.(2019) Grathwohl, Chen, Bettencourt, Sutskever, and Duvenaud] Will Grathwohl, Ricky T. Q. Chen, Jesse Bettencourt, Ilya Sutskever, and David Duvenaud. FFJORD: Free-Form Continuous Dynamics for Scalable … [cited by applicant]
[Kingma Dhariwal(2018) Kingma and Dhariwal] Diederik P. Kingma and Prafulla Dhariwal. Glow: Generative Flow with Invertible 1x1 Convolutions. NeurIPS, 2018. [cited by applicant]
[Kobyzev et al.(2020)Kobyzev, Prince, and Brubaker] Ivan Kobyzev, Simon Prince, and Marcus Brubaker. Normalizing Flows: An Introduction and Review of Current Methods. PAMI, 2020. [cited by applicant]
[Ridgeway Mozer(2018)Ridgeway and Mozer] Karl Ridgeway and Michael C. Mozer. Learning Deep Disentangled Embeddings With the F-Statistic Loss. NeurIPS, 2018. [cited by applicant]
[Liang et al.(2020)Liang, Yang, Stoica, Abbeel, Duan, and Chen] Eric Liang, Zongheng Yang, Ion Stoica, Pieter Abbeel, Yan Duan, and Xi Chen. Variable Skipping for Autoregressive Range Density Estimation. ICML, 2020. [cited by applicant]
[Liu et al. (2019) Liu, Paisley, Kioumourtzoglou, and Coull] Jeremiah Z. Liu, John W. Paisley, Marianthi-Anna Kioumourtzoglou, and Brent A. Coull. Accurate Uncertainty Estimation and Decomposition in Ensemble Learning. … [cited by applicant]
[Mazaheri et al.(2020)Mazaheri, Jain, and Bruck] Bijan Mazaheri, Siddharth Jain, and Jehoshua Bruck. Robust Correction of Sampling Bias using Cumulative Distribution Functions. NeurIPS, 2020. [cited by applicant]
[Mehta et al.(2012)Mehta, Neukirchen, Pfetsch, and Poppensieker] Amit Mehta, Max Neukirchen, Sonja Pfetsch, and Thomas Poppensieker. Managing Market Risk: Today and Tomorrow, 2012. [cited by applicant]
[Sun et al.(2021) Sun, Lee, and Lee] Wei-Fang Sun, Cheng-Kuang Lee, and Chun-Yi Lee. DFAC Framework: Factorizing the Value Function via Quantile Mixture for Multi-Agent Distributional Q-Learning. ICML, 2021. [cited by applicant]
[Minka(2001)] Thomas P. Minka. Expectation Propagation for Approximate Bayesian Inference. UAI, 2001. [cited by applicant]
[Papamakarios et al.(2017) Papamakarios, Murray, and Pavlakou] George Papamakarios, lain Murray, and Theo Pavlakou. Masked Autoregressive Flow for Density Estimation. NeurIPS, 2017. [cited by applicant]
[Genz Bretz(2009) Genz and Bretz] Alan Genz and Frank Bretz. Computation of Multivariate Normal and T Probabilities. Springer Science & Business Media, 2009. [cited by applicant]
Dua Graff(2017) Dua and Graff] Dheeru Dua and Casey Graff. UCI Machine Learning Repository, 2017. URL http://archive.ics.uci.edu/ml. [cited by applicant]
[Armstrong(2013)] Mark Anthony Armstrong. Basic Topology. Springer Science & Business Media, 2013. [cited by applicant]
[Lange(1999)] Kenneth Lange. Quadrature Methods. Numerical Analysis for Statisticians, 1999. [cited by applicant]
[Meneguzzo Vecchiato(2004)Meneguzzo and Vecchiato] Davide Meneguzzo and Walter Vecchiato. Copula Sensitivity in Collateralized Debt Obligations and Basket Default Swaps. Journal of Futures Markets: Futures, Options, and… [cited by applicant]
[Sklar(1959)] M Sklar. Fonctions de Répartition à n Dimensions et Leurs Marges. Publications de l'Institut Statistique de l'Université de Paris, 1959. [cited by applicant]
[Wade(2017)] William Wade. An Introduction to Analysis. Pearson, 2017. [cited by applicant]