Prosecution Insights
Last updated: July 17, 2026
Application No. 18/348,286

TECHNIQUES FOR HETEROGENEOUS CONTINUAL LEARNING WITH MACHINE LEARNING MODEL ARCHITECTURE PROGRESSION

Final Rejection §103
Filed
Jul 06, 2023
Priority
Sep 28, 2022 — provisional 63/377,505
Examiner
LEE JR, KENNETH B
Art Unit
2625
Tech Center
2600 — Communications
Assignee
NVIDIA Corporation
OA Round
2 (Final)
86%
Grant Probability
Favorable
3-4
OA Rounds
0m
Est. Remaining
94%
With Interview

Examiner Intelligence

Grants 86% — above average
86%
Career Allowance Rate
1100 granted / 1285 resolved
+23.6% vs TC avg
Moderate +9% lift
Without
With
+8.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 3m
Avg Prosecution
20 currently pending
Career history
1308
Total Applications
across all art units

Statute-Specific Performance

§101
1.7%
-38.3% vs TC avg
§103
71.9%
+31.9% vs TC avg
§102
20.9%
-19.1% vs TC avg
§112
0.7%
-39.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1285 resolved cases

Office Action

§103
DETAILED ACTION 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 . Response to Arguments Applicant's arguments filed 5/11/2026 have been fully considered but they are not persuasive. Applicant argues that prior art fails to teach performing one or more operations using the second machine learning model to generate a second data set by adding, to the first data set. Examiner, respectfully, disagrees. Kang teaches generating task-specific information from a pretrained teacher model and using that information to train a different model. Padmanabhan teaches transforming data and generating additional variables/features that are used to train predictive models. It would have been obvious to use the teach generated information of Kang as transformed/generated features in the transformed dataset of Padmanabhan before training the target model as both references are directed to improving predictive model training through use of additional derived information. 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. Claims 1-20 are rejected under 35 U.S.C. 103 as being unpatentable over Kang et al. (hereinafter “Kang”), US Patent No. 10,410,114, in view of Padmanabhan et al. (hereinafter “Padmanabhan”), US Pub. No. 2017/0185904. Regarding claim 1, Kang teaches a computer-implemented method for training a first machine learning model having a different architecture than a second machine learning model (fig. 2), the method comprising: receiving a first data set (fig. 2, student model; the request in Kang implicitly identifies the input type, output type and training data when selecting the student model where these criteria come with the training of the selected student model); performing one or more operations to generate a second data set, at least one feature associated with one or more tasks that the second machine learning model was previously trained to perform (fig. 2, teacher models 205-225 are all pre-trained models; Kang teaches a pre-trained teacher model that generates output data derived from hidden layers and classifier layers, the output data being associated with the recognition task previously performed by the teach model); and performing one or more operations to train the first machine learning model based on the second data set and the second machine learning model (fig. 2, training the student model using the teacher model). As mentioned above, Kang implicitly teaches receiving a first data set but fails to explicitly teach a first data set and performing one or more operations using the second machine learning model to generate a second data set by adding, to the first data set. However, in the same field of endeavor, Padmanabhan teaches received training data (applicant’s first data set, see [0060-0061]), transformed variables generated during data transformation (applicant’s added features, see fig. 2, operation 208), transformed data used for model building (see [0062]), and building predictive models from transformed data (applicant’s training first model using second dataset, see fig. 2, operation 210). Therefore, it would have been obvious to a person having ordinary skill in the art before the effective filing date of the claimed invention to modify Kang to include the feature of Padmanabhan. As such, a person having ordinary skill in the art would appreciate the motivation for doing so would have been to build a more efficient predictive model (Padmanabhan, [0007]). Regarding claim 2, Kang teaches wherein performing the one or more operations to train the first machine learning model comprises optimizing a loss function that includes a first term that minimizes a distance between an output of the first machine learning model and an output of the second machine learning model and a second term used to train the first machine learning model to perform one or more tasks that the second machine learning model was not previously trained to perform (col. 10, lines 6-30). Regarding claim 3, Kang teaches wherein the first term comprises a Kullback-Leibler (KL) divergence, and the second term comprises a soft cross entropy (col. 11, lines 16-33). Regarding claim 4, Kang teaches further comprising performing one or more operations to augment the second data set based on one or more data augmentations (col. 10, lines 31-58). Regarding claim 5, Padmanabhan teaches wherein the first data set is associated with at least one task that is not included in the one or more tasks that the second machine learning model was previously trained to perform (fig. 2 and accompanying text). Regarding claim 6, Kang teaches wherein the first data set is associated with the at least one task that is included in the one or more tasks that the second machine learning model was previously trained to perform (fig. 2 and accompanying text). Regarding claim 7, Kang teaches wherein performing one or more operations to generate the second data set comprises backpropagating one or more gradients to the first data set based on the one or more tasks that the second machine learning model was previously trained to perform (col. 10, lines 12-19). Regarding claim 8, Padmanabhan teaches wherein the first data set does not include random noise (fig. 2, elements 202-218). Regarding claim 9, Padmanabhan teaches wherein the one or more operations to train the first machine learning model are further based on the first data set (fig. 2, elements 202-218). Regarding claim 10, Kang teaches further comprising performing one or more tasks using the first machine learning model subsequent to performing the one or more operations to train the first machine learning model (fig. 4, Pstudent). Regarding claim 11, it is a non-transitory computer readable medium of claim 1 and is rejected on the same grounds presented above. Regarding claim 12, it has similar limitations to those of claim 2 and is rejected on the same grounds presented above. Regarding claim 13, it has similar limitations to those of claim 3 and is rejected on the same grounds presented above. Regarding claim 14, it has similar limitations to those of claim 3 and is rejected on the same grounds presented above. Regarding claim 15, it has similar limitations to those of claim 5 and is rejected on the same grounds presented above. Regarding claim 16, it has similar limitations to those of claim 7 and is rejected on the same grounds presented above. Regarding claim 17, Padmanabhan teaches wherein the first data set includes one or more images ([0043]). Regarding claim 18, it has similar limitations to those of claim 9 and is rejected on the same grounds presented above. Regarding claim 19, it has similar limitations to those of claim 10 and is rejected on the same grounds presented above. Regarding claim 20, it is a system of claim 1 and is rejected on the same grounds presented above. Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure: Lupesko et al. (US Patent No. 11,763,154) teaches automated generation of a machine learning model based in part on a pretrained model. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KENNETH B LEE JR whose telephone number is (571)270-3147. The examiner can normally be reached Mon - Fri 9am-5pm. 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, William Boddie can be reached at 571-272-0666. 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. /KENNETH B LEE JR/Primary Examiner, Art Unit 2625
Read full office action

Prosecution Timeline

Jul 06, 2023
Application Filed
Feb 12, 2026
Non-Final Rejection mailed — §103
May 11, 2026
Response Filed
Jun 23, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12682851
DISPLAY SUBSTRATE AND DISPLAY DEVICE
1y 0m to grant Granted Jul 14, 2026
Patent 12675693
DATA PROCESSING METHOD AND APPARATUS
3y 3m to grant Granted Jul 07, 2026
Patent 12670856
DISPLAY DEVICE
1y 9m to grant Granted Jun 30, 2026
Patent 12657444
MACHINE LEARNING NETWORK IMPLEMENTED BY STATICALLY SCHEDULED INSTRUCTIONS
3y 8m to grant Granted Jun 16, 2026
Patent 12657850
INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM
2y 9m to grant Granted Jun 16, 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

3-4
Expected OA Rounds
86%
Grant Probability
94%
With Interview (+8.8%)
2y 3m (~0m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 1285 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