summaries: This paper generalizes the recent state-of-the-art behavior agnostic off-policy evaluation DualDice into a more general optimization framework: GenDice. Similar to DualDice, GenDice considers distribution correction over state, action pairs rather than state in Liu et al. (2018), which can handle behavior-agnostic settings. The optimization framework (in equation (9)) is novel and neat, and the practical algorithm seems more powerful than the previous DualDice. As a side product, it can also use to solve offline page rank problem.

summaries: This paper proposes a new estimator to infer the stationary distribution of a Markov chain, with data from another Markov chain. The method estimates the ratio between stationary distribution of target MC and the empirical data distribution.  It is based on the observation that the ratio is a fixed point solution to certain operators. The proposed method could work in the behavior-agnostic and undiscounted case, which is unsolved by the previous method.

summaries: In this paper the authors proposed a framework for off-policy value estimation under the scenario of infinite horizon RL tasks. The new proposed method utilize the variational representation of $f$-divergence, which quantifies the difference between $\mathcal{T}\tau$ and $\tau p$, where $\tau$ is the parametric density ratio between the unknown behavior policy data and the target policy. If only if $\tau$ is the true density ratio, the loss $\mathcal{D}_{f}(\mathcal{T}\tau || \tau p) = 0$.

abstractText: An important problem that arises in reinforcement learning and Monte Carlo methods is estimating quantities defined by the stationary distribution of a Markov chain. In many real-world applications, access to the underlying transition operator is limited to a fixed set of data that has already been collected, without additional interaction with the environment being available. We show that consistent estimation remains possible in this challenging scenario, and that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions, derived from fundamental properties of the stationary distribution, and exploiting constraint reformulations based on variational divergence minimization. The resulting algorithm, GenDICE, is straightforward and effective. We prove its consistency under general conditions, provide an error analysis, and demonstrate strong empirical performance on benchmark problems, including off-line PageRank and off-policy policy evaluation.

authors:
Christophe Andrieu
Nando de Freitas
Arnaud Doucet
Michael I. Jordan

title: An introduction to MCMC for machine learning

venue: Machine Learning,

authors:
András Antos
Csaba Szepesvári
Rémi Munos

title: Learning near-optimal policies with bellmanresidual minimization based fitted policy iteration and a single sample path

title: Breaking the curse of dimensionality with convex neural networks

title: Residual algorithms: reinforcement learning with function approximation

venue: In Proc. Intl. Conf. Machine Learning,

authors:
Steffen Bickel
Michael Brückner
Tobias Scheffer

title: Discriminative learning for differing training and test distributions

venue: In Proceedings of the 24th international conference on Machine learning,

authors:
Léon Bottou
Jonas Peters
Joaquin Quiñonero-Candela
Denis Xavier Charles
D. Max Chickering
Elon Portugaly
Dipankar Ray
Patrice Simard
Ed Snelson

title: Counterfactual reasoning and learning systems: The example of computational advertising

venue: Journal of Machine Learning Research,

authors:
Steve Brooks
Andrew Gelman
Galin Jones
Xiao-Li Meng

title: Handbook of markov chain monte carlo

venue: CRC press,

authors:
Bo Dai
Niao He
Yunpeng Pan
Byron Boots
Le Song

title: Learning from conditional distributions via dual embeddings

authors:
Bo Dai
Albert Shaw
Lihong Li
Lin Xiao
Niao He
Zhen Liu
Jianshu Chen
Le Song

title: SBEED: Convergent reinforcement learning with nonlinear function approximation

venue: In Proceedings of the 35th International Conference on Machine Learning (ICML),

authors:
Miroslav Dudı́k
John Langford
Lihong Li

title: Doubly robust policy evaluation and learning

venue: In Proceedings of the 28th International Conference on Machine Learning (ICML),

title: Real analysis and probability

authors:
Carles Gelada
Marc G Bellemare

title: Off-policy deep reinforcement learning by bootstrapping the covariate shift

venue: In Proceedings of the AAAI Conference on Artificial Intelligence,

authors:
Andrew Gelman
John B Carlin
Hal S Stern
David B Dunson
Aki Vehtari
Donald B Rubin

title: Bayesian data analysis

venue: Chapman and Hall/CRC,

authors:
A. Gretton
K. Borgwardt
M. Rasch
B. Schoelkopf
A. Smola

title: A kernel two-sample test

authors:
Arthur Gretton
Alexander J. Smola
Jiayuan Huang
Marcel Schmittfull
Karsten Borgwardt
Bernhard Schölkopf

title: Dataset shift in machine learning

authors:
Ishaan Gulrajani
Faruk Ahmed
Martin Arjovsky
Vincent Dumoulin
Aaron C Courville

title: Improved training of wasserstein gans

venue: In Advances in Neural Information Processing Systems,

authors:
Zhaohan Guo
Philip S Thomas
Emma Brunskill

title: Using options and covariance testing for long horizon off-policy policy evaluation

title: Sphere packing numbers for subsets of the Boolean n-cube with bounded VapnikChervonenkis dimension

venue: J. Combinatorial Theory (A),

authors:
Nan Jiang
Lihong Li

title: Doubly robust off-policy value evaluation for reinforcement learning

venue: In Proceedings of the 33rd International Conference on Machine Learning (ICML),

authors:
Chi Jin
Praneeth Netrapalli
Michael I Jordan

title: Minmax optimization: Stable limit points of gradient descent ascent are locally optimal

authors:
Takafumi Kanamori
Shohei Hido
Masashi Sugiyama

title: A least-squares approach to direct importance estimation

authors:
Guanghui Lan
Zhiqiang Zhou

title: Algorithms for stochastic optimization with expectation constraints

venue: arXiv preprint arXiv:1604.03887,

authors:
Amy N. Langville
Carl D. Meyer

title: Deeper inside PageRank

venue: Internet Mathematics,

authors:
Alessandro Lazaric
Mohammad Ghavamzadeh
Rémi Munos

title: Finite-sample analysis of leastsquares policy iteration

authors:
Chun-Liang Li
Wei-Cheng Chang
Yu Cheng
Yiming Yang
Barnabas Poczos

title: Mmd gan: Towards deeper understanding of moment matching network

authors:
Chunyuan Li
Ke Bai
Jianqiao Li
Guoyin Wang
Changyou Chen
Lawrence Carin

title: Adversarial learning of a sampler based on an unnormalized distribution

authors:
Timothy P Lillicrap
Jonathan J Hunt
Alexander Pritzel
Nicolas Heess
Tom Erez
Yuval Tassa
David Silver
Daan Wierstra

title: Continuous control with deep reinforcement learning

venue: arXiv preprint arXiv:1509.02971,

authors:
Qihang Lin
Mingrui Liu
Hassan Rafique
Tianbao Yang

title: Solving weakly-convex-weaklyconcave saddle-point problems as weakly-monotone variational inequality

venue: arXiv preprint arXiv:1810.10207,

authors:
Tianyi Lin
Chi Jin
Michael I. Jordan

title: On gradient descent ascent for nonconvex-concave minimax problems

authors:
Mario Lucic
Karol Kurach
Marcin Michalski
Sylvain Gelly
Olivier Bousquet

title: Are gans created equal? a large-scale study

venue: In Advances in neural information processing systems,

authors:
David G. Luenberger
Yinyu Ye

title: Linear and Nonlinear Programming

authors:
Sean P Meyn
Richard L Tweedie

title: Markov chains and stochastic stability

venue: Springer Science & Business Media,

authors:
Volodymyr Mnih
Koray Kavukcuoglu
David Silver
Alex Graves
Ioannis Antonoglou
Daan Wierstra
Martin Riedmiller

title: Playing atari with deep reinforcement learning

venue: arXiv preprint arXiv:1312.5602,

title: Integral probability metrics and their generating classes of functions

venue: Advances in Applied Probability,

authors:
Ofir Nachum
Yinlam Chow
Bo Dai
Lihong Li

title: DualDICE: Behavior-agnostic estimation of discounted stationary distribution corrections

authors:
A. Nemirovski
A. Juditsky
G. Lan
A. Shapiro

title: Robust stochastic approximation approach to stochastic programming

venue: SIAM J. on Optimization,

authors:
X.L. Nguyen
M. Wainwright
M. Jordan

title: Estimating divergence functionals and the likelihood ratio by penalized convex risk minimization

venue: In Advances in Neural Information Processing Systems

authors:
Sebastian Nowozin
Botond Cseke
Ryota Tomioka

title: f-gan: Training generative neural samplers using variational divergence minimization

authors:
Lawrence Page
Sergey Brin
Rajeev Motwani
Terry Winograd

title: The pagerank citation ranking: Bringing order to the web

venue: Technical report, Stanford InfoLab,

title: Convergence of stochastic processes

authors:
Doina Precup
R.S. Sutton
S. Singh

title: Eligibility traces for off-policy policy evaluation

authors:
Doina Precup
Richard S. Sutton
Sanjoy Dasgupta

title: Off-policy temporal-difference learning with funtion approximation

venue: In Proceedings of the 18th Conference on Machine Learning (ICML),

title: Markov decision processes: discrete stochastic dynamic programming

authors:
Shai Shalev-Shwartz
Shai Ben-David

title: Understanding Machine Learning: From Theory to Algorithms

authors:
Alexander Shapiro
Darinka Dentcheva

title: Lectures on stochastic programming: modeling and theory, volume 16

authors:
A.J. Smola
A. Gretton
K. Borgwardt

title: Maximum mean discrepancy

venue: In Proc. Annual Conf. Computational Learning Theory,

authors:
Jiaming Song
Shengjia Zhao
Stefano Ermon

title: A-nice-mc: Adversarial training for mcmc

authors:
B. Sriperumbudur
K. Fukumizu
A. Gretton
B. Schoelkopf
G. Lanckriet

