IP Library Patent Application 15982609
Patent Application
App. No. 15/982,609

METHOD AND SYSTEM FOR LEARNING ON GEOMETRIC DOMAINS USING LOCAL OPERATORS

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 None
App. No.
15/982,609
Abstract

A method of extracting features from data defined on geometric domains such as community graphs is disclosed. The method suggests inputting central point data, neighbor point data, and neighbor edge data into an intrinsic local processing layer and applying at least one local operator and at least one operator function, wherein applying the at least one local operator comprises applying at least a local processing function to the data, and applying a local aggregation operation to aggregate the results of the local processing function. The local aggregated operation results are used to determine an output feature. The at least one operator function may be, for example, a Cayley polynomial or a Padé function.

Claims (160)

1 . A method for extracting hierarchical features from input data defined on a geometric domain,

the method comprising

applying at least one intrinsic local processing layer

on local processing layer input data,

at least a part of which being

derived from or corresponding to input data

and comprising

central point input data,

neighbour point input data,

and neighbour edge input data,

to obtain intrinsic local processing layer output data

by

inputting intrinsic local processing layer input data into the intrinsic local

processing layer;

applying at least one local operator; and

applying at least one operator function,

wherein

said at least one local operator is applied to at least some of the intrinsic local processing layer input data in a manner comprising die steps of

applying at least a local processing function to at least some of the central point input data, neighbour point input data, and neighbour edge input data

applying a local aggregation operation to aggregate at least one of the results of said local processing functions

using at least said local aggregation operation result to output an output feature corresponding to said point

and wherein

said operator function comprises applying to said at least one local operator at least one or more of the following operations

multiplication by a non-trivial real or complex scalar

nonlinear scalar function

operator addition

operator multiplication

operator composition

operator inversion

and wherein the intrinsic local processing layer output data is used to extract the hierarchical features.

2 . A method of claim 1 , wherein applying the local processing function further comprises

applying a central point function to at least some of the central point input data to compute a central point feature;

for at least some of the neighbour points, applying a neighbour point function to at least some of the neighbour point input data to compute a neighbour point feature;

for at least some of the neighbour points, applying an edge function to at least some of the pairs of at least central point feature and neighbour point feature, to compute a neighbour edge feature;

applying a local aggregation operation to aggregate at least some of said neighbour edge features;

using at least said local aggregation operation result to output the output feature corresponding to said point.

3 . A method according to claim 1 , wherein the intrinsic local processing layer comprises

first applying the at least one local operator

and then applying the at least one operator function.

4 . The method according to claim 1 , wherein at least one of the operator functions is at least one of the following

a polynomial;

a rational function;

a Cayley polynomial;

a Padé function.

5 . The method according to claim 1 , wherein at least one intrinsic local processing layer comprises more than one local operator, and wherein the at least one of the operator function is a multivariate function applied to more than one local operator,

in particular wherein at least one of the multivariate functions is a one of the following

a multivariate polynomial;

a multivariate rational function;

a multivariate Cayley polynomial;

a multivariate Padé function.

6 . The method according to claim 1 , wherein the at least one local operator is at least one of the following

graph Laplacian operator;

graph motif Laplacian operator;

point-cloud Laplacian operator;

manifold Laplace-Beltrami operator;

mesh Laplacian operator,

in particular

wherein a plurality of local processing operators are applied and wherein at least some of the local processing operators are graph motif Laplacian operators corresponding to a plurality of graph motifs, and at least one operator function is a multivariate function applied to said graph motif Laplacian operators.

7 . The method according to claim 1 , wherein a plurality of local processing functions are applied and wherein at least some of the local processing functions are parametric functions,

and/or wherein they are implemented as neural networks.

8 . The method according to claim 2 , wherein at least some of the

central point functions;

neighbor point functions; and

edge functions

are parametric functions

and/or are implemented as neural networks.

9 . The method according to claim 1 , wherein at least one of the operations effected by at least one operator function on the at least one local operator includes an operator inversion and the operator inversion is carried out in an iterative manner,

in particular such that where the number of iterations is fixed and/or such that the operator inversion is carried out by means of one of

a Jacobi method;

a conjugate gradients method;

a preconditioned conjugate gradients method;

a Gauss-Seidel method;

a minimal residue method;

a multigrid method.

10 . The method according to claim 9 , wherein at least some iterations of the iterative algorithm used to carry out the operator inversion are implemented as layers of a neural network.

11 . The method of claim 1 , where the geometric domain is at least one of the following:

a manifold;

a parametric surface;

an implicit surface;

a mesh;

a point cloud;

a directed graph;

an undirected graph;

a heterogenous graph.

12 . The method of claim 1 , where the input data defined on a geometric domain comprises at least one of vertex input data and edge input data.

13 . The method according to claim 1 , where the at least one local aggregation operation is at least one or more of the following:

a permutation invariant function;

a weighted sum;

a sum;

an average;

a maximum;

a minimum;

an Lp-norm;

a parametric function;

a neural network.

14 . The method according to claim 1 , where the at least one local aggregation operation is a parametric function.

15 . The method according to claim 1 , where the at least one local aggregation operation is implemented as a neural network.

16 . The method according to claim 1 , further comprising applying at least one of the following layers:

a linear layer or fully connected layer, outputting a weighted linear combination of layer input data;

