IP Library › Granted Patent US 12,585,970
Granted Patent B1
US 12,585,970 · App. 17/534,175 · Granted Mar 24, 2026

Systems and methods of implementing scorecards and boosted decision trees

Inventors: Honghao Shan (San Diego, CA); Liang Lin (San Diego, CA); Chi Zhang (San Diego, CA); Keming Cao (San Diego, CA); Zhe An (San Diego, CA); Shanji Xiong (Rancho Santa Fe, CA)
Assignee: Experian Information Solutions, Inc.
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,585,970
App. No.
17/534,175
Granted
Mar 24, 2026
Kind
B1
Abstract

Systems and methods are described for machine learning-based generation of scorecards and boosted decision trees that facilitate explainable predictions. A scorecard machine learning model may be applied to historical records such that the model, for each of a number of variables, automatically generates (a) normal bins for normal values of the variable that fall within a valid range of values and (b) at least one special bin for special values of the variable that fall outside the valid range of values. Adjacent bins of the normal bins may be separated by a threshold value and each normal bin and each special bin may have an assigned score value. A risk assessment score may be generated based at least in part on the model identifying the assigned value score for each of the variables based on the normal or special bin to which each variable is assigned.

Claims (57)

1 . A system for generating risk assessment scores, the system comprising:

a data store including historical records regarding each of a number of individuals; and

at least one physical processor programmed by instructions in a memory to:

receive, from a user system, a request for a risk assessment score for an individual;

based on parsing the received request, identify an identifier for the individual;

based on the identifier, obtain, from the data store, one or more historical records for the individual;

based on the received request, select a corresponding machine learning (ML) model, the selected ML model configured to manage a plurality of variables for use in generating the risk assessment score, wherein at least a subset of the plurality of variables are associated with information in the one or more historical records for the individual;

apply the selected ML model to the one or more historical records, wherein the selected ML model is trained using a gradient boosted decision tree comprising one-split stumps, one or more of the one-split stumps being constrained by monotonicity rules so that the selected ML model produces a transparent and interpretable scorecard representation, wherein the selected ML model is a scorecard ML model that, for each of the variables of the plurality of variables, automatically generates:

(a) normal bins for normal values of a variable of the variables that fall within a valid range of values for the variable; and

(b) at least one special bin for special values of the variable that fall outside the valid range of values for the variable, wherein adjacent bins of the normal bins are separated by a threshold value and each normal bin and each special bin have an assigned score value;

based on the selected ML model, generate the risk assessment score for the individual, wherein the selected ML model generates the risk assessment score based at least in part on identifying the assigned value score for each of the plurality of variables based on the normal or special bin to which each individual variable of the plurality of variables is assigned;

generate an output comprising the risk assessment score; and

cause transmission, to the user system, of the output.

2 . The system of claim 1 , wherein the risk assessment score represents a quantitative estimate of a probability that the individual will display a defined behavior as determined by the scorecard ML model based on identification of the normal or special bin to which each individual variable of the plurality of variables is assigned.

3 . The system of claim 1 , wherein the monotonicity rules are applied on the normal bins but not on the at least one special bin, where the monotonicity rules limit to one of non-increasing or non-decreasing changes in weights for each adjacent subsequent bin of the normal bins.

4 . The system of claim 3 , wherein the instructions further cause the physical processor to:

determine an explanation for the generated risk assessment score, wherein the explanation is determined based at least in part on identification of at least one of the normal bins to which an individual variable is assigned in view of the monotonicity rules, wherein the output further comprises the explanation for the generated risk assessment score.

5 . The system of claim 1 , wherein the instructions further cause the physical processor to implement binarsity regularization that causes the scorecard ML model to penalize a difference in weights associated with at least one pair of adjacent normal bins.

6 . The system of claim 5 , wherein the scorecard ML model combines two or more neighboring bins based at least in part on the binarsity regularization.

7 . The system of claim 1 , wherein automatically generating the normal bins comprises applying one of equal-sized binning or quantile-based binning within the valid range of values for the variable.

8 . The system of claim 1 , wherein the instructions further cause the physical processor to implement a U-shaped constraint for at least one variable, wherein implementing the U-shaped constraint comprises the scorecard ML model splitting the at least one variable into two virtual variables or sub-variables that are separately analyzed by the scorecard ML model.

9 . The system of claim 1 , wherein the processor is further configured to, prior to causing transmission:

