Original: Bayesian Risk Markov Decision Processes
Revised: Bayesian Risk Markov Decision Processes

Original: Abstract
Revised: Abstract

Original: We consider finite-horizon Markov Decision Processes where parameters, such as transition probabilities, are unknown and estimated from data.
Revised: We consider finite-horizon Markov Decision Processes where parameters, such as transition probabilities, are unknown and estimated from data.

Original: The popular distributionally robust approach to addressing the parameter uncertainty can sometimes be overly conservative.
Revised: The popular distributionally robust approach to addressing the parameter uncertainty can sometimes be overly conservative.

Original: In this paper, we propose a new formulation, Bayesian risk Markov decision process (BR-MDP), to address parameter uncertainty in
Revised: In this paper, we propose a new formulation, Bayesian risk Markov decision process (BR-MDP), to address parameter uncertainty in

Original: MDPs, where a risk functional is applied in nested form to the expected total cost with respect to the Bayesian posterior distributions of the unknown parameters.
Revised: MDPs, where a risk functional is applied in nested form to the expected total cost with respect to the Bayesian posterior distributions of the unknown parameters.

Original: The proposed formulation provides more flexible risk attitudes towards parameter uncertainty and takes into account the availability of data in future time stages.
Revised: The proposed formulation provides more flexible risk attitudes towards parameter uncertainty and takes into account the availability of data in future time stages.

Original: To solve the proposed formulation with the conditional value-at-risk (CVaR) risk functional, we propose an efficient approximation algorithm by deriving an analytical approximation of the value function and utilizing the convexity of CVaR.
Revised: To solve the proposed formulation with the conditional value-at-risk (CVaR) risk functional, we propose an efficient approximation algorithm by deriving an analytical approximation of the value function and utilizing the convexity of CVaR.

Original: We demonstrate the empirical performance of the BR-MDP formulation and proposed algorithms on a gambler’s betting problem and an inventory control problem.
Revised: We demonstrate the empirical performance of the BR-MDP formulation and proposed algorithms on a gambler’s betting problem and an inventory control problem.

Original:  Introduction
Revised:  Introduction

Original: Markov decision process (MDP) is a paradigm for modeling sequential decision making under uncertainty.
Revised: Markov decision process (MDP) is a paradigm for modeling sequential decision making under uncertainty.

Original: From a modeling perspective, some parameters of MDPs are unknown and need to be estimated from data.
Revised: From a modeling perspective, some parameters of MDPs are unknown and need to be estimated from data.

Original: In this paper, we consider MDPs where transition probability and cost parameters are not known.
Revised: In this paper, we consider MDPs where transition probability and cost parameters are not known.

Original: A natural question would be: given a finite and probably small set of data, how does a decision maker find an “optimal” policy that minimizes the expected total cost under the uncertain transition probability and cost parameters?
Revised: A natural question would be: given a finite and probably small set of data, how does a decision maker find an “optimal” policy that minimizes the expected total cost under the uncertain transition probability and cost parameters?

Original: A possible approach that mitigates the parameter uncertainty (also known as epistemic uncertainty) lies in the framework of distributionally robust MDPs (DR-MDPs, [1]).
Revised: A possible approach that mitigates the parameter uncertainty (also known as epistemic uncertainty) lies in the framework of distributionally robust MDPs (DR-MDPs, [1]).

Original: DR-MDP regards the unknown parameters as random variables and assumes the associated distributions belong to an ambiguity set that is constructed from the data.
Revised: DR-MDP regards the unknown parameters as random variables and assumes the associated distributions belong to an ambiguity set that is constructed from the data.

Original: DR-MDP then finds the optimal policy that minimizes the expected total cost with the parameters following the most adversarial distribution within the ambiguity set.
Revised: DR-MDP then finds the optimal policy that minimizes the expected total cost with the parameters following the most adversarial distribution within the ambiguity set.

Original: However, distributionally robust approaches might yield overly conservative solutions that perform poorly for scenarios that are more likely to happen than the worst case.
Revised: However, distributionally robust approaches might yield overly conservative solutions that perform poorly for scenarios that are more likely to happen than the worst case.

Original: Moreover, as pointed out in [2], DR-MDP does not explicitly specify the dynamics of the considered problem in the sense that the distribution of the unknown parameters does not depend on realizations of the data process, and therefore is generally not time consistent (we refer the reader to [2] for details on time consistency).
Revised: Moreover, as pointed out in [2], DR-MDP does not explicitly specify the dynamics of the considered problem in the sense that the distribution of the unknown parameters does not depend on realizations of the data process, and therefore is generally not time consistent (we refer the reader to [2] for details on time consistency).

Original: In view of the aforementioned drawbacks of DR-MDP, we propose a new formulation named as
Revised: In view of the aforementioned drawbacks of DR-MDP, we propose a new formulation named as

Original: Bayesian risk MDP (BR-MDP), to address the parameter uncertainty in MDPs.
Revised: Bayesian risk MDP (BR-MDP), to address the parameter uncertainty in MDPs.

Original: BR-MDP takes a similar perspective as Bayesian risk optimization (BRO), which is a new framework proposed by [3, 4] for static (single stage) optimization.
Revised: BR-MDP takes a similar perspective as Bayesian risk optimization (BRO), which is a new framework proposed by [3, 4] for static (single stage) optimization.

Original: They quantify the parameter uncertainty using a
Revised: They quantify the parameter uncertainty using a

Original: Bayesian posterior distribution to replace the ambiguity set in DRO, and impose a risk functional on the objective function with respect to the posterior distribution.
Revised: Bayesian posterior distribution to replace the ambiguity set in DRO, and impose a risk functional on the objective function with respect to the posterior distribution.

Original: To extend to BRO to MDPs and also ensure time consistency, we propose to use a nested risk functional taken with respect to the process of Bayesian posterior distributions, where the posterior is updated with all realizations of randomness up to each time stage.
Revised: To extend to BRO to MDPs and also ensure time consistency, we propose to use a nested risk functional taken with respect to the process of Bayesian posterior distributions, where the posterior is updated with all realizations of randomness up to each time stage.

Original: We show the proposed BR-MDP formulation is time consistent, and derive the corresponding dynamic programming equation with an augmented state that incorporates the posterior information.
Revised: We show the proposed BR-MDP formulation is time consistent, and derive the corresponding dynamic programming equation with an augmented state that incorporates the posterior information.

Original: The proposed framework works for an offline planning problem, where the decision maker, after loaded with the learned optimal policy and put to the real environment, acts like it adapts to the environment.
Revised: The proposed framework works for an offline planning problem, where the decision maker, after loaded with the learned optimal policy and put to the real environment, acts like it adapts to the environment.

Original: To solve the proposed BR-MDP formulation, we develop an efficient algorithm by drawing a connection between BR-MDP and partially observable MDP (POMDP) and utilizing the convexity of CVaR.
Revised: To solve the proposed BR-MDP formulation, we develop an efficient algorithm by drawing a connection between BR-MDP and partially observable MDP (POMDP) and utilizing the convexity of CVaR.

Original: The connection between BR-MDP and POMDP is motivated by the observation that the posterior distribution in BR-MDP is exactly like the belief state (which is the posterior distribution of the unobserved state given the history of observations) in a POMDP.
Revised: The connection between BR-MDP and POMDP is motivated by the observation that the posterior distribution in BR-MDP is exactly like the belief state (which is the posterior distribution of the unobserved state given the history of observations) in a POMDP.

Original: The optimal value function of a POMDP (in a minimization problem) can be expressed as an lower envelope of a set of linear functions (also called α -functions, see [5]).
Revised: The optimal value function of a POMDP (in a minimization problem) can be expressed as an lower envelope of a set of linear functions (also called α -functions, see [5]).

Original: We show a similar α -function representation of the value function for BR-MDP, where the number of α -functions grow exponentially over time.
Revised: We show a similar α -function representation of the value function for BR-MDP, where the number of α -functions grow exponentially over time.

Original: To have computationally feasible algorithm, we further derive an analytical approximation of the value function that keeps a constant number of α -functions over time.
Revised: To have computationally feasible algorithm, we further derive an analytical approximation of the value function that keeps a constant number of α -functions over time.

Original: To summarize, the contributions of this paper are two folds.
Revised: To summarize, the contributions of this paper are two folds.

Original: First, we propose a new time-consistent formulation BR-MDP to handle the parameter uncertainty in MDPs.
Revised: First, we propose a new time-consistent formulation BR-MDP to handle the parameter uncertainty in MDPs.

Original: Second, we propose an efficient algorithm to solve the proposed formulation with a CVaR risk functional, and the algorithm can be easily extended to other coherent risk measures (see [6] for an overview on coherent risk measures).
Revised: Second, we propose an efficient algorithm to solve the proposed formulation with a CVaR risk functional, and the algorithm can be easily extended to other coherent risk measures (see [6] for an overview on coherent risk measures).

Original:  Related Literature
Revised:  Related Literature

Original: One possible approach that mitigates the parameter uncertainty in MDPs lies in the framework of robust MDPs (e.g. [7, 8, 9, 10, 11]).
Revised: One possible approach that mitigates the parameter uncertainty in MDPs lies in the framework of robust MDPs (e.g. [7, 8, 9, 10, 11]).

Original: In robust MDPs, parameters are usually assumed to belong to a known set referred to as the ambiguity set, and the optimal decisions are chosen according to their performance under the worst possible parameter realizations within the ambiguity set.
Revised: In robust MDPs, parameters are usually assumed to belong to a known set referred to as the ambiguity set, and the optimal decisions are chosen according to their performance under the worst possible parameter realizations within the ambiguity set.

Original: [1] further extends the distributionally robust approach to MDPs (DR-MDPs) with parameter uncertainty and utilizes the probabilistic information of the unknown parameters.
Revised: [1] further extends the distributionally robust approach to MDPs (DR-MDPs) with parameter uncertainty and utilizes the probabilistic information of the unknown parameters.

Original: Different from all the aforementioned works, we take a Bayesian perspective in the BR-MDP formulation and seek a trade-off between the posterior expected performance and the robustness in the actual performance.
Revised: Different from all the aforementioned works, we take a Bayesian perspective in the BR-MDP formulation and seek a trade-off between the posterior expected performance and the robustness in the actual performance.

Original: It is worth noting that applying the Bayesian approach to MDPs has been considered in [12], which proposes a Bayes-adaptive MDP (BAMDP) formulation with an augmented state composed of the underlying MDP state and the posterior distribution of the unknown parameters.
Revised: It is worth noting that applying the Bayesian approach to MDPs has been considered in [12], which proposes a Bayes-adaptive MDP (BAMDP) formulation with an augmented state composed of the underlying MDP state and the posterior distribution of the unknown parameters.

Original: In BAMDP, each transition probability is treated as an unknown parameter associated with a Dirichlet prior distribution, and an expectation is taken with respect to the Dirichlet posterior on the expected total cost.
Revised: In BAMDP, each transition probability is treated as an unknown parameter associated with a Dirichlet prior distribution, and an expectation is taken with respect to the Dirichlet posterior on the expected total cost.

Original: In contrast, our BR-MDP formulation imposes a risk functional, taken with respect to the posterior distribution (which could be chosen as Dirichlet distribution but is more general), on the expected total cost in a nested form.
Revised: In contrast, our BR-MDP formulation imposes a risk functional, taken with respect to the posterior distribution (which could be chosen as Dirichlet distribution but is more general), on the expected total cost in a nested form.

Original: On a related note, risk-averse decision making has been widely studied in
Revised: On a related note, risk-averse decision making has been widely studied in

Original: MDPs.
Revised: MDPs.

Original: Apart from the robust MDPs that address the parameter uncertainty, risk-sensitive MDPs (e.g.
Revised: Apart from the robust MDPs that address the parameter uncertainty, risk-sensitive MDPs (e.g.

Original: [13, 14, 15, 16]) address the intrinsic uncertainty (also known as aleatoric uncertainty) that is due to the inherent stochasticity of the underlying MDP, by replacing the risk-neutral expectation (with respect to the state transition) by general risk measures, such as conditional value-at-risk (CVaR, see [17]).
Revised: [13, 14, 15, 16]) address the intrinsic uncertainty (also known as aleatoric uncertainty) that is due to the inherent stochasticity of the underlying MDP, by replacing the risk-neutral expectation (with respect to the state transition) by general risk measures, such as conditional value-at-risk (CVaR, see [17]).

Original: Most of the existing literature on risk-sensitive MDPs consider a static risk functional applied to the total return (e.g. [18, 19, 20, 21]).
Revised: Most of the existing literature on risk-sensitive MDPs consider a static risk functional applied to the total return (e.g. [18, 19, 20, 21]).

Original: There are two recent works closely related to ours, both of which apply a risk functional to BAMDP.
Revised: There are two recent works closely related to ours, both of which apply a risk functional to BAMDP.

Original: Specifically, [22] formulates the risk-sensitive planning problem as a two-player zero-sum game and then applies a static risk functional to the expected total cost, which adds robustness to the incorrect priors over model parameters; [23] optimizes a CVaR risk functional over the total cost and simultaneously addresses both epistemic and aleatoric uncertainty.
Revised: Specifically, [22] formulates the risk-sensitive planning problem as a two-player zero-sum game and then applies a static risk functional to the expected total cost, which adds robustness to the incorrect priors over model parameters; [23] optimizes a CVaR risk functional over the total cost and simultaneously addresses both epistemic and aleatoric uncertainty.

Original: In contrast, we consider a nested risk functional due to the time consistency consideration discussed in previous section.
Revised: In contrast, we consider a nested risk functional due to the time consistency consideration discussed in previous section.

Original: Also note that our problem setting relies on partial knowledge of the model (state transition equation, cost function etc.) and works in an offline planning setting with no interaction with the environment, and hence is different from Bayesian reinforcement learning (e.g. [24, 25]).
Revised: Also note that our problem setting relies on partial knowledge of the model (state transition equation, cost function etc.) and works in an offline planning setting with no interaction with the environment, and hence is different from Bayesian reinforcement learning (e.g. [24, 25]).

Original:  Preliminaries and Problem Formulation 3.1 Preliminaries: BRO and CVaR
Revised:  Preliminaries and Problem Formulation 3.1 Preliminaries: BRO and CVaR

Original: Bayesian risk optimization (BRO, see [3, 4]) considers a general stochastic optimization problem: min x E P c
Revised: Bayesian risk optimization (BRO, see [3, 4]) considers a general stochastic optimization problem: min x E P c

Original: [ h ( x, ξ )] , where x is the decision vector, ξ is a random vector with distribution P c , h is a deterministic cost function.
Revised: [ h ( x, ξ )] , where x is the decision vector, ξ is a random vector with distribution P c , h is a deterministic cost function.

Original: The true distribution P c is rarely known in practice and often needs to be estimated from data.
Revised: The true distribution P c is rarely known in practice and often needs to be estimated from data.

Original: It is very likely that the solution obtained from solving an estimated model performs badly under the true model.
Revised: It is very likely that the solution obtained from solving an estimated model performs badly under the true model.

Original: To avoid such a scenario, BRO seeks robustness in the actual performance by imposing a risk functional to the expected cost function and solving the following problem: min x ρ P n { E P θ [ h ( x, ξ )] } , where ρ is a risk functional, and P n is the posterior distribution of θ after observing n data points.
Revised: To avoid such a scenario, BRO seeks robustness in the actual performance by imposing a risk functional to the expected cost function and solving the following problem: min x ρ P n { E P θ [ h ( x, ξ )] } , where ρ is a risk functional, and P n is the posterior distribution of θ after observing n data points.

Original: It is assumed that the unknown distribution P c belongs to a parametric family { P θ | θ ∈ Θ } , where Θ is the parameter space and θ c ∈ Θ is the unknown true parameter value.
Revised: It is assumed that the unknown distribution P c belongs to a parametric family { P θ | θ ∈ Θ } , where Θ is the parameter space and θ c ∈ Θ is the unknown true parameter value.

Original: Taking a Bayesian perspective, θ c is viewed as a realization of a random vector θ .
Revised: Taking a Bayesian perspective, θ c is viewed as a realization of a random vector θ .

Original: In particular, conditional value-at-risk (CVaR), a common coherent risk measure (see [6]), is considered for the risk functional.
Revised: In particular, conditional value-at-risk (CVaR), a common coherent risk measure (see [6]), is considered for the risk functional.

Original: For a random variable X defined on a probability space (Ω , F , P ) , value-at-risk VaR α ( X ) is defined as the α -quantile of X , i.e., VaR α ( X ) :
Revised: For a random variable X defined on a probability space (Ω , F , P ) , value-at-risk VaR α ( X ) is defined as the α -quantile of X , i.e., VaR α ( X ) :

Original: = inf { t : P ( X ≤ t ) ≥ α } , where the confidence level α ∈ (0 , 1) .
Revised: = inf { t : P ( X ≤ t ) ≥ α } , where the confidence level α ∈ (0 , 1) .

Original: Assuming there is no probability atom at VaR α ( X ) , CVaR at confidence level α is defined as the mean of the α -tail distribution of X , i.e., CVaR α ( X ) =
Revised: Assuming there is no probability atom at VaR α ( X ) , CVaR at confidence level α is defined as the mean of the α -tail distribution of X , i.e., CVaR α ( X ) =

Original: E [ X | X ≥ VaR α ( X )] .
Revised: E [ X | X ≥ VaR α ( X )] .

Original: It is shown in [17] that CVaR can be written as a convex optimization:
Revised: It is shown in [17] that CVaR can be written as a convex optimization:

Original: [Equation]
Revised: [Equation]

Original: where ( · ) + stands for max(0 , · ) .
Revised: where ( · ) + stands for max(0 , · ) .

Original: 3.2 New formulation: Bayesian risk MDPs (BR-MDPs)
Revised: 3.2 New formulation: Bayesian risk MDPs (BR-MDPs)

