IP Library Granted Patent US 11,520,856
Granted Patent B2
US 11,520,856 · App. 17/086,772 · Granted Dec 6, 2022

Systems and methods for selective expansive recursive tensor analysis

Inventors: Muthu M. Baskaran (Old Tappan, NJ); David Bruns-Smith (Brooklyn, NY); James Ezick (Canonsburg, PA); Richard A. Lethin (New York, NY)
Assignee: Qualcomm Incorporated
G06F17/16
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 11,520,856
App. No.
17/086,772
Granted
Dec 6, 2022
Kind
B2
Abstract

A system for performing tensor decomposition in a selective expansive and/or recursive manner, a tensor is decomposed into a specified number of components, and one or more tensor components are selected for further decomposition. For each selected component, the significant elements thereof are identified, and using the indices of the significant elements a sub-tensor is formed. In a subsequent iteration, each sub-tensor is decomposed into a respective specified number of components. Additional sub-tensors corresponding to the components generated in the subsequent iteration are formed, and these additional sub-tensors may be decomposed further in yet another iteration, until no additional components are selected. The mode of a sub-tensor can be decreased or increased prior to decomposition thereof. Components likely to reveal information about the data stored in the tensor can be selected for decomposition.

Claims (53)

1. A method for facilitating extraction of information from tensors, the method comprising:

performing a first iteration by a processor, the first iteration comprising:

(a) decomposing a first tensor having N modes into a selected number (R) of tensor components, each tensor component comprising N vectors; and

(b) forming a second tensor according to significant elements of a component, selected from the R components according to a component weight generated during the decomposition, a significant element being an element that satisfies a specified criterion, and forming the second tensor comprises:

identifying tuples of N indices formed by indices corresponding to one or more significant elements of the selected component in each of the N modes;

selecting elements of the first tensor corresponding to the identified one or more tuples of N indices, wherein the count of the selected elements is S;

allocating processor-accessible memory for the second tensor, of size proportional to N×S; and

storing the selected elements in the allocated processor-accessible memory.

2. The method of claim 1 , wherein decomposing the first tensor into R tensor components comprises:

decomposing the first tensor into N factor matrices; and

generating a tensor component by selecting a column r from each of the N factor matrices.

3. The method of claim 2 , wherein:

decomposing the first tensor comprises performing CANDECOMP/PARAFAC (CP) decomposition; and

each factor matrix has: (i) I n rows, I n being a size of the first tensor in an n-th mode, and (ii) a number of columns equal to the selected number of components R.

4. The method of claim 2 , wherein:

decomposing the first tensor comprises performing Tucker decomposition;

the selected number of components R comprises a product of N component-size values; and

each factor matrix has: (i) I n rows, I n being a size of the first tensor in an n-th mode, and (ii) a number of columns equal to a respective one of the N component-size values.

5. The method of claim 1 , wherein a p-th element of a q-th vector corresponds to a tensor element of the first tensor having an index p in the q-th mode of the first tensor.

6. The method of claim 1 , further comprising selecting one or more significant elements from at least one of the N vectors.

7. The method of claim 1 , wherein forming the second tensor comprises:

for each significant element of the component, identifying a corresponding tensor element of the first tensor.

8. The method of claim 1 , wherein:

a single data structure is allocated to both the first and the second tensors; and

forming the second tensor comprises managing the data structure according to indices of the second tensor.

9. The method of claim 1 , wherein forming the second tensor comprises allocating a data structure to the second tensor that is different from a data structure allocated to the first tensor.

10. The method of claim 1 , further comprising:

estimating an optimal decomposition rank for the first tensor; and

selecting the number of components R that is less than the estimated optimal decomposition rank.

11. The method of claim 1 , wherein:

decomposing the first tensor comprises performing Tucker decomposition; and

the component is selected from the R components according to a value of an element of a core tensor G generated during the Tucker decomposition.

12. The method of claim 1 , wherein the specified criterion comprises at least one of:

membership in a set of a specified number of largest elements of the component;

membership in a set of a specified number of largest elements of elements of a vector of the component; and

an element having a value at least equal to a specified threshold.

13. The method of claim 1 , further comprising decreasing a number of modes of the second tensor to a value less than N by:

selecting a mode of the second tensor; and

collapsing tensor elements of the second tensor that correspond to the selected mode into a single combined tensor element of the second tensor.

14. The method of claim 1 , further comprising:

redesignating the second tensor as the first tensor; and

performing a second iteration, comprising repeating steps (a) and (b), with respect to the redesignated first tensor.

15. The method of claim 14 , wherein the selected number of components R in the second iteration is different from the selected number of components R in the first iteration.

16. The method of claim 14 , wherein the number of modes N of the first tensor in the second iteration is different from the number of modes N of the first tensor in the first iteration.

17. The method of claim 1 , further comprising:

generating the first tensor from an original tensor having M modes, wherein M>N, generating the first tensor comprising:

selecting a mode of the original tensor; and

collapsing tensor elements of the original tensor that correspond to the selected mode of the original tensor into a single combined tensor element of the first tensor.

18. The method of claim 17 , wherein:

the step of forming the second tensor comprises increasing a number of modes of the second tensor up to a value M, by:

selecting a combined tensor element of the first tensor that corresponds to a significant element; and

identifying each tensor element of the original tensor that correspond to the combined tensor element.

19. The method of claim 1 , further comprising decomposing the second tensor.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 23, 2023
From: QUALCOMM TECHNOLOGIES, INC.
To: QUALCOMM INCORPORATED
Reel/Frame 064686/0055 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 18, 2021
From: SIGNIFICS AND ELEMENTS, LLC
To: QUALCOMM TECHNOLOGIES, INC.
Reel/Frame 058896/0638 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 22, 2021
From: RESERVOIR LABS, INC.
To: LETHIN, RICHARD
Reel/Frame 057880/0116 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 12, 2021
From: BASKARAN, MUTHU MANIKANDAN; BRUNS-SMITH, DAVID; EZICK, JAMES; LETHIN, RICHARD A.
To: RESERVOIR LABS, INC.
Reel/Frame 057757/0839 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 30, 2021
From: RESERVOIR LABS, INC.
To: SIGNIFICS AND ELEMENTS, LLC
Reel/Frame 057364/0569 →