Prosecution Insights
Last updated: April 19, 2026
Application No. 18/353,572

CALIBRATION USING DIFFERENTIAL MACHINE LEARNING

Non-Final OA §102§103
Filed
Jul 17, 2023
Examiner
NILSSON, ERIC
Art Unit
2151
Tech Center
2100 — Computer Architecture & Software
Assignee
Wells Fargo Bank N A
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
3y 2m
To Grant
99%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allow Rate
408 granted / 494 resolved
+27.6% vs TC avg
Strong +18% interview lift
Without
With
+18.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
31 currently pending
Career history
525
Total Applications
across all art units

Statute-Specific Performance

§101
25.3%
-14.7% vs TC avg
§103
38.8%
-1.2% vs TC avg
§102
17.5%
-22.5% vs TC avg
§112
8.9%
-31.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 494 resolved cases

Office Action

§102 §103
DETAILED ACTION This action is in response to claims filed 17 July 2023 for application 18353572 filed 17 July 2023. Currently claims 1-20 are pending. Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 102 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claims 1, 3-5, 9-11, 13-15, and 19-20 are rejected under 35 U.S.C. 102(A)(1) as being anticipated by Huge et al. (Differential Machine Learning). Regarding claims 1, 11 and 20, Huge discloses: A method comprising: identifying, by a framework and based on a model script, a model that generates an output based on a set of inputs, wherein the inputs include a plurality of parameters (“The evaluation of the twin network returns a predicted value y, and its differentials ¯x wrt the n0 = n inputs x” p6 §1.2 ¶3) p7, Fig 2 input x and output after first feedforward); selecting, by the framework, a first plurality of parameter values (Fig 2 inputs z, see also p21 §2.1 d learnable parameters); assembling, by the framework, a set of training samples by observing outputs generated by the model in response to each of the first plurality of parameter values PNG media_image1.png 284 836 media_image1.png Greyscale (p8 last ¶); training, by the framework and based on the set of training samples, a surrogate model, wherein the surrogate model is trained to predict outputs of the model (p8 last ¶, Fig 2, the second model of the twin model is interpreted as the surrogate model, it is trained with differentials); generating, by the framework and using the surrogate model, predicted outputs of the model, wherein each of the predicted outputs of the model is based on a different parameter value in a second plurality of parameter values (Fig 2 multiple outputs of the model); selecting, by the framework and based on the predicted outputs of the model, a desired parameter value (“The twin network, therefore, predicts prices and risk sensitivities for twice the computation complexity of value prediction alone, irrespective of the number of risks. Hence, a trained twin net approximates prices and risk sensitivities, wrt potentially many states, in a particularly efficient manner.” P7); and applying the model, using the desired parameter value, to predict a value of interest for an input value (“The twin network, therefore, predicts prices and risk sensitivities for twice the computation complexity of value prediction alone, irrespective of the number of risks. Hence, a trained twin net approximates prices and risk sensitivities, wrt potentially many states, in a particularly efficient manner.” P7). Regarding claims 3 and 13, Huge discloses: The method of claim 1, wherein selecting the first plurality of parameter values includes: performing adaptive sampling to mitigate effects caused by variances across the first plurality of parameter values (“In low dimension, the training states X(i) may be put on a regular grid over a relevant domain. In higher dimension, they may be sampled over a relevant domain with a low discrepancy sequence like Sobol. When the exposure date T1 is today or close, sampling XT1 with Monte-Carlo is nonsensical, an appropriate sampling distribution must be applied depending on context” p19 §Training inputs, note: Sobol sequence is a quasi-MonteCarlo method which is used to achieve variance reduction). Regarding claims 4 and 14, Huge discloses: The method of claim 1, wherein assembling the set of training samples includes: assembling training samples that each include a state value, a parameter value of the first plurality of parameter values, the observed output value, and a derivative of the observed output value with respect to the parameter value (p3 last ¶ - p4 ¶2 disclose a an input x having a parameter value and a state value, an observed output y and a derivative dy/dx). Regarding claims 5 and 15, Huge discloses: The method of claim 1, wherein training the surrogate model includes: training a deep neural network using least square regression regularized with derivatives of the observed output values with respect to parameter values (p35 the method used is a least square linear regression using differentials). Regarding claims 9 and 19, Huge discloses: The method of claim 1, wherein selecting the desired parameter value includes: selecting an optimal parameter value from the second plurality of parameter values, wherein the optimal parameter value tends to maximize the output from the model (§2.1, 2.2 and 2.3 disclose various methods of selecting parameters for training to achieve the desired result, interpreted as maximizing correct output from the model). Regarding claim 10, Huge discloses: The method of claim 1, wherein predicting the value of interest includes: predicting a payoff of an interest rate option contract (p2 §online approximation with sampled payoffs). Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention. Claim(s) 2 and 12 are rejected under 35 U.S.C. 103 as being unpatentable over Huge in view of Lock et al. (US 7627543). Regarding claims 2 and 12, Huge does not explicitly disclose, however, Lock teaches: The method of claim 1, further comprising: receiving, by a control system, the value of interest; interpreting, by the control system, the value of interest to determine an action to take; and outputting, by the control system and over a network to a downstream system, a control signal to control the operation of the downstream system (“, facts of interest and functions for calculating values of interest from items of data, d) evaluating the more specific rule generalisation by applying it to the training data set to identify vulnerabilities, and e) incorporating the more specific rule generalisation in the rule set if it classifies vulnerabilities in the training data set adequately in terms of covering at least some of the positive vulnerability examples, f) applying the rule set to a test program for vulnerability detection therein, and g) providing an alert or a report to a user regarding vulnerability detection in the test program resulting from operation of the method in order to enable corrective action to be taken.” Claim 11). Huge and Lock are in the same field of endeavor of machine learning and are analogous. Huge discloses a differential machine learning system with a surrogate model. Lock teaches exemplary machine learning which responds to a value of interest with an action. It would have been obvious to one of ordinary skill in the art before the effective filing date to modify the known differential ML system of Huge to take an action in response to a value as taught by the known system of Lock to yield predictable results of taking automated actions to received data. Claim(s) 6-8 and 16-18 are rejected under 35 U.S.C. 103 as being unpatentable over Lock in view of Dushatskiy et al. (A novel surrogate-assisted evolutionary algorithm applied to partition based ensemble learning). Regarding claims 6 and 16, Huge does not explicitly disclose, however, Dushatskiy teaches: The method of claim 1, wherein training the surrogate model includes: training a plurality of surrogate models, where each surrogate model is trained starting with a different random seed (Algorithm 2 and §2.4, multiple surrogate models are trained in parallel and evaluated for fitness, a best surrogate model is selected, “when the same dataset partitioning can result in different ensemble accuracy scores because learners in ensembles are initialized with different random seeds.” P589 ¶1). Huge and Dushatskiy are in the same field of endeavor of machine learning and are analogous. Huge discloses a differential machine learning system with a surrogate model. Dushatskiy teaches a system for generating a plurality of parallel surrogate models from a random seed and selecting the best one. It would have been obvious to one of ordinary skill in the art before the effective filing date to modify the known differential ML system of Huge to include multiple differential models to select the best one to yield predictable results of optimizing the surrogate model. Regarding claims 7 and 17, Huge does not explicitly disclose, however, Dushatskiy teaches: The method of claim 6, wherein generating predicted outputs of the model includes: executing each of the surrogate models in parallel to generate different sets of predicted outputs of the model (Algorithm 2 and §2.4, multiple surrogate models are trained in parallel and evaluated for fitness, a best surrogate model is selected). Regarding claims 8 and 18, Huge does not explicitly disclose, however, Dushatskiy teaches: The method of claim 7, wherein selecting a desired parameter value includes: selecting a desired one of the plurality of surrogate models based on an assessment of the robustness of the predicted outputs generated by each of the plurality of surrogate models (Algorithm 2 and §2.4, multiple surrogate models are trained in parallel and evaluated for fitness, a best surrogate model is selected); and selecting the desired parameter value based on the predicted outputs generated by the desired surrogate model (Algorithm 2 and §2.4, multiple surrogate models are trained in parallel and evaluated for fitness, a best surrogate model is selected). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ERIC NILSSON whose telephone number is (571)272-5246. The examiner can normally be reached M-F: 7-3. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, James Trujillo can be reached at (571)-272-3677. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /ERIC NILSSON/ Primary Examiner, Art Unit 2151
Read full office action

