IP Library › Granted Patent US 12,462,189
Granted Patent B2
US 12,462,189 · App. 17/423,601 · Granted Nov 4, 2025

Robust and data-efficient blackbox optimization

Inventors: Krzysztof Choromanski (Lincroft, NJ); Vikas Sindhwani (Mt. Kisco, NY); Aldo Pacchiano Camacho (Berkeley, CA)
G06N20/00G06F17/11
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,462,189
App. No.
17/423,601
Granted
Nov 4, 2025
Kind
B2
Abstract

The present disclosure provides iterative blackbox optimization techniques that estimate the gradient of a function. According to an aspect of the present disclosure, a plurality of perturbations used at each iteration can be sampled from a non-orthogonal sampling distribution. As one example, in some implementations, perturbations that have been previously evaluated in previous iterations can be re-used at the current iteration, thereby conserving computing resources because the re-used perturbations do not need to be re-evaluated at the current iteration. In another example, in addition or alternatively to the use of previously evaluated perturbations, the perturbations evaluated at the current iteration can be sampled from a non-orthogonal sampling distribution.

Claims (51)

1 . A computer-implemented method, comprising:

obtaining, by one or more computing devices, data descriptive of current values of a plurality of parameters of a machine-learned model; and

for at least one of one or more iterations:

identifying, by the one or more computing devices, one or more previously evaluated perturbations based at least in part on the current values of the plurality of parameters of the machine-learned model;

sampling, by the one or more computing devices, a plurality of perturbations to the current values of the plurality of parameters of the machine-learned model from a non-orthogonal sampling distribution, the plurality of perturbations including the one or more previously evaluated perturbations;

determining, by the one or more computing devices, a plurality of performance values respectively for the plurality of perturbations, wherein the performance value for each perturbation is generated through evaluation, by a performance evaluation function, of a performance of the machine-learned model with the current values of its parameters perturbed according to the perturbation, wherein determining the plurality of performance values comprises re-using one or more previously evaluated performance values respectively for the one or more previously evaluated perturbations;

performing, by the one or more computing devices, a regression with respect to the plurality of perturbations and the plurality of performance values to estimate a gradient of the performance evaluation function; and

modifying, by the one or more computing devices, the current value of at least one of the plurality of parameters of the machine-learned model based at least in part on the estimated gradient of the performance evaluation function; and

after the one or more iterations, providing, by the one or more computing devices, final values of the plurality of parameters of the machine-learned model as an output,

wherein the one or more previously evaluated perturbations are included within a trust region associated with the current values of the plurality of parameters, and

wherein identifying, by the one or more computing devices, the one or more previously evaluated perturbations that are included within the trust region comprises identifying, by the one or more computing devices, any previously evaluated perturbations that are within a radius from the current values of the plurality of parameters.

2 . The computer-implemented method of claim 1 , wherein identifying, by the one or more computing devices, the one or more previously evaluated perturbations that are included within the trust region comprises identifying, by the one or more computing devices, a fixed fraction of previously evaluated perturbations that are closest to the current values of the plurality of parameters.

3 . The computer-implemented method of claim 1 , wherein performing, by the one or more computing devices, the regression with respect to the plurality of perturbations and the plurality of performance values comprises determining, by the one or more computing devices, a forward finite-difference evolution strategy estimator based on the plurality of perturbations and the plurality of performance values.

4 . The computer-implemented method of claim 1 , wherein performing, by the one or more computing devices, the regression with respect to the plurality of perturbations and the plurality of performance values comprises determining, by the one or more computing devices, an antithetic evolution strategy estimator based on the plurality of perturbations and the plurality of performance values.

5 . The computer-implemented method of claim 1 , wherein the machine-learned model comprises a reinforcement learning policy and the performance evaluation function comprises a reward function that determines a reward for actions taken in accordance with the reinforcement learning policy.

6 . The computer-implemented method of claim 1 , wherein the machine-learned model comprises a neural network.

7 . The computer-implemented method of claim 1 , wherein the parameters of the machine-learned model comprise hyperparameters of the machine-learned model.

8 . The computer-implemented method of claim 1 , wherein the machine-learned model comprises a structured network with weight sharing mechanisms.

9 . The computer-implemented method of claim 1 , wherein performing, by the one or more computing devices, the regression with respect to the plurality of perturbations and the plurality of performance values comprises performing, by the one or more computing devices, an under-constrained linear regression with respect to the plurality of perturbations and the plurality of performance values.

10 . The computer-implemented method of claim 1 , wherein performing, by the one or more computing devices, the regression with respect to the plurality of perturbations and the plurality of performance values comprises performing, by the one or more computing devices, an L1- or L2-regularized regression with respect to the plurality of perturbations and the plurality of performance values.

11 . A computing system, comprising:

one or more processors; and

one or more non-transitory computer-readable media that collectively store instructions that, when executed by the one or more processors, cause the computing system to perform operations, the operations comprising:

obtaining data descriptive of current values of a plurality of parameters of a machine-learned model; and

for at least one iteration of one or more iterations:

identifying one or more previously evaluated perturbations that are included within a trust region associated with the current values of the plurality of parameters;

accessing one or more previously evaluated performance values respectively for the one or more previously evaluated perturbations that are included within the trust region;

sampling a plurality of additional perturbations to the current values of the plurality of parameters of the machine-learned model from a sampling distribution;

determining a plurality of additional performance values respectively for the plurality of additional perturbations, wherein the performance value for each additional perturbation is generated through evaluation, by a performance evaluation function, of a performance of the machine-learned model with the current values of its parameters perturbed according to the additional perturbation;

performing a regression with respect to a first combination of the one or more previously evaluated perturbations with the plurality of additional perturbations and a second combination of the one or more previously evaluated performance values with the plurality of additional performance values to estimate a gradient of the performance evaluation function; and

modifying the current value of at least one of the plurality of parameters of the machine-learned model based at least in part on the estimated gradient of the performance evaluation function,

wherein identifying the one or more previously evaluated perturbations that are included within the trust region comprises identifying a fixed fraction of previously evaluated perturbations that are closest to the current values of the plurality of parameters.

12 . The computing system of claim 11 , wherein identifying the one or more previously evaluated perturbations that are included within the trust region comprises identifying any previously evaluated perturbations that are within a radius from the current values of the plurality of parameters.

13 . The computing system of claim 11 , wherein performing the regression comprises determining a forward finite-difference evolution strategy estimator based on the first combination of the one or more previously evaluated perturbations with the plurality of additional perturbations and the second combination of the one or more previously evaluated performance values with the plurality of additional performance values.

14 . The computing system of claim 11 , wherein performing the regression comprises determining an antithetic evolution strategy estimator based on the first combination of the one or more previously evaluated perturbations with the plurality of additional perturbations and the second combination of the one or more previously evaluated performance values with the plurality of additional performance values.

15 . One or more non-transitory computer-readable media that collectively store operations that when executed by a computing system cause the computing system to perform operations, the operations comprising:

obtaining data descriptive of current values of a plurality of parameters of a machine-learned model; and

for at least one of one or more iterations:

identifying, by the one or more computing devices, one or more previously evaluated perturbations based at least in part on the current values of the plurality of parameters of the machine-learned model;

sampling a plurality of perturbations to the current values of the plurality of parameters of the machine-learned model from a non-orthogonal sampling distribution, the plurality of perturbations including the one or more previously evaluated perturbations;

determining a plurality of performance values respectively for the plurality of perturbations, wherein the performance value for each perturbation is generated through evaluation, by a performance evaluation function, of a performance of the machine-learned model with the current values of its parameters perturbed according to the perturbation, wherein determining the plurality of performance values comprises re-using one or more previously evaluated performance values respectively for the one or more previously evaluated perturbations;

performing a regression with respect to the plurality of perturbations and the plurality of performance values to estimate a gradient of the performance evaluation function; and

modifying the current value of at least one of the plurality of parameters of the machine-learned model based at least in part on the estimated gradient of the performance evaluation function; and

after the one or more iterations, providing final values of the plurality of parameters of the machine-learned model as an output,

wherein the one or more previously evaluated perturbations are included within a trust region associated with the current values of the plurality of parameters, and

wherein identifying the one or more previously evaluated perturbations that are included within the trust region comprises identifying any previously evaluated perturbations that are within a radius from the current values of the plurality of parameters.