Original: Consider a finite-horizon MDP defined as ( S , A , P , C ) , where S is the state space, A is the action space, P is the transition probability with P ( s t +1 | s t , a t ) denoting the probability of transitioning to state s t +1 from state s t when action a t is taken, C is the cost function with C t ( s t , a t , s t +1 ) denoting the cost at time stage t when action a t is taken and state transitions from s t to s t +1 .
Revised: Consider a finite-horizon MDP defined as ( S , A , P , C ) , where S is the state space, A is the action space, P is the transition probability with P ( s t +1 | s t , a t ) denoting the probability of transitioning to state s t +1 from state s t when action a t is taken, C is the cost function with C t ( s t , a t , s t +1 ) denoting the cost at time stage t when action a t is taken and state transitions from s t to s t +1 .

Original: A Markovian deterministic policy π is a function mapping from S to A .
Revised: A Markovian deterministic policy π is a function mapping from S to A .

Original: Given an initial state s 0 , the goal is to find an optimal policy that minimizes the expected total cost:
Revised: Given an initial state s 0 , the goal is to find an optimal policy that minimizes the expected total cost:

Original: [Equation]
Revised: [Equation]

Original: where E π, P , C is the expectation with policy π when the transition probability is P and the cost is C .
Revised: where E π, P , C is the expectation with policy π when the transition probability is P and the cost is C .

Original: In practice, P and C are often unknown and estimated from data.
Revised: In practice, P and C are often unknown and estimated from data.

Original: To deal with the parameter uncertainty in MDPs, we propose a new formulation, Bayesian risk
Revised: To deal with the parameter uncertainty in MDPs, we propose a new formulation, Bayesian risk

Original: MDP (BR-MDP), by extending BRO in static optimization to MDPs.
Revised: MDP (BR-MDP), by extending BRO in static optimization to MDPs.

Original: We assume the state transition is specified by the state equation s t
Revised: We assume the state transition is specified by the state equation s t

Original: +1 =
Revised: +1 =

Original: g t ( s t , a t , ξ t ) with a known transition function g t , which involves state s t ∈ S ⊆
Revised: g t ( s t , a t , ξ t ) with a known transition function g t , which involves state s t ∈ S ⊆

Original: R s , action a t ∈ A ⊆ R a , and randomness ξ t ∈ Ξ ⊆ R k , where s, a, k are the dimensions of the state, action, and randomness, respectively.
Revised: R s , action a t ∈ A ⊆ R a , and randomness ξ t ∈ Ξ ⊆ R k , where s, a, k are the dimensions of the state, action, and randomness, respectively.

Original: We assume { ξ t , t = 0 , · · · , T − 1 } are independent and identically distributed (i.i.d.).
Revised: We assume { ξ t , t = 0 , · · · , T − 1 } are independent and identically distributed (i.i.d.).

Original: Note that the state equation together with the distribution of ξ t uniquely determines the transition probability of the MDP, i.e.,
Revised: Note that the state equation together with the distribution of ξ t uniquely determines the transition probability of the MDP, i.e.,

Original: P ( s t +1 ∈ S ′
Revised: P ( s t +1 ∈ S ′

Original: | s t , a t ) =
Revised: | s t , a t ) =

Original: P ( { ξ t ∈ Ξ : g t ( s t , a t , ξ t )
Revised: P ( { ξ t ∈ Ξ : g t ( s t , a t , ξ t )

Original: ∈ S ′ }| s t , a t ) , where S ′ is a measurable set in S .
Revised: ∈ S ′ }| s t , a t ) , where S ′ is a measurable set in S .

Original: We refer the readers to Chapter 3.5 in [26] for the equivalence between stochastic optimal control and
Revised: We refer the readers to Chapter 3.5 in [26] for the equivalence between stochastic optimal control and

Original: MDP formulation.
Revised: MDP formulation.

Original: We use the representation of state equations instead of transition probabilities in
Revised: We use the representation of state equations instead of transition probabilities in

Original: MDPs, for the purpose of decoupling the randomness and the policy, leading to a cleaner formulation in the nested form.
Revised: MDPs, for the purpose of decoupling the randomness and the policy, leading to a cleaner formulation in the nested form.

Original: We assume the distribution of ξ t , denoted by f ( · ; θ c ) , belongs to a parametric family { f ( · ; θ ) | θ ∈ Θ } , where Θ ⊆ R d is the parameter space, d is the dimension of the parameter θ , and θ c ∈ Θ is the true but unknown parameter value.
Revised: We assume the distribution of ξ t , denoted by f ( · ; θ c ) , belongs to a parametric family { f ( · ; θ ) | θ ∈ Θ } , where Θ ⊆ R d is the parameter space, d is the dimension of the parameter θ , and θ c ∈ Θ is the true but unknown parameter value.

Original: The parametric assumption is satisfied in many problems; for example, in inventory control the customer demand is often assumed to follow a Poisson process (see [27]) with unknown arrival rate.
Revised: The parametric assumption is satisfied in many problems; for example, in inventory control the customer demand is often assumed to follow a Poisson process (see [27]) with unknown arrival rate.

Original: The cost at time stage t is assumed to be a function of state s t , action a t , and randomness ξ t , i.e., C t ( s t , a t , ξ t ) .
Revised: The cost at time stage t is assumed to be a function of state s t , action a t , and randomness ξ t , i.e., C t ( s t , a t , ξ t ) .

Original: We start with a prior distribution µ 0 over the parameter space Θ , which captures the initial uncertainty in the parameter estimate from an initial data set and can also incorporate expert opinion.
Revised: We start with a prior distribution µ 0 over the parameter space Θ , which captures the initial uncertainty in the parameter estimate from an initial data set and can also incorporate expert opinion.

Original: Then given an observed realization of the data process, we update the posterior distribution µ t according to the Bayes’ rule.
Revised: Then given an observed realization of the data process, we update the posterior distribution µ t according to the Bayes’ rule.

Original: Let the policy be a sequence of mappings from state s t and posterior µ t to the action space, i.e., π = { π t |
Revised: Let the policy be a sequence of mappings from state s t and posterior µ t to the action space, i.e., π = { π t |

Original: π t : S × M t → A , t = 0 , · · · , T − 1 } , where M t is the space of posterior distributions at time stage t .
Revised: π t : S × M t → A , t = 0 , · · · , T − 1 } , where M t is the space of posterior distributions at time stage t .

Original: Now we present the BR-MDP formulation below.
Revised: Now we present the BR-MDP formulation below.

Original: [Equation]
Revised: [Equation]

Original: where a t = π t ( s t , µ t ) , θ t is a random vector following distribution µ t , E f ( · ; θ t ) denotes the expectation with respect to ξ t ∼ f ( · ; θ t ) conditional on θ t , and ρ µ t denotes a risk functional with respect to θ t ∼ µ t .
Revised: where a t = π t ( s t , µ t ) , θ t is a random vector following distribution µ t , E f ( · ; θ t ) denotes the expectation with respect to ξ t ∼ f ( · ; θ t ) conditional on θ t , and ρ µ t denotes a risk functional with respect to θ t ∼ µ t .

Original: We assume the last-stage cost only depends on the state, hence denoted by C T ( s T ) .
Revised: We assume the last-stage cost only depends on the state, hence denoted by C T ( s T ) .

Original: Equation (3) is the transition of the state s t , and without loss of generality we assume the initial state s 0 takes a deterministic value.
Revised: Equation (3) is the transition of the state s t , and without loss of generality we assume the initial state s 0 takes a deterministic value.

Original: Equation (4) is the updating of the posterior µ t given the prior µ 0 .
Revised: Equation (4) is the updating of the posterior µ t given the prior µ 0 .

Original: 3.3 Time consistency and dynamic programming
Revised: 3.3 Time consistency and dynamic programming

Original: It is important to note that the BR-MDP formulation (2) takes a nested form of the risk functional.
Revised: It is important to note that the BR-MDP formulation (2) takes a nested form of the risk functional.

Original: A primary motivation for considering such nested risk functional is the issue of time consistency (see [28, 29, 30, 2]), which means that the optimal policy solved at time stage 0 is still optimal for any remaining time stage t ≥ 1 with respect to the conditional risk functional, even when the realization of the randomness ξ t is revealed up to that time stage.
Revised: A primary motivation for considering such nested risk functional is the issue of time consistency (see [28, 29, 30, 2]), which means that the optimal policy solved at time stage 0 is still optimal for any remaining time stage t ≥ 1 with respect to the conditional risk functional, even when the realization of the randomness ξ t is revealed up to that time stage.

Original: In contrast, optimizing a static risk functional can lead to “time-inconsistent” behavior, where the optimal policy at the current time stage can become suboptimal in the next time stage simply because a new piece of information is revealed (see [28, 29]).
Revised: In contrast, optimizing a static risk functional can lead to “time-inconsistent” behavior, where the optimal policy at the current time stage can become suboptimal in the next time stage simply because a new piece of information is revealed (see [28, 29]).

Original: To illustrate, consider the simple case of a three-stage problem where the risk functional
Revised: To illustrate, consider the simple case of a three-stage problem where the risk functional

Original: ρ is CVaR with confidence level α .
Revised: ρ is CVaR with confidence level α .

Original: Our BR-MDP solves a nested formulation
Revised: Our BR-MDP solves a nested formulation

Original: [Equation]
Revised: [Equation]

Original: while the non-nested counterpart solves
Revised: while the non-nested counterpart solves

