Boundless Socratic Learning with Language Games
An agent trained within a closed system can master any desired capability, as long as the following three conditions hold: (a) it receives sufficiently informative and aligned feedback, (b) its coverage of experience/data is broad enough, and (c) it has sufficient capacity and resource. In this posi...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Schaul, Tom |
description | An agent trained within a closed system can master any desired capability, as
long as the following three conditions hold: (a) it receives sufficiently
informative and aligned feedback, (b) its coverage of experience/data is broad
enough, and (c) it has sufficient capacity and resource. In this position
paper, we justify these conditions, and consider what limitations arise from
(a) and (b) in closed systems, when assuming that (c) is not a bottleneck.
Considering the special case of agents with matching input and output spaces
(namely, language), we argue that such pure recursive self-improvement, dubbed
"Socratic learning", can boost performance vastly beyond what is present in its
initial data or knowledge, and is only limited by time, as well as gradual
misalignment concerns. Furthermore, we propose a constructive framework to
implement it, based on the notion of language games. |
doi_str_mv | 10.48550/arxiv.2411.16905 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2411_16905</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2411_16905</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2411_169053</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE01DM0szQw5WTQd8ovzUvJSS0uVgjOTy5KLMlMVvBJTSzKy8xLVyjPLMlQ8EnMSy9NTE9VcE_MTS3mYWBNS8wpTuWF0twM8m6uIc4eumCj4wuKMnMTiyrjQVbEg60wJqwCAAbZMD4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Boundless Socratic Learning with Language Games</title><source>arXiv.org</source><creator>Schaul, Tom</creator><creatorcontrib>Schaul, Tom</creatorcontrib><description>An agent trained within a closed system can master any desired capability, as
long as the following three conditions hold: (a) it receives sufficiently
informative and aligned feedback, (b) its coverage of experience/data is broad
enough, and (c) it has sufficient capacity and resource. In this position
paper, we justify these conditions, and consider what limitations arise from
(a) and (b) in closed systems, when assuming that (c) is not a bottleneck.
Considering the special case of agents with matching input and output spaces
(namely, language), we argue that such pure recursive self-improvement, dubbed
"Socratic learning", can boost performance vastly beyond what is present in its
initial data or knowledge, and is only limited by time, as well as gradual
misalignment concerns. Furthermore, we propose a constructive framework to
implement it, based on the notion of language games.</description><identifier>DOI: 10.48550/arxiv.2411.16905</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence ; Computer Science - Computation and Language</subject><creationdate>2024-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2411.16905$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2411.16905$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Schaul, Tom</creatorcontrib><title>Boundless Socratic Learning with Language Games</title><description>An agent trained within a closed system can master any desired capability, as
long as the following three conditions hold: (a) it receives sufficiently
informative and aligned feedback, (b) its coverage of experience/data is broad
enough, and (c) it has sufficient capacity and resource. In this position
paper, we justify these conditions, and consider what limitations arise from
(a) and (b) in closed systems, when assuming that (c) is not a bottleneck.
Considering the special case of agents with matching input and output spaces
(namely, language), we argue that such pure recursive self-improvement, dubbed
"Socratic learning", can boost performance vastly beyond what is present in its
initial data or knowledge, and is only limited by time, as well as gradual
misalignment concerns. Furthermore, we propose a constructive framework to
implement it, based on the notion of language games.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE01DM0szQw5WTQd8ovzUvJSS0uVgjOTy5KLMlMVvBJTSzKy8xLVyjPLMlQ8EnMSy9NTE9VcE_MTS3mYWBNS8wpTuWF0twM8m6uIc4eumCj4wuKMnMTiyrjQVbEg60wJqwCAAbZMD4</recordid><startdate>20241125</startdate><enddate>20241125</enddate><creator>Schaul, Tom</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20241125</creationdate><title>Boundless Socratic Learning with Language Games</title><author>Schaul, Tom</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2411_169053</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Schaul, Tom</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Schaul, Tom</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Boundless Socratic Learning with Language Games</atitle><date>2024-11-25</date><risdate>2024</risdate><abstract>An agent trained within a closed system can master any desired capability, as
long as the following three conditions hold: (a) it receives sufficiently
informative and aligned feedback, (b) its coverage of experience/data is broad
enough, and (c) it has sufficient capacity and resource. In this position
paper, we justify these conditions, and consider what limitations arise from
(a) and (b) in closed systems, when assuming that (c) is not a bottleneck.
Considering the special case of agents with matching input and output spaces
(namely, language), we argue that such pure recursive self-improvement, dubbed
"Socratic learning", can boost performance vastly beyond what is present in its
initial data or knowledge, and is only limited by time, as well as gradual
misalignment concerns. Furthermore, we propose a constructive framework to
implement it, based on the notion of language games.</abstract><doi>10.48550/arxiv.2411.16905</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2411.16905 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2411_16905 |
source | arXiv.org |
subjects | Computer Science - Artificial Intelligence Computer Science - Computation and Language |
title | Boundless Socratic Learning with Language Games |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T22%3A30%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Boundless%20Socratic%20Learning%20with%20Language%20Games&rft.au=Schaul,%20Tom&rft.date=2024-11-25&rft_id=info:doi/10.48550/arxiv.2411.16905&rft_dat=%3Carxiv_GOX%3E2411_16905%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |