IP Library Granted Patent US 12,481,890
Granted Patent B2
US 12,481,890 · App. 17/371,348 · Granted Nov 25, 2025

Systems and methods for applying semi-discrete calculus to meta machine learning

Inventor: Amir Shachar (Haifa, IL)
Assignee: Nice Ltd.
G06N3/084
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,481,890
App. No.
17/371,348
Granted
Nov 25, 2025
Kind
B2
Abstract

A method and system for building and implementing a meta-machine learning (meta-ML) optimization engine for a neural network (NN) or a machine learning (ML) connective model. A computer processor may iteratively simulate a backpropagation algorithm by executing a sequence of optimization steps. At each optimization step a position of a loss function may be determined that may be closer than a previously determined position of the loss function to a local minimum. A computer processor may compute and store after each iteration a detachment of the loss function, learning rate, and optimal learning rate. A computer processor may train a machine learning connective model to model the optimal learning rates of the simulated backpropagation algorithm. The meta-ML optimization engine may be implemented for a NN or ML connective model by generating a modified backpropagation algorithm in which algorithmic features of gradient descent may be replaced by the meta-ML optimization engine.

Claims (60)

1 . A method for building a meta-machine learning (meta-ML) optimization engine for a neural network (NN) or a machine learning (ML) connective model, the method comprising using a computer processor:

computing local minima of a loss function for a data set;

storing a detachment of the loss function at a selected position of a parameter of the loss function;

iteratively simulating a backpropagation algorithm by executing a sequence of optimization steps, wherein at each iteration an optimization step is configured to determine a position of a parameter of the loss function that is closer than the selected position of the parameter of the loss function or a position of the parameter of the loss function determined in a previous iteration to a local minimum of the loss function, wherein the simulated backpropagation algorithm avoids calculating a derivative of the loss function;

computing at each iteration a detachment of the loss function and learning rate at the position of a determined parameter of the loss function;

computing at each iteration one or more optimal learning rates, wherein an optimal learning rate comprises an absolute value of a difference between the position of a determined parameter of the loss function and the position of a local minimum of the loss function, wherein the local minimum of the loss function is determined by an analysis of detachments;

storing after each iteration the computed detachment, learning rate, and optimal learning rates;

using one or more of the stored detachments as an explaining variable in the simulated backpropagation algorithm; and

training a ML connective model to model the optimal learning rates of the simulated backpropagation algorithm, wherein the training is initiated before a termination of the simulated backpropagation algorithm, wherein the training is based on data accumulated in one or more iterations of the simulated backpropagation algorithm, and wherein the training comprises incrementally updating a learning rate of the ML connective model based on batches of the stored learning rates from the simulated backpropagation algorithm.

2 . The method of claim 1 comprising: computing at each iteration an absolute value of the difference between the position of a determined parameter of the loss function and the position of a determined parameter of the loss function in a previous iteration.

3 . The method of claim 2 comprising: iteratively simulating the backpropagation algorithm until the absolute value of the difference between the position of a determined parameter of the loss function and the position of the determined parameter of the loss function in a previous iteration satisfies a minimum threshold.

4 . The method of claim 1 wherein the backpropagation algorithm is a variant of RProp that uses a detachment operator in place of a derivative operator.

5 . The method of claim 1 wherein the selected position of the parameter of the loss function is selected randomly.

6 . The method of claim 1 wherein the backpropagation algorithm is iteratively simulated by a Monte Carlo method.

7 . The method of claim 1 wherein the ML connective model is XGBoost.

8 . The method of claim 1 comprising: collecting into respective features of the ML connective model tuples of consecutive identical detachments,

wherein if a dimensionality of the tuple is equal to or greater than a threshold an explained variable of the ML connective model is explored; and

wherein if the dimensionality of the tuple is less than the threshold the explained variable of the ML connective model is exploited.

9 . A method for implementing a meta-machine learning (meta-ML) optimization engine for a neural network (NN) or a machine learning (ML) connective model, the method comprising using a computer processor:

generating training data and data by preparing raw training data and raw data;

generating a modified backpropagation algorithm by replacing algorithmic traits of gradient descent in a backpropagation algorithm that uses gradient descent with the meta-ML optimization engine, wherein the modified backpropagation algorithm comprises:

computing at each iteration a detachment of a loss function and learning rate at a position of a determined parameter of the loss function a plurality of iterations, wherein the modified backpropagation algorithm avoids calculating a derivative of the loss function; and

computing at each iteration one or more optimal learning rates, wherein an optimal learning rate comprises an absolute value of a difference between the position of a determined parameter of the loss function and the position of a local minimum of the loss function, wherein the local minimum of the loss function is determined by an analysis of detachments;

wherein one or more of the detachments are used as an explaining variable in the modified backpropagation algorithm;

training the NN or ML connective model using training data and the modified backpropagation algorithm, wherein the training is initiated before a termination of the modified backpropagation algorithm, wherein the training is based on data accumulated in one or more iterations of the modified backpropagation algorithm, and wherein the training comprises incrementally updating a learning rate of the NN or ML connective model based on batches of the computed learning rates from the modified backpropagation algorithm; and

applying the trained NN or ML connective model to data.

10 . The method of claim 9 wherein the algorithmic traits of gradient descent only use numerical differentiation.

11 . The method of claim 9 comprising: training the NN or ML connective model to detect financial fraud.

12 . A system for building a meta-machine learning (meta-ML) optimization engine for a neural network (NN) or a machine learning (ML) connective model, the system comprising:

a memory; and

one or more processors configured to:

compute local minima of a loss function for a data set;

store a detachment of the loss function at a selected position of a parameter of the loss function;

iteratively simulate a backpropagation algorithm by executing a sequence of optimization steps, wherein at each iteration an optimization step is configured to determine a position of a parameter of the loss function that is closer than the selected position of the parameter of the loss function or a position of the parameter of the loss function determined in a previous iteration to a local minimum of the loss function, wherein the simulated backpropagation algorithm avoids calculating a derivative of the loss function;

compute at each iteration a detachment of the loss function and learning rate at the position of a determined parameter of the loss function;

compute at each iteration one or more optimal learning rates, wherein an optimal learning rate comprises an absolute value of a difference between the position of a determined parameter of the loss function and the position of a local minimum of the loss function, wherein the local minimum of the loss function is determined by an analysis of detachments;

store after each iteration the computed detachment, learning rate, and optimal learning rates;

use one or more of the stored detachments as an explaining variable in the simulated backpropagation algorithm; and

train a ML connective model to model the optimal learning rates of the simulated backpropagation algorithm, wherein the training is initiated before a termination of the simulated backpropagation algorithm, wherein the training is based on data accumulated in one or more iterations of the simulated backpropagation algorithm, and wherein the training comprises incrementally updating a learning rate of the ML connective model based on batches of the stored learning rates from the simulated backpropagation algorithm.

13 . The system of claim 12 wherein the one or more processors are configured to compute at each iteration an absolute value of the difference between the position of a determined parameter of the loss function and the position of a determined parameter of the loss function in a previous iteration.

14 . The system of claim 13 wherein the one or more processors are configured to iteratively simulate the backpropagation algorithm until the absolute value of the difference between the position of a determined parameter of the loss function and the position of the determined parameter of the loss function in a previous iteration satisfies a minimum threshold.

15 . The system of claim 12 wherein the backpropagation algorithm is a variant of RProp that uses a detachment operator in place of a derivative operator.

16 . The system of claim 12 wherein the selected position of the parameter of the loss function is selected randomly.

17 . The system of claim 12 wherein the one or more processors are configured to iteratively simulate the backpropagation algorithm by using a Monte Carlo method.

18 . The system of claim 12 wherein the ML connective model is XGBoost.

19 . The system of claim 12 wherein the one or more processors are configured to collect into respective features of the ML connective model tuples of consecutive identical detachments,

wherein if a dimensionality of the tuple is greater than or equal to a threshold an explained variable of the ML connective model is explored; and

wherein if the dimensionality of the tuple is less than the threshold the explained variable of the ML connective model is exploited.

20 . A system for implementing a meta-machine learning (meta-ML) optimization engine for a neural network (NN) or a machine learning (ML) connective model, the system comprising:

