IP Library Granted Patent US 12,536,451
Granted Patent B2
US 12,536,451 · App. 17/351,719 · Granted Jan 27, 2026

Methods and systems for generating an uncertainty score for an output of a gradient boosted decision tree model

Inventors: Lyudmila Aleksandrovna Prokhorenkova (Moscow, RU); Aleksey Ivanovich Ustimenko (Ivanovo, RU); Andrey Alekseevich Malinin (Moscow, RU)
Assignee: Y.E. Hub Armenia LLC
G06N5/04G06N5/01G06N20/20
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,536,451
App. No.
17/351,719
Granted
Jan 27, 2026
Kind
B2
Abstract

A method of generating an uncertainty score for an output of a Gradient Boosted Decision Tree (GBDT) model is disclosed. The output is a prediction of the GBDT model for an in-use dataset. The method comprises acquiring the GBDT model including a sequence of trees beginning with an initial tree and ending with a last tree, a given one of the sequence of trees having been stochastically built during a current training iteration of the GBDT model, and defining a plurality of sub-sequences of trees in the sequence of trees as sub-models of the GBDT model. During a given in-use iteration of the GBDT model executable for the in-use dataset, the method comprises generating a plurality of sub-outputs using the respective sub-models and generating the uncertainty score using the plurality of sub-outputs, the uncertainty score being indicative of how different sub-outputs from the plurality of sub-outputs are amongst each other.

Claims (57)

1 . A method of generating an uncertainty score for an output of a Gradient Boosted Decision Tree (GBDT) model for a self-driving vehicle, the output being a prediction of the GBDT model for an in-use dataset, the method executable by a server, the method comprising:

acquiring the GBDT model including a sequence of trees beginning with an initial tree and ending with a last tree,

a given one of the sequence of trees having been stochastically built during a training iteration of the GBDT model based on a sequence of prior trees available at the training iteration;

defining a plurality of sub-sequences of trees in the sequence of trees as sub-models of the GBDT model,

a given one of the plurality of sub-sequences of trees beginning with the initial tree and ending with a respective offset tree in the sequence of trees between the initial tree and the last tree, the respective offset tree being offset from the initial tree by an offset parameter, the offset parameter being different for each of the plurality of sub-sequences of trees;

during a given in-use iteration of the GBDT model executable for the in-use dataset:

generating a plurality of sub-outputs using the respective sub-models by inputting the in-use dataset to the respective sub-models,

wherein the in-use dataset is received from at least one of: an image sensor, a charge-coupled device (CCD) sensor, complementary metal oxide semiconductor sensor (CMOS), a digital camera, a light detection and ranging (LiDAR) sensor, a radar sensor, a time of flight (TOF) 3D camera, a stereo vision sensor or a 3D sonar associated with the self-driving vehicle,

a given one of the plurality of sub-outputs being generated by a respective one of the plurality of sub-sequences of trees;

generating the uncertainty score using the plurality of sub-outputs, the uncertainty score being indicative of how different sub-outputs from the plurality of sub-outputs are amongst each other;

in response to the uncertainty score being below a pre-determined threshold, providing the output of the GBDT model and the uncertainty score to an Object Detection Neural Network (ODNN) algorithm of the self-driving vehicle, the ODNN being configured for classifying objects in a surrounding of the self-driving vehicle based on the output of the GBDT model and the uncertainty score; and

controlling the self-driving vehicle based on the output of the ODNN.

2 . The method of claim 1 , wherein the method further comprises, during the given in-use iteration:

generating the output for the in-use dataset using the sequence of trees, the output being generated using all trees from the sequence of trees.

3 . The method of claim 1 , wherein a first one from the plurality of sub-sequences of trees is nested in a second one from the plurality of sub-sequences of trees.

4 . The method of claim 1 , wherein a first one from the plurality of sub-sequences of trees includes a total number of trees that is different from a total number of trees included in a second one from the plurality of sub-sequences of trees.

