IP Library Granted Patent US 12,592,952
Granted Patent B2
US 12,592,952 · App. 18/790,253 · Granted Mar 31, 2026

Graphics processing unit optimization

Inventors: Damion Irving (Brooklyn, NY); James Korge (Brooklyn, NY); Jeffrey L. Thomas (Columbus, OH); Donald Bathurst (Denver, CO)
Assignee: Reveald Holdings, Inc.
H04L63/1425G06N20/00
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,592,952
App. No.
18/790,253
Granted
Mar 31, 2026
Kind
B2
Abstract

Methods, systems and computer program products are provided for optimizing resources privately. An initial information gain corresponding to an initial client embedding dataset is computed and a machine learning model is trained based on the initial client embedding data set to generate at least one initial attack path in the initial graph data. A second information gain corresponding to a second client embedding data set is computed. A difference between the first information gain and the second information gain is computed. The machine learning model is trained if the difference between the first information gain and the second information gain meets a predetermined threshold to generate at least one new attack path in the second graph data.

Claims (87)

1 . A method for optimizing graphics processing unit (GPU) resources during machine learning training events while preserving siloed client data privately, comprising:

siloing initial graph data having a first structure representing information technology associated with an organization, wherein the information technology associated with the organization includes any one of (i) at least one on-premises resource, (ii) at least one third party service, (iii) at least one cloud computing service, (iv) a plurality of credentials associated with (i), (ii), (iii), or (v) any combination of (i), (ii), (iii) and (vi);

mapping, by an algorithmic framework processor, the first structure represented by the initial graph data to a second structure, the second structure having a lower dimension than the first structure and containing real numbers, thereby generating an initial client embedding data set;

computing, by an information gain processor, a first information gain corresponding to the initial client embedding data set, wherein the information gain is a scalar representation showing an amount of information diversity in a client embedding data set;

training, by a dedicated server including a graphics processing unit (GPU), a machine learning model based on the initial client embedding data set to generate at least one initial attack path in the initial graph data;

siloing updated graph data as second graph data having a third structure representing the information technology associated with the organization;

mapping, using the algorithmic framework processor, the third structure representing the second graph data to a fourth structure, the fourth structure having a lower dimension than the third structure and containing real numbers, thereby generating a second client embedding data set;

computing, using the information gain processor, a second information gain corresponding to the second client embedding data set;

computing, using a difference processor, a difference between the first information gain and the second information gain;

retraining, using the dedicated server, the machine learning model if the difference between the first information gain and the second information gain meets a predetermined threshold to generate at least one new attack path in the second graph data; and

awaiting for a next client embedding data set update if the difference between the first information gain and the second information gain does not meet the predetermined threshold, thereby preventing retraining.

2 . The method according to claim 1 , further comprising:

detecting any one or a combination of:

a change in the initial graph data,

a change corresponding to a node property, and

a relationship between two or more nodes.

3 . The method of claim 1 , further comprising:

scoring, by a scoring processor, the at least one initial attack path, thereby generating at least one scored initial attack path;

ranking, by a ranking processor, the at least one scored initial attack path, thereby generating a ranking of initial attack paths;

providing the ranking of new attack paths to a user interface;

scoring, by the scoring processor, the at least one new attack path, thereby generating at least one scored new attack path;

ranking, by the ranking processor, the at least one scored new attack path, thereby generating a ranking of new attack paths; and

providing the ranking of new attack paths to the user interface.

4 . The method of claim 3 , wherein the scoring is performed by:

measuring a utility of vulnerability associated with at least one node in the initial attack path.

5 . The method according to claim 1 , further comprising:

receiving, from a user interface, an update including attribute data related to any one of (i) at least one node represented by the initial graph data, (ii) at least one edge represented by the initial graph data, or (iii) combination of (i) and (ii); and

retraining, using the dedicated server, the machine learning model using the attribute data and the client embedding data set.

6 . The method according to claim 5 , wherein the retraining of the machine learning model using the attribute data and the client embedding data set occurs if the difference between the first information gain and the second information gain is less than a predetermined threshold.

