東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Adaptation-Based Programming.

Bauer, Tim.

FindBook

Google Book

Amazon

博客來

Adaptation-Based Programming.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Adaptation-Based Programming./
作者:	Bauer, Tim.
面頁冊數:	173 p.
附註:	Source: Dissertation Abstracts International, Volume: 74-09(E), Section: B.
Contained By:	Dissertation Abstracts International74-09B(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3569800
ISBN:	9781303073243

Adaptation-Based Programming.
Bauer, Tim.

Adaptation-Based Programming. - 173 p.

Source: Dissertation Abstracts International, Volume: 74-09(E), Section: B.

Thesis (Ph.D.)--Oregon State University, 2013.

Partial programming is a field of study where users specify an outline or skeleton of a program, but leave various parts undefined. The undefined parts are then completed by an external mechanism to form a complete program. Adaptation-Based Programming (ABP) is a method of partial programming that utilizes techniques from the field of reinforcement learning (RL), a subfield of machine learning, to find good completions of those partial programs.

ISBN: 9781303073243Subjects--Topical Terms:

626642
Computer Science.

Adaptation-Based Programming.
LDR:03771nam a2200313 4500 001 1963469
005 20141003074055.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303073243
035 $a (MiAaPQ)AAI3569800
035 $a AAI3569800
040 $a MiAaPQ $c MiAaPQ
100 1 $a Bauer, Tim. $3 2099729
245 1 0 $a Adaptation-Based Programming.
300 $a 173 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-09(E), Section: B.
500 $a Adviser: Martin Erwig.
502 $a Thesis (Ph.D.)--Oregon State University, 2013.
520 $a Partial programming is a field of study where users specify an outline or skeleton of a program, but leave various parts undefined. The undefined parts are then completed by an external mechanism to form a complete program. Adaptation-Based Programming (ABP) is a method of partial programming that utilizes techniques from the field of reinforcement learning (RL), a subfield of machine learning, to find good completions of those partial programs.
520 $a An ABP user writes a partial program in some host programming language. At various points where the programmer is uncertain of the best course of action, they include choices that non-deterministically select amongst several options. Additionally, users indicate program success through a reward construct somewhere in their program. The resulting non-deterministic program is completed by treating it as an equivalent RL problem and solving the problem with techniques from that field. Over repeated executions, the RL algorithms within the ABP system will learn to select choices at various points that maximize the reward received.
520 $a This thesis explores various aspects of ABP such as the semantics of different implementations, including different design trade-offs encountered with each approach. The goal of all approaches is to present a model for programs that adapt to their environment based on the points of uncertainty within the program that the programmer has indicated.
520 $a The first approach presented in this work is an implementation of ABP as a domain-specific language embedded within a functional language. This language provides constructs for common patterns and situations that arise in adaptive programs. This language proves to be compositional and to foster rapid experimentation with different adaptation methods (e.g. learning algorithms). A second approach presents an implementation of ABP as an object-oriented library that models adaptive programs as formal systems from the field of RL called Markov Decision Processes (MDPs). This approach abstracts away many of the details of the learning algorithm from the casual user and uses a fixed learning algorithm to control the program adaptation rather than allowing it to vary. This abstraction results in an easier-to-use library, but limits the scenarios that ABP can effectively be used in. Moreover, treating adaptive programs as MDPs leads to some unintuitive situations where seemingly reasonably programs fail to adapt efficiently. This work addresses this problem with algorithms that analyze the adaptive program's structure and data flow to boost the rate at which these problematic adaptive programs learn thus increasing the number of problems that ABP can effectively be used to solve.
520 $a This work demonstrates a powerful new model for writing adaptive computer programs, and seamlessly integrates advanced RL technologies into general-purpose programming languages.
590 $a School code: 0172.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Oregon State University. $3 625720
773 0 $t Dissertation Abstracts International $g 74-09B(E).
790 $a 0172
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3569800