Reliable supervised machine learning using interval arithmetic
AssigneeModal Technology Corporation
InventorNathan Hayes
Life of this patent
Estimating the term…
Loading patent…
AssigneeModal Technology Corporation
InventorNathan Hayes
Estimating the term…
An interval arithmetic based system and method for solving a global optimization problem is contemplated and provided. Provisions are made for a bisection indexing scheme for a parameter domain of an objective function wherein unique codes are assigned to each iterative interval subset of the parameter domain. Relationships for, between and among iterative subdivisions are arithmetically delimited, with unique codes populating an integer field of a bisection queue system memory component for particular arrays in a bisection context system memory component, and a further integer array of the bisection context. In connection to depth first domain bisection, operations are undertaken relative to the bisection context which are memorialized in relation to the bisection queue, operations which include a work stealing scheme for simultaneous breadth first searching.
An interval arithmetic based domain bisection method for solving a global optimization problem using a computer system characterized by a central processing unit and a modal processing unit operably linked thereto, the modal processing unit characterized by modal interval arithmetic processing units and memory accessible by the central processing unit, memory components of the memory comprised of a bisection context, and a bisection queue, the bisection context characterized by a plurality of arrays, each array of the plurality of arrays having a number of elements equal to a number of variables of an objective function to be minimized, the bisection queue being a collection of bisection records characterized by integer fields, a first integer field being an index to a particular element of an array in the bisection context, a second integer field being a record associated with the particular array element, the method comprising the steps of:
An interval arithmetic based method for solving a global optimization problem using a computer system characterized by a central processing unit and a modal processing unit operably linked thereto, the modal processing unit characterized by a plurality of modal interval arithmetic processing units and memory accessible by the central processing unit, memory components of the memory comprised of a bisection context, a bisection queue, session data and training data, the bisection context including a plurality of arrays (Domain, Bottom, Top, and Subdomain), Domain and Subdomain being interval arrays, Bottom and Top being integer arrays, the arrays having a number of elements equal to a number of variables of an objective function to be minimized, the bisection queue being a collection of bisection records characterized by integer fields (Axis, Item), Axis being an index to a particular element of an array in the bisection context and Item being a record associated with the particular array element, the method comprising the steps of:
Dependencies are inferred from the claim text.