IP Library › Granted Patent US 12,423,616
Granted Patent B2
US 12,423,616 · App. 17/540,025 · Granted Sep 23, 2025

Methods and systems for automatically tuning weights associated with breeding models

Inventors: Viveka Gorla (Chesterfield, MO); TingYu Ho (Seattle, WA); Adam David Scott (Maryland Heights, MO); Aviral Shukla (Defiance, MO); Yiduo Zhan (Chesterfield, MO); Zihao Zhao (Woodinville, WA)
Assignee: Monsanto Technology LLC
G06N20/00
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,423,616
App. No.
17/540,025
Granted
Sep 23, 2025
Kind
B2
Abstract

Systems and methods for use in identifying weights to be employed in a selection algorithm associated with plant advancement are disclosed. One example method includes identifying a start set of weights for a selection algorithm associated with a breeding program, and for each scale parameter value in a schedule, and for each of N iterations, modifying the start set of weights based on the scale parameter value, identifying a set of germplasm based on at least the modified set of weights, advancing the modified set of weights to a next iteration as the start set of weights when certain criteria are satisfied, and identifying the modified set of weights as an output when the iteration is equal to N.

Claims (77)

1. A system for use in identifying weights to be employed in a selection algorithm associated with plant advancement, the system comprising:

a computing device configured to:

identify a start set of weights for a selection algorithm associated with a breeding program and a start set of germplasm defined by the selection algorithm and the start set of weights, the start set of germplasm associated with a performance threshold;

for each scale parameter value in a scale parameter schedule:

for each of N iterations, where Nis an integer:

modify the start set of weights based on the scale parameter value;

identify a set of germplasm based on the selection algorithm, the modified set of weights, and the scale parameter value;

advance the modified set of weights to a next iteration as the start set of weights, in response to i) an estimated performance of the identified set of germplasm satisfying the performance threshold and ii) the iteration being less than N;

advance the modified set of weights to a next iteration as the start set of weights, in response to i) the estimated performance of the identified set of germplasm failing to satisfy the performance threshold, ii) the estimated performance of the identified set of germplasm satisfying a further threshold, and iii) the iteration being less than N; and

identify the modified set of weights as an output for the N iterations in response to i) the estimated performance of the identified set of germplasm satisfying the performance threshold and ii) the iteration being equal to N; and

return one of the outputs, for one of the scale parameter values in the scale parameter schedule, as a final set of weights for the selection algorithm associated with the breeding program.

2. The system of claim 1 , wherein the computing device is configured to randomly modify the start set of weights consistent with the scale parameter value.

3. The system of claim 1 , wherein the scale parameter schedule includes multiple scale parameter values, and wherein each of the scale parameter values is indicative of variability available for modifying the set of weights.

4. The system of claim 1 , wherein the computing device is configured to identify the set of germplasm based on historical test data, via the selection algorithm.

5. The system of claim 1 , wherein the computing device is further configured, for each scale parameter value in the scale parameter schedule, and for each of the N iterations, to calculate the estimated performance of the set of germplasm as a percentage overlap between the set of germplasm and a reference set of germplasm, and to compare the estimated, calculated performance to the performance threshold.

6. The system of claim 5 , wherein the computing device is further configured, for each scale parameter value in the scale parameter schedule, and for each of the N iterations, to identify the modified set of weights as an output for the N iterations in response to a stop condition being satisfied.

7. The system of claim 6 , wherein the stop condition includes at least one of: the estimated performance of the modified set of germplasm exceeding a threshold and/or a degree of performance increase over a number of iterations.

8. The system of claim 1 , wherein the computing device, in connection with advancing the modified set of weights to a next iteration as the start set of weights, is configured to set the estimated performance of the identified set of germplasm as the performance threshold.

9. The system of claim 1 , wherein the computing device is further configured, in response to the estimated performance of the identified set of germplasm failing to satisfy the performance threshold and the iteration being less than N, to:

calculate the further threshold as an acceptance probability threshold for the estimated performance of the identified set of germplasm based on:

p

=

exp

⁡

(

-

E

′

-

E

S

)

,

wherein E′ is the estimated performance of the identified set of germplasm, E is the performance threshold, and S is the scale parameter value;

compare the acceptance probability to a randomly generated number for the scale parameter value and the N iteration; and

determine the further threshold is satisfied in response to the randomly generated number satisfying the acceptance probability.

10. The system of claim 1 , wherein the computing device is further configured, for each scale parameter value in the scale parameter schedule, for each of the N iterations, to:

discard the modified set of weights; and

advance the start set of weights to a next iteration as the start set of weights, in response to i) the estimated performance of the identified set of germplasm failing to satisfy the performance threshold, ii) the estimated performance of the identified set of germplasm failing to satisfy the further threshold, and iii) the iteration being less than N.

11. The system of claim 1 , wherein Nis less than 500.

12. The system of claim 1 , wherein the computing device is further configured to identify at least one germplasm based on the final set of weights and the selection algorithm.

13. The system of claim 12 , further comprising a plant disposed in a growing space of a breeding pipeline of the breeding program, the plant derived from the at least one germplasm.

14. The system of claim 1 , wherein the computing device is further configured to generate a report of the final set of weights and the estimated performance associated with the final set of weights.