Original: [Equation]
Revised: [Equation]

Original: where the expectation is taken with respect to (w.r.t.)
Revised: where the expectation is taken with respect to (w.r.t.)

Original: the joint distribution of ξ 0 and ξ 1 , and the static risk functional is applied to the total cost.
Revised: the joint distribution of ξ 0 and ξ 1 , and the static risk functional is applied to the total cost.

Original: Then we have the following relation between the two formulations:
Revised: Then we have the following relation between the two formulations:

Original: [Equation]
Revised: [Equation]

Original: where the inequality is justified by CVaR being the right tail average of the distribution, and the equality follows from the tower property of conditional expectation.
Revised: where the inequality is justified by CVaR being the right tail average of the distribution, and the equality follows from the tower property of conditional expectation.

Original: The upper bound is used to show that the static risk functional always yields a higher total expect cost than the nested risk functional, illustrating the benefit of nested risk functional which originates from time consistency.
Revised: The upper bound is used to show that the static risk functional always yields a higher total expect cost than the nested risk functional, illustrating the benefit of nested risk functional which originates from time consistency.

Original: Another drawback of the static formulation for a general risk functional is the lack of dynamic programming equation.
Revised: Another drawback of the static formulation for a general risk functional is the lack of dynamic programming equation.

Original: In particular, [2] points out that for the static formulation, the derivation of the dynamic programming equation is based on the interchangeability principle and the decomposability property of the risk functional, where such decomposability property holds only for expectation and max-type risk functionals.
Revised: In particular, [2] points out that for the static formulation, the derivation of the dynamic programming equation is based on the interchangeability principle and the decomposability property of the risk functional, where such decomposability property holds only for expectation and max-type risk functionals.

Original: On the other hand, for our nested formulation (2), the corresponding dynamic programming equation is easily obtained as follows:
Revised: On the other hand, for our nested formulation (2), the corresponding dynamic programming equation is easily obtained as follows:

Original: [Equation]
Revised: [Equation]

Original: where s t and µ t follow equation (3) and (4), respectively.
Revised: where s t and µ t follow equation (3) and (4), respectively.

Original: Therefore, our BR-MDP formulation provides a time-consistent risk-averse framework to deal with epistemic uncertainty in MDPs.
Revised: Therefore, our BR-MDP formulation provides a time-consistent risk-averse framework to deal with epistemic uncertainty in MDPs.

Original: The exact dynamic programming is summarized in Algorithm 1, for benchmark purpose.
Revised: The exact dynamic programming is summarized in Algorithm 1, for benchmark purpose.

Original: end end
Revised: end end

Original:  An Analytical Approximate Solution to BR-MDPs
Revised:  An Analytical Approximate Solution to BR-MDPs

Original: Although the exact dynamic programming works for a general risk functional, there are two challenges to carry it out.
Revised: Although the exact dynamic programming works for a general risk functional, there are two challenges to carry it out.

Original: First, the expectation and the risk functional are generally impossible to compute analytically and estimation by (nested) Monte Carlo simulation can be computationally expensive.
Revised: First, the expectation and the risk functional are generally impossible to compute analytically and estimation by (nested) Monte Carlo simulation can be computationally expensive.

Original: Second, the update of the posterior distribution µ t does not have a closed form in general and often results in an infinite-dimensional posterior.
Revised: Second, the update of the posterior distribution µ t does not have a closed form in general and often results in an infinite-dimensional posterior.

Original: We circumvent the latter difficulty by using conjugate families of distributions (see Chapter 5 in [31]), where the posterior distribution falls into the same parametric family as the prior distribution, and thus maintain the dimensionality of the posterior to be the finite (and often small) dimension of the parameter space of the conjugate distribution.
Revised: We circumvent the latter difficulty by using conjugate families of distributions (see Chapter 5 in [31]), where the posterior distribution falls into the same parametric family as the prior distribution, and thus maintain the dimensionality of the posterior to be the finite (and often small) dimension of the parameter space of the conjugate distribution.

Original: However, the posterior parameters usually take continuous values and hence BR-MDP with the augmented state ( s, µ ) is a continuous-state MDP.
Revised: However, the posterior parameters usually take continuous values and hence BR-MDP with the augmented state ( s, µ ) is a continuous-state MDP.

Original: We note that this continuous-state MDP resembles a belief-MDP, which is the equivalent transformation of a POMDP by regarding the posterior distribution of the unobserved state as a (belief) state (see [32]), and our posterior distribution µ t is just like the belief state in POMDP in the sense that both are posterior distributions updated via Baye’s rule.
Revised: We note that this continuous-state MDP resembles a belief-MDP, which is the equivalent transformation of a POMDP by regarding the posterior distribution of the unobserved state as a (belief) state (see [32]), and our posterior distribution µ t is just like the belief state in POMDP in the sense that both are posterior distributions updated via Baye’s rule.

Original: This observation motivates our algorithm development in this section.
Revised: This observation motivates our algorithm development in this section.

Original: Specifically, we derive an efficient approximation algorithm for the BR-MDP with the risk functional
Revised: Specifically, we derive an efficient approximation algorithm for the BR-MDP with the risk functional

Original: CVaR.
Revised: CVaR.

Original: The main idea is that for CVaR, once we know the variable u in (1), it is reduced to an expectation of a convex function.
Revised: The main idea is that for CVaR, once we know the variable u in (1), it is reduced to an expectation of a convex function.

Original: If there is a way to approximate the value function for a given u , we can utilize the convexity of CVaR and apply gradient descent to solve for u .
Revised: If there is a way to approximate the value function for a given u , we can utilize the convexity of CVaR and apply gradient descent to solve for u .

Original: Hence, we proceed by first deriving the approximate value function for a fixed u and time stage.
Revised: Hence, we proceed by first deriving the approximate value function for a fixed u and time stage.

Original: Similar to
Revised: Similar to

Original: POMDP whose value function can be represented by a set of so-called α -functions, we first show an α -function representation of the value function in BR-MDP, and then derive the approximate value function based on this representation.
Revised: POMDP whose value function can be represented by a set of so-called α -functions, we first show an α -function representation of the value function in BR-MDP, and then derive the approximate value function based on this representation.

Original: All proofs of the propositions/theorems below can be found in
Revised: All proofs of the propositions/theorems below can be found in

Original: Appendix.
Revised: Appendix.

Original: 4.1 α -function representation of the value function
Revised: 4.1 α -function representation of the value function

Original: By the definition of CVaR (see (1)) with a confidence level α , we can rewrite the dynamic program- ming equation (5) for the BR-MDP as:
Revised: By the definition of CVaR (see (1)) with a confidence level α , we can rewrite the dynamic program- ming equation (5) for the BR-MDP as:

Original: [Equation]
Revised: [Equation]

Original: where we assume that ξ and θ take continuous values, and the integration can be numerically approximated by Monte Carlo sampling.
Revised: where we assume that ξ and θ take continuous values, and the integration can be numerically approximated by Monte Carlo sampling.

Original: If ξ and θ are discrete, the integral can be replaced by summation.
Revised: If ξ and θ are discrete, the integral can be replaced by summation.

Original: The next proposition shows that the optimal value function corresponds to the lower envelope of a set of α -functions.
Revised: The next proposition shows that the optimal value function corresponds to the lower envelope of a set of α -functions.

Original: Proposition 4.1 ( α -function representation) .
Revised: Proposition 4.1 ( α -function representation) .

Original: The optimal value function in (6) can be represented by the lower envelope of a set of α -functions denoted by Γ t = { α t } a t ∈A , i.e.,
Revised: The optimal value function in (6) can be represented by the lower envelope of a set of α -functions denoted by Γ t = { α t } a t ∈A , i.e.,

Original: [Equation]
Revised: [Equation]

Original: where α t ( s t , θ ) =
Revised: where α t ( s t , θ ) =

Original: u t + 1 1 − α (cid:16)(cid:82)
Revised: u t + 1 1 − α (cid:16)(cid:82)

Original: Ξ f
Revised: Ξ f

Original: [Table]
Revised: [Table]

Original: Note that there is a major distinction between the α -function representations of a POMDP and a
Revised: Note that there is a major distinction between the α -function representations of a POMDP and a

Original: BR-MDP: the optimal value function in the risk-neutral POMDP is piecewise linear and convex in the belief state (see [5]), whereas the optimal value function in BR-MDP is no longer piecewise linear in the posterior due to the ( · ) + operator in CVaR.
Revised: BR-MDP: the optimal value function in the risk-neutral POMDP is piecewise linear and convex in the belief state (see [5]), whereas the optimal value function in BR-MDP is no longer piecewise linear in the posterior due to the ( · ) + operator in CVaR.

Original: In addition, it is computationally impossible to obtain the α -functions except for the last time stage.
Revised: In addition, it is computationally impossible to obtain the α -functions except for the last time stage.

Original: Specifically, denote the cardinality of the α t + set as | Γ t +1 | .
Revised: Specifically, denote the cardinality of the α t + set as | Γ t +1 | .