a non-linear layer, including applying a non-linear function to layer input data;

a spatial pooling layer, including:

determining a subset of points on the geometric domain,

determining for each point of said subset,

neighbouring points on the geometric domain,

and

computing a local aggregation operation

on layer input data over the neighbours for all the points of said subset;

a covariance layer, including computing a covariance matrix of input data over at least some of the points of the geometric domain;

and wherein each layer has input data and output data, and wherein output data of one layer are forwarded as input data to another layer.

17 . The method of claim 1 , wherein the applied layer has parameters, said parameters comprising at least one or more of the following:

weights and biases of the linear layers;

parameters of the intrinsic local processing layers, comprising at least one or more of the following:

parameters of the local processing operators;

parameters of the local processing functions;

parameters of the local aggregation operations;

parameters of the central point functions;

parameters of the neighbour point functions;

parameters of the edge functions;

parameters of the operator functions;

18 . The method of claim 17 , where parameters of the operator function comprise at least one or more of the following:

coefficients of a polynomial;

coefficients of a multivariate polynomial;

coefficients of a Cayley polynomial;

coefficients of a multivariate Cayley polynomial;

coefficients of a Padé function;

coefficients of a multivariate Padé function;

spectral zoom;

in particular

wherein parameters of the applied layers are determined by minimizing a cost function by means of an optimization procedure.

19 . A system for extracting hierarchical features from a set of data defined on a geometric domain, the system comprising

at least one interface for inputting input data into the system and for outputting output data by the system,

the system further comprising

means for applying at least one intrinsic local processing layer on local processing layer input data,

means for determining the local processing layer input data in response to input data and and comprising central point input data, neighbour point input data, and neighbour edge input data

to obtain intrinsic local processing layer output data,

the means for applying at least one intrinsic local processing layer on local processing layer input data being adapted

to input intrinsic local processing layer input data into the intrinsic local processing layer;

to apply at least one local operator; and

to apply at least one operator function;

and being adapted such that

said at least one local operator is applied to at least some of the intrinsic local processing layer input data in a manner comprising

applying at least a local processing function to at least some of the central point input data, neighbour point input data, and neighbour edge input data,

applying a local aggregation operation to aggregate at least one of the results of said local processing functions,

using at least said local aggregation operation result to output an output feature corresponding to said point

and such that

said operator function comprises applying to said at least one local operator at least one or more of the following operations

multiplication by a non-trivial real or complex scalar,

nonlinear scalar function,

operator addition,

operator multiplication,

operator composition,

operator inversion,

and wherein the means for applying said at least one intrinsic local processing layer on local processing layer input data being adapted to use the intrinsic local processing layer output data to extract the hierarchical feature.

20 . A system according to claim 19 , comprising

means for applying a plurality of at least a first and a second layer in a sequential manner such that the first layer is applied first and the second layer is applied thereafter,

and furthermore comprising a means for allowing use of the output data of the first layer to determine input data to the second layer and configured such that

different data processing devices are provided for applying the first layer and the second layer respectively

and a communication path is provided to propagate the output data of the first layer towards the second layer, so that input data to the second layer can be determined therefrom;

and/or such that

a storage is provided for storing output data of the first layer so that input data into the second layer can be determined at later time by retrieving the stored output data from the storage.

Assignments (13)
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS (REEL 062079, FRAME 0677) Recorded Mar 3, 2026
From: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT
To: X CORP. (F/K/A TWITTER, INC.)
Reel/Frame 075015/0574 →
RELEASE OF SECURITY INTEREST Recorded Apr 30, 2025
From: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT
To: X CORP. (F/K/A TWITTER, INC.)
Reel/Frame 071127/0240 →
RELEASE OF SECURITY INTEREST Recorded Mar 27, 2025
From: MORGAN STANLEY SENIOR FUNDING, INC.
To: X CORP. (F/K/A TWITTER, INC.)
Reel/Frame 070670/0857 →
SECURITY INTEREST Recorded Oct 28, 2022
From: TWITTER, INC.
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 061804/0001 →
SECURITY INTEREST Recorded Oct 28, 2022
From: TWITTER, INC.
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 061804/0086 →
SECURITY INTEREST Recorded Oct 28, 2022
From: TWITTER, INC.
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 062079/0677 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2022
From: FABULA AI LIMITED
To: T.I. SPARROW IRELAND II
Reel/Frame 060272/0679 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2022
From: T.I. SPARROW IRELAND II
To: T.I. GROUP III LLC
Reel/Frame 060272/0729 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2022
From: T.I. GROUP III LLC
To: T.I. SPARROW IRELAND I
Reel/Frame 060272/0776 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2022
From: T.I. GROUP I LLC
To: TWITTER, INC.
Reel/Frame 060272/0807 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2022
From: T.I. SPARROW IRELAND I
To: T.I. GROUP I LLC
Reel/Frame 060272/0822 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 2, 2018
From: UNIVERSITA DELLA SVIZZERA ITALIANA
To: FABULA AI LIMITED
Reel/Frame 047404/0902 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 14, 2018
From: BRONSTEIN, MICHAEL; LEVIE, RON; MONTI, FEDERICO
To: UNIVERSITA DELLA SVIZZERA ITALIANA
Reel/Frame 046815/0182 →