5 . The method of claim 1 , wherein a first one from the plurality of sub-sequences of trees and a second one from the plurality of sub-sequences of trees comprise a sub-set of same trees and a sub-set of differing trees.

6 . The method of claim 1 , wherein a first one from the plurality of sub-sequences of trees includes a second one from the plurality of sub-sequences of trees and at least one next tree from the sequence of trees.

7 . The method of claim 1 , wherein the given one from the plurality of sub-sequences of trees excludes the last tree in the sequence of trees.

8 . The method of claim 1 , wherein the GBDT model has been trained to classify the in-use dataset and the output is indicative of a predicted class of the in-use dataset.

9 . The method of claim 1 , wherein the GBDT model has been trained to perform regression on the in-use dataset and the output being a continuous value predicted for the in-use dataset.

10 . The method of claim 1 , wherein generating, the uncertainty score using the plurality of sub-outputs comprises determining a variance of the plurality of sub-outputs.

11 . A method of generating an uncertainty score for an output of a Gradient Boosted Decision Tree (GBDT) model for a self-driving vehicle, the output being a prediction of the GBDT model for an in-use dataset, the method executable by a server, the method comprising:

acquiring the GBDT model including a sequence of trees, a given one from the sequence of trees having been stochastically built during a training iteration of the GBDT model based on a sequence of trees available at the training iteration;

during a given in-use iteration of the GBDT model executable for the in-use dataset:

generating using the sequence of trees, a plurality of tree-outputs for the in-use dataset, a given one from the plurality of tree-outputs generated by a respective one from the sequence of trees, wherein the in-use dataset is received from at least one of: an image sensor, a charge-coupled device (CCD) sensor, complementary metal oxide semiconductor sensor (CMOS), a digital camera, a light detection and ranging (LiDAR) sensor, a radar sensor, a time of flight (TOF) 3D camera, a stereo vision sensor or a 3D sonar associated with the self-driving vehicle;

for a first sub-sequence of trees in the sequence of trees, generating in response to receiving the in-use dataset, a first sub-output by combining tree-outputs from the first sub-sequence of trees beginning with an initial tree, the first sub-sequence of trees including M number of sequential trees from the sequence of trees;

for a second sub-sequence of trees in the sequence of trees,

generating in response to receiving the in-use dataset, a second sub-output by combining tree-outputs from the second sub-sequence of trees beginning with the initial tree, the second sub-sequence of trees including N number of sequential trees from the sequence of trees, the N number being different from the M number; and

generating the uncertainty score using the first and the second sub-outputs, the uncertainty score being indicative of how different the first sub-output is from the second sub-output;

in response to the uncertainty score being below a pre-determined threshold, providing the output of the GBDT model and the uncertainty score to an Object Detection Neural Network (ODNN) algorithm of the self-driving vehicle, the ODNN being configured for classifying objects in a surrounding of the self-driving vehicle based on the output of the GBDT model and the uncertainty score; and

controlling the self-driving vehicle based on the output of the ODNN.

12 . The method of claim 11 , wherein the method further comprises:

generating the output for the GBDT model by combining all tree-outputs in the plurality of tree-outputs.

13 . The method of claim 11 , wherein the first sub-sequence of trees and the second sub-sequence of trees form a virtual ensemble in the sequence of trees.

14 . A server for generating an uncertainty score for an output of a Gradient Boosted Decision Tree (GBDT) model for a self-driving vehicle, the output being a prediction of the GBDT model for an in-use dataset, the server comprising at least one processor and a memory configured to store instructions which, upon being executed by the at least one processor, cause the server to:

acquire the GBDT model including a sequence of trees beginning with an initial tree and ending with a last tree,

a given one of the sequence of trees having been stochastically built during a training iteration of the GBDT model based on a sequence of prior trees available at the training iteration;

define a plurality of sub-sequences of trees in the sequence of trees as sub-models of the GBDT model,