generate, together with the risk assessment score, an explanation identifying the variables and bins that contributed to the score; and

update the output to include the explanation.

10 . A computer-implemented method for optimizing binning in a scorecard machine learning (ML) model, the computer-implemented method comprising:

receiving, from a user system, a request for a risk assessment score for an individual;

based on parsing the received request, identifying an identifier for the individual;

based on the identifier, obtaining, from a networked data store, one or more historical records for the individual;

identifying, for a first ML model to be applied to generate the risk assessment score, a variable for which a plurality of bins are to be generated, the variable having a valid range within which normal bins of the plurality of bins are defined and outside of which at least one special bin of the plurality of bins is defined;

applying a second ML model to the variable based on generating at least one split value for the valid range, wherein generating each of the at least one split value comprises generating a single level decision tree for the split value and enforcing monotonicity with respect to the generated single level decision for each of the at least one split value in the valid range;

generating the normal bins for the valid range based at least in part on the generated at least one split value;

applying a binarsity regularization term that penalizes large differences in weights between adjacent bins, so that bins with substantially similar weights are merged together to improve stability of the scorecard ML model;

generating the at least one special bin to include one or more special values of the variable;

generating the risk assessment score based on applying the first ML model to the one or more historical records using the generated normal bins and the generated at least one special bin;

generating an output comprising the generated risk assessment score; and

cause transmission, to the user system, of the output.

11 . The computer-implemented method of claim 10 , wherein the single level decision tree comprises a one-split tree with only two leaf nodes.

12 . The computer-implemented method of claim 10 , wherein the second ML model is trained at least in part by utilizing a gradient boosting decision tree algorithm employing stumps.

13 . The computer-implemented method of claim 12 , wherein the second ML model enforces monotonicity constraints on the stumps, wherein enforcing the monotonicity constraints on the stumps comprises ignoring candidate splits on which a monotonicity constraint is violated.

14 . The computer-implemented method of claim 10 further comprising treating multiple special values as a categorical variable.

15 . The computer-implemented method of claim 14 further comprising enabling a plurality of special values falling within the categorical variable to be placed on either a left side or right side of a split point in a tree.

16 . A computer-implemented method for generating risk assessment scores, the computer-implemented method comprising:

receiving, from a user system, a request for a risk assessment score for an individual;

based on parsing the received request, identifying an identifier for the individual;

based on the identifier, obtaining one or more historical records for the individual;

selecting a corresponding machine learning (ML) model, the selected ML model configured to manage a plurality of variables for use in generating the risk assessment score, wherein at least a subset of the plurality of variables are associated with information in the one or more historical records for the individual;

applying the selected ML model to the one or more historical records, wherein the selected ML model is a scorecard ML model trained using a gradient boosted decision tree built from one-split stumps, one or more of the one-split stumps being constrained by monotonicity rules so that the selected ML model produces a transparent and interpretable scorecard representation, wherein the scorecard ML model that, for each of the variables of the plurality of variables, automatically generates:

(a) normal bins for normal values of a variable of the variables that fall within a valid range of values for the variable; and

(b) at least one special bin for special values of the variable that fall outside the valid range of values for the variable, wherein adjacent bins of the normal bins are separated by a threshold value and each normal bin and each special bin have an assigned score value;

generating the risk assessment score for the individual based on the selected ML model, wherein the selected ML model generates the risk assessment score based at least in part on identifying the assigned value score for each of the plurality of variables based on the normal or special bin to which each individual variable of the plurality of variables is assigned;

generating an output comprising the risk assessment score; and

causing transmission, to the user system, of the output.

17 . The computer-implemented method of claim 16 , wherein the monotonicity rules are applied on the normal bins but not on the at least one special bin, where the monotonicity rules limit to one of non-increasing or non-decreasing changes in weights for each adjacent subsequent bin.

18 . The computer-implemented method of claim 16 further comprising:

determining an explanation for the generated risk assessment score, wherein the explanation is determined based at least in part on identification of at least one of the normal bins to which an individual variable is assigned in view of the monotonicity rules, wherein the output further comprises the explanation for the generated risk assessment score.

19 . The computer-implemented method of claim 16 , wherein generating the normal bins comprises applying one of equal-sized binning or quantile-based binning within the valid range of values for the variable.

