paper-with-me

홈 › Papers

DiCE: The Infinitely Differentiable Monte Carlo Estimator

2018-07-01 · ICML 2018 7 · Jakob Foerster, Gregory Farquhar, Maruan Al-Shedivat, Tim Rocktäschel, Eric Xing, Shimon Whiteson

The score function estimator is widely used for estimating gradients of stochastic objectives in stochastic computation graphs (SCG), eg., in reinforcement learning and meta-learning. While deriving the first-order gradient estimators by differentiating a surrogate loss (SL) objective is computationally and conceptually simple, using the same approach for higher-order derivatives is more challenging. Firstly, analytically deriving and implementing such estimators is laborious and not compliant with automatic differentiation. Secondly, repeatedly applying SL to construct new objectives for each order derivative involves increasingly cumbersome graph manipulations. Lastly, to match the first-order gradient under differentiation, SL treats part of the cost as a fixed sample, which we show leads to missing and wrong terms for estimators of higher-order derivatives. To address all these shortcomings in a unified way, we introduce DiCE, which provides a single objective that can be differentiated repeatedly, generating correct estimators of derivatives of any order in SCGs. Unlike SL, DiCE relies on automatic differentiation for performing the requisite graph manipulations. We verify the correctness of DiCE both through a proof and numerical evaluation of the DiCE derivative estimates. We also use DiCE to propose and evaluate a novel approach for multi-agent learning. Our code is available at https://github.com/alshedivat/lola.

📄 PDF Abstract BibTeX

Code (1)

alshedivat/lola 공식 구현 tf

Tasks

Meta-LearningReinforcement Learning

Similar Papers 제목 키워드 기반

A Better Baseline for Second Order Gradient Estimation in Stochastic Computation Graphs

2018-09-27 · Jingkai Mao, Jakob Foerster, Tim Rocktäschel, Gregory Farquhar 외

Motivated by the need for higher order gradients in multi-agent reinforcement learning and meta-learning, this paper studies the construction of baselines for second order Monte Carlo gradient estimators in order to redu…

Meta-LearningMulti-agent Reinforcement Learningreinforcement-learningReinforcement Learning+1

DiCE: The Infinitely Differentiable Monte-Carlo Estimator

2018-02-14 · Jakob Foerster, Gregory Farquhar, Maruan Al-Shedivat, Tim Rocktäschel 외

The score function estimator is widely used for estimating gradients of stochastic objectives in stochastic computation graphs (SCG), eg, in reinforcement learning and meta-learning. While deriving the first-order gradie…

Meta-LearningReinforcement Learning

Monte Carlo estimators of first-and total-orders Sobol' indices

2020-06-15 · Ivano Azzini, Thierry Mara, Rossana Rosati

This study compares the performances of two sampling-based strategies for the simultaneous estimation of the first-and total-orders variance-based sensitivity indices (a.k.a Sobol' indices). The first strategy was introd…

Sensitivity

Variational Marginal Particle Filters

2021-09-30 · Jinlin Lai, Justin Domke, Daniel Sheldon

Variational inference for state space models (SSMs) is known to be hard in general. Recent works focus on deriving variational objectives for SSMs from unbiased sequential Monte Carlo estimators. We reveal that the margi…

State Space ModelsVariational Inference

Automated Efficient Estimation using Monte Carlo Efficient Influence Functions

2024-02-29 · Raj Agrawal, Sam Witty, Andy Zane, Eli Bingham

Many practical problems involve estimating low dimensional statistical quantities with high-dimensional models and datasets. Several approaches address these estimation tasks based on the theory of influence functions, s…

Probabilistic Programming