a given one of the plurality of sub-sequences of trees beginning with the initial tree and ending with a respective offset tree in the sequence of trees between the initial tree and the last tree, the respective offset tree being offset from the initial tree by an offset parameter, the offset parameter being different for each of the plurality of sub-sequences of trees;

during a given in-use iteration of the GBDT model executable for the in-use dataset:

generate a plurality of sub-outputs using the respective sub-models by inputting the in-use dataset to the respective sub-models,

wherein the in-use dataset is received from at least one of: an image sensor, a charge-coupled device (CCD) sensor, complementary metal oxide semiconductor sensor (CMOS), a digital camera, a light detection and ranging (LiDAR) sensor, a radar sensor, a time of flight (TOF) 3D camera, a stereo vision sensor or a 3D sonar associated with the self-driving vehicle,

a given one of the plurality of sub-outputs being generated by a respective one of the plurality of sub-sequences of trees;

generate the uncertainty score using the plurality of sub-outputs, the uncertainty score being indicative of how different sub-outputs from the plurality of sub-outputs are amongst each other;

in response to the uncertainty score being below a pre-determined threshold, provide the output of the GBDT model and the uncertainty score to an Object Detection Neural Network (ODNN) algorithm of the self-driving vehicle, the ODNN being configured for classifying objects in a surrounding of the self-driving vehicle based on the output of the GBDT model and the uncertainty score; and

control the self-driving vehicle based on the output of the ODNN.

15 . The server of claim 14 , wherein the server is further configured to, during the given in-use iteration:

generate the output for the in-use dataset using the sequence of trees, the output being generated using all trees from the sequence of trees.

16 . The server of claim 14 , wherein a first one from the plurality of sub-sequences of trees is nested in a second one from the plurality of sub-sequences of trees.

17 . The server of claim 14 , wherein a first one from the plurality of sub-sequences of trees includes a total number of trees that is different from a total number of trees included in a second one from the plurality of sub-sequences of trees.

18 . The server of claim 14 , wherein a first one from the plurality of sub-sequences of trees and a second one from the plurality of sub-sequences of trees comprise a sub-set of same trees and a sub-set of differing trees.

19 . The server of claim 14 , wherein a first one from the plurality of sub-sequences of trees includes a second one from the plurality of sub-sequences of trees and at least one next tree from the sequence of trees.

20 . The server of claim 14 , wherein the given one from the plurality of sub-sequences of trees excludes the last tree in the sequence of trees.

21 . The server of claim 14 , wherein the GBDT model has been trained to classify the in-use dataset and the output is indicative of a predicted class of the in-use dataset.

22 . The server of claim 14 , wherein the GBDT model has been trained to perform regression on the in-use dataset and the output being a continuous value predicted for the in-use dataset.

