IP Library › Granted Patent US 12,711,385
Granted Patent B2
US 12,711,385 · App. 18/003,821 · Granted Aug 18, 2026

Neural network sparsification apparatus and method and related product

Inventors: Yufeng Gao (Xi'an, CN); Shibing Zhu (Xi'an, CN); Shaoli Liu (Xi'an, CN); Xishan Zhang (Xi'an, CN); Deyuan He (Xi'an, CN)
G06N3/084G06N3/082
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,711,385
App. No.
18/003,821
Filed
Dec 29, 2022
Granted
Aug 18, 2026
Kind
B2
Art Unit
2129
USPC
706/25
Abstract

The present disclosure relates to a method and apparatus for sparsification training of a neural network model, a board card, and a readable storage medium. The data processing apparatus of the present disclosure is implemented as a computing apparatus and included in a combined processing apparatus. The combined processing apparatus further includes an interface apparatus and other processing apparatus. The computing apparatus interacts with other processing apparatus to jointly complete a computing operation specified by a user. The combined processing apparatus further includes a storage apparatus. The storage apparatus is connected to the computing apparatus and other processing apparatus, respectively. The storage apparatus is used to store data of the computing apparatus and other processing apparatus. Embodiments of the present disclosure provide a solution related to the sparsification training of the neural network model, which improves operation ability of the neural network model and improves processing efficiency of a machine.

Claims (70)

1 . A method for sparsification training of a neural network model by a data processing apparatus, comprising:

performing sparsification processing on a neural network parameter based on a mask tensor to compute a value of a loss function in forward propagation;

computing a neuron gradient and a neural network parameter gradient based on the loss function in back propagation; and

updating the neural network parameter based on the neural network parameter gradient.

2 . The method of claim 1 , further comprising:

computing the neuron gradient and the neural network parameter gradient based on an unsparsified neural network parameter in the back propagation; and

updating the neural network parameter based on the neural network parameter gradient.

3 . The method of claim 2 , further comprising:

performing anti-sparsification processing on a sparsified neural network parameter to obtain the unsparsified neural network parameter.

4 . The method of claim 1 , further comprising:

computing the neuron gradient and the neural network parameter gradient based on the neural network parameter sparsified in the back propagation; and

updating the neural network parameter based on the neuron gradient.

5 . The method of claim 4 , further comprising:

performing sparsification processing on the neural network parameter based on a reverse mask tensor to obtain the neural network parameter sparsified in the back propagation.

6 . The method of claim 5 , wherein the mask tensor is a two-dimensional tensor, wherein the two-dimensional tensor performs sparsification processing on an input channel dimension of the neural network parameter and an output channel dimension of the neural network parameter, and wherein the reverse mask tensor is generated by performing a dimension conversion on the mask tensor.

7 . The method of claim 1 , wherein the mask tensor is a one-dimensional tensor, and wherein the one-dimensional tensor performs sparsification processing on an input channel dimension of the neural network parameter.

8 . The method of claim 1 , wherein the updating the neural network parameter comprises updating an unsparsified neural network parameter;

wherein the method further comprises generating the mask tensor based on the updated unsparsified neural network parameter;

wherein when the mask tensor is a one-dimensional tensor, the method generates the mask tensor by:

selecting n data elements with relatively large absolute values as valid data elements from every m data elements of a specified dimension of the neural network parameter, wherein m>n; and

determining the mask tensor based on positions of n valid data elements in the m data elements;

and wherein when the mask tensor is a two-dimensional tensor, the method generates the mask tensor by:

presetting a specific number of two-dimensional mask tensors, wherein each dimension of the two-dimensional mask tensors comprises m elements, of which n elements are 1, m-n elements are 0, and m>n;

masking two specified dimensions of the neural network parameter respectively based on each preset two-dimensional mask tensor to obtain a masked parameter tensor;

performing a product sum operation on training data of a neural network based on each masked parameter tensor to obtain a parameter evaluation value; and

selecting a two-dimensional mask tensor that generates the largest of all parameter evaluation values as the mask tensor.

9 . The method of claim 1 , wherein the method is performed in multiple iterations in a mask adjustment phase of sparsification training; wherein the mask adjustment phase further comprises:

obtaining a percentage of element values of the mask tensor that are not changed in all element values of the mask tensor, and determining whether the percentage reaches a threshold in multiple consecutive iterative training; and

ending the mask adjustment phase if the percentage that all element values of the mask tensor are not changed reaches the threshold in the multiple consecutive iterative training;

and wherein the threshold is one of 80%, 90%, and 100%.

10 . The method of claim 1 , wherein the method is performed in multiple iterations in a mask fixing phase of sparsification training, and the mask tensor is fixed as a mask tensor that is finally determined in a previous phase;

wherein updating the neural network parameter comprises:

using the mask tensor to perform sparsification processing on the neuron gradient; and

updating the sparsified neural network parameter based on the sparsified neuron gradient;

and wherein during the mask fixing phase, fixed mask tensors and the sparsified neural network parameter are stored, or fixed mask tensors and unsparsified neural network parameter are stored.

11 . A data processing apparatus, comprising a control circuit, a storage circuit, and an operation circuit, wherein

the control circuit is configured to control the storage circuit and the operation circuit to perform sparsification training on a neural network model;

the storage circuit is configured to store information, wherein the information comprises a neural network parameter and a mask tensor; and

the operation circuit is configured to perform following operations under the control of the control circuit:

performing sparsification processing on the neural network parameter based on the mask tensor to compute a value of a loss function in forward propagation;

computing a neuron gradient and a neural network parameter gradient based on the loss function in back propagation; and

updating the neural network parameter based on the neural network parameter gradient.

12 . The apparatus of claim 11 , wherein the operation circuit is further configured to:

compute the neuron gradient and the neural network parameter gradient based on an unsparsified neural network parameter in the back propagation; and

update the neural network parameter based on the neural network parameter gradient.

13 . The apparatus of claim 12 , wherein the operation circuit is further configured to:

perform anti-sparsification processing on a sparsified neural network parameter to obtain the unsparsified neural network parameter.

14 . The apparatus of claim 11 , wherein the operation circuit is further configured to:

compute the neuron gradient and the neural network parameter gradient based on the neural network parameter sparsified in the back propagation; and

update the neural network parameter based on the neuron gradient.

15 . The apparatus of claim 14 , wherein the operation circuit is further configured to:

perform sparsification processing on the neural network parameter based on a reverse mask tensor to obtain the neural network parameter sparsified in the back propagation.

16 . The apparatus of claim 15 , wherein the mask tensor is a two-dimensional tensor, wherein the two-dimensional tensor performs sparsification processing on an input channel dimension of the neural network parameter and an output channel dimension of the neural network parameter, and wherein when the mask tensor is a two-dimensional tensor, the reverse mask tensor is generated by performing a dimension conversion on the mask tensor by the operational circuit.

17 . The apparatus of claim 11 , wherein the mask tensor is a one-dimensional tensor and wherein the one-dimensional tensor performs sparsification processing on an input channel dimension of the neural network parameter.

18 . The apparatus of claim 11 , wherein the operation circuit is further configured to:

update an unsparsified neural network parameter and generate the mask tensor based on the updated unsparsified neural network parameter;

wherein when the mask tensor is a one-dimensional tensor, the operation circuit is configured to generate the mask tensor by:

selecting n data elements with relatively large absolute values as valid data elements from every m data elements of a specified dimension of the neural network parameter, wherein m>n; and

determining the mask tensor based on positions of n valid data elements in the m data elements;

and wherein when the mask tensor is a two-dimensional tensor, the operation circuit is configured to generate the mask tensor by:

presetting a specific number of two-dimensional mask tensors, wherein each dimension of the two-dimensional mask tensors comprises m elements, of which n elements are 1, m-n elements are 0, and m>n;

masking two specified dimensions of the neural network parameter respectively based on each preset two-dimensional mask tensor to obtain a masked parameter tensor;

performing a product sum operation on training data of a neural network based on each masked parameter tensor to obtain a parameter evaluation value; and

selecting a two-dimensional mask tensor that generates the largest of all parameter evaluation values as the mask tensor.

19 . The apparatus of claim 11 , wherein the operation circuit is configured to perform operations in multiple iterations in a mask adjustment phase of sparsification training;

wherein the operation circuit is further configured to:

in the mask adjustment phase, obtaining a percentage of element values of the mask tensor are not changed in all element values of the mask tensor, and determining whether the percentage reaches a threshold in multiple consecutive iterative training; and

end the mask adjustment phase if the percentage that all element values of the mask tensor are not changed reaches the threshold in the multiple consecutive iterative training;

and wherein the threshold is one of 80%, 90%, and 100%.

20 . A chip, comprising the data processing apparatus of claim 11 .

Priority Claims (2)
CN 202011216903.5 · Nov 4, 2020 · national
CN 202011563259.9 · Dec 25, 2020 · national
Continuity (1)
Related Publication 20230259780A1 · Aug 17, 2023
References Cited (254)
US 5052043A · Gaborski · 1991 [cited by applicant]
US 6144977A · Giangarra et al. · 2000 [cited by applicant]
US 6671796B1 · Sudharsanan et al. · 2003 [cited by applicant]
US 6715065B1 · Ebata et al. · 2004 [cited by applicant]
US 6931639B1 · Eickemeyer · 2005 [cited by applicant]
US 7236995B2 · Hinds · 2007 [cited by applicant]
US 7242414B1 · Thekkath et al. · 2007 [cited by applicant]
US 7406451B2 · Mrziglod et al. · 2008 [cited by applicant]
US 7721128B2 · Johns et al. · 2010 [cited by applicant]
US 7945607B2 · Hinds · 2011 [cited by applicant]
US 8051117B2 · Lundvall et al. · 2011 [cited by applicant]
US 8190664B2 · Lundvall et al. · 2012 [cited by applicant]
US 8560591B2 · Lundvall et al. · 2013 [cited by applicant]
US 8694572B2 · Samy et al. · 2014 [cited by applicant]
US 8762438B2 · Lundvall et al. · 2014 [cited by applicant]
US 8924455B1 · Barman et al. · 2014 [cited by applicant]
US 9412366B2 · Wilensky et al. · 2016 [cited by applicant]
US 10187568B1 · Tran et al. · 2019 [cited by applicant]
US 10224954B1 · Madduri et al. · 2019 [cited by applicant]
US 10360304B1 · Alvarez et al. · 2019 [cited by applicant]
US 10427306B1 · Quinlan et al. · 2019 [cited by applicant]
US 10656942B2 · Madduri et al. · 2020 [cited by applicant]
US 10929744B2 · Li et al. · 2021 [cited by applicant]
US 20020138714A1 · Leibholz et al. · 2002 [cited by applicant]
US 20030167460A1 · Desai et al. · 2003 [cited by applicant]
US 20050138327A1 · Tabei · 2005 [cited by applicant]
US 20060161375A1 · Duberstein et al. · 2006 [cited by applicant]
US 20070220076A1 · Hinds · 2007 [cited by applicant]
US 20080148120A1 · Seuring · 2008 [cited by applicant]
US 20090113186A1 · Kato et al. · 2009 [cited by applicant]
US 20090125293A1 · Lefurgy et al. · 2009 [cited by applicant]
US 20100073068A1 · Cho et al. · 2010 [cited by applicant]
US 20110060587A1 · Phillips et al. · 2011 [cited by applicant]
US 20110301777A1 · Cox et al. · 2011 [cited by applicant]
US 20120316845A1 · Grey et al. · 2012 [cited by applicant]
US 20130054110A1 · Sata · 2013 [cited by applicant]
US 20130332610A1 · Beveridge · 2013 [cited by applicant]
US 20140081625A1 · Wilensky et al. · 2014 [cited by applicant]
US 20140164737A1 · Collange et al. · 2014 [cited by applicant]
US 20140249814A1 · Nakano et al. · 2014 [cited by applicant]
US 20150134581A1 · Doeding et al. · 2015 [cited by applicant]
US 20150370303A1 · Krishnaswamy et al. · 2015 [cited by applicant]
US 20160026231A1 · Ignowski et al. · 2016 [cited by applicant]
US 20160054922A1 · Awasthi et al. · 2016 [cited by applicant]
US 20160124710A1 · Lutz et al. · 2016 [cited by applicant]
US 20160170866A1 · Ioualalen et al. · 2016 [cited by applicant]
US 20160328645A1 · Lin et al. · 2016 [cited by applicant]
US 20170061279A1 · Yang et al. · 2017 [cited by applicant]
US 20170090956A1 · Linsky · 2017 [cited by applicant]
US 20170103022A1 · Kreinin et al. · 2017 [cited by applicant]
US 20170142327A1 · Bayani · 2017 [cited by applicant]
US 20170161604A1 · Craddock et al. · 2017 [cited by applicant]
US 20170221176A1 · Munteanu et al. · 2017 [cited by applicant]
US 20170257079A1 · Jain et al. · 2017 [cited by applicant]
US 20170262959A1 · Lee et al. · 2017 [cited by applicant]
US 20170316307A1 · Koster et al. · 2017 [cited by applicant]
US 20170316312A1 · Goyal et al. · 2017 [cited by applicant]
US 20170344882A1 · Ambrose et al. · 2017 [cited by applicant]
US 20170353163A1 · Gazneli et al. · 2017 [cited by applicant]
US 20170357530A1 · Shih et al. · 2017 [cited by applicant]
US 20170357910A1 · Sommer et al. · 2017 [cited by applicant]
US 20180046903A1 · Yao et al. · 2018 [cited by applicant]
US 20180088996A1 · Rossi et al. · 2018 [cited by applicant]
US 20180096243A1 · Patil et al. · 2018 [cited by applicant]
US 20180157464A1 · Lutz et al. · 2018 [cited by applicant]
US 20180288440A1 · Chao · 2018 [cited by applicant]
US 20180293517A1 · Browne et al. · 2018 [cited by applicant]
US 20180300931A1 · Vembu et al. · 2018 [cited by applicant]
US 20180322391A1 · Wu et al. · 2018 [cited by applicant]
US 20180357541A1 · Chen et al. · 2018 [cited by applicant]
US 20180367729A1 · Parasnis et al. · 2018 [cited by applicant]
US 20180373976A1 · Woo · 2018 [cited by applicant]
US 20190034784A1 · Li et al. · 2019 [cited by applicant]
US 20190042925A1 · Choe et al. · 2019 [cited by applicant]
US 20190050710A1 · Wang et al. · 2019 [cited by applicant]
US 20190057696A1 · Ogawa · 2019 [cited by applicant]
US 20190114142A1 · Yoda et al. · 2019 [cited by applicant]
US 20190122094A1 · Chen et al. · 2019 [cited by applicant]
US 20190122119A1 · Husain · 2019 [cited by applicant]
US 20190138372A1 · Tee · 2019 [cited by applicant]
US 20190164285A1 · Nye et al. · 2019 [cited by applicant]
US 20190180170A1 · Huang et al. · 2019 [cited by applicant]
US 20190199370A1 · Madduri et al. · 2019 [cited by applicant]
US 20190205737A1 · Bleiweiss et al. · 2019 [cited by applicant]
US 20190205746A1 · Nurvitadhi et al. · 2019 [cited by applicant]
US 20190220734A1 · Ferdman et al. · 2019 [cited by applicant]
US 20190228762A1 · Wang et al. · 2019 [cited by applicant]
US 20190251429A1 · Du et al. · 2019 [cited by applicant]
US 20190265949A1 · Ito · 2019 [cited by applicant]
US 20190278677A1 · Terechko et al. · 2019 [cited by applicant]
US 20190294968A1 · Vantrease et al. · 2019 [cited by applicant]
US 20190339937A1 · Lo et al. · 2019 [cited by applicant]
US 20200005424A1 · Appu et al. · 2020 [cited by applicant]
US 20200097799A1 · Divakar et al. · 2020 [cited by applicant]
US 20200117453A1 · Zhang et al. · 2020 [cited by applicant]
US 20200117614A1 · Zhang et al. · 2020 [cited by applicant]
US 20200125508A1 · Liu et al. · 2020 [cited by applicant]
US 20200126554A1 · Chen et al. · 2020 [cited by applicant]
US 20200126555A1 · Chen et al. · 2020 [cited by applicant]
US 20200142748A1 · Liu et al. · 2020 [cited by applicant]
US 20200159527A1 · Zhang et al. · 2020 [cited by applicant]
US 20200159530A1 · Zhang et al. · 2020 [cited by applicant]
US 20200159531A1 · Zhang et al. · 2020 [cited by applicant]
US 20200159532A1 · Zhang et al. · 2020 [cited by applicant]
US 20200159533A1 · Zhang et al. · 2020 [cited by applicant]
US 20200159534A1 · Li et al. · 2020 [cited by applicant]
US 20200160162A1 · Zhang et al. · 2020 [cited by applicant]
US 20200160163A1 · Liu et al. · 2020 [cited by applicant]
US 20200160219A1 · Zhang et al. · 2020 [cited by applicant]
US 20200160220A1 · Zhang et al. · 2020 [cited by applicant]
US 20200160221A1 · Zhang et al. · 2020 [cited by applicant]
US 20200160222A1 · Zhang et al. · 2020 [cited by applicant]
US 20200168227A1 · Chen et al. · 2020 [cited by applicant]
US 20200174547A1 · Fang et al. · 2020 [cited by applicant]
US 20200183752A1 · Liu et al. · 2020 [cited by applicant]
US 20200241874A1 · Chen et al. · 2020 [cited by applicant]
US 20200257972A1 · Miniskar et al. · 2020 [cited by applicant]
US 20200334041A1 · Zhang et al. · 2020 [cited by applicant]
US 20200334522A1 · Zhang et al. · 2020 [cited by applicant]
US 20200334572A1 · Zhang et al. · 2020 [cited by applicant]
US 20200394522A1 · Liu et al. · 2020 [cited by applicant]
US 20200394523A1 · Liu et al. · 2020 [cited by applicant]
US 20210042889A1 · Pei · 2021 [cited by applicant]
US 20210061028A1 · Da Deppo et al. · 2021 [cited by applicant]
US 20210117768A1 · Liu et al. · 2021 [cited by applicant]
US 20210117810A1 · Liu · 2021 [cited by applicant]
US 20210150362A1 · Zhang · 2021 [cited by examiner]
US 20210182177A1 · Su et al. · 2021 [cited by applicant]
US 20210264270A1 · Liu et al. · 2021 [cited by applicant]
US 20210334007A1 · Liu et al. · 2021 [cited by applicant]
US 20210334137A1 · Zhang et al. · 2021 [cited by applicant]
US 20210341989A1 · Chen et al. · 2021 [cited by applicant]
US 20210374510A1 · Liu et al. · 2021 [cited by applicant]
US 20210374511A1 · Liu et al. · 2021 [cited by applicant]
US 20220230069A1 · Gao et al. · 2022 [cited by applicant]
CN 1503858A · 2004 [cited by applicant]
CN 1503958A · 2004 [cited by applicant]
CN 1851668A · 2006 [cited by applicant]
CN 101572829A · 2009 [cited by applicant]
CN 102270042A · 2011 [cited by applicant]
CN 102404673A · 2012 [cited by applicant]
CN 102684701A · 2012 [cited by applicant]
CN 102761509A · 2012 [cited by applicant]
CN 102789413A · 2012 [cited by applicant]
CN 102903089A · 2013 [cited by applicant]
CN 102981854A · 2013 [cited by applicant]
CN 103152673A · 2013 [cited by applicant]
CN 104914977A · 2015 [cited by applicant]
CN 105389158A · 2016 [cited by applicant]
CN 105426344A · 2016 [cited by applicant]
CN 103534664A · 2016 [cited by applicant]
CN 105893419A · 2016 [cited by applicant]
CN 105978611A · 2016 [cited by applicant]
CN 106156310A · 2016 [cited by applicant]
CN 106354568A · 2017 [cited by applicant]
CN 106406812A · 2017 [cited by applicant]
CN 106469291A · 2017 [cited by applicant]
CN 106485316A · 2017 [cited by applicant]
CN 106502626A · 2017 [cited by applicant]
CN 106570559A · 2017 [cited by applicant]
CN 106650922A · 2017 [cited by applicant]
CN 106814639A · 2017 [cited by applicant]
CN 106951587A · 2017 [cited by applicant]
CN 106951962A1 · 2017 [cited by applicant]
CN 106997236A · 2017 [cited by applicant]
CN 107003988A · 2017 [cited by applicant]
CN 107025629A · 2017 [cited by applicant]
CN 107316078A · 2017 [cited by applicant]
CN 107330515A · 2017 [cited by applicant]
CN 107368174A · 2017 [cited by applicant]
CN 107451654A · 2017 [cited by applicant]
CN 107451658A · 2017 [cited by applicant]
CN 107608715A · 2018 [cited by applicant]
CN 107644254A · 2018 [cited by applicant]
CN 107688855A · 2018 [cited by applicant]
CN 107797913A · 2018 [cited by applicant]
CN 107886164A · 2018 [cited by applicant]
CN 108053028A · 2018 [cited by applicant]
CN 104899641A · 2018 [cited by applicant]
CN 108337000A · 2018 [cited by applicant]
CN 108510067A · 2018 [cited by applicant]
CN 108717570A · 2018 [cited by applicant]
CN 109062540A · 2018 [cited by applicant]
CN 109063820A · 2018 [cited by applicant]
CN 109213962A · 2019 [cited by applicant]
CN 109902745A · 2019 [cited by applicant]
CN 109934331A · 2019 [cited by applicant]
CN 109993296A · 2019 [cited by applicant]
CN 110059733A · 2019 [cited by applicant]
CN 110163350A · 2019 [cited by applicant]
CN 11055450A · 2019 [cited by applicant]
CN 110780845A · 2020 [cited by applicant]
CN 111652366A · 2020 [cited by applicant]
EP 0789296A1 · 1997 [cited by applicant]
EP 2703945A2 · 2014 [cited by applicant]
EP 3106997A2 · 2016 [cited by applicant]
EP 3407268A1 · 2018 [cited by applicant]
JP H03075860A · 1989 [cited by applicant]
JP H09265379A · 1997 [cited by applicant]
JP 2009134433A · 2012 [cited by applicant]
JP 2013514570A · 2013 [cited by applicant]
JP 2014199464A · 2014 [cited by applicant]
JP 2015176158A · 2015 [cited by applicant]
JP 201826114A · 2018 [cited by applicant]
JP 2019519852A · 2019 [cited by applicant]
WO 2008153194A1 · 2008 [cited by applicant]
WO 2014199464A1 · 2014 [cited by applicant]
WO 2016186823A1 · 2016 [cited by applicant]
WO 2017138220A1 · 2017 [cited by applicant]
WO 2017185412A1 · 2017 [cited by applicant]
WO 2020097217A1 · 2020 [cited by applicant]
Kalchbrenner, Nal, et al. “Efficient neural audio synthesis.” International Conference on Machine Learning. PMLR, 2018. (Year: 2018). [cited by examiner]
Liu, Junjie, et al. “Dynamic sparse training: Find efficient sparse network from scratch with trainable masked layers.” arXiv preprint arXiv:2005.06870 (2020). (Year: 2020). [cited by examiner]
Lemaire et al., “Structured Pruning of Neural Networks with Budget-Aware Regularization”, ArXiv: 1811.09332v3 [cs.NE] Dec. 19, 2019 (Year: 2019). [cited by applicant]
Ng, A, “CS294A Course Notes—Sparse Autoencoder,” downloaded from <https://web.stanford.edu/class/cs294a/sparseAutoencoder_2011 new.pdf> and verified online at least as of Feb. 19, 2015 via <https://web.archive.org/web/2… [cited by applicant]
Lin et al., “Towards Optimal Structured CNN Pruning via Generative Adversarial Learning” arXiv:1903.09291v1 [cs.CV] Mar. 22, 2019 (Year: 2019). [cited by applicant]
Wang et al., “Structured Pruning for Efficient Convolutional Neural Networks via Incremental Regularization” IEEE Journal of Selected Topics in Signal Processing, vol. 14, No. 4, May 2020 (Year: 2020). [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/557,802, mailed Jul. 14, 2025, 45 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/557,802, mailed Sep. 18, 2025, 45 pages. [cited by applicant]
Vivienne Sze et al., “Efficient Processing of Deep Neural Networks: A Tutorial and Survey”, arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Mar. 27, 2017 (Mar. 27, 2017), XP0… [cited by applicant]
Liu Shaoli et al., “Cambricon: An Instruction Set Architecture for Neural Networks”, 2013 21st International Conference on Program Comprehension (ICPC); [International Symposium on Computer Architecture.(ISCA)], IEEE, U… [cited by applicant]
IBM, “PowerPC Microprocessor Family: Vector/SIMD Multimedia Extension Technology Programming Environments Manual Programming Environments Manual”, Aug. 22, 2005 (Aug. 22, 2005), pp. 170-171, XP055673033, Retrieved from … [cited by applicant]
Sumod Mohan, “Accuracy and Multi-Core Performance of Machine Learning Algorithms for Handwritten Character Recognition”, Aug. 1, 2009 (Aug. 1, 2009), XP055673941, Retrieved from the Internet: URL:https://tigerprints.cle… [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212749.6 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212750.4 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212751.2 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212752.0 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19214004.4 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19213389.0 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212753.8 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212754.6 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212755.3 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212756.1 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 18906652.6 dated Mar. 18, 2020. [cited by applicant]
European Patent Office, Extended European Search Report for European Application No. 19212746.2 dated Mar. 18, 2020. [cited by applicant]
Kalathingal Sajith et al., “Dynamic Inter-Thread Vectorization Architecture: Extracting OLP from TLP”, 2016 28th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), IEEE, Oct. 26,… [cited by applicant]
Li et al., “Using Artificial Neural Network for Predicting Thread Partitioning in Speculative Multithreading”, IEEE, 2015, pp. 823-826. [cited by applicant]
Na et al., “Speeding up Convolutional Neural Network Training with Dynamic Precision Scaling and Flexible MultiplierAccumulator”, Section 2 Proposed Approach: Concept, ACM, Aug. 8-10, 2016, 6 pages. [cited by applicant]
Hanlon, Jamie, “Why is so much memory needed for deep neural networks?”, URL: https://www.graphcore.ai/posts/why-is-so-much-memory-needed-for-deep-neural-networks, Jan. 31, 2017, 6 pages. [cited by applicant]
Anonymous, “Control unit—Wikipedia”, May 8, 2017 (May 8, 2017), XP055673879, Retrieved from the Internet: URL: https://web.archive.org/web/20170508110348/https://en.wikipedia.org/ wiki/Control unit [retrieved on Mar. 5,… [cited by applicant]
Joel Emer et al., “DNN Accelerator Architectures”, CICS/MTL Tutorial, Jan. 1, 2017 (Jan. 1, 2017), XP055672691, Retrieved from the Internet: URL:https://www.rle.mit.edu/eems/wp-content/uploads/2017/031Tutorial-on-JNN-4-… [cited by applicant]
Chen Yu-Hsin et al., “Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural getworks”, IEEE Journal of Solid-State Circuits, IEEE, USA, vol. 52, No. 1, Jan. 1, 2017 (Jan. 1, 2017), pp. 12… [cited by applicant]
Pedro O. Domingos, et al., “An Efficient and Scalable Architecture for Neural Networks With Backpropagation Learning” Proceedings/ 2005 International Conference on Field Programmable Logic and Applications {FPL): Tamper… [cited by applicant]
Hsu Jeremy, “For sale: deep learning [News]”, IEEE Spectrum, IEEE Inc. New York, US, vol. 53, No. 8, Aug. 1, 2016 (Aug. 1, 2016), pp. 12-13, XP011620787, ISSN: 0018-9235, DOI: 10.1109/MSPEC.2016.7524158 [retrieved on Ju… [cited by applicant]
Song Mingcong et al., “In-Situ AI: Towards Autonomous and Incremental Deep Leaming for IoT Systems”, 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA), IEEE, Feb. 24, 2018 (Feb. 24, 2018… [cited by applicant]
Kallam Suresh et al., “Evaluating the Performance of Deep Learning Techniques on Classification Using Tensor Flow Application”, 2018 International Conference on Advances in Computing and Communication Engineering (ICACC… [cited by applicant]
Olariu Cristian et al., “A Cloud-Based AI Framework for Machine Learning Orchestration: A “Driving or Not-Driving” Case-Study for Self-Driving Cars”, 2019 IEEE Intelligent Vehicles Symposium (IV). IEEE, Jun. 9, 2019 (Ju… [cited by applicant]
European Patent Office, extended European search report for Application No. 19216754.2 mailed May 8, 2020. [cited by applicant]
Extended European Search Report for EP Application No. 19214324.6 mailed Oct. 1, 2020. [cited by applicant]
International Searching Authority, International Search Report for PCT Application No. PCT/CN2019/093144 mailed Oct. 9, 2019. [cited by applicant]
Extended European Search Report for Application No. 19215861.6 mailed May 15, 2020. [cited by applicant]
Extended European Search Report for Application No. 19215862.4 mailed May 15, 2020. [cited by applicant]
Sumina Yamashita, et al., “A Method to create illustrate images using DCGAN,” JISJ SIG Technical Report, vol. 2017-MPS-112 No. 16, Feb. 27, 2017; translation of abstract included. [cited by applicant]
A Framework for Algorithm Deployment on Cloud-based Quantum Computers; arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Dated Oct. 24, 2018; pp. 1-10. [cited by applicant]