# US 2022/0036245 A1 · EXTRACTING SEQUENCES FROM d-DIMENSIONAL INPUT DATA FOR SEQUENTIAL PROCESSING WITH NEURAL NETWORKS

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0036245 A1
- Document ID: US20220036245A1
- Status: Published application
- Kind: A1
- Application number: 16/940,925
- Filed: 2020-07-28
- Published: 2022-02-03
- Earliest claimed: 2020-07-28
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Lorenz K. Muller; Pascal Stark; Stefan Abel
- Web page: https://patentgrep.com/patent/US20220036245A1

## CPC

- G06N 20/20: Ensemble learning
- G06F 17/18: for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)}
- G06F 18/24: Classification techniques
- G06N 3/04: Architecture, e.g. interconnection topology
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/065: Analogue means
- G06N 3/08: Learning methods
- G06N 3/09: Supervised learning
- G06N 5/04: Inference or reasoning models
- G06V 10/44: Local feature extraction by analysis of parts of the pattern, e.g. by detecting edges, contours, loops, corners, strokes or intersections; Connectivity analysis, e.g. of connected components
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/045: Combinations of networks
- G06N 3/049: Temporal neural networks, e.g. delay elements, oscillating neurons or pulsed inputs
- G06V 10/82: using neural networks
- G06V 30/10: Character recognition
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

A method and computer program product for obtaining values are run using a neural network according to a machine learning algorithm. One embodiment may comprise accessing one or more datafiles of input data, where the input data is representable in a d-dimensional space, with d>1. The method may explore N distinct paths of the input data in the d-dimensional space, where N≥1, and collects data along the N distinct paths explored to respectively form N sequences of M objects each, with M≥2. For one or more sequences of the N sequences formed, values obtained from the M objects of each sequence may be coupled into one or more input nodes of a neural network, which is then run according to the machine learning algorithm to obtain L output values from, L≥1.

## Claims

### Claim 1

A computer-implemented method of obtaining values by running a neural network according to a machine learning algorithm designed to operate on sequences of data, the method comprising:
accessing one or more datafiles of input data representable in a d-dimensional space, wherein d>1;
by a processor, forming N sequences of M objects each by exploring N distinct paths of said input data in the d-dimensional space and collecting data along the N distinct paths explored, wherein N≥1 and M≥2;
for one or more sequences of the N sequences formed, by the processor, coupling values obtained from the M objects of said sequence into one or more input nodes of a neural network and running the neural network according to said machine learning algorithm to obtain L output values, wherein L≥1; and
by the processor, performing a prediction or a classification based on the N inferences performed.

### Claim 2 (depends on 1)

The computer-implemented method according to claim 1, further comprising:
prior to coupling said values, setting, for each of the N sequences formed, the network according to a given set of parameters of a cognitive model.

### Claim 3 (depends on 2)

The computer-implemented method according to claim 2, further comprising:
transmitting the prediction or the classification based on the N inferences performed.

### Claim 4 (depends on 1)

The computer-implemented method according to claim 1, wherein:
N>1 and the method further comprises averaging out outcomes from said N inferences.

### Claim 5 (depends on 1)

The computer-implemented method according to claim 1, wherein:
said machine learning algorithm is a cognitive algorithm and the network is run according to said cognitive algorithm to train a cognitive model in a supervised manner with respect to a same set of L target output values for each of the N sequences formed, permitting the cognitive algorithm to learn N sets of parameters of the cognitive model based on the same set of L target output values.

### Claim 6 (depends on 5)

The computer-implemented method according to claim 5, wherein:
N>1 and the method further comprises obtaining an ensemble model based on the N sets of parameters learned.

### Claim 7 (depends on 6)

The computer-implemented method according to claim 6, wherein the method further comprises, after having obtained the ensemble model, performing inferences by:
accessing one or more further datafiles of further input data representable in the d-dimensional space;
exploring N′ distinct paths of said further input data in the d-dimensional space, wherein the N′ distinct paths are selected from the N distinct paths previously explored, 1≤N′≤N, and, based on the further input data, collecting data along the N′ distinct paths explored to respectively form N′ sequences of M objects each; and
for each sequence of the N′ sequences formed, coupling values obtained from the M objects of each of the N′ sequences formed into the one or more input nodes of the neural network and running the latter to obtain L output values, to eventually obtain N′ sets of L output values.

### Claim 8 (depends on 7)

The computer-implemented method according to claim 7, wherein:
the cognitive model obtained includes a set of N base learners, each corresponding to a respective one of the N distinct paths; and
the method further comprises selecting N′ base learners corresponding to respective ones of the N′ distinct paths selected and assigning each of the N′ base learners selected to a respective one of the N′ sequences formed.

### Claim 9 (depends on 5)

The computer-implemented method according to claim 5, wherein the method further comprises, while the network is being run to train the cognitive model, and for each sequence of one or more of the N sequences formed:
pausing the cognitive algorithm that is being trained; and
coupling values obtained from the M objects of distinct one of the N sequences formed into the one or more input nodes of the network and resuming the training of the cognitive algorithm.

### Claim 10 (depends on 1)

The computer-implemented method according to claim 1, further comprising:
devising each path of said N distinct data paths according to a random walk.

### Claim 11 (depends on 10)

The computer-implemented method according to claim 10, wherein:
at devising said each path, step sizes of said random walk are chosen at random, in addition to said directions.

### Claim 12 (depends on 10)

The computer-implemented method according to claim 10, wherein:
devising said random walk comprises, at each step j thereof, j≥2, generating a jth direction at random in said d-dimensional space, merging the jth direction generated with the j−1th direction as generated at step j−1 of the walk to obtain a merged direction, and advancing the walk by one step in the merged direction.

### Claim 13 (depends on 1)

The computer-implemented method according to claim 1, further comprising:
devising each path of said N distinct path according to a random shot.

### Claim 14 (depends on 1)

The computer-implemented method according to claim 1, wherein:
the network is run according to a recurrent neural network algorithm.

### Claim 15 (depends on 1)

The computer-implemented method according to claim 1, wherein:
the network is run according to an echo state network algorithm.

### Claim 16 (depends on 1)

The computer-implemented method according to claim 1, wherein:
the network is run according to a feedforward neural network algorithm.

### Claim 17 (depends on 1)

The computer-implemented method according to claim 1, wherein:
each of the M objects of each of the N sequences is a k-dimensional object, k≥1, comprising Nk values, Nk≥2.

### Claim 18 (depends on 17)

The computer-implemented method according to claim 17, wherein:
the network comprises Nk input nodes; and
the method further comprises, for each of the N sequences, sequentially coupling M sets of values into said Nk input nodes, in order to sequentially run the network for each of M objects of each of the N sequences, according to a sequential processing algorithm.

### Claim 19 (depends on 17)

The computer-implemented method according to claim 17, wherein:
k≥2.

### Claim 20

A computer program product for obtaining values by running a neural network according to a machine learning algorithm designed to operate on sequences of data, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor, so as to cause the processor to:
access one or more datafiles of input data representable in a d-dimensional space, d>1;
explore N distinct paths of said input data in the d-dimensional space, N≥1, and collect data along the N distinct paths explored to respectively form N sequences of M objects each, M≥2; and
for each sequence of the N sequences formed, couple values obtained from the M objects of said each sequence into one or more input nodes of a neural network and run the neural network according to said machine learning algorithm to obtain L output values, L≥1.
