Zobrazeno 1 - 10
of 3 520
pro vyhledávání: '"P, Neary"'
We propose and demonstrate a compositional framework for training and verifying reinforcement learning (RL) systems within a multifidelity sim-to-real pipeline, in order to deploy reliable and adaptable RL policies on physical hardware. By decomposin
Externí odkaz:
http://arxiv.org/abs/2312.01249
In order to coordinate players in a game must first identify a target pattern of behaviour. In this paper we investigate the difficulty of identifying prominent outcomes in two kinds of binary action coordination problems in social networks: pure coo
Externí odkaz:
http://arxiv.org/abs/2311.03195
Autor:
Wongpiromsarn, Tichakorn, Ghasemi, Mahsa, Cubuktepe, Murat, Bakirtzis, Georgios, Carr, Steven, Karabag, Mustafa O., Neary, Cyrus, Gohari, Parham, Topcu, Ufuk
Formal methods refer to rigorous, mathematical approaches to system development and have played a key role in establishing the correctness of safety-critical systems. The main building blocks of formal methods are models and specifications, which are
Externí odkaz:
http://arxiv.org/abs/2311.01258
We propose a framework for verifiable and compositional reinforcement learning (RL) in which a collection of RL subsystems, each of which learns to accomplish a separate subtask, are composed to achieve an overall task. The framework consists of a hi
Externí odkaz:
http://arxiv.org/abs/2309.06420
Recently developed pretrained models can encode rich world knowledge expressed in multiple modalities, such as text and images. However, the outputs of these models cannot be integrated into algorithms to solve sequential decision-making tasks. We de
Externí odkaz:
http://arxiv.org/abs/2308.05295
We introduce and study a new optimization problem on digraphs, termed Maximum Weighted Digraph Partition (MWDP) problem. We prove three complexity dichotomies for MWDP: on arbitrary digraphs, on oriented digraphs, and on symmetric digraphs. We demons
Externí odkaz:
http://arxiv.org/abs/2307.01109
We present a framework and algorithms to learn controlled dynamics models using neural stochastic differential equations (SDEs) -- SDEs whose drift and diffusion terms are both parametrized by neural networks. We construct the drift term to leverage
Externí odkaz:
http://arxiv.org/abs/2306.06335
We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordination games and anti-coordination games. We consider three objectives in
Externí odkaz:
http://arxiv.org/abs/2305.07124
Privacy-aware multiagent systems must protect agents' sensitive data while simultaneously ensuring that agents accomplish their shared objectives. Towards this goal, we propose a framework to privatize inter-agent communications in cooperative multia
Externí odkaz:
http://arxiv.org/abs/2301.08811
Data-driven control algorithms use observations of system dynamics to construct an implicit model for the purpose of control. However, in practice, data-driven techniques often require excessive sample sizes, which may be infeasible in real-world sce
Externí odkaz:
http://arxiv.org/abs/2301.03565