__ Summary and Contributions__: This paper proposes a couple of risk-sensitive reinforcement learning algorithms and analyzes their regret. The results illuminate very interesting dependency of the regret on risk-sensitivity. In particular, the their regret recovers the known regret of risk-neutral case as the risk-sensitivity parameter tends to 0, and their regret shows exponential dependency on the risk-sensitivity parameter for both risk-seeking and risk-averse cases. The paper not only discuss the upper bound on the regret but also the lower bound, where the exponential dependency on the risk-sensitivity parameter also appears.

__ Strengths__: The major strength of the paper is in the new insights regarding how the regret depend on the risk-sensitivity. The authors well explain this point in terms of aleatoric uncertainty and epistemic uncertainty. The regret bounds involving the risk-sensitivity parameter is a first of a kind, and the lower and upper bounds are sufficiently tight to discuss the dependency on the risk-sensitivity parameter. In addition, the proposed algorithms appear to be useful in practice.

__ Weaknesses__: The main part of the proofs of the regret bounds are in the supplementary material, which I have not checked, and there are no numerical support for the main results either. So, I have to believe the stated results, but if I believe them, the results are very significant, novel, and relevant.

__ Correctness__: It is hard to judge the correctness. I have not checked the proofs, and there are no numerical support.

__ Clarity__: Very well written.

__ Relation to Prior Work__: Very clear.

__ Reproducibility__: Yes

__ Additional Feedback__: The discussion about scaling around Lemma 1 could also be made with the properties of entropic risk measure such as (1/beta) log E[exp(beta c)] = c for constant c (e.g. footnote 4 of [48]).
Step 10 of Algorithm 1 should have dependency on \phi(s,a).
I would also like to see discussion about what happens when we use non-linear functional approximator in Algorithm 1. How much does the regret rely on the linear functional approximator in (8)?
L218: "bonu as"
--
Thank you for the responses.

__ Summary and Contributions__: The authors propose two model-free algorithms for reinforcement learning in finite, episodic MDPs with risk-sensitive objective. Regret bounds are derived for the proposed algorithms and are shown to be consistent with existing results under the risk-neutral setting.

__ Strengths__: The results are mainly theoretical. Both the algorithms and the regret bounds seem novel for this setting. The regret bounds also provide useful insights regarding the tradeoff between risk sensitivity and sample efficiency.

__ Weaknesses__: It is unclear whether the proposed algorithms and the regret analysis here have any practical relevance. It is unclear how the universal constant in the exploration bonus should be chosen if one actually wants to implement the algorithms.

__ Correctness__: I did not check the proofs but the results seem plausible.

__ Clarity__: The paper is easy to read. The presentation is clear.

__ Relation to Prior Work__: The authors did a decent job connecting this work with prior works.

__ Reproducibility__: Yes

__ Additional Feedback__: Some empirical demonstrations of the practical relevance of the proposed algorithms would be helpful.
===== Post-Rebuttal =====
I have read the authors' feedback, I maintain my score. Thank you.

__ Summary and Contributions__: This paper studies a risk-sensitive RL problem where the value function is log of expectation of exponential with the power being a (scaled) return. The problem statement is well presented and risk-sensitiveness is well explained in this formulation. The paper introduce (is it your contribution?) the Bellman equation for this problem, which is nonlinear in contrast to the risk-neutral (common) RL setting.

__ Strengths__: The paper then proposes two algorithms, one for batch setting, the other for online setting, how to learn the value function using Q-learning, as well as regret bound for the two algorithms.

__ Weaknesses__: The algorithms are actually straightforward and I don't see challenges brought by the nonlinearity (please clarify why nonlinearity is a challenge, what kinds challenge you mean).

__ Correctness__: yes.

__ Clarity__: yes.

__ Relation to Prior Work__: yes.

__ Reproducibility__: Yes

__ Additional Feedback__:
The regret in Lemma 1 is also straightforward.
The algorithmic idea is to minimizing the Bellman error. (eqn 8), with the TD target being the corresponding exponentialized one. So algorithm novelty is Okay. The key contribution of the paper is the regret bound analysis of the two algorithms, which is mostly built on Taylor series approximation of the value function.
Theorem 1 and 2 present the regret bound of the two algorithms, following an analysis similar to UCB, drawing from a Taylor expansion approximation of the (nonlinear) Bellman equation.
Theorem 3 shows the lower bound of the algorithms.
the b_h was not introduced in algorithm presentation (below eqn 8). It is a UCB term.
No experiments were presented (a bit odd for an algorithmic paper).
Post-rebuttal:
I've read the rebuttal and other reviews. I'm satisfied with the answers to my question and I maintain my recommendation for acceptance.