a memory; and

one or more processors configured to:

generate training data and data by preparing raw training data and raw data;

generate a modified backpropagation algorithm by replacing algorithmic traits of gradient descent in a backpropagation algorithm that uses gradient descent with the meta-ML optimization engine, wherein the modified backpropagation algorithm comprises:

computing at each iteration a detachment of a loss function and learning rate at a position of a determined parameter of the loss function a plurality of iterations, wherein the modified backpropagation algorithm avoids calculating a derivative of the loss function; and

computing at each iteration one or more optimal learning rates, wherein an optimal learning rate comprises an absolute value of a difference between the position of a determined parameter of the loss function and the position of a local minimum of the loss function, wherein the local minimum of the loss function is determined by an analysis of detachments;

wherein one or more of the detachments are used as an explaining variable in the modified backpropagation algorithm;

train the NN or ML connective model using the training data and the modified backpropagation algorithm, wherein the training is initiated before a termination of the modified backpropagation algorithm, wherein the training is based on data accumulated in one or more iterations of the modified backpropagation algorithm, and wherein the training comprises incrementally updating a learning rate of the NN or ML connective model based on batches of the computed learning rates from the modified backpropagation algorithm; and

apply the trained NN or ML connective model to the data.

21 . The system of claim 20 wherein the algorithmic traits of gradient descent only use numerical differentiation.

22 . The system of claim 20 wherein the one or more processors are configured to train the NN or ML connective model to detect financial fraud.