20 . The computer-implemented method of claim 16 further comprising implementing a U-shaped constraint for at least one variable, wherein implementing the U-shaped constraint comprises the scorecard ML model splitting the at least one variable into two virtual variables or sub-variables that are separately analyzed by the scorecard ML model.

Continuity (1)
Provisional Application 63117940 · Nov 24, 2020
References Cited (362)
US 5398300A · Levey · 1995 [cited by applicant]
US 5504675A · Cragun et al. · 1996 [cited by applicant]
US 5696907A · Tom · 1997 [cited by applicant]
US 5745654A · Titan · 1998 [cited by applicant]
US 5774868A · Cragun et al. · 1998 [cited by applicant]
US 5819226A · Gopinathan et al. · 1998 [cited by applicant]
US 5870721A · Norris · 1999 [cited by applicant]
US 5875108A · Hoffberg et al. · 1999 [cited by applicant]
US 5912839A · Ovshinsky et al. · 1999 [cited by applicant]
US 6029139A · Cunningham et al. · 2000 [cited by applicant]
US 6115693A · McDonough et al. · 2000 [cited by applicant]
US 6119103A · Basch et al. · 2000 [cited by applicant]
US 6236977B1 · Verba · 2001 [cited by applicant]
US 6330546B1 · Gopinathan et al. · 2001 [cited by applicant]
US 6366897B1 · Means et al. · 2002 [cited by applicant]
US 6393406B1 · Eder · 2002 [cited by applicant]
US 6424956B1 · Werbos · 2002 [cited by applicant]
US 6430539B1 · Lazarus et al. · 2002 [cited by applicant]
US 6513018B1 · Culhane · 2003 [cited by applicant]
US 6597775B2 · Lawyer et al. · 2003 [cited by applicant]
US 6640215B1 · Galperin et al. · 2003 [cited by applicant]
US 6654727B2 · Tilton · 2003 [cited by applicant]
US 6658393B1 · Basch et al. · 2003 [cited by applicant]
US 6804346B1 · Mewhinney · 2004 [cited by applicant]
US 6839682B1 · Blume et al. · 2005 [cited by applicant]
US 6850606B2 · Lawyer et al. · 2005 [cited by applicant]
US 6873979B2 · Fishman et al. · 2005 [cited by applicant]
US 7054828B2 · Heching et al. · 2006 [cited by applicant]
US 7165037B2 · Lazarus et al. · 2007 [cited by applicant]
US 7191150B1 · Shao et al. · 2007 [cited by applicant]
US 7249048B1 · O'Flaherty · 2007 [cited by applicant]
US 7376618B1 · Anderson et al. · 2008 [cited by applicant]
US 7392216B1 · Palmgren et al. · 2008 [cited by applicant]
US 7536348B2 · Shao et al. · 2009 [cited by applicant]
US 7672865B2 · Kumar et al. · 2010 [cited by applicant]
US 7702576B2 · Fahner et al. · 2010 [cited by applicant]
US 7707059B2 · Reed et al. · 2010 [cited by applicant]
US 7725300B2 · Pinto et al. · 2010 [cited by applicant]
US 7774272B2 · Fahner et al. · 2010 [cited by applicant]
US 7788195B1 · Subramanian et al. · 2010 [cited by applicant]
US 7792732B2 · Haggerty et al. · 2010 [cited by applicant]
US 7813944B1 · Luk et al. · 2010 [cited by applicant]
US 7813981B2 · Fahner et al. · 2010 [cited by applicant]
US 7836111B1 · Shan · 2010 [cited by applicant]
US 7844534B2 · Haggerty et al. · 2010 [cited by applicant]
US 7853541B1 · Kapadia et al. · 2010 [cited by applicant]
US 7970676B2 · Feinstein · 2011 [cited by applicant]
US 7991677B2 · Haggerty et al. · 2011 [cited by applicant]
US 7991689B1 · Brunzell et al. · 2011 [cited by applicant]
US 8027894B2 · Feinstein et al. · 2011 [cited by applicant]
US 8065234B2 · Liao et al. · 2011 [cited by applicant]
US 8078569B2 · Kennel · 2011 [cited by applicant]
US 8099356B2 · Feinstein et al. · 2012 [cited by applicant]
US 8131614B2 · Haggerty et al. · 2012 [cited by applicant]
US 8175945B2 · Haggerty et al. · 2012 [cited by applicant]
US 8200595B1 · De Zilwa et al. · 2012 [cited by applicant]
US 8352343B2 · Haggerty et al. · 2013 [cited by applicant]
US 8364518B1 · Blake et al. · 2013 [cited by applicant]
US 8401950B2 · Lyons et al. · 2013 [cited by applicant]
US 8423488B2 · Surpi · 2013 [cited by applicant]
US 8458074B2 · Showalter · 2013 [cited by applicant]
US 8676726B2 · Hore et al. · 2014 [cited by applicant]
US 8694427B2 · Maddipati et al. · 2014 [cited by applicant]
US 8775291B1 · Mellman et al. · 2014 [cited by applicant]
US 8788437B2 · Prieditis · 2014 [cited by applicant]
US 8805737B1 · Chen et al. · 2014 [cited by applicant]
US 8984022B1 · Crawford et al. · 2015 [cited by applicant]
US 9037694B2 · Winkler · 2015 [cited by applicant]
US 9280750B2 · Prieditis · 2016 [cited by applicant]
US 9390379B2 · Prieditis · 2016 [cited by applicant]
US 9483727B2 · Zhao et al. · 2016 [cited by applicant]
US 9660869B2 · Ripley et al. · 2017 [cited by applicant]
US 9697476B1 · Prieditis · 2017 [cited by applicant]
US 9779187B1 · Gao et al. · 2017 [cited by applicant]
US 9838301B2 · Prieditis · 2017 [cited by applicant]
US 9855792B2 · Delayre et al. · 2018 [cited by applicant]
US 10083263B2 · Gao et al. · 2018 [cited by applicant]
US 10097647B2 · Prieditis · 2018 [cited by applicant]
US 10133980B2 · Turner et al. · 2018 [cited by applicant]
US 10152736B2 · Yang et al. · 2018 [cited by applicant]
US 10178111B1 · Wilson et al. · 2019 [cited by applicant]
US 10242019B1 · Shan et al. · 2019 [cited by applicant]
US 10366342B2 · Zhao et al. · 2019 [cited by applicant]
US 10373061B2 · Kennel et al. · 2019 [cited by applicant]
US 10402723B1 · Silberman et al. · 2019 [cited by applicant]
US 10474566B2 · Indurthivenkata et al. · 2019 [cited by applicant]
US 10535009B2 · Turner et al. · 2020 [cited by applicant]
US 10558913B1 · Turner et al. · 2020 [cited by applicant]
US 10643154B2 · Litherland et al. · 2020 [cited by applicant]
US 10810463B2 · Min et al. · 2020 [cited by applicant]
US 10942842B2 · Indurthivenkata et al. · 2021 [cited by applicant]
US 10956940B2 · Rahman et al. · 2021 [cited by applicant]
US 10963791B2 · Turner et al. · 2021 [cited by applicant]
US 10963817B2 · Jordan et al. · 2021 [cited by applicant]
US 10970431B2 · Chang et al. · 2021 [cited by applicant]
US 10977556B2 · Turner et al. · 2021 [cited by applicant]
US 10997511B2 · Turner et al. · 2021 [cited by applicant]
US 11003947B2 · Zoldi et al. · 2021 [cited by applicant]
US 11010669B2 · Turner et al. · 2021 [cited by applicant]
US 11042551B2 · Fahner et al. · 2021 [cited by applicant]
US 11049012B2 · Zoldi et al. · 2021 [cited by applicant]
US 11049019B2 · Jordan et al. · 2021 [cited by applicant]
US 11055071B2 · Oburu et al. · 2021 [cited by applicant]
US 11100392B2 · Zhao et al. · 2021 [cited by applicant]
US 11100506B2 · Zoldi et al. · 2021 [cited by applicant]
US 11144834B2 · Zoldi et al. · 2021 [cited by applicant]
US 11151450B2 · Zoldi et al. · 2021 [cited by applicant]
US 11206246B2 · Krishnamacharya · 2021 [cited by applicant]
US 11341449B2 · Krone et al. · 2022 [cited by applicant]
US 11373109B2 · Zoldi et al. · 2022 [cited by applicant]
US 11436241B2 · Kunjur · 2022 [cited by applicant]
US 11461383B2 · Xie et al. · 2022 [cited by applicant]
US 11468260B2 · Zoldi et al. · 2022 [cited by applicant]
US 11468315B2 · Turner et al. · 2022 [cited by applicant]
US 11475235B2 · Bondugula et al. · 2022 [cited by applicant]
US 11494294B2 · Indurthivenkata et al. · 2022 [cited by applicant]
US 11521020B2 · Liu et al. · 2022 [cited by applicant]
US 11568187B2 · Huang et al. · 2023 [cited by applicant]
US 11568286B2 · Nourian et al. · 2023 [cited by applicant]
US 11645581B2 · Nourian et al. · 2023 [cited by applicant]
US 11663658B1 · Zoldi et al. · 2023 [cited by applicant]
US 11682019B2 · Zhang et al. · 2023 [cited by applicant]
US 11687804B2 · Zoldi et al. · 2023 [cited by applicant]
US 11693634B2 · Oburu et al. · 2023 [cited by applicant]
US 11709918B2 · Zoldi et al. · 2023 [cited by applicant]
US 11715029B2 · Ouyang et al. · 2023 [cited by applicant]
US 11734591B2 · Turner et al. · 2023 [cited by applicant]
US 11748416B2 · Hicklin et al. · 2023 [cited by applicant]
US 11804302B2 · Fahner et al. · 2023 [cited by applicant]
US 11818147B2 · Zoldi et al. · 2023 [cited by applicant]
US 11868891B2 · Turner et al. · 2024 [cited by applicant]
US 11875232B2 · Kennel et al. · 2024 [cited by applicant]
US 11875239B2 · Huang et al. · 2024 [cited by applicant]
US 11886512B2 · Ralph et al. · 2024 [cited by applicant]
US 20020147695A1 · Khedkar et al. · 2002 [cited by applicant]
US 20020161664A1 · Shaya et al. · 2002 [cited by applicant]
US 20030009368A1 · Kitts · 2003 [cited by applicant]
US 20030115133A1 · Bian · 2003 [cited by applicant]
US 20040034570A1 · Davis et al. · 2004 [cited by applicant]
US 20040044615A1 · Xue et al. · 2004 [cited by applicant]
US 20040153330A1 · Miller et al. · 2004 [cited by applicant]
US 20050033734A1 · Chess et al. · 2005 [cited by applicant]
US 20050159996A1 · Lazaraus et al. · 2005 [cited by applicant]
US 20050197954A1 · Maitland et al. · 2005 [cited by applicant]
US 20050262014A1 · Fickes · 2005 [cited by applicant]
US 20060041464A1 · Powers et al. · 2006 [cited by applicant]
US 20060129428A1 · Wennberg · 2006 [cited by applicant]
US 20060212350A1 · Ellis et al. · 2006 [cited by applicant]
US 20060277102A1 · Agliozzo · 2006 [cited by applicant]
US 20060282359A1 · Nobili et al. · 2006 [cited by applicant]
US 20070067208A1 · Haggerty et al. · 2007 [cited by applicant]
US 20070112667A1 · Rucker · 2007 [cited by applicant]
US 20070208653A1 · Murphy · 2007 [cited by applicant]
US 20070226114A1 · Haggerty et al. · 2007 [cited by applicant]
US 20070294163A1 · Harmon et al. · 2007 [cited by applicant]
US 20080005313A1 · Flake et al. · 2008 [cited by applicant]
US 20080028067A1 · Berkhin et al. · 2008 [cited by applicant]
US 20080097768A1 · Godshalk · 2008 [cited by applicant]
US 20080140549A1 · Eder · 2008 [cited by applicant]
US 20080208548A1 · Metzger et al. · 2008 [cited by applicant]
US 20080208788A1 · Merugu et al. · 2008 [cited by applicant]
US 20080221973A1 · Megdal et al. · 2008 [cited by applicant]
US 20080228540A1 · Megdal et al. · 2008 [cited by applicant]
US 20080294540A1 · Celka et al. · 2008 [cited by applicant]
US 20090037323A1 · Feinstein et al. · 2009 [cited by applicant]
US 20090222308A1 · Zoldi et al. · 2009 [cited by applicant]
US 20090248567A1 · Haggerty et al. · 2009 [cited by applicant]
US 20090248568A1 · Haggerty et al. · 2009 [cited by applicant]
US 20090248569A1 · Haggerty et al. · 2009 [cited by applicant]
US 20090248570A1 · Haggerty et al. · 2009 [cited by applicant]
US 20090248571A1 · Haggerty et al. · 2009 [cited by applicant]
US 20090248572A1 · Haggerty et al. · 2009 [cited by applicant]
US 20090248573A1 · Haggerty et al. · 2009 [cited by applicant]
US 20100169264A1 · O'Sullivan · 2010 [cited by applicant]
US 20100274739A1 · Haggerty et al. · 2010 [cited by applicant]
US 20110035333A1 · Haggerty et al. · 2011 [cited by applicant]
US 20110078073A1 · Annappindi et al. · 2011 [cited by applicant]
US 20110093383A1 · Haggerty et al. · 2011 [cited by applicant]
US 20110112958A1 · Haggerty et al. · 2011 [cited by applicant]
US 20110258142A1 · Haggerty et al. · 2011 [cited by applicant]
US 20110264581A1 · Clyne · 2011 [cited by applicant]
US 20110270779A1 · Showalter · 2011 [cited by applicant]
US 20120035980A1 · Haggerty et al. · 2012 [cited by applicant]
US 20120084230A1 · Megdal et al. · 2012 [cited by applicant]
US 20120123968A1 · Megdal et al. · 2012 [cited by applicant]
US 20130204755A1 · Zoldi et al. · 2013 [cited by applicant]
US 20130268324A1 · Megdal et al. · 2013 [cited by applicant]
US 20140012633A1 · Megdal et al. · 2014 [cited by applicant]
US 20140324522A1 · Wilkins et al. · 2014 [cited by applicant]
US 20150254568A1 · Zhao · 2015 [cited by examiner]
US 20150332414A1 · Unser · 2015 [cited by applicant]
US 20170103340A1 · Zoldi et al. · 2017 [cited by applicant]
US 20180025273A1 · Jordan et al. · 2018 [cited by applicant]
US 20180060581A1 · El Moussa et al. · 2018 [cited by applicant]
US 20190042947A1 · Turner et al. · 2019 [cited by applicant]
US 20190156196A1 · Zoldi et al. · 2019 [cited by applicant]
US 20190260839A1 · Prieditis · 2019 [cited by applicant]
US 20190318255A1 · Ripley et al. · 2019 [cited by applicant]
US 20190340526A1 · Turner et al. · 2019 [cited by applicant]
US 20190354613A1 · Zoldi et al. · 2019 [cited by applicant]
US 20190354853A1 · Zoldi et al. · 2019 [cited by applicant]
US 20190362417A1 · Patten et al. · 2019 [cited by applicant]
US 20200026642A1 · Indurthivenkata et al. · 2020 [cited by applicant]
US 20200097881A1 · Krone et al. · 2020 [cited by applicant]
US 20200104734A1 · Turner et al. · 2020 [cited by applicant]
US 20200134387A1 · Liu et al. · 2020 [cited by applicant]
US 20200134439A1 · Turner et al. · 2020 [cited by applicant]
US 20200250556A1 · Nourian et al. · 2020 [cited by applicant]
US 20200272853A1 · Zoldi et al. · 2020 [cited by applicant]
US 20200279334A1 · Billings · 2020 [cited by examiner]
US 20200387832A1 · Jordan et al. · 2020 [cited by applicant]
US 20200401894A1 · Turner et al. · 2020 [cited by applicant]
US 20200410362A1 · Turner et al. · 2020 [cited by applicant]
US 20210012418A1 · Feinstein et al. · 2021 [cited by applicant]
US 20210042366A1 · Hicklin et al. · 2021 [cited by applicant]
US 20210042647A1 · Turner et al. · 2021 [cited by applicant]
US 20210049428A1 · Huang et al. · 2021 [cited by applicant]
US 20210049503A1 · Nourian et al. · 2021 [cited by applicant]
US 20210142914A1 · Hua et al. · 2021 [cited by applicant]
US 20210144131A1 · Krishnamacharya · 2021 [cited by applicant]
US 20210150532A1 · Zhang et al. · 2021 [cited by applicant]
US 20210157717A1 · Indurthivenkata et al. · 2021 [cited by applicant]
US 20210174264A1 · Jordan et al. · 2021 [cited by applicant]
US 20210182690A1 · Jordan et al. · 2021 [cited by applicant]
US 20210224673A1 · Turner et al. · 2021 [cited by applicant]
US 20210240808A1 · Sadhwani et al. · 2021 [cited by applicant]
US 20210241141A1 · Dugger et al. · 2021 [cited by applicant]
US 20210248503A1 · Hickey · 2021 [cited by applicant]
US 20210263942A1 · Zoldi et al. · 2021 [cited by applicant]
US 20210294580A1 · Oburu et al. · 2021 [cited by applicant]
US 20210295175A1 · Kennel et al. · 2021 [cited by applicant]
US 20210342635A1 · Zoldi et al. · 2021 [cited by applicant]
US 20210357679A1 · Bondugula et al. · 2021 [cited by applicant]
US 20210357707A1 · Bondugula et al. · 2021 [cited by applicant]
US 20210406703A1 · Zoldi et al. · 2021 [cited by applicant]
US 20210406724A1 · Zoldi et al. · 2021 [cited by applicant]
US 20220103589A1 · Shen et al. · 2022 [cited by applicant]
US 20220147817A1 · Boardman et al. · 2022 [cited by applicant]
US 20220166782A1 · Zoldi et al. · 2022 [cited by applicant]
US 20220188644A1 · Zoldi et al. · 2022 [cited by applicant]
US 20220207324A1 · Hamilton et al. · 2022 [cited by applicant]
US 20220261821A1 · Burton et al. · 2022 [cited by applicant]
US 20220319701A1 · Fahner et al. · 2022 [cited by applicant]
US 20220321394A1 · Huang et al. · 2022 [cited by applicant]
US 20220326997A1 · Pradhan et al. · 2022 [cited by applicant]
US 20220335348A1 · Miller et al. · 2022 [cited by applicant]
US 20220374744A1 · Zoldi et al. · 2022 [cited by applicant]
US 20220391435A1 · Xie et al. · 2022 [cited by applicant]
US 20220391793A1 · Latimer et al. · 2022 [cited by applicant]
US 20220414469A1 · Turner et al. · 2022 [cited by applicant]
US 20230008208A1 · Bondugula et al. · 2023 [cited by applicant]
US 20230023630A1 · Hamilton et al. · 2023 [cited by applicant]
US 20230046601A1 · Hamilton et al. · 2023 [cited by applicant]
US 20230080851A1 · Zoldi et al. · 2023 [cited by applicant]
US 20230085575A1 · Zoldi et al. · 2023 [cited by applicant]
US 20230100730A1 · Liu et al. · 2023 [cited by applicant]
US 20230111785A1 · Joshua et al. · 2023 [cited by applicant]
US 20230113118A1 · Guo et al. · 2023 [cited by applicant]
US 20230121564A1 · Zou et al. · 2023 [cited by applicant]
US 20230162053A1 · Patel et al. · 2023 [cited by applicant]
US 20230177397A1 · Huang et al. · 2023 [cited by applicant]
US 20230196136A1 · Campolong et al. · 2023 [cited by applicant]
US 20230196147A1 · McBurnett et al. · 2023 [cited by applicant]
US 20230205893A1 · Gjorvad et al. · 2023 [cited by applicant]
US 20230206134A1 · Kennel et al. · 2023 [cited by applicant]
US 20230214677A1 · Alfred et al. · 2023 [cited by applicant]
US 20230214784A1 · Kakade · 2023 [cited by examiner]
US 20230216866A1 · Monnig et al. · 2023 [cited by applicant]
US 20230244905A1 · Zoldi et al. · 2023 [cited by applicant]
US 20230283628A1 · Johnston · 2023 [cited by applicant]
US 20230297847A1 · Turner et al. · 2023 [cited by applicant]
US 20230319036A1 · Singh et al. · 2023 [cited by applicant]
US 20230325724A1 · Ouyang et al. · 2023 [cited by applicant]
US 20230342605A1 · Sankaran et al. · 2023 [cited by applicant]
US 20230351210A1 · Murray et al. · 2023 [cited by applicant]
US 20230359672A1 · Ralph et al. · 2023 [cited by applicant]
US 20230359767A1 · Ralph et al. · 2023 [cited by applicant]
US 20230359883A1 · Ralph et al. · 2023 [cited by applicant]
US 20230367821A1 · Hicklin et al. · 2023 [cited by applicant]
US 20240005150A1 · Dugger · 2024 [cited by examiner]
US 20240013919A1 · Fahner et al. · 2024 [cited by applicant]
US 20240013926A1 · Hua et al. · 2024 [cited by applicant]
AU 2019250275 · 2020 [cited by applicant]
AU 2020233739 · 2020 [cited by applicant]
AU 2021200434 · 2021 [cited by applicant]
AU 2021232839 · 2021 [cited by applicant]
AU 2022203061 · 2022 [cited by applicant]
AU 2022204452 · 2022 [cited by applicant]
AU 2022204580 · 2022 [cited by applicant]
AU 2022204732 · 2022 [cited by applicant]
AU 2021273576 · 2023 [cited by applicant]
AU 2022256086 · 2023 [cited by applicant]
AU 2022291564 · 2023 [cited by applicant]
AU 2023203714 · 2023 [cited by applicant]
CA 3039182 · 2018 [cited by applicant]
CA 3059314 · 2020 [cited by applicant]
CA 3134595 · 2023 [cited by applicant]
CA 2980166 · 2023 [cited by applicant]
EP 0554083 · 1993 [cited by applicant]
EP 3572985 · 2019 [cited by applicant]
EP 3690762 · 2020 [cited by applicant]
EP 3699827 · 2020 [cited by applicant]
EP 3719710 · 2020 [cited by applicant]
EP 3852019 · 2021 [cited by applicant]
EP 3862897 · 2021 [cited by applicant]
EP 3866072 · 2021 [cited by applicant]
EP 3923207 · 2021 [cited by applicant]
EP 3933702 · 2022 [cited by applicant]
EP 4006782 · 2022 [cited by applicant]
EP 3332320 · 2023 [cited by applicant]
EP 4224309 · 2023 [cited by applicant]
EP 3710927 · 2023 [cited by applicant]
GB 2579139 · 2020 [cited by applicant]
WO WO94006103 · 1994 [cited by applicant]
WO WO00055789 · 2000 [cited by applicant]
WO WO00055790 · 2000 [cited by applicant]
WO WO2008127288 · 2008 [cited by applicant]
WO WO2016160539 · 2016 [cited by applicant]
WO WO2016164680 · 2016 [cited by applicant]
WO WO2017024242 · 2017 [cited by applicant]
WO WO2017053347 · 2017 [cited by applicant]
WO WO2018049154 · 2018 [cited by applicant]
WO WO2018057701 · 2018 [cited by applicant]
WO WO2018081623 · 2018 [cited by applicant]
WO WO2018084867 · 2018 [cited by applicant]
WO WO2018236732 · 2018 [cited by applicant]
WO WO2019050864 · 2019 [cited by applicant]
WO WO2019088972 · 2019 [cited by applicant]
WO WO2019089439 · 2019 [cited by applicant]
WO WO2019089990 · 2019 [cited by applicant]
WO WO2019094910 · 2019 [cited by applicant]
WO WO2019104088 · 2019 [cited by applicant]
WO WO2019104089 · 2019 [cited by applicant]
WO WO2019152592 · 2019 [cited by applicant]
WO WO2019182593 · 2019 [cited by applicant]
WO WO2019217876 · 2019 [cited by applicant]
WO WO2020198236 · 2020 [cited by applicant]
WO WO2021034932 · 2021 [cited by applicant]
WO WO2021050346 · 2021 [cited by applicant]
WO WO2021097090 · 2021 [cited by applicant]
WO WO2021138271 · 2021 [cited by applicant]
WO WO2021173501 · 2021 [cited by applicant]
WO WO2022020162 · 2022 [cited by applicant]
WO WO2022031412 · 2022 [cited by applicant]
WO WO2022031523 · 2022 [cited by applicant]
WO WO2022032285 · 2022 [cited by applicant]
WO WO2022072989 · 2022 [cited by applicant]
WO WO2022104329 · 2022 [cited by applicant]
WO WO2022104357 · 2022 [cited by applicant]
WO WO2022178192 · 2022 [cited by applicant]
WO WO2022261600 · 2022 [cited by applicant]
WO WO2023059356 · 2023 [cited by applicant]
WO WO2023060150 · 2023 [cited by applicant]
WO WO2023063970 · 2023 [cited by applicant]
WO WO2023063971 · 2023 [cited by applicant]
WO WO2023063972 · 2023 [cited by applicant]
WO WO2023086954 · 2023 [cited by applicant]
WO WO2023107134 · 2023 [cited by applicant]
WO WO2023115019 · 2023 [cited by applicant]
WO WO2023129977 · 2023 [cited by applicant]
WO WO2023192175 · 2023 [cited by applicant]
Extended European Search Report in EP Application No. 20157023.1, dated Sep. 25, 2020. [cited by applicant]