Prosecution Insights
Last updated: November 04, 2026
Application No. 17/607,272

System and Method for Automatic Differentiation of Higher-Order Functions

Final Rejection §101
Filed
Oct 28, 2021
Priority
Apr 29, 2019 — provisional 62/840,387 +2 more
Examiner
WAJE, CARLO C
Art Unit
2151
Tech Center
2100 — Computer Architecture & Software
Assignee
National University Of Ireland Maynooth
OA Round
4 (Final)
68%
Grant Probability
Favorable
5-6
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 68% — above average
68%
Career Allowance Rate
170 granted / 251 resolved
+12.7% vs TC avg
Strong +34% interview lift
Without
With
+33.6%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
37 currently pending
Career history
303
Total Applications
across all art units

Statute-Specific Performance

§101
23.2%
-16.8% vs TC avg
§103
28.4%
-11.6% vs TC avg
§102
12.5%
-27.5% vs TC avg
§112
33.5%
-6.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 251 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 . Claims 1-4 and 7-8 and 10-23 are pending in this application. Claims 1, 10-12 and 17-20 are currently amended; claims 2-4, 7-8 and 13-16 are previously presented; claims 21-23 are new; claims 5-6 and 9 are canceled. Claim Interpretation The term “higher-order” is interpreted as defined in paragraph [0107]. The term “eta expanding” is interpreted as defined in paragraph [0059]. 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-4 and 7-8 and 10-23 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. Under Step 1, claims 1-4, 7-8, 10-18 and 21-23 recite a series of steps and, therefore, is a process. Claim 19 recites a system and, therefore, is a machine. Claim 20 recites a non-transitory computer-readable medium and, therefore, is an article of manufacture. Under Step 2A prong 1, claim 1 recites A method for automatic differentiation of a function defined by program code, the method comprising: storing, in at least one memory, (i) an automatic differentiation program having a derivative operator program construct that implements a mathematical derivative operator and (ii) a further program that requires a determination of a derivative of a first mathematical function defined by first program code; receiving, with at least one processor, via an invocation of the derivative operator program construct by the further program, the first program code defining the first mathematical function, the first mathematical function being a higher-order function which takes a first argument as input; generating, based on the first program code by executing the automatic differentiation program with the at least one processor, second program code that defines a second mathematical function, the second mathematical function being a derivative of the first mathematical function, the generating the second program code including multiple executions of the derivative operator program construct, each execution of the derivative operator program construct being distinguished from one another using unique distinguishing features; receiving, with the at least one processor, via an invocation of the derivative operator program construct by the further program, a value for the first argument; determining a result by executing the second program code with the at least one processor to evaluate the second mathematical function at the received value for the first argument; and returning the result to the further program, wherein, for each respective execution of the derivative operator program construct, the generating the second program code comprises: forming a first dual number with the first argument as primal, with one as tangent, and with an infinitesimal number having a unique tag that uniquely associates the infinitesimal number with the respective execution of the derivative operator program construct; determining a first result by applying the first mathematical function with the first dual number as input; and extracting a first tangent from the first result with respect to the infinitesimal number associated with the respective execution of the derivative operator program construct, and wherein, the multiple executions of the derivative operator program construct include at least one execution for which the first result defines a third mathematical function which takes a second argument as input, and the extracting the first tangent comprises: in response to the first result defining the third mathematical function which takes the second argument as input, (i) determining a second result by substituting, in the second argument, each occurrence of the infinitesimal number associated with the respective execution of the derivative operator program construct with a temporary infinitesimal number having a first temporary unique tag, (ii) determining a third result by applying the third mathematical function to the second result, (iii) extracting a fourth tangent with respect to the infinitesimal number associated with the respective execution of the derivative operator program construct from the third result, and (iv) determining the first tangent by substituting, in the fourth tangent, each occurrence of the temporary infinitesimal number having the first temporary unique tag with the infinitesimal number associated with the respective execution of the derivative operator program construct. The above underlined limitations are related to calculating a derivative of a higher-order function which amounts to processing mathematical relationships/calculations and falls within the “Mathematical Concepts” grouping of abstract ideas. See at least paragraphs [0061-0062] including equations 19a-19z and paragraphs [0073-0074] including equations 25a-25w for the equations to determine the result expressed in words of the claim. Accordingly, the claim is directed to recite an abstract idea. Under step 2A prong 2, the claim recites the following additional elements: storing, in at least one memory, (i) an automatic differentiation program and (ii) a further program; receiving, with at least one processor, via an invocation of the derivative operator program construct by the further program, the first program code; generating, based on the first program code by executing the automatic differentiation program with the at least one processor, second program code; receiving, with the at least one processor, via an invocation of the derivative operator program construct by the further program, a value for the first argument; executing the second program code with the at least one processor; and returning the result to the further program. However, the additional elements of “at least one memory” and “at least one processor” are recited at a high-level of generality (i.e., as a generic computer component for storing program codes; and as a generic computer component for executing the program codes) such that they amount to no more than mere instructions using a generic computer component or merely as tools to implement the abstract idea. The additional elements of “generating, based on the first program code by executing the automatic differentiation program with the at least one processor, second program code” and “executing the second program code with the at least one processor” are merely generally linking the use of a judicial exception to a particular technological environment or field of use where a second mathematical program code is generated by executing a first mathematical program code in a computer environment and where second program code defines the second mathematical function that is further executed to determine the result. The additional elements of “storing”, in at least one memory, (i) an automatic differentiation program and (ii) a further program; “receiving”, with at least one processor, via an invocation of the derivative operator program construct by the further program, the first program code; “receiving”, with the at least one processor, via an invocation of the derivative operator program construct by the further program, a value for the first argument; and “returning” the result to the further program are merely adding insignificant extra-solution activities, i.e., necessary data gathering and outputting steps. The additional elements do not, individually or in combination, integrate the exception into a practical application. Accordingly, the claim is not integrated into a practical application. Under step 2B, claim 1 does not include additional elements that, individually or in combination, are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of “at least one memory” and “at least one processor” are recited at a high-level of generality (i.e., as a generic computer component for storing program codes; and as a generic computer component for executing the program codes) such that they amount to no more than mere instructions using a generic computer component or merely as tools to implement the abstract idea. The additional elements of “generating, based on the first program code by executing the automatic differentiation program with the at least one processor, second program code” and “executing the second program code with the at least one processor” are merely generally linking the use of a judicial exception to a particular technological environment or field of use where a second mathematical program code is generated by executing a first mathematical program code in a computer environment and where second program code defines the second mathematical function that is further executed to determine the result. The additional elements of “storing”, in at least one memory, (i) an automatic differentiation program and (ii) a further program; “receiving”, with at least one processor, via an invocation of the derivative operator program construct by the further program, the first program code; “receiving”, with the at least one processor, via an invocation of the derivative operator program construct by the further program, a value for the first argument; and “returning” the result to the further program are merely adding insignificant extra-solution activities, i.e., necessary data gathering and outputting steps. See MPEP 2106.05(d)(II) which states that the courts have recognized computer functions such as “Receiving or transmitting data over a network” and “Storing and retrieving information in memory” as well‐understood, routine, and conventional functions when they are claimed in a merely generic manner (e.g., at a high level of generality) or as insignificant extra-solution activity. The claim does not recite additional elements that alone or in combination amount to an inventive concept. Accordingly, the claim does not amount to significantly more than the abstract idea. Under step 2A prong 1, claims 2-4 and 7-8, 10-18 and 21-23 recite the same abstract idea as claim 1 by reason of dependence. Further, claim 4 recites further details of the abstract idea of “comprising: using one of (i) forward mode automatic differentiation, (ii) reverse mode automatic differentiation, (iii) checkpointing based reverse mode automatic differentiation, and (iii) a hybrid mode automatic differentiation”; claim 7 recites further details of the abstract idea of “comprising: eta expanding the first mathematical function until all of the multiple executions of the derivative operator program construct will result in non-function-containing results, wherein the eta expanding is performed prior to the forming of the first dual number, the determining of the first result, and the extracting of the first tangent, for each of the multiple executions of the derivative operator program construct”; claim 8 recites further details of the abstract idea of “as a result of the multiple executions of the derivative operator program construct in the eta expanding of the first mathematical function”; claim 10 recites further details of the abstract idea of “the substituting, in the second argument, and the substituting, in the fourth tangent, each comprising: determining a respective output by substituting, in a respective input, each occurrence of an infinitesimal number having a second unique tag with an infinitesimal number having a first unique tag, wherein the multiple executions of the derivative operator program construct include at least one execution for which the respective input defines a real number and, in response to the respective input defining the real number, the respective output is determined as being equal to the respective input, and wherein, the multiple executions of the derivative operator program construct include at least one execution for which the respective input defines a fourth dual number having only infinitesimal numbers having the first unique tag and, in response to the respective input defining a fourth dual number having only infinitesimal numbers having the first unique tag, the respective output is determined by substituting, in the fourth dual number, each occurrence of the infinitesimal number having the second unique tag with the infinitesimal number having the first unique tag”; claim 11 recites further details of the abstract idea of “wherein, the multiple executions of the derivative operator program construct include at least one execution for which the respective input defines a fifth dual number having infinitesimal numbers having a third unique tag and, in response to the respective input defining the fifth dual number having infinitesimal numbers having the third unique tag, the respective output is determined by (i) determining a fourth result by substituting each occurrence of the infinitesimal number having the second unique tag with the infinitesimal number having the first unique tag, in a primal of the fifth dual number with respect to the infinitesimal numbers having the third unique tag, (ii) determining a fifth result by substituting each occurrence of the infinitesimal number having the second unique tag with the infinitesimal number having the first unique tag in a tangent of the fifth dual number with respect to the infinitesimal numbers having the third unique tag, and (iii) determining the respective output as a dual number formed with the fourth result as primal, with the fifth result as tangent, and with the infinitesimal number having the third unique tag”; claim 12 recites further details of the abstract idea of “wherein the multiple executions of the derivative operator program construct include at least one execution for which the respective input defines a fourth mathematical function which takes a third argument as input and, in response to the respective input defining the fourth mathematical function which takes the third argument as input, (i) determining a sixth result by substituting each occurrence of the infinitesimal number having the second unique tag with the temporary infinitesimal number having the temporary unique tag in the third argument, (ii) determining a seventh result by applying the fourth mathematical function to the sixth result, (iii) determining an eighth result by substituting each occurrence of the infinitesimal number having the second unique tag with the infinitesimal number having the first unique tag in the seventh result, and (v) determining the respective output by substituting each occurrence of the temporary infinitesimal number having the temporary unique tag with the infinitesimal number having the second unique tag in the sixth result”; claim 13 recites further details of the abstract idea of “determining the second mathematical function as the first tangent”; claim 14 recites further details of the abstract idea of “wherein the first mathematical function is one whose range and domain are both functions, the first mathematical function taking the first argument and a second argument as inputs”; claim 15 recites further details of the abstract idea of “for each respective execution of the derivative operator program construct: forming a first bundle with the first argument and the second argument and with respect to an infinitesimal number having a unique tag that uniquely associates the infinitesimal number with the respective execution of the derivative operator program construct; determining a first result by applying the first mathematical function with the first bundle as input; and extracting a first tangent from the first result with respect to the infinitesimal number associated with the respective execution of the derivative operator program construct”; claim 16 recites further details of the abstract idea of “comprising: eta expanding the first mathematical function until all of the multiple executions of the derivative operator program construct will result in non-function-containing results, wherein the eta expanding is performed prior to the forming of the first bundle, the determining of the first result, and the extracting of the first tangent, for each of the multiple executions of the derivative operator program construct”; claim 17 recites further details of the abstract idea of “wherein at least one of: the multiple executions of the derivative operator program construct include at least one execution for which the first argument does not define a function and the fourth argument does not define a function and the forming the first bundle includes, in response to the first argument not defining a function and the second argument not defining a function, determining the first bundle as a dual number formed with the first argument as primal, with the second argument as tangent, and with the infinitesimal number associated with the respective execution of the derivative operator program construct; and the multiple executions of the derivative operator program construct include at least one execution for which the first argument defines a fifth mathematical function which takes a fifth argument as input and the fourth argument defines a sixth mathematical function which takes the fifth argument as input and the forming the first bundle includes, in response to the first argument defining the fifth mathematical function which takes the fifth argument as input and the fourth argument defining the sixth mathematical function which takes the fifth argument as input, (i) determining a fourth result by applying the fifth mathematical function with the fifth argument as input, (ii) determining a fifth result by applying the sixth mathematical function with the fifth argument as input, and (iii) determining the first bundle as a dual number formed with the fourth result as primal, with the fifth result as tangent, and with the infinitesimal number associated with the respective execution of the derivative operator program construct”; claim 18 recites further details of the abstract idea of “wherein at least one of: the multiple executions of the derivative operator program construct include at least one execution for which the first argument does not define a function and the fourth argument does not define a function and for each execution of the derivative operator program construct, the forming the first bundle includes, in response to the first argument not defining a function and the second argument not defining a function, determining the first bundle as a dual number formed with the first argument as primal, with the second argument as tangent, and with the infinitesimal number associated with the respective execution of the derivative operator program construct; and the multiple executions of the derivative operator program construct include at least one execution for which the first argument defines a fifth mathematical function which takes a fifth argument as input and the fourth argument defines a sixth mathematical function which takes the fifth argument as input and the forming the first bundle includes, in response to the first argument defining the fifth mathematical function which takes the fifth argument as input and the fourth argument defining the sixth mathematical function which takes the fifth argument as input, (i) determining a fourth result by substituting, in the fifth argument, each occurrence of the infinitesimal number associated with the respective execution of the derivative operator program construct with a temporary infinitesimal number having a second temporary unique tag, (ii) determining a fifth result by applying the fifth mathematical function with the fifth argument as input, (iii) determining a sixth result by applying the sixth mathematical function with the fifth argument as input, (iv) determining a second bundle as a dual number formed with the fifth result as primal, with the sixth result as tangent, and with the infinitesimal number associated with the respective execution of the derivative operator program construct, and (v) determining the first bundle by substituting, in the second bundle, each occurrence of the temporary infinitesimal number having the second temporary unique tag with the infinitesimal number associated with the respective execution of the derivative operator program construct”; claim 21 recites further details of the abstract idea of “wherein the multiple executions of the derivative operator program construct include at least one execution for which the first result defines a real number, and the extracting the first tangent comprises: in response to the first result defining the real number, determining the first tangent as zero”; claim 22 recites further details of the abstract idea of “wherein the multiple executions of the derivative operator program construct include at least one execution for which the first result defines a second dual number having only the infinitesimal number associated with the respective execution of the derivative operator program construct, and the extracting the first tangent comprises: in response to the first result defining the second dual number having only the infinitesimal number associated with the respective execution of the derivative operator program construct, determining the first tangent as a tangent of the second dual number with respect to the infinitesimal number associated with the respective execution of the derivative operator program construct”; and claim 23 recites further details of the abstract idea of “wherein the multiple executions of the derivative operator program construct include at least one execution for which the first result defines a third dual number having an infinitesimal number associated with a different execution of the derivative operator program construct, and the extracting the first tangent comprises: in response to the first result defining the third dual number having the infinitesimal number associated with the different execution of the derivative operator program construct, (i) extracting a second tangent with respect to the infinitesimal number associated with the respective execution of the derivative operator program construct from a primal of the third dual number with respect to the infinitesimal number associated with the different execution of the derivative operator program construct, (ii) extracting a third tangent with respect to the infinitesimal number associated with the respective execution of the derivative operator program construct from a tangent of the third dual number with respect to the infinitesimal number associated with the different execution of the derivative operator program construct, and (iii) determining the first tangent as a dual number formed with the second tangent as primal, with the third tangent as tangent, and with the infinitesimal number associated with the different execution of the derivative operator program construct” which falls within the “Mathematical Concepts” grouping of abstract ideas. In particular claims 4, 7-8, 10-18 and 21-23 do not include additional elements that would require further analysis under step 2A prong 2 and step 2B. Accordingly, the claims are directed to recite an abstract idea. Under step 2A prong 2, claim 2 recites the following additional elements: storing the result; claim 3 recites the following additional elements: storing the second program code. However, the additional elements of “storing the result” in claim 2; and “storing the second program code” in claim 3 are merely adding insignificant extra-solution activities. The additional elements do not, individually or in combination, integrate the exception into a practical application. Accordingly, the claims are not integrated into a practical application. Under step 2B, claims 2-3 do not include additional elements that, individually or in combination, are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of “storing the result” in claim 2; and “storing the second program code” in claim 3 are merely adding insignificant extra-solution activities. See MPEP 2106.05(d)(II) which states that the courts have recognized computer functions such as “Receiving or transmitting data over a network” and “Storing and retrieving information in memory” as well‐understood, routine, and conventional functions when they are claimed in a merely generic manner (e.g., at a high level of generality) or as insignificant extra-solution activity. The claims do not recite additional elements that alone or in combination amount to an inventive concept. Accordingly, the claims do not amount to significantly more than the abstract idea. Regarding claim 19, it is directed to a system and includes substantially the same limitations as the method of claim 1. All functions practiced by the system of claim 19 are performed by the method steps of claim 1. Claim 1 analysis applies equally to claim 19. Under Step 2A prong 1, claim 20 recites A non-transitory computer-readable medium for automatic differentiation of a function defined by program code, the non-transitory computer-readable medium storing program instructions including (i) an automatic differentiation program having a derivative operator program construct that implements a mathematical derivative operator and (ii) a further program that requires a determination of a derivative of a first mathematical function defined by first program code, the program instructions, when executed by at least one processor, cause the at least one processor to: receive, via an invocation of the derivative operator program construct by the further program, the first program code defining the first mathematical function, the first mathematical function being a higher-order function which takes a first argument as input; generate, based on the first program code, by executing the automatic differentiation program, second program code that defines a second mathematical function, the second mathematical function being a derivative of the first mathematical function, the generation of the second program code including multiple executions of the derivative operator program construct, each execution of the derivative operator program construct being distinguished from one another using unique distinguishing features; receive, via the invocation of the derivative operator program construct by the further program, a value for the first argument; determine a result by executing the second program code to evaluate the second mathematical function at the received value for the first argument; and return the result to the further program, wherein the first mathematical function is one whose range and domain are both functions, the first mathematical function taking the first argument and a second argument as inputs, wherein, for each respective execution of the derivative operator program construct, the generating the second program code comprises: forming a first bundle with the first argument and the second argument and with respect to an infinitesimal number having a unique tag that uniquely associates the infinitesimal number with the respective execution of the derivative operator program construct; determining a first result by applying the first mathematical function with the first bundle as input; and extracting a first tangent from the first result with respect to the infinitesimal number associated with the respective execution of the derivative operator program construct, and wherein the multiple executions of the derivative operator program construct include at least one execution for which the first argument defines a third mathematical function which takes a third argument as input and the second argument defines a fourth mathematical function which takes the third argument as input, and, the forming the first bundle comprises: in response to the first argument defining the third mathematical function which takes the third argument as input and the second argument defining the fourth mathematical function which takes the third argument as input, (i) determining a second result by substituting, in the third argument, each occurrence of the infinitesimal number associated with the respective execution of the derivative operator program construct with a temporary infinitesimal number having a temporary unique tag, (ii) determining a third result by applying the third mathematical function with the third argument as input,(iii) determining a fourth result by applying the fourth mathematical function with the third argument as input, (iv) determining a second bundle as a dual number formed with the third result as primal, with the fourth result as tangent, and with the infinitesimal number associated with the respective execution of the derivative operator program construct, and (v) determining the first bundle by substituting, in the second bundle, each occurrence of the temporary infinitesimal number having the temporary unique tag with the infinitesimal number associated with the respective execution of the derivative operator program construct. The above underlined limitations are related to calculating a derivative of a higher-order function which amounts to processing mathematical relationships/calculations and falls within the “Mathematical Concepts” grouping of abstract ideas. See at least paragraphs [0058-0062 and 0081-0095] including equations 17a-19z and 30a-34 for the equations to determine the result expressed in words of the claim. Accordingly, the claim is directed to recite an abstract idea. Under step 2A prong 2, the claim recites the following additional elements: storing program instructions including (i) an automatic differentiation program and (ii) a further program, the program instructions, when executed by at least one processor, cause the at least one processor to: receive, via an invocation of the derivative operator program construct by the further program, the first program code; generate, based on the first program code, by executing the automatic differentiation program, second program code; receive, via the invocation of the derivative operator program construct by the further program, a value for the first argument; executing the second program code; and return the result to the further program. However, the additional elements of “at least one processor” is recited at a high-level of generality (i.e., as a generic computer component for executing program codes) such that it amounts to no more than mere instructions using a generic computer component or merely as a tool to implement the abstract idea. The additional elements of “generate, based on the first program code, by executing the automatic differentiation program, second program code” and “executing the second program code” are merely generally linking the use of a judicial exception to a particular technological environment or field of use where a second mathematical program code is generated by executing a first mathematical program code in a computer environment and where second program code defines the second mathematical function that is further executed to determine the result. The additional elements of “storing program instructions including (i) an automatic differentiation program and (ii) a further program”; “receive, via an invocation of the derivative operator program construct by the further program, the first program code”; “receive, via the invocation of the derivative operator program construct by the further program, a value for the first argument”; and “return the result to the further program” are merely adding insignificant extra-solution activities, i.e., necessary data gathering and outputting steps. The additional elements do not, individually or in combination, integrate the exception into a practical application. Accordingly, the claim is not integrated into a practical application. Under step 2B, claim 20 does not include additional elements that, individually or in combination, are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of “at least one processor” is recited at a high-level of generality (i.e., as a generic computer component for executing program codes) such that it amounts to no more than mere instructions using a generic computer component or merely as a tool to implement the abstract idea. The additional elements of “generate, based on the first program code, by executing the automatic differentiation program, second program code” and “executing the second program code” are merely generally linking the use of a judicial exception to a particular technological environment or field of use where a second mathematical program code is generated by executing a first mathematical program code in a computer environment and where second program code defines the second mathematical function that is further executed to determine the result. The additional elements of “storing program instructions including (i) an automatic differentiation program and (ii) a further program”; “receive, via an invocation of the derivative operator program construct by the further program, the first program code”; “receive, via the invocation of the derivative operator program construct by the further program, a value for the first argument”; and “return the result to the further program” are merely adding insignificant extra-solution activities, i.e., necessary data gathering and outputting steps. See MPEP 2106.05(d)(II) which states that the courts have recognized computer functions such as “Receiving or transmitting data over a network” and “Storing and retrieving information in memory” as well‐understood, routine, and conventional functions when they are claimed in a merely generic manner (e.g., at a high level of generality) or as insignificant extra-solution activity. The claim does not recite additional elements that alone or in combination amount to an inventive concept. Accordingly, the claim does not amount to significantly more than the abstract idea. Allowable Subject Matter Claim 1-4, 7-8 and 10-23 would be allowable if rewritten to overcome the 35 U.S.C. 101 rejection discussed above. The following is a statement of reasons for the indication of allowable subject matter: The reasons for indication of allowable subject matter are the same reasons provided in the non-final office action submitted on 02/24/2026. Response to Arguments Applicant's arguments filed 08/22/2026, see remarks page 23-29 with respect to the 35 U.S.C. 101 rejection of claims 1-4, 7-8 and 10-20 have been fully considered but they are not persuasive. Applicant argues the following: A. Under step 2A prong One, the limitations of “storing, in at least one memory, (i) an automatic differentiation program and (ii) a further program that requires a determination of a derivative of a first mathematical function defined by first program code”; “receiving, with at least one processor, via an invocation of the derivative operator program construct by the further program, the first program code”; “receiving, with the at least one processor, via an invocation of the derivative operator program construct by the further program, a value for the first argument; and “returning the result to the further program” are not abstract idea steps as they are related to the concept of passing of data between two distinct programs stored in the memory. Response: Examiner agrees. Examiner has not identified these steps as reciting an abstract idea under step 2A prong One. B. Under step 2A prong Two and 2B, the additional elements of “storing, in at least one memory, (i) an automatic differentiation program and (ii) a further program that requires a determination of a derivative of a first mathematical function defined by first program code”; “receiving, with at least one processor, via an invocation of the derivative operator program construct by the further program, the first program code”; “receiving, with the at least one processor, via an invocation of the derivative operator program construct by the further program, a value for the first argument; and “returning the result to the further program” provides an improvement to the functioning of the computer itself because the derivative operator program construct in the automatic differentiation program can be invoked by other programs (the further program) by passing the first program code and a value for the first argument to the automatic differentiation program and the automatic differentiation program in tum, returns the result to the further program. Additionally, the claimed invention enables the automatic differentiation program to be completely general and be applied in an unrestricted fashion to correctly compute the derivative of all programs that compute differentiable mathematical functions through the claimed data-passing limitations and cited to paragraphs [0057, 0108-0109 and 0137]. Furthermore, these passing data steps define the very mechanism by which the further program obtains a derivative from the automatic differentiation program and are not insignificant extra-solution activities but impose meaningful limits that integrate any abstract ideas into a practical application. Response: Examiner respectfully disagrees. The additional elements of “storing, in at least one memory, (i) an automatic differentiation program and (ii) a further program that requires a determination of a derivative of a first mathematical function defined by first program code”; “receiving, with at least one processor, via an invocation of the derivative operator program construct by the further program, the first program code”; “receiving, with the at least one processor, via an invocation of the derivative operator program construct by the further program, a value for the first argument; and “returning the result to the further program” are limitations that amount to necessary data gathering and outputting steps required to implement the abstract idea on a computer environment as computer programs. As discussed, the program themselves defines a mathematical function, therefore, receiving the inputs via the invocation of the derivative operator program construct by the further program is equivalent to merely providing the inputs necessary to evaluate the mathematical functions. The alleged improvement appears to be in what is being passed (i.e., the derivative operator program construct that implements a mathematical derivative operator) rather than the mechanism in which (how) the data is being passed. There are no specific details regarding the “receiving” and “returning” steps besides the types of data being input and output such that these steps are recited in a merely generic manner (e.g., at a high level of generality) or as insignificant extra-solution activity. Furthermore, “storing”, “receiving” and “returning” are well‐understood, routine, and conventional computer functions. The addition of insignificant extra-solution activity does not amount to an inventive concept, particularly when the activity is well-understood or conventional. See MPEP 2106.05(d) and MPEP 2106.05(g) for more information. C. Under step 2A prong Two, the generating and executing limitations do not merely confine any mathematics to a computer environment. Instead, they specify how the claimed invention determines the derivative for the further program. Particularly, the second program code, which defines the second mathematical function, is generated by executing the automatic differentiation program based on the first program code received from the further program. The second program code is then executed to evaluate the second mathematical function at the received value for the first argument. The result is then returned to the further program. Response: Examiner respectfully disagrees. The steps of generating second program code and executing the second program code are merely generally linking the use of a judicial exception to a computer environment where the mathematical function is implemented as a computer program that is then executed to determine the result by evaluating the second mathematical function using the value of the first argument as an input to the mathematical function. Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Carlo Waje whose telephone number is (571)272-5767. The examiner can normally be reached 9:00-6:00 M-F. 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, James Trujillo can be reached on (571) 272-3677. 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. /Carlo Waje/Examiner, Art Unit 2182 (571)272-5767
Read full office action