Assignments (2)
SECURITY INTEREST Recorded Feb 26, 2026
From: NICE LTD; NICE SYSTEMS INC.; NICE SYSTEMS TECHNOLOGIES INC.; INCONTACT, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 074986/0208 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 23, 2021
From: SHACHAR, AMIR
To: NICE LTD.
Reel/Frame 057571/0594 →
Continuity (2)
Provisional Application 63050224 · Jul 10, 2020
Related Publication 20220012309A1 · Jan 13, 2022
References Cited (48)
US 20120290519A1 · Fontaine · 2012 [cited by examiner]
US 20170140269A1 · Schaul · 2017 [cited by examiner]
CN 107067020A · 2017 [cited by examiner]
JP 2020008896A · 2020 [cited by examiner]
WO WO2020090947A1 · 2020 [cited by examiner]
WO WO2020147461A1 · 2020 [cited by examiner]
McCaffrey, “How to Use Resilient Back Propagation to Train Neural Networks”, Mar. 9, 2015, Visual Studio Magazine, https://visualstudiomagazine.com/articles/2015/03/01/resilient-back-propagation.aspx (Year: 2015), McCaf… [cited by examiner]
Finkelstein, “Introduction To Semi-discrete Calculus A Theory Behind The Integral Image Algorithm”, Apr. 2, 2011 (Year: 2011). [cited by examiner]
Andrychowicz, Marcin, et al. “Learning to learn by gradient descent by gradient descent.” [cited by applicant]
Behnke, Sven. [cited by applicant]
Byrne, Jeffrey. “Nested motion descriptors.” [cited by applicant]
Chen, Zhixiang, et al. “Deep hashing via discrepancy minimization.” [cited by applicant]
Chen, Tiangi, and Carlos Guestrin. “Xgboost: A scalable tree boosting system.” [cited by applicant]
Daniel, Christian, Jonathan Taylor, and Sebastian Nowozin. “Learning step size controllers for robust neural network training.” [cited by applicant]
Finkelstein, Amir. “On Semi-discrete Operators: Theoretical Aspects of the Integral Image Algorithm.” Apr. 2, 2011. [cited by applicant]
Gallardo, Mathias, et al. “Shape-from-template in flatland.” [cited by applicant]
Ganin, Yaroslav, and Victor Lempitsky. “Unsupervised domain adaptation by backpropagation.” [cited by applicant]
Goodfellow, Ian J., Jonathon Shlens, and Christian Szegedy. “Explaining and harnessing adversarial examples.” arXiv preprint arXiv:1412.6572; Mar. 2, 2015. [cited by applicant]
Hochreiter, Sepp, A. Steven Younger, and Peter R. Conwell. “Learning to learn using gradient descent.” [cited by applicant]
Hu, Zhe, et al. “Deblurring low-light images with light streaks.” [cited by applicant]
Kong, Xiangyu, et al. “Collaborative deep reinforcement learning for joint object search.” [cited by applicant]
Kurakin, Alexey, Ian Goodfellow, and Samy Bengio. “Adversarial examples in the physical world.” Jul. 8, 2016. [cited by applicant]
Lafond, Jean, Hoi-To Wai, and Eric Moulines. “On the online Frank-Wolfe algorithms for convex and non-convex optimizations.” arXiv preprint arXiv:1510.01171; Aug. 15, 2016. [cited by applicant]
Seok Lee, Hee, and Kuoung Mu Lee. “Simultaneous super-resolution of depth and images using a single camera.” [cited by applicant]
Li, Debang, et al. “A2-RL: Aesthetics aware reinforcement learning for image cropping.” [cited by applicant]
Liu, Li, et al. “Discretely coding semantic rank orders for supervised image hashing.” [cited by applicant]
Lovasz, Laszlo. “One mathematics.” [cited by applicant]
Moosavi-Dezfooli, Seyed-Mohsen, et al. “Robustness via curvature regularization, and vice versa.” [cited by applicant]
Moosavi-Dezfooli, Seyed-Mohsen, Alhussein Fawzi, and Pascal Frossard. “Deepfool: a simple and accurate method to fool deep neural networks.” [cited by applicant]
Mousavi, All, Arian Maleki, and Richard G. Baraniuk. “Consistent parameter estimation for LASSO and approximate message passing.” [cited by applicant]
Navalpakkam, Vidhya, and Laurent Itti. “Optimal cue selection strategy.” [cited by applicant]
Pan, Jinshan, et al. “Robust kernel estimation with outliers handling for image deblurring.” [cited by applicant]
Ramdas, Aaditya, and Aarti Singh. “Algorithmic connections between active learning and stochastic convex optimization.” [cited by applicant]
Redi, Miriam, et al. “6 seconds of sound and vision: Creativity in micro-videos.” [cited by applicant]
Shachar, Amir. “Applying Semi-discrete Operators To Calculus.” arXiv preprint arXiv:1012.5751 (Jun. 2, 2014). [cited by applicant]
Schmidhuber, Jürgen. “Learning to control fast-weight memories: An alternative to dynamic recurrent networks.” [cited by applicant]
Silva, Michel, et al. “A weighted sparse sampling and smoothing frame transition approach for semantic fast-forward first-person videos.” [cited by applicant]
Sommer, Johanna, Dimitrios Sarigiannis, and Thomas Parnell. “Learning to Tune XGBoost with XGBoost.” arXiv preprint arXiv:1909.07218 (Nov. 21, 2019). [cited by applicant]
Sportisse, Aude, et al. “Debiasing Averaged Stochastic Gradient Descent to handle missing values.” [cited by applicant]
Tang, Yansong, et al. “Deep progressive reinforcement learning for skeleton-based action recognition.” [cited by applicant]
Thrun, Sebastian, and Lorien Pratt. “Learning to learn: Introduction and overview.” [cited by applicant]
Tron, Roberto, and Kostas Daniilidis. “On the quotient representation for the essential manifold.” [cited by applicant]
Viola, Paul, and Michael Jones. “Rapid object detection using a boosted cascade of simple features.” [cited by applicant]
Wang, Hachan, and Bhiksha Raj. “On the origin of deep learning.” arXiv preprint arXiv:1702.07800 (Mar. 3, 2017). [cited by applicant]
Wang, Xiaogang, et al. “Shape and appearance context modeling.” [cited by applicant]
Li, Wei, and Xiaogang Wang. “Locally aligned feature transforms across views.” [cited by applicant]
Zhai, Shaodan, et al. “Direct 0-1 loss minimization and margin maximization with boosting.” [cited by applicant]
Zhu, Yu, et al. “Modeling deformable gradient compositions for single-image super-resolution.” [cited by applicant]