IP Library › Granted Patent US 12,694,343
Granted Patent B2
US 12,694,343 · App. 19/301,756 · Granted Jul 28, 2026

Multi-variable optimization for routing requests to language models

Inventors: Ganesh Prasad Bhat (New Jersey, NJ); Zheyu Wang (Shanghai, CN); Haolin Jin (Shanghai, CN); Sourabh Deb (Tampa, FL); Jason Ryan Engelbrecht (London, GB); Payal Jain (London, GB); Tariq Husayn Maonah (London, GB); Mariusz Saternus (Cracow, PL); Daniel Lewandowski (Cracow, PL); Biraj Krushna Rath (London, GB); Stuart Murray (London, GB); Philip Davies (London, GB); James Myers (Clearwater, FL)
G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,694,343
App. No.
19/301,756
Filed
Aug 15, 2025
Granted
Jul 28, 2026
Kind
B2
Art Unit
2122
USPC
706/12
Abstract

Systems, methods, and devices that relate to routing requests to large language models (LLMs) are disclosed. In one example aspect, the system receives session-specific data elements in response to a request to generate an output using LLMs. The system determines a hierarchy of operational constraints including privacy protocols and performance requirements. Weights for a multi-variable optimization are dynamically updated using the session-specific data elements. The system executes the multi-variable optimization across candidate LLMs that satisfy privacy constraints and optimize performance constraints. Based on the optimization, at least one candidate LLM is selected and the request is routed to it. In response to performance feedback, the system automatically selects a different LLM to improve one constraint, resulting in degradation of another constraint.

Claims (79)

1 . One or more non-transitory, computer-readable storage medium comprising instructions recorded thereon, wherein the instructions, when executed by at least one data processor of a system, cause the system to:

receive, in response to a request to generate an output using large language models (LLMs), a plurality of session-specific data elements including prior interaction data, system environment parameters, and computational context values, wherein the plurality of session-specific data elements is updated based on each request and each response;

determine a hierarchy of operational constraints for routing the request to an LLM, the hierarchy of operational constraints comprising a first subset of constraints that comprises privacy and data handling protocols and a second subset of constraints that comprises processing latency thresholds, model response requirements, and resource allocation limitations;

dynamically update weights, using the plurality of session-specific data elements, for a multi-variable optimization;

execute the multi-variable optimization, using the dynamically updated weights, across a plurality of candidate LLMs, wherein each of the plurality of candidate LLMs satisfies the first subset of constraints and optimizes the second subset of constraints such that any further improvement of one constraint in the second subset causes degradation of at least one other constraint in the second subset;

select, based on the multi-variable optimization, at least one candidate LLM for the request;

route the request to the at least one candidate LLM to cause the at least one candidate LLM to generate the output for the request; and

in response to receiving system performance feedback comprising measured runtime performance of the at least one candidate LLM, the system performance feedback relating to at least one constraint in the second subset, automatically select a different LLM from among the plurality of candidate LLMs to improve the at least one constraint, resulting in the degradation of at least one other constraint in the second subset, wherein each constraint in the second subset has a different respective performance metric and a different respective threshold, and wherein the system performance feedback indicates that a respective performance metric for the at least one constraint has deviated beyond a respective threshold for the at least one constraint.

2 . The one or more non-transitory, computer-readable storage medium of claim 1 , wherein the instructions for automatically selecting a different LLM further cause the system to:

retrieve an updated plurality of session-specific data elements;

dynamically update the weights, using the updated plurality of session-specific data elements, for the multi-variable optimization;

increase a weight associated with an objective within the multi-variable optimization corresponding to the at least one constraint in the second subset;

re-execute the multi-variable optimization using the increased weight and the updated plurality of session-specific data elements to generate an updated candidate set of LLMs; and

select, as the different LLM, a candidate LLM from the plurality of candidate LLMs that provides improved performance for the at least one constraint of the second subset and satisfies the first subset of constraints.

3 . The one or more non-transitory, computer-readable storage medium of claim 1 , wherein the instructions for dynamically updating the weights for the multi-variable optimization further cause the system to:

monitor the prior interaction data, the system environment parameters, and the computational context values for the request;

determine revised weights for the multi-variable optimization based on changes in the prior interaction data, the system environment parameters, or the computational context values for the request; and

apply the revised weights in performing the multi-variable optimization to adjust a relative importance of each objective associated with the second subset of constraints.

4 . The one or more non-transitory, computer-readable storage medium of claim 1 , wherein the instructions for selecting, based on the multi-variable optimization, the at least one candidate LLM to process the request further cause the system to:

compare, for each of the plurality of candidate LLMs that satisfy the first subset of constraints, results of the multi-variable optimization with the dynamically updated weights; and

select the at least one candidate LLM that most closely satisfies the second subset of constraints in accordance with the dynamically updated weights.

5 . The one or more non-transitory, computer-readable storage medium of claim 1 , wherein the instructions for receiving the plurality of session-specific data elements further cause the system to, prior to executing the multi-variable optimization, filter the plurality of session-specific data elements to exclude data elements that do not satisfy the privacy and data handling protocols of the first subset of constraints, such that only compliant session-specific data elements are used for dynamically updating the weights for the multi-variable optimization.

6 . The one or more non-transitory, computer-readable storage medium of claim 1 , wherein the instructions further cause the system, prior to routing the request to the at least one candidate LLM, to:

determine a context complexity score derived from the plurality of session-specific data elements; and

