IP Library Granted Patent US 12,210,849
Granted Patent B1
US 12,210,849 · App. 18/623,959 · Granted Jan 28, 2025

Method for AI language self-improvement agent using language modeling and tree search techniques

Inventor: Kino High Coursey (Colleyville, TX)
G06F40/58G06F16/90335G06F40/284G06F40/35
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,210,849
App. No.
18/623,959
Granted
Jan 28, 2025
Kind
B1
Abstract

A novel method provides an AI language virtual agent having self-improvement features and which uses language modeling and tree search techniques. The AI language virtual agent exchanges textual discussion with users and other simulated agents. The method includes receiving a current situational description depicting natural language user input, temperament qualities and textual tendencies of the virtual agent, and indicia regarding subject matter context of a present conversation. The indicia regarding subject matter context include textual logs from recent conversational exchanges. The current situational description includes audio, visual, and tactile inputs collected proximate to the virtual agent. The method preferably utilizes an MCTS tree search in combination with self-moving modules, one or more language models, tree search techniques outputting textual responses to the current situation description, and the virtual agent responding with textual expression to verbal input in combination with the audio, visual, tactile, and other sensory inputs.

Claims (79)

1. An Artificial Intelligence (AI) language virtual agent having self-improvement features which incorporate language modeling and tree search, the virtual agent comprising:

a data processing system having program instructions implementing the virtual agent;

the implemented virtual agent accepting as input a current situational description that includes natural language input received from an external agent, properties regarding the qualities of the virtual agent, and indicia regarding subject matter context of a present conversation;

wherein the qualities of the virtual agent include temperament and textual tendencies;

wherein the indicia regarding subject matter context includes textual logs from recent conversational exchanges;

wherein the current situational description includes audio, visual, and tactile inputs from the external agent which are collected proximate to the virtual agent;

wherein the virtual agent employs reinforcement learning;

a database of one or more language models, conversation logs storing text from prior textual exchanges, and reference conversations for training;

a combination of self-play engines that train on the language models with self-play and external interaction engines for communicating with external agents; and

a combination of self-moving modules that advance the method of the external agent communicating with the virtual agent via a combination of textual exchanges and one or more audio, visual, and tactile inputs into the virtual agent; and

wherein the virtual agent utilizing tree search techniques in combination with the one or more language models for outputting optimized responses to the current situation description, and wherein the virtual agent responds with self-optimized textual expression to verbal input in combination with the audio, visual, tactile, and other sensory inputs.

2. The AI language virtual agent according to claim 1 , wherein the virtual agent is further configured to:

select an optimal response to a current situation description with respect to immediate and non-immediate goals and outcomes by using one or more language models to form the optimal response search process;

wherein the language models are used to anticipate future outcomes and future responses;

wherein the language models are also used to evaluate the desirability of projected future outcomes;

convert the language models evaluation into a format suitable to guide tree search methods; and

wherein information regarding the desired goals or outcomes may be included in the current situational description.

3. The AI language virtual agent according to claim 1 , further comprising a feedback mechanism that allows the external agent to rate and review the performance of the responses.

4. The AI language virtual agent according to claim 1 , further comprising a dedicated emotion recognition module using multimodal emotion recognition.

5. The AI language virtual agent according to claim 1 , further comprising a module for understanding visual and auditory metaphors, sarcasms, and idiomatic expressions.

6. The AI language virtual agent according to claim 1 , wherein the virtual agent is further configured to:

utilize one or more language models to generate evaluative statements or annotations on the desirability of a situational description;

translate symbolic evaluative statements into numeric or vector format suitable for use in common state space search systems;

select an initial action from an initial set based on the outcome of the complete search process;

perform an action or set of actions based on the initial action selected;

record the system and environmental interactions to one or more logs;

provide for the continuing training of the language models used by the virtual agent using reference material and direct experience; and

provide self-improvement of the entire process through iterative retraining of the language models, and through use of self-play to explore the space of novel possible situations and to discover paths towards positive resolutions in those situations.

7. The AI virtual agent according to claim 1 , further comprising a learning module for understanding and utilizing emerging online languages, lingoes, and slangs that evolve continuously.

8. An Artificial Intelligence (AI) language virtual agent having self-improvement features which incorporate language modeling and tree search techniques, the AI language virtual agent comprising:

a data processing system having program instructions implementing the AI language virtual agent;

sensory inputs having one or more audio, visual, and tactile receptors located proximate to the virtual agent for collecting indicia of verbal and situational indexes, wherein said sensory inputs are connected to said data processing system for inputting the indicia of verbal and situational indexes;

said data processing system processing said indicia of verbal and situational indexes to define a current situational description;

said current situational description including natural language input, qualities of the virtual agent, and indicia regarding subject matter context of a present conversation, wherein said qualities of the virtual agent include temperament and textual tendencies, and the indicia regarding subject matter context includes textual logs from recent conversational exchanges;

wherein the virtual agent employs reinforcement learning;

a database adapted for access by said data processing system and having one or more language models, conversation logs storing text from prior textual exchanges, and reference conversations for training;

one or more self-play engines for training said one or more language models with self-play; and

