Interpretable Trade-offs Between Robot Task Accuracy and Compute Efficiency

08/03/2021
by   Bineet Ghosh, et al.
0

A robot can invoke heterogeneous computation resources such as CPUs, cloud GPU servers, or even human computation for achieving a high-level goal. The problem of invoking an appropriate computation model so that it will successfully complete a task while keeping its compute and energy costs within a budget is called a model selection problem. In this paper, we present an optimal solution to the model selection problem with two compute models, the first being fast but less accurate, and the second being slow but more accurate. The main insight behind our solution is that a robot should invoke the slower compute model only when the benefits from the gain in accuracy outweigh the computational costs. We show that such cost-benefit analysis can be performed by leveraging the statistical correlation between the accuracy of fast and slow compute models. We demonstrate the broad applicability of our approach to diverse problems such as perception using neural networks and safe navigation of a simulated Mars rover.

READ FULL TEXT
research
07/13/2022

Dynamic Selection of Perception Models for Robotic Control

Robotic perception models, such as Deep Neural Networks (DNNs), are beco...
research
03/13/2013

Group-Sparse Model Selection: Hardness and Relaxations

Group-based sparsity models are proven instrumental in linear regression...
research
10/28/2020

Model Minimization For Online Predictability

For humans in a teaming scenario, context switching between reasoning ab...
research
09/04/2019

ModiPick: SLA-aware Accuracy Optimization For Mobile Deep Inference

Mobile applications are increasingly leveraging complex deep learning mo...
research
04/07/2020

Characterizing and Modeling Distributed Training with Transient Cloud GPU Servers

Cloud GPU servers have become the de facto way for deep learning practit...
research
02/28/2022

Fast and Compute-efficient Sampling-based Local Exploration Planning via Distribution Learning

Exploration is a fundamental problem in robotics. While sampling-based p...
research
10/03/2018

Inner Approximation of Minkowski Sums: A Union-Based Approach and Applications to Aggregated Energy Resources

This paper develops and compares algorithms to compute inner approximati...

Please sign up or login with your details

Forgot password? Click here to reset