Original: Note that for each realization of ξ there are | Γ t +1 | candidates for the minimizer α ∗ ( ξ ) t +1 , which attains the minimum of (cid:82) Θ α t +1 ( s t +1 , θ )
Revised: Note that for each realization of ξ there are | Γ t +1 | candidates for the minimizer α ∗ ( ξ ) t +1 , which attains the minimum of (cid:82) Θ α t +1 ( s t +1 , θ )

Original: [Table]
Revised: [Table]

Original: dθ .
Revised: dθ .

Original: There are a total of |A|| Γ t +1 |
Revised: There are a total of |A|| Γ t +1 |

Original: [Table]
Revised: [Table]

Original: candidates for Γ t , let alone the optimization over u t .
Revised: candidates for Γ t , let alone the optimization over u t .

Original: To deal with the difficulty in computing the α -functions in POMDPs, [33] proposes several approximation algorithms, and later [34] extends the analysis to a continuous-state optimal stopping problem by applying Jensen’s inequality to the exact value iteration in different ways and obtains a more computationally efficient approximation to the optimal value function.
Revised: To deal with the difficulty in computing the α -functions in POMDPs, [33] proposes several approximation algorithms, and later [34] extends the analysis to a continuous-state optimal stopping problem by applying Jensen’s inequality to the exact value iteration in different ways and obtains a more computationally efficient approximation to the optimal value function.

Original: Inspired by these works, we derive an approximation approach next.
Revised: Inspired by these works, we derive an approximation approach next.

Original: 4.2 α -function approximation
Revised: 4.2 α -function approximation

Original: In this section, we derive the α -function approximation for a fixed vector ( u 0 , u 1 , · · · , u T − 1 ) .
Revised: In this section, we derive the α -function approximation for a fixed vector ( u 0 , u 1 , · · · , u T − 1 ) .

Original: Without loss of generality, we assume the cost function at each time stage is non-negative (otherwise add a large constant to the cost at each time stage).
Revised: Without loss of generality, we assume the cost function at each time stage is non-negative (otherwise add a large constant to the cost at each time stage).

Original: For ease of exposition, we rewrite (6) as V ∗ t ( s t , µ t ) = min a t ∈A ,u t ∈ R Q ∗ t ( s t , µ t , a t , u t ) , where Q ∗ t ( s t , µ t , a t , u t ) =
Revised: For ease of exposition, we rewrite (6) as V ∗ t ( s t , µ t ) = min a t ∈A ,u t ∈ R Q ∗ t ( s t , µ t , a t , u t ) , where Q ∗ t ( s t , µ t , a t , u t ) =

Original: u t + 1 1 − α (cid:82) Θ µ t ( θ ) (cid:0)(cid:82)
Revised: u t + 1 1 − α (cid:82) Θ µ t ( θ ) (cid:0)(cid:82)

Original: Ξ f ( ξ ; θ ) (cid:0) C t ( s t , a t , ξ ) + V ∗ t +1 ( s t +1 , µ t +1 ) (cid:1) dξ − u t (cid:1) + dθ .
Revised: Ξ f ( ξ ; θ ) (cid:0) C t ( s t , a t , ξ ) + V ∗ t +1 ( s t +1 , µ t +1 ) (cid:1) dξ − u t (cid:1) + dθ .

Original: Let V t ( s t , µ t ) :
Revised: Let V t ( s t , µ t ) :

Original: = min a t Q ∗ t ( s t , µ t , a t , u t ) be the “optimal” value function for a given u t .
Revised: = min a t Q ∗ t ( s t , µ t , a t , u t ) be the “optimal” value function for a given u t .

Original: Let V t ( s t , µ t ) :
Revised: Let V t ( s t , µ t ) :

Original: = min α t ∈ Γ t (cid:82) Θ α t ( s t , θ ) µ t ( θ ) dθ , where Γ t = { α t } a t ∈A and α t
Revised: = min α t ∈ Γ t (cid:82) Θ α t ( s t , θ ) µ t ( θ ) dθ , where Γ t = { α t } a t ∈A and α t

Original: [Equation]
Revised: [Equation]

Original: s t ,
Revised: s t ,

Original: [Equation]
Revised: [Equation]

Original: V t ( s t , µ t ) serves as a lower bound for V t ( s t , µ t ) (see Proposition 4.2), and is similar to the fast informed bound in POMDPs (see [33]).
Revised: V t ( s t , µ t ) serves as a lower bound for V t ( s t , µ t ) (see Proposition 4.2), and is similar to the fast informed bound in POMDPs (see [33]).

Original: Note that the set Γ t has a constant cardinality of |A| .
Revised: Note that the set Γ t has a constant cardinality of |A| .

Original: However, it involves a minimum within an integral, which can be hard to compute numerically.
Revised: However, it involves a minimum within an integral, which can be hard to compute numerically.

Original: Also, the lower bound is loose in the sense that it could be negative, while the true CVaR value is always non-negative (due to the non-negative cost).
Revised: Also, the lower bound is loose in the sense that it could be negative, while the true CVaR value is always non-negative (due to the non-negative cost).

Original: Next, let ¯ V t ( s t , µ t ) :
Revised: Next, let ¯ V t ( s t , µ t ) :

Original: =
Revised: =

Original: min ¯ α t ∈ ¯Γ t (cid:82) Θ ¯ α t ( s t , θ ) µ t ( θ ) dθ , where ¯Γ t = { ¯ α t } a t ∈A and ¯ α t ( s t , θ ) =
Revised: min ¯ α t ∈ ¯Γ t (cid:82) Θ ¯ α t ( s t , θ ) µ t ( θ ) dθ , where ¯Γ t = { ¯ α t } a t ∈A and ¯ α t ( s t , θ ) =

Original: u t +
Revised: u t +

Original: [Equation]
Revised: [Equation]

Original: − α (cid:18)(cid:90)
Revised: − α (cid:18)(cid:90)

Original: [Equation]
Revised: [Equation]

Original: ¯ V t ( s t , µ t ) serves as an upper bound for V t ( s t , µ t ) (see Proposition 4.2), and is similar to the unobservable MDP bound in POMDPs (see [33]), obtained by discarding all observations available to the decision maker.
Revised: ¯ V t ( s t , µ t ) serves as an upper bound for V t ( s t , µ t ) (see Proposition 4.2), and is similar to the unobservable MDP bound in POMDPs (see [33]), obtained by discarding all observations available to the decision maker.

Original: Suppose the cardinality at time stage t + 1 is | ¯Γ t +1 | , then ¯Γ t has a total number of |A|| ¯Γ t +1 | candidates.
Revised: Suppose the cardinality at time stage t + 1 is | ¯Γ t +1 | , then ¯Γ t has a total number of |A|| ¯Γ t +1 | candidates.

Original: In the following, we derive another approximate value function (cid:101) V t that is bounded by V t and ¯ V t , and is at least better than one of the above bounds.
Revised: In the following, we derive another approximate value function (cid:101) V t that is bounded by V t and ¯ V t , and is at least better than one of the above bounds.

Original: It keeps a constant number |A| of α -functions at each time stage, thus drastically reducing the computational complexity.
Revised: It keeps a constant number |A| of α -functions at each time stage, thus drastically reducing the computational complexity.

Original: Let
Revised: Let

Original: [Equation]
Revised: [Equation]

Original: θ
Revised: θ

Original: [Equation]
Revised: [Equation]

Original: dθ , where (cid:101) Γ t = { (cid:101) α t } a t ∈A and
Revised: dθ , where (cid:101) Γ t = { (cid:101) α t } a t ∈A and

Original: [Equation]
Revised: [Equation]

Original: t
Revised: t

Original: [Equation]
Revised: [Equation]

Original: t
Revised: t

Original: [Equation]
Revised: [Equation]

Original: Proposition 4.2.
Revised: Proposition 4.2.

Original: For all t < T and any given u t ∈ R , the following inequalities hold:
Revised: For all t < T and any given u t ∈ R , the following inequalities hold:

Original: [Equation]
Revised: [Equation]

Original: To have an implementable algorithm, we need to use the approximate updating of α -functions iteratively and replace the true α -functions at the t + 1 time stage in (7) by the approximate (cid:101) αfunctions from the previous iteration.
Revised: To have an implementable algorithm, we need to use the approximate updating of α -functions iteratively and replace the true α -functions at the t + 1 time stage in (7) by the approximate (cid:101) αfunctions from the previous iteration.

Original: It is clear that the iterative approximations preserve the directions of the inequalities.
Revised: It is clear that the iterative approximations preserve the directions of the inequalities.

Original: Define u t : := ( u t , · · · , u T − 1 ) .
Revised: Define u t : := ( u t , · · · , u T − 1 ) .

Original: The approximate value function at time stage t for a given u t : is given by (cid:101) V t
Revised: The approximate value function at time stage t for a given u t : is given by (cid:101) V t

Original: ( s t , µ t , u t : )
Revised: ( s t , µ t , u t : )

Original: = min ˜
Revised: = min ˜

Original: α t ∈ ˜Γ t (cid:82) Θ (cid:101) α t ( s t , θ ) µ t ( θ ) dθ , where ˜Γ t = { ˜ α t } a t ∈A and
Revised: α t ∈ ˜Γ t (cid:82) Θ (cid:101) α t ( s t , θ ) µ t ( θ ) dθ , where ˜Γ t = { ˜ α t } a t ∈A and

