Fetching the paper…
Reading the bibliography…
Path planning, the problem of efficiently discovering high-reward trajectories, often requires optimizing a high-dimensional and multimodal reward function.
Principal component analysis
Svante Wold, Kim Esbensen, and Paul Geladi · 1987
Earlier work this paper cites.
Smiles, a chemical language and information system. 1. introduction to methodology and encoding rules
David Weininger · 1988
Earlier work this paper cites.
Advanced compiler design implementation
Steven Muchnick et al · 1997
Earlier work this paper cites.
The cross-entropy method for combinatorial and continuous optimization
Reuven Rubinstein · 1999
Earlier work this paper cites.
Compiler optimization-space exploration
Spyridon Triantafyllis, Manish Vachharajani, Neil Vachharajani, and David I August · 2003
Earlier work this paper cites.
Iterative linear quadratic regulator design for nonlinear biological movement systems
Weiwei Li and Emanuel Todorov · 2004
Earlier work this paper cites.
Robust constrained model predictive control
Arthur George Richards · 2005
Earlier work this paper cites.
Fast and effective orchestration of compiler optimizations for automatic performance tuning
Zhelong Pan and Rudolf Eigenmann · 2006
Earlier work this paper cites.
Chstone: A benchmark program suite for practical c-based high-level synthesis
Yuko Hara, Hiroyuki Tomiyama, Shinya Honda, Hiroaki Takada, and Katsuya Ishii · 2008
Earlier work this paper cites.
Chomp: Gradient optimization techniques for efficient motion planning
Nathan Ratliff, Matt Zucker, J Andrew Bagnell, and Siddhartha Srinivasa · 2009
Earlier work this paper cites.
Eric Brochu, Vlad M Cora, and Nando De Freitas · 2010
Earlier work this paper cites.
Optimistic optimization of a deterministic function without the knowledge of its smoothness
Rémi Munos · 2011
Earlier work this paper cites.
A survey of monte carlo tree search methods
Cameron B Browne, Edward Powley, Daniel Whitehouse, Simon M Lucas, Peter I Cowling, Philipp Rohlfshagen, Stephen Tavener, Diego Perez, Spyridon Samothrakis, and Simon Colton · 2012
Earlier work this paper cites.
The cross-entropy method for optimization
Zdravko I Botev, Dirk P Kroese, Reuven Y Rubinstein, and Pierre L’Ecuyer · 2013
Earlier work this paper cites.
Opentuner: An extensible framework for program autotuning
Jason Ansel, Shoaib Kamil, Kalyan Veeramachaneni, Jonathan Ragan-Kelley, Jeffrey Bosboom, Una-May O’Reilly, and Saman Amarasinghe · 2014
Earlier work this paper cites.
Lipschitz bandits: Regret lower bound and optimal algorithms
Stefan Magureanu, Richard Combes, and Alexandre Proutiere · 2014
Earlier work this paper cites.
From bandits to monte-carlo tree search: The optimistic principle applied to optimization and planning
Rémi Munos · 2014
Earlier work this paper cites.
Density estimation using real nvp
Laurent Dinh, Jascha Sohl-Dickstein, and Samy Bengio · 2016
Earlier work this paper cites.
The cma evolution strategy: A tutorial
Nikolaus Hansen · 2016
Cited alongside, same era.
Sequential planning for steering immune system adaptation
Christian Kroer and Tuomas Sandholm · 2016
Cited alongside, same era.
Heuristic approaches in robot path planning: A survey
Thi Thoa Mac, Cosmin Copot, Duc Trung Tran, and Robin De Keyser · 2016
Cited alongside, same era.
Grammar variational autoencoder
Matt J Kusner, Brooks Paige, and José Miguel Hernández-Lobato · 2017
Cited alongside, same era.
Molecular de-novo design through deep reinforcement learning
Marcus Olivecrona, Thomas Blaschke, Ola Engkvist, and Hongming Chen · 2017
Cited alongside, same era.
Scalable global optimization via local bayesian optimization
David Eriksson, Michael Pearce, Jacob R Gardner, Ryan Turner, and Matthias Poloczek · 2019
Later among the works it cites.
Dream to control: Learning behaviors by latent imagination
Danijar Hafner, Timothy Lillicrap, Jimmy Ba, and Mohammad Norouzi · 2019
Later among the works it cites.
Learning latent dynamics for planning from pixels
Danijar Hafner, Timothy Lillicrap, Ian Fischer, Ruben Villegas, David Ha, Honglak Lee, and James Davidson · 2019
Later among the works it cites.
Introduction to multi-armed bandits
Aleksandrs Slivkins · 2019
Later among the works it cites.
Applications of machine learning in drug discovery and development
Jessica Vamathevan, Dominic Clark, Paul Czodrowski, Ian Dunham, Edgardo Ferran, George Lee, Bin Li, Anant Madabhushi, Parantu Shah, Michaela Spitzer, et al · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov · 2017
Cited alongside, same era.
gym-miniworld environment for openai gym
Maxime Chevalier-Boisvert · 2018
Cited alongside, same era.
Minimalistic gridworld environment for openai gym
Maxime Chevalier-Boisvert and Lucas Willems · 2018
Cited alongside, same era.
Deep reinforcement learning in a handful of trials using probabilistic dynamics models
Kurtland Chua, Roberto Calandra, Rowan McAllister, and Sergey Levine · 2018
Cited alongside, same era.
Syntax-directed variational autoencoder for structured data
Hanjun Dai, Yingtao Tian, Bo Dai, Steven Skiena, and Le Song · 2018
Cited alongside, same era.
Automatic chemical design using a data-driven continuous representation of molecules
Rafael Gómez-Bombarelli, Jennifer N Wei, David Duvenaud, José Miguel Hernández-Lobato, Benjamín Sánchez-Lengeling, Dennis Sheberla, Jorge Aguilera-Iparraguirre, Timothy D Hirzel, Ryan P Adams, and Alán Aspuru-Guzik · 2018
Cited alongside, same era.
Junction tree variational autoencoder for molecular graph generation
Wengong Jin, Regina Barzilay, and Tommi Jaakkola · 2018
Cited alongside, same era.
Later among the works it cites.
Exploring model-based planning with policy networks
Tingwu Wang and Jimmy Ba · 2019
Later among the works it cites.
Analyzing learned molecular representations for property prediction
Kevin Yang, Kyle Swanson, Wengong Jin, Connor Coley, Philipp Eiden, Hua Gao, Angel Guzman-Perez, Timothy Hopper, Brian Kelley, Miriam Mathea, et al · 2019
Later among the works it cites.
Mastering atari with discrete world models
Danijar Hafner, Timothy Lillicrap, Mohammad Norouzi, and Jimmy Ba · 2020
Later among the works it cites.
Autophase: Juggling hls phase orderings in random forests with deep reinforcement learning
Ameer Haj-Ali, Qijing Jenny Huang, John Xiang, William Moses, Krste Asanovic, John Wawrzynek, and Ion Stoica · 2020
Later among the works it cites.
Hierarchical generation of molecular graphs using structural motifs
Wengong Jin, Regina Barzilay, and Tommi Jaakkola · 2020
Later among the works it cites.
Autonomous molecular design by monte-carlo tree search and rapid evaluations using molecular dynamics simulations
Seiji Kajita, Tomoyuki Kinjo, and Tomoki Nishi · 2020
Later among the works it cites.
Monte carlo tree search in continuous spaces using voronoi optimistic optimization with regret bounds
Beomjoon Kim, Kyungjae Lee, Sungbin Lim, Leslie Kaelbling, and Tomas Lozano-Perez · 2020
Later among the works it cites.
Adaptive local bayesian optimization over multiple discrete variables
Taehyeon Kim, Jaeyeon Ahn, Nakyil Kim, and Seyoung Yun · 2020
Later among the works it cites.
Solving black-box optimization challenge via learning search space partition for local bayesian optimization
Mikita Sazanovich, Anastasiya Nikolskaya, Yury Belousov, and Aleksei Shpilman · 2020
Later among the works it cites.
Learning search space partition for black-box optimization using monte carlo tree search
Linnan Wang, Rodrigo Fonseca, and Yuandong Tian · 2020
Later among the works it cites.
Improving molecular design by stochastic iterative target augmentation
Kevin Yang, Wengong Jin, Kyle Swanson, Regina Barzilay, and Tommi Jaakkola · 2020
Later among the works it cites.
Sample-efficient neural architecture search by learning actions for monte carlo tree search
Linnan Wang, Saining Xie, Teng Li, Rodrigo Fonseca, and Yuandong Tian · 2021
Closest in time.