title: On integral probability metrics, φ-divergences and binary classification

venue: Technical Report arXiv:0901.2698v4,

authors:
Alex Strehl
John Langford
Lihong Li
Sham M Kakade

title: Learning from logged implicit exploration data

authors:
M. Sugiyama
S. Nakajima
H. Kashima
P. von Bünau
M. Kawanabe

title: Direct importance estimation with model selection and its application to covariate shift adaptation

authors:
Richard S Sutton
Csaba Szepesvári
Alborz Geramifard
Michael P Bowling

title: Dynastyle planning with linear function approximation and prioritized sweeping

venue: arXiv preprint arXiv:1206.3285,

authors:
R.S. Sutton
A.G. Barto

title: Reinforcement Learning: An Introduction

authors:
Philip Thomas
Emma Brunskill

title: Data-efficient off-policy policy evaluation for reinforcement learning

authors:
John N. Tsitsiklis
Benjamin Van Roy

title: An analysis of temporal-difference learning with function approximation

venue: IEEE Transactions on Automatic Control,

authors:
Dilin Wang
Qiang Liu

title: Learning to draw samples: With application to amortized mle for generative adversarial learning

venue: arXiv preprint arXiv:1611.01722,

authors:
Yu-Xiang Wang
Alekh Agarwal
Miroslav Dudik

title: Optimal and adaptive off-policy evaluation in contextual bandits

venue: In ICML,

title: Rates of convergence of empirical processes for mixing sequences

venue: Annals of Probability,

venue: Nachum et al.,

title: Notice our estimator minτ∈Hmaxf∈F,u∈U Ĵ (τ, u, f) is compatible with different parametrizations for (H,F) and different optimization algorithms, the optimization error will be different. For the general neural network for (τ, f), although there are several progress recently (Lin et al., 2018

venue: Jin et al.,

title: 2018) perform a similar exact solve for |S| variables μ(s), for better compar

heading: 1 INTRODUCTION

text:
Estimation of quantities defined by the stationary distribution of a Markov chain lies at the heart of many scientific and engineering problems. Famously, the steady-state distribution of a random walk on the World Wide Web provides the foundation of the PageRank algorithm (Langville & Meyer, 2004). In many areas of machine learning, Markov chain Monte Carlo (MCMC) methods are used to conduct approximate Bayesian inference by considering Markov chains whose equilibrium distribution is a desired posterior (Andrieu et al., 2002). An example from engineering is queueing theory, where the queue lengths and waiting time under the limiting distribution have been extensively studied (Gross et al., 2018). As we will also see below, stationary distribution quantities are of fundamental importance in reinforcement learning (RL) (e.g., Tsitsiklis & Van Roy, 1997).
Classical algorithms for estimating stationary distribution quantities rely on the ability to sample next states from the current state by directly interacting with the environment (as in on-line RL or MCMC), or even require the transition probability distribution to be given explicitly (as in PageRank). Unfortunately, these classical approaches are inapplicable when direct access to the environment is not available, which is often the case in practice. There are many practical scenarios where a collection of sampled trajectories is available, having been collected off-line by an external mechanism that chose states and recorded the subsequent next states. Given such data, we still wish to estimate a stationary quantity. One important example is off-policy policy evaluation in RL, where we wish to estimate the value of a policy different from that used to collect experience. Another example is off-line PageRank (OPR), where we seek to estimate the relative importance of webpages given a sample of the web graph.
Motivated by the importance of these off-line scenarios, and by the inapplicability of classical methods, we study the problem of off-line estimation of stationary values via a stationary distribution corrector. Instead of having access to the transition probabilities or a next-state sampler, we assume only access to a fixed sample of state transitions, where states have been sampled from an unknown distribution and next-states are sampled according to the Markov chain’s transition operator. The
∗Equal contribution. †Work done while interning at Google.
off-line setting is indeed more challenging than its more traditional on-line counterpart, given that one must infer an asymptotic quantity from finite data. Nevertheless, we develop techniques that still allow consistent estimation under general conditions, and provide effective estimates in practice. The main contributions of this work are:
• We formalize the problem of off-line estimation of stationary quantities, which captures a wide range of practical applications.
• We propose a novel stationary distribution estimator, GenDICE, for this task. The resulting algorithm is based on a new dual embedding formulation for divergence minimization, with a carefully designed mechanism that explicitly eliminates degenerate solutions.
• We theoretically establish consistency and other statistical properties of GenDICE, and empirically demonstrate that it achieves significant improvements on several behavior-agnostic offpolicy evaluation benchmarks and an off-line version of PageRank.
The methods we develop in this paper fundamentally extend recent work in off-policy policy evaluation (Liu et al., 2018; Nachum et al., 2019) by introducing a new formulation that leads to a more general, and as we will show, more effective estimation method.

heading: 2 BACKGROUND

text:
We first introduce off-line PageRank (OPR) and off-policy policy evaluation (OPE) as two motivating domains, where the goal is to estimate stationary quantities given only off-line access to a set of sampled transitions from an environment.
Off-line PageRank (OPR) The celebrated PageRank algorithm (Page et al., 1999) defines the ranking of a web page in terms of its asymptotic visitation probability under a random walk on the (augmented) directed graph specified by the hyperlinks. If we denote the World Wide Web by a directed graph G = (V,E) with vertices (web pages) v ∈ V and edges (hyperlinks) (v, u) ∈ E, PageRank considers the random walk defined by the Markov transition operator v → u:
P (u|v) = (1−η)|v| 1(v,u)∈E + η |V | , (1)
where |v| denotes the out-degree of vertex v and η ∈ [0, 1) is a probability of “teleporting” to any page uniformly. Define dt (v) := P (st = v|s0 ∼ µ0,∀i < t, si+1 ∼ P(·|si)), where µ0 is the initial distribution over vertices, then the original PageRank algorithm explicitly iterates for the limit
d (v) :=
{ limt→∞ dt (v) if γ = 1
(1− γ) ∑∞ t=0 γ tdt (v) if γ ∈ (0, 1) . (2)
The classical version of this problem is solved by tabular methods that simulate Equation 1. However, we are interested in a more scalable off-line version of the problem where the transition model is not explicitly given. Instead, consider estimating the rank of a particular web page v′ from a large web graph, given only a sampleD = {(v, u)i} N i=1 from a random walk on G as specified above. We would still like to estimate d(v′) based on this data. First, note that if one knew the distribution p by which any vertex v appeared in D, the target quantity could be re-expressed by a simple importance ratio d (v′) = Ev∼p [ d(v) p(v)1v=v′ ] . Therefore, if one had the correction ratio function τ (v) = d(v)p(v) , an estimate of d (v′) can easily be recovered via d (v′) ≈ p̂ (v′) τ (v′), where p̂ (v′) is the empirical probability of v′ estimated from D. The main attack on the problem we investigate is to recover a good estimate of the ratio function τ .
Policy Evaluation An important generalization of this stationary value estimation problem arises in RL in the form of policy evaluation. Consider a Markov Decision Process (MDP) M = 〈S,A,P, R, γ, µ0〉 (Puterman, 2014), where S is a state space, A is an action space, P (s′|s, a) denotes the transition dynamics, R is a reward function, γ ∈ (0, 1] is a discounted factor, and µ0 is the initial state distribution. Given a policy, which chooses actions in any state s according to the probability distribution π(·|s), a trajectory β = (s0, a0, r0, s1, a1, r1, . . .) is generated by first sampling the initial state s0 ∼ µ0, and then for t ≥ 0, at ∼ π(·|st), rt ∼ R(st, at), and st+1 ∼ P(·|st, at). The value of a policy π is the expected per-step reward defined as:
Average: R(π) := limT→∞ 1T+1E [∑T t=0 rt ] , Discounted: Rγ(π) := (1−γ)E [ ∑∞ t=0 γ trt] . (3)
In the above, the expectation is taken with respect to the randomness in the state-action pair P (s′|s, a)π (a′|s′) and the reward R (st, at). Without loss of generality, we assume the limit exists for the average case, and henceR(π) is finite.
Behavior-agnostic Off-Policy Evaluation (OPE) An important setting of policy evaluation that often arises in practice is to estimateRγ (π) orR (π) given a fixed datasetD = {(s, a, r, s′)i} N i=1 ∼ P (s′|s, a) p (s, a), where p (s, a) is an unknown distribution induced by multiple unknown behavior policies. This problem is different from the classical form of OPE, where it is assumed that a known behavior policy πb is used to collect transitions. In the behavior-agnostic scenario, however, typical importance sampling (IS) estimators (e.g., Precup et al., 2000) do not apply. Even if one can assume D consists of trajectories where the behavior policy can be estimated from data, it is known that that straightforward IS estimators suffer a variance exponential in the trajectory length, known as the “curse of horizon” (Jiang & Li, 2016; Liu et al., 2018).
Let dπt (s, a) = P (st = s, at = a|s0 ∼ µ0,∀i < t, ai ∼ π (·|si) , si+1 ∼ P(·|si, ai)). The stationary distribution can then be defined as
µπγ (s, a) :=
{ limT→∞ 1 T+1 ∑T t=0 d π t (s, a) = limt→∞ d π t (s, a) if γ = 1
(1− γ) ∑∞ t=0 γ tdπt (s, a) if γ ∈ (0, 1) . (4)
With this definition,R(π) andRγ (π) can be equivalently re-expressed as Rγ(π) := Eµπγ [R (s, a)] = Ep
[ µπγ (s,a) p(s,a) R (s, a) ] . (5)
Here we see once again that if we had the correction ratio function τ (s, a) = µπγ (s,a)
p(s,a) a straightforward estimate of Rγ(π) could be recovered via Rγ(π) ≈ Ep̂ [τ (s, a)R (s, a)], where p̂ (s, a) is an empirical estimate of p (s, a). In this way, the behavior-agnostic OPE problem can be reduced to estimating the correction ratio function τ , as above.
We note that Liu et al. (2018) and Nachum et al. (2019) also exploit Equation 5 to reduce OPE to stationary distribution correction, but these prior works are distinct from the current proposal in different ways. First, the inverse propensity score (IPS) method of Liu et al. (2018) assumes the transitions are sampled from a single behavior policy, which must be known beforehand; hence that approach is not applicable in behavior-agnostic OPE setting. Second, the recent DualDICE algorithm (Nachum et al., 2019) is also a behavior-agnostic OPE estimator, but its derivation relies on a change-of-variable trick that is only valid for γ < 1. This previous formulation becomes unstable when γ → 1, as shown in Section 6 and Appendix E. The behavior-agnostic OPE estimator we derive below in Section 3 is applicable both when γ = 1 and γ ∈ (0, 1). This connection is why we name the new estimator GenDICE, for GENeralized stationary DIstribution Correction Estimation.

heading: 3 GENDICE

text: As noted, there are important estimation problems in the Markov chain and MDP settings that can be recast as estimating a stationary distribution correction ratio. We first outline the conditions that characterize the correction ratio function τ , upon which we construct the objective for the GenDICE estimator, and design efficient algorithm for optimization. We will develop our approach for the more general MDP setting, with the understanding that all the methods and results can be easily specialized to the Markov chain setting.

heading: 3.1 ESTIMATING STATIONARY DISTRIBUTION CORRECTION

text:
The stationary distribution µπγ defined in Equation 4 can also be characterized via µ (s′, a′) = (1− γ)µ0 (s′)π (a′|s′) + γ ∫ π (a′|s′)P (s′|s, a)µ (s, a) ds da︸ ︷︷ ︸
(T ◦µ)(s′,a′)
, ∀ (s′, a′) ∈ S ×A. (6)
At first glance, this equation shares a superficial similarity to the Bellman equation, but there is a fundamental difference. The Bellman operator recursively integrates out future (s′, a′) pairs to characterize a current pair (s, a) value, whereas the distribution operator T defined in Equation 6 operates in the reverse temporal direction.
When γ < 1, Equation 6 always has a fixed-point solution. For γ = 1, in the discrete case, the fixedpoint exists as long as T is ergodic; in the continuous case, the conditions for fixed-point existence become more complicated (Meyn & Tweedie, 2012) and beyond the scope of this paper.
The development below is based on a divergence D and the following default assumption. Assumption 1 (Markov chain regularity) For the given target policy π, the resulting state-action transition operator T has a unique stationary distribution µ that satisfies D(T ◦ µ‖µ) = 0.
In the behavior-agnostic setting we consider, one does not have direct access to P for element-wise evaluation or sampling, but instead is given a fixed set of samples from P (s′|s, a) p (s, a) with respect to some distribution p (s, a) over S×A. Define T pγ,µ0 to be a mixture of µ0π and Tp; i.e., let
T pγ,µ0 ((s ′, a′) , (s, a)) := (1− γ)µ0 (s′)π (a′|s′) + γ π (a′|s′)P (s′|s, a) p (s, a)︸ ︷︷ ︸
Tp((s′,a′),(s,a))
. (7)
Obviously, conditioning on (s, a, s′) one could easily sample a′ ∼ π (a′|s′) to form (s, a, s′, a′) ∼ Tp ((s′, a′) , (s, a)); similarly, a sample (s′, a′) ∼ µ0 (s′)π (a′|s′) could be formed from s′. Mixing such samples with probability γ and 1 − γ respectively yields a sample (s, a, s′, a′) ∼ T pγ,µ0 ((s
′, a′) , (s, a)). Based on these observations, the stationary condition for the ratio from Equation 6 can be re-expressed in terms of T pγ,µ0 as
p (s′, a′) τ∗ (s′, a′) = (1− γ)µ0 (s′)π (a′|s′) + γ ∫ π (a′|s′)P (s′|s, a) p (s, a) τ∗ (s, a) ds da︸ ︷︷ ︸
(T pγ,µ0◦τ∗)(s′,a′)
, (8)
where τ∗ (s, a) := µ(s,a)p(s,a) is the correction ratio function we seek to estimate. One natural approach to estimating τ∗ is to match the LHS and RHS of Equation 8 with respect to some divergenceD (·‖·) over the empirical samples. That is, we consider estimating τ∗ by solving the optimization problem
min τ≥0
D ( T pγ,µ0 ◦ τ‖p · τ ) . (9)
Although this forms the basis of our approach, there are two severe issues with this naive formulation that first need to be rectified:
i) Degenerate solutions: When γ = 1, the operator T pγ=1,µ0 is invariant to constant rescaling: if τ∗ = T pγ=1,µ0 ◦ τ ∗ then cτ∗ = T pγ=1,µ0 ◦ (cτ ∗) for any c ≥ 0. Therefore, simply minimizing the
divergence D ( T pγ=1,µ0 ◦ τ‖p · τ ) cannot provide a desirable estimate of τ∗. In fact, in this case
the trivial solution τ∗ (s, a) = 0 cannot be eliminated. ii) Intractable objective: The divergence D ( T pγ,µ0 ◦ τ‖p · τ ) involves the computation of T pγ,µ0 ◦
τ , which in general involves an intractable integral. Thus, evaluation of the exact objective is intractable, and neglects the assumption that we only have access to samples from T pγ,µ0 and are not able to evaluate it at arbitrary points.
We address each of these two issues in a principled manner.

heading: 3.2 ELIMINATING DEGENERATE SOLUTIONS

text:
To avoid degenerate solutions when γ = 1, we ensure that the solution is a proper density ratio; that is, the property τ ∈ Ξ := {τ (·) ≥ 0,Ep [τ ] = 1} must be true of any τ that is a ratio of some density to p. This provides an additional constraint that we add to the optimization formulation
min τ≥0
D ( T pγ,µ0 ◦ τ‖p · τ ) , s.t., Ep [τ ] = 1. (10)
With this additional constraint, it is obvious that the trivial solution τ (s, a) = 0 is eliminated as an infeasible point of Eqn (10), along with other degenerate solutions τ (s, a) = cτ∗ (s, a) with c 6= 1. Unfortunately, exactly solving an optimization with expectation constraints is very complicated in general (Lan & Zhou, 2016), particularly given a nonlinear parameterization for τ . The penalty method (Luenberger & Ye, 2015) provides a much simpler alternative, where a sequence of regularized problems are solved
min τ≥0
J (τ) := D ( T pγ,µ0 ◦ τ‖p · τ ) + λ2 (Ep [τ ]− 1) 2 , (11)
with λ increasing. The drawback of the penalty method is that it generally requires λ→∞ to ensure the strict feasibility, which is still impractical, especially in stochastic gradient descent. The infinite λ may induce unbounded variance in the gradient estimator, and thus, divergence in optimization. However, by exploiting the special structure of the solution sets to Equation 11, we can show that, remarkably, it is unnecessary to increase λ.
Theorem 1 For γ ∈ (0, 1] and any λ > 0, the solution to Equation 11 is given by τ∗ (s, a) = u(s,a)p(s,a) .
The detailed proof for Theorem 1 is given in Appendix A.1. By Theorem 1, we can estimate the desired correction ratio function τ∗ by solving only one optimization with an arbitrary λ > 0.

heading: 3.3 EXPLOITING DUAL EMBEDDING

text:
The optimization in Equation 11 involves the integrals ( T pγ,µ0 ◦ τ ) and Ep [τ ] inside nonlinear loss functions, hence appears difficult to solve. Moreover, obtaining unbiased gradients with a naive approach requires double sampling (Baird, 1995). Instead, we bypass both difficulties by applying a dual embedding technique (Dai et al., 2016; 2018). In particular, we assume the divergence D is in the form of an f -divergence (Nowozin et al., 2016)
Dφ (( T pγ,µ0 ◦ τ ) ‖p · τ ) := ∫ p · τ (s, a)φ
( (T pγ,µ0◦τ)(s,a)
p·τ(s,a)
) ds da
where φ (·) : R+ → R is a convex, lower-semicontinuous function with φ (1) = 0. Plugging this into J (τ) in Equation 11 we can easily check the convexity of the objective
Theorem 2 For an f -divergence with valid φ defining Dφ, the objective J (τ) is convex w.r.t. τ .
The detailed proof is provided in Appendix A.2. Recall that a suitable convex function can be represented as φ (x) = maxf x ·f−φ∗ (f), where φ∗ is the Fenchel conjugate of φ (·). In particular, we have the representation 12x 2 = maxu ux− 12u 2, which allows us to re-express the objective as
J (τ) = ∫ p · τ (s′, a′) { maxf [ (T pγ,µ0◦τ)(s ′,a′) p·τ(s′,a′) f − φ ∗ (f) ]} ds′da′ + λ { maxu [ u (Ep [τ ]− 1)− u 2 2 ]} . (12)
Applying the interchangeability principle (Shapiro et al., 2014; Dai et al., 2016), one can replace the inner max in the first term over scalar f to maximize over a function f (·, ·) : S ×A→ R
min τ≥0 max f :S×A→R,u∈R
J (τ, u, f) = (1− γ)Eµ0π [f (s, a)] + γETp [τ (s, a) f (s′, a′)] − Ep [τ (s, a)φ∗ (f (s, a))] + λ ( Ep [uτ (s, a)− u]− u 2
2
) . (13)
This yields the main optimization formulation, which avoids the aforementioned difficulties and is well-suited for practical optimization as discussed in Section 3.4.
Remark (Other divergences): In addition to f -divergence, the proposed estimator Equation 11 is compatible with other divergences, such as the integral probability metrics (IPM) (Müller, 1997; Sriperumbudur et al., 2009), while retaining consistency. Based on the definition of the IPM, these divergences directly lead to min-max optimizations similar to Equation 13 with the identity function as φ∗ (·) and different feasible sets for the dual functions. Specifically, maximum mean discrepancy (MMD) (Smola et al., 2006) requires ‖f‖Hk ≤ 1 where Hk denotes the RKHS with kernel k; the Dudley metric (Dudley, 2002) requires ‖f‖BL ≤ 1 where ‖f‖BL := ‖f‖∞ + ‖∇f‖2; and Wasserstein distance (Arjovsky et al., 2017) requires ‖∇f‖2 ≤ 1. These additional requirements on the dual function might incur some extra difficulty in practice. For example, with Wasserstein distance and the Dudley metric, we might need to include an extra gradient penalty (Gulrajani et al., 2017), which requires additional computation to take the gradient through a gradient. Meanwhile, the consistency of the surrogate loss under regularization is not clear. For MMD, we can obtain a closed-form solution for the dual function, which saves the cost of the inner optimization (Gretton et al., 2012), but with the tradeoff of requiring two independent samples in each outer optimization update. Moreover, MMD relies on the condition that the dual function lies in some RKHS, which introduces additional kernel parameters to be tuned and in practice may not be sufficiently flexible compared to neural networks.