15. A method for use in identifying weights to be employed in a selection algorithm associated with plant advancement, the method comprising:

identifying i) a start set of weights for a selection algorithm associated with a breeding program and ii) a start set of germplasm based on historical test data, the start set of germplasm associated with a performance threshold;

for each scale parameter value in a scale parameter schedule:

for each of N iterations, where Nis an integer:

modifying the start set of weights based on the scale parameter value;

identifying a set of germplasm based on the selection algorithm, the modified set of weights, and the scale parameter value;

advancing the modified set of weights to a next iteration as the start set of weights, in response to i) an estimated performance of the identified set of germplasm satisfying the performance threshold and ii) the iteration being less than N; and

identifying the modified set of weights as an output for the N iterations in response to i) the estimated performance of the identified set of germplasm satisfying the performance threshold and ii) the iteration being equal to N; and

returning one of the outputs, for one of the scale parameter values in the scale parameter schedule, as a final set of weights for the selection algorithm associated with the breeding program.

16. The method of claim 15 , wherein modifying the start set of weights includes randomly modifying the start set of weights consistent with the scale parameter value; and

wherein the scale parameter schedule includes multiple scale parameter values, and wherein each of the scale parameter values is indicative of variability available for modifying the set of weights.

17. The method of claim 15 , further comprising, for each scale parameter value in the scale parameter schedule, and for each of the N iterations:

calculating the estimated performance of the set of germplasm as a percentage overlap between the set of germplasm and a reference set of germplasm; and

comparing the estimated, calculated performance to the performance threshold.

18. The method of claim 17 , further comprising, in response to the estimated performance of the identified set of germplasm failing to satisfy the performance threshold and the iteration being less than N:

calculating the further threshold as an acceptance probability threshold for the estimated performance of the identified set of germplasm based on:

p

=

exp

⁡

(

-

E

′

-

E

S

)

,

wherein E′ is the estimated performance of the identified set of germplasm, E is the performance threshold, and Sis the scale parameter value;

comparing the acceptance probability to a randomly generated number for the scale parameter value and the N iteration; and

determining the further threshold is satisfied in response to the randomly generated number satisfying the acceptance probability.

19. The method of claim 15 , wherein Nis less than 500.

20. The method of claim 15 , further comprising planting a plant in a growing space of a breeding pipeline of the breeding program, the plant derived from the at least one germplasm.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 30, 2022
From: GORLA, VIVEKA; HO, TINGYU; SCOTT, ADAM DAVID; SHUKLA, AVIRAL; ZHAN, YIDUO; ZHAO, ZIHAO
To: MONSANTO TECHNOLOGY LLC
Reel/Frame 059436/0705 →
Continuity (2)
Provisional Application 63120662 · Dec 2, 2020
Related Publication 20220172120A1 · Jun 2, 2022
References Cited (22)
US 10327400B2 · Chavali et al. · 2019 [cited by applicant]
US 20080163824A1 · Moser et al. · 2008 [cited by applicant]
US 20100076911A1 · Xu et al. · 2010 [cited by applicant]
US 20120123980A1 · Bhandari et al. · 2012 [cited by applicant]
US 20120144508A1 · Hayes et al. · 2012 [cited by applicant]
US 20160007130A1 · Germain · 2016 [cited by examiner]
US 20170354105A1 · Polavarapu · 2017 [cited by examiner]
US 20190174691A1 · Chavali et al. · 2019 [cited by applicant]
US 20190180845A1 · Chavali et al. · 2019 [cited by applicant]
US 20230292687A1 · Mockler · 2023 [cited by examiner]
CN 104112233A · 2014 [cited by applicant]
CN 109378036A · 2019 [cited by applicant]
CN 111465320A · 2020 [cited by applicant]
CN 111627495A · 2020 [cited by applicant]
“Simulation Modeling in Plant Breeding: Principles and Applications” Published by Elsevier (Year: 2007). [cited by examiner]
Hassanzadeh, H. R., & Rouhani, M. (Jul. 2010). A multi-objective gravitational search algorithm. In Computational Intelligence, Communication Systems and Networks (CICSyN), 2010 Second International Conference on (pp. 7… [cited by applicant]
Censor, Y. (1977). Pareto optimality in multiobjective problems. [cited by applicant]
Kim, I. Y., & De Weck, O. L. (2006). Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation. [cited by applicant]
Jiang, S., Cai, Z., Zhang, J., & Ong, Y. S. (Jul. 2011). Multiobjective optimization by decomposition with Pareto-adaptive weight vectors. [cited by applicant]
Zhang, K. S., Han, Z. H., Li, W. J., & Song, W. P. (2008). Bilevel adaptive weighted sum method for multidisciplinary multi-objective optimization. [cited by applicant]
Azodi et al., “Benchmarking Parametric and Machine Learning Models for Genomic Prediction of Complex Traits” In: G3 Genes|Genomes|Genetics, vol. 9, Issue 11, (Nov. 1, 2019) (23 pgs.). [cited by applicant]
CN2021800806961: Chinese Office Action dated Nov. 29, 2024. CN2021800806961 has the same priority claim as the instant application. [cited by applicant]