IP Library Granted Patent US 12,559,136
Granted Patent B2
US 12,559,136 · App. 18/747,262 · Granted Feb 24, 2026

Systems and methods for graph-based AI training

Inventors: Robert Chess Stetson (Altadena, CA); Kris Chaisanguanthum (Kansas City, MO); Robert Ferguson (Tujunga, CA); Boris Revechkis (Pasadena, CA)
Assignee: dRISK, Inc.
B60W60/001G05D1/0221G05D1/0246G05D1/249G06F18/22G06F18/23G06N3/08G06N5/02G06N5/04G06V10/774G06V10/84G06V20/56
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,559,136
App. No.
18/747,262
Granted
Feb 24, 2026
Kind
B2
Abstract

Graphs are powerful structures made of nodes and edges. Information can be encoded in the nodes and edges themselves, as well as the connections between them. Graphs can be used to create manifolds which in turn can be used to efficiently train more robust AI systems. Systems and methods for graph-based AI training in accordance with embodiments of the invention are illustrated. In one embodiment, a graph interface system including a processor, and a memory configured to store a graph interface application, where the graph interface application directs the processor to obtain a set of training data, where the set of training data describes a plurality of scenarios, encode the set of training data into a first knowledge graph, generate a manifold based on the first knowledge graph, and train an AI model by traversing the manifold.

Claims (41)

1 . A virtual assistant system, comprising:

a display;

a processor communicatively coupled to the display; and

a memory, the memory storing an application that configures the processor to:

provide a workspace via the display;

record interactions with the workspace associated with a user;

encode the recorded interactions as nodes into a graph structure, where the graph structure comprises:

a plurality of nodes; and

a plurality of edges connecting nodes in the plurality of nodes;

train a machine learning model by providing the graph structure; and

suggest interactions in the workspace using the trained machine learning model.

2 . The virtual assistant system of claim 1 , wherein a subset of nodes in the plurality of nodes encodes operators available in the workspace.

3 . The virtual assistant system of claim 1 , wherein the application further configures the processor to:

obtain a new interaction with the workspace associated with the user; and

suggest interactions in the workspace by providing the trained machine learning model with the new interaction.

4 . The virtual assistant system of claim 1 , wherein to encode the recorded interactions as nodes, the application further configures the processor to remove schema-specific details from the recorded interactions.

5 . The virtual assistant system of claim 1 , wherein a subset of edges in the plurality of edges connect nodes in the plurality of nodes such that there is a 1-to-1 mapping of user interactions to the graph structure.

6 . The virtual assistant system of claim 1 , wherein a subset of nodes in the plurality of nodes encode user data.

7 . The virtual assistant system of claim 1 , wherein the application further configures the processor to provide a summary of the user data.

8 . The virtual assistant system of claim 1 , wherein the graph structure is a manifold.

9 . The virtual assistant system of claim 8 , wherein to train the machine learning model, the application further configures the processor to traverse the manifold.

10 . The virtual assistant system of claim 9 , wherein the manifold has a convex hull, and wherein to traverse the manifold, the application further configures the processor to traverse nodes on the convex hull.

11 . A method for providing a virtual assistant, comprising:

providing a workspace via the display;

recording interactions with the workspace associated with a user;

encoding the recorded interactions as nodes into a graph structure, where the graph structure comprises:

a plurality of nodes; and

a plurality of edges connecting nodes in the plurality of nodes;

training a machine learning model by providing the graph structure; and

suggesting interactions in the workspace using the trained machine learning model.

12 . The method of claim 11 , wherein a subset of nodes in the plurality of nodes encodes operators available in the workspace.

13 . The method of claim 11 , further comprising:

obtaining a new interaction with the workspace associated with the user; and

suggesting interactions in the workspace by providing the trained machine learning model with the new interaction.

14 . The method of claim 11 , wherein encoding the recorded interactions as nodes comprises removing schema-specific details from the recorded interactions.

15 . The method of claim 11 , wherein a subset of edges in the plurality of edges connect nodes in the plurality of nodes such that there is a 1-to-1 mapping of user interactions to the graph structure.

16 . The method of claim 11 , wherein a subset of nodes in the plurality of nodes encode user data.

