IP Library Granted Patent US 12,260,337
Granted Patent B2
US 12,260,337 · App. 18/312,011 · Granted Mar 25, 2025

Performing inference and training using sparse neural network

Inventors: Subutai Ahmad (Palo Alto, CA); Luiz Scheinkman (Sunnyvale, CA)
Assignee: Numenta, Inc.
G06N3/084G06N3/04
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,260,337
App. No.
18/312,011
Granted
Mar 25, 2025
Kind
B2
Abstract

An inference system trains and performs inference using a sparse neural network. The sparse neural network may include one or more layers, and each layer may be associated with a set of sparse weights that represent sparse connections between nodes of a layer and nodes of a previous layer. A layer output may be generated by applying the set of sparse weights associated with the layer to the layer output of a previous layer. Moreover, the one or more layers of the sparse neural network may generate sparse layer outputs. By using sparse representations of weights and layer outputs, robustness and stability of the neural network can be significantly improved, while maintaining competitive accuracy.

Claims (41)

1. A method, comprising:

receiving input data by a neural network including a plurality of layers of nodes including a current layer and a previous layer;

generating a layer output of the previous layer based at least on the input data;

increasing sparsity of a set of weights that represents connections between nodes of the current layer and nodes of the previous layer to generate a sparsified set of weights that indicates each of the nodes of the current layer as having a predetermined number of connections to the nodes of the previous layer;

applying, to the layer output of the previous layer, the sparsified set of weights;

generating intermediate outputs for the current layer by applying the set of weights for the current layer to a layer output of the previous layer; and

generating a layer output for nodes of the current layer by increasing sparsity of the intermediate outputs.

2. The method of claim 1 , wherein the generating of the layer output comprises:

selecting intermediate outputs having values above a value or within a percentage of highest values, and

setting values of the selected intermediate outputs as values of corresponding nodes of the current layer.

3. The method of claim 2 , wherein generating of the layer output further comprises:

setting, to zero, values of nodes of the current layer corresponding to non-selected intermediate outputs.

4. The method of claim 1 , further comprising backpropagating error terms to update the set of weights, wherein the error terms are derived from the layer output and training data corresponding to the input data.

5. The method of claim 4 , further comprising determining a boosting term for each node of the current layer, the boosting term indicating how frequently the node was selected during previous iterations.

6. The method of claim 5 , wherein the boosting term increases as a duty cycle of each node increases and decreases as the duty cycle of each node decreases.

7. The method of claim 1 , wherein the neural network is a convolution neural network.

8. The method of claim 1 , wherein the neural network is implemented on field-programmable gate arrays.

9. A non-transitory computer readable storage medium storing instructions thereon, the instructions when executed by a processor cause the processor to:

receive input data by a neural network including a plurality of layers of nodes including a current layer and a previous layer;

generate a layer output of the previous layer based at least on the input data;

increase sparsity of a set of weights that represents connections between nodes of the current layer and nodes of the previous layer to generate a sparsified set of weights that indicates each of the nodes of the current layer as having a predetermined number of connections to the nodes of the previous layer;

apply, to the layer output of the previous layer, the sparsified set of weights;

generate intermediate outputs for the current layer by applying the set of weights for the current layer to a layer output of the previous layer; and

generate a layer output for nodes of the current layer by increasing sparsity of the intermediate outputs.

10. The non-transitory computer readable storage medium of claim 9 , wherein the instructions to generate the layer output comprises instructions to:

select intermediate outputs having values above a value or within a percentage of highest values; and

set values of the selected intermediate outputs as values of corresponding nodes of the current layer.

11. The non-transitory computer readable storage medium of claim 10 , wherein the instructions to generate the layer output comprises instructions to:

set, to zero, values of nodes of the current layer corresponding to non-selected intermediate outputs.

12. The non-transitory computer readable storage medium of claim 9 , further comprising instructions to backpropagate error terms to update the set of weights, wherein the error terms are derived from the layer output and training data corresponding to the input data.

13. The non-transitory computer readable storage medium of claim 12 , further comprising determining a boosting term for each node of the current layer, the boosting term indicating how frequently the node was selected during previous iterations.

14. The non-transitory computer readable storage medium of claim 13 , wherein the boosting term increases as a duty cycle of each node increases and decreases as the duty cycle of each node decreases.

15. The non-transitory computer readable storage medium of claim 9 , wherein the neural network is a convolution neural network.

16. A non-transitory storage medium storing a digital representation of a neural network, the neural network generated by:

receiving input data by a neural network including a plurality of layers of nodes including a current layer and a previous layer;

generating a layer output of the previous layer based at least on the input data;

increase sparsity of a set of weights that represents connections between nodes of the current layer and nodes of the previous layer to generate a sparsified set of weights that indicates each of the nodes of the current layer as having a predetermined number of connections to the nodes of the previous layer;

apply, to the layer output of the previous layer, the sparsified set of weights;

generating intermediate outputs for the current layer by applying the set of weights for the current layer to a layer output of the previous layer;

generating a layer output for nodes of the current layer by increasing sparsity of the intermediate outputs to be equal to or above a second threshold; and

backpropagating error terms to update the set of weights, wherein the error terms are derived from the layer output and training data corresponding to the input data.