7 . A system for optimizing graphics processing unit (GPU) resources during machine learning training events while preserving siloed client data privately, comprising:

a first siloed database stored in a memory and configured to silo initial graph data having a first structure representing information technology associated with an organization, wherein the information technology associated with the organization includes any one of (i) at least one on-premises resource, (ii) at least one third party service, (iii) at least one cloud computing service, (iv) a plurality of credentials associated with (i), (ii), (iii), or (v) any combination of (i), (ii), (iii) and (vi);

an algorithmic framework processor configured to map a first structure represented by the initial graph data to a second structure, the second structure having a lower dimension than the first structure and containing real numbers, thereby generating an initial client embedding data set;

an information gain processor configured to compute a first information gain corresponding to the initial client embedding data set;

a dedicated server including a graphics processing unit (GPU) configured to train a machine learning model based on the initial client embedding data set to generate at least one initial attack path in the initial graph data;

a second siloed database configured to silo second graph data having a third structure representing the information technology associated with the organization;

the algorithmic framework processor further configured to map the third structure representing the second graph data to a fourth structure, the fourth structure having a lower dimension than the third structure and containing real numbers, thereby generating a second client embedding data set;

the information gain processor further configured to compute a second information gain corresponding to the second client embedding data set;

a difference processor configured to compute a difference between the first information gain and the second information gain; and

the dedicated server further configured to retrain the machine learning model if the difference between the first information gain and the second information gain meets a predetermined threshold to generate at least one new attack path in the second graph data and to await for a next client embedding data set update if the difference between the first information gain and the second information gain does not meet the predetermined threshold.

8 . The system according to claim 7 , further comprising:

the user interface further configured to detect any one or a combination of:

a change in the initial graph data,

a change corresponding to a node property, and

a relationship between two or more nodes.

9 . The system of claim 7 , further comprising:

a scoring processor configured to score the at least one initial attack path, thereby generating at least one scored initial attack path;

a ranking processor configured to:

rank the at least one scored initial attack path, thereby generating a ranking of initial attack paths, and

provide the ranking of new attack paths to a user interface;

the scoring processor further configured to score the at least one new attack path, thereby generating at least one scored new attack path; and

the ranking processor further configured to:

rank the at least one scored new attack path, thereby generating a ranking of new attack paths, and

provide the ranking of new attack paths to the user interface.

10 . The system according to claim 9 , wherein the scoring processor is configured to perform scoring is by measuring a utility of vulnerability associated with at least one node in the initial attack path.

11 . The system according to claim 7 , further comprising:

a user interface configured to receive an update including attribute data related to any one of (i) at least one node represented by the initial graph data, (ii) at least one edge represented by the initial graph data, or (iii) combination of (i) and (ii); and

the dedicated server is further configured to retrain the machine learning model using the attribute data and the client embedding data set.

12 . The system according to claim 11 , wherein the retraining of the machine learning model using the attribute data and the client embedding data set occurs if the difference between the first information gain and the second information gain is less than a predetermined threshold.

13 . A non-transitory computer-readable medium having stored thereon one or more sequences of instructions for causing one or more processors to perform:

siloing initial graph data having a first structure representing information technology associated with an organization, wherein the information technology associated with the organization includes any one of (i) at least one on-premises resource, (ii) at least one third party service, (iii) at least one cloud computing service, (iv) a plurality of credentials associated with (i), (ii), (iii), or (v) any combination of (i), (ii), (iii) and (vi);

mapping the first structure represented by the initial graph data to a second structure, the second structure having a lower dimension than the first structure and containing real numbers, thereby generating an initial client embedding data set;

computing a first information gain corresponding to the initial client embedding data set, wherein the information gain is a scalar representation showing an amount of information diversity in a client embedding data set;

training a machine learning model based on the initial client embedding data set to generate at least one initial attack path in the initial graph data;

siloing updated graph data as second graph data having a third structure representing the information technology associated with the organization;