17 . The method of claim 11 , further comprising providing a summary of the user data.

18 . The method of claim 11 , wherein the graph structure is a manifold.

19 . The method of claim 18 , wherein to training the machine learning model comprises traversing the manifold.

20 . The method of claim 19 , wherein the manifold has a convex hull, traversing the manifold comprises traversing nodes on the convex hull.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 17, 2024
From: STETSON, ROBERT CHESS; CHAISANGUANTHUM, KRIS; FERGUSON, ROBERT; REVECHKIS, BORIS
To: DRISK, INC.
Reel/Frame 069616/0722 →
Continuity (5)
Continuation 18057695 · Nov 21, 2022
Continuation 16566776 · Sep 10, 2019
Provisional Application 62789955 · Jan 8, 2019
Provisional Application 62729368 · Sep 10, 2018
Related Publication 20250018972A1 · Jan 16, 2025
References Cited (110)
US 5844572A · Schott · 1998 [cited by applicant]
US 7539697B1 · Akella et al. · 2009 [cited by applicant]
US 7644052B1 · Chang et al. · 2010 [cited by applicant]
US 7865534B2 · Chandra et al. · 2011 [cited by applicant]
US 8185558B1 · Narayanan et al. · 2012 [cited by applicant]
US 8352465B1 · Jing et al. · 2013 [cited by applicant]
US 8572129B1 · Lee · 2013 [cited by applicant]
US 8736612B1 · Goldman et al. · 2014 [cited by applicant]
US 8739016B1 · Goldman · 2014 [cited by applicant]
US 9129158B1 · Medasani et al. · 2015 [cited by applicant]
US 9187088B1 · Ferguson et al. · 2015 [cited by applicant]
US 9348947B2 · Stetson et al. · 2016 [cited by applicant]
US 9411890B2 · Komarov · 2016 [cited by applicant]
US 9684678B2 · Hatami-Hanza · 2017 [cited by applicant]
US 9740744B2 · Stetson et al. · 2017 [cited by applicant]
US 9792530B1 · Wu et al. · 2017 [cited by applicant]
US 10019011B1 · Green et al. · 2018 [cited by applicant]
US 10466978B1 · Vidan · 2019 [cited by examiner]
US 10713258B2 · Stetson et al. · 2020 [cited by applicant]
US 10776965B2 · Stetson et al. · 2020 [cited by applicant]
US 11507099B2 · Stetson et al. · 2022 [cited by applicant]
US 12043280B2 · Stetson et al. · 2024 [cited by applicant]
US 12175568B2 · Stetson et al. · 2024 [cited by applicant]
US 20020087275A1 · Kim et al. · 2002 [cited by applicant]
US 20040034848A1 · Moore et al. · 2004 [cited by applicant]
US 20070124291A1 · Hassan et al. · 2007 [cited by applicant]
US 20070208693A1 · Chang et al. · 2007 [cited by applicant]
US 20070239694A1 · Singh et al. · 2007 [cited by applicant]
US 20070294221A1 · Chen et al. · 2007 [cited by applicant]
US 20080059512A1 · Roitblat et al. · 2008 [cited by applicant]
US 20080097941A1 · Agarwal · 2008 [cited by applicant]
US 20090013314A1 · Opaterny · 2009 [cited by applicant]
US 20090303239A1 · Ang et al. · 2009 [cited by applicant]
US 20100094864A1 · Foody · 2010 [cited by applicant]
US 20100274815A1 · Vanasco · 2010 [cited by applicant]
US 20110173189A1 · Singh et al. · 2011 [cited by applicant]
US 20110208822A1 · Rathod · 2011 [cited by examiner]
US 20110249002A1 · Duplessis et al. · 2011 [cited by applicant]
US 20110295841A1 · Sityon et al. · 2011 [cited by applicant]
US 20120209886A1 · Henderson · 2012 [cited by applicant]
US 20120221555A1 · Byrne et al. · 2012 [cited by applicant]
US 20120293542A1 · Iwama et al. · 2012 [cited by applicant]
US 20120317149A1 · Jagota · 2012 [cited by applicant]
US 20130117261A1 · Sambrani · 2013 [cited by applicant]
US 20130159901A1 · Wolge et al. · 2013 [cited by applicant]
US 20130191416A1 · Lee · 2013 [cited by applicant]
US 20130246342A1 · Faith · 2013 [cited by applicant]
US 20130290234A1 · Harris · 2013 [cited by applicant]
US 20140149376A1 · Kutaragi et al. · 2014 [cited by applicant]
US 20140172914A1 · Elnikety et al. · 2014 [cited by applicant]
US 20140380286A1 · Gabel · 2014 [cited by examiner]
US 20150033106A1 · Stetson et al. · 2015 [cited by applicant]
US 20150254331A1 · Long et al. · 2015 [cited by applicant]
US 20160239545A1 · Stetson et al. · 2016 [cited by applicant]
US 20170131719A1 · Micks et al. · 2017 [cited by applicant]
US 20170221240A1 · Stetson et al. · 2017 [cited by applicant]
US 20170316059A1 · Stetson et al. · 2017 [cited by applicant]
US 20180014217A1 · Kleinbeck et al. · 2018 [cited by applicant]
US 20180183823A1 · Fadlil · 2018 [cited by examiner]
US 20180189634A1 · Abdelaziz et al. · 2018 [cited by applicant]
US 20180285764A1 · Hu · 2018 [cited by examiner]
US 20190025841A1 · Haynes et al. · 2019 [cited by applicant]
US 20190310650A1 · Halder · 2019 [cited by applicant]
US 20190347518A1 · Shrestha · 2019 [cited by examiner]
US 20190384863A1 · Sirin et al. · 2019 [cited by applicant]
US 20200067952A1 · Deaguero · 2020 [cited by examiner]
US 20200081445A1 · Stetson et al. · 2020 [cited by applicant]
US 20210065415A1 · Stetson et al. · 2021 [cited by applicant]
US 20210339772A1 · Ramamoorthy et al. · 2021 [cited by applicant]
US 20210389769A1 · Hari et al. · 2021 [cited by applicant]
US 20210403036A1 · Danna · 2021 [cited by applicant]
US 20220234622A1 · Stetson et al. · 2022 [cited by applicant]
US 20230202513A1 · Stetson et al. · 2023 [cited by applicant]
EP 3850546A1 · 2021 [cited by applicant]
EP 4285289A1 · 2023 [cited by applicant]
JP 2019153277A · 2019 [cited by applicant]
JP 2019533609A · 2019 [cited by applicant]
WO 2018010434A1 · 2018 [cited by applicant]
WO 2019165451A1 · 2019 [cited by applicant]
WO 2020055910A1 · 2020 [cited by applicant]
WO 2020056331A1 · 2020 [cited by applicant]
WO 2020205629A1 · 2020 [cited by applicant]
WO 2020224910A1 · 2020 [cited by applicant]
WO 2022165525A1 · 2022 [cited by applicant]
Extended European Search Report for European Application No. 19860523.0, Search completed May 5, 2022, Mailed May 13, 2022, 16 Pgs. [cited by applicant]
International Preliminary Report on Patentability for International Application PCT/US2019/050469, Report issued Mar. 9, 2021, Mailed Mar. 25, 2021, 7 Pgs. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2022/070425, Report issued Jul. 31, 2023, Mailed Aug. 10, 2023, 6 Pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2022/070425, Search completed Mar. 23, 2022, Mailed Apr. 4, 2022, 15 Pgs. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2019/050469, Search completed Nov. 20, 2019, Mailed Dec. 11, 2019, 9 Pgs. [cited by applicant]
“Relational algebra”, Wikipedia, Retrieved from: https://en.wikipedia.org/wiki/Relational_algebra, Last modified Jul. 28, 2022, Printed Sep. 19, 2022, 11 pgs. [cited by applicant]
“SAE Standard J3016, Taxonomy and Definitions for Terms Related to Driving Automation Systems for On-Road Motor Vehicles”, Retrieved from: https://www.sae.org/standards/content/j3016_202104/, Last revised: Apr. 30, 2021. [cited by applicant]
Bagschik et al., “Ontology Based Scene Creation for the Development of Automated Vehicles”, IEEE Intelligent Vehicles Symposium (IV), IEEE, Jun. 26, 2018, pp. 1813-1820, XP033423512. [cited by applicant]
Chauvin, “Hierarchical Decision-Making for Autonomous Driving”, Aug. 2018, pp. 1-8, XP055916113, DOI: 10.13140/rg.2.2.24352.43526. [cited by applicant]
Chen et al., “Manifold Learning-Based Data Sampling for Model Training”, Informatik Aktuell, Feb. 21, 2018, Springer Verlag, London., GB, Pgs—pp. 269-274, XP055916157. [cited by applicant]
Codd, E.F., “A Relational Model of Data for Large Shared Data Banks”, Communications of the ACM, vol. 13, No. 6, Jun. 1970, pp. 377-387. [cited by applicant]
Dopfer et al., “What can we learn from accident videos?”, 2013 CACS International Automatic Control Conference (CACS), IEEE, Dec. 2, 2013, pp. 68-73, XP032563875, DOI: 10.1109/CACS.2013.6734109. [cited by applicant]
Guo et al., “Semantically Smooth Knowledge Graph Embedding”, Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference On Natural Language Process… [cited by applicant]
Madrigal, “Inside Waymo's Secret World of Training Self-Driving Cars”, The Atlantic, Aug. 23, 2017, Retrieved from: https://www.theatlantic.com/technology/archive/2017/08/inside-waymos-secret-testing-and-simulation-faci… [cited by applicant]
Meyerovich et al., “Superconductor: A Language for Big Data Visualization”, ACM, LASH-C, Shenzen, China, Feb. 24, 2013. [cited by applicant]
Monti et al., “Geometric Deep Learning on Graphs and Manifolds Using Mixture Model CNNs”, In: Cornell University Library/ Computer Science/Computer Vision and Pattern Recognition, Nov. 25, 2016, (online) (retrieved on N… [cited by applicant]
Olsson, “Behavior Trees for decision-making in Autonomous Driving”, 2016, retrieved from http://www.diva-portal.org/smash/get/diva2:907048/FULLTEXT01.pdf (Year: 2016). [cited by applicant]
Torok, Matthew E., “Superconductor 1 Million Nodes at 30 FPS”, Retrieved from: http://parlab.eecs.berkeley.edu/sites/all/parlab/files/superconductor%20overview%20external.pdf, Aug. 2012, 29 pgs. [cited by applicant]
Wilcke et al., “The knowledge graph as the default data model for learning on heterogeneous knowledge”, Data Science, Dec. 8, 2017, vol. 1, No. 1-2, pp. 39-57, XP055915793. [cited by applicant]
Extended European Search Report for European Application No. 22746924.4, Search completed Nov. 15, 2024, Mailed Dec. 3, 2024, 10 Pgs. [cited by applicant]
Chao, “Autonomous Driving: Mapping and Behavior Planning for Crosswalks”, A Thesis Presented to the University of Waterloo, 2019, 87pgs. [cited by applicant]
Gupta et al., “Towards Safer Self-Driving Through Great PAIN (Physically Adversarial Intelligent Networks)”, Arxiv.Org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Mar. 24, 2020, XP… [cited by applicant]
Hospach et al., “Simulation of Falling Rain for Robustness Testing of Video- Based Surround Sensing Systems”, 2016 Design, Automation & Test in Europe Confrence & Exhibition, 2019, 4 pgs. [cited by applicant]
Rhinehart et al., “Deep Imitative Models for Flexible Inference, Planning, and Control”, arXiv:1810.06544v4[cs.LG], Oct. 1, 2019, 19pgs. [cited by applicant]
Wu et al., “A Pioneering Scalable Self-Driving Car Simulation Platform”, 2019 IEEE 2nd International Conference on A utomation, Electronics and Electrical Engineering (A UTEEE), Nov. 22-24, 2019, 6pgs. [cited by applicant]
Yu et al., “Occlusion-Aware Risk Assessment for Autonomous Driving in Urban Environments”, arXiv:1809.04629v3[cs.RO], Jul. 17, 2019, 8pgs. [cited by applicant]