heading: 3.4 A PRACTICAL ALGORITHM

text:
We have derived a consistent stationary distribution correction estimator in the form of a min-max saddle point optimization Equation 13. Here, we present a practical instantiation of GenDICE with a concrete objective and parametrization.
We choose the χ2-divergence, which is an f -divergence with φ (x) = (x− 1)2 and φ∗ (y) = y+ y 2
4 . The objective becomes Jχ2 (τ, u, f) = (1− γ)Eµ0π [f (s, a)] + γETp [τ (s, a) f (s′, a′)]
− Ep [ τ (s, a) ( f (s, a) + 14f 2 (s, a) )] + λ ( Ep [uτ (s, a)− u]− u 2 2 ) . (14)
There two major reasons for adopting χ2-divergence:
i) In the behavior-agnostic OPE problem, we mainly use the ratio correction function for estimating Êp [τ̂ (s, a)R (s, a)], which is an expectation. Recall that the error between the estimate and ground-truth can then be bounded by total variation, which is a lower bound of χ2-divergence.
ii) For the alternative divergences, the conjugate of the KL-divergence involves exp (·), which may lead to instability in optimization; while the IPM variants introduce extra constraints on dual function, which may be difficult to be optimized. The conjugate function of χ2-divergence enjoys suitable numerical properties and provides squared regularization. We have provided an empirical ablation study that investigates the alternative divergences in Section 6.3.
To parameterize the correction ratio τ and dual function f we use neural networks, τ (s, a) = nnwτ (s, a) and f (s, a) = nnwf (s, a), where wτ and wf denotes the parameters of τ and f respectively. Since the optimization requires τ to be non-negative, we add an extra positive neuron, such as exp (·), log (1 + exp (·)) or (·)2 at the final layer of nnwτ (s, a). We empirically compare the different positive neurons in Section 6.3.
For these representations, and unbiased gradient estimator ∇(wτ ,u,wf )J (τ, u, f) can be obtained straightforwardly, as shown in Appendix B. This allows us to apply stochastic gradient descent to solve the saddle-point problem Equation 14 in a scalable manner, as illustrated in Algorithm 1.

heading: 4 THEORETICAL ANALYSIS

text:
We provide a theoretical analysis for the proposed GenDICE algorithm, following a similar learning setting and assumptions to (Nachum et al., 2019).
Assumption 2 The target stationary correction are bounded, ‖τ∗‖∞ ≤ C <∞. The main result is summarized in the following theorem. A formal statement, together with the proof, is given in Appendix C. Theorem 3 (Informal) Under mild conditions, with learnable F and H, the error in the objective between the GenDICE estimate, τ̂ , to the solution τ∗ (s, a) = u(s,a)p(s,a) is bounded by
E [J (τ̂)− J (τ∗)] = Õ ( approx (F ,H) + 1√N + opt ) ,
where E [·] is w.r.t. the randomness in D and in the optimization algorithms, opt is the optimization error, and approx (F ,H) is the approximation induced by (F ,H) for parametrization of (τ, f). The theorem shows that the suboptimality of GenDICE’s solution, measured in terms of the objective function value, can be decomposed into three terms: (1) the approximation error approx, which is controlled by the representation flexibility of function classes; (2) the estimation error due to sample randomness, which decays at the order of 1/ √ N ; and (3) the optimization error, which arises from the suboptimality of the solution found by the optimization algorithm. As discussed in Appendix C, in special cases, this suboptimality can be bounded below by a divergence between τ̂ and τ∗, and therefore directly bounds the error in the estimated policy value.
There is also a tradeoff between these three error terms. With more flexible function classes (e.g., neural networks) for F and H, the approximation error approx becomes smaller. However, it may increase the estimation error (through the constant in front of 1/ √ N ) and the optimization error (by solving a harder optimization problem). On the other hand, if F and H are linearly parameterized, estimation and optimization errors tend to be smaller and can often be upper-bounded explicitly in Appendix C.3. However, the corresponding approximation error will be larger.

heading: 5 RELATED WORK

text:
Off-policy Policy Evaluation Off-policy policy evaluation with importance sampling (IS) has has been explored in the contextual bandits (Strehl et al., 2010; Dudı́k et al., 2011; Wang et al., 2017), and episodic RL settings (Murphy et al., 2001; Precup et al., 2001), achieving many empirical successes (e.g., Strehl et al., 2010; Dudı́k et al., 2011; Bottou et al., 2013). Unfortunately, ISbased methods suffer from exponential variance in long-horizon problems, known as the “curse of horizon” (Liu et al., 2018). A few variance-reduction techniques have been introduced, but still cannot eliminate this fundamental issue (Jiang & Li, 2016; Thomas & Brunskill, 2016; Guo et al., 2017). By rewriting the accumulated reward as an expectation w.r.t. a stationary distribution, Liu et al. (2018); Gelada & Bellemare (2019) recast OPE as estimating a correction ratio function, which significantly alleviates variance. However, these methods still require the off-policy data to be collected by a single and known behavior policy, which restricts their practical applicability. The only published algorithm in the literature, to the best of our knowledge, that solves agnostic-behavior off-policy evaluation is DualDICE (Nachum et al., 2019). However, DualDICE was developed for
discounted problems and its results become unstable when the discount factor approaches 1 (see below). By contrast, GenDICE can cope with the more challenging problem of undiscounted reward estimation in the general behavior-agnostic setting.
Note that standard model-based methods (Sutton & Barto, 1998), which estimate the transition and reward models directly then calculate the expected reward based on the learned model, are also applicable to the behavior-agnostic setting considered here. Unfortunately, model-based methods typically rely heavily on modeling assumptions about rewards and transition dynamics. In practice, these assumptions do not always hold, and the evaluation results can become unreliable.
Markov Chain Monte Carlo Classical MCMC (Brooks et al., 2011; Gelman et al., 2013) aims at sampling from µπ by iteratively simulting from the transition operator. It requires continuous interaction with the transition operator and heavy computational cost to update many particles. Amortized SVGD (Wang & Liu, 2016) and Adversarial MCMC (Song et al., 2017; Li et al., 2019) alleviate this issue via combining with neural network, but they still interact with the transition operator directly, i.e., in an on-policy setting. The major difference of our GenDICE is the learning setting: we only access the off-policy dataset, and cannot sample from the transition operator. The proposed GenDICE leverages stationary density ratio estimation for approximating the stationary quantities, which distinct it from classical methods.
Density Ratio Estimation Density ratio estimation is a fundamental tool in machine learning and much related work exists. Classical density ratio estimation includes moment matching (Gretton et al., 2008), probabilistic classification (Bickel et al., 2007), and ratio matching (Nguyen et al., 2008; Sugiyama et al., 2008; Kanamori et al., 2009). These classical methods focus on estimating the ratio between two distributions with samples from both of them, while GenDICE estimates the density ratio to a stationary distribution of a transition operator, from which even one sample is difficult to obtain.
PageRank Yao & Schuurmans (2013) developed a reverse-time RL framework for PageRank via solving a reverse Bellman equation, which is less sensitive to graph topology and shows faster adaptation with graph change. However, Yao & Schuurmans (2013) still considers the online manner, which is different with our OPR setting.

heading: 6 EXPERIMENTS

text: In this section, we evaluate GenDICE on OPE and OPR problems. For OPE, we use one or multiple behavior policies to collect a fixed number of trajectories at some fixed trajectory length. This data is used to recover a correction ratio function for a target policy π that is then used to estimate the average reward in two different settings: i) average reward; and ii) discounted reward. In both settings, we compare with a model-based approach and step-wise weighted IS (Precup et al., 2000). We also compare to Liu et al. (2018) (referred to as “IPS” here) in the Taxi domain with a learned behavior policy1. We specifically compare to DualDICE (Nachum et al., 2019) in the discounted reward setting, which is a direct and current state-of-the-art baseline. For OPR, the main comparison is with the model-based method, where the transition operator is empirically estimated and stationary distribution recovered via an exact solver. We validate GenDICE in both tabular and continuous cases, and perform an ablation study to further demonstrate its effectiveness. All results are based on 20 random seeds, with mean and standard deviation plotted. Our code is publicly available at https://github.com/zhangry868/GenDICE.

heading: 6.1 TABULAR CASE

