A Learning Algorithm That Attains the Human Optimum in a Repeated Human-Machine Interaction Game
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916567167533056 |
|---|---|
| author | Isa, Jason T. Ratliff, Lillian J. Burden, Samuel A. |
| author_facet | Isa, Jason T. Ratliff, Lillian J. Burden, Samuel A. |
| contents | When humans interact with learning-based control systems, a common goal is to minimize a cost function known only to the human. For instance, an exoskeleton may adapt its assistance in an effort to minimize the human's metabolic cost-of-transport. Conventional approaches to synthesizing the learning algorithm solve an inverse problem to infer the human's cost. However, these problems can be ill-posed, hard to solve, or sensitive to problem data. Here we show a game-theoretic learning algorithm that works solely by observing human actions to find the cost minimum, avoiding the need to solve an inverse problem. We evaluate the performance of our algorithm in an extensive set of human subjects experiments, demonstrating consistent convergence to the minimum of a prescribed human cost function in scalar and multidimensional instantiations of the game. We conclude by outlining future directions for theoretical and empirical extensions of our results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_08626 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Learning Algorithm That Attains the Human Optimum in a Repeated Human-Machine Interaction Game Isa, Jason T. Ratliff, Lillian J. Burden, Samuel A. Computer Science and Game Theory Human-Computer Interaction Machine Learning When humans interact with learning-based control systems, a common goal is to minimize a cost function known only to the human. For instance, an exoskeleton may adapt its assistance in an effort to minimize the human's metabolic cost-of-transport. Conventional approaches to synthesizing the learning algorithm solve an inverse problem to infer the human's cost. However, these problems can be ill-posed, hard to solve, or sensitive to problem data. Here we show a game-theoretic learning algorithm that works solely by observing human actions to find the cost minimum, avoiding the need to solve an inverse problem. We evaluate the performance of our algorithm in an extensive set of human subjects experiments, demonstrating consistent convergence to the minimum of a prescribed human cost function in scalar and multidimensional instantiations of the game. We conclude by outlining future directions for theoretical and empirical extensions of our results. |
| title | A Learning Algorithm That Attains the Human Optimum in a Repeated Human-Machine Interaction Game |
| topic | Computer Science and Game Theory Human-Computer Interaction Machine Learning |
| url | https://arxiv.org/abs/2501.08626 |