Prosecution Timeline

Jul 17, 2023
Application Filed
Feb 11, 2026
Non-Final Rejection — §102, §103
Apr 16, 2026
Interview Requested

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602587
MULTI-TASK DEEP LEARNING NETWORK AND GENERATION METHOD THEREOF
2y 5m to grant Granted Apr 14, 2026
Patent 12602615
EVALUATION OF MACHINE LEARNING MODELS USING AGREEMENT SCORES
2y 5m to grant Granted Apr 14, 2026
Patent 12591762
METHOD, SYSTEM FOR ODOR VISUAL EXPRESSION BASED ON ELECTRONIC NOSE TECHNOLOGY, AND STORAGE MEDIUM
2y 5m to grant Granted Mar 31, 2026
Patent 12585942
METHOD AND SYSTEM FOR MACHINE LEARNING AND PREDICTIVE ANALYTICS OF FRACTURE DRIVEN INTERACTIONS
2y 5m to grant Granted Mar 24, 2026
Patent 12585953
RADIO SIGNAL IDENTIFICATION, IDENTIFICATION SYSTEM LEARNING, AND IDENTIFIER DEPLOYMENT
2y 5m to grant Granted Mar 24, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
83%
Grant Probability
99%
With Interview (+18.0%)
3y 2m
Median Time to Grant
Low
PTA Risk
Based on 494 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month