Prosecution Insights
Last updated: July 17, 2026
Application No. 19/098,783

Control of Deterministic Machine Learning Systems Using Trigger Tables and Configuration State Registries

Non-Final OA §103§112
Filed
Apr 02, 2025
Priority
Jun 28, 2021 — provisional 63/215,680 +1 more
Examiner
KROFCHECK, MICHAEL C
Art Unit
2138
Tech Center
2100 — Computer Architecture & Software
Assignee
Google LLC
OA Round
1 (Non-Final)
82%
Grant Probability
Favorable
1-2
OA Rounds
1y 5m
Est. Remaining
98%
With Interview

Examiner Intelligence

Grants 82% — above average
82%
Career Allowance Rate
537 granted / 659 resolved
+26.5% vs TC avg
Strong +17% interview lift
Without
With
+17.0%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
20 currently pending
Career history
680
Total Applications
across all art units

Statute-Specific Performance

§101
2.6%
-37.4% vs TC avg
§103
69.4%
+29.4% vs TC avg
§102
4.4%
-35.6% vs TC avg
§112
7.8%
-32.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 659 resolved cases

Office Action

§103 §112
DETAILED ACTION The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . This office action is in response to application 19/098,783 filed on 4/2/2025 which is a divisional of application 17/852,059 filed on 6/28/2022, which claim priority to provisional application 63/215,680 filed on 6/28/2021. Applicant’s election without traverse of claims 3-7 in the reply filed on 6/1/2026 is acknowledged. Claims 1-2 are withdrawn from further consideration pursuant to 37 CFR 1.142(b) as being drawn to a nonelected invention, there being no allowable generic or linking claim. Election was made without traverse in the reply filed on 6/1/2026. Claims 3-7 have been examined. Information Disclosure Statement The information disclosure statement (IDS) submitted on 4/2/2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 4-7 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 4 recites the limitation "the nest loop" in line 3. There is insufficient antecedent basis for this limitation in the claim. Should this instead say, “the nested loop?” Claims 5-7 are rejected because they depend from a base claim that is currently rejected and fail to cure the deficiencies of the base claim. Claim Rejections - 35 USC § 103 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) 3 is/are rejected under 35 U.S.C. 103 as being unpatentable over Shi et al. (US 2020/0234119) and Madar, III et al. (US 2020/0342350). With respect to claim 3, Shi teaches of a method for executing loops in a circuit device, the method comprising: storing configuration state data for a plurality of iterations of a first loop (fig. 3, 5; paragraph 18, 42, 59-61; where the devices store the AI models), wherein the configuration state data for the first loop comprises control data for setting a state of a first control element in a circuit device (paragraph 16-18, 59; where the AI chip is configured using an AI model to perform an AI task); iterating through the first loop, wherein at each iteration of the first loop a state of the first control element is updated based on the configuration data corresponding to the iteration of the first loop (fig. 3, 5; paragraphs 41-43, 59-62; where at each iteration, the AI model is updated using the previous AI models). Shi fails to explicitly teach of the configuration state data being stored in a local registry table. However, Madar teaches of storing parameters for a convolution neural network model in local memory registers (fig. 1; paragraph 67; where CNN parameters are stored in the fastest memory available, which is often local registers). The combination of Shi and Madar teaches of iterating through the first loop, wherein at each iteration of the first loop a state of the first control element is updated based on the configuration data corresponding to the iteration of the first loop stored in the local registry table (Shi, fig. 3, 5; paragraph 18, 42, 59-61; Madar, fig. 1; paragraph 67; in the combination the AI model/weights are stored in Madar’s local registers). Shi and Madar are analogous art because they are from the same field of endeavor, as they are directed to managing artificial intelligence/machine learning models. It would have been obvious to one of ordinary skill in the art having the teachings of Shi and Madar before the time of the effective filing of the claimed invention to store the AI model parameters of Shi in the local registers of Madar. Their motivation would have been to more quickly access the parameters (Madar, paragraph 67). Claim(s) 4 and 6-7 is/are rejected under 35 U.S.C. 103 as being unpatentable over Shi and Madar as applied to claim 3 above, and further in view of Wu et al. (US 2019/0073590). With respect to claim 4, Shi teaches of wherein the first loop is a first inner loop of a nested loop (fig. 2, 5; paragraph 29, 60-62; where the iterative updating of the AI model (claimed inner loop) is within the iterative process that includes the updating the training configuration parameters (claimed outer loop)) and wherein the method comprises: storing configuration state data for an iteration of a first outer loop of the nest loop ((fig. 2, 5; paragraph 34, 40, 60-62; where as the training configuration parameters are updated based on their prior values, those values must be stored). Shi fails to explicitly teach of wherein the method comprises: storing configuration state data for an iteration of a first outer loop of the nest loop in a local memory of the circuit device. However, Wu teaches of wherein the method comprises: storing configuration state data for an iteration of a first outer loop of the nest loop in a local memory of the circuit device (paragraph 60; where trainers store the parameter data in local memory). Shi, Madar, and Wu are analogous art because they are from the same field of endeavor, as they are directed to managing artificial intelligence/machine learning models. It would have been obvious to one of ordinary skill in the art having the teachings of Shi, Madar, and Wu before the time of the effective filing of the claimed invention to store the training parameters of the combination of Shi and Madar in local memory as taught in Wu. Their motivation would have been to more easily access the parameters. With respect to claim 6, the combination of Shi, Madar, and Wu teaches of retrieving the configuration state data for the iteration of the first outer loop from the local memory after a last iteration of the first inner loop (Shi, fig. 2, 5; paragraph 29, 34, 40, 59-62; where after the max iteration count of updating the AI model is reached, the training configuration parameters are updated. As the training configuration parameters are updated based on their past values, they must be retrieved from their location in Wu’s local memory to be updated). The reasoning for obviousness is the same as indicated above with respect to claim 4. With respect to claim 7, the combination of Shi, Madar, and Wu teaches of wherein retrieving the configuration state data for the iteration of the first outer loop comprises storing the configuration state data for the iteration of the first outer loop in the local registry table (Shi, Shi, fig. 2, 5; paragraph 29, 34, 40, 59-62; Madar, paragraph 67; where in the combination, as the training configuration parameters are being updated, it would be beneficial to store them in the registers of Madar to increase the speed at which they can be updated). Shi, Madar, and Wu are analogous art because they are from the same field of endeavor, as they are directed to managing artificial intelligence/machine learning models. It would have been obvious to one of ordinary skill in the art having the teachings Shi, Madar, and Wu before the time of the effective filing of the claimed invention to store the training configuration parameters being accessed in the local registers in the combination of Shi, Madar, and Wu as taught in Madar. Their motivation would have been to more quickly access the parameters (Madar, paragraph 67). Claim(s) 5 is/are rejected under 35 U.S.C. 103 as being unpatentable over Shi, Madar, and Wu as applied to claim 4 above, and further in view of Catthoor et al. (US 2020/0159809). With respect to claim 5, the combination of Shi, Madar, and Wu fails to explicitly teach of wherein the configuration state data for the iteration of a first outer loop comprises a configuration state for an address generator, a counter, or a data selector. However, Catthoor teaches of wherein the configuration state data for the iteration of a first outer loop comprises a configuration state for an address generator, a counter, or a data selector (paragraph 106; where the configuration state of the data selectors/multiplexers is reconfigurable based on the control signals and parameters. In the combination with Shi, Madar, and Wu, this occurs with the updated the training configuration parameters). Shi, Madar, Wu, and Catthoor are analogous art because they are from the same field of endeavor, as they are directed to managing artificial intelligence/machine learning models. It would have been obvious to one of ordinary skill in the art having the teachings Shi, Madar, Wu, and Catthoor before the time of the effective filing of the claimed invention to incorporate the configuring the data selectors/multiplexers using the configuration states in the combination of Shi, Madar, and Wu as taught in Catthoor. Their motivation would have been to more efficiently configure the access the parameters. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure: Lovell et al. (US 2022/0413590) discloses a neural network including CNN processors where a controller applies any number of selected configurations or network parameters to a selected circuit configuration to process a subsequent layer of the network according to the selected configuration parameters and selected input data. Reiher et al. (US 2018/0275758) discloses configurations of the system are updated based on the configuration inputs received. A state of the system is repeatedly computed, whereby each computed state corresponds to a latest updated configuration that was available before starting to compute said each computed state. While repeatedly computing a state of the system, a surrogate function is obtained, upon completion of each computation, which surrogate function approximates a function of said each computed state; and at least one type of feedback is repeatedly provided. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MICHAEL C KROFCHECK whose telephone number is (571)272-8193. The examiner can normally be reached on Monday - Friday 8am -5pm, first Friday off. 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, Tim Vo can be reached on (571) 272-3642. 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. /Michael Krofcheck/Primary Examiner, Art Unit 2138 MICHAEL C. KROFCHECK Primary Examiner Art Unit 2138
Read full office action

Prosecution Timeline

Apr 02, 2025
Application Filed
Jun 23, 2026
Non-Final Rejection mailed — §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12681869
METHOD FOR LOCKING A REWRITABLE NON-VOLATILE MEMORY AND ELECTRONIC DEVICE IMPLEMENTING SAID METHOD
3y 8m to grant Granted Jul 14, 2026
Patent 12664081
SYSTEMS AND METHODS FOR MANAGING MEMORY DEVICES
2y 2m to grant Granted Jun 23, 2026
Patent 12638985
TWO-TIER DEFECT SCAN MANAGEMENT
1y 9m to grant Granted May 26, 2026
Patent 12639228
SILENT CACHE LINE EVICTION
1y 8m to grant Granted May 26, 2026
Patent 12638988
METHODS AND ALLOCATORS FOR ALLOCATING PORTIONS OF A STORAGE UNIT USING VIRTUAL PARTITIONING
1y 6m to grant Granted May 26, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
82%
Grant Probability
98%
With Interview (+17.0%)
2y 9m (~1y 5m remaining)
Median Time to Grant
Low
PTA Risk
Based on 659 resolved cases by this examiner. Grant probability derived from career allowance 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