Derivative-free optimization of high-dimensional non-convex functions by sequential random embeddings
IJCAI'16, 2016. [All Versions].
- from
- AGI & CoCoSci
- added
- 2026-10-10
- likes
- 0
similar
-
Generalized Inverse Planning: Learning Lifted non-Markovian Utility for Generalizable Task Representation export.arxiv.org
2020. [All Versions].
-
Metacontrol for Adaptive Imagination-Based Optimization openreview.net
ICLR'17, 2017. [All Versions].
-
Unsupervised Representaton Learning with Deep Convolutional Generative Adversarial Networks arxiv.org
ICLR'16, 2016. [All Versions].
-
When to Trust Your Model: Model-Based Policy Optimization proceedings.neurips.cc
NeurIPS'19, 2019. [All Versions]. [Post].
-
Analysis of Langevin Monte Carlo via Convex Optimization jmlr.org
Journal of Machine Learning Research, 2019. [All Versions]. This paper provides new insights on the Unadjusted Langevin Algorithm. The authors show that this method can be formulated as the first order optimization algorithm for an objective functional defined on the…
-
Latent Space Factorisation and Manipulation via Matrix Subspace Projection proceedings.mlr.press
ICML'20, 2020. [All Versions].
AGI & CoCoSci › Papers > Inductive Logic & Program Synthesis: “IJCAI'16, 2016. [All Versions].”