Prosecution Insights
Last updated: August 17, 2026
Application No. 18/667,973

Knowledge Distillation Training via Encoded Information Exchange to Generate Models Structured for More Efficient Compute

Non-Final OA §103
Filed
May 17, 2024
Priority
May 17, 2023 — provisional 63/502,890
Examiner
ANYIKIRE, CHIKAODILI E
Art Unit
Tech Center
Assignee
Google LLC
OA Round
1 (Non-Final)
75%
Grant Probability
Favorable
1-2
OA Rounds
11m
Est. Remaining
86%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
793 granted / 1060 resolved
+14.8% vs TC avg
Moderate +11% lift
Without
With
+11.3%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
39 currently pending
Career history
1104
Total Applications
across all art units

Statute-Specific Performance

§101
4.2%
-35.8% vs TC avg
§103
49.4%
+9.4% vs TC avg
§102
36.2%
-3.8% vs TC avg
§112
1.2%
-38.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1060 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 . 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 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. Claim(s) 1 – 4 and 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Wang et al (US 2020/0226476, hereafter Wang) in view of Yin et al (US 2022/0180202, hereafter Yin). As per claim 1, Wang discloses a computer-implemented method to generate a second machine learning model based on a first machine learning model, wherein the second machine learning model is structured for more efficient computation, comprising: processing, by a computing system comprising one or more processor devices, an input with a hidden layer of a student machine-learned model to obtain an intermediate output; providing, by the computing system, an encoded message descriptive of the input and the intermediate output for processing with a teacher machine-learned model (¶ 111); responsive to providing the encoded message, obtaining, by the computing system, a second encoded message descriptive of a second intermediate output of one or more hidden layers of the teacher machine-learned model (¶ 111); and performing, by the computing system, a knowledge distillation training process to train the student machine-learned model based on a difference between the intermediate output and the second intermediate output (¶ 111). However, Wang does not explicitly teach an encoded message descriptive. In the same field of endeavor, Yin teaches an encoded message descriptive (¶ 162, 230, and 255). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Wang in view of Yin. The advantage is optimizing knowledge distillation. As per claim 2, Wang discloses the computer-implemented method of claim 1, wherein the encoded message further comprises information descriptive of the input, and wherein providing the encoded message comprises. However, Wang does not explicitly teach processing, by the computing system, the input and the intermediate output with a machine-learned message encoding model to obtain the encoded message. In the same field of endeavor, Yin teaches teach processing, by the computing system, the input and the intermediate output with a machine-learned message encoding model to obtain the encoded message (¶ 162, 230, and 255). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Wang in view of Yin. The advantage is optimizing knowledge distillation. As per claim 3, Wang discloses the computer-implemented method of claim 2, wherein the obtaining the second encoded message further comprises: decoding, by the computing system, the second encoded message with a machine-learned message decoding model to obtain: (a) information descriptive of a second input to the one or more hidden layers of the teacher machine-learned model; and (b) information descriptive of the second intermediate output of the one or more hidden layers of the teacher machine-learned model (¶ 111). As per claim 4, Wang discloses the computer-implemented method of claim 3, wherein performing the knowledge distillation training process comprises performing, by the computing system, a knowledge distillation training process to train the student machine-learned model based on: (a) a difference between the intermediate output and the second intermediate output; and (b) a difference between the input and the second input (¶ 111). Regarding claim 20, arguments analogous to those presented for claim 1 are applicable for claim 20. Allowable Subject Matter Claim(s) 5 - 9 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Claim(s) 10 - 19 are allowed. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to CHIKAODILI E ANYIKIRE whose telephone number is (571)270-1445. The examiner can normally be reached 8 am - 4:30 pm. 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, David Czekaj can be reached at 571-272-7327. 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. /CHIKAODILI E ANYIKIRE/Primary Examiner, Art Unit 2487
Read full office action

Prosecution Timeline

May 17, 2024
Application Filed
Jul 20, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12707037
TEMPLATE MATCHING PATTERNS AND FUSION FOR TEMPLATE MATCHING RELATED VIDEO CODING
2y 5m to grant Granted Aug 11, 2026
Patent 12697879
DISPLAY DEVICE FOR VEHICLE
1y 11m to grant Granted Aug 04, 2026
Patent 12689726
Multiple Merge Lists and Orders for Inter Prediction with Geometric Partitioning
3y 3m to grant Granted Jul 21, 2026
Patent 12689738
IMAGE ENCODING/DECODING METHOD AND DEVICE RELATED TO BLOCK PARTITION, AND TRANSMISSION METHODS FOR BITSTREAM
2y 12m to grant Granted Jul 21, 2026
Patent 12689758
SYSTEMS AND METHODS FOR END OF BLOCK CODING FOR 2D COEFFICIENTS BLOCK WITH 1D TRANSFORMS
2y 1m to grant Granted Jul 21, 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
75%
Grant Probability
86%
With Interview (+11.3%)
3y 2m (~11m remaining)
Median Time to Grant
Low
PTA Risk
Based on 1060 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