Office Action Predictor
Last updated: April 15, 2026
Application No. 18/218,970

SIMULTANEOUS DATA SAMPLING AND FEATURE SELECTION VIA WEAK LEARNERS

Non-Final OA §101
Filed
Jul 06, 2023
Examiner
MACKES, KRIS E
Art Unit
2153
Tech Center
2100 — Computer Architecture & Software
Assignee
Oracle International Corporation
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
2y 11m
To Grant
92%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allow Rate
400 granted / 527 resolved
+20.9% vs TC avg
Strong +16% interview lift
Without
With
+16.0%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
12 currently pending
Career history
539
Total Applications
across all art units

Statute-Specific Performance

§101
14.1%
-25.9% vs TC avg
§103
47.5%
+7.5% vs TC avg
§102
20.9%
-19.1% vs TC avg
§112
6.0%
-34.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 527 resolved cases

Office Action

§101
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 § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. Independent claims 1 and 11 Claim 1 recites “A method…” which is a series of steps and are therefore a process. Claim 11 recites “One or more non-transitory computer-readable media…” which is a manufacture. Independent claims 1 and 11 recite limitations of: generating… training… Claims 1 and 11 recite the limitations of “generating…” and “training…” which are processes that, under its broadest reasonable interpretation, cover performance of the limitation in the mind, but for the recitation of generic computer components. That is, other than reciting a processor, a computer, a non-transitory computer-readable media; nothing in the claim elements preclude the step from practically being performed in a human mind. If a claim limitation, under its broadest reasonable interpretation, covers performance of the limitation in the mind, then it falls withing the “Mental Processes” grouping of abstract ideas (concepts performed in the human mind including an observation, evaluation, judgement, and opinion). The claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception. The processor, a computer, and a non-transitory computer-readable media are recited at a high level of generality (i.e. as a generic processor performing a generic computer function) such that it amounts to no more than mere instructions to apply the exception using a generic computer component. Accordingly, these additional elements do not integrate the abstract idea into a practical application because they do not impose any meaningful limits on practicing the abstract idea (see MPEP 2106.05(f)). The claims are directed to an abstract idea. The Dependent claims 2-10 and 12-20 recite additional limitations of: generating… counting… summing… Claims 2-10 and 12-20 recite the limitations of “generating…”, “counting…”, and “summing…” which are processes that, under its broadest reasonable interpretation, cover performance of the limitation in the mind, but for the recitation of generic computer components. That is, other than reciting a processor, a computer, a non-transitory computer-readable media; nothing in the claim elements preclude the step from practically being performed in a human mind. If a claim limitation, under its broadest reasonable interpretation, covers performance of the limitation in the mind, then it falls withing the “Mental Processes” grouping of abstract ideas (concepts performed in the human mind including an observation, evaluation, judgement, and opinion). The judicial exception is not integrated into a practical application. Claims 2-10 and 12-20 recite no additional elements. The processor, a computer, a non-transitory computer-readable media are recited at a high level of generality (i.e. as a generic processor performing a generic computer function) such that it amounts to no more than mere instructions to apply the exception using a generic computer component. Accordingly, these additional elements do not integrate the abstract idea into a practical application because they do not impose any meaningful limits on practicing the abstract idea (see MPEP 2106.05(f)). The claims are directed to an abstract idea. The claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Brueckner et al. U.S. Patent No. 10,318,882 An indication of a data source to be used to train a linear prediction model is obtained. The model is to generate predictions using respective parameters assigned to a plurality of features derived from observation records of the data source. The parameter values are stored in a parameter vector. During a particular learning iteration of the training phase of the model, one or more features for which parameters are to be added to the parameter vector are identified. In response to a triggering condition, parameters for one or more features are removed from the parameter vector based on an analysis of relative contributions of the features represented in the parameter vector to the model's predictions. After the parameters are removed, at least one parameter is added to the parameter vector. Leskovec et al. U.S. Patent No. 11,783,175 Systems and methods for efficiently training a machine learning model are presented. More particularly, using information regarding the relevant neighborhoods of target nodes within a body of training data, the training data can be organized such that the initial state of the training data is relatively easy for a machine learning model to differentiate. Once trained on the initial training data, the training data is then updated such that differentiating between a matching and a non-matching node is more difficult. Indeed, by iteratively updating the difficulty of the training data and then training the machine learning model on the updated training data, the speed that the machine learning model reaches a desired level of accuracy is significantly improved, resulting in reduced time and effort in training the machine learning model. Moharrer et al. U.S. Patent No. 11,868,854 Herein are techniques that train regressor(s) to predict how effective would a machine learning model (MLM) be if trained with new hyperparameters and/or dataset. In an embodiment, for each training dataset, a computer derives, from the dataset, values for dataset metafeatures. The computer performs, for each hyperparameters configuration (HC) of a MLM, including landmark HCs: configuring the MLM based on the HC, training the MLM based on the dataset, and obtaining an empirical quality score that indicates how effective was said training the MLM when configured with the HC. A performance tuple is generated that contains: the HC, the values for the dataset metafeatures, the empirical quality score and, for each landmark configuration, the empirical quality score of the landmark configuration and/or the landmark configuration itself. Based on the performance tuples, a regressor is trained to predict an estimated quality score based on a given dataset and a given HC. Gunes et al. U.S. Publication No. 2019/0370684 A computing device selects a feature set and hyperparameters for a machine learning model to predict a value for a characteristic in a scoring dataset. A number of training model iterations is determined. A unique evaluation pair is selected for each iteration that indicates a feature set selected from feature sets and a hyperparameter configuration selected from hyperparameter configurations. A machine learning model is trained using each unique evaluation pair. Each trained machine learning model is validated to compute a performance measure value. An estimation model is trained with the feature set, the hyperparameter configuration, and the performance measure value computed for unique evaluation pair. The trained estimation model is executed to compute the performance measure value for each unique evaluation pair. A final feature set and a final hyperparameter configuration are selected based on the computed performance measure value. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KRIS E MACKES whose telephone number is (571)270-3554. The examiner can normally be reached Monday-Friday 9:00-4:00 EST. 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, Kavita Stanley can be reached at 571-272-8352. 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. /KRIS E MACKES/Primary Examiner, Art Unit 2153
Read full office action