Original: (cid:101) α t ( s t , θ ) =
Revised: (cid:101) α t ( s t , θ ) =

Original: u t + 1 − α (cid:18)(cid:90)
Revised: u t + 1 − α (cid:18)(cid:90)

Original: Ξ C t ( s t , a t , ξ ) f ( ξ ; θ ) dξ − u t + min ˜
Revised: Ξ C t ( s t , a t , ξ ) f ( ξ ; θ ) dξ − u t + min ˜

Original: α t + (cid:90) Ξ (cid:101) α t
Revised: α t + (cid:90) Ξ (cid:101) α t

Original: +

Revised: +

Original: ( s t +1 , θ ) f ( ξ ; θ ) dξ (cid:19) + .
Revised: ( s t +1 , θ ) f ( ξ ; θ ) dξ (cid:19) + .

Original: 4.3 Approximate dynamic programming with gradient descent
Revised: 4.3 Approximate dynamic programming with gradient descent

Original: In this section, we incorporate α -function approximation with gradient descent on ( u 0 , u 1 , · · · , u T − 1 ) based on the convexity of the approximate value function w.r.t.
Revised: In this section, we incorporate α -function approximation with gradient descent on ( u 0 , u 1 , · · · , u T − 1 ) based on the convexity of the approximate value function w.r.t.

Original: ( u 0 , u 1 , · · · , u T − 1 ) , as formally shown in the theorem below.
Revised: ( u 0 , u 1 , · · · , u T − 1 ) , as formally shown in the theorem below.

Original: Theorem 4.3.
Revised: Theorem 4.3.

Original: Suppose the cost function C t ( s, a, ξ ) is jointly convex in ( s, a ) for any fixed ξ , and the state transition function g t ( s, a, ξ ) is jointly convex in ( s, a ) for any fixed ξ .
Revised: Suppose the cost function C t ( s, a, ξ ) is jointly convex in ( s, a ) for any fixed ξ , and the state transition function g t ( s, a, ξ ) is jointly convex in ( s, a ) for any fixed ξ .

Original: Then the approximate value function (cid:101) V t ( s t , µ t , u t : ) is convex in u t : , for all t < T .
Revised: Then the approximate value function (cid:101) V t ( s t , µ t , u t : ) is convex in u t : , for all t < T .

Original: The jointly convex assumption in Theorem 4.3 is common for gradient-based algorithms for solving multi-stage decision making problems (e.g. [35]).
Revised: The jointly convex assumption in Theorem 4.3 is common for gradient-based algorithms for solving multi-stage decision making problems (e.g. [35]).

Original: It is satisfied in many real-world problems such as inventory control (e.g. [36]) and portfolio optimization (e.g. [37]).
Revised: It is satisfied in many real-world problems such as inventory control (e.g. [36]) and portfolio optimization (e.g. [37]).

Original: We present the full algorithm in
Revised: We present the full algorithm in

Original: Algorithm 2.
Revised: Algorithm 2.

Original: input initial u 

Revised: input initial u

Original: =
Revised: =

Original: ( u 00 , u 01 , · · · , u 0 T − 1 ) , gradient η
Revised: ( u 00 , u 01 , · · · , u 0 T − 1 ) , gradient η

Original: =
Revised: =

Original: , 1 , · · · ; initialization α T ( s T , θ )
Revised: , 1 , · · · ; initialization α T ( s T , θ )

Original: =
Revised: =

Original: C T ( s T ) , ∀ s T ∈ S , ∀ θ ∈ Θ ; k = 0 .
Revised: C T ( s T ) , ∀ s T ∈ S , ∀ θ ∈ Θ ; k = 0 .

Original: while some stopping criterion is met do for t ← T − 1 to 0 do for each action a t ∈ A , compute (cid:101)
Revised: while some stopping criterion is met do for t ← T − 1 to 0 do for each action a t ∈ A , compute (cid:101)

Original: α t ( s t , θ ) according to (8); end approximate the value function (cid:101) V 0 ( s 0 , µ 0 , u k ) :
Revised: α t ( s t , θ ) according to (8); end approximate the value function (cid:101) V 0 ( s 0 , µ 0 , u k ) :

Original: = min (cid:101)
Revised: = min (cid:101)

Original: [Equation]
Revised: [Equation]

Original: 0 (cid:82) Θ (cid:101) α 

Revised: 0 (cid:82) Θ (cid:101) α

Original: ( s 0 , θ ) µ 0 ( θ ) dθ ; compute the gradient ∂ (cid:101) V 

Revised: ( s 0 , θ ) µ 0 ( θ ) dθ ; compute the gradient ∂ (cid:101) V

Original: ∂u k , update the vector u k +

Revised: ∂u k , update the vector u k +

Original: =
Revised: =

Original: u k − η k ∂ (cid:101) V 0 ∂u k , set k
Revised: u k − η k ∂ (cid:101) V 0 ∂u k , set k

Original: = k + 1 .
Revised: = k + 1 .

Original: end output the approximate value function (cid:101) V 

Revised: end output the approximate value function (cid:101) V

Original: ( s 0 , µ 0 , u k ) and the optimal policy (cid:101)
Revised: ( s 0 , µ 0 , u k ) and the optimal policy (cid:101)

Original: [Equation]
Revised: [Equation]

Original: Note that in Algorithm 2, when applying the gradient descent, we need to compute the gradient of the approximate value function w.r.t.
Revised: Note that in Algorithm 2, when applying the gradient descent, we need to compute the gradient of the approximate value function w.r.t.

Original: the vector ( u 0 , u 1 , · · · , u T − 1 ) .
Revised: the vector ( u 0 , u 1 , · · · , u T − 1 ) .

Original: For ∂ (cid:101) V 0 ∂u 0 , we have ∂ (cid:101) V
Revised: For ∂ (cid:101) V 0 ∂u 0 , we have ∂ (cid:101) V

Original: [Equation]
Revised: [Equation]

Original: where (cid:101) a ∗ 0 = arg min a 0 ∈A (cid:82) Θ (cid:101)
Revised: where (cid:101) a ∗ 0 = arg min a 0 ∈A (cid:82) Θ (cid:101)

Original: α 

Revised: α

Original: ( s 0 , θ ) µ 0 ( θ ) dθ .
Revised: ( s 0 , θ ) µ 0 ( θ ) dθ .

Original: For ∂ (cid:101) V 0 ∂u t , t = 1 , · · · , T − 1 , we have ∂ (cid:101)
Revised: For ∂ (cid:101) V 0 ∂u t , t = 1 , · · · , T − 1 , we have ∂ (cid:101)

Original: V∂u t =
Revised: V∂u t =

Original: [Equation]
Revised: [Equation]