23 . The server of claim 14 , further configured to determine a variance of the plurality of sub-outputs to generate the uncertainty score using the plurality of sub-outputs.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 9, 2024
From: DIRECT CURSUS TECHNOLOGY L.L.C
To: Y.E. HUB ARMENIA LLC
Reel/Frame 068534/0687 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 15, 2023
From: YANDEX EUROPE AG
To: DIRECT CURSUS TECHNOLOGY L.L.C
Reel/Frame 065692/0720 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2023
From: YANDEX.TECHNOLOGIES LLC
To: YANDEX LLC
Reel/Frame 064320/0116 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2023
From: YANDEX LLC
To: YANDEX EUROPE AG
Reel/Frame 064320/0119 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 17, 2023
From: PROKHORENKOVA, LYUDMILA ALEKSANDROVNA; USTIMENKO, ALEKSEY IVANOVICH; MALININ, ANDREY ALEKSEEVICH
To: YANDEX.TECHNOLOGIES LLC
Reel/Frame 064283/0024 →
Continuity (1)
Related Publication 20220405615A1 · Dec 22, 2022
References Cited (58)
US 6725208B1 · Hartman et al. · 2004 [cited by applicant]
US 7313550B2 · Kulkarni et al. · 2007 [cited by applicant]
US 7472096B2 · Burges et al. · 2008 [cited by applicant]
US 7558764B2 · Abe et al. · 2009 [cited by applicant]
US 8275721B2 · Abe et al. · 2012 [cited by applicant]
US 10510002B1 · Olabiyi et al. · 2019 [cited by applicant]
US 10510003B1 · Olabiyi et al. · 2019 [cited by applicant]
US 10963814B2 · Gupta et al. · 2021 [cited by applicant]
US 20060195440A1 · Burges et al. · 2006 [cited by applicant]
US 20070094171A1 · Burges et al. · 2007 [cited by applicant]
US 20090006360A1 · Liao et al. · 2009 [cited by applicant]
US 20170097936A1 · Glover · 2017 [cited by applicant]
US 20170293859A1 · Gusev et al. · 2017 [cited by applicant]
US 20170364810A1 · Gusev et al. · 2017 [cited by applicant]
US 20180121730A1 · Li · 2018 [cited by applicant]
US 20180225291A1 · Balinsky et al. · 2018 [cited by applicant]
US 20180340787A1 · Sheth · 2018 [cited by examiner]
US 20190171912A1 · Vallespi-Gonzalez · 2019 [cited by examiner]
US 20190212977A1 · Sicurelli, III et al. · 2019 [cited by applicant]
US 20190258878A1 · Koivisto · 2019 [cited by examiner]
US 20190303795A1 · Khiari et al. · 2019 [cited by applicant]
US 20200401149A1 · Gong · 2020 [cited by examiner]
US 20210034865A1 · Nord · 2021 [cited by examiner]
US 20210201112A1 · Gauthier Melançon · 2021 [cited by examiner]
US 20210374553A1 · Li et al. · 2021 [cited by applicant]
RU 2632143C1 · 2017 [cited by applicant]
WO 03081527A1 · 2003 [cited by applicant]
Valdenegro-Toro, “Deep Sub-Ensembles for Fast Uncertainty Estimation in Image Classification,” 2019, arXiv:1910.08168v2 (Year: 2019). [cited by examiner]
Wickstrom et al., “Uncertainty-Aware Deep Ensembles for Reliable and Explainable Predictions of Clinical Time Series,” Oct. 2020, arXiv:2010.11310v1 (Year: 2020). [cited by examiner]
Zeldes, “Using Uncertainty to Interpret your Model,” 2018, https://www.datasciencecentral.com/using-uncertainty-to-interpret-your-model/ (Year: 2018). [cited by examiner]
“Feature Importance and Feature Selection With XGBoost in Python,” 2020, https://machinelearningmastery.com/feature-importance-and-feature-selection-with-xgboost-in-python (Year: 2020). [cited by examiner]
Office Action issued on Jun. 17, 2024 in respect of the related U.S. Appl. No. 17/207,403. [cited by applicant]
Ustimenko et al., “SGLB: Stochastic Gradient Langevin Boosting”, Yandex.Research, Moscow, Russia, Computer Science > Machine Learning, Mar. 2020, https://arxiv.org/abs/2001.07248v2, 10 pages. [cited by applicant]
Friedman, “Stochastic Gradient Boosting”, Mar. 1999, pp. 1-10. [cited by applicant]
“CatBoost is a high-performance open source library for gradient boosting on decision trees”, https://catboost.ai accessed on Jan. 26, 2021, pdf 5 pages. [cited by applicant]
Chen et al., “Accelerating Nonconvex Learning via Replica Exchange Langevin Diffusion”, Published as a conference paper at ICLR May 2019, pp. 1-23. [cited by applicant]
Ge et al., “Escaping From Saddle Points—Online Stochastic Gradient for Tensor Decomposition”, Computer Science >Machine Learning, Mar. 2015, https://arxiv.org/abs/1503.02101v1, pp. 1-46. [cited by applicant]
Xu et al., “Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization”, Statistics > Machine Learning, Feb. 2018, https://arxiv.org/abs/1707.06618, pp. 1-36. [cited by applicant]
Welling et al., “Bayesian Learning via Stochastic Gradient Langevin Dynamics”, Proceedings of the 28 th International Conference on Machine Learning, USA, Jun.-Jul. 2011, pp. 1-8. [cited by applicant]
Ahn, “Bayesian Posterior Sampling via Stochastic Gradient Fisher Scoring”, Proceedings of the 29 th International Conference on Machine Learning, UK, Jul. 2012, pp. 1-8. [cited by applicant]
Kamalaruban et al., “Reinforcement Learning with Langevin Dynamics”, Optimization Foundations for Reinforcement Learning Workshop at NeurIPS, Vancouver, Dec. 2019, 8 pages. [cited by applicant]
Zhang et al., “A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics”, arXiv:1702.05575v3, Apr. 2018, pp. 1-44. [cited by applicant]
Patterson et al., “Stochastic Gradient Riemannian Langevin Dynamics on the Probability Simplex”, Advances in Neural Information Processing Systems, Dec. 2013, pp. 1-9. [cited by applicant]
Mou et al., “Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints”, Computer Science > Machine Learning, 2017, aarXiv.org > cs > arXiv:1707.05947, Jul. 20, 2017, pp. 1-29. [cited by applicant]
Zou et al., “Subsampled Stochastic Variance-Reduced Gradient Langevin Dynamics”, Mathematics, Computer Science, 2018, 11 pages. Published in UAI Aug. 6-10, 2018. [cited by applicant]
Wang, “Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm”, Journal of Computational and Graphical Statistics, Jan. 2018, pp. 1-41. [cited by applicant]
Wang et al., “Gradient Boosting”, MachineLearning, May 1, 2020, pp. 1-30. [cited by applicant]
Liu et al., “Stochastic Non-convex Optimization with Strong High Probability Second-order Convergence”, Nov. 2017; Mathematics > Optimization and Control, arXiv:1710.09447v2, 2017, pp. 1-8. [cited by applicant]
Raginsky et al., “Non-Convex Learning via Stochastic Gradient Langevin Dynamics: A Nonasymptotic Analysis”, arXiv:1702.03849v3 [cs.LG], 2017, 30 pages. Published Jun. 4, 2017. [cited by applicant]
Sukhbaatar et al., “Training Convolutional Networks with Noisy Labels”, ICLR 2015, arXiv, Apr. 2015, pp. 1-11. [cited by applicant]
Agarwal et al., “Counterfactual Learning-to-Rank for Additive Metrics and Deep Models”, https://www.cs.cornell.edu/people/tj/publications/agarwal_etal_18b.pdf, 10 pages. Published 2018. [cited by applicant]
Sukhbaatar et al., “Learning from Noisy Labels with Deep Neural Networks”, Computer Science, Artificial Intelligence, Evolutionary Computing, arXiv, Jun. 2014, pp. 1-10. [cited by applicant]
Viegas da Silva et al., “PCA and Gaussian noise in MLP neural network training improve generalization in problems with small and unbalanced data sets”, The 2011 International Joint Conference on Neural Networks, USA, Ju… [cited by applicant]
Bruch et al., “A Stochastic Treatment of Learning to Rank Scoring Functions”, Published on Jan. 22, 2020, pp. 61-69, https://doi.org/10.1145/3336191.3371844. [cited by applicant]
Gulin et al., “Winning The Transfer Learning Track of Yahoo!'s Learning to Rank Challenge with YetiRank”, JMLR: Workshop and Conference Proceedings:14 (2011), pp. 63-76, Yahoo! Learning to Rank Challenge. [cited by applicant]
Office Action issued on Aug. 28, 2024 in respect of the related U.S. Appl. No. 17/223,680. [cited by applicant]
Notice of Allowance dated Oct. 15, 2024 received in respect of a related U.S. Appl. No. 17/207,403. [cited by applicant]
Russian Search Report dated Jul. 14, 2022 issued in respect of the counterpart Russian Patent Application No. RU 2020113384. [cited by applicant]