Prosecution Insights
Last updated: July 17, 2026
Application No. 19/012,864

TRAINING A MACHINE LEARNED MODEL TO DETERMINE RELEVANCE OF ITEMS TO A QUERY USING DIFFERENT SETS OF TRAINING DATA FROM A COMMON DOMAIN

Non-Final OA §DP
Filed
Jan 08, 2025
Priority
Feb 09, 2022 — continuation of 12/222,937
Examiner
GANGER, LAUREN ZANNAH
Art Unit
2156
Tech Center
2100 — Computer Architecture & Software
Assignee
Maplebear Inc.
OA Round
1 (Non-Final)
82%
Grant Probability
Favorable
1-2
OA Rounds
1y 1m
Est. Remaining
94%
With Interview

Examiner Intelligence

Grants 82% — above average
82%
Career Allowance Rate
222 granted / 272 resolved
+26.6% vs TC avg
Moderate +12% lift
Without
With
+11.9%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
5 currently pending
Career history
283
Total Applications
across all art units

Statute-Specific Performance

§101
5.1%
-34.9% vs TC avg
§103
65.3%
+25.3% vs TC avg
§102
20.7%
-19.3% vs TC avg
§112
2.4%
-37.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 272 resolved cases

Office Action

§DP
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 . Information Disclosure Statement The IDS filed 2/12/2025 has been considered by examiner. Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claim 1-20 rejected on the ground of nonstatutory double patenting as being unpatentable over claim of U.S. Patent No. 12,222,937 in view of Cheng et al in US Patent Application Publication № 2021/0248321, hereinafter called Cheng. In regard to claim 1, the reference claims recite a computer-implemented method, comprising: wherein the machine-learned model is trained by: generating training data comprising a plurality of examples, each example comprising a historical query received by an online system and an item with which a user of the online system performed a specific interaction, wherein a label applied to each example of the training data indicates whether the specific interaction was performed with the item after the online system received the historical query (“generating training data comprising a plurality of examples, each example comprising a query received by an online concierge system and an item with which a user of the online concierge system performed a specific interaction, wherein a label applied to each example of the training data indicates whether the specific interaction was performed with the item after the online concierge system received the query;” reference claim 1); generating a noisy subset of training data and a high-quality subset of training data based on a metric that defines a quality of training data, wherein the high-quality subset has a higher metric value than the noisy subset (identically recited in reference claim 1); initializing the machine-learned model of a plurality of layers, the machine- learned model configured to receive the historical query and the item of an example (“initializing the machine-learned model comprising a network of a plurality of layers, the machine-learned model configured to receive a query and an item and to generate a predicted measure of relevance of the item to the query;” reference claim 1); generating predicted measures of the items of the examples (“for each of a plurality of the examples of the noisy subset of the training data: applying, by one or more processors, the machine-learned model to the query of the example of the noisy subset of the training data and to the item of the example of the noisy subset of the training data;” reference claim 1, note further that such predictions are expressly recited as being used in reference claim 1); training the machine-learned model (i.e. by adjusting weights using example data) using the examples of the noisy subset of the training data (the examples are taught to be used, “the backpropagating performed […] based on a difference between the label applied to the example of the noisy subset of the training data and a predicted measure of relevance of the item of the example of the noisy subset of the training data” reference claim 1 ) to update a set of parameters of the machine-learned model (“update a set of parameters of the network”; further, “storing, in the computer readable storage medium, the set of parameters of the network that are updated in the one or more iterations;” reference claim 1) through backpropagating error terms based on differences between the labels applied to the examples of the noisy subset of the training data and predicted measures of the examples of the noisy subset of the training data (“the backpropagating performed through the network and one or more of the error terms based on a difference between the label applied to the example of the noisy subset of the training data and a predicted measure of relevance of the item of the example of the noisy subset of the training data” reference claim 1) storing the set of parameters of the machine-learned model that are trained by the noisy subset as a first set of trained parameters (“storing, in the computer readable storage medium, the set of parameters of the network that are updated in the one or more iterations” reference claim 1); training the machine-learned model using the examples of the high-quality subset of the training data to update the first set of trained parameters through backpropagating error terms based on differences between the labels applied to the examples of the high-quality subset of the training data and predicted measures of the examples of the high-quality subset of the training data (“for each of the plurality of the examples of the high-quality subset of the training data: applying, by the one or more processors, the machine-learned model to the query of the example of the high-quality subset of the training data and to the item of the example of the high-quality subset of the training data;” and further “backpropagating, by the one or more processors, one or more error terms obtained from one or more loss functions to generate a modified set of parameters of the network, the backpropagating performed through the network and one or more of the error terms based on a difference between a label applied to the example of the high-quality subset of the training data and a predicted measure of relevance of the item of the example of the high-quality subset of the training data and to the query of the example of the subset of the training data;” reference claim 1); storing updated set of parameters of the machine-learned model that are trained by the high-quality subset as a second set of trained parameters; and storing the second set of trained parameters trained from the high-quality subset of the training data as parameters of the machine-learned model (“and storing, in the computer readable storage medium, the modified set of parameters of the network trained from the subset of the training data as parameters of the machine-learned model.” Reference claim 1); However, the reference claims fail to expressly recite receiving a query for retrieving one or more items; applying a machine-learned model to identify a plurality of candidate items; and returning one or more candidate items identified by the machine-learned model in response to the query. Cheng teaches receiving a query for retrieving one or more items (Fig. 2, element 218); applying a machine-learned model to identify a plurality of candidate items (Fig. 2, element 220); and returning one or more candidate items identified by the machine-learned model in response to the query (Fig. 2, element 222). It would have been obvious to one of ordinary skill in the art before the effective filing date of the instant invention to modify the reference claims to include the receipt of a query that uses the trained model to identify candidate items, as taught by Cheng. It would have been obvious because it represents the application of a known technique (i.e. providing a query to a trained machine learning model, which is trained using example data from user behavior, to identify candidate items, as taught by Cheng in paragraphs 0051-0054, and Fig. 2) to improve similar systems (i.e. the machine-learning-model entity recognition system which is trained based on examples and , as taught by Cheng, and the machine-learning-model item identification system which is trained based on examples from historical queries, as recited in the reference claims) in the same way (i.e. the trained model is queried to identify candidate items based on the training data). In regard to instant claims 11 and 20, they are substantially similar to instant claim 1, and accordingly are rejected under similar reasoning. In regard to instant claim 2, the reference claims further recite that generating the high- quality subset of training data comprises: selecting examples of the training data including items with which the specific interaction was performed with at least a threshold frequency (“generating the high-quality subset of training data comprises: selecting examples of the training data including items with which the specific interaction was performed with at least a threshold frequency.” Reference claim 2). In regard to instant claim 12, it is substantially similar to instant claim 2 and accordingly is rejected under similar reasoning. In regard to instant claim 3, the reference claims further recite that generating the high- quality subset of training data further comprises: determining an example of the training data includes an item with which the specific frequency was performed with at least an additional threshold frequency; and including a specific number of replicas of the example determined to include the item with which the specific frequency was performed with at least the additional threshold frequency in the subset of the training data in response to the determining (identically recited in reference claim 3). In regard to instant claim 13, it is substantially similar to instant claim 3 and accordingly is rejected under similar reasoning. In regard to instant claim 4, the reference claims further recite that generating the high- quality subset of training data comprises: ranking examples of the training data based on frequencies with which the specific interaction was performed with items included in the examples of the training data; selecting examples of the training data having at least a threshold position in the ranking (identically recited in reference claim 4). In regard to instant claim 14, it is substantially similar to instant claim 4 and accordingly is rejected under similar reasoning. In regard to instant claim 5, the reference claims further recite that generating the high- quality subset of training data further comprises: determining an example of the training data includes an item with which the specific frequency was performed with at least a threshold frequency; and including a specific number of replicas of the example determined to include the item with which the specific frequency was performed with at least the threshold frequency in the subset of the training data in response to the determining (identically recited in reference claim 5). In regard to instant claim 15, it is substantially similar to instant claim 5 and accordingly is rejected under similar reasoning. In regard to instant claim 6, the reference claims further recite that the specific interaction comprises including the item in an order received by the online system (“the specific interaction comprises including the item in an order received by the online concierge system” reference claim 6). In regard to instant claim 16, it is substantially similar to instant claim 6 and accordingly is rejected under similar reasoning. In regard to instant claim 7, the reference claims further recite that backpropagating the error terms based on the differences between the labels applied to the examples of the noisy subset of the training data and predicted measures of the examples of the noisy subset of the training data comprises: generating the error terms from application of the machine-learned model to the example of the high-quality subset of the training data using an alternative loss function than a loss function generating the error term from application of the machine-learned model to the example of the training data (“backpropagating one or more error terms obtained from one or more loss functions to modify the set of parameters of the network comprises: generating the one or more error terms from application of the machine-learned model to the example of the high-quality subset of the training data using an alternative loss function than a loss function generating the error term from application of the machine-learned model to the example of the training data.” Reference claim 7). In regard to instant claim 17, it is substantially similar to instant claim 7 and accordingly is rejected under similar reasoning. In regard to instant claim 8, the reference claims further recite that the alternative loss function applies a higher weight to an error term from application of the machine-learned model to the example of the high-quality subset of the training data than the loss function generating the error term from application of the machine-learned model to the noisy subset of the training data (identically recited in reference claim 8). In regard to instant claim 18, it is substantially similar to instant claim 8 and accordingly is rejected under similar reasoning. In regard to instant claim 9, the reference claims further recite that generating the predicted measures of the items of the examples comprises: applying the machine-learned model with a particular architecture to the example of the noisy subset of the training data and to the item of the example of the noisy subset of the training data (“applying the machine-learned model to the query of the example of the noisy subset of the training data and to the item of the example of the noisy subset of the training data comprises: applying the machine-learned model with a particular architecture to the example of the noisy subset of the training data and to the item of the example of the noisy subset of the training data.” Reference claim 9). In regard to instant claim 19, it is substantially similar to instant claim 9 and accordingly is rejected under similar reasoning. In regard to instant claim 10, the reference claims further recite that generating the predicted measures of the items of the examples comprises: applying the machine-learned model with a different architecture than the particular architecture to the example of the high-quality subset of the training data and to the item of the high-quality subset of the example of the training data (“wherein applying the machine-learned model to the query of the example of the high-quality subset of the training data and to the item of the example of the high-quality subset of the training data comprises: applying the machine-learned model with a different architecture than the particular architecture to the example of the high-quality subset of the training data and to the item of the high-quality subset of the example of the training data.” Reference claim 10). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Lauren Z Ganger whose telephone number is (571)272-0270. The examiner can normally be reached 10:00 AM - 7: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, Ajay Bhatia can be reached at (571) 272-3906. 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. /AJAY M BHATIA/Supervisory Patent Examiner, Art Unit 2156
Read full office action

Prosecution Timeline

Jan 08, 2025
Application Filed
Jun 23, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12657207
METHODS AND SYSTEMS FOR REPLICATED STATE MACHINE TRANSITION
2y 2m to grant Granted Jun 16, 2026
Patent 12645539
DATA REPLICATION WITH CROSS REPLICATION GROUP REFERENCES
1y 6m to grant Granted Jun 02, 2026
Patent 12639333
INDICATING DIFFERENCES IN AND RECONCILING DATA STORED IN DISPARATE DATA STORAGE DEVICES
1y 4m to grant Granted May 26, 2026
Patent 12619629
INTELLIGENT METHOD TO COMBINE MULTIPLE BLOCKCHAIN BASED SMART CONTRACTS LEVERAGING GENERATIVE ARTIFICIAL INTELLIGENCE
2y 7m to grant Granted May 05, 2026
Patent 12613883
METHODS OF ORCHESTRATED DATA SHARING ACROSS CLOUD REGIONS AND CLOUD PLATFORMS OF CLOUD-BASED DATA WAREHOUSING SYSTEMS
1y 7m to grant Granted Apr 28, 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
94%
With Interview (+11.9%)
2y 7m (~1y 1m remaining)
Median Time to Grant
Low
PTA Risk
Based on 272 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