apply a complexity threshold for selecting the at least one candidate LLM based on the context complexity score.

7 . A method comprising:

receiving, in response to a request to generate an output using a set of AI models, a plurality of session-specific data elements including prior interaction data, system environment parameters, and computational context values;

determining a first subset of constraints and a second subset of constraints for routing the request to an AI model of the set of AI models, the first subset of constraints comprising privacy and data handling protocols and the second subset of constraints comprising processing latency thresholds, model response requirements, and resource allocation limitations;

updating weights, using the plurality of session-specific data elements, for a multi-variable optimization;

executing the multi-variable optimization, using the updated weights, across a plurality of candidate AI models of the set of AI models, wherein each of the plurality of candidate AI models satisfies the first subset of constraints and optimizes the second subset of constraints;

selecting, based on the multi-variable optimization, at least one candidate AI model for the request;

routing the request to the at least one candidate AI model to cause the at least one candidate AI model to generate the output for the request;

in response to receiving system performance feedback relating to at least one constraint in the second subset, automatically selecting a different AI model from among the plurality of candidate AI models to improve the at least one constraint, wherein each constraint in the second subset has a different respective performance metric and a different respective threshold, and wherein the system performance feedback indicates that a respective performance metric for the at least one constraint has deviated beyond a respective threshold for the at least one constraint.

8 . The method of claim 7 , further comprising, in response to receiving system performance feedback relating to at least one constraint in the second subset, automatically selecting a different AI model from among the plurality of candidate AI models to improve the at least one constraint.

9 . The method of claim 8 , wherein automatically selecting a different AI model further comprises:

retrieving an updated plurality of session-specific data elements;

dynamically updating the weights, using the updated plurality of session-specific data elements, for the multi-variable optimization;

increasing a weight associated with an objective within the multi-variable optimization corresponding to the at least one constraint in the second subset;

re-executing the multi-variable optimization using the increased weight and the updated plurality of session-specific data elements to generate an updated candidate set of AI models; and

selecting, as the different AI model, a candidate AI model from the plurality of candidate AI models that provides improved performance for the at least one constraint of the second subset and satisfies the first subset of constraints.

10 . The method of claim 7 , wherein dynamically updating the weights for the multi-variable optimization further comprises:

monitoring the prior interaction data, the system environment parameters, and the computational context values for the request;

determining revised weights for the multi-variable optimization based on changes in the prior interaction data, the system environment parameters, or the computational context values for the request; and

applying the revised weights in performing the multi-variable optimization to adjust a relative importance of each objective associated with the second subset of constraints.

11 . The method of claim 7 , wherein selecting, based on the multi-variable optimization, the at least one candidate AI model to process the request further comprises:

comparing, for each of the plurality of candidate AI models that satisfy the first subset of constraints, results of the multi-variable optimization with the updated weights; and

selecting the at least one candidate AI model that most closely satisfies the second subset of constraints in accordance with the updated weights.

12 . The method of claim 7 , wherein receiving the plurality of session-specific data elements further comprises, prior to executing the multi-variable optimization, filtering the plurality of session-specific data elements to exclude data elements that do not satisfy the privacy and data handling protocols of the first subset of constraints, such that only compliant session-specific data elements are used for dynamically updating the weights for the multi-variable optimization.

13 . The method of claim 7 , further comprising, prior to routing the request to the at least one candidate AI model:

determining a context complexity score derived from the plurality of session-specific data elements; and

applying a complexity threshold for selecting the at least one candidate AI model based on the context complexity score.

14 . A system comprising:

a storage device; and

one or more processors communicatively coupled to the storage device storing instructions thereon, that cause the one or more processors to:

receive, in response to a request to generate an output using a set of AI models, a plurality of session-specific data elements including prior interaction data, system environment parameters, and computational context values;

determine a first subset of constraints and a second subset of constraints for routing the request to an AI model of the set of AI models, the first subset of constraints comprising privacy and data handling protocols and the second subset of constraints comprising processing latency thresholds, model response requirements, and resource allocation limitations;

update weights, using the plurality of session-specific data elements, for a multi-variable optimization;

execute the multi-variable optimization, using the updated weights, across a plurality of candidate AI models of the set of AI models, wherein each of the plurality of candidate AI models satisfies the first subset of constraints and optimizes the second subset of constraints;

select, based on the multi-variable optimization, at least one candidate AI model for the request;

route the request to the at least one candidate AI model to cause the at least one candidate AI model to generate the output for the request;

in response to receiving system performance feedback relating to at least one constraint in the second subset, automatically select a different AI model from among the plurality of candidate AI models to improve the at least one constraint, wherein each constraint in the second subset has a different respective performance metric and a different respective threshold, and wherein the system performance feedback indicates that a performance metric for the at least one constraint has deviated beyond a respective threshold for the at least one constraint.

15 . The system of claim 14 , wherein the instructions further cause the one or more processors to, in response to receiving system performance feedback relating to at least one constraint in the second subset, automatically select a different AI model from among the plurality of candidate AI models to improve the at least one constraint.

16 . The system of claim 15 , wherein the instructions for automatically selecting a different AI model further cause the one or more processors to:

retrieve an updated plurality of session-specific data elements;

dynamically update the weights, using the updated plurality of session-specific data elements, for the multi-variable optimization;

increase a weight associated with an objective within the multi-variable optimization corresponding to the at least one constraint in the second subset;

re-execute the multi-variable optimization using the increased weight and the updated plurality of session-specific data elements to generate an updated candidate set of AI models; and

select, as the different AI model, a candidate AI model from the plurality of candidate AI models that provides improved performance for the at least one constraint of the second subset and satisfies the first subset of constraints.

17 . The system of claim 14 , wherein the instructions for dynamically updating the weights for the multi-variable optimization further cause the one or more processors to:

monitor the prior interaction data, the system environment parameters, and the computational context values for the request;

determine revised weights for the multi-variable optimization based on changes in the prior interaction data, the system environment parameters, or the computational context values for the request; and

apply the revised weights in performing the multi-variable optimization to adjust a relative importance of each objective associated with the second subset of constraints.

18 . The system of claim 14 , wherein the instructions for selecting, based on the multi-variable optimization, the at least one candidate AI model to process the request further cause the one or more processors to:

compare, for each of the plurality of candidate AI models that satisfy the first subset of constraints, results of the multi-variable optimization with the updated weights; and

select the at least one candidate AI model that most closely satisfies the second subset of constraints in accordance with the updated weights.

19 . The system of claim 14 , wherein the instructions for receiving the plurality of session-specific data elements further cause the one or more processors, prior to executing the multi-variable optimization, to filter the plurality of session-specific data elements to exclude data elements that do not satisfy the privacy and data handling protocols of the first subset of constraints, such that only compliant session-specific data elements are used for dynamically updating the weights for the multi-variable optimization.

20 . The system of claim 14 , wherein the instructions further cause the one or more processors, prior to routing the request to the at least one candidate AI model, to:

determine a context complexity score derived from the plurality of session-specific data elements; and