wherein the AI virtual agent utilizes tree search techniques in combination with said one or more language models for outputting textual responses to the current situation description.

9. The AI language virtual agent according to claim 8 ,

wherein the virtual agent utilizes Monte Carlo Tree Search (MCTS) techniques in combination with the one or more language models for outputting textual responses to the current situation description;

wherein the virtual agent responds with textual expression to verbal input in combination with the audio, visual, tactile, and other sensory inputs after merging an analysis of basic sentiment analysis and goal-oriented analysis of the AI virtual agent; and

wherein the sentiment analysis is determined by the text being tokenized into a list of words and phrases, a sentiment value is assigned for each token in which a summation of the sentiment values are computed and then normalized as compared to an expected value to determine respective normalized scores, and then the respective normalized scores are compared to one or more indexes which are summed to provide discrete output values which provide a respective sentiment value for the text being analyzed;

wherein the virtual agent may engage with proof of work system.

10. The AI language virtual agent according to claim 8 , wherein the virtual agent is further configured to:

select an optimal response to a current situation description with respect to immediate and non-immediate goals or outcomes by using one or more language models to form the optimal response search process;

said virtual agent further comprising a contextual interface interchangeable with an external state simulator or server that maintains real-time tracking of global states, and wherein the interface accommodates natural language instructions or action mandates from the AI virtual agent and reciprocates with natural language descriptions of the current state.

11. The AI language virtual agent according to claim 10 , wherein the external state simulator or server provides comprehensive account keeping details in addition to producing numeric evaluations of the state, enhancing the agent's understanding of the surrounding environment.

12. The AI language virtual agent according to claim 8 , wherein the virtual agent incorporates LLM capable of producing executable code given a problem description, thereby providing a viable solution to the specified problem.

13. The AI language virtual agent according to claim 8 , wherein the LLM drives a dynamic state simulator by generating executable code that alters one state representation into another, demonstrating a broader state expansion and efficient leaf evaluation.

14. The AI language virtual agent according to claim 8 , wherein the virtual agent utilizes any available resources, planning, or computing capabilities by virtue of the code produced for state expansion and leaf evaluation to provide optimum responses.

15. The AI language virtual agent according to claim 8 , wherein the output generated through the dynamic state simulation driven by LLM-written code is translatable into natural language or various compatible embeddings for improved interaction with external agents.

16. An Artificial Intelligence (AI) language virtual agent having self-improvement features which incorporate language modeling and tree search techniques, the AI language virtual agent comprising:

a data processing system having program instructions implementing the AI language virtual agent;

sensory inputs having one or more audio, visual, and tactile receptors located proximate to the virtual agent for collecting indicia of verbal and situational indexes, wherein said sensory inputs are connected to said data processing system for inputting the indicia of verbal and situational indexes;

wherein said data processing system processing said indicia of verbal and situational indexes to define a current situational description;

said current situational description including natural language input, qualities of the virtual agent, and indicia regarding subject matter context of a present conversation, wherein said qualities of the virtual agent include temperament and textual tendencies, and the indicia regarding subject matter context includes textual logs from recent conversational exchanges;

a database adapted for access by said data processing system and having one or more language models, conversation logs storing text from prior textual exchanges, and reference conversations for training;

one or more self-play engines training said one or more language models with self-play; and

wherein the AI virtual agent utilizes Monte Carlo Tree Search (MCTS) techniques in combination with said one or more language models for outputting textual responses to the current situation description; and

wherein the AI language virtual agent employs the language models for latent space exploration and optimization by transforming verbal and situational indicia into a lower-dimensional or alternate representation that uncovers the underlying semantics, making the state search process more efficient and accurate.

17. The AI language virtual agent according to claim 16 , wherein the virtual agent is further configured to:

select an optimal response to a current situation description with respect to immediate and non-immediate goals and outcomes by using one or more language models to form the optimal response search process;

wherein the language models are used to anticipate future outcomes and future responses;

wherein the language models are also used to evaluate the desirability of projected future outcomes;

convert the language models evaluation into a format suitable to guide tree search methods;

wherein information regarding the desired goals or outcomes may be included in the current situational description;

wherein the virtual agent utilizes MCTS techniques in combination with the one or more language models for outputting textual responses to the current situation description;

wherein the virtual agent responds with textual expression to verbal input in combination with the audio, visual, tactile, and other sensory inputs after merging an analysis of basic sentiment analysis and goal oriented analysis of the AI virtual agent; and

wherein the sentiment analysis is determined by the text being tokenized into a list of words and phrases, a sentiment value is assigned for teach token in which a summation of the sentiment values are computed and then normalized as compared to an expected value to determine respective normalized scores, and then the respective normalized scores are compared to one or more indexes which are summed to provide discrete output values which provide a respective sentiment value for the text being analyzed; and

wherein the virtual agent employs a dedicated emotion recognition module using multimodal emotion recognition techniques for processing sensory inputs and improving sentiment analysis.

18. The AI language virtual agent according to claim 16 , wherein the virtual agent is further configured to:

construct the contextual descriptions to maximally represent the current situation while meeting any processing constraints of the language models used;

provide nodes of the states of the search space which contain contextual descriptions and search control information;

receive an initial starting contextual description and search control information; and