Prosecution Timeline

Jul 06, 2023
Application Filed
Feb 17, 2026
Non-Final Rejection — §101
Mar 10, 2026
Examiner Interview Summary
Mar 10, 2026
Applicant Interview (Telephonic)
Mar 26, 2026
Response Filed

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12572501
INTEGRATED DIGITAL-ANALOG ARCHIVING SYSTEMS AND METHODS FOR DOCUMENT PRESERVATION
2y 5m to grant Granted Mar 10, 2026
Patent 12572547
Systems and Methods for Deployment of Continuous Access Evaluation Protocol (CAEP) Hub Engine
2y 5m to grant Granted Mar 10, 2026
Patent 12563365
SYSTEMS AND METHODS FOR LOCALIZED INFORMATION PROVISION USING WIRELESS COMMUNICATION
2y 5m to grant Granted Feb 24, 2026
Patent 12541433
DATA BACKUP METHOD, ELECTRONIC DEVICE, DATA BACKUP SYSTEM, AND CHIP SYSTEM
2y 5m to grant Granted Feb 03, 2026
Patent 12536241
Combined Wide And Deep Machine Learning Models For Automated Database Element Processing Systems, Methods And Apparatuses
2y 5m to grant Granted Jan 27, 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
76%
Grant Probability
92%
With Interview (+16.0%)
2y 11m
Median Time to Grant
Low
PTA Risk
Based on 527 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in for Full Analysis

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

Free tier: 3 strategy analyses per month