IP Library › Granted Patent US 12,072,951
Granted Patent B2
US 12,072,951 · App. 15/903,290 · Granted Aug 27, 2024

Apparatus and method for training neural networks using weight tying

Inventors: Fabien Cardinaux (Stuttgart, DE); Stefan Uhlich (Stuttgart, DE); Thomas Kemp (Stuttgart, DE); Javier Alonso Garcia (Stuttgart, DE); Kazuki Yoshiyama (Stuttgart, DE)
Assignee: SONY CORPORATION
G06F17/16G06N3/08G06N3/045G06N3/063
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,072,951
App. No.
15/903,290
Granted
Aug 27, 2024
Kind
B2
Abstract

An apparatus comprising circuitry that implements an artificial neural network training algorithm that uses weight tying.

Claims (230)

1. An apparatus comprising:

circuitry that implements an artificial neural network training algorithm that uses weight tying, wherein

the circuitry is configured to

compute a weight-tied weight matrix based on an index matrix and based on a value vector;

update the weight tying using a predefined number of iterations of a clustering algorithm to update the index matrix; and

quantize values of the value vector after updating the weight tying, wherein

the circuitry is configured to, in each iteration of the clustering algorithm, update a value vector according to

[

v

(

l

)

]

k

=

1

#

⁢

{

I

(

l

)

=

k

}

⁢

∑

ij

,

I

(

l

)

=

k

[

W

(

l

)

]

ij

where W (l) is a full-precision weight matrix for layer l of the neural network, I (l) is the index matrix, i and j denote rows and columns, respectively, of W (l) and I (l) , and k denotes a value index.

2. The apparatus of claim 1 , wherein

the predefined number of iterations of the clustering algorithm used to update the weight tying is one.

3. The apparatus of claim 1 , wherein

the circuitry is configured to update, in each iteration of the clustering algorithm, the index matrix according to

[

I

(

l

)

]

ij

=

arg

min

k

=

1

,

…

,

K

(

l

)

❘

"\[LeftBracketingBar]"

[

W

(

l

)

]

ij

-

[

v

(

l

)

]

k

❘

"\[RightBracketingBar]"

where W (l) is a full-precision weight matrix for layer l of the neural network, I (l) is the index matrix, i and j denote rows and columns, respectively, of W (l) and I (l) , and k denotes a value index.

4. The apparatus of claim 1 , wherein

the circuitry is configured to quantize the values of the value vector to the nearest power-of-two.

5. The apparatus of claim 4 , wherein

the circuitry is configured to quantize the values of the value vector according to the quantization scheme:

x

q

=

{

s

·

2

⌊

b

⌋

b

-

⌊

b

⌋

≤

log

2

1.5

s

·

2

⌈

b

⌉

b

-

⌊

b

⌋

>

log

2

⁢

1

.

5

where s=sign(x) and h=log 2 |x|, and where x is the value which is to be quantized and x q is the quantized value.

6. The apparatus of claim 1 , wherein

the circuitry is configured to compute the weight-tied weight matrix based on the index matrix and based on the value vector that comprises more than three values.

7. The apparatus of claim 1 , wherein

the circuitry is configured to update full precision weights based on gradients.

8. The apparatus of claim 1 , wherein

the circuitry is configured to compute the gradients based on a cost function and based on the weight-tied weight matrix.

9. The apparatus of claim 7 , wherein

the circuitry is configured to compute the cost function based on a loss function and based on a forward pass function.

10. The apparatus of claim 7 , wherein

the circuitry is configured to compute the gradients based on a backward pass function.

11. The apparatus of claim 1 , wherein

the training algorithm is a stochastic gradient descent training algorithm.

12. The apparatus of claim 1 , wherein

the artificial neural network is a deep convolutional neural network.

13. A method of training an artificial neural network, the method comprising:

performing an artificial neural network training algorithm that uses weight tying;

computing a weight-tied matrix based on an index matrix and based on a value vector;

update the weight tying using a predefined number of iterations of a clustering algorithm to update the index matrix; and

quantizing values of the value vector after updating the weight tying, wherein

updating the weight tying includes, in each iteration of the clustering algorithm, updating a value vector according to

[

v

(

l

)

]

k

=

1

#

⁢

{

I

(

l

)

=

k

}

⁢

∑

ij

,

I

(

l

)

=

k

[

W

(

l

)

]

ij

where W (l) is a full-precision weight matrix for layer l of the neural network, I (l) is the index matrix, i and j denote rows and columns, respectively, of W (l) and I (l) , and k denotes a value index.

14. A non-transitory computer-readable medium encoded with computer-readable instructions that, when executed by a processor, cause the processor to perform a method comprising:

performing an artificial neural network training algorithm that uses weight tying;

computing a weight-tied matrix based on an index matrix and based on a value vector;

update the weight tying using a predefined number of iterations of a clustering algorithm to update the index matrix; and

quantizing values of the value vector after updating the weight tying, wherein

updating the weight tying includes, in each iteration of the clustering algorithm, updating a value vector according to

[

v

(

l

)

]

k

=

1

#

⁢

{

I

(

l

)

=

k

}

⁢

∑

ij

,

I

(

l

)

=

k

[

W

(

l

)

]

ij

where W (l) is a full-precision weight matrix for layer l of the neural network, I (l) is the index matrix, i and j denote rows and columns, respectively, of W (l) and I (l) , and k denotes a value index.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 23, 2018
From: CARDINAUX, FABIEN; UHLICH, STEFAN; KEMP, THOMAS; ALONSO GARCIA, JAVIER; YOSHIYAMA, KAZUKI
To: SONY CORPORATION
Reel/Frame 045016/0414 →
Priority Claims (1)
EP 17158959 · Mar 2, 2017 · regional
Continuity (1)
Related Publication 20180253401A1 · Sep 6, 2018
Cited By (1)
US 12,430,560