IP Library › Granted Patent US 10,339,447
Granted Patent B2
US 10,339,447 · App. 14/449,101 · Granted Jul 2, 2019

Configuring sparse neuronal networks

Inventors: Sachin Subhash Talathi (San Diego, CA); David Jonathan Julian (San Diego, CA); Venkata Sreekanta Reddy Annapureddy (San Diego, CA)
Assignee: QUALCOMM Incorporated
G06N3/08G06N3/049G06N3/0481G06N3/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 10,339,447
App. No.
14/449,101
Granted
Jul 2, 2019
Kind
B2
Abstract

A method for selecting a reduced number of model neurons in a neural network includes generating a first sparse set of non-zero decoding vectors. Each of the decoding vector is associated with a synapse between a first neuron layer and a second neuron layer. The method further includes implementing the neural network only with selected model neurons in the first neuron layer associated with the non-zero decoding vectors.

Claims (58)

1. A computer-implemented method for selecting model neurons in an artificial neural network, comprising:

generating a first sparse set of decoding weights, each decoding weight corresponding to a synapse between a first neuron layer and a second neuron layer;

selecting, from the first neuron layer, a first set of model neurons corresponding to a first set of non-zero decoding weights selected from the first sparse set of decoding weights;

updating the first neuron layer to consist of the first set of model neurons; and

operating the artificial neural network with the updated first neuron layer.

2. The computer-implemented method of claim 1 , further comprising performing a least squares optimization to generate the first sparse set of decoding weights.

3. The computer-implemented method of claim 2 , in which the least squares optimization comprises least absolute shrinkage and selection operator (LASSO) regularization.

4. The computer-implemented method of claim 2 , further comprising selecting a regularization term to reduce a number of non-zero weights in the first sparse set of decoding weights.

5. The computer-implemented method of claim 1 , further comprising:

generating a second sparse set of decoding weights, each decoding weight from the second sparse set corresponding to a synapse between the updated first neuron layer and the second neuron layer; and

operating the artificial neural network with a second set of model neurons in the updated first neuron layer corresponding to a second set of non-zero decoding weights selected from the second sparse set of decoding weights.

6. The computer-implemented method of claim 1 , further comprising:

repeating the generating and the selecting a plurality of times to create a pooled set of model neurons corresponding to non-zero decoding weights; and

operating the artificial neural network with a third set of model neurons selected from the pooled set of model neurons.

7. An apparatus for selecting model neurons in an artificial neural network, comprising:

a memory; and

at least one processor coupled to the memory, the at least one processor being configured:

to generate a first sparse set of decoding weights, each decoding weight corresponding to a synapse between a first neuron layer and a second neuron layer;

to select, from the first neuron layer, a first set of model neurons corresponding to a first set of non-zero decoding weights selected from the first sparse set of decoding weights;

to update the first neuron layer to consist of the first set of model neurons; and

to operate the artificial neural network with the updated first neuron layer.

8. The apparatus of claim 7 , in which the at least one processor is further configured to perform a least squares optimization to generate the first sparse set of decoding weights.

9. The apparatus of claim 8 , in which the least squares optimization comprises least absolute shrinkage and selection operator (LASSO) regularization.

10. The apparatus of claim 8 , in which the at least one processor is further configured to select a regularization term to reduce a number of non-zero weights in the first sparse set of decoding weights.

11. The apparatus of claim 7 , in which the at least one processor is further configured:

to generate a second sparse set of decoding weights, each decoding weight from the second sparse set corresponding to a synapse between the updated first neuron layer and the second neuron layer; and

to operate the artificial neural network with a second set of model neurons in the updated first neuron layer corresponding to a second set of non-zero decoding weights selected from the second sparse set of decoding weights.

12. The apparatus of claim 7 , in which the at least one processor is further configured:

to repeat the generating and the selecting a plurality of times to create a pooled set of model neurons corresponding to non-zero decoding weights; and

to operate the artificial neural network with a third set of model neurons selected from the pooled set of model neurons.

13. An apparatus for selecting model neurons in an artificial neural network, comprising:

means for generating a first sparse set of decoding weights, each decoding weight corresponding to a synapse between a first neuron layer and a second neuron layer;

means for selecting, from the first neuron layer, a first set of model neurons corresponding to a first set of non-zero decoding weights selected from the first sparse set of decoding weights;

means for updating the first neuron layer to consist of the first set of model neurons; and

means for operating the artificial neural network with the updated first neuron layer.

14. The apparatus of claim 13 , further comprising means for performing a least squares optimization to generate the first sparse set of decoding weights.

15. The apparatus of claim 14 , in which the least squares optimization comprises least absolute shrinkage and selection operator (LASSO) regularization.

16. The apparatus of claim 14 , further comprising means for selecting a regularization term to reduce a number of non-zero weights in the first sparse set of decoding weights.

17. The apparatus of claim 13 , further comprising:

means for generating a second sparse set of decoding weights, each decoding weight from the second sparse set corresponding to a synapse between the updated first neuron layer and the second neuron layer; and

means for operating the artificial neural network with a second set of model neurons in the updated first neuron layer corresponding to a second set of non-zero decoding weights selected from the second sparse set of decoding weights.

18. The apparatus of claim 13 , further comprising:

means for repeating the generating and the selecting a plurality of times to create a pooled set of model neurons corresponding to non-zero decoding weights; and

means for operating the artificial neural network with a third set of model neurons selected from the pooled set of model neurons.

19. A non-transitory computer readable medium having encoded thereon program code for selecting model neurons in an artificial neural network, the program code executed by a processor and comprising:

program code to generate a first sparse set of decoding weights, each decoding weight corresponding to a synapse between a first neuron layer and a second neuron layer;

program code to select, from the first neuron layer, a first set of model neurons corresponding to a first set of non-zero decoding weights selected from the first sparse set of decoding weights;

program code to update the first neuron layer to consist of the first set of model neurons; and

program code to operate the artificial neural network with the updated first neuron layer.

20. The non-transitory computer readable medium of claim 19 , further comprising program code to perform a least squares optimization to generate the first sparse set of decoding weights.

21. The non-transitory computer readable medium of claim 20 , in which the least squares optimization comprises least absolute shrinkage and selection operator (LASSO) regularization.

22. The non-transitory computer readable medium of claim 20 , further comprising program code to select a regularization term to reduce a number of non-zero weights in the first sparse set of decoding weights.

23. The non-transitory computer readable medium of claim 19 , further comprising:

program code to generate a second sparse set of decoding weights, each decoding weight from the second sparse set corresponding to a synapse between the updated first neuron layer and the second neuron layer; and

program code to operate the artificial neural network with a second set of model neurons in the updated first neuron layer corresponding to a second set of non-zero decoding weights selected from the second sparse set of decoding weights.

24. The non-transitory computer readable medium of claim 19 , further comprising:

program code to repeat the generating and the selecting a plurality of times to create a pooled set of model neurons corresponding to non-zero decoding weights; and

program code to operate the artificial neural network with a third set of model neurons selected from the pooled set of model neurons.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 26, 2014
From: TALATHI, SACHIN SUBHASH; JULIAN, DAVID JONATHAN; ANNAPUREDDY, VENKATA SREEKANTA REDDY
To: QUALCOMM INCORPORATED
Reel/Frame 033614/0960 →
Continuity (4)
Provisional Application 61939537 · Feb 13, 2014
Provisional Application 61930849 · Jan 23, 2014
Provisional Application 61930858 · Jan 23, 2014
Related Publication 20150206048A1 · Jul 23, 2015
Cited By (1)
US 12,430,922