text:
Offline PageRank on Graphs One direct application of GenDICE is off-line PageRank (OPR). We test GenDICE on a Barabasi-Albert (BA) graph (synthetic), and two real-world graphs, Cora and Citeseer. Details of the graphs are given in Appendix D. We use the log KL-divergence between estimated stationary distribution and the ground truth as the evaluation metric, with the ground truth computed by an exact solver based on the exact transition operator of the graphs. We compared GenDICE with model-based methods in terms of the sample efficiency. From the results in Figure 1, GenDICE outperforms the model-based method when limited data is given. Even with 20k samples for a BA graph with 100 nodes, where a transition matrix has 10k entries, GenDICE still
1We used the released implementation of IPS (Liu et al., 2018) from https://github.com/zt95/ infinite-horizon-off-policy-estimation.
shows better performance in the offline setting. This is reasonable since GenDICE directly estimates the stationary distribution vector or ratio, while the model-based method needs to learn an entire transition matrix that has many more parameters.
Off-Policy Evaluation with Taxi We use a similar taxi domain as in Liu et al. (2018), where a grid size of 5 × 5 yields 2000 states in total (25 × 16 × 5, corresponding to 25 taxi locations, 16 passenger appearance status and 5 taxi status). We set the target policy to a final policy π after running tabular Q-learning for 1000 iterations, and set another policy π+ after 950 iterations as the base policy. The behavior policy is a mixture controlled by α as πb = (1 − α)π + απ+. For the model-based method, we use a tabular representation for the reward and transition functions, whose entries are estimated from behavior data. For IS and IPS, we fit a policy via behavior cloning to estimate the policy ratio. In this specific setting, our methods achieve better results compared to IS, IPS and the model-based method. Interestingly, with longer horizons, IS cannot improve as much as other methods even with more data, while GenDICE consistently improve and achieves much better results than the baselines. DualDICE
only works with γ < 1. GenDICE is more stable than DualDICE when γ becomes larger (close to 1), while still showing competitive performance for smaller discount factors γ.

heading: 6.2 CONTINUOUS CASE

text:
We further test our method for OPE on three control tasks: a discrete-control task Cartpole and two continuous-control tasks Reacher and HalfCheetah. In these tasks, observations (or states) are continuous, thus we use neural network function approximators and stochastic optimization. Since DualDICE (Nachum et al., 2019) has shown the state-of-the-art performance on discounted OPE, we mainly compare with it in the discounted reward case. We also compare to IS with a learned policy via behavior cloning and a neural model-based method, similar to the tabular case, but with neural network as the function approximator. All neural networks are feed-forward with two hidden layers of dimension 64 and tanh activations. More details can be found in Appendix D.
Due to limited space, we put the discrete control results in Appendix E and focus on the more challenging continuous control tasks. Here, the good performance of IS and model-based methods in Section 6.1 quickly deteriorates as the environment becomes complex, i.e., with a continuous action space. Note that GenDICE is able to maintain good performance in this scenario, even when using function approximation and stochastic optimization. This is reasonable because of the difficulty of fitting to the coupled policy-environment dynamics with a continuous action space. Here we also empirically validate GenDICE with off-policy data collected by multiple policies.
As illustrated in Figure 3, all methods perform better with longer trajectory length or more trajectories. When α becomes larger, i.e., the behavior policies are closer to the target policy, all methods performs better, as expected. Here, GenDICE demonstrates good performance both on averagereward and discounted reward cases in different settings. The right two figures in each row show the log MSE curve versus optimization steps, where GenDICE achieves the smallest loss. In the discounted reward case, GenDICE shows significantly better and more stable performance than the
strong baseline, DualDICE. Figure 4 also shows better performance of GenDICE than all baselines in the more challenging HalfCheetah domain.

heading: 6.3 ABLATION STUDY

text:
Finally, we conduct an ablation study on GenDICE to study its robustness and implementation sensitivities. We investigate the effects of learning rate, activation function, discount factor, and the specifically designed ratio constraint. We further demonstrate the effect of the choice of divergences and the penalty weight. Effects of the Learning Rate Since we are using neural network as the function approximator, and stochastic optimization, it is necessary to show sensitivity to the learning rate with {0.0001, 0.0003, 0.001, 0.003}, with results in Figure 5. When α = 0.33, i.e., the OPE tasks are relatively easier and GenDICE obtains better results at all learning rate settings. However, when α = 0.0, i.e., the estimation becomes more difficult and only GenDICE only obtains reasonable results with the larger learning rate. Generally, this ablation study shows that the proposed method is not sensitive to the learning rate, and is easy to train. Activation Function of Ratio Estimator We further investigate the effects of the activation function on the last layer, which ensure the non-negative outputs required for the ratio. To better understand which activation function will lead to stable trainig for the neural correction estimator, we empirically compare using i) (·)2; ii) log(1 + exp(·)); and iii) exp(·). In practice, we use the (·)2 since it achieves low variance and better performance in most cases, as shown in Figure 5. Effects of Discount Factors We vary γ ∈ {0.95, 0.99, 0.995, 0.999, 1.0} to probe the sensitivity of GenDICE. Specifically, we compare to DualDICE, and find that GenDICE is stable, while DualDICE becomes unstable when the γ becomes large, as shown in Figure 6. GenDICE is also more general than DualDICE, as it can be applied to both the average and discounted reward cases. Effects of Ratio Constraint In Section 3, we highlighted the importance of the ratio constraint. Here we investigate the trivial solution issue without the constraint. The results in Figure 6 demonstrate the necessity of adding the constraint penalty, since a trivial solution prevents an accurate corrector from being recovered (green line in left two figures).
Effects of the Choice of Divergences We empirically test the GenDICE with several other alternative divergences, e.g., Wasserstein-1 distance, Jensen-Shannon divergence, KL-divergence, Hellinger divergence, and MMD. To avoid the effects of other factors in the estimator, e.g., function parametrization, we focus on the offline PageRank task on BA graph with 100 nodes and 10k offline samples. All the experiments are evaluated with 20 random trials. To ensure the dual function to be 1-Lipchitz, we add the gradient penalty. Besides, we use a learned Gaussian kernel in MMD, similar to Li et al. (2017). As we can see in Figure 7(a), the GenDICE estimator is compatible with many different divergences. Most of the di-
vergences, with appropriate extra techniques to handle the difficulties in optimization and carefully tuning for extra parameters, can achieve similar performances, consistent with phenomena in the variants of GANs (Lucic et al., 2018). However, KL-divergence is an outlier, performing noticeably worse, which might be caused by the ill-behaved exp (·) in its conjugate function. The χ2divergence and JS-divergence are better, which achieve good performances with fewer parameters to be tuned.
Effects of the Penalty Weight The results of different penalty weights λ are illustrated in Figure 7(b). We vary the λ ∈ [0.1, 5] with χ2-divergence. Within a large range of λ, the performances of the proposed GenDICE are quite consistent, which justifies Theorem 1. The penalty multiplies with λ. Therefore, with λ increases, the variance of the stochastic gradient estimator also increases, which explains the variance increasing in large λ in Figure 7(b). In practice, λ = 1 is a reasonable choice for general cases.

heading: 7 CONCLUSION

text: In this paper, we proposed a novel algorithm GenDICE for general stationary distribution correction estimation, which can handle both the discounted and average stationary distribution given multiple behavior-agnostic samples. Empirical results on off-policy evaluation and offline PageRank show the superiority of proposed method over the existing state-of-the-art methods.

heading: ACKNOWLEDGMENTS

text: The authors would like to thank Ofir Nachum, the rest of the Google Brain team and the anonymous reviewers for helpful discussions and feedback.

heading: A PROPERTIES OF GENDICE

text:
For notation simplicity, we denote x = (s, a) ∈ Ω := S ×A and Pπ (x′|x) := π (a′|s′)P (s′|s, a). Also define ‖f‖p,2 := 〈f, f〉p = ∫ f (x) 2 p (x) dx. We make the following assumption to ensure the existence of the stationary distribution. Our discussion is all based on this assumption.
Assumption 1 Under the target policy, the resulted state-action transition operator T has a unique stationary distribution in terms of the divergence D (·||·). If the total variation divergence is selected, the Assumption 1 requires the transition operator should be ergodic, as discussed in Meyn & Tweedie (2012).

heading: A.1 CONSISTENCY OF THE ESTIMATOR

text:
Theorem 1 For arbitrary λ > 0, the solution to the optimization Eqn (11) is u(s,a)p(s,a) for γ ∈ (0, 1]. Proof For γ ∈ (0, 1), there is not degenerate solutions to D (( T pγ,µ0 ◦ τ ) ||p · τ ) . The optimal
solution is a density ratio. Therefore, the extra penalty ( Ep(x) [τ (x)]− 1 )2 does not affect the optimality for ∀λ > 0.
When γ = 1, for ∀λ > 0, recall both D (( T pγ,µ0 ◦ τ ) ||p · τ ) and ( Ep(x) [τ (x)]− 1 )2 are nonnegative, and the the density ratio µ(x)p(x) leads to zero for both terms. Then, the density ratio is a solution to J (τ). For any other non-negative function τ (x) ≥ 0, if it is the optimal solution to J (τ), then, we have
D (( T pγ,µ0 ◦ τ ) ||p · τ ) = 0 ⇒ p (x′) τ (x′) = ( T pγ,µ0 ◦ τ ) (x′) = ∫ Pπ (x′|x) τ (x) dx,(15)(
Ep(x) [τ (x)]− 1 )2 = 0 ⇒ Ep(x) [τ (x)] = 1. (16)
We denote µ (x) = p (x) τ (x), which is clearly a density function. Then, the optimal conditions in Equation 15 imply
µ (x′) = ∫ Pπ (x′|x)µ (x) dx,
or equivalently, µ is the stationary distribution of T . We have thus shown the optimal τ (x) = µ(x)p(x) is the target density ratio.

heading: A.2 CONVEXITY OF THE OBJECTIVE

