Name
Title | ||
|---|---|---|
Resilient Computing With Reinforcement Learning On A Dynamical System: Case Study In Sorting |
Abstract | ||
|---|---|---|
This paper formulates general computation as a feedback-control problem, which allows the agent to autonomously overcome some limitations of standard procedural language programming: resilience to errors and early program termination. Our formulation considers computation to be trajectory generation in the program's variable space. The computing then becomes a sequential decision making problem, solved with reinforcement learning (RL), and analyzed with Lyapunov stability theory to assess the agent's resilience and progression to the goal. We do this through a case study on a quintessential computer science problem, array sorting. Evaluations show that our RL sorting agent makes steady progress to an asymptotically stable goal, is resilient to faulty components, and performs less array manipulations than traditional Quicksort and Bubble sort. |
Year | Venue | DocType |
|---|---|---|
2018 | 2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC) | Conference |
Volume | ISSN | Citations |
abs/1809.09261 | 0743-1546 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksandra Faust | 1 | 68 | 14.83 |
| James B. Aimone | 2 | 15 | 10.69 |
| Conrad D. James | 3 | 11 | 5.57 |
| Lydia Tapia | 4 | 194 | 24.66 |