IP Library Granted Patent US 12,430,559
Granted Patent B2
US 12,430,559 · App. 19/098,299 · Granted Sep 30, 2025

Accelerated training of a neural network via regularization

Inventors: James K. Baker (Maitland, FL); Bradley J. Baker (Berwyn, PA)
Assignee: D5AI LLC
G06N3/082G06F16/9024G06F18/214G06F18/217G06F18/24G06N3/04G06N3/045G06N3/048G06N3/08G06N3/084G06N20/00G06N20/20H04L67/142G06F18/2148G06N5/046
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,430,559
App. No.
19/098,299
Granted
Sep 30, 2025
Kind
B2
Abstract

A system and method for controlling a nodal network. The method includes estimating an effect on the objective caused by the existence or non-existence of a direct connection between a pair of nodes and changing a structure of the nodal network based at least in part on the estimate of the effect. A nodal network includes a strict partially ordered set, a weighted directed acyclic graph, an artificial neural network, and/or a layered feed-forward neural network.

Claims (47)

1. A method of accelerating training a first neural network, wherein the first neural network comprises multiple nodes, wherein the multiple nodes comprise a first node, the method comprising:

iterative training, by a programmed computer system that comprises one or more processor cores, via machine learning, the first neural network over a first number of iterations, wherein the iterative training comprises:

for each training data item in a set of training data items:

in a forward propagation phase, determining an activation values for each of the multiple nodes; and

in a back-propagation phase, determining estimated partial derivatives of learned parameters and activation values for the multiple nodes with respect to, at least, an objective of the first neural network; and

updating the learned parameters associated with the multiple nodes based on the estimated partial derivatives,

wherein determining the estimated partial derivatives comprises determining estimated partial derivatives for the first node, and wherein determining the estimated partial derivatives for the first node comprises:

adding by the programmed computer system, a regularization cost term to the objective for a node state of the first node for a first training data item in the set of training data items, wherein the regularization cost term is based on a difference between the node state of the first node for the first training data item and a node state of a second node for the first training data item, wherein the second node is one of multiple nodes of a second neural network that is separate from the first neural network.

2. The method of claim 1 , wherein the node state of the first node comprises a first learned parameter for the first node and the node state for the second node comprises a second learned parameter for the second node.

3. The method of claim 2 , wherein the first and second learned parameters comprise connection weights.

4. The method of claim 1 , wherein the node state of the first node comprises a first activation value for the first node and the node state for the second node comprises a second activation value for the second node.

5. The method of claim 1 , wherein the regularization cost term is a squared difference between the node state of the first node and the node state of the second node.

6. The method of claim 5 , wherein the regularization cost term is multiplied by a hyperparameter that controls a strength of the regularization.

7. The method of claim 1 , wherein the regularization cost term is an absolute difference between the node state of the first node and the node state of the second node.

8. The method of claim 1 , wherein the regularization cost term is multiplied by a hyperparameter that controls a strength of the regularization.

9. The method of claim 1 , wherein the first neural network and the second neural network have different architectures.

10. The method of claim 1 , further comprising, prior to iterative training the first neural network, iteratively training, via machine learning, by the programmed computer system, the second neural network to convergence.

11. The method of claim 1 , wherein updating the learned parameters comprises updating the learned parameters via stochastic gradient descent.

12. The method of claim 1 , wherein updating the learned parameters comprises updating the learned parameters via gradient descent.

13. The method of claim 1 , wherein the first node is an output node of the first neural network and the second node is an output node of the second neural network.

14. The method of claim 1 , wherein the first node is a labeled feature node of the first neural network and the second node is a labeled feature node of the second neural network.

15. The method of claim 1 , further comprising, after iterative training the first neural network, merging, by the programmed computer system, the first and second neural networks.

16. The method of claim 1 , wherein the first and second neural networks are members of an ensemble.

17. A computer system for accelerated training of a first neural network, wherein the first neural network comprises multiple nodes, wherein the multiple nodes comprise a first node, the computer system comprising:

one or more processor cores; and

computer memory in communication with the one or more processor cores, wherein the computer stores instructions that when executed by the one or more processor cores cause the one or more processor cores to perform iterative training, via machine learning, of the first neural network, wherein the iterative training comprises:

for each training data item in a set of training data items:

in a forward propagation phase, determining an activation values for each of the multiple nodes; and