mapping the third structure representing the second graph data to a fourth structure, the fourth structure having a lower dimension than the third structure and containing real numbers, thereby generating a second client embedding data set;

computing a second information gain corresponding to the second client embedding data set;

computing a difference between the first information gain and the second information gain;

retraining the machine learning model if the difference between the first information gain and the second information gain meets a predetermined threshold to generate at least one new attack path in the second graph data; and

awaiting for a next client embedding data set update if the difference between the first information gain and the second information gain does not meet the predetermined threshold, thereby preventing retraining.

14 . The non-transitory computer-readable medium of claim 13 , further having stored thereon a sequence of instructions for causing the one or more processors to perform:

detecting any one or a combination of:

a change in the initial graph data,

a change corresponding to a node property, and

a relationship between two or more nodes.

15 . The non-transitory computer-readable medium of claim 13 , further having stored thereon a sequence of instructions for causing the one or more processors to perform:

scoring the at least one initial attack path, thereby generating at least one scored initial attack path;

ranking the at least one scored initial attack path, thereby generating a ranking of initial attack paths;

providing the ranking of new attack paths to a user interface;

scoring the at least one new attack path, thereby generating at least one scored new attack path;

ranking the at least one scored new attack path, thereby generating a ranking of new attack paths; and

provide the ranking of new attack paths to the user interface.

16 . The non-transitory computer-readable medium of claim 15 , further having stored thereon a sequence of instructions for causing the one or more processors to perform:

measuring a utility of vulnerability associated with at least one node in the initial attack path.

17 . The non-transitory computer-readable medium of claim 13 , further having stored thereon a sequence of instructions for causing the one or more processors to perform:

receiving an update including attribute data related to any one of (i) at least one node represented by the initial graph data, (ii) at least one edge represented by the initial graph data, or (iii) combination of (i) and (ii); and

retraining the machine learning model using the attribute data and the client embedding data set.