text:
Proof Since the φ is convex, we consider the Fenchel dual representation of the f -divergence Dφ (( T pγ,µ0 ◦ τ ) ||p · τ ) , i.e.,
Dφ (( T pγ,µ0 ◦ τ ) ||p · τ ) = max f∈Ω→R ` (τ, f)
:= (1− γ)Eµ0π [f (x)] + γETp(x,x′) [τ (x) f (x ′)]− Ep(x) [τ (x)φ∗ (f (x))] . (17) It is obviously ` (τ, f) is convex in τ for each f , then, Dφ (( T pγ,µ0 ◦ τ ) ||p · τ ) is convex. The term λ (Ep (τ)− 1)2 is also convex, which concludes the proof.
Algorithm 1 GenDICE (with function approximators) Inputs: Convex function φ and its Fenchel conjugate φ∗, off-policy data D = {(s(i), a(i), r(i), s′(i))}Ni=1, initial state s0 ∼ µ0, target policy π, distribution corrector nnwτ (·, ·),nnwf (·, ·), constraint scalar u, learning rates ητ , ηf , ηu, number of iterations K, batch size B. for t = 1, . . . ,K do
Sample batch {(s(i), a(i), r(i), s′(i))}Bi=1 from D. Sample batch {s(i)0 }Bi=1 from µ0. Sample actions a′(i) ∼ π(s′(i)), for i = 1, . . . , B. Sample actions a(i)0 ∼ π(s (i) 0 ), for i = 1, . . . , B. Compute empirical loss Ĵχ2 (τ, u, f) = (1− γ)Eµ0π [f (s, a)] + γETp [τ (s, a) f (s′, a′)] −Ep [ τ (s, a) ( f (s, a) + 14f 2 (s, a) )] + λ ( Ep [uτ (s, a)− u]− u 2 2 ) .
Update wτ ← wτ − ητ∇θτ Ĵχ2 . Update wf ← wf + ηf∇θf Ĵχ2 . Update u← u+ ηu∇uĴχ2 .
end for Return nnwτ .

heading: B ALGORITHM DETAILS

text:
We provide the unbiased gradient estimator for∇wτ ,u,wfJ (τ, u, f) in Eqn (14) below: ∇wτJχ2 (τ, u, f) = γETp [∇wτ τ (s, a) f (s′, a′)]− Ep [ ∇wτ τ (s, a) ( f (s, a) + 1
4 f2 (s, a) )] +λuEp [∇wτ τ (s, a)], (18)
∇uJχ2 (τ, u, f) = λ (Ep [τ (s, a)− 1]− u) , (19) ∇wfJχ2 (τ, u, f) = (1− γ)Eµ0π [ ∇wf f (s, a) ] + γETp [ τ (s, a)∇wf f (s′, a′) ] (20)
−Ep [ τ (s, a) ( 1 + 1
2 f (s, a)
) ∇wf f (s, a) ] .
Then, we have the psuedo code which applies SGD for solving Eqn (14).

heading: C PROOF OF THEOREM 3

text:
For convenience, we repeat here the notation defined in the main text. The saddle-point reformulation of the objective function of GenDICE is: J (τ, u, f) := (1− γ)Eµ0π [f (x′)] + γETp(x,x′) [τ (x) f (x ′)]
− Ep(x) [τ (x)φ∗ (f (x))] + λ ( Ep(x) [uτ (x)− u]− 1 2 u2 ) .
To avoid the numerical infinity in Dφ (·||·), we induced the bounded version as
J (τ) := max ‖f‖∞≤C,u
J (τ, u, f) = DCφ (( T pγ,µ0 ◦ τ ) ||p · τ ) + λ
2
( Ep(x) [τ (x)]− 1 )2 ,
in which DCφ (·||·) is still a valid divergence, and therefore the optimal solution τ∗ is still the stationary density ratio µ(x)p(x) . We denote the Ĵ (τ, µ, f) as the empirical surrogate of J (τ, µ, f) on
samples D = (
(x, x′) N i=1 ) ∼ T pγ,µ0 (x, x ′) with the optimal solution in (H,F ,R) as ( τ̂∗H, û ∗, f̂∗F ) .
Furthermore, denote τ∗H = arg min
τ∈H J (τ) ,
τ∗ = arg min τ∈S×A→R J (τ)
with optimal (f∗, u∗), and L (τ) = max
f∈F,u∈R J (τ, u, f) ,
L̂ (τ) = max f∈F,u∈R Ĵ (τ, u, f) .
We apply some optimization algorithm for Ĵ (τ, u, f) over space (H,F ,R), leading to the output( τ̂ , û, f̂ ) .
Under Assumption 2, we need only consider ‖τ‖∞ ≤ C, then, the corresponding dual u = Ep (τ)− 1 ⇒ u ∈ U := {|u| ≤ (C + 1)}. We choose the φ∗ (·) is a κ-Lipschitz continuous, then, the J (τ, u, f) is a CPπ,κ,λ = max {( γ ‖Pπ‖p,∞ + (1− γ) ∥∥∥µ0πp ∥∥∥
p,∞ + κ
) C, (C + 1) ( λ+ 12 )} -
Lipschitz continuous function w.r.t. (f, u) with the norm ‖(f, u)‖p,1 := ∫ |f (x)| p (x) dx+ |u|, and
Cφ,C,λ := ( C + λ (C + 1) + maxt∈{−C,C} (−φ (t)) ) -Lipschitz continuous function w.r.t. τ with
the norm ‖τ‖p,1 := ∫ |τ (x)| p (x) dx.
We consider the error between τ̂ and τ∗ using standard arguments (Shalev-Shwartz & Ben-David, 2014; Bach, 2014), i.e., d (τ̂ , τ∗) := J (τ̂)− J (τ∗) . The discrepancy d (τ, τ∗) ≥ 0 and d (τ, τ∗) = 0 if and only if p · τ is stationary distribution of T in the weak sense of Dφ (·||·).
Remark: In some special cases, the suboptimality also implies the distance between τ̂ and τ∗. Specifically,for γ = 1, if the transition operator Pπ can be represented as Pπ = QΛQ−1 where Q denotes the (countable) eigenfunctions and Λ denotes the diagonal matrix with eigenvalues, the largest of which is 1. We consider φ (·) as identity and f ∈ F := { span (Q) , ‖f‖p,2 ≤ 1 } , then the d (τ, τ∗) will bounded from below by a metric between τ and τ∗. Particularly, we have Dφ (( T pγ,µ0 ◦ τ ) ||p · τ ) = max
f∈F ETp(x,x′) [τ (x) f (x ′)]− Ep(x) [τ (x) f (x)] = ‖τ −Pπ ◦ τ‖p,2 . Rewrite τ = ατ∗ + ζ, where ζ ∈ span ( Q\τ∗ ) , then
Dφ (( T pγ,µ0 ◦ τ ) ||p · τ ) = ‖ατ∗ − αPπ ◦ τ∗ + ζ −Pπ ◦ ζ‖p,2 = ‖ζ −P π ◦ ζ‖p,2 .
Recall the optimality of τ∗, i.e., Dφ (( T pγ,µ0 ◦ τ )∗ ||p · τ∗) = 0, we have d (τ, τ∗) = J (τ) ≥ ‖ζ −Pπ ◦ ζ‖p,2 := ‖(τ − τ ∗)‖p,2,(Pπ−I) .

heading: C.1 ERROR DECOMPOSITION