Original: ( θ
Revised: ( θ

Original: [Equation]
Revised: [Equation]

Original: dθ
Revised: dθ

Original: [Equation]
Revised: [Equation]

Original: where ∂ (cid:101) α l ∂u t can be computed recursively from ∂ (cid:101)
Revised: where ∂ (cid:101) α l ∂u t can be computed recursively from ∂ (cid:101)

Original: α l +1 ∂u t for l = 1 , · · · , t − 1 .
Revised: α l +1 ∂u t for l = 1 , · · · , t − 1 .

Original: The approximate value function output by Algorithm 2 provides an upper bound on the optimal value function, which is shown in the theorem below.
Revised: The approximate value function output by Algorithm 2 provides an upper bound on the optimal value function, which is shown in the theorem below.

Original: Theorem 4.4.
Revised: Theorem 4.4.

Original: min u t : (cid:101) V t ( s t , µ t , u t : ) is an upper bound for the optimal value function V ∗ t ( s t , µ t ) .
Revised: min u t : (cid:101) V t ( s t , µ t , u t : ) is an upper bound for the optimal value function V ∗ t ( s t , µ t ) .

Original: Even though the approximate value function is an upper bound on the optimal value function, we will later show in the numerical experiments that the gap between these two is small.
Revised: Even though the approximate value function is an upper bound on the optimal value function, we will later show in the numerical experiments that the gap between these two is small.

Original: As a final note, even though we develop the algorithm for the risk functional CVaR, it can be extended easily to other coherent risk measures.
Revised: As a final note, even though we develop the algorithm for the risk functional CVaR, it can be extended easily to other coherent risk measures.

Original: Consider a class of coherent risk measures which can be represented in the following parametric form R ( Z ) :
Revised: Consider a class of coherent risk measures which can be represented in the following parametric form R ( Z ) :

Original: = inf λ ∈ Λ E
Revised: = inf λ ∈ Λ E

Original: [Ψ( Z, λ )] , where Ψ :
Revised: [Ψ( Z, λ )] , where Ψ :

Original: R × Λ
Revised: R × Λ

Original: → R is a real-valued function and Ψ( z, λ ) is convex in ( z, λ ) .
Revised: → R is a real-valued function and Ψ( z, λ ) is convex in ( z, λ ) .

Original: CVaR is an example of such coherent risk measure.
Revised: CVaR is an example of such coherent risk measure.

Original: As another example, consider the following coherent risk measure based on Kullback–Leibler divergence [38], which is also an example given in [35].
Revised: As another example, consider the following coherent risk measure based on Kullback–Leibler divergence [38], which is also an example given in [35].

Original: Here the risk functional takes the form
Revised: Here the risk functional takes the form

Original: [Equation]
Revised: [Equation]

Original: where ϵ is the user-defined ambiguity set size.
Revised: where ϵ is the user-defined ambiguity set size.

Original: It can be easily checked that this coherent risk measure takes the required form R ( Z ) :
Revised: It can be easily checked that this coherent risk measure takes the required form R ( Z ) :

Original: = inf λ ∈ Λ E
Revised: = inf λ ∈ Λ E

Original: [Ψ( Z, λ )] , for some λ and Ψ function.
Revised: [Ψ( Z, λ )] , for some λ and Ψ function.

Original: We can write the dynamic programming equation for the BR-MDP with the above coherent risk measure as:
Revised: We can write the dynamic programming equation for the BR-MDP with the above coherent risk measure as:

Original: [Equation]
Revised: [Equation]

Original: Following the same procedure, we can use α -function to represent the value function, apply the same technique to approximate the α -functions for a given vector λ 0 , · · · , λ T − 1 , and then apply gradient descent on the approximate value function.
Revised: Following the same procedure, we can use α -function to represent the value function, apply the same technique to approximate the α -functions for a given vector λ 0 , · · · , λ T − 1 , and then apply gradient descent on the approximate value function.

Original: The convergence is guaranteed due to the convexity.
Revised: The convergence is guaranteed due to the convexity.

Original: Since the derivation of α -function representation and approximation (obtained by applying Jensen’s inequality) are essentially the same, we omit the full procedures.
Revised: Since the derivation of α -function representation and approximation (obtained by applying Jensen’s inequality) are essentially the same, we omit the full procedures.

Original:  Numerical experiments
Revised:  Numerical experiments

Original: We illustrate the performance of our proposed formulation and algorithms with two offline planning problems.
Revised: We illustrate the performance of our proposed formulation and algorithms with two offline planning problems.

Original: (1) Gambler’s betting problem .
Revised: (1) Gambler’s betting problem .

Original: Consider a gambler betting in the casino with initial money of s 0 .
Revised: Consider a gambler betting in the casino with initial money of s 0 .

Original: At each time stage the gambler chooses
Revised: At each time stage the gambler chooses

Original: how much to bet from a set { 0 , 1 , 2 , 3 , 5 } .
Revised: how much to bet from a set { 0 , 1 , 2 , 3 , 5 } .

Original: The gambler bets for T = 6 rounds.
Revised: The gambler bets for T = 6 rounds.

Original: The cost at each time stage is − a · ξ , where a stands for action of how much to bet, ξ = 2 stands for a win, ξ = − 1 stands for a loss, and the winning rate θ c = P ( ξ = 2) is unknown.
Revised: The cost at each time stage is − a · ξ , where a stands for action of how much to bet, ξ = 2 stands for a win, ξ = − 1 stands for a loss, and the winning rate θ c = P ( ξ = 2) is unknown.

Original: We add a constant c = 10 to make the adjusted cost c − a · ξ non-negative to run our algorithm (since the algorithm requires non-negative stage-wise cost), and then subtract cT from the resultant total adjusted cost to recover the total cost.
Revised: We add a constant c = 10 to make the adjusted cost c − a · ξ non-negative to run our algorithm (since the algorithm requires non-negative stage-wise cost), and then subtract cT from the resultant total adjusted cost to recover the total cost.

Original: The data set consists of historical betting records with size N .
Revised: The data set consists of historical betting records with size N .

Original: (2) Inventory control problem .
Revised: (2) Inventory control problem .

Original: Consider a warehouse manager with initial inventory level s 0 .
Revised: Consider a warehouse manager with initial inventory level s 0 .

Original: At each time stage the manager chooses how much to replenish from the set { 0 , 1 , · · · , M − s } , where M = 15 is the storage capacity.
Revised: At each time stage the manager chooses how much to replenish from the set { 0 , 1 , · · · , M − s } , where M = 15 is the storage capacity.

Original: The customer demand is a random variable ξ following a Poisson distribution with parameter θ c truncated below M C = 20 , which is the maximal customer demand the warehouse can handle.
Revised: The customer demand is a random variable ξ following a Poisson distribution with parameter θ c truncated below M C = 20 , which is the maximal customer demand the warehouse can handle.

Original: The state transition is given by s t +1 = max
Revised: The state transition is given by s t +1 = max

Original: ( s t + a t − ξ t , 0) , the cost function is given by C t ( s t , a t , ξ t ) =
Revised: ( s t + a t − ξ t , 0) , the cost function is given by C t ( s t , a t , ξ t ) =

Original: h t · max( s t + a t − ξ t , 0) + p t · max( ξ t − s t − a t , 0) , where h t is the holding cost and p t is the penalty cost.
Revised: h t · max( s t + a t − ξ t , 0) + p t · max( ξ t − s t − a t , 0) , where h t is the holding cost and p t is the penalty cost.

Original: The final stage cost is set to 0 for simplicity.
Revised: The final stage cost is set to 0 for simplicity.

Original: The manager has to plan for T = 6 time stages.
Revised: The manager has to plan for T = 6 time stages.

Original: The data set consists of historical customer demands with size N .
Revised: The data set consists of historical customer demands with size N .

Original: We compare the following approaches.
Revised: We compare the following approaches.

Original: (1) BR-MDP (e.): exact dynamic programming (Algorithm 1), where the state s t and µ t are discretized to a fine grid to carry out the dynamic programming (see Appendix for details).
Revised: (1) BR-MDP (e.): exact dynamic programming (Algorithm 1), where the state s t and µ t are discretized to a fine grid to carry out the dynamic programming (see Appendix for details).

Original: (2) BR-MDP (a.): approximate dynamic programming (Algorithm 2).
Revised: (2) BR-MDP (a.): approximate dynamic programming (Algorithm 2).

Original: (3) Nominal: maximal likelihood estimation (MLE) estimator θ MLE is computed from the given data, and then a policy is obtained by solving the MDP with parameter θ MLE .
Revised: (3) Nominal: maximal likelihood estimation (MLE) estimator θ MLE is computed from the given data, and then a policy is obtained by solving the MDP with parameter θ MLE .

Original: (4) DR-MDP: distributionally robust MDP presented in [1].
Revised: (4) DR-MDP: distributionally robust MDP presented in [1].

Original: For each of the considered approaches, we obtain the corresponding optimal policy for a same data set, and then evaluate the actual performance of the obtained policy on the true system, i.e., MDP with the true parameter θ c .
Revised: For each of the considered approaches, we obtain the corresponding optimal policy for a same data set, and then evaluate the actual performance of the obtained policy on the true system, i.e., MDP with the true parameter θ c .

Original: This is referred to as one replication, and we repeat the experiments for 100 replications on different independent data sets.
Revised: This is referred to as one replication, and we repeat the experiments for 100 replications on different independent data sets.

Original: Results for the gambler’s betting problem can be found in Table 1a, Table 2, Figure 1a and Figure 1b.
Revised: Results for the gambler’s betting problem can be found in Table 1a, Table 2, Figure 1a and Figure 1b.

Original: Results for the inventory control problem can be found in Table 1b.
Revised: Results for the inventory control problem can be found in Table 1b.

Original: [Table] [Table]
Revised: [Table] [Table]

Original: Table 1 reports the average computation time to obtain the optimal policy and the mean and variance of the actual performance of the obtained policy over the 100 replications.
Revised: Table 1 reports the average computation time to obtain the optimal policy and the mean and variance of the actual performance of the obtained policy over the 100 replications.

Original: Table 2 reports the actual performance of different formulations over 100 replications with different data size N = 5 , 10 , 100 .
Revised: Table 2 reports the actual performance of different formulations over 100 replications with different data size N = 5 , 10 , 100 .

Original: We have the following observations.
Revised: We have the following observations.

Original: (1) Robustness of BR-MDP : BR-MDP is the most robust in the sense of balancing the mean (smaller mean cost) and variability (smaller variance) of the actual performance of its solution.
Revised: (1) Robustness of BR-MDP : BR-MDP is the most robust in the sense of balancing the mean (smaller mean cost) and variability (smaller variance) of the actual performance of its solution.

Original: In contrast, the nominal approach has much larger variance, especially when the data size is small, indicating it is not robust against parameter uncertainty.
Revised: In contrast, the nominal approach has much larger variance, especially when the data size is small, indicating it is not robust against parameter uncertainty.

Original: On the other hand, DR-MDP is overly conservative since the variance of actual performance is 0 and the mean is the largest (i.e., the worst) among all approaches.
Revised: On the other hand, DR-MDP is overly conservative since the variance of actual performance is 0 and the mean is the largest (i.e., the worst) among all approaches.

Original: This conservativeness is often not desirable: for example, in the betting problem, DR-MDP always chooses the conservative action “not bet”, which is obviously not optimal when θ c (probability of winning) is large and the goal is to minimize the expected cost.
Revised: This conservativeness is often not desirable: for example, in the betting problem, DR-MDP always chooses the conservative action “not bet”, which is obviously not optimal when θ c (probability of winning) is large and the goal is to minimize the expected cost.

Original: (2) Efficiency of the approximation algorithm for BR-MDP : the computation time of the approximation algorithm for BR-MDP is less than 1/10 of that of the exact algorithm, while the performance (mean, variance) is not much different.
Revised: (2) Efficiency of the approximation algorithm for BR-MDP : the computation time of the approximation algorithm for BR-MDP is less than 1/10 of that of the exact algorithm, while the performance (mean, variance) is not much different.

Original: (3) Larger data size reduces parameter uncertainty : as expected, as we have more data, the uncertainty about model parameters reduces.
Revised: (3) Larger data size reduces parameter uncertainty : as expected, as we have more data, the uncertainty about model parameters reduces.

Original: Hence, the benefit of considering future data realization in BR-MDP decreases compared to the nominal approach, resulting in their similar performance when the data size is large ( N = 100 in our examples).
Revised: Hence, the benefit of considering future data realization in BR-MDP decreases compared to the nominal approach, resulting in their similar performance when the data size is large ( N = 100 in our examples).

Original: The reason is that both the posterior distribution (used in BR-MDP) and the MLE estimator (used in the nominal approach ) converge to the true parameter as data size goes to infinity.
Revised: The reason is that both the posterior distribution (used in BR-MDP) and the MLE estimator (used in the nominal approach ) converge to the true parameter as data size goes to infinity.

Original: Figure 1a shows the histogram of actual performance over 100 replications for the nominal approach and CVaR BR-MDP (exact) with different confidence levels α = 0 .
Revised: Figure 1a shows the histogram of actual performance over 100 replications for the nominal approach and CVaR BR-MDP (exact) with different confidence levels α = 0 .

Original: under θ c = 0 .
Revised: under θ c = 0 .

Original: We have the following observations combining Table 1 and Figure 1a:
Revised: We have the following observations combining Table 1 and Figure 1a:

Original: (1) Robustness of BR-MDP : BR-MDP (both exact and approximate) produce more consistent solution performance across a wide range of input data compared to the nominal approach, which can be seen from the smaller variance in Table 1 and more concentrated distribution of the actual performance in Figure 1a.
Revised: (1) Robustness of BR-MDP : BR-MDP (both exact and approximate) produce more consistent solution performance across a wide range of input data compared to the nominal approach, which can be seen from the smaller variance in Table 1 and more concentrated distribution of the actual performance in Figure 1a.

Original: (2) Benefit of learning from future data realization (time consistency) :
Revised: (2) Benefit of learning from future data realization (time consistency) :

Original: Figure 1a shows that in the betting problem with θ c = 0 .
Revised: Figure 1a shows that in the betting problem with θ c = 0 .

Original: 45 , the nominal approach has 40 replications where MLE estimator θ MLE < 0 .
Revised: 45 , the nominal approach has 40 replications where MLE estimator θ MLE < 0 .

Original: 33 and the gambler chooses not to bet, which is not the optimal action.
Revised: 33 and the gambler chooses not to bet, which is not the optimal action.

Original: In contrast, BR-MDP formulation learns from the future data realization and updates its posterior distribution on θ .
Revised: In contrast, BR-MDP formulation learns from the future data realization and updates its posterior distribution on θ .

Original: As a result, in those 40 replications, the gambler initially chooses not to bet, but after some time chooses to bet, which results in the left-shift of
Revised: As a result, in those 40 replications, the gambler initially chooses not to bet, but after some time chooses to bet, which results in the left-shift of

Original: the actual performance distribution.
Revised: the actual performance distribution.

Original: This illustrates time consistency (or in other words, adaptivity to the data process) of our BR-MDP formulation.
Revised: This illustrates time consistency (or in other words, adaptivity to the data process) of our BR-MDP formulation.

Original: This illustration is even more evident by the comparison between DR-MDP and BR-MDP with α = 1 (CVaR with α =corresponds to the worst-case measure), where the only difference is that BR-MDP takes a nested form of risk functional while DR-MDP uses a static one.
Revised: This illustration is even more evident by the comparison between DR-MDP and BR-MDP with α = 1 (CVaR with α =corresponds to the worst-case measure), where the only difference is that BR-MDP takes a nested form of risk functional while DR-MDP uses a static one.

Original: (3) Effect of risk level : risk level α affects the conservativeness of BR-MDP; as α increases, the gambler is more likely to take a conservative action (which is not to bet), so the actual performance distribution will shift more to the right.
Revised: (3) Effect of risk level : risk level α affects the conservativeness of BR-MDP; as α increases, the gambler is more likely to take a conservative action (which is not to bet), so the actual performance distribution will shift more to the right.

Original: (4) Effectiveness of
Revised: Effectiveness of

Original: the approximation algorithm for BR-MDP
Revised: the approximation algorithm for BR-MDP

Original:  Figure 1b plots the value function V ∗  s 0 ,
Revised: : Figure 1b plots the value function V ∗ 0 ( s 0 ,

Original: µ
Revised: µ

Original: 0 ) of BR-MDP (exact) and ˜ V ∗ 0 ( s 0 , µ 0 ) of BR-MDP (approx) under different prior distributions µ 0 with θ c = 0 . 45 , verifying Theorem 4.4 that ˜ V ∗ 0 ( s 0 , µ 0 ) is indeed an upper bound for V ∗ 0 ( s 0 , µ 0 ) but the difference between these two is small.
Revised: 0 ) of BR-MDP (exact) and ˜ V ∗ 0 ( s 0 , µ 0 ) of BR-MDP (approx) under different prior distributions µ 0 with θ c = 0 . 45 , verifying Theorem 4.4 that ˜ V ∗ 0 ( s 0 , µ 0 ) is indeed an upper bound for V ∗ 0 ( s 0 , µ 0 ) but the difference between these two is small.

Original:  Conclusion
Revised:  Conclusion

Original: In this paper, we propose a new formulation, coined as Bayesian Risk MDP (BR-MDP), to provide robustness against parameter uncertainty in MDPs.
Revised: In this paper, we propose a new formulation, coined as Bayesian Risk MDP (BR-MDP), to provide robustness against parameter uncertainty in MDPs.

Original: BR-MDP is a time-consistent formulation with a dynamic risk functional that seeks the trade-off between the posterior expected performance and the robustness in the actual performance.
Revised: BR-MDP is a time-consistent formulation with a dynamic risk functional that seeks the trade-off between the posterior expected performance and the robustness in the actual performance.

Original: For finite-horizon BR-MDP with the CVaR risk functional, we develop an efficient approximation algorithm by drawing a connection between BR-MDPs and
Revised: For finite-horizon BR-MDP with the CVaR risk functional, we develop an efficient approximation algorithm by drawing a connection between BR-MDPs and

Original: POMDPs and deriving an approximate alpha-function representation that remains a low computational cost.
Revised: POMDPs and deriving an approximate alpha-function representation that remains a low computational cost.

Original: Our experiment results demonstrate the efficiency of the proposed approximate algorithm, and show the robustness and the adaptivity to future data realization of the BR-MDP formulation.
Revised: Our experiment results demonstrate the efficiency of the proposed approximate algorithm, and show the robustness and the adaptivity to future data realization of the BR-MDP formulation.

Original: One of the limitations of our work is the parametric assumption on the distribution of randomness.
Revised: One of the limitations of our work is the parametric assumption on the distribution of randomness.

Original: In the future work, we wish to extend the BR-MDP formulation to non-parametric Bayesian setting, and evaluate the performance of the proposed formulation and algorithm on real-world data sets in more challenging problems.
Revised: In the future work, we wish to extend the BR-MDP formulation to non-parametric Bayesian setting, and evaluate the performance of the proposed formulation and algorithm on real-world data sets in more challenging problems.

Original: In addition, the proposed alpha-function approximation algorithm provides an upper bound of the exact value, while there is no theoretical guarantee on the gap between the two.
Revised: In addition, the proposed alpha-function approximation algorithm provides an upper bound of the exact value, while there is no theoretical guarantee on the gap between the two.

Original: In future we will develop more efficient approximation algorithms with a convergence guarantee, such as methods based on stochastic dual dynamic programming.
Revised: In future we will develop more efficient approximation algorithms with a convergence guarantee, such as methods based on stochastic dual dynamic programming.

Original: There are also other interesting directions, such as extending the BR-MDP formulation to an infinite horizon problem and utilizing function approximation to improve the scalability of the proposed approach to more complex domains.
Revised: There are also other interesting directions, such as extending the BR-MDP formulation to an infinite horizon problem and utilizing function approximation to improve the scalability of the proposed approach to more complex domains.

Original: Acknowledgments and Disclosure of Funding
Revised: Acknowledgments and Disclosure of Funding

Original: The authors gratefully acknowledge the support by the Air Force Office of Scientific Research under Grant FA9550-19-1-0283, and National Science Foundation under Grant DMS2053489.
Revised: The authors gratefully acknowledge the support by the Air Force Office of Scientific Research under Grant FA9550-19-1-0283 and Grant FA9550-22-1-0244, and National Science Foundation under Grant DMS2053489.