Prosecution Timeline

Show 4 earlier events
Jan 09, 2026
Interview Requested
Jan 16, 2026
Examiner Interview Summary
Jan 16, 2026
Applicant Interview (Telephonic)
Jan 19, 2026
Request for Continued Examination
Jan 22, 2026
Response after Non-Final Action
Feb 24, 2026
Non-Final Rejection mailed — §101
Aug 22, 2026
Response Filed
Oct 08, 2026
Final Rejection mailed — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12775677
N-POINT COMPLEX FOURIER TRANSFORM STRUCTURE HAVING ONLY 2N REAL MULTIPLIES, AND OTHER MATRIX MULTIPLY OPERATIONS
4y 9m to grant Granted Oct 27, 2026
Patent 12769509
Computer-Implemented Method for Deciding Whether a Random Number is Larger or Smaller Than a Given Threshold
4y 2m to grant Granted Oct 20, 2026
Patent 12755058
SECRET MULTIPLE REPETITION CALCULATION APPARATUS, METHOD AND PROGRAM
4y 6m to grant Granted Oct 06, 2026
Patent 12754968
INFORMATION PROCESSING DEVICE, SOLUTION METHOD, AND COMPUTER-READABLE RECORDING MEDIUM STORING SOLUTION PROGRAM
4y 3m to grant Granted Oct 06, 2026
Patent 12750040
SIGNAL PROCESSING APPARATUS FOR GENERATING A PLURALITY OF OUTPUT SAMPLES USING COMBINER LOGIC BASED ON A HIEARCHICHAL TREE STRUCTURE
4y 4m to grant Granted Sep 29, 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

5-6
Expected OA Rounds
68%
Grant Probability
99%
With Interview (+33.6%)
3y 2m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 251 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