18 . The non-transitory computer-readable medium of claim 13 , wherein the retraining of the machine learning model using the attribute data and the client embedding data set occurs if the difference between the first information gain and the second information gain is less than a predetermined threshold.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 31, 2024
From: IRVING, DAMION; KORGE, JAMES; THOMAS, JEFFREY L.; BATHURST, DONALD
To: DIGITALWARE, INC.
Reel/Frame 068138/0688 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 31, 2024
From: DIGITALWARE, INC.
To: EPIPHANY SYSTEMS, INC.
Reel/Frame 068138/0893 →
CHANGE OF NAME Recorded Jul 31, 2024
From: EPIPHANY SYSTEMS, INC.
To: REVEALD HOLDINGS, INC.
Reel/Frame 068205/0236 →
Continuity (3)
Continuation 17877133 · Jul 29, 2022
Provisional Application 63227977 · Jul 30, 2021
Related Publication 20240396917A1 · Nov 28, 2024
References Cited (47)
US 8881288B1 · Levy · 2014 [cited by examiner]
US 10033754B2 · Pinney Wood et al. · 2018 [cited by applicant]
US 10084822B2 · Papamartzivanos · 2018 [cited by examiner]
US 10425429B2 · Bassett · 2019 [cited by applicant]
US 10476896B2 · DiValentin et al. · 2019 [cited by applicant]
US 10630716B1 · Ghosh et al. · 2020 [cited by applicant]
US 10657461B2 · McMahan et al. · 2020 [cited by applicant]
US 10848515B1 · Pokhrel · 2020 [cited by examiner]
US 20150193695A1 · Cruz Mota et al. · 2015 [cited by applicant]
US 20180159890A1 · Warnick · 2018 [cited by applicant]
US 20190005195A1 · Peterson · 2019 [cited by applicant]
US 20190061147A1 · Luciw · 2019 [cited by applicant]
US 20190222593A1 · Craig · 2019 [cited by examiner]
US 20190385051A1 · Wabgaonkar · 2019 [cited by applicant]
US 20200017117A1 · Milton · 2020 [cited by examiner]
US 20200145441A1 · Patterson · 2020 [cited by applicant]
US 20200412767A1 · Crabtree · 2020 [cited by examiner]
US 20210019325A1 · Edge · 2021 [cited by examiner]
US 20210021629A1 · Dani · 2021 [cited by examiner]
US 20210042471A1 · Ponomarev · 2021 [cited by applicant]
US 20210234882A1 · Lee · 2021 [cited by examiner]
US 20210325891A1 · Young · 2021 [cited by examiner]
US 20220014561A1 · Caceres · 2022 [cited by applicant]
US 20220201014A1 · Saha · 2022 [cited by examiner]
US 20220407879A1 · Dong · 2022 [cited by applicant]
US 20230032249A1 · Irving · 2023 [cited by applicant]
US 20230034303A1 · Korge · 2023 [cited by applicant]
US 20230056706A1 · Irving · 2023 [cited by applicant]
US 20230208882A1 · Crabtree · 2023 [cited by applicant]
US 20230328094A1 · Brown · 2023 [cited by applicant]
WO 2020219157 · 2020 [cited by applicant]
WO 2021080577 · 2021 [cited by applicant]
Alavizadeh, Hooman et al., “A Markov Game Model for AI-Based Cyber Security Attack Mitigation”, arxiv.org, Cornell University Library, Jul. 20, 2021, 11 pages. [cited by applicant]
He, Chaoyang et al., “FedGraphNN: A Federated Learning System and Benchmark for Graph Neural Networks”, arxiv.org, Cornell University Library, Apr. 14, 2021, 19 pages. [cited by applicant]
Kamden, Gael et al., “A Markov Game Theoritic Approach for Power Grid Security”, 2017 IEEE 37th International Conference on Distributed Computing Systems Workshops, pp. 139-144. [cited by applicant]
McMahen, H. Brendan et al., “Communication-Efficient Learning of Deep Networks from Decentralized Data”, Feb. 28, 2017, https://arxiv.org/pdf/1602.05629.pdf, retrieved on Jan. 7, 2019, 11 pages. [cited by applicant]
PCT International Preliminary Report on Patentability in Application PCT/US2022/038829, mailed Feb. 8, 2024, 10 pages. [cited by applicant]
PCT International Preliminary Report on Patentability in Application PCT/US2022/038845, mailed Feb. 8, 2024, 12 pages. [cited by applicant]
PCT International Preliminary Report on Patentability in Application PCT/US2022/038863, mailed Feb. 29, 2024, 10 pages. [cited by applicant]
PCT International Search Report and Written Opinion in Application PCT/US2022/038829, mailed Nov. 28, 2022, 18 pages. [cited by applicant]
PCT International Search Report and Written Opinion in Application PCT/US2022/038845, mailed Oct. 25, 2022, 19 pages. [cited by applicant]
PCT International Search Report and Written Opinion in Application PCT/US2022/038863, mailed Oct. 27, 2022, 18 pages. [cited by applicant]
Yang, Qiang et al., “Federated Learning”, IEEE, Dec. 31, 2020, https://ieeexplore.ieee.org/abstract/document/8940936, retrieved on Dec. 31, 2020, 202 pages. [cited by applicant]
Zhang, Lei et al., “Discover the Hidden Attack Path in Multi-Domain Cyberspace Based on Reinforcement Learning”, arXiv:2104.07195v1 [cs.CR], Apr. 15, 2021, 12 pages. [cited by applicant]
Madjiheurem, S., “Representation Learning on Graphs: A Reinforcement Learning Application”, 2019, Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics 2019, PMLR vol. 89 (Year: 2019… [cited by applicant]
Nguyen, H., “Multiple Level Action Embedding for Penetration Testing”, Nov. 26-27, 2020, ICFNDS '20 Association for Computing Machinery, pp. 1-9 (Year: 2020). [cited by applicant]
Zheng, W., et al., “OpenGraphGym: A Parallel Reinforcement Learning Framework for Graph Optimization Problems”, In: Krzhizhanovskaya, V.V., et al. Computational Science—ICCS 2020. ICCS 2020. Lecture Notes in Computer Sc… [cited by applicant]