Prosecution Insights
Last updated: May 29, 2026
Application No. 17/780,312

METHODS FOR DETERMINING APPLICATION OF MODELS IN MULTI-VENDOR NETWORKS

Non-Final OA §103
Filed
May 26, 2022
Priority
Nov 28, 2019 — nonprovisional of PCTSE2019051204
Examiner
PARK, GRACE A
Art Unit
2144
Tech Center
2100 — Computer Architecture & Software
Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
OA Round
3 (Non-Final)
76%
Grant Probability
Favorable
3-4
OA Rounds
0m
Est. Remaining
94%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allowance Rate
424 granted / 560 resolved
+20.7% vs TC avg
Strong +18% interview lift
Without
With
+18.1%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
18 currently pending
Career history
585
Total Applications
across all art units

Statute-Specific Performance

§101
6.3%
-33.7% vs TC avg
§103
80.8%
+40.8% vs TC avg
§102
7.9%
-32.1% vs TC avg
§112
3.0%
-37.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 560 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 . Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on February 12, 2026 has been entered. Response to Amendment and Arguments Claims 1-20 are pending and are being examined in this application. In light of Applicant’s amendments to the claims, the 101 rejection is withdrawn. Applicant’s arguments with respect to the 103 rejections have been considered, but are moot in view of the new ground(s) of rejection provided below. Allowable Subject Matter Claims 3-7, 10, 11, and 13-20 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 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. Claims 1, 2, 8, 9, and 12 are rejected under 35 U.S.C. 103 as being unpatentable over Mermoud et al. (US Pub. 20160352764) in view of Lecue et al. (US Pub. 20190213039). Referring to claim 1, Mermoud discloses A method performed by a first network node for determining application of at least one machine learning model from a plurality of machine learning models in a multi-vendor communications network [figs. 3 and 4; pars. 17, 51, 55, 56, and 76; a computer network comprises a plurality of provider edges (PEs) and client edges (CEs) that communicate via a network backbone; a server is configured as a supervisory and control agent (SCA), and one or more CEs are configured as distributed learning agents (DLAs); the SCA coordinates deployment of machine learning models to target DLAs], the method comprising: receiving a request from an actor device operating in a target network to enable running a task for the target network on the multi-vendor communications network by using at least one of the machine learning models from the plurality of machine learning models to perform the task [figs. 3 and 4; pars. 55, 84, and 85; the SCA receives a request from a UI process of a client device (via a CE operating in a local network running a target DLA) to select a machine learning model from a machine learning library to perform anomaly detection for the target DLA]; responsive to the request, determining whether the at least one of the machine learning models from the plurality of machine learning models...to perform the task [pars. 76, 83, and 84; the SCA determines the machine learning model to select based on whether the machine learning model was constructed using similar network and traffic characteristics as the target DLA (i.e., how well the machine learning model will perform the anomaly detection)]; and responsive to the determination, sending a communication to the actor device, wherein the communication comprises information that a machine learning model from the plurality of machine learning models is ready to perform the task or that no machine learning model was found to perform the task [fig. 3; pars. 55, 69, 84, and 85; the SCA sends a message including only an ID of the (already cached) machine learning model to the target DLA]. Mermoud does not appear to explicitly disclose determining whether the at least one machine learning model can be translated to perform the task using a semantic mapping of data for the target network to the at least one of the machine learning models. However, Lecue discloses determining whether the at least one machine learning model can be translated to perform the task using a semantic mapping of data for the target network to the at least one of the machine learning models [pars. 10, 11, 18, 21, and 24; a model determination platform determines an AI model associated with a source domain to perform a target task for a target domain; the AI model is identified from a set of AI models based on a set of (semantic) mappings, different clusters, and/or a performance measure based on (semantic) features, (semantic) differentiators, the set of mappings, and/or the different clusters; various semantic correspondences between the target domain and the AI model are used to determine how well the AI model will perform the target task (i.e., how well the AI model can be translated to perform the task)]. It would have been obvious to one ordinary skill in the art to modify the selecting of the machine learning model taught by Mermoud so that the machine learning model is selected based on semantic correspondences as taught by Lecue, with a reasonable expectation of success. The motivation for doing so would have been to facilitate transfer of AI models across different domains [Lecue, par. 10]. Referring to claim 2, Mermoud discloses The method of Claim 1, wherein the task comprises one of: a prediction of a key performance indicator; a proposal for at least one property of the target network; a probability for at least one property of the target network; an action on the target network; an improvement of at least one operating parameter of the target network; a classification of data in the target network [pars. 83 and 84; note the anomaly detection]; and an analysis of data in the target network [pars. 83 and 84; note the anomaly detection]. Referring to claim 8, Mermoud discloses The method of claim 1, further comprising: determining whether the at least one machine learning model comprises an exact match for performing the task using the inputs from each description of a network inventory model that apply to performing the task in the target network [par. 84; note the selecting based on the network and traffic characteristics of the target DLA]. Referring to claim 9, Mermoud and Lecue disclose The method of Claim 8, further comprising: in response to determining that no machine learning model comprises an exact match, determining whether at least one machine learning model from the filtered identification of machine learning models comprises a machine learning model that can be translated to perform the task [Mermoud: pars. 61, 76, 84; note the selecting based on the network and traffic characteristics of the target DLA, where the machine learning model can be updated or combined with other machine learning models to perform the anomaly detection; Lecue: pars. 10, 11, 18, 21, and 24, disclosing using semantic correspondences to identify the AI model (i.e., there may not be an exact match)]. Referring to claim 12, Mermoud discloses The method of claim 1, further comprising: adapting the at least one machine learning model for performing the task [pars. 61 and 76; the machine learning model can be updated or combined with other machine learning models to perform the anomaly detection]. Contact Information Any inquiry concerning this communication or earlier communications from the examiner should be directed to GRACE PARK whose telephone number is (571)270-7727. The examiner can normally be reached M-F 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, TAMARA KYLE can be reached at (571)272-4241. 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. /Grace Park/Primary Examiner, Art Unit 2144
Read full office action

Prosecution Timeline

May 26, 2022
Application Filed
Jun 06, 2025
Non-Final Rejection mailed — §103
Oct 06, 2025
Response Filed
Dec 17, 2025
Final Rejection mailed — §103
Feb 17, 2026
Response after Non-Final Action
Mar 12, 2026
Request for Continued Examination
Mar 18, 2026
Response after Non-Final Action
Apr 02, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12639627
TRAINING OF MACHINE LEARNING MODELS WITH HARDWARE-IN-THE-LOOP SIMULATIONS
3y 8m to grant Granted May 26, 2026
Patent 12639568
Method, System, and Computer Program Product for Determining Relationships of Entities Associated with Interactions
3y 8m to grant Granted May 26, 2026
Patent 12639356
OPTIMIZED CONTENT GENERATION METHOD AND SYSTEM
2y 4m to grant Granted May 26, 2026
Patent 12608650
STORAGE MEDIUM, INFORMATION PROCESSING METHOD, AND INFORMATION PROCESSING APPARATUS
3y 6m to grant Granted Apr 21, 2026
Patent 12591807
SKETCHED AND CLUSTERED FEDERATED LEARNING WITH AUTOMATIC TUNING
3y 2m 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

3-4
Expected OA Rounds
76%
Grant Probability
94%
With Interview (+18.1%)
3y 4m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 560 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