Prosecution Insights
Last updated: May 29, 2026
Application No. 18/904,462

INTERPRETABILITY FRAMEWORK FOR DIFFERENTIALLY PRIVATE DEEP LEARNING

Non-Final OA §103
Filed
Oct 02, 2024
Priority
Oct 30, 2020 — divisional of 12/001,588 +1 more
Examiner
IDOWU, OLUGBENGA O
Art Unit
2494
Tech Center
2400 — Computer Networks
Assignee
SAP SE
OA Round
1 (Non-Final)
71%
Grant Probability
Favorable
1-2
OA Rounds
1y 8m
Est. Remaining
90%
With Interview

Examiner Intelligence

Grants 71% — above average
71%
Career Allowance Rate
458 granted / 643 resolved
+13.2% vs TC avg
Strong +19% interview lift
Without
With
+19.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
20 currently pending
Career history
668
Total Applications
across all art units

Statute-Specific Performance

§101
0.6%
-39.4% vs TC avg
§103
83.8%
+43.8% vs TC avg
§102
13.7%
-26.3% vs TC avg
§112
0.5%
-39.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 643 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 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. Claim(s) 1 – 20 are rejected under 35 U.S.C. 103 as being unpatentable over Hebert, publication number: US 2018/0004978 in view of Zaccak, publication number: US 2021/0360010. As per claim 1, Hebert teaches a system for training a machine learning model comprising: at least one data processor; memory storing instructions which, when executed by the at least one data processor, result in operations comprising: receiving a dataset (Dataset 405, Fig. 4, [0087]); receiving at least one first user-generated privacy parameter which governs a differential privacy (DP) algorithm to be applied to a function evaluated over the received dataset (Data owner determining risk values, [0018]); calculating, based on the received at least one first user-generated privacy parameter, at least one second privacy parameter based on a ratio or overlap of probabilities of distributions of different observations (Determining utility quantifiers, [0087]); applying, using the at least one second privacy parameter, the DP algorithm to the function over the received dataset to result in an anonymized function output (Anonymizing data 445, [0087]); Hebert does not teach anonymously training at least one machine learning model using the dataset after application of the DP algorithm to the function over the received dataset which, when deployed, is configured to classify input data. In an analogous art, Zaccak teaches anonymously training at least one machine learning model using the dataset after application of the DP algorithm to the function over the received dataset which, when deployed, is configured to classify input data (machine learning models, [0045-0046][0082][0093], training using differentially processed data, [0061][0096]). Therefore, it would have been obvious to one of ordinary skill in the art, prior to the effective filing date of the claimed invention to modify Hebert’s differential privacy system to include machine learning training as described in Zaccak’s privacy system for the advantage of creating a system that improves classification without compromising user privacy. As per claim 2, the combination teaches wherein the operations further comprise: deploying the trained at least one machine learning model; receiving, by the deployed trained at least one machine learning model, input data (Zaccak: trained model, [0096][0116]). As per claim 3, the combination teaches wherein the operations further comprise: providing, by the deployed trained at least one machine learning model based on the input data, a classification (Zaccak: determination, [0046]). As per claim 4, the combination teaches wherein: the at least one first user-generated privacy parameter comprises a bound for an adversarial posterior belief ρ c that corresponds to a likelihood to re-identify data points from the dataset based on a differentially private function output (Hebert: threshold, [0037]); and the calculated at least one second privacy parameter comprises privacy parameters ε, 𝛿 (Hebert: risk and utility, [0078]); and the calculating is based on a conditional probability of distributions of different datasets given a differential private function output which are bound by the posterior belief ρ c as applied to the dataset (Zaccak: multiple rounds, [0091]). As per claim 5, the combination teaches wherein the at least one first user-generated privacy parameter comprises privacy parameters ε, 𝛿 (Hebert: risk and utility, [0078]); the calculated at least one second privacy parameter comprises an expected membership advantage ρ α that corresponds to a probability of an adversary successfully identifying a member in the dataset (Hebert: threshold, [0037]); and the calculating is based on a conditional probability of different possible datasets (Zaccak: multiple rounds, [0091]). As per claim 6, the combination teaches wherein the at least one first user-generated privacy parameter comprises privacy parameters ε, 𝛿 (Hebert: risk and utility, [0078]); the calculated at least one second privacy parameter comprises an adversarial posterior belief bound ρ c that corresponds to a likelihood to re-identify data points from the dataset based on a differentially private output (Hebert: threshold, [0037]). As per claim 7, the combination teaches wherein the calculating is based on a conditional probability of different possible datasets (Zaccak: multiple rounds, [0091]). Claims 8 – 14 are rejected based on claims 1 – 7 Claims 15 – 20 are rejected based on claims 1-6 Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to OLUGBENGA O IDOWU whose telephone number is (571)270-1450. The examiner can normally be reached Monday-Friday 8am - 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, Jung Kim can be reached at 5712723804. 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. /OLUGBENGA O IDOWU/Primary Examiner, Art Unit 2494
Read full office action

Prosecution Timeline

Oct 02, 2024
Application Filed
Jan 20, 2026
Non-Final Rejection mailed — §103
Jan 27, 2026
Applicant Interview (Telephonic)
Jan 30, 2026
Examiner Interview Summary
Apr 17, 2026
Response Filed

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12634145
CRYPTOGRAPHIC TRUST SYSTEM FOR ELECTRONIC COMMUNICATIONS INTEGRITY USING TUPLE SPACES AND MESSAGING USER AGENTS
2y 4m to grant Granted May 19, 2026
Patent 12619780
INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING METHOD, AND PROGRAM
2y 3m to grant Granted May 05, 2026
Patent 12615143
PRIVACY PRESERVING MACHINE LEARNING LABELLING
3y 9m to grant Granted Apr 28, 2026
Patent 12608504
IDENTIFICATION AND VISUALIZATION OF TOP-RISK OBJECTS
2y 11m to grant Granted Apr 21, 2026
Patent 12591707
Privacy Preserving Insights and Distillation of Large Language Model Backed Experiences
2y 8m to grant Granted Mar 31, 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
71%
Grant Probability
90%
With Interview (+19.0%)
3y 3m (~1y 8m remaining)
Median Time to Grant
Low
PTA Risk
Based on 643 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