Discovering Multiple Algorithm Configurations
Not on the map. Why?
Abstract (arXiv)
Many practitioners in robotics regularly depend on classic, hand-designed algorithms. Often the performance of these algorithms is tuned across a dataset of annotated examples which represent typical deployment conditions. Automatic tuning of these settings is traditionally known as algorithm configuration. In this work, we extend algorithm configuration to automatically discover multiple modes in the tuning dataset. Unlike prior work, these configuration modes represent multiple dataset instances and are detected automatically during the course of optimization. We propose three methods for mode discovery: a post hoc method, a multi-stage method, and an online algorithm using a multi-armed bandit. Our results characterize these methods on synthetic test functions and in multiple robotics application domains: stereoscopic depth estimation, differentiable rendering, motion planning, and visual odometry. We show the clear benefits of detecting multiple modes in algorithm configuration space.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 58 references that are in the map. First posted on arXiv 13 Mar 2023.
Builds on
25 of 58 references.
References · 25
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
- 2018A Tutorial on Bayesian Optimizationcited by 734
- 2018Learning Dexterous In-Hand Manipulationcited by 643
- 2016Direct Sparse Odometrycited by 479
- 2017A Tutorial on Thompson Samplingcited by 420
- 2016The CMA Evolution Strategy: A Tutorialcited by 364
- 2016COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Settingcited by 135
- 2021Online Coreset Selection for Rehearsal-based Continual Learningcited by 114
- 2018The TUM VI Benchmark for Evaluating Visual-Inertial Odometrycited by 94
- 2014Reducing the Barrier to Entry of Complex Robotic Software: a MoveIt! Case Studycited by 86
- 2015Parallelizing the dual revised simplex methodcited by 83
13 more
- 2017Intel RealSense Stereoscopic Depth Camerascited by 82
- 2014Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristiccited by 50
- 2022Approximate Differentiable Rendering with Algebraic Surfacescited by 44
- 2022Automated Dynamic Algorithm Configurationcited by 37
- 2022A Survey of Methods for Automated Algorithm Configurationcited by 29
- 2021DACBench: A Benchmark Library for Dynamic Algorithm Configurationcited by 28
- 2017A minimax and asymptotically optimal algorithm for stochastic banditscited by 27
- 2022DM-VIO: Delayed Marginalization Visual-Inertial Odometrycited by 22
- 2018Balancing Global Exploration and Local-connectivity Exploitation with Rapidly-exploring Random disjointed-Treescited by 8
- 2021Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluationscited by 5
- 2021Leveraging Benchmarking Data for Informed One-Shot Dynamic Algorithm Selectioncited by 2
- 2021Procedural Kernel Networkscited by 2
- 2021sbp-env: Sampling-based Motion Planners' Testing Environmentcited by 1
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Optimizing Algorithms From Pairwise User Preferencescited by 3
- 2023Optimizing Algorithms From Pairwise User Preferences8 Aug 2023