explore the state of possible future contexts by using one or more language models provided with sufficient information in the form of the contextual descriptions and prompts that cause the generation of new situation descriptions;

wherein a blockchain-based secure database may be utilized for storing and accessing the data for training and self-play in a secure, transparent and immutable manner.

19. The AI language virtual agent according to claim 16 , further comprising:

a contextual interface interchangeable with an external state simulator or server that maintains real-time tracking of global states, and wherein the interface accommodates natural language instructions or action mandates from the AI agent and reciprocates with natural language descriptions of the current state.

20. The AI language virtual agent according to claim 19 , wherein the external state simulator or server provides comprehensive account keeping details in addition to producing numeric evaluations of the state, enhancing the agent's understanding of the surrounding environment and its responses to the same.

Continuity (3)
Continuation In Part 18123110 · Mar 17, 2023
Continuation In Part 17093608 · Nov 9, 2020
Provisional Application 62931815 · Nov 7, 2019
References Cited (199)
US 7113848B2 · Hanson · 2006 [cited by applicant]
US 7809548B2 · Mihalcea et al. · 2010 [cited by applicant]
US 8346534B2 · Csomai et al. · 2013 [cited by applicant]
US 8818926B2 · Wallace · 2014 [cited by applicant]
US 9047423B2 · Tesauro et al. · 2015 [cited by applicant]
US 9141600B2 · Tromp · 2015 [cited by applicant]
US 9796095B1 · Hanson et al. · 2017 [cited by applicant]
US 10008196B2 · Maisonnier et al. · 2018 [cited by applicant]
US 10157342B1 · Kim · 2018 [cited by applicant]
US 10272349B2 · Davenport · 2019 [cited by applicant]
US 10621648B2 · Davis · 2020 [cited by applicant]
US 10664741B2 · Gibbs et al. · 2020 [cited by applicant]
US 20170125008A1 · Maisonnier et al. · 2017 [cited by applicant]
US 20180052664A1 · Zhang · 2018 [cited by examiner]
US 20190381415A1 · McMullen et al. · 2019 [cited by applicant]
US 20200065868A1 · Garlapati et al. · 2020 [cited by applicant]
US 20200147808A1 · Pirzchalski et al. · 2020 [cited by applicant]
US 20200234243A1 · Miron et al. · 2020 [cited by applicant]
US 20200258120A1 · Ardulov et al. · 2020 [cited by applicant]
US 20200320978A1 · Chatterjee · 2020 [cited by examiner]
WO 2018081833A1 · 2018 [cited by applicant]
Abstract Meaning Representation (AMR)-Home; URL: https://amr.isi.edu/index.html (1 page), Apr. 1, 2024. [cited by applicant]
Abstract Meaning Representation (AMR)-Research; URL: https://amr.isi.edu/research.html (3 pages), Apr. 1, 2024. [cited by applicant]
Alammar, Jay, “The Illustrated GPT-2 (Visualizing Transformer Language Models)” Visualizing machine learning one concept at a time; URL: http//jalammar.github.io/illustrated-gpt2/ (13 pages), Apr. 1, 2024. [cited by applicant]
Alammar, Jay, “The Illustrated BERT, ELMo, and co. (How NLP Cracked Transfer Learning)” (2018); URL: http://jalammar.github.io/illustrated-bert/ (20 pages). [cited by applicant]
Boinc Compute for Science, University of California; URL: https://boinc.berkeley.edu/ (1 page), Apr. 1, 2024. [cited by applicant]
Bourse, Yoann, “Artificial Intelligence in the Sims Series”; URL: https://team.inria.fr/imagine/files/2014/10/sims-slides.pdf (44 pages). [cited by applicant]
Brown, Tom B., et al.; “Language models are few-shot learners,” arXiv preprint arXiv:2005.14165 (2020); URL: https://arxiv.org/pdf/2005.14165 and URL: https://github.com/openai/gpt-3 (74 pages). [cited by applicant]
Browne, Cameron B., et al., “A Survey of Monte Carlo Tree Search Methods”, IEEE Transactions on Computational Intelligence and AI in Games, vol. 4, No. 1, Mar. 2012 (Mar. 1, 2012) pp. 1-43 (49 pages). [cited by applicant]
Chan, David, “The philosophy of The Sims,” Stanford University Working paper; http://library.stanford.edu/depts/hasrg/histsci/STS145papers/Chan. pdf (2003); URL: https://web.stanford.edu/group/htgg/cgi-bin/drupal/sites/… [cited by applicant]
Clark, Peter, et al., “Transformers as Soft Reasoners over Language.” ArXiv abs/2002.05867 (2020) n. pag. (15 pages). [cited by applicant]
CloudTurbine Stream Sharing; URL: https://www.cloudturbine.com/ (3 pages), Apr. 1, 2024. [cited by applicant]
Coursey, K. (2020) Speaking with Harmony: Finding the right thing to do or say . . . while in bed (or anywhere else). In O. Bendel (Ed.), Maschinenliebe: Teil 1 Liebespuppen und Sexroboter aus technischer, psychologisch… [cited by applicant]
Coursey, K. (2020) Speaking with Harmony: Finding the right thing to do or say . . . while in bed (or anywhere else). In O. Bendel (Ed.), Maschinenliebe: Teil 3 Liebespuppen und Sexroboter aus technischer, psychologisch… [cited by applicant]
Coursey, K., et al., (2019) “Living with Harmony: A Personal Companion System by Realbotix™.” In: Zhou Y., Fischer MH (eds) AI Love You. Springer, Cham, pp. 77-95; URL: https://www.daxtron.com/pdf/Coursey%20et%20al.%20L… [cited by applicant]
Coursey, Kino High, “The Value of Everything: Ranking and Association with Encyclopedic Knowledge,” University of North Texas (2009); URL: https://digital.library.unt.edu/ark:/67531/metadc12108/m2/1/high_res_d/dissertat… [cited by applicant]
Csomai, A. (2008) “Keywords in the mist: Automated keyword extraction for very large documents and back of the book indexing,” Ph.D. thesis, University of North Texas, United States—Texas; URL: https://digital.library.u… [cited by applicant]
Csomai, A. and Mihalcea, R. (2008) “Linking Documents to Encyclopedic Knowledge,” IEEE Intelligent Systems 23(5), 34-41; URL: http://www.academia.edu/download/8026958/mex2008050034.pdf (8 pages). [cited by applicant]
Devlin, J. et al., “Bert: Pre-training of deep bidirectional transformers for language understanding”—arXiv preprint arXiv . . . , (2018) arxiv.org; URL: https://arxiv.org/pdf/1810.04805.pdf (16 pages). [cited by applicant]
FightAIDS@home, “Go to battle against AIDS with your computer!” URL: http://fightaidsathome.scripps.edu/ (3 pages), Apr. 1, 2024. [cited by applicant]
Folding@Home; URL: https://foldingathome.org/2019/03/?Ing=en-US (1 page), Apr. 1, 2024. [cited by applicant]
Gao, Jianfeng, et al., “Neural Approaches to Conversational AI”, SIGIR (2018); URL: https://www.microsoft.com/en-us/research/uploads/prod/2018/07/neural-approaches-to-conversational-AI.pdf (175 pages). [cited by applicant]
GPT-2 Neural Network Poetry; gwern.net; URL: https://www.gwern.net/GPT-2 (88 pages), Apr. 1, 2024 [cited by applicant]
Grand, Stephen and Dave Cliff, “Creatures: Entertainment Software Agents with Artificial Life,” Autonomous Agents and Multi-Agent Systems, 100, 1-20 (1997); URL: https://www.researchgate.net/publication/226997131 (22 pa… [cited by applicant]
Grand, Steve, “Creation: Life and How to Make It” (2000) (173 pages). [cited by applicant]
Grand, Steve, “Growing Up With Lucy: How to Build An Android in Twenty Easy Steps,” (2003) (214 pages). [cited by applicant]
Grand, Steve, et al., “Creatures: Artificial Life Autonomous Software Agents for Home Entertainment,” Millennium Technical Report 9601, University of Sussex Technical Report CSRP434 (1997) (9 pages). [cited by applicant]
Grand, Steven and Dave Cliff, “Creatures: Entertainment Software Agents with Artificial Life,” Autonomous Agents and Multi-Agent Systems, 100, 1-20 (1997) URL: https://www.researchgate.net/publication/220794226_Creature… [cited by applicant]
Graziano, M.S.A., Webb, T.W. (2017) “From Sponge to Human: The Evolution of Consciousness” (PDF). Evolution of Nervous Systems, 2E. vol. 3, pp. 547-554. doi:10.1016/B978-0-12-804042-3.00098-1. ISBN 9780128040966; URL: h… [cited by applicant]
Graziano, Michael and Taylor Webb, “Part Three, Metaphilosophy of Consciousness Studies, Understanding Consciousness by Building It,” The Bloomsbury Companion to the Philosophy of Consciousness, (2018) 185-210 (26 pages… [cited by applicant]
Graziano, Msa (2017) “The Attention Scheme Theory: A Foundation for Engineering Artificial Consciousness,” Frontiers In Robotics and AI 4:60. doi: 10.3389/frobt.2017.00060 (2017) (9 pages). [cited by applicant]
Haase, K. W. (1990) “Invention and Exploration in Discovery,” (Doctoral dissertation, Massachusetts Institute of Technology);URL: https://dspace.mit.edu/bitstream/handle/1721.1/14257/22713693-MIT.pdf?sequence=2 (165 pag… [cited by applicant]
Hopkins, Don, “The Sims Design Document” v.71 “The Sims Design Document Draft 7” (Oct. 2, 1998) URL: https://donhopkins.com/home/TheSims/TheSimsDesignDocumentDraft7-1998-10-02-DonsReview.pdf; Assoc URL: http://linkedbya… [cited by applicant]
Horev, Rani, “BERT Explained: State of the art language model for NLP” (2018); URL: https://towardsdatascience.com/bert-explained-state-of-the-art-language-model-for-nlp-f8b21a9b6270 (8 pages). [cited by applicant]
How to Train It, Issue #19, GitHub, Feb. 15, 2019; URL: https://github.com/openai/gpt-2/issues/19 (6 pages). [cited by applicant]
Hutto, Clayton J. and Eric Gilbert, “Vader: A Parsimonious Rule-Based Model for Sentiment Analysis of Social Media Text.” Eighth International Conference on Weblogs and Social Media (ICWSM-14) Jun. 2014 (10 pages). [cited by applicant]
Install TensorFlow 2; URL: https://www.tensorflow.org/install (1 page), Apr. 1, 2024. [cited by applicant]
Install TensorFlow with pip; URL: https://www.tensorflow.org/install/pip (3 pages), Apr. 1, 2024. [cited by applicant]
Kocsis, Levente, et al., “Bandit based Monte-Carlo Planning” (2006); In Fürnkranz, Johannes; Scheffer, Tobias; Spiliopoulou, Myra (eds.). Machine Learning: ECML 2006, 17th European Conference on Machine Learning, Berlin… [cited by applicant]
Lee, Jieh-Sheng and Hsiang, Jieh, “Patent Claim Generation by Fine-Tuning OpenAI GPT-2.” arXiv preprint arXiv:1907.02052 (2019); National Taiwan University; URL: https://arxiv.org/pdf/1907.02052 (11 pages). [cited by applicant]
Lenat, Douglas (1983) “Eurisko: A program that learns new heuristics and domain concepts,” Artificial Intelligence 21 (1-2): 61-98, doi:10.1016/s0004-3702(83)80005-8 (39 pages). [cited by applicant]
Lenat, Douglas and Brown, J.S. (1984) “Why AM and Eurisko appear to work” (PDF), ResearchGate: 269-240; URL: https://www.researchgate.net/publication/221605660_Why_AM_and_Eurisko_Appear_to_Work (6 pages). [cited by applicant]
Lenat, Douglas B., “The Nature of Heuristics,” Artiicial Intelligence 19 (1982) 189-249 (61 pages). [cited by applicant]
Lenat, Douglas B., “Theory Formation by Heuristic Search,” Artificial Intelligence 21 (1983) 31-59 (29 pages). [cited by applicant]
Lenat, Douglas, “Eurisko: A program that learns new heuristics and domain concepts,” Artificial Intelligence 21 (1983) 61-98, doi: 10.1016/s0004-3702(83)80005-8 (38 pages). [cited by applicant]
Lenat, Douglas; Brown, JS (1984) “Why AM and Eurisko Appear to Work,” Artificial Intelligence 23(3), 269-294. https://doi.org/10.1016/0004-3702(84)90016-X (26 pages). [cited by applicant]
Mcts 1.0.4; URL: https://pypi.org/project/mcts/ (1 page), Apr. 1, 2024. [cited by applicant]
Microsoft_AI_Vector_search; URL: https://www.microsoft.com/en-us/ai/ai-lab-vector-search (4 pages), Apr. 1, 2024. [cited by applicant]
Mihalcea, Rada and Csomai, Andras, “Wikify! Linking documents to encyclopedic knowledge,” In Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pp. 233-242. 2007; URL: htt… [cited by applicant]
Mihalcea, Rada and Tarau, Paul (2004) TextRank: “Bringing Order into Texts,” Department of Computer Science University of North Texas “Archived copy” (PDF). Archived from the original (PDF) on Jun. 17, 2012. Retrieved J… [cited by applicant]
Monte Carlo tree search—Wikipedia; last edit Jun. 10, 2020; URL: https://en.wikipedia.org/wiki/Monte_Carlo_tree_search (10 pages). [cited by applicant]
01_Source_Code_GitClone_AI-DungeonMaster_1-100, Apr. 1, 2024. [cited by applicant]
02_Source_Code_GitClone_AI-DungeonMaster_101-781, Apr. 1, 2024. [cited by applicant]
03_Source_Code_GitClone_ann-benchmarks_292, Apr. 1, 2024. [cited by applicant]
04_Source_Code_GitClone_annoy_1-600, Apr. 1, 2024. [cited by applicant]
05_Source_Code_GitClone_annoy_601-1105, Apr. 1, 2024. [cited by applicant]
06_Source_Code_GitClone_cdQA_2384, Apr. 1, 2024. [cited by applicant]
07_Source_Code_GitClone_cloudturbine_1-3000, Apr. 1, 2024. [cited by applicant]
08_Source_Code_GitClone_cloudturbine_3001-6000, Apr. 1, 2024. [cited by applicant]
09_Source_Code_GitClone_cloudturbine_6001-9000, Apr. 1, 2024. [cited by applicant]
10_Source_Code_GitClone_cloudturbine_9001-12000, Apr. 1, 2024. [cited by applicant]
100_Source_Code_GitClone_vaderSentiment_751-1412, Apr. 1, 2024. [cited by applicant]
101_Source_Code_GitClone_Zeta36_1-10, Apr. 1, 2024. [cited by applicant]
102_Source_Code_GitClone_Zeta36_11-131, Apr. 1, 2024. [cited by applicant]
11_Source_Code_GitClone_cloudturbine_12001-15000, Apr. 1, 2024. [cited by applicant]
12_Source_Code_GitClone_cloudturbine_15001-18000, Apr. 1, 2024. [cited by applicant]
13_Source_Code_GitClone_cloudturbine_18001-21000, Apr. 1, 2024. [cited by applicant]
14_Source_Code_GitClone_cloudturbine_21001-24000, Apr. 1, 2024. [cited by applicant]
15_Source_Code_GitClone_cloudturbine_24001-27000, Apr. 1, 2024. [cited by applicant]
16_Source_Code_GitClone_cloudturbine_27001-30000, Apr. 1, 2024. [cited by applicant]
17_Source_Code_GitClone_cloudturbine_30001-33000, Apr. 1, 2024. [cited by applicant]
18_Source_Code_GitClone_cloudturbine_33001-36000, Apr. 1, 2024. [cited by applicant]
19_Source_Code_GitClone_cloudturbine_36001-39000, Apr. 1, 2024. [cited by applicant]
20_Source_Code_GitClone_cloudturbine_39001-42000, Apr. 1, 2024. [cited by applicant]
21_Source_Code_GitClone_cloudturbine_42001-45000, Apr. 1, 2024. [cited by applicant]
22_Source_Code_GitClone_cloudturbine_45001-48000, Apr. 1, 2024. [cited by applicant]
23_Source_Code_GitClone_cloudturbine_48001-51000, Apr. 1, 2024. [cited by applicant]
24_Source_Code_GitClone_cloudturbine_51001-54000, Apr. 1, 2024. [cited by applicant]
25_Source_Code_GitClone_cloudturbine_54001-57000, Apr. 1, 2024. [cited by applicant]
26_Source_Code_GitClone_cloudturbine_57001-60000, Apr. 1, 2024. [cited by applicant]
27_Source_Code_GitClone_cloudturbine_60001-63000, Apr. 1, 2024. [cited by applicant]
28_Source_Code_GitClone_cloudturbine_63001-66000, Apr. 1, 2024. [cited by applicant]
29_Source_Code_GitClone_cloudturbine_66001-66882, Apr. 1, 2024. [cited by applicant]
30_Source_Code_GitClone_fast-bert_1-3000, Apr. 1, 2024. [cited by applicant]
31_Source_Code_GitClone_fast-bert_3001-4587, Apr. 1, 2024. [cited by applicant]
32_Source_Code_GitClone_Fine-tune_7, Apr. 1, 2024. [cited by applicant]
33_Source_Code_GitClone_FreeSims_1-700, Apr. 1, 2024. [cited by applicant]
34_Source_Code_GitClone_FreeSims_701-2800, Apr. 1, 2024. [cited by applicant]
35_Source_Code_GitClone_FreeSims_2801_6300, Apr. 1, 2024. [cited by applicant]
36_Source_Code_GitClone_FreeSims_6301-9100, Apr. 1, 2024. [cited by applicant]
37_Source_Code_GitClone_FreeSims_9101-11900, Apr. 1, 2024. [cited by applicant]
38_Source_Code_GitClone_FreeSims_11901-14000, Apr. 1, 2024. [cited by applicant]
39_Source_Code_GitClone_FreeSims_14001-15400, Apr. 1, 2024. [cited by applicant]
40_Source_Code_GitClone_FreeSims_15401-17500, Apr. 1, 2024. [cited by applicant]
41_Source_Code_GitClone_FreeSims_17501-18417, Apr. 1, 2024. [cited by applicant]
42_Source_Code_GitClone_GitClone_AI-DungeonMaster_1-300, Apr. 1, 2024. [cited by applicant]
43_Source_Code_GitClone_GitClone_AI-DungeonMaster_301-781, Apr. 1, 2024. [cited by applicant]
44_Source_Code_GitClone_gpt-2_1-200, Apr. 1, 2024. [cited by applicant]
45_Source_Code_GitClone_gpt-2_201-400, Apr. 1, 2024. [cited by applicant]
46_Source_Code_GitClone_gpt-2_401-600, Apr. 1, 2024. [cited by applicant]
47_Source_Code_GitClone_gpt-2_601-800, Apr. 1, 2024. [cited by applicant]
98_Source_Code_GitClone_trainLMS_pub_9, Apr. 1, 2024. [cited by applicant]
99_Source_Code_GitClone_vaderSentiment_1-750, Apr. 1, 2024. [cited by applicant]
48_Source_Code_GitClone_gpt-2_801-1000, Apr. 1, 2024. [cited by applicant]
49_Source_Code_GitClone_gpt-2_1001-1200, Apr. 1, 2024. [cited by applicant]
50_Source_Code_GitClone_gpt-2_1201-1305, Apr. 1, 2024. [cited by applicant]
51_Source_Code_GitClone_gpt-2-simple_1-200, Apr. 1, 2024. [cited by applicant]
52_Source_Code_GitClone_gpt-2-simple_201-400, Apr. 1, 2024. [cited by applicant]
53_Source_Code_GitClone_gpt-2-simple_401-600, Apr. 1, 2024. [cited by applicant]
54_Source_Code_GitClone_gpt-2-simple_601-800, Apr. 1, 2024. [cited by applicant]
55_Source_Code_GitClone_gpt-2-simple_801-1000, Apr. 1, 2024. [cited by applicant]
56_Source_Code_GitClone_gpt-2-simple_1001-1200, Apr. 1, 2024. [cited by applicant]
57_Source_Code_GitClone_gpt-2-simple_1201-1440, Apr. 1, 2024. [cited by applicant]
58_Source_Code_GitClone_gpt-3_1-500, Apr. 1, 2024. [cited by applicant]
59_Source_Code_GitClone_gpt-3_501-1000, Apr. 1, 2024. [cited by applicant]
60_Source_Code_GitClone_gpt-3_1001-1500, Apr. 1, 2024. [cited by applicant]
61_Source_Code_GitClone_gpt-3_1501-2000, Apr. 1, 2024. [cited by applicant]
62_Source_Code_GitClone_gpt-3_2001-2500, Apr. 1, 2024. [cited by applicant]
63_Source_Code_GitClone_gpt-3_2501-3539, Apr. 1, 2024. [cited by applicant]
64_Source_Code_GitClone_johan-gras_136, Apr. 1, 2024. [cited by applicant]
65_Source_Code_GitClone_MCTS_1-50, Apr. 1, 2024. [cited by applicant]
66_Source_Code_GitClone_MCTS_51-98, Apr. 1, 2024. [cited by applicant]
67_Source_Code_GitClone_milvus_1-700, Apr. 1, 2024. [cited by applicant]
68_Source_Code_GitClone_milvus_701-2100, Apr. 1, 2024. [cited by applicant]
69_Source_Code_GitClone_milvus_2101-3500, Apr. 1, 2024. [cited by applicant]
70_Source_Code_GitClone_milvus_3501-4200, Apr. 1, 2024. [cited by applicant]
71_Source_Code_GitClone_milvus_4201-4900, Apr. 1, 2024. [cited by applicant]
72_Source_Code_GitClone_milvus_4901-5600, Apr. 1, 2024. [cited by applicant]
73_Source_Code_GitClone_milvus_5601-6300, Apr. 1, 2024. [cited by applicant]
74_Source_Code_GitClone_milvus_6301-6848, Apr. 1, 2024. [cited by applicant]
75_Source_Code_GitClone_muzero-general_1-1600, Apr. 1, 2024. [cited by applicant]
76_Source_Code_GitClone_muzero-general_1601-1983, Apr. 1, 2024. [cited by applicant]
77_Source_Code_GitClone_muzero-pytorch_556, Apr. 1, 2024. [cited by applicant]
78_Source_Code_GitClone_pynndescent_1-400, Apr. 1, 2024. [cited by applicant]
79_Source_Code_GitClone_pynndescent_401-800, Apr. 1, 2024. [cited by applicant]
80_Source_Code_GitClone_python-tf-idf_114, Apr. 1, 2024. [cited by applicant]
81_Source_Code_GitClone_ReDial_A19_1-1000, Apr. 1, 2024. [cited by applicant]
82_Source_Code_GitClone_ReDial_A19_1001-3000, Apr. 1, 2024. [cited by applicant]
83_Source_Code_GitClone_ReDial_A19_3001-5000, Apr. 1, 2024. [cited by applicant]
84_Source_Code_GitClone_ReDial_A19_5001-7000, Apr. 1, 2024. [cited by applicant]
85_Source_Code_GitClone_ReDial_A19_7001-7585, Apr. 1, 2024. [cited by applicant]
86_Source_Code_GitClone_ReducedFreeSims_1-600, Apr. 1, 2024. [cited by applicant]
87_Source_Code_GitClone_ReducedFreeSims_601-1200, Apr. 1, 2024. [cited by applicant]
88_Source_Code_GitClone_ReducedFreeSims_1201-4800, Apr. 1, 2024. [cited by applicant]
89_Source_Code_GitClone_ReducedFreeSims_4801-8400, Apr. 1, 2024. [cited by applicant]
90_Source_Code_GitClone_ReducedFreeSims_8401-10800, Apr. 1, 2024. [cited by applicant]
91_Source_Code_GitClone_ReducedFreeSims_10801-12600, Apr. 1, 2024. [cited by applicant]
92_Source_Code_GitClone_ReducedFreeSims_12601-13800, Apr. 1, 2024. [cited by applicant]
93_Source_Code_GitClone_ReducedFreeSims_13801-15600, Apr. 1, 2024. [cited by applicant]
94_Source_Code_GitClone_ReducedFreeSims_15601-16800, Apr. 1, 2024. [cited by applicant]
95_Source_Code_GitClone_ReducedFreeSims_16801-17717, Apr. 1, 2024. [cited by applicant]
96_Source_Code_GitClone_SPTAG_561, Apr. 1, 2024. [cited by applicant]
97_Source_Code_GitClone_textrank_251, Apr. 1, 2024. [cited by applicant]
Monte-Carlo Tree Search—Chessprogramming wiki; last edit May 15, 2020; URL: https://www.chessprogramming.org/Monte-Carlo_Tree-Search (17 pages). [cited by applicant]
Oresky, Colleen M., et al. (1991). Strategic automatic discovery system (STRADS). 4. 223-260. 10.1007/978-1-4612-3040-3_11; Reprinted from “Knowledge-Based Simulation: Methodology and Application” (38 pages). [cited by applicant]
Orkin, J., “Goal-Oriented Action Planning (GOAP)”, MIT Media Lab, URL: http://alumni.media.mit.edu/˜jorkin/goap.html (2 pages), Apr. 1, 2024. [cited by applicant]
Orkin, Jeff, “Applying Goal-Oriented Action Planning to Games,” (2008) URL: http://alumni.media.mit.edu/˜jorkin/GOAP_draft_AIWisdom2_2003.pdf (11 pages). [cited by applicant]
Radford, Alec et al., “Better Language Models and Their Implications,” openai.com.pdg; (2019) URL:https://openai.com/blog/better-language-models/; (1 page). [cited by applicant]
Radford, Alec, et al., “Language Models are Unsupervised Multitask Learners” (2019) URL: https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf (24 pages). [cited by applicant]
Replika: Building an Emotional Conversation with Deep Learning; URL: https://scai.info/slides/replika_ai.pdf (26 pages), Apr. 1, 2024. [cited by applicant]
Schrittwieser, Julian, et al., “Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model,” arXiv:1911.08265v2 [cs.LG] (2020), (21 pages). [cited by applicant]
Seth, Yashu, “BERT Explained—A list of Frequently Asked Questions” (2019) URL: https://yashuseth.blog/2019/06/12/bert-explained-faqs-understand-bert-working/ (8 pages). [cited by applicant]
Shum, Heung-Yeung, et al., “From Eliza to Xiaolce: Challenges and Opportunities with Social Chatbots,” Frontiers of Information Technology & Electronic Engineering 19, No. 1 (2018): 10-26; URL: https://arxiv.org/ftp/arx… [cited by applicant]
Silver, David, et al., “Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm” arXiv:1712.01815 [cs.AI] (Dec. 5, 2017) URL: https://arxiv.org/pdf/1712.01815 (19 pages). [cited by applicant]
Silver, David, et al.; “A general reinforcement learning algorithm that masters chess, shogi, and go through self-play” Science. 362 (6419); 1140-1144. doi:10.1126/science.aar6404. Retrieved Dec. 7, 2018; URL: https://s… [cited by applicant]
Sturtevant, Nathan, “Monte-Carlo Tree Search and Related Algorithms for Games”, Game AI Pro 2: Collected Wisdom of Game AI Professionals; URL: http://www.gameaipro.com/GameAIPro2/GameAIPro2_Chapter25_Monte_Carlo_Tree_Se… [cited by applicant]
Summa 1.2.0; URL: https://pypi.org/project/summa/ (2 pages), Apr. 1, 2024. [cited by applicant]
The Sims Video Games—Official EA Site; URL: https://www.ea.com/games/the-sims (2 pages), Apr. 1, 2024. [cited by applicant]
The Sims, Wikipedia; URL: https://en.wikipedia.org/wiki/The_Sims (7 pages), Apr. 1, 2024. [cited by applicant]
Transformers as Soft Reasoners over Language, AI2 Allen Institute for AI; URL: https://rule-reasoning.apps.allenai.org/ about (1 page), Apr. 1, 2024. [cited by applicant]
UCT—Chessprogramming wiki; last edit May 15, 2020; URL: https://www.chessprogramming.org/UCT (8 pages). [cited by applicant]
VaderSentiment 3.3.2; PyPI.org screenshot; URL: https://pypi.org/project/vaderSentiment/ (1 page), Apr. 1, 2024. [cited by applicant]
Veness, Joel et al.; “A Monte-Carlo AIXI Approximation,” Journal of Artificial Intelligence Research 40: 95-142 (2011); URL: https://www.jair.org/index.php/jair/article/view/10685 (48 pages). [cited by applicant]
Veness, Joel, et al., “A Monte Carlo AIXI Approximation,” e-print arXiv:0909.0801 (2009); URL: https://arxiv.org/abs/0909.0801 (51 pages). [cited by applicant]
Vincent, James “DeepMind's AI became a superhuman chess player in a few hours, just for fun,” The Verge; (Dec. 6, 2017); URL: https://www.theverge.com/2017/12/6/16741106/deepmind-ai-chess-alphazero-shogi-go (4 pages). [cited by applicant]
Wallace, Dr. Richard S. “The Elements of AIML Style,” Alice A. I. Foundation, Inc. (2003) URL: https://files.ifi.uzh.ch/cl/hess/classes/seminare/chatbots/style.pdf (86 pages). [cited by applicant]
Webb TW, Graziano MS (2015) “The attention schema theory: a mechanistic account of subjective awareness,” Front Psychol. 6:500. doi:10.3389/fpsyg.2015.00500. PMC 4407481. PMID 25954242 (11 pages). [cited by applicant]
Xiaoice_Wikipedia, last edited Apr. 17, 2020, URL: https://en.wikipedia.org/wiki/Xiaoice (2 pages). [cited by applicant]
Zhou, Li, et al., “The Design and Implementation of Xiaoice, an Empathetic Social Chatbot,” Computational Linguistics 46, No. 1 (2020); 53-93; URL: https://arxiv.org/pdf/1812.08989.pdf (35 pages). [cited by applicant]
Cited By (5)
US 12,505,137 US 12,561,533 US 12,608,582 US 12,645,831 US 12,694,048