{"title":"LLM-Oracle 机器","authors":"Jie Wang","doi":"arxiv-2406.12213","DOIUrl":null,"url":null,"abstract":"Contemporary AI applications leverage large language models (LLMs) for their\nknowledge and inference capabilities in natural language processing tasks. This\napproach aligns with the concept of oracle Turing machines (OTMs). To capture\nthe essence of these computations, including those desired but not yet in\npractice, we extend the notion of OTMs by employing a cluster of LLMs as the\noracle. We present four variants: basic, augmented, fault-avoidance, and\n$\\epsilon$-fault. The first two variants are commonly observed, whereas the\nlatter two are specifically designed to ensure reliable outcomes by addressing\nLLM hallucinations, biases, and inconsistencies.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"61 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"LLM-Oracle Machines\",\"authors\":\"Jie Wang\",\"doi\":\"arxiv-2406.12213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Contemporary AI applications leverage large language models (LLMs) for their\\nknowledge and inference capabilities in natural language processing tasks. This\\napproach aligns with the concept of oracle Turing machines (OTMs). To capture\\nthe essence of these computations, including those desired but not yet in\\npractice, we extend the notion of OTMs by employing a cluster of LLMs as the\\noracle. We present four variants: basic, augmented, fault-avoidance, and\\n$\\\\epsilon$-fault. The first two variants are commonly observed, whereas the\\nlatter two are specifically designed to ensure reliable outcomes by addressing\\nLLM hallucinations, biases, and inconsistencies.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"61 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.12213\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.12213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Contemporary AI applications leverage large language models (LLMs) for their
knowledge and inference capabilities in natural language processing tasks. This
approach aligns with the concept of oracle Turing machines (OTMs). To capture
the essence of these computations, including those desired but not yet in
practice, we extend the notion of OTMs by employing a cluster of LLMs as the
oracle. We present four variants: basic, augmented, fault-avoidance, and
$\epsilon$-fault. The first two variants are commonly observed, whereas the
latter two are specifically designed to ensure reliable outcomes by addressing
LLM hallucinations, biases, and inconsistencies.