in a back-propagation phase, determining estimated partial derivatives of learned parameters and activation values for the multiple nodes, including the first node, with respect to, at least, an objective of the first neural network; and

updating the learned parameters associated with the multiple nodes based on the estimated partial derivatives,

wherein the computer memory stores instructions that when executed by the one or more processor cores cause the one or more processor cores to determine the estimated partial derivatives for the first node by adding a regularization cost term to the objective for a node state of the first node for a first training data item in the set of training data items, wherein the regularization cost term is based on a difference between the node state of the first node for the first training data item and a node state of a second node for the first training data item, wherein the second node is one of multiple nodes of a second neural network that is separate from the first neural network.

18. The computer system of claim 17 , wherein the node state of the first node comprises a first learned parameter for the first node and the node state for the second node comprises a second learned parameter for the second node.

19. The computer system of claim 18 , wherein the first and second learned parameters comprise connection weights.

20. The computer system of claim 17 , wherein the node state of the first node comprises a first activation value for the first node and the node state for the second node comprises a second activation value for the second node.

21. The computer system of claim 17 , wherein the regularization cost term is a squared difference between the node state of the first node and the node state of the second node.

22. The computer system of claim 21 , wherein the regularization cost term is multiplied by a hyperparameter that controls a strength of the regularization.

23. The computer system of claim 17 , wherein the regularization cost term is an absolute difference between the node state of the first node and the node state of the second node.

24. The computer system of claim 17 , wherein the regularization cost term is multiplied by a hyperparameter that controls a strength of the regularization.

25. The computer system of claim 17 , wherein the first neural network and the second neural network have different architectures.

26. The computer system of claim 17 , wherein the computer memory stores further instructions that when executed by the one or more processors cause the one or more processors to, prior to iterative training the first neural network, iteratively train, via machine learning, the second neural network to convergence.

27. The computer system of claim 17 , wherein updating the learned parameters comprises updating the learned parameters via stochastic gradient descent.

28. The computer system of claim 17 , wherein updating the learned parameters comprises updating the learned parameters via gradient descent.

29. The computer system of claim 17 , wherein the first node is an output node of the first neural network and the second node is an output node of the second neural network.

30. The computer system of claim 17 , wherein the first node is a labeled feature node of the first neural network and the second node is a labeled feature node of the second neural network.

31. The computer system of claim 17 , wherein the computer memory stores further instructions that when executed by the one or more processors cause the one or more processors to, after iterative training the first neural network, merge the first and second neural networks.

32. The computer system of claim 17 , wherein the first and second neural networks are members of an ensemble.

33. The computer system of claim 17 , wherein the one or more processor cores comprise a first set of one or more graphical processing units (GPUs) and a second set of one or more graphical processing units, wherein the first and second sets of GPUs process the training data items in the set of training data items in parallel.

