Zobrazeno 1 - 10
of 164
pro vyhledávání: '"Lall, Sanjay"'
In this study, we explore a collaborative multi-agent stochastic linear bandit setting involving a network of $N$ agents that communicate locally to minimize their collective regret while keeping their expected cost under a specified threshold $\tau$
Externí odkaz:
http://arxiv.org/abs/2410.17382
Autor:
Celestini, Davide, Afsharrad, Amirhossein, Gammelli, Daniele, Guffanti, Tommaso, Zardini, Gioele, Lall, Sanjay, Capello, Elisa, D'Amico, Simone, Pavone, Marco
Effective trajectory generation is essential for reliable on-board spacecraft autonomy. Among other approaches, learning-based warm-starting represents an appealing paradigm for solving the trajectory generation problem, effectively combining the ben
Externí odkaz:
http://arxiv.org/abs/2410.11723
Autor:
Lall, Sanjay, Spalink, Tammo
The bittide mechanism enables logically synchronous computation across distributed systems by leveraging the continuous frame transmission inherent to wired networks such as Ethernet. Instead of relying on a global clock, bittide uses a decentralized
Externí odkaz:
http://arxiv.org/abs/2410.05432
Temporal logic rules are often used in control and robotics to provide structured, human-interpretable descriptions of high-dimensional trajectory data. These rules have numerous applications including safety validation using formal methods, constrai
Externí odkaz:
http://arxiv.org/abs/2406.10449
Training neural networks which are robust to adversarial attacks remains an important problem in deep learning, especially as heavily overparameterized models are adopted in safety-critical settings. Drawing from recent work which reformulates the tr
Externí odkaz:
http://arxiv.org/abs/2405.14033
Autor:
Kenwright, Logan, Roop, Partha, Allen, Nathan, Lall, Sanjay, Cascaval, Calin, Spalink, Tammo, Izzard, Martin
Kahn Process Networks (KPNs) are a deterministic Model of Computation (MoC) for distributed systems. KPNs supports non-blocking writes and blocking reads, with the consequent assumption of unbounded buffers between processes. Variants such as Finite
Externí odkaz:
http://arxiv.org/abs/2402.07433
Autor:
Afsharrad, Amirhossein, Lall, Sanjay
This paper addresses the challenge of a particular class of noisy state observations in Markov Decision Processes (MDPs), a common issue in various real-world applications. We focus on modeling this uncertainty through a confusion matrix that capture
Externí odkaz:
http://arxiv.org/abs/2312.08536
Recently, bandit optimization has received significant attention in real-world safety-critical systems that involve repeated interactions with humans. While there exist various algorithms with performance guarantees in the literature, practical imple
Externí odkaz:
http://arxiv.org/abs/2311.04338
Satisfiability modulo theories (SMT) is a core tool in formal verification. While the SMT-LIB specification language can be used to interact with theorem proving software, a high-level interface allows for faster and easier specifications of complex
Externí odkaz:
http://arxiv.org/abs/2309.08778
Autor:
Landolfi, Nicholas C., Lall, Sanjay
We study Dorfman's classical group testing protocol in a novel setting where individual specimen statuses are modeled as exchangeable random variables. We are motivated by infectious disease screening. In that case, specimens which arrive together fo
Externí odkaz:
http://arxiv.org/abs/2308.11050