apply a complexity threshold for selecting the at least one candidate AI model based on the context complexity score.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 3, 2026
From: BHAT, GANESH PRASAD; WANG, ZHEYU; JIN, HAOLIN; DEB, SOURABH; ENGELBRECHT, JASON RYAN; JAIN, PAYAL; MAONAH, TARIQ HUSAYN; SATERNUS, MARIUSZ; RATH, BIRAJ KRUSHNA; MURRAY, STUART; DAVIES, PHILIP; LEWANDOWSKI, DANIEL; MYERS, JAMES
To: CITIBANK, N.A.
Reel/Frame 074274/0257 →
Continuity (5)
Continuation In Part 18812913 · Aug 22, 2024
Continuation In Part 18661532 · May 10, 2024
Continuation In Part 18661519 · May 10, 2024
Continuation In Part 18633293 · Apr 11, 2024
Related Publication 20250371433A1 · Dec 4, 2025
References Cited (308)
US 5423041A · Burke et al. · 1995 [cited by applicant]
US 5586218A · Allen · 1996 [cited by applicant]
US 5671361A · Brown et al. · 1997 [cited by applicant]
US 6169981B1 · Werbos · 2001 [cited by applicant]
US 6208720B1 · Curtis et al. · 2001 [cited by applicant]
US 6473748B1 · Archer · 2002 [cited by applicant]
US 6546545B1 · Honarvar et al. · 2003 [cited by applicant]
US 6587846B1 · Lamuth · 2003 [cited by applicant]
US 7313552B2 · Lorenz et al. · 2007 [cited by applicant]
US 7669133B2 · Chikirivao et al. · 2010 [cited by applicant]
US 7822621B1 · Chappel · 2010 [cited by applicant]
US 7984513B1 · Kyne et al. · 2011 [cited by applicant]
US 8380817B2 · Okada · 2013 [cited by applicant]
US 8387020B1 · Maclachlan et al. · 2013 [cited by applicant]
US 8572552B2 · Kennaley · 2013 [cited by applicant]
US 8656343B2 · Fox et al. · 2014 [cited by applicant]
US 8930298B2 · Demuth et al. · 2015 [cited by applicant]
US 9020872B2 · Junker · 2015 [cited by applicant]
US 9215212B2 · Reddy et al. · 2015 [cited by applicant]
US 9251466B2 · Rajesh · 2016 [cited by applicant]
US 9842045B2 · Heorhiadi et al. · 2017 [cited by applicant]
US 9858828B1 · Fuka · 2018 [cited by applicant]
US 10157355B2 · Johnson et al. · 2018 [cited by applicant]
US 10276170B2 · Gruber et al. · 2019 [cited by applicant]
US 10438212B1 · Jilani et al. · 2019 [cited by applicant]
US 10554738B1 · Ren · 2020 [cited by applicant]
US 10607141B2 · Jerram et al. · 2020 [cited by applicant]
US 10620988B2 · Lauderdale et al. · 2020 [cited by applicant]
US 10755103B2 · Chang et al. · 2020 [cited by applicant]
US 10764150B1 · Hermoni et al. · 2020 [cited by applicant]
US 10943067B1 · Brown et al. · 2021 [cited by applicant]
US 10949337B1 · Yalla et al. · 2021 [cited by applicant]
US 10951485B1 · Hermoni et al. · 2021 [cited by applicant]
US 11042647B1 · Joyce et al. · 2021 [cited by applicant]
US 11074107B1 · Nandakumar · 2021 [cited by applicant]
US 11106801B1 · Levine et al. · 2021 [cited by applicant]
US 11133942B1 · Griffin · 2021 [cited by applicant]
US 11153177B1 · Hermoni et al. · 2021 [cited by applicant]
US 11164078B2 · Jin et al. · 2021 [cited by applicant]
US 11227047B1 · Vashisht et al. · 2022 [cited by applicant]
US 11227187B1 · Weinberger · 2022 [cited by applicant]
US 11271822B1 · Hermoni et al. · 2022 [cited by applicant]
US 11315196B1 · Narayan et al. · 2022 [cited by applicant]
US 11328068B1 · Niedzwiedz et al. · 2022 [cited by applicant]
US 11410136B2 · Cook et al. · 2022 [cited by applicant]
US 11436777B1 · Karli et al. · 2022 [cited by applicant]
US 11470106B1 · Lin et al. · 2022 [cited by applicant]
US 11481553B1 · Durvasula et al. · 2022 [cited by applicant]
US 11503075B1 · Sirianni et al. · 2022 [cited by applicant]
US 11516158B1 · Luzhnica et al. · 2022 [cited by applicant]
US 11516222B1 · Srinivasan et al. · 2022 [cited by applicant]
US 11531943B1 · Kumar · 2022 [cited by applicant]
US 11562078B2 · Sabourin et al. · 2023 [cited by applicant]
US 11573848B2 · Linck et al. · 2023 [cited by applicant]
US 11586436B1 · Jennings · 2023 [cited by applicant]
US 11593390B2 · Sundel · 2023 [cited by applicant]
US 11652839B1 · Aloisio et al. · 2023 [cited by applicant]
US 11656852B2 · Mazurskiy · 2023 [cited by applicant]
US 11663409B2 · Terry et al. · 2023 [cited by applicant]
US 11663662B2 · Chen et al. · 2023 [cited by applicant]
US 11676685B2 · Jaganathan et al. · 2023 [cited by applicant]
US 11681610B2 · Chang et al. · 2023 [cited by applicant]
US 11681811B1 · Dixit · 2023 [cited by applicant]
US 11683333B1 · Dominessy et al. · 2023 [cited by applicant]
US 11706241B1 · Cross et al. · 2023 [cited by applicant]
US 11709757B1 · Kurian et al. · 2023 [cited by applicant]
US 11720686B1 · Cross et al. · 2023 [cited by applicant]
US 11734418B1 · Epstein · 2023 [cited by applicant]
US 11734591B2 · Turner et al. · 2023 [cited by applicant]
US 11741226B2 · Dixit · 2023 [cited by applicant]
US 11750717B2 · Walsh et al. · 2023 [cited by applicant]
US 11765100B1 · Sloane et al. · 2023 [cited by applicant]
US 11803792B2 · Makhija et al. · 2023 [cited by applicant]
US 11811730B1 · Kandasamy et al. · 2023 [cited by applicant]
US 11823108B1 · Bradbury et al. · 2023 [cited by applicant]
US 11842408B1 · Martinez et al. · 2023 [cited by applicant]
US 11853735B1 · Choudhury et al. · 2023 [cited by applicant]
US 11874934B1 · Rao et al. · 2024 [cited by applicant]
US 11875123B1 · Ben David et al. · 2024 [cited by applicant]
US 11875130B1 · Bosnjakovic et al. · 2024 [cited by applicant]
US 11915152B2 · Baker · 2024 [cited by applicant]
US 11924027B1 · Mysore et al. · 2024 [cited by applicant]
US 11947435B2 · Boulineau et al. · 2024 [cited by applicant]
US 11960515B1 · Pallakonda et al. · 2024 [cited by applicant]
US 11983806B1 · Ramesh et al. · 2024 [cited by applicant]
US 11990139B1 · Sandrew · 2024 [cited by applicant]
US 11995412B1 · Mishra · 2024 [cited by applicant]
US 12001463B1 · Pallakonda et al. · 2024 [cited by applicant]
US 12007963B1 · Rajagopalan et al. · 2024 [cited by applicant]
US 12026599B1 · Lewis et al. · 2024 [cited by applicant]
US 12028368B1 · Cohen et al. · 2024 [cited by applicant]
US 12088611B1 · Lin et al. · 2024 [cited by applicant]
US 12094010B1 · Hampapur et al. · 2024 [cited by applicant]
US 12106205B1 · Jain et al. · 2024 [cited by applicant]
US 12111747B1 · Jain et al. · 2024 [cited by applicant]
US 12131819B1 · Murray et al. · 2024 [cited by applicant]
US 12135949B1 · Cameron et al. · 2024 [cited by applicant]
US 12147513B1 · Jain et al. · 2024 [cited by applicant]
US 12149553B1 · Fly et al. · 2024 [cited by applicant]
US 12149558B1 · Brown et al. · 2024 [cited by applicant]
US 12155781B1 · Helfgott et al. · 2024 [cited by applicant]
US 12182258B2 · Stokes et al. · 2024 [cited by applicant]
US 12236193B1 · Kuperman · 2025 [cited by examiner]
US 12321862B1 · Levin · 2025 [cited by examiner]
US 20030007178A1 · Jeyachandran et al. · 2003 [cited by applicant]
US 20040098454A1 · Trapp et al. · 2004 [cited by applicant]
US 20050204348A1 · Horning et al. · 2005 [cited by applicant]
US 20060095918A1 · Hirose · 2006 [cited by applicant]
US 20070067848A1 · Gustave et al. · 2007 [cited by applicant]
US 20100275263A1 · Bennett et al. · 2010 [cited by applicant]
US 20100313189A1 · Beretta et al. · 2010 [cited by applicant]
US 20140137257A1 · Martinez et al. · 2014 [cited by applicant]
US 20140258998A1 · Adl-tabatabai et al. · 2014 [cited by applicant]
US 20170061132A1 · Hovor et al. · 2017 [cited by applicant]
US 20170262164A1 · Jain et al. · 2017 [cited by applicant]
US 20170279826A1 · Mohanty et al. · 2017 [cited by applicant]
US 20170295197A1 · Parimi et al. · 2017 [cited by applicant]
US 20180020021A1 · Gilmore et al. · 2018 [cited by applicant]
US 20180239903A1 · Bodin et al. · 2018 [cited by applicant]
US 20180343114A1 · Ben-Ari · 2018 [cited by applicant]
US 20190188706A1 · Mccurtis · 2019 [cited by applicant]
US 20190236661A1 · Hogg et al. · 2019 [cited by applicant]
US 20190286816A1 · Fu · 2019 [cited by applicant]
US 20200012493A1 · Sagy · 2020 [cited by applicant]
US 20200043164A1 · Fuchs et al. · 2020 [cited by applicant]
US 20200074470A1 · Deshpande et al. · 2020 [cited by applicant]
US 20200133711A1 · Webster et al. · 2020 [cited by applicant]
US 20200153855A1 · Kirti et al. · 2020 [cited by applicant]
US 20200219009A1 · Dao et al. · 2020 [cited by applicant]
US 20200233979A1 · Tahmasebi Maraghoosh et al. · 2020 [cited by applicant]
US 20200259852A1 · Wolff et al. · 2020 [cited by applicant]
US 20200309767A1 · Loo et al. · 2020 [cited by applicant]
US 20200314191A1 · Madhavan et al. · 2020 [cited by applicant]
US 20200334326A1 · Zhang et al. · 2020 [cited by applicant]
US 20200349054A1 · Dai et al. · 2020 [cited by applicant]
US 20200380118A1 · Miller et al. · 2020 [cited by applicant]
US 20200387608A1 · Miller et al. · 2020 [cited by applicant]
US 20210012486A1 · Huang et al. · 2021 [cited by applicant]
US 20210049288A1 · Li · 2021 [cited by applicant]
US 20210089941A1 · Chen et al. · 2021 [cited by applicant]
US 20210133182A1 · Anderson et al. · 2021 [cited by applicant]
US 20210173935A1 · Ramasamy et al. · 2021 [cited by applicant]
US 20210185094A1 · Waplington et al. · 2021 [cited by applicant]
US 20210211431A1 · Albero et al. · 2021 [cited by applicant]
US 20210256125A1 · Miller et al. · 2021 [cited by applicant]
US 20210264547A1 · Li · 2021 [cited by applicant]
US 20210273957A1 · Boyer et al. · 2021 [cited by applicant]
US 20210390465A1 · Werder et al. · 2021 [cited by applicant]
US 20220050928A1 · Shukla et al. · 2022 [cited by applicant]
US 20220114251A1 · Guim Bernat et al. · 2022 [cited by applicant]
US 20220114399A1 · Castiglione et al. · 2022 [cited by applicant]
US 20220147636A1 · Mahuli et al. · 2022 [cited by applicant]
US 20220179906A1 · Desai et al. · 2022 [cited by applicant]
US 20220198304A1 · Szczepanik et al. · 2022 [cited by applicant]
US 20220263843A1 · Aslam et al. · 2022 [cited by applicant]
US 20220263855A1 · Engelberg et al. · 2022 [cited by applicant]
US 20220263860A1 · Crabtree et al. · 2022 [cited by applicant]
US 20220278889A1 · Malleshaiah et al. · 2022 [cited by applicant]
US 20220286438A1 · Burke et al. · 2022 [cited by applicant]
US 20220286474A1 · Kuppa et al. · 2022 [cited by applicant]
US 20220294789A1 · Tikhomirov et al. · 2022 [cited by applicant]
US 20220294810A1 · Tyagi et al. · 2022 [cited by applicant]
US 20220303300A1 · Egan · 2022 [cited by applicant]
US 20220303302A1 · Hwang et al. · 2022 [cited by applicant]
US 20220303352A1 · Herzog et al. · 2022 [cited by applicant]
US 20220311681A1 · Palladino et al. · 2022 [cited by applicant]
US 20220318654A1 · Lin et al. · 2022 [cited by applicant]
US 20220327620A1 · Ndoutoumou · 2022 [cited by applicant]
US 20220334818A1 · Mcfarland · 2022 [cited by applicant]
US 20220342846A1 · Kunchakarra et al. · 2022 [cited by applicant]
US 20220345457A1 · Jeffords et al. · 2022 [cited by applicant]
US 20220358023A1 · Moser et al. · 2022 [cited by applicant]
US 20220366140A1 · Saito et al. · 2022 [cited by applicant]
US 20220368728A1 · Murray et al. · 2022 [cited by applicant]
US 20220377093A1 · Crabtree et al. · 2022 [cited by applicant]
US 20220398149A1 · Mcfarland et al. · 2022 [cited by applicant]
US 20220400135A1 · Gamra · 2022 [cited by applicant]
US 20220414213A1 · Dixit · 2022 [cited by applicant]
US 20220414536A1 · M L et al. · 2022 [cited by applicant]
US 20220417274A1 · Madanahalli et al. · 2022 [cited by applicant]
US 20230007039A1 · Waplington · 2023 [cited by applicant]
US 20230009999A1 · Higuchi et al. · 2023 [cited by applicant]
US 20230019072A1 · Okunlola · 2023 [cited by applicant]
US 20230032686A1 · Williams et al. · 2023 [cited by applicant]
US 20230033317A1 · Lin et al. · 2023 [cited by applicant]
US 20230035321A1 · Vijayaraghavan · 2023 [cited by applicant]
US 20230039855A1 · Greene · 2023 [cited by applicant]
US 20230044102A1 · Anderson et al. · 2023 [cited by applicant]
US 20230052608A1 · Wattiau et al. · 2023 [cited by applicant]
US 20230067128A1 · Engelberg et al. · 2023 [cited by applicant]
US 20230071264A1 · Hakala et al. · 2023 [cited by applicant]
US 20230076372A1 · Engelberg et al. · 2023 [cited by applicant]
US 20230077527A1 · Sarkar · 2023 [cited by applicant]
US 20230109021A1 · Curtin et al. · 2023 [cited by applicant]
US 20230113621A1 · Griffin et al. · 2023 [cited by applicant]
US 20230114719A1 · Thomas et al. · 2023 [cited by applicant]
US 20230117962A1 · Kaimal et al. · 2023 [cited by applicant]
US 20230118388A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230123314A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230132703A1 · Marsenic et al. · 2023 [cited by applicant]
US 20230135660A1 · Chapman et al. · 2023 [cited by applicant]
US 20230148116A1 · Stokes et al. · 2023 [cited by applicant]
US 20230164158A1 · Fellows et al. · 2023 [cited by applicant]
US 20230169397A1 · Smith et al. · 2023 [cited by applicant]
US 20230171282A1 · Bollinger · 2023 [cited by applicant]
US 20230177441A1 · Durvasula et al. · 2023 [cited by applicant]
US 20230177613A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230186175A1 · Usatov et al. · 2023 [cited by applicant]
US 20230205888A1 · Tyagi et al. · 2023 [cited by applicant]
US 20230205891A1 · Yellapragada et al. · 2023 [cited by applicant]
US 20230208869A1 · Bisht et al. · 2023 [cited by applicant]
US 20230208870A1 · Yellapragada et al. · 2023 [cited by applicant]
US 20230208871A1 · Yellapragada et al. · 2023 [cited by applicant]
US 20230229542A1 · Watkins et al. · 2023 [cited by applicant]
US 20230252393A1 · Orzechowski et al. · 2023 [cited by applicant]
US 20230259860A1 · Sarkar · 2023 [cited by applicant]
US 20230269272A1 · Dambrot et al. · 2023 [cited by applicant]
US 20230274003A1 · Liu et al. · 2023 [cited by applicant]
US 20230359789A1 · Andre et al. · 2023 [cited by applicant]
US 20230362200A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230396641A1 · Hebbagodi et al. · 2023 [cited by applicant]
US 20230412635A1 · Binyamini et al. · 2023 [cited by applicant]
US 20240012734A1 · Lee et al. · 2024 [cited by applicant]
US 20240020538A1 · Socher et al. · 2024 [cited by applicant]
US 20240054233A1 · Ohayon et al. · 2024 [cited by applicant]
US 20240054249A1 · Loubet Moundi et al. · 2024 [cited by applicant]
US 20240095077A1 · Singh et al. · 2024 [cited by applicant]
US 20240129345A1 · Kassam et al. · 2024 [cited by applicant]
US 20240202442A1 · Saito et al. · 2024 [cited by applicant]
US 20240256678A1 · Thompson · 2024 [cited by applicant]
US 20240364749A1 · Crabtree et al. · 2024 [cited by applicant]
US 20240403428A1 · Lal et al. · 2024 [cited by applicant]
US 20240403437A1 · Szigeti et al. · 2024 [cited by applicant]
US 20240403445A1 · Straub et al. · 2024 [cited by applicant]
US 20240406145A1 · Crabtree et al. · 2024 [cited by applicant]
US 20240411896A1 · Myers et al. · 2024 [cited by applicant]
US 20240414211A1 · Boyer et al. · 2024 [cited by applicant]
US 20240427994A1 · Odland · 2024 [cited by examiner]
US 20250265504A1 · Upadhyay · 2025 [cited by examiner]
US 20250362963A1 · Poothiyot · 2025 [cited by examiner]
CN 106502890A · 2017 [cited by applicant]
WO 2021160499A1 · 2021 [cited by applicant]
WO 2022125803A1 · 2022 [cited by applicant]
WO 2024020416A1 · 2024 [cited by applicant]
Liu, Y. et al., “OptLLM: optimal assignment of queries to large language models,” downloaded from <arxiv.org/abs/2405.15130> (May 24, 2024) 11 pp. (Year: 2024). [cited by examiner]
Sun, J. et al., “Interval multiobjective optimization with memetic algorithms,” IEEE Trans. on Cybernetics, vol. 50, No. 8 (Aug. 2020) pp. 3444-3457. (Year: 2020). [cited by examiner]
Emmerich, M. et al., “Multicriteria optimization and decision making: principles, algorithms, and case studies,” downloaded from <arxiv.org/abs/2407.00359> (Apr. 21, 2025) 129 pp. (Year: 2025). [cited by examiner]
AI Risk Management Framework NIST, retrieved on Jun. 17, 2024, https://www.nist.gov/itl/ai-risk-management-framework. [cited by applicant]
Empower Your Team with a Compliance Co-Pilot, Sedric, retrieved on Sep. 25, 2024. https://www.sedric.ai/. [cited by applicant]
Independent analysis of AI language models and API providers. Artificial Analysis, retrieved on Jun. 13, 2024, https://artificialanalysis.ai/, 11 pages. [cited by applicant]
What is AI Verify?, AI Verify Foundation, Jun. 11, 2024, 3 pages, https://aiverifyfoundation.sg/. [cited by applicant]
Agarwal et al., How generative AI can help banks manage risk and compliance, Mckinsey & Company, Mar. 2024; Total pp. 8 (Year: 2024). [cited by applicant]
Behravesh et al., “Rule Modeling Engine for Optimizing Complex Event Processing Patterns”, IEEE, pp. 128-135 (Year: 2009). [cited by applicant]
Brown, D., et al., “The Great AI Challenge: We Test Five Top Bots on Useful, Everyday Skills,” The Wall Street Journal, published May 25, 2024. [cited by applicant]
Burnashev et al., “Design and Implementation of Integrated Development Environment for Building Rule-Based Expert Systems”, IEEE, pp. 1-4 (Year: 2020). [cited by applicant]
Cranium, Adopt & Accelerate AI Safely, retrieved on Nov. 7, 2024, from https://cranium.ai/. [cited by applicant]
Cuadrado et al., “An Autonomous Engine for Services Configuration and Deployment”, IEEE, pp. 520-536 (Year: 2012). [cited by applicant]
Dong, Y., et al., “Building Guardrails for Large Language Models,” https://ar5iv.labs.arxiv.org/html/2402.01822v1, published May 29, 2024, 20 pages. [cited by applicant]
Fickas, “Design Issues in a Rule-Based System”, ACM, pp. 208-215 (Year: 1985). [cited by applicant]
Futurism, “Sam Altman Admits That OpenAI Doesn't Actually Understand How Its AI Works”, Jun. 11, 2024, 4 pages, https://futurism.com/sam-altman-admits-openai-understand-ai. [cited by applicant]
Ge et al., “Automatic Generation of Rule-based Software Configuration Management Systems”, ACM, pp. 659 (Year: 2005). [cited by applicant]
Geiger, et al., “TadGAN: Time series anomaly detection using generative adversarial networks”, 2020 IEEE International Conference on Big Data, 2020 (Year: 2020). [cited by applicant]
Generative machine learning models; IPCCOM000272835D, Aug. 17, 2023. (Year: 2023). [cited by applicant]
Genesis et al.“CI Ref: A Tool for Visualizing the Historical Data of Software Refactorings in Java Projects”, ACM, pp. 174-179 (Year: 2023). [cited by applicant]
Guana et al., “Backward Propagation of Code Refinements on Transformational Code Generation Environments”, IEEE, pp. 55-60 (Year: 2013). [cited by applicant]
Guldimann, P., et al. “COMPL-AI Framework: A Technical Interpretation and LLM Benchmarking Suite for the EU Artificial Intelligence Act,” arXiv:2410.07959v1 [cs.CL] Oct. 10, 2024, 38 pages. [cited by applicant]
Halvonik et al., “Large Language Models and Rule-Based Approaches in Domain-Specific Communication”, IEEE, pp. 107046-107058 (Year: 2024). [cited by applicant]
Huang et al., “AI Coding: Learning to Construct Error Correction Codes”, IEEE, pp. 26-39 (Year: 2020). [cited by applicant]
International Search Report and Written Opinion received in Application No. PCT/US25/24406, dated Jul. 18, 2025, 10 pages. [cited by applicant]
International Search Report and Written Opinion Received received in Application No. PCT/US23/85942, dated Feb. 15, 2024, 6 pages. [cited by applicant]
Jiang et al., “Self-Planning Code Generation with Large Language Models”, ACM, pp. 1-30 (Year: 2024). [cited by applicant]
Kibria et al., “Big Data Analytics, Machine Learning, andArtificial Intelligence in Next-Generation Wireless Networks”, IEEE, pp. 32328-32338 (Year: 2018). [cited by applicant]
Kojima, Takeshi, et al. “Large Language Models are Zero-Shot Reasoners,” 36th Conference on Neural Information Processing Systems (NeurIPS 2022), arXiv:2205.11916 [cs.CL], Jan. 29, 2023, 42 pages. [cited by applicant]
Kumar et al., “A Rule-based Recommendation System for Selection of Software Development Life Cycle Models”, ACM, pp. 1-6 ( Year: 2013). [cited by applicant]
Langley et al., “Applications of Machine Learning and Rule Induction”, ACM, pp. 54-64 (Year: 1995). [cited by applicant]
Idrizi “Exploring the Role of Explainable Artificial Intelligence(XAI) in Adaptive learning systems”, ACM, pp. 100-105 (Year: 2024). [cited by applicant]
Li, et al., “Anomaly detection with generative adversarial networks for multivariate time series” arXiv: 1809.04758V3 [cs.LG] Jan. 15, 2019. [cited by applicant]
Mathews, A. W., “What AI Can Do in Healthcare—and What It Should Never Do,” The Wall Street Journal, published on Aug. 21, 2024, retrieved on Sep. 5, 2024 https://www.wsj.com. [cited by applicant]
Mavrepis, P., et al., “XAI for All: Can Large Language Models Simplify Explainable AI?,” https://arxiv.org/abs/2401.13110, Jan. 23, 2024, 10 pages. [cited by applicant]
Mezini, Programming and Execution Models for Next Generation Code Intelligence Systems (Keynote), ACM, pp. 1-2 (Year: 2021). [cited by applicant]
Mollick, E., “Latent Expertise: Everyone is in R&D,” One Useful Thing, published on Jun. 20, 2024, https://www.oneusefulthing.org/p/latent-expertise-everyone-is-in-r. [cited by applicant]
Nauta, M., et al., “From Anecdotal Evidence to Quantative Evaluation Methods: A Systematic Review of Evaluating Explainable AI” ACM Computing Surveys, vol. 55 No. 13s Article 295, 2023 [retrieved Jun. 3, 2024]. [cited by applicant]
Peers, M., “What California AI Bill Could Mean,” The Briefing, published and retrieved Aug. 30, 2024, 8 pages, https://www.theinformation.com/articles/what-california-ai-bill-could-mean. [cited by applicant]
Rattanasawad et al., “A Review and Comparison of Rule Languages and Rule-based Inference Engines for the Semantic Web”, IEEE, pp. 1-6 (Year: 2013). [cited by applicant]
Schlegl, et al., “f-AnoGAN: Fast unsupervised anomaly detection with generative adversarial networks”, Medical Image Analysis 54 (2019) 30-44, 2019. [cited by applicant]
Soares et al., “Explaining Deep Learning Models Through Rule-Based Approximation and Visualization”, IEEE, pp. 2399-2407 (Year: 2021). [cited by applicant]
Sottara et al., “Enhancing A Production Rule Engine with Predictive Models Using PMML”, ACM, pp. 39-47 (Year: 2011). [cited by applicant]
Sumuk Shashidhar et al., ‘Democratizing LLMs: An Exploration of Cost-Performance Trade-offs in Self-Refined Open-Source Models’, arXiv:2310.07611v2, pp. 1-15, Oct. 2023. [cited by applicant]
Sun et al., “Efficient Rule Engine for Smart Building Systems”, IEEE, pp. 1658-1669 (Year: 2015). [cited by applicant]
Vartak et al.“MODELDB: A System for Machine Learning Model Management”, ACM, pp. 1-3 (Year: 2016). [cited by applicant]
Vereschak et al., “Trust in AI-assisted Decision Making: Perspectives from Those Behind the System and Those for Whom the Decision is Made”, ACM, pp. 1-14 (Year: 2024). [cited by applicant]
Verma et al., “Integration of Rule based and Case based Reasoning System to Support Decision Making”, IEEE, pp. 106-108 (Year: 2014). [cited by applicant]
Wang et al., “Design and realization of distributed Rule Engine for scene linkage of Internet of Things”, IEEE, pp. 396-401 (Year: 2024). [cited by applicant]
Wei, Jason, et al. “Chain-of-Thought Prompting Elicits Reasoning in Large Language Models,” 36th Conference on Neural Information Processing Systems (NeurIPS 2022), arXiv:2201.11903 [cs.CL], Jan. 10, 2023, 43 pages. [cited by applicant]
Yang Liu et al., ‘Trustworthy LLMS: a Survey and Guideline for Evaluating Large Language Models’ Alignment , arXiv:2308.05374v2, pp. 1-81, Mar. 2024. [cited by applicant]
Zhang et al., “Developing A Rule Engine for Automated Feature Recognition from CAD Models”, IEEE, pp. 3925-3930 (Year: 2009). [cited by applicant]
Zhao, H., et al., “Explainability for Large Language Models: A Survey,” https://arxiv.org/abs/2309.01029, Nov. 28, 2024, 38 pages. [cited by applicant]
Zhou, Y., Liu, Y., Li, X., Jin, J., Qian, H., Liu, Z., Li, C., Dou, Z., Ho, T., & Yu, P. S. (2024). Trustworthiness in Retrieval-Augmented Generation Systems: A Survey. ArXiv./abs/2409.10102. [cited by applicant]
“Singapore launches Project Moonshot”, a generative Artificial Intelligence testing toolkit to address LLM safety and security challenges, https://www.imda.gov.sg/resources/press-releases-factsheets-and-speeches/press-r… [cited by applicant]
Aggarwal, Nitin , KPIs for gen AI: Why measuring your new AI is essential to its success, https://cloud.google.com/transform/kpis-for-gen-ai-why-measuring-your-new-ai-is-essential-to-its-success. [cited by applicant]
ANTHROP/C , Mapping the Mind of a Large Language Model, https://www.anthropic.com/research/mapping-mind-language-model, May 21, 2024. [cited by applicant]
Claburn, Thomas , OpenAI's GPT-4 can exploit real vulnerabilities by reading security advisories, The Register, https://www.theregister.com/2024/04/17/gpt4_can_exploit_real_vulnerabilities/?utm_source=tld rai, Apr. 17, … [cited by applicant]
Marshall, Andrew , Threat Modeling AI/ML Systems and Dependencies, Nov. 2, 2022, 27 pages. [cited by applicant]
Roose, Kevin , “A.I. Has a Measurement Problem”, The New York Times, Apr. 15, 2024, 5 pages. [cited by applicant]
Roose, Kevin , “A.I.'s Black Boxes Just Got a Little Less Mysterious”, The New York Times, May 21, 2024, 5 pages. [cited by applicant]
Shah, Harshay , Decomposing and Editing Predictions by Modeling Model Computation, arXiv:2404.11534v1 [cs.LG] Apr. 17, 2024. [cited by applicant]
Shankar, Ram , “Failure Modes in Machine Learning”, Nov. 2019, 14 pages. [cited by applicant]
Hu, Q., J., et al., “ROUTERBENCH: A Benchmark for Multi-LLM Routing System,” arXiv:2403.12031v2 [cs.LG] Mar. 28, 2024, 16 pages. [cited by applicant]