Continuity (7)
Continuation 18947318 · Nov 14, 2024
Continuation 18352044 · Jul 13, 2023
Continuation 16929900 · Jul 15, 2020
Continuation 16767966
Provisional Application 62647085 · Mar 23, 2018
Provisional Application 62623773 · Jan 30, 2018
Related Publication 20250232175A1 · Jul 17, 2025
References Cited (65)
US 5701398A · Glier et al. · 1997 [cited by applicant]
US 10832137B2 · Baker et al. · 2020 [cited by applicant]
US 10832138B2 · Choi · 2020 [cited by applicant]
US 10839294B2 · Baker · 2020 [cited by applicant]
US 10929757B2 · Baker et al. · 2021 [cited by applicant]
US 11010671B2 · Baker et al. · 2021 [cited by applicant]
US 11074499B2 · Burr · 2021 [cited by applicant]
US 11087217B2 · Baker et al. · 2021 [cited by applicant]
US 11093830B2 · Baker et al. · 2021 [cited by applicant]
US 11151455B2 · Baker et al. · 2021 [cited by applicant]
US 11321612B2 · Baker et al. · 2022 [cited by applicant]
US 11386330B2 · Baker · 2022 [cited by applicant]
US 11410050B2 · Baker · 2022 [cited by applicant]
US 11461655B2 · Baker et al. · 2022 [cited by applicant]
US 11461661B2 · Baker · 2022 [cited by applicant]
US 11610130B2 · Baker · 2023 [cited by applicant]
US 20040015459A1 · Jaeger · 2004 [cited by applicant]
US 20040073096A1 · Kates et al. · 2004 [cited by applicant]
US 20040128004A1 · Adams et al. · 2004 [cited by applicant]
US 20040260662A1 · Staelin et al. · 2004 [cited by applicant]
US 20050283450A1 · Matsugu et al. · 2005 [cited by applicant]
US 20080065572A1 · Abe et al. · 2008 [cited by applicant]
US 20080069437A1 · Baker · 2008 [cited by applicant]
US 20080154820A1 · Kirshenbaum et al. · 2008 [cited by applicant]
US 20150019467A1 · Nugent · 2015 [cited by applicant]
US 20160110642A1 · Matsuda et al. · 2016 [cited by applicant]
US 20160342904A1 · Merkel · 2016 [cited by applicant]
US 20170105791A1 · Yates et al. · 2017 [cited by applicant]
US 20180174051A1 · Knittel · 2018 [cited by examiner]
US 20190325343A1 · Feng et al. · 2019 [cited by applicant]
US 20200242466A1 · Mohassel · 2020 [cited by applicant]
WO 2018175098A1 · 2018 [cited by applicant]
WO 2018194960A1 · 2018 [cited by applicant]
WO 2018226492A1 · 2018 [cited by applicant]
WO 2018226527A1 · 2018 [cited by applicant]
WO 2018231708A2 · 2018 [cited by applicant]
WO 2019005507A1 · 2019 [cited by applicant]
WO 2019005611A1 · 2019 [cited by applicant]
WO 2019067236A1 · 2019 [cited by applicant]
WO 2019067248A1 · 2019 [cited by applicant]
WO 2019067281A1 · 2019 [cited by applicant]
WO 2019067542A1 · 2019 [cited by applicant]
WO 2019067831A1 · 2019 [cited by applicant]
WO 2019067960A1 · 2019 [cited by applicant]
WO 2019152308A1 · 2019 [cited by applicant]
WO 2020005471A1 · 2020 [cited by applicant]
WO 2020009881A1 · 2020 [cited by applicant]
WO 2020009912A1 · 2020 [cited by applicant]
WO 2020018279A1 · 2020 [cited by applicant]
WO 2020028036A1 · 2020 [cited by applicant]
WO 2020033645A1 · 2020 [cited by applicant]
WO 2020036847A1 · 2020 [cited by applicant]
WO 2020041026A1 · 2020 [cited by applicant]
WO 2020046719A1 · 2020 [cited by applicant]
WO 2020046721A1 · 2020 [cited by applicant]
Glacet et al., The impact of Edge Deletions on the No. of Errors in Networks, In: OPODIS'11 Proceedings of the 15th International Conference on Principles of Distributed System, Dec. 13-16, 2011; https://www.researchgat… [cited by applicant]
International Search Report and Written Opinion for International PCT Application No. PCT/US2019/015389, dated Apr. 25, 2019. [cited by applicant]
International Preliminary Report on Patentability for International PCT Application No. PCT/US2019/015389, dated Sep. 4, 2020. [cited by applicant]
Fu, Li-Min, and Li-Chen Fu. “Mapping rule-based systesm into neural architecture.” Knowledge-Based Systems 3, No. 1 (1990):48-56 (Year: 1990). [cited by applicant]
Petrowski, A. “Choosing among several parallel implementations of the backpropagation algorithm.” In Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94), vol. 3, pp. 1981-1986. IEEE, 1994. (Ye… [cited by applicant]
Lehtokangas, M. (1999). Modelling with constructive backpropagation. Neural Networks, 12(4-5), 707-716. (Year: 1999). [cited by applicant]
Rojas, Raul. “The backpropagation algorithm.” In Neural networks, pp. 149-182. Springer, Berlin, Heidelberg, 1996. (Year: 1996). [cited by applicant]
Valle M. Analog VLSI implementation of artificial neural networks with supervised on-chip learning. Analog Integrated Circuits and Signal Processing. Dec. 2002;33:263-87. (Year: 2002). [cited by applicant]
Sumpter BG, Getino C, Noid DW. Theory and applications of neural computing in chemical science. Annual Review of Physical Chemistry. Oct. 1994; 45(1):439-81. (Year: 1994). [cited by applicant]
Sethi K. Entropy nets: from decision trees to neural networks. Proceedings of the IEEE. Oct. 1990; 78(10):1605-13. (Year: 1990). [cited by applicant]