kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Bayesian Optimization in Variational Latent Spaces with Dynamic Compression
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Robotics, Perception and Learning, RPL. KTH, School of Electrical Engineering and Computer Science (EECS), Centres, Centre for Autonomous Systems, CAS.ORCID iD: 0000-0002-3018-2445
Facebook AI Research, Facebook AI Research.
Facebook AI Research, Facebook AI Research.
KTH, School of Electrical Engineering and Computer Science (EECS), Centres, Centre for Autonomous Systems, CAS.ORCID iD: 0000-0003-2965-2953
2019 (English)In: Proceedings of the Conference on Robot Learning, CoRL 2019, ML Research Press , 2019, p. 456-465Conference paper, Published paper (Refereed)
Abstract [en]

Data-efficiency is crucial for autonomous robots to adapt to new tasks and environments. In this work, we focus on robotics problems with a budget of only 10-20 trials. This is a very challenging setting even for data-efficient approaches like Bayesian optimization (BO), especially when optimizing higher-dimensional controllers. Previous work extracted expert-designed low-dimensional features from simulation trajectories to construct informed kernels and run ultra sample-efficient BO on hardware. We remove the need for expert-designed features by proposing a model and architecture for a sequential variational autoencoder that embeds the space of simulated trajectories into a lower-dimensional space of latent paths in an unsupervised way. We further compress the search space for BO by reducing exploration in parts of the state space that are undesirable, without requiring explicit constraints on controller parameters. We validate our approach with hardware experiments on a Daisy hexapod robot and an ABB Yumi manipulator. We also present simulation experiments with further comparisons to several baselines on Daisy and two manipulators. Our experiments indicate the proposed trajectory-based kernel with dynamic compression can offer ultra data-efficient optimization.

Place, publisher, year, edition, pages
ML Research Press , 2019. p. 456-465
Keywords [en]
Bayesian Optimization, Data-efficient Reinforcement Learning, Variational Inference
National Category
Robotics and automation
Identifiers
URN: urn:nbn:se:kth:diva-347959Scopus ID: 2-s2.0-85160868603OAI: oai:DiVA.org:kth-347959DiVA, id: diva2:1881516
Conference
3rd Conference on Robot Learning, CoRL 2019, Osaka, Japan, Oct 30 2019 - Nov 1 2019
Note

QC 20240703

Available from: 2024-07-03 Created: 2024-07-03 Last updated: 2025-02-09Bibliographically approved

Open Access in DiVA

No full text in DiVA

Scopus

Authority records

Antonova, RikaKragic, Danica

Search in DiVA

By author/editor
Antonova, RikaKragic, Danica
By organisation
Robotics, Perception and Learning, RPLCentre for Autonomous Systems, CAS
Robotics and automation

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 72 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf