Carnegie Mellon University
Diversity-enabled sweet spot in layered architectures and speed-accuracy tradeoffs in sensorimotor control

Nervous systems sense, communicate, compute, and actuate movement using distributed components with trade-offs in speed, accuracy, sparsity, noise, and saturation. Nevertheless, the resulting control can achieve remarkably fast, accurate, and robust performance due to a highly effective layered control architecture. However, there is no theory explaining the effectiveness of layered control architectures that connects speed-accuracy trade-offs (SATs) in neurophysiology to the resulting SATs in sensorimotor control. In this paper, we introduce a theoretical framework that provides a synthetic perspective to explain why there exists extreme diversity across layers and within levels. This framework characterizes how the sensorimotor control SATs are constrained by the hardware SATs of neurons communicating with spikes and their sensory and muscle endpoints, in both stochastic and deterministic models. The theoretical predictions of the model are experimentally confirmed using driving experiments in which the time delays and accuracy of the control input from the wheel are varied. These results show that the appropriate diversity in the properties of neurons and muscles across layers and within levels help create systems that are both fast and accurate despite being built from components that are individually slow or inaccurate. This novel concept, which we call "diversity-enabled sweet spots" (DESSs), explains the ubiquity of heterogeneity in the sizes of axons within a nerve as well the resulting superior performance of sensorimotor control. [Link to the paper]

Minimal-variance distributed deadline scheduling
Many modern schedulers can dynamically adjust their service capacity to match the incoming workload. At the same time, however, unpredictability and instability in service capacity often incur operational and infrastructure costs. In this paper, we seek to characterize optimal distributed algorithms that maximize the predictability, stability, or both when scheduling jobs with deadlines. Specifically, we show that Exact Scheduling minimizes both the stationary mean and variance of the service capacity subject to strict demand and deadline requirements. For more general settings, we characterize the minimal-variance distributed policies with soft demand requirements, soft deadline requirements, or both. The performance of the optimal distributed policies is compared to that of the optimal centralized policy by deriving closed-form bounds and by testing centralized and distributed algorithms using real data from the Caltech electrical vehicle charging facility and many pieces of synthetic data from different arrival distribution. Moreover, we derive the Pareto-optimality condition for distributed policies that balance the variance and mean square of the service capacity. Finally, we discuss a scalable partially-centralized algorithm that uses centralized information to boost performance and a method to deal with missing information on service requirements. [Link to the paper]