Strongly-Typed Agents are Guaranteed to Interact Safely
원문 초록
As artificial agents proliferate, it is becoming increasingly important to ensure that their interactions with one another are well-behaved. In this paper, we formalize a common-sense notion of when algorithms are well-behaved: an algorithm is safe if it does no harm. Motivated by recent progress in deep learning, we focus on the specific case where agents update their actions according to gradient descent. The paper shows that that gradient descent converges to a Nash equilibrium in safe games. The main contribution is to define strongly-typed agents and show they are guaranteed to interact safely, thereby providing sufficient conditions to guarantee safe interactions. A series of examples show that strong-typing generalizes certain key features of convexity, is closely related to blind source separation, and introduces a new perspective on classical multilinear games based on tensor decomposition.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Towards Reliable Objective Evaluation Metrics for Generative Singing Voice Separation Models
LoSiA: Efficient High-Rank Fine-Tuning via Subnet Localization and Optimization
Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search
AmbiK: Dataset of Ambiguous Tasks in Kitchen Environment
Revisit CP Tensor Decomposition: Statistical Optimality and Fast Convergence
3D Visual Illusion Depth Estimation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.