text:
We start with the following error decomposition: d (τ̂ , τ∗) := J (τ̂)− J (τ∗) = J (τ̂)− J (τ̂∗H)︸ ︷︷ ︸
1
+ J (τ̂∗H)− J (τ∗)︸ ︷︷ ︸ 2 .
• For 1, we have 1 = J (τ̂)− L (τ̂) + L (τ̂)− L (τ̂∗H) + L (τ̂∗H)− J (τ̂∗H) .
We consider the terms one-by-one. By definition, we have J (τ̂)− L (τ̂) = max
f,µ J (τ̂ , u, f)− max f∈F,µ J (τ̂ , u, f)
≤ CPπ,κ,λ sup f1,u1∈U inf f2∈F,u2∈U ‖(f1, u1)− (f2, u2)‖p,1︸ ︷︷ ︸ approx(F) , (21)
which is induced by introducing F for dual approximation.
For the third term L (τ̂∗H)− J (τ̂∗H), we have L (τ̂∗H)− J (τ̂∗H) = max
f∈F,u∈U J (τ̂∗H, u, f)− max f,u∈U J (τ̂∗H, u, f) ≤ 0.
For the term L (τ̂)− L (τ̂∗H), L (τ̂)− L (τ̂∗H) = L (τ̂)− L̂ (τ̂) + L̂ (τ̂)− L̂ (τ̂∗H)︸ ︷︷ ︸
̂opt
+L̂ (τ̂∗H)− L (τ̂∗H)
≤ 2 sup τ∈H ∣∣∣L (τ)− L̂ (τ)∣∣∣+ ̂opt ≤ 2 sup
τ∈H
∣∣∣∣ maxf∈F,u∈U J (τ, u, f)− maxf∈F,u∈U Ĵ (τ, u, f) ∣∣∣∣+ ̂opt
≤ 2 sup τ∈H sup f∈F,u∈U ∣∣∣J (τ, u, f)− Ĵ (τ, u, f)∣∣∣+ ̂opt = 2 · est + ̂opt, (22)
where we define est := supτ∈H,f∈F,u∈U ∣∣∣J (τ, u, f)− Ĵ (τ, u, f)∣∣∣.
Therefore, we can now bound 1 as 1 ≤ CT ,κ,λ approx (F) + 2 est + ̂opt.
• For 2, we have 2 = J (τ̂ ∗ H)− J (τ∗H) + J (τ∗H)− J (τ∗)
= J (τ̂∗H)− L (τ̂∗H) + L (τ̂∗H)− L (τ∗H) + L (τ∗H)− J (τ∗H) + J (τ∗H)− J (τ∗) . We consider the terms from right to left. For the term J (τ∗H)− J (τ∗), we have J (τ̂∗H)− J (τ∗) = J ( τ̂∗H, û ∗, f̂∗F ) − J ( τ∗, û∗, f̂∗F ) + J ( τ∗, û∗, f̂∗F
) − J (τ∗, u∗, f∗)︸ ︷︷ ︸ ≤0
= J ( τ̂∗H, û ∗, f̂∗F ) − J ( τ∗, û∗, f̂∗F ) ≤ Cφ,C,λ sup
τ1
inf τ2∈H ‖τ1 − τ2‖p,1︸ ︷︷ ︸ approx(H) ,
which is induced by restricting the function space to H. The second term is nonpositive, due to the optimality of (u∗, f∗). The final inequality comes from the fact that J (τ, u, f) is Cφ,C,λLipschitz w.r.t. τ . For the term L (τ̂∗H)− J (τ∗H), by definition
L (τ∗H)− J (τ∗H) = max f∈F,u∈U J (τ∗H, f, u)− max f,u∈U J (τ∗H, f, u) ≤ 0.
For the term L (τ̂∗H)− L (τ∗H), we have L (τ̂∗H)− L (τ∗H) = L (τ̂∗H)− L̂ (τ̂∗H) + L̂ (τ̂∗H)− L̂ (τ∗H)︸ ︷︷ ︸
≤0
+L̂ (τ∗H)− L (τ∗H)
= 2 sup τ∈H ∣∣∣L (τ)− L̂ (τ)∣∣∣ = 2 sup
τ∈H,f∈F,u∈U ∣∣∣J (τ, u, f)− Ĵ (τ, u, f)∣∣∣ = 2 · est.
where the second term is nonpositive, thanks to the optimality of τ̂∗H. Finally, for the term J (τ̂∗H)− J (τ∗H), using the same argument in Equation 21, we have J (τ̂∗H)− J (τ∗H) ≤ CPπ,κ,λ approx (F) . Therefore, we can bound 2 by
2 ≤ Cφ,C,λ approx (H) + CPπ,κ,λ (F) + 2 est.
In sum, we have d (τ̂ , τ∗) ≤ 4 est + ̂opt + 2CPπ,κ,λ approx (F) + Cφ,C,λ approx (H) . In the following sections, we will bound the est and ̂opt.

heading: C.2 STATISTICAL ERROR

text:
In this section, we analyze the statistical error
est := sup τ∈H,f∈F,u∈U
∣∣∣J (τ, u, f)− Ĵ (τ, u, f)∣∣∣ .
We mainly focus on the batch RL setting with i.i.d. samples D = [(xi, x′i)] N i=1 ∼ Tp (x, x′), which has been studied by previous authors (e.g., Sutton et al., 2012; Nachum et al., 2019). However, as discussed in the literature (Antos et al., 2008; Lazaric et al., 2012; Dai et al., 2018; Nachum et al., 2019), using the blocking technique of Yu (1994), the statistical error provided here can be generalized to β-mixing samples in a single sample path. We omit this generalization for the sake of expositional simplicity.
To bound the est, we follow similar arguments by Dai et al. (2018); Nachum et al. (2019) via the covering number. For completeness, the definition is given below.
The Pollard’s tail inequality bounds the maximum deviation via the covering number of a function class:
Lemma 4 (Pollard (2012)) Let G be a permissible class of Z → [−M,M ] functions and {Zi}Ni=1 are i.i.d. samples from some distribution. Then, for any given > 0,
P ( sup g∈G ∣∣∣∣∣ 1N N∑ i=1 g(Zi)− E [g(Z)] ∣∣∣∣∣ > ) ≤ 8E [ N1 ( 8 ,G, {Zi}Ni=1 )] exp ( −N 2 512M2 ) .
The covering number can then be bounded in terms of the function class’s pseudo-dimension:
Lemma 5 (Haussler (1995), Corollary 3) For any set X , any points x1:N ∈ XN , any class F of functions on X taking values in [0,M ] with pseudo-dimension DF <∞, and any > 0,
N1 ( ,F , x1:N ) ≤ e (DF + 1)
( 2eM )DF .
The statistical error est can be bounded using these lemmas.
Lemma 6 (Stochastic error) Under the Assumption 2, if φ∗ is κ-Lipschitz continuous and the psuedo-dimension ofH and F are finite, with probability at least 1− δ, we have
est = O √ logN + log 1δ N  . Proof The proof works by verifying the conditions in Lemma 4 and computing the covering number.
Denote the hτ,u,f (x, x′) = (1− γ) f (x′)+γτ (x) f (x′)−τ (x)φ∗ (f (x))+λuτ (x)−λu−λ 12u 2, we will apply Lemma 4 with Z = Ω× Ω, Zi = (xi, x′i), and G = hH×F×U . We check the boundedness of hζ,u,f (x, x′). Based on Assumption 2, we only consider the τ ∈ H and u ∈ U bounded by C and C + 1. We also rectify the ‖f‖∞ ≤ C. Then, we can bound the ‖h‖∞:
‖hτ,u,f‖∞ ≤ (1 + ‖τ‖∞) ‖f‖∞ + ‖τ‖∞
( max
t∈[−C,C] −φ∗ (t)
) + λC (‖τ‖∞ + 1) + λC 2
≤ (C + 1)2 + C · Cφ + λC (2C + 1) =: M, where Cφ = maxt∈[−C,C] −φ∗ (t). Thus, by Lemma 4, we have
P ( sup
τ∈H,f∈F,u∈U
∣∣∣Ĵ (τ, u, f)− J (τ, u, f)∣∣∣)
= P ( sup
τ∈H,f∈F,u∈U ∣∣∣∣∣ 1n N∑ i=1 hζ,u,f (Zi)− E [hζ,u,f ] ∣∣∣∣∣ )
≤ E [ N1 (
8 ,G, {Zi}Ni=1
)] exp ( −N 2
512M2
) . (23)
Next, we check the covering number of G. Firstly, we bound the distance in G, 1
N N∑ i=1 |hτ1,u1,f1 (Zi)− hτ2,u2,f2 (Zi)|
≤ C + Cφ + λ(C + 1) N N∑ i=1 |τ1 (xi)− τ2 (xi)|+ 1 + γC N N∑ i=1 |f1 (x′i)− f2 (x′i)|
+ κC
N N∑ i=1 |f1 (xi)− f2 (xi)|+ λ (2C + 1) |u1 − u2| ,
which leads to N1 ( (Cφ + (3λ+ 2 + γ + κ) (C + 1)) ′,G, {Zi}Ni=1 ) ≤ N1 ( ′,H, (xi)Ni=1 ) N1 ( ′,F , (x′i) N i=1 ) N1 ( ′,F , (xi)Ni=1 ) N1 ( ′, U) .
For the set U = [−C − 1, C + 1], we have,
N1 ( ′, U) ≤ 2C + 2
′ .
Denote the pseudo-dimension ofH and F as DH and DF , respectively, we have N1 ( (Cφ + (3 + 2λ+ κ) (C + 1)) ′,G, {Zi}Ni=1 ) ≤e3 (DH + 1) (DF + 1)2 ( 2C + 2
′
)( 4eC
′
)DH+2DF ,
which implies N1 (
8 ,G, {Zi}Ni=1 ) ≤ C + 1
2C e2 (DH + 1) (DF + 1)
2 ( 32 (Cφ + (3λ+ 2 + γ + κ) (C + 1)) eC )DH+DF+1 = C1 ( 1 )D1 ,
where D1 = DH +DF + 1 and
C1 = C + 1
2C e2 (DH + 1) (DF + 1) 2 (32 (Cφ + (3λ+ 2 + γ + κ) (C + 1)) eC) .
Combine this result with Equation 23, we obtain the bound for the statistical error:
P ( sup
τ∈H,f∈F,u∈U
∣∣∣Ĵ (τ, u, f)− J (τ, u, f)∣∣∣) ≤ 8C1(1 )D1 exp ( −N 2
512M2
) . (24)
Setting = √
C2(logN+log 1δ ) N with C2 = max ( (8C1) 2 D1 , 512MD1, 512M, 1 ) , we have
8C1
( 1 )D1 exp ( −N 2
512M2
) ≤ δ.

heading: C.3 OPTIMIZATION ERROR

text:
In this section, we investigate the optimization error ̂opt := L̂ (τ̂)− L̂ (τ̂∗H) .
Notice our estimator minτ∈Hmaxf∈F,u∈U Ĵ (τ, u, f) is compatible with different parametrizations for (H,F) and different optimization algorithms, the optimization error will be different. For the general neural network for (τ, f), although there are several progress recently (Lin et al., 2018; Jin et al., 2019; Lin et al., 2019) about the convergence to a stationary point or local minimum, it remains a largely open problem to quantify the optimization error, which is out of the scope of this paper. Here, we mainly discuss the convergence rate with tabular, linear and kernel parametrization for (τ, f).
Particularly, we consider the linear parametrization particularly, i.e., τ (x) = w>τ ψτ (x) with {wτ , ψτ (x) ≥ 0} and f (x) = w>f ψf (x). With such parametrization, the Ĵ (τ, u, f) is still convexconcave w.r.t (wτ , wf , u).
We can bound the ̂opt by the primal-dual gap gap: ̂opt = L̂ (τ̂)− L̂ (τ̂∗H)
≤ max f∈F,u∈U
Ĵ (τ̂ , u, f)− Ĵ ( τ̂∗H, û ∗, f̂∗F ) + Ĵ ( τ̂∗H, û ∗, f̂∗F ) −min τ∈H Ĵ ( τ, û, f̂ ) = max
f∈F,u∈U Ĵ (τ̂ , u, f)−min τ∈H Ĵ ( τ, û, f̂ ) ︸ ︷︷ ︸
gap
.
With vanilla SGD, we have gap = O (
1√ T
) , where T is the optimization steps (Nemirovski et al.,
2009). Therefore, opt = E [̂opt] = O (
1√ T
) , where the E [·] is taken w.r.t. randomness in SGD.