16 . The one or more non-transitory computer-readable media of claim 15 , wherein identifying the one or more previously evaluated perturbations that are included within the trust region comprises identifying a fixed fraction of previously evaluated perturbations that are closest to the current values of the plurality of parameters.

17 . The one or more non-transitory computer-readable media of claim 15 , wherein performing the regression with respect to the plurality of perturbations and the plurality of performance values comprises determining a forward finite-difference evolution strategy estimator based on the plurality of perturbations and the plurality of performance values.

18 . The one or more non-transitory computer-readable media of claim 15 , plurality of perturbations and the plurality of performance values comprises determining an antithetic evolution strategy estimator based on the plurality of perturbations and the plurality of performance values.

19 . The one or more non-transitory computer-readable media of claim 15 , wherein the machine-learned model comprises a reinforcement learning policy and the performance evaluation function comprises a reward function that determines a reward for actions taken in accordance with the reinforcement learning policy.

20 . The one or more non-transitory computer-readable media of claim 15 , wherein the machine-learned model comprises a neural network.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 19, 2021
From: CHOROMANSKI, KRZYSZTOF; SINDHWANI, VIKAS; PACCHIANO CAMACHO, ALDO
To: GOOGLE LLC
Reel/Frame 057832/0897 →
Continuity (2)
Provisional Application 62793248 · Jan 16, 2019
Related Publication 20220108215A1 · Apr 7, 2022
References Cited (25)
US 10482392B2 · Rendle et al. · 2019 [cited by applicant]
US 20120317060A1 · Jebara · 2012 [cited by examiner]
US 20150331835A1 · Avron · 2015 [cited by examiner]
US 20160003652A1 · Varun et al. · 2016 [cited by applicant]
US 20180149720A1 · Zhao · 2018 [cited by examiner]
US 20180285759A1 · Wood · 2018 [cited by examiner]
US 20190197244A1 · Fong · 2019 [cited by examiner]
US 20200134506A1 · Wang · 2020 [cited by examiner]
US 20200226496A1 · Basu · 2020 [cited by examiner]
US 20210357740A1 · He · 2021 [cited by examiner]
US 20220058175A1 · Sawada · 2022 [cited by examiner]
CN 103780522 · 2014 [cited by applicant]
CN 104616267 · 2015 [cited by applicant]
CN 108257116 · 2018 [cited by applicant]
CN 109165416 · 2019 [cited by applicant]
Lehman et al. (ES is more than just a traditional finite-difference approximator, GECCO: Proceedings of the Genetic and Evolutionary Computation Conference, published 2018; pp. 1-8). (Year: 2018). [cited by examiner]
Salimans et al. (Evolution Strategies as a Scalable Alternative to Reinforcement Learning, published 2017; pp. 1-13). (Year: 2017). [cited by examiner]
Choromanski et al., “When Random Search is not Enough: Sample-Efficient and Noise-Robust Blackbox Optimization of RL Policies”, arxiv.org, Cornell University Library, Mar. 7, 2019, XP081130675. [cited by applicant]
Chromoanski et al., “Provably Robust Blackbox Optimization for Reinforcement Learning”, arxiv.org, Cornell University Library, Jul. 8, 2019, XP081436951. [cited by applicant]
Choromanski et al., “Structured Evolution with Compact Architectures for Scalable Policy Optimization”, arxiv.org, Cornell University Library, Apr. 6, 2018, XP081236724. [cited by applicant]
Ghanberi et al., “Black Box Optimization in Machine Learning with Trust Region Based Derivative Free Algorithm”, arxiv.org, Cornell University Ithaca, Mar. 20, 2017, XP080758401. [cited by applicant]
International Search Report for Application No. PCT/US2019/066547, mailed on Jun. 8, 2020, 2 pages. [cited by applicant]
Chinese Search Report Corresponding to Application No. 2019800887529 on Jan. 8, 2024. [cited by applicant]
Avron et al., “Sharper Bounds for Regression and Low-Rank Approximation with Regularization”, arXiv:1611.03225v1, dated Nov. 10, 2016, 35 pages. [cited by applicant]
International Preliminary Report on Patentability for Application No. PCT/US2019/066547, mailed Jul. 29, 2021, 7 pages. [cited by applicant]