Continuity (2)
Continuation 16696991 · Nov 26, 2019
Related Publication 20230274150A1 · Aug 31, 2023
References Cited (395)
US 4766534A · DeBenedictis · 1988 [cited by applicant]
US 4845744A · DeBenedictis · 1989 [cited by applicant]
US 5113507A · Jaeckel · 1992 [cited by applicant]
US 5255348A · Nenov · 1993 [cited by applicant]
US 5712953A · Langs · 1998 [cited by applicant]
US 5729661A · Keeler et al. · 1998 [cited by applicant]
US 5761389A · Maeda et al. · 1998 [cited by applicant]
US 6028608A · Jenkins · 2000 [cited by applicant]
US 6122014A · Panusopone et al. · 2000 [cited by applicant]
US 6144711A · Raleigh et al. · 2000 [cited by applicant]
US 6195622B1 · Altschuler et al. · 2001 [cited by applicant]
US 6400996B1 · Hoffberg et al. · 2002 [cited by applicant]
US 6468069B2 · Lemelson et al. · 2002 [cited by applicant]
US 6567814B1 · Banker et al. · 2003 [cited by applicant]
US 6615211B2 · Beygelzimer et al. · 2003 [cited by applicant]
US 6625585B1 · MacCuish et al. · 2003 [cited by applicant]
US 6714941B1 · Lerman et al. · 2004 [cited by applicant]
US 6751343B1 · Ferrell et al. · 2004 [cited by applicant]
US 6957241B2 · George · 2005 [cited by applicant]
US 7088693B2 · George · 2006 [cited by applicant]
US 7251637B1 · Caid et al. · 2007 [cited by applicant]
US 7308134B2 · Wersing et al. · 2007 [cited by applicant]
US 7430546B1 · Suri · 2008 [cited by applicant]
US 7613675B2 · Hawkins et al. · 2009 [cited by applicant]
US 7620608B2 · Jaros et al. · 2009 [cited by applicant]
US 7624085B2 · Hawkins et al. · 2009 [cited by applicant]
US 7676458B2 · Aggarwal et al. · 2010 [cited by applicant]
US 7739208B2 · George et al. · 2010 [cited by applicant]
US 7778946B2 · Hercus · 2010 [cited by applicant]
US 7826990B2 · Nasle et al. · 2010 [cited by applicant]
US 7840395B2 · Nasle et al. · 2010 [cited by applicant]
US 7840396B2 · Radibratovic et al. · 2010 [cited by applicant]
US 7844439B2 · Nasle et al. · 2010 [cited by applicant]
US 7844440B2 · Nasle et al. · 2010 [cited by applicant]
US 7899775B2 · George et al. · 2011 [cited by applicant]
US 7904412B2 · Saphir et al. · 2011 [cited by applicant]
US 7937342B2 · George et al. · 2011 [cited by applicant]
US 7941389B2 · Marianetti et al. · 2011 [cited by applicant]
US 7941392B2 · Saphir · 2011 [cited by applicant]
US 7958280B2 · Salessi et al. · 2011 [cited by applicant]
US 7983998B2 · George et al. · 2011 [cited by applicant]
US 8037010B2 · Jaros et al. · 2011 [cited by applicant]
US 8081209B2 · Ji et al. · 2011 [cited by applicant]
US 8102423B2 · Cheng · 2012 [cited by applicant]
US 8103603B2 · George et al. · 2012 [cited by applicant]
US 8112367B2 · George et al. · 2012 [cited by applicant]
US 8121961B2 · George et al. · 2012 [cited by applicant]
US 8175981B2 · Hawkins et al. · 2012 [cited by applicant]
US 8175984B2 · George · 2012 [cited by applicant]
US 8175985B2 · Sayfan et al. · 2012 [cited by applicant]
US 8195582B2 · Niemasik et al. · 2012 [cited by applicant]
US 8219507B2 · Jaros et al. · 2012 [cited by applicant]
US 8285667B2 · Jaros et al. · 2012 [cited by applicant]
US 8290886B2 · George et al. · 2012 [cited by applicant]
US 10515312B1 · Kubo · 2019 [cited by examiner]
US 11049013B1 · Duong · 2021 [cited by examiner]
US 11210586B1 · Duong · 2021 [cited by examiner]
US 11232349B2 · Busch · 2022 [cited by examiner]
US 11250326B1 · Ko · 2022 [cited by examiner]
US 20020002688A1 · Gregg et al. · 2002 [cited by applicant]
US 20020150044A1 · Wu et al. · 2002 [cited by applicant]
US 20020161736A1 · Beygelzimer et al. · 2002 [cited by applicant]
US 20030069002A1 · Hunter et al. · 2003 [cited by applicant]
US 20030123732A1 · Miyazaki et al. · 2003 [cited by applicant]
US 20030167111A1 · Kipersztok et al. · 2003 [cited by applicant]
US 20040002838A1 · Oliver et al. · 2004 [cited by applicant]
US 20040142325A1 · Mintz et al. · 2004 [cited by applicant]
US 20040148520A1 · Talpade et al. · 2004 [cited by applicant]
US 20040267395A1 · Discenzo et al. · 2004 [cited by applicant]
US 20050002572A1 · Saptharishi et al. · 2005 [cited by applicant]
US 20050028033A1 · Kipersztok et al. · 2005 [cited by applicant]
US 20050063565A1 · Nagaoka et al. · 2005 [cited by applicant]
US 20050190990A1 · Burt et al. · 2005 [cited by applicant]
US 20050222811A1 · Jakobson et al. · 2005 [cited by applicant]
US 20060093188A1 · Blake et al. · 2006 [cited by applicant]
US 20060161736A1 · Huang · 2006 [cited by applicant]
US 20060184462A1 · Hawkins · 2006 [cited by applicant]
US 20060212444A1 · Handman et al. · 2006 [cited by applicant]
US 20060235320A1 · Tan et al. · 2006 [cited by applicant]
US 20060248026A1 · Aoyama et al. · 2006 [cited by applicant]
US 20060248073A1 · Jones et al. · 2006 [cited by applicant]
US 20060253491A1 · Gokturk et al. · 2006 [cited by applicant]
US 20060259163A1 · Hsiung et al. · 2006 [cited by applicant]
US 20070005531A1 · George et al. · 2007 [cited by applicant]
US 20070019754A1 · Raleigh et al. · 2007 [cited by applicant]
US 20070192264A1 · Hawkins et al. · 2007 [cited by applicant]
US 20070192267A1 · Hawkins et al. · 2007 [cited by applicant]
US 20070192268A1 · Hawkins et al. · 2007 [cited by applicant]
US 20070192269A1 · Saphir et al. · 2007 [cited by applicant]
US 20070192270A1 · Hawkins et al. · 2007 [cited by applicant]
US 20070228703A1 · Breed · 2007 [cited by applicant]
US 20070276744A1 · Burke · 2007 [cited by applicant]
US 20070276774A1 · Ahmad et al. · 2007 [cited by applicant]
US 20080059389A1 · Jaros et al. · 2008 [cited by applicant]
US 20080140593A1 · George et al. · 2008 [cited by applicant]
US 20080183647A1 · Hawkins et al. · 2008 [cited by applicant]
US 20080201286A1 · Hawkins et al. · 2008 [cited by applicant]
US 20080208783A1 · Jaros et al. · 2008 [cited by applicant]
US 20080208915A1 · George et al. · 2008 [cited by applicant]
US 20080208966A1 · Edwards et al. · 2008 [cited by applicant]
US 20090006289A1 · Jaros et al. · 2009 [cited by applicant]
US 20090116413A1 · George · 2009 [cited by applicant]
US 20090150311A1 · George · 2009 [cited by applicant]
US 20090240886A1 · Sayfan et al. · 2009 [cited by applicant]
US 20090313193A1 · Hawkins et al. · 2009 [cited by applicant]
US 20100049677A1 · Jaros et al. · 2010 [cited by applicant]
US 20100185567A1 · Niemasik et al. · 2010 [cited by applicant]
US 20100191684A1 · George · 2010 [cited by applicant]
US 20100207754A1 · Shostak et al. · 2010 [cited by applicant]
US 20100312730A1 · Weng et al. · 2010 [cited by applicant]
US 20110047110A1 · Rinkus · 2011 [cited by applicant]
US 20110231351A1 · George et al. · 2011 [cited by applicant]
US 20120005134A1 · Jaros et al. · 2012 [cited by applicant]
US 20120109857A1 · George et al. · 2012 [cited by applicant]
US 20120166364A1 · Ahmad et al. · 2012 [cited by applicant]
US 20120197823A1 · Hawkins et al. · 2012 [cited by applicant]
US 20120330885A1 · Jaros et al. · 2012 [cited by applicant]
US 20130054495A1 · Hawkins et al. · 2013 [cited by applicant]
US 20130054496A1 · Marianetti et al. · 2013 [cited by applicant]
US 20130054552A1 · Hawkins et al. · 2013 [cited by applicant]
US 20150324689A1 · Wierzynski · 2015 [cited by examiner]
US 20160012314A1 · Ramamurthy · 2016 [cited by examiner]
US 20160174902A1 · Georgescu · 2016 [cited by examiner]
US 20160358070A1 · Brothers · 2016 [cited by examiner]
US 20170337472A1 · Durdanovic · 2017 [cited by examiner]
US 20180005107A1 · Neil · 2018 [cited by examiner]
US 20190026600A1 · Bagherinezhad · 2019 [cited by examiner]
US 20190087713A1 · Lamb · 2019 [cited by examiner]
US 20190147327A1 · Martin · 2019 [cited by examiner]
US 20190332925A1 · Modha · 2019 [cited by examiner]
US 20200143250A1 · Lee · 2020 [cited by examiner]
US 20200279133A1 · Baum · 2020 [cited by examiner]
US 20200285892A1 · Baum · 2020 [cited by examiner]
US 20200285949A1 · Baum · 2020 [cited by examiner]
US 20200285950A1 · Baum · 2020 [cited by examiner]
US 20200301995A1 · Shibata · 2020 [cited by examiner]
US 20200327406A1 · Piveteau · 2020 [cited by examiner]
US 20210065005A1 · Zhu · 2021 [cited by examiner]
US 20210150363A1 · Yang · 2021 [cited by examiner]
US 20210158168A1 · Ahmad · 2021 [cited by examiner]
US 20220044090A1 · Yoo · 2022 [cited by examiner]
US 20220075437A1 · Han · 2022 [cited by examiner]
CN 1303371A · 2001 [cited by examiner]
EP 1557990 · 2005 [cited by applicant]
EP 3657403A1 · 2020 [cited by examiner]
GB 2399427A · 2004 [cited by examiner]
WO WO2009006231 · 2006 [cited by applicant]
WO WO2008067326 · 2008 [cited by applicant]
WO WO2006063291 · 2009 [cited by applicant]
Jia, Haipeng & Xiang, Xueshuang & Fan, Da & Huang, Meiyu & Sun, Changhao & Meng, Qingliang & He, Yang & Chen, Chen. (2018). DropPruning for Model Compression. (Year: 2018). [cited by examiner]
Jia, Haipeng, et al. “Stochastic model pruning via weight dropping away and back.” Proceedings of the 2020 2nd International Conference on Image Processing and Machine Vision. 2020. (Year: 2020). [cited by examiner]
Adelson, E.H. et al., “The Perception of Shading and Reflectance,” Perception as Bayesian Inference, 1996, pp. 409-423, Knill, D.C. et al., eds., Cambridge University Press, UK. [cited by applicant]
Agrawal, R. et al., “Mining Sequential Patterns,” IEEE, 1995, pp. 3-14. [cited by applicant]
Ahmad, S. et al., “How do neurons operate on sparse distributed representations? A mathematical theory of sparsity, neurons and active dendrites,” arXiv:1601.00720, Jan. 5, 2016, pp. 1-17. [cited by applicant]
Ahmad, S. et al., “PowerNuPIC,” Numenta, Jun. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, fifty-six pages. [cited by applicant]
Ahmad, S. et al., “How Can We Be So Dense? The Robustness of Highly Sparse Representations,” ICML 2019 Workshop on Uncertainty and Robustness in Deep Learning, Jun. 2019, pp. 1-10. [cited by applicant]
Ahmad, S., “NuPIC Jumpstart—Part II,” Numenta, May 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, thirty-three pages. [cited by applicant]
Archive of “Numenta Platform for Intelligent Computing Programmer's Guide,” Numenta, Mar. 7, 2007, pp. 1-186, www.numenta.com, [Online] Archived by http://archive.org on Mar. 19, 2007; Retrieved on Aug. 13, 2008. Retrie… [cited by applicant]
Åslin, F., “Evaluation of Hierarchical Temporal Memory in Algorithmic Trading,” Thesis, Linkopings Universitet, Feb. 8, 2010, 37 pages. [cited by applicant]
Becerra, J.A. et al., “Multimodule Artificial Neural Network Architectures for Autonomous Robot Control Through Behavior Modulation,” IWANN 2003, LNCS, pp. 169-176, vol. 2687. [cited by applicant]
Biancaniello, P. et al., Multimodal Pattern Recognition with Hierarchical Temporal Memory (MPR), Lockheed Martin Brain-Inspired Computing Research Overview, Numenta HTM Workshop, Jun. 2008, twelve pages. [cited by applicant]
Bobier, B., “Content-Based Image Retrieval Using Hierarchical Temporal Memory,” Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, seven pages. [cited by applicant]
Bradski, G. et al., “Fast-Learning VIEWNET Architectures for Recognizing Three-dimensional Objects from Multiple Two-dimensional Views,” Neural Networks, 1995, pp. 1053-1080, vol. 8, No. 7/8. [cited by applicant]
Bryhni et al., “A Comparison of Load Balancing Ttechniques for Scalable Web Servers,” IEEE Network, Jul./Aug. 2000, pp. 58-64. [cited by applicant]
Ceisel, A. et al., “Using HTM Networks to Decode Neural Signals from the Motor Cortex: A Novel Approach to Brain-Computer Interface Control,” Illinois Institute of Technology, Numenta HTM Workshop, 2009, four pages. [cited by applicant]
Chapela, V., “Preventing Financial Fraud,” Smart Security Services, Numenta HTM Workshop, 2009, forty pages. [cited by applicant]
Chen, Y. et al., “The Sparse Manifold Transform,” 32nd Conference on Neural Information Processing Systems (NeurIPS 2018), Dec. 2018, pp. 1-12. [cited by applicant]
Chinese Office Action, Chinese Application No. 200580042258.7, Jul. 10, 2009, twelve pages. [cited by applicant]
Chinese Office Action, Chinese Application No. 200780007274.1, Jun. 24, 2011, five pages. [cited by applicant]
Colombe, J., “A Survey of Recent Developments in Theoretical Neuroscience and Machine Vision,” Proceedings of the IEEE Applied Imagery Pattern Recognition Workshop, 2003, nine pages. [cited by applicant]
Cormack, G.V. et al., “Data Compression Using Dynamic Markov Modelling,” The Computer Journal, 1987, pp. 541-550, vol. 30, No. 6. [cited by applicant]
Csapo, A.B. et al., “Object Categorization Using VFA-Generated Nodemaps and Hierarchical Temporal Memories,” IEEE International Conference on Computational Cybernetics, Oct. 7, 2007, pp. 257-262. [cited by applicant]
Cui, Y. et al., “The HTM Spatial Pooler—A Neocortical Algorithm for Online Sparse Distributed Coding,” Frontiers in Computational Neuroscience, vol. 11, Article 111, Nov. 2017, pp. 1-15. [cited by applicant]
Curry, C. et al., “Speech Processing with HTM,” Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, fifty-seven pages. [cited by applicant]
Dean, T., “Learning Invariant Features Using Inertial Priors,” Annals of Mathematics and Artificial Intelligence, 2006, pp. 223-250, vol. 47. [cited by applicant]
Demeris, Y. et al., “From Motor Babbling to Hierarchical Learning by Imitation: A Robot Developmental Pathway,” Proceedings of the Fifth International Workshop on Epigenetic Robotics: Modeling Cognitive Development in R… [cited by applicant]
Dimitrova, N. et al., “Motion Recovery for Video Content Classification,” ACM Transactions on Information Systems, Oct. 1995, pp. 408-439, vol. 13, No. 4. [cited by applicant]
Ding, C.H.Q., “Cluster Merging and Splitting in Hierarchical Clustering Algorithms,” Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Dec. 9, 2002, pp. 139-146. [cited by applicant]
Dolin, R. et al., “Scalable Collection Summarization and Selection,” Association for Computing Machinery, 1999, pp. 49-58. [cited by applicant]
Dubinsky, D., “Numenta Business Strategy,” Numenta, Jun. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, fifteen pages. [cited by applicant]
Dudgeon, M. et al., “Evolved HTM Preprocessing,” Qualia Labs, Jun. 25, 2009, nine pages. [cited by applicant]
Eastman, K. “HTM's & Airline Passenger Behavior: Prediction and Inference Model,” Numenta HTM Workshop, 2009, ten pages. [cited by applicant]
Edsa, “Project Information,” Apr. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, four pages. [cited by applicant]
Eswaran, K., “Numenta Lightning Talk on Dimension Reduction and Unsupervised Learning,” Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, thirty pages. [cited by applicant]
European Examination Report, European Application No. 11756775.0, Feb. 19, 2016, 6 pages. [cited by applicant]
European Examination Report, European Application No. 11756775.0, Oct. 12, 2016, 4 pages. [cited by applicant]
European Patent Office, Examination Report European Patent Application No. 07750385.2, Dec. 6, 2010, eight pages. [cited by applicant]
European Patent Office, Examination Report, European Application No. 05853611.1, Jun. 23, 2008, four pages. [cited by applicant]
European Patent Office, Examination Report, European Application No. 07750385.2, Apr. 21, 2009, eight pages. [cited by applicant]
European Patent Office, Examination Report, European Patent Application No. 08796030.8, Dec. 6, 2010, seven pages. [cited by applicant]
European Patent Office, Examination Report, European Patent Application No. 11756775.0, Jan. 7, 2015, eight pages. [cited by applicant]
European Patent Office, Supplementary European Search Report and Opinion, European Patent Application No. 11756775.0, Oct. 1, 2013, eight pages. [cited by applicant]
Fan et al., “A Genetic Sparse Distributed Memory Approach to the Application of Handwritten Character Recognition,” published 1997. [cited by applicant]
Farahmand, N. et al., “Online Temporal Pattern Learning,” Proceedings of the International Joint Conference on Neural Networks, Jun. 14-19, 2009, pp. 797-802, Atlanta, GA, USA. [cited by applicant]
Felleman, D.J. et al., “Distributed Hierarchical Processing in the Primate Cerebral Cortex,” Cerebral Cortex, Jan./Feb. 1991, pp. 1-47, vol. 1. [cited by applicant]
Fine, S. et al., “The Hierarchical Hidden Markov Model: Analysis and Applications,” Machine Learning, 1998, pp. 41-62, vol. 32, Kluwer Academic Publishers, Boston. [cited by applicant]
Finley, M., “Exploration of Motion Capture,” Qualia Labs, Jun. 24, 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, thirty-six pages. [cited by applicant]
Foldiak, P., “Learning Invariance from Transformation Sequences,” Neural Computation, 1991, pp. 194-200, vol. 3, No. 2. [cited by applicant]
Fukushima, K., “Neocognitron: A Self-Organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position,” Biol. Cybernetics, 1980, pp. 193-202, vol. 36. [cited by applicant]
Garalevicius, S., “Memory-Prediction Framework for Pattern Recognition: Performance and Suitability of the Bayesian Model of Visual Cortex,” American Association of Artificial Intelligence, 2007, six pages. [cited by applicant]
George, D. “Thesis: How the Brain Might Work,” Dept. of Electrical Engineering and the Committee on Graduate Studies of Stanford University, Jun. 2008, one-hundred ninety-one pages. [cited by applicant]
George, D. et al., “A Hierarchical Bayesian Model of Invariant Pattern Recognition in the Visual Cortex,” Proceedings, 2005 IEEE International Joint Conference on Neural Networks, Jul. 31-Aug. 4, 2005, pp. 1812-1817, vo… [cited by applicant]
George, D. et al., “Invariant Pattern Recognition Using Bayesian Inference on Hierarchical Sequences,” Technical Report, Sep. 17, 2004, pp. 1-8. [cited by applicant]
George, D. et al., “The HTM Learning Algorithms,” Mar. 1, 2007, 44 pages. [Online] [Retrieved on Sep. 22, 2011] Retrieved from the Internet <URL:http://www.numenta.com/htm-overview/education/Numenta_HTM_Learning_Algos.p… [cited by applicant]
George, D. et al., “Towards a Mathematical Theory of Cortical Micro-circuits,” PLOS Computational Biology, Oct. 2009, vol. 5, Issue 10, twenty-six pages. [cited by applicant]
Gottschalk, K. et al., “Introduction to Web Services Architecture,” IBM Systems Journal, 2002, pp. 170-177, vol. 41, No. 2. [cited by applicant]
Gripon, V. et al., “Sparse Neural Networks with Large Learning Diversity,” IEEE Transactions on Neural Networks, Jul. 2011, pp. 1087-1096, vol. 22, No. 7. [cited by applicant]
Guerrier, P., “A Generic Architecture for On-Chip Packet-Switched Interconnections,” Association for Computing Machinery, 2000, pp. 250-256. [cited by applicant]
Guinea, D. et al., “Robot Learning to Walk: An Architectural Problem for Intelligent Controllers,” Proceedings of the 1993 International Symposium on Intelligent Control, Aug. 1993, pp. 493-498, Chicago, USA. [cited by applicant]
Guo, C-E. et al., “Modeling Visual Patterns by Integrating Descriptive and Generative Methods,” International Journal of Computer Vision, May 29, 2003, pp. 5-29, vol. 53, No. 1. [cited by applicant]
Haitani, R. et al., “Vitamin D Toolkit, Introduction,” Jun. 24, 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, eleven pages. [cited by applicant]
Haitani, R., “Smart Video: A Disruptive Market Opportunity for HTM,” Numenta HTM Workshop, 2009, twelve pages. [cited by applicant]
Han, K. et al., “Automated Robot Behavior Recognition Applied to Robotic Soccer,” In Proceedings of the IJCAI-99 Workshop on Team Behaviors and Plan Recognition, 1999, six pages. [cited by applicant]
Haritaoglu, I. et al., “W4: Real-Time Surveillance of People and Their Activities,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Aug. 2000, pp. 809-830, vol. 22, No. 8. [cited by applicant]
Hartung, J. et al., “Presentation: Support for the Use of Hierarchical Temporal Memory Systems in Automated Design Evaluation: A First Experiment,” Numenta HTM Workshop, 2009, thrity-one pages. [cited by applicant]
Hartung, J. et al., “Support for the Use of Hierarchical Temporal Memory Systems in Automated Design Evaluation: A First Experiment,” Proceedings of the ASME 2009 Int'l. Design Engineering Technical Conferences & Comput… [cited by applicant]
Hasegawa, Y. et al., “Learning Method for Hierarchical Behavior Controller,” Proceedings of the 1999 IEEE International Conference on Robotics & Automation, May 1999, pp. 2799-2804. [cited by applicant]
Hawkins, J. “Hierarchical Temporal Memory: History-Progress-Today-Tomorrow,” HTM Workshop, Jun. 2009, twenty-four pages. [cited by applicant]
Hawkins, J. “Prediction Toolkit Overview,” Numenta HTM Workshop, 2009, four pages. [cited by applicant]
Hawkins, J. et al., “Hierarchical Temporal Memory including HTM Cortical Learning Algorithms,” Numenta, Inc., Sep. 12, 2011, pp. 1-68. [cited by applicant]
Hawkins, J. et al., “Hierarchical Temporal Memory, Concepts, Theory, and Terminology,” Numenta, May 10, 2006, pp. 1-19. [cited by applicant]
Hawkins, J. et al., “Hierarchical Temporal Memory: Concepts, Theory and Terminology,” Numenta, Inc., Mar. 27, 2007, 20 pages. [Online] [Retrieved on Sep. 22, 2011] Retrieved from the Internet<URL:http://www.numenta.com/… [cited by applicant]
Hawkins, J. et al., “On Intelligence,” Sep. 2004, Times Books, Henry Holt and Company, New York, NY 10011. [cited by applicant]
Hawkins, J. et al., “Sequence Memory for Prediction, Inference and Behaviour,” Philosophical Transactions of the Royal Society B, Mar. 31, 2009, pp. 1203-1209, vol. 364. [Online] [Retrieved Sep. 22, 2011] Retrieved from… [cited by applicant]
Hawkins, J., “Why Can't a Computer Be More Like a Brain?” IEEE Spectrum, Apr. 1, 2007, pp. 21-26, vol. 44, No. 4. [cited by applicant]
He, K. et al., “Deep Residual Learning for Image Recognition,” arXiv:1512.03385, Dec. 10, 2015, pp. 1-12. [cited by applicant]
He, K. et al., “Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification,” arXiv:1502.01852, Feb. 6, 2015, pp. 1-11. [cited by applicant]
Hendrycks, D. et al., “Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations,” arXiv:1807.01697, Jul. 4, 2018, pp. [cited by applicant]
Hernandez-Gardiol, N. et al., “Hierarchical Memory-Based Reinforcement Learning,” Proceedings of Neural Information Processing Systems, 2001, seven pages. [cited by applicant]
Hinton, G.E. et al., “The “Wake-Sleep” Algorithm for Unsupervised Neural Networks,” Science, May 26, 1995, pp. 1158-1161, vol. 268. [cited by applicant]
Hoey, “Hierarchical unsupervised learning of facial expression categories,” IEEE, 2001, 0-7695-1293-3, pp. 99-106. [cited by applicant]
Howard, M. W., “Memory as Perception of the Past: Compressed Time inMind and Brain,” Trends in Cognitive Sciences, vol. 22, Iss. 2, Feb. 1, 2018, pp. 124-136. [cited by applicant]
Huang, G. et al., “Densely Connected Convolutional Networks,” arXiv:1608.06993, Aug. 25, 2016, pp. 1-12. [cited by applicant]
Hyvarinen, A. et al., “Bubbles: A Unifying Framework for Low-Level Statistical Properties of Natural Image Sequences,” J. Opt. Soc. Am. A., 2003, pp. 1237-1252, vol. 20, No. 7. [cited by applicant]
Ioffe, S. et al., “Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift,” arXiv:1502.03167, Feb. 11, 2015, pp. 1-10. [cited by applicant]
Isard, M. et al., “Icondensation: Unifying Low-Level and High-Level Tracking in a Stochastic Framework,” Lecture Notes in Computer Science 1406, 1998, pp. 893-908, Burkhardt, H. et al., ed., Springer-Verlag, Berlin. [cited by applicant]
Kanerva, P., Chapter 9: Constructing Distributed Memory and Chapter 10: The Organization of an Autonomous Learning System, Sparse Distributed Memory, The MIT Press, Cambridge, MA, 1988, pp. 87-100. [cited by applicant]
Kim, J. et al., “Hierarchical Distributed Genetic Algorithms: A Fuzzy Logic Controller Design Application,” IEEE Expert, Jun. 1996, pp. 76-84. [cited by applicant]
Kuenzer, A. et al., “An Empirical Study of Dynamic Bayesian Networks for User Modeling,” Proceedings of the UM 2001 Workshop on Machine Learning, ten pages. [cited by applicant]
Lecun, Y. et al., “Backpropagation Applied to Handwritten Zip Code Recognition,” Neural Computation, vol. 1, Issue 4, Winter 1989, pp. 541-551. [cited by applicant]
Lecun, Y. et al., “Gradient-Based Learning Applied to Document Recognition,” Proc. of the IEEE, Nov. 1998, pp. 1-46. [cited by applicant]
Lee, H. et al., “Convolutional Deep Belief Networks for Scalable Unsupervised Learning of Hierarchical Representations,” Proceedings of the 26th International Conference on Machine Learning, Jun. 2009, pp. 609-616. [cited by applicant]
Lee, H. et al., “Sparse deep belief net model for visual area V2,” Advances In Neural Information Processing Systems, Dec. 2008, pp. 1-8. [cited by applicant]
Lee, T.S. et al., “Hierarchical Bayesian Inference in the Visual Cortex,” J. Opt. Soc. Am. A. Opt. Image. Sci. Vis., Jul. 2003, pp. 1434-1448, vol. 20, No. 7. [cited by applicant]
Lenser, S. et al., “A Modular Hierarchical Behavior-Based Architecture,” RoboCup 2001, LNAI 2377, 2002, pp. 423-428, Birk, A. et al, (eds.), Springer-Verlag, Berlin, Heidelberg. [cited by applicant]
Levinson, S. et al., “Automatic Language Acquisition for a Mobile Robot,” Feb. 2005, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, twenty-seven pages. [cited by applicant]
Lewicki, M.S. et al., “Bayesian Unsupervised Learning of Higher Order Structure,” Proceedings of the 1996 Conference in Advances in Neural Information Processing Systems 9, pp. 529-535. [cited by applicant]
Lim, “Estimation of Occlusion and Dense Motion Fields in a Bidirectional Bayesian Framework,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, pp. 712-718, vol. 24, No. 5. [cited by applicant]
Lo, J. “Unsupervised Hebbian Learning by Recurrent Multilayer Neural Networks for Temporal Hierarchical Pattern Recognition,” Information Sciences and Systems 44th Annual Conference on Digital Object Identifier, 2010, p… [cited by applicant]
Mahadevan, S. et al., “Validation of reliability computational models using Bayes networks,” Reliability Engineering & System Safety, 2005, pp. 223-232, vol. 87. [cited by applicant]
Majani, E. et al., “On the K-Winners-Take-All Network,” Advances in Neural Information Processing Systems 1 (NIPS 1988), Dec. 1988, pp. 634-642. [cited by applicant]
Majure, L., “Unsupervised Phoneme Acquisition Using HTM,” Jun. 25, 2009, eight pages. [cited by applicant]
Makhzani, A. et al., “k-Sparse Autoencoders,” arXiv:1312.5663, Dec. 19, 2013, pp. 1-9. [cited by applicant]
Makhzani, A. et al., “Winner-Take-All Autoencoders,” Advances in Neural Information Processing Systems 28 (NIPS 2015), Dec. 2015, pp. 1-9. [cited by applicant]
Mannes, C., “A Neural Network Model of Spatio-Temporal Pattern Recognition, Recall and Timing,” Technical Report CAS/CNS-92-013, Feb. 1992, Department of Cognitive and Neural Systems, Boston University, USA, seven pages. [cited by applicant]
Mari, J.-F. et al., “Temporal and Spatial Data Mining with Second-Order Hidden Markov Models,” Soft Computing—A Fusion of Foundations, Methodologies and Applications, 2006, pp. 406-414, vol. 10, No. 5. [cited by applicant]
McDowell, C. et al., “SlugGo, a Computer Go Program,” Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, eighteen pages. [cited by applicant]
Miller, J. W. et al., “Biomimetic Sensory Abstraction Using Hierarchical Quilted Self-Organizing Maps,” Society of Photo-Optical Instrumentation Engineers, 2006, eleven pages. [cited by applicant]
Mishkin, M. et al., “Hierarchical Organization of Cognitive Memory,” Phil. Trans. R. Soc. B., 1997, pp. 1461-1467, London. [cited by applicant]
Mitrovic, A., “An Intelligent SQL Tutor on the Web,” International Journal of Artificial Intelligence in Education, 2003, pp. 171-195, vol. 13. [cited by applicant]
Muckli, L., “Predictive Coding in Apparent Motion,” University of Glasgow, Numenta HTM Workshop, Jun. 25, 2009, twelve pages. [cited by applicant]
Murphy, K. et al., “Using the Forest to See the Trees: A Graphical Model Relating Features, Objects and Scenes,” Advances in Neural Processing System, 2004, vol. 16, eight pages. [cited by applicant]
Murray, S.O. et al., “Shape Perception Reduces Activity in Human Primary Visual Cortex,” Proceedings of the Nat. Acad. of Sciences of the USA, Nov. 2002, pp. 15164-151169, vol. 99, No. 23. [cited by applicant]
Nair, D. et al., “Bayesian Recognition of Targets by Parts in Second Generation Forward Looking Infrared Images,” Image and Vision Computing, 2000, pp. 849-864, vol. 18. [cited by applicant]
Nair, V. et al., “3D Object Recognition with Deep Belief Nets,” Advances in Neural Information Processing Systems 22 (NIPS 2009), Dec. 2009, pp. 1-9. [cited by applicant]
Namphol, A. et al., “Image Compression with a Hierarchical Neural Network,” IEEE transactions on Aerospace and Electronic Systems, Jan. 1996, pp. 326-338, vol. 32, No. 1. [cited by applicant]
Naphade, M. et al., “A Probabilistic Framework for Semantic Video Indexing, Filtering, and Retrieval,” IEEE Transactions on Multimedia, Mar. 2001, pp. 141-151, vol. 3, No. 1. [cited by applicant]
Naphade, M. et al., “Discovering Recurrent Events in Video Using Unsupervised Methods,” IEEE ICIP, 2002, pp. 11-13 through 11-16. [cited by applicant]
Niemasik, J. “Vision Toolkit,” Numenta HTM Workshop, 2009, twenty-eight pages. [cited by applicant]
Numenta, Inc., “Business Strategy,” Numenta HTM Workshop, 2009, fifteen pages. [cited by applicant]
Numenta, Inc., “Hierarchical Temporal Memory: Comparison with Existing Models, Version 1.01,” Mar. 1, 2007, four pages. [cited by applicant]
Numenta, Inc., “HTM Algorithms,” Jun. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, sixty-seven pages. [cited by applicant]
Numenta, Inc., “HTM Workshop, Jumpstart,” Jun. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, eighty-six pages. [cited by applicant]
Numenta, Inc., “Numenta Node Algorithms Guide NuPIC 1.6,” Numenta, Jul. 22, 2008, pp. 1-7. [cited by applicant]
Numenta, Inc., “Numenta Node Algorithms Guide NuPIC 1.6,” Numenta, Jun. 13, 2008, pp. 1-6. [cited by applicant]
Numenta, Inc., “Numenta Platform for Intelligent Computing: Programmer's Guide Version 1.0,” Mar. 2007, seventy-seven pages. [cited by applicant]
Numenta, Inc., “NuPIC Update,” Numenta HTM Workshop, 2009, twenty-four pages. [cited by applicant]
Numenta, Inc., “Problem Solving with HTMs,” Jun. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, twenty-three pages. [cited by applicant]
Numenta, Inc., “Prototype to Demonstrate Automated Insect Detection and Discrimination,” Numenta HTM Workshop, 2009, four pages. [cited by applicant]
Numenta, Inc., “Smart Music: Combining Musical Expectations with Algorithmic Composition,” Numenta HTM Workshop, 2009, seven pages. [cited by applicant]
Numenta, Inc., “Technical Keynote,” Numenta HTM Workshop, 2009, seventy-two pages. [cited by applicant]
Numenta, Inc., “Temporal Model Characteristics,” Numenta HTM Workshop, 2009, fourteen pages. [cited by applicant]
Numenta, Inc., “Vision Framework,” Jun. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, thirty-six pages. [cited by applicant]
Numenta, Inc., “What Have We Worked on Since the 2008 Workshop? Customer Applications Presentation,” Numenta HTM Workshop, 2009, thirty-five pages. [cited by applicant]
Numenta, Inc., “Zeta1 Algorithms Reference, Version 1.0,” Numenta Inc., Mar. 1, 2007, pp. 1-36. [cited by applicant]
Numenta, Inc., “Zeta1 Algorithms Reference, Version 1.2,” Numenta Inc., Jun. 8, 2007, pp. 1-38. [cited by applicant]
Numenta, Inc., “Zeta1 Algorithms Reference, Version 1.3,” Numenta Inc., Aug. 22, 2007, pp. 1-41. [cited by applicant]
Numenta, Inc., “Zeta1 Algorithms Reference, Version 1.5,” Numenta Inc., Aug. 24, 2007, pp. 1-45. [cited by applicant]
Olshausen, B. A. et al., “Sparse Coding with an Overcomplete Basis Set: A Strategy Employed by V1?,” Vision Research, vol. 37, Iss. 23, Dec. 1997, pp. 3311-3325. [cited by applicant]
Olshausen, B.A. et al., “A Neurobiological Model of Visual Attention and Invariant Pattern Recognition Based on Dynamic Routing Information,” Journal of Neuroscience, Nov. 1993, pp. 4700-4719, vol. 13, No. 11. [cited by applicant]
Park, S. et al., “Recognition of Two-person Interactions Using a Hierarchical Bayesian Network,” ACM SIGMM International Workshop on Video Surveillance (IWVS) 2003, pp. 65-76, Berkeley, USA. [cited by applicant]
“Partial Transcript from Numenta HTM Workshop DVD Disc 1,” Numenta, Jun. 2008, 6 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US07/85661, Jun. 13, 2008, eight pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US08/55352, Aug. 1, 2008, nine pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US08/55389, Jul. 25, 2008, nine pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2005/044729, May 14, 2007, 15 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2007/003544, Jun. 16, 2008, 14 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2008/054631, Aug. 18, 2008, 15 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2008/068435, Oct. 31, 2008, 16 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2008/080347, Dec. 10, 2008, 7 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2009/035193, Apr. 22, 2009, 16 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2009/047250, Sep. 25, 2009, 17 pages. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2011/028231, May 19, 2011, 13 pages. [cited by applicant]
Pearl, J., “Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference,” 1988, pp. 143-223, Morgan Kaufmann Publishers, Inc. [cited by applicant]
Pilka, F. et al., “Multi-step Ahead Prediction Using Neural Networks,” 53.sup.rd International Symposium ELMAR-2011, Sep. 14-16, 2011, pp. 269-272, Zadar, Croatia. [cited by applicant]
Poppel, E., “A Hierarchical Model of Temporal Perception,” Trends in Cognitive Sciences, May 1997, pp. 56-61, vol. 1, No. 2. [cited by applicant]
Poritz, A., “Linear Predictive Hidden Markov Models and the Speech Signal,” IEEE, 1982, pp. 1291-1294. [cited by applicant]
Rachkovskij, “Representation and Processing of Structures with Binary Sparse Distributed Codes,” published Apr. 2001. [cited by applicant]
Rao, R. et al., “Predictive Coding in the Visual Cortex: A Functional Interpretation of Some Extra-classical Receptive-field Effects,” Nature Neuroscience, Jan. 1999, pp. 79-87, vol. 2, No. 1. [cited by applicant]
Rawlinson, D. et al., “Sparse Unsupervised Capsules Generalize Better,” arXiv:1804.06094, Apr. 17, 2018, pp. 1-9. [cited by applicant]
Riesenhuber, M. et al., “Hierarchical Models of Object Recognition in Cortex,” Nature Neuroscience, Nov. 1999, pp. 1019-1025, vol. 2, No. 11. [cited by applicant]
Rinkus, “Hierarchical Sparse Distributed Representations of Sequence Recall and Recognition,” published 2006. [cited by applicant]
Robinson, D. et al., “Spoken Language Identification with Hierarchical Temporal Memories,” 2009 CS229 Course on Machine Learning at Stanford University, Dec. 11, 2009, five pages. [Online] [Retrieved Sep. 19, 2013] Retr… [cited by applicant]
Rojas, R., “Neural Networks, A Systematic Approach,” Springer-Verlag, 1996, pp. 20-21, 110-112, and 311-319. [cited by applicant]
Ross, L., “Discovering and Using Patterns in Plant Floor Data,” Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, twelve pages. [cited by applicant]
Rozell, C.J. et al., “Sparse Coding Via Thresholding and Local Competition in Neural Circuits,” Neural Computation, 2008, pp. 2526-2563, vol. 20, No. 10. [cited by applicant]
Sainath, T. N. et al., “Convolutional Neural Networks for Small-footprint Keyword Spotting,” Sixteenth Annual Conference of the International Speech Communication Association, 2015, pp. 1-5. [cited by applicant]
Saphir, B. “Numenta Web Services,” Numenta HTM Workshop, 2009, twenty pages. [cited by applicant]
Saphir, B., “Power NuPIC Part II, How to Create a New Node Type,” Numenta, Jun. 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, thirty-two pages. [cited by applicant]
SDSYSTEM24.com, “HTM Optimized Drug Therapy,” Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, seven pages. [cited by applicant]
Simonyan, K. et al., “Very Deep Convolutional Networks for Large-Scale Image Recognition,” arXiv:1409.1556, Sep. 4, 2014, pp. 1-10. [cited by applicant]
Sinha, P. et al., “Recovering Reflectance and Illumination in a World of Painted Polyhedra,” Fourth International Conference on Computer Vision, Berlin, May 11-14, 1993, pp. 156-163, IEEE Computer Society Press, Los Ala… [cited by applicant]
Spence, C. et al., “Varying Complexity in Tree-Structured Image Distribution Models,” IEEE Transactions on Image Processing, Feb. 2006, pp. 319-330, vol. 15, No. 2. [cited by applicant]
Srivastava, N. et al., “Dropout: A Simple Way to Prevent Neural Networks from Overfitting,” Journal of Machine Learning Research, vol. 15, Jun. 2014, pp. 1929-1958. [cited by applicant]
Srivastava, R. K. et al., “Compete to Compute,” Advances in Neural Information Processing Systems 26, Dec. 2013, pp. 1-9. [cited by applicant]
Starzyk, J.A. et al., “Spatio-Temporal Memories for Machine Learning: A Long-Term Memory Organization,” IEEE Transactions on Neural Networks, May 2009, pp. 768-780, vol. 20, No. 5. [cited by applicant]
Stringer, S.M. et al., “Invariant Object Recognition in the Visual System with Novel Views of 3D Objects,” Neural Computation, Nov. 2002, pp. 2585-2596, vol. 14, No. 11. [cited by applicant]
Sudderth, E.B. et al., “Nonparametric Belief Propagation and Facial Appearance Estimation,” AI Memo 2002-020, Dec. 2002, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA, ele… [cited by applicant]
Tang, R. et al., “Deep Residual Learning for Small-Footprint Keyword Spotting,” arXiv:1710.10361, Oct. 28, 2018, pp. 1-5. [cited by applicant]
Thomson, A.M. et al., “Interlaminar Connections in the Neocortex,” Cerebral Cortex, 2003, pp. 5-14, vol. 13, No. 1. [cited by applicant]
Thornton, J. et al., “Robust Character Recognition Using a Hierarchical Bayesian Network,” Proceedings of the 19.sup.th Australian Joint Conference on Artifical Intelligence, 2006, pp. 1259-1264. [cited by applicant]
Tsinarakis, G.J. et al. “Modular Petri Net Based Modeling, Analysis and Synthesis of Dedicated Production Systems,” Proceedings of the 2003 IEEE International Conference on Robotics and Automation, Sep. 14-19, 2003, pp.… [cited by applicant]
Tsinarakis, G.J. et al. “Modular Petri Net Based Modeling, Analysis, Synthesis and Performance Evaluation of Random Topology Dedicated Production Systems,” Journal of Intelligent Manufacturing, 2005, vol. 16, pp. 67-92. [cited by applicant]
Tsukada, M, “A Theoretical Model of the Hippocampal-Cortical Memory System Motivated by Physiological Functions in the Hippocampus”, Proceedings of the 1993 International Joint Conference on Neural Networks, Oct. 25, 19… [cited by applicant]
Tugstugi, “pytorch-speech-commands,” Jan. 29, 2018, pp. 1-2 [Online] [Retrieved on Apr. 8, 2020] Retrieved from the Internet <URL: https://github.com/tugstugi/pytorch-speech-commands>. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/010,243, Jul. 12, 2007, twelve pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/147,069, Jan. 9, 2007, 27 pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/147,069, Jan. 9, 2009, thirty-eight pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/147,069, Jul. 29, 2009, forty-three pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/147,069, May 15, 2008, thirty-seven pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/147,069, May 29, 2007, thirty-six pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/147,069, Oct. 30, 2007, thirty-four pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/351,437, Aug. 23, 2007, sixteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/351,437, Feb. 20, 2008, six pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,447, May 28, 2008, eighteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,448, Apr. 30, 2008, seventeen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,448, Aug. 24, 2007, nineteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,454, Jun. 3, 2008, thirteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,454, Mar. 30, 2009, eleven pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,455, Apr. 21, 2010, twelve pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,456, Mar. 20, 2009, nine pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,456, May 7, 2008, fourteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,456, Nov. 6, 2008, seven pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,457, Apr. 21, 2009, six pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,457, Aug. 24, 2007, ten pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,457, May 6, 2008, fourteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,457, Nov. 20, 2008, eight pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/622,458, Apr. 1, 2010, sixteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/680,197, Mar. 23, 2010, twelve pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/680,197, Sep. 14, 2010, seventeen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/713,157, Mar. 31, 2010, fourteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 11/945,919, Sep. 7, 2010, nineteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/029,434, Mar. 28, 2011, twenty-four pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/029,434, Nov. 8, 2011, thirty-six pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/039,630, Nov. 24, 2010, ten pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/039,652, Mar. 29, 2011, fifteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/040,849, Feb. 3, 2011, thirteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/040,849, Jul. 1, 2011, eighteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/147,348, Oct. 11, 2011, forty-three pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/288,185, Sep. 15, 2010, eleven pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/483,642, Apr. 26, 2012, twelve pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/483,642, Aug. 10, 2012, seven pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 12/751,808, Oct. 28, 2010, thirteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 13/151,928, Aug. 2, 2011, eight pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 13/218,170, Jul. 5, 2013, six pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 13/218,194, Oct. 5, 2012, fourteen pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 13/227,355, May 25, 2012, twenty-four pages. [cited by applicant]
U.S. Office Action, U.S. Appl. No. 13/333,865, May 16, 2012, twenty-four pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 13/218,202, Feb. 3, 2014, eleven pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 13/658,200, May 8, 2015, seventeen pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 13/046,464, Apr. 6, 2015, 15 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 13/046,464, Apr. 9, 2014, 16 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 13/046,464, Jun. 19, 2013, 14 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 13/046,464, Nov. 28, 2014, 16 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 13/046,464, Oct. 16, 2013, 16 pages. [cited by applicant]
Van Essen, D.C. et al., “Information Processing Strategies and Pathways in the Primate Visual System,” An Introduction to Neural and Electronic Networks, 1995, pp. 45-76. [cited by applicant]
Vaught, T.N., “Software Design in Scientific Computing,” Jun. 23, 2008, Numenta HTM Workshop, Jun. 23-24, 2008, SRI Campus, Menlo Park, CA, thirty-two pages. [cited by applicant]
Vlajic, “Vector Quantization of Images Using Modified Adaptive Resonance Algorithm for Hierarchical Clustering,” IEEE Transactions on Neural Networks, 2001, pp. 1147-1162, vol. 12, No. 5. [cited by applicant]
Weiss, R. et al., “HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering,” Proceedings of the Seventh Annual ACM Conference on Hypertext, Mar. 16-20, 1996, pp. 180-193, Washingt… [cited by applicant]
Wiskott, L. et al., “Slow Feature Analysis: Unsupervised Learning of Invariances,” Neural Computation, 2002, pp. 715-770, vol. 14, No. 4. [cited by applicant]
Wu, G. et al., “Multi-camera Spatio-temporal Fusion and Biased Sequence-data Learning for Security Surveillance,” Association for Computing Machinery, 2003, pp. 528-538. [cited by applicant]
Yedidia, J.S et al., “Understanding Belief Propagation and its Generalizations,” Joint Conference on Artificial Intelligence (IJCAI 2001), Aug. 4-10, 2001, Seattle, WA, USA, thirty-five pages. [cited by applicant]
Zayyani, H. et al., “Bayesian Pursuit Algorithm for Sparse Representation,” 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2009, IEEE, 2009, pp. 1549-1552. [cited by applicant]
Zemel, R.S., “Cortical Belief Networks,” Computational Models for Neuroscience, 2003, pp. 267-287, Hecht-Nielsen, R. et al., eds., Springer-Verlag, New York. [cited by applicant]
Zhang, R. et al., “Bayesian methodology for reliability model acceptance,” Reliability Engineering & System Safety, 2003, pp. 95-103, vol. 80. [cited by applicant]