heading: C.4 COMPLETE ERROR ANALYSIS

text:
We are now ready to state the main theorm in a precise way:
Theorem 3 Under Assumptions 2 and 1 , the stationary distribution µ exists, i.e., maxf∈F∗ ET ◦µ [f ] − Eµ [φ∗ (f)] = 0. If the φ∗ (·) is κ-Lipschitz continuous, ‖f‖∞ ≤ C < ∞, ∀f ∈ F∗, and the psuedo-dimension of H and F are finite, the error between the GenDICE estimate to τ∗ (x) = u(x)p(x) is bounded by
E [J (τ̂)− J (τ∗)] = Õ ( approx (F ,H) + √ 1
N + opt
) ,
where E [·] is w.r.t. the randomness in sample D and in the optimization algorithms. opt is the optimization error, and approx (F ,H) is the approximation induced by (F ,H) for parametrization of (τ, f).
Proof We have the total error as E [J (τ̂)− J (τ∗)] ≤ 4E [ est] + E [ opt] + approx (F ,H) , (25) where approx := 2CT ,κ,λ approx (F) + Cφ,C,λ approx (H). For opt, we can apply the results for SGD in Appendix C.3.
We can bound the E [ est] by Lemma 6. Specifically, we have
E [ est] = (1− δ)
√ C2 ( logN + log 1δ ) N + δM = O (√ logN N ) ,
by setting δ = 1√ N .
Plug all these bounds into Equation 25, we achieve the conclusion.

heading: D EXPERIMENTAL SETTINGS

heading: D.1 TABULAR CASE

text:
For the Taxi domain, we follow the same protocol as used in Liu et al. (2018). The behavior and target policies are also taken from Liu et al. (2018) (referred in their work as the behavior policy for α = 0). We use a similar taxi domain, where a grid size of 5×5 yields 2000 states in total (25×16×5, corresponding to 25 taxi locations, 16 passenger appearance status and 5 taxi status). We set our target policy as the final policy π∗ after running Q-learning (Sutton & Barto, 1998) for 1000 iterations, and
set another policy π+ after 950 iterations as our base policy. The behavior policy is a mixture policy controlled by α as π = (1−α)π∗+απ+, i.e., the larger α is, the behavior policy is more close to the target policy. In this setting, we solve for the optimal stationary ratio τ exactly using matrix operations. Since Liu et al. (2018) perform a similar exact solve for |S| variables µ(s), for better comparison we also perform our exact solve with respect to |S| variables τ(s). Specifically, the final objective of importance sampling will require knowledge of the importance weights µ(a|s)/p(a|s).
For offline PageRank, the graph statistics are illustrated in Table 1, and the degree statistics and graph visualization are shown in Figure 8. For the BarabasiAlbert (BA) Graph, it begins with an initial connected network of m0 nodes in the network. Each new node is connected to m ≤ m0 existing nodes with a probability that is proportional to the number of links
that the existing nodes already have. Intuitively, heavily linked nodes (‘hubs’) tend to quickly accumulate even more links, while nodes with only a few links are unlikely to be chosen as the destination for a new link. The new nodes have a ‘preference’ to attach themselves to the already heavily linked nodes. For two real-world graphs, it is built upon the real-world citation networks. In our experiments, the weights of the BA graph is randomly drawn from a standard Gaussian distribution with normalization to ensure the property of the transition matrix. The offline data is collected by a random walker on the graph, which consists the initial state and next state in a single trajectory. In experiments, we vary the number of off-policy samples to validate the effectiveness of GenDICE with limited offline samples provided.

heading: D.2 CONTINUOUS CASE

text:
We use the Cartpole, Reacher and HalfCheetah tasks as given by OpenAI Gym. In importance sampling, we learn a neural network policy via behavior cloning, and use its probabilities for computing importance weights π∗(a|s)/π(a|s). All neural networks are feed-forward with two hidden layers of dimension 64 and tanh activations.
Discrete Control Tasks We modify the Cartpole task to be infinite horizon: We use the same dynamics as in the original task but change the reward to be −1 if the original task returns a termination (when the pole falls below some threshold) and 1 otherwise. We train a policy on this task with standard Deep Q-Learning (Mnih et al., 2013) until convergence.
We then define the target policy π∗ as a weighted combination of this pre-trained policy (weight 0.7) and a uniformly random policy (weight 0.3). The behavior policy π for a specific 0 ≤ α ≤ 1 is taken to be a weighted combination of the pre-trained policy (weight 0.55 + 0.15α) and a uniformly random policy (weight 0.45 − 0.15α). We train each stationary distribution correction estimation method using the Adam optimizer with batches of size 2048 and learning rates chosen using a hyperparameter search from {0.0001, 0.0003, 0.001, 0.003} and choose the best one as 0.0003.
Continuous Control Tasks For the Reacher task, we train a deterministic policy until convergence via DDPG (Lillicrap et al., 2015). We define the target policy π as a Gaussian with mean given by the pre-trained policy and standard deviation given by 0.1. The behavior policy πb for a specific 0 ≤ α ≤ 1 is taken to be a Gaussian with mean given by the pre-trained policy and standard deviation given by 0.4 − 0.3α. We train each stationary distribution correction estimation method using the
Adam optimizer with batches of size 2048 and learning rates chosen using a hyperparameter search from {0.0001, 0.0003, 0.001, 0.003} and the optimal learning rate found was 0.003). For the HalfCheetah task, we also train a deterministic policy until convergence via DDPG (Lillicrap et al., 2015). We define the target policy π as a Gaussian with mean given by the pre-trained policy and standard deviation given by 0.1. The behavior policy πb for a specific 0 ≤ α ≤ 1 is taken to be a Gaussian with mean given by the pre-trained policy and standard deviation given by 0.2 − 0.1α. We train each stationary distribution correction estimation method using the Adam optimizer with batches of size 2048 and learning rates chosen using a hyperparameter search from {0.0001, 0.0003, 0.001, 0.003} and the optimal learning rate found was 0.003.

heading: E ADDITIONAL EXPERIMENTS

heading: E.1 OPE FOR DISCRETE CONTROL

text: On the discrete control task, we modify the Cartpole task to be infinite horizon: the original dynamics is used but with a modified reward function: the agent will receive −1 if the environment returns a termination (i.e., the pole falls below some threshold) and 1 otherwise. As shown in Figure 3, our method shows competitive results with IS and Model-Based in average reward case, but our proposed method finally outperforms these two methods in terms of log MSE loss. Specifically, it is relatively difficult to fit a policy with data collected by multiple policies, which renders the poor performance of IS.

heading: E.2 ADDITIONAL RESULTS ON CONTINUOUS CONTROL

text:
In this section, we show more results on the continuous control tasks, i.e., HalfCheetah and Reacher. Figure 10 shows the log MSE towards training steps, and GenDICE outperforms other baselines with different behavior policies. Figure 11 better illustrates how our method beat other baselines, and can accurately estimate the reward of the target policy. Besides, Figure 12 shows GenDICE gives better reward estimation of the target policy. In these figures, the left three figures show the performance with off-policy dataset collected by single behavior policy from more difficult to easier tasks. The right two figures show the results, where off-policy dataset collected by multiple behavior policies.
Figure 13 shows the ablation study results in terms of estimated rewards. The left two figures shows the effects of different learning rate. When α = 0.33, i.e., the OPE tasks are relatively easier, GenDICE gets relatively good results in all learning rate settings. However, when α = 0.0, i.e., the estimation becomes more difficult, only GenDICE in larger learning rate gets reasonable estimation. Interestingly, we can see with larger learning rates, the performance becomes better, and when learning rate is 0.001 with α = 0.0, the variance is very high, showing some cases the estimation becomes more accurate. The right three figures show different activation functions with different
behavior policy. The square and softplus function works well; while the exponential function shows poor performance under some settings. In practice, we use the square function since its low variance and better performance in most cases.

heading: E.3 COMPARISON WITH SELF-NORMALIZATION TRICK

text:
The self-normalization trick used in (Liu et al., 2018) encodes the normalization constraint in τ , while the principled optimization technique is considered in GenDICE. Further, the selfnormalization trick will lead to several disadvantages theoretically, in both statistical and computational aspects :
i) It will generally not produce an unbiased solution. Although 1|D|
∑
(s,a)∈D τ(s, a) is an unbiased
estimator for E[τ ], the plugin estimator τ(s,a)1 |D| ∑ (s,a)∈D τ(s,a) will be biased for τ(s,a)E[τ ] .
ii) It will induce more computational cost. Specifically, the self-normalized ratio will be in the form of τ(s,a)1 |D| ∑ (s,a)∈D τ(s,a)
, which requires to go through all the samples in training set D even for just estimating one stochastic gradient, and thus, is prohibitive for large dataset.
Empirically, self-normalization is the most natural and the first idea we tried during this project. We have some empirical results about this method in the OPR setting.
Despite the additional computational cost, it performs worse than the proposed regularization technique used in the current version of GenDICE. Table 2 shows a comparison between selfnormalization and regularization on OPR with χ2divergence for BA graph with 100 nodes, 10,000 offline samples, and 20 trials. We stop the algorithms in the same running-time budget.

title: GENDICE: GENERALIZED OFFLINE ESTIMATION OF STATIONARY VALUES