Summary and Contributions: This paper looks at the problem of efficient exploration within factored MDPs where the conditional independence structure is already known. The authors do a good job reviewing the literature in this area, providing insight into the structures and mechanisms in this problem and propose two new algorithms for exploration in this setting. In short, these algorithms extend the recent work in non-factored MDPs (e.g. Azar et al, Zanetter + Brunskill) to factored MDPs.. The main support for this paper comes in the form of theoretical bounds, which seem reasonable according to "standard machinery". However, with a 31 page appendix and dense/technical issues I have to admit i did not verify this during the time pressure of NeurIPS reviews... this should be a significant concern and something that we need to review if all reviewers end in the same boat!
Strengths: There are several things to like about this paper: - It is extremely well-written and easy to follow, even though this is a dense/techincal subject matter. - It seems to elegantly combine (mostly known) tools and techniques to provide results that are genuinely new (if somewhat unsurprising). - The discussions of lower bounds and "degenerate structures" provides some valuable insight into the area that can be confusing... this is probably one of the most clear pieces of work I've seen in this area!
Weaknesses: However, there are some places this paper still has some weaknesses: - The main regret theorems appear to be mostly an exercise in mathematics without too much new insight... it's fine, but I don't think these results are particularly groundbreaking. (I do think the other lower bound results are nice though). - The proofs/appendix are a total of 30+ dense pages of algebra... at some point this feels like we are heading the wrong direction in the field with the "standard machine" of Bernstein-bounds? I think/hope that someone will come along with new tools/insights that can help with something a bit more elegant..
Correctness: Again, I have to admit I did not check this carefully. The general "feel" of the proof and sketches are reasonable, but I hope that someone else has done the hard work of checking this. I don't think it is possible to fully verify these claims without going through the appendix... and even then that could take at absolute minimum a full day of careful inspection.
Clarity: This paper is extremely well written.
Relation to Prior Work: Yes, the relation to prior work and placement of algorithms is top notch!
Additional Feedback: Given my comments on review, I am going to say I think this is a good paper, but keep a relatively low confidence. ============ Post rebuttal: I probably stand by that the new insight in the regret is not hugely significant, yes the result per se is new... but similar flavour of results adapted previous UCRL results to factored MDP: https://arxiv.org/abs/1403.3741 So, in this sense I don't find it particularly surprising that a similar result would translate from the UCBVI work: https://arxiv.org/abs/1703.05449 In a sense, this feels more like "filling in the gaps" than truly striking new territory. That said, I maintain my recommendation that this is a good paper and think it deserves acceptance. My worry is that the 30+ pages of appendix could hide a subtle bug... the good news is that because we have a few reviewers here + the general "feel" of the result seems right I am not too worried. I do have a more general feeling that this line of research maybe needs some new breakthrough/insight to really scale things up... That said, great paper, really well written and think it will be great for the conference.
Summary and Contributions: The paper analyzes the regret of algorithms in finite-horizon MDPs from a fixed start state, specifically when the transition dynamics are captured by a known graphical model structure. It provides lower bounds and roughly matching upper bounds using a cross-component exploration approach.
Strengths: The paper presents a well-scoped problem and provides state of the art results for this problem.
Weaknesses: The paper describes its principal conceptual advance as follows: "The key algorithmic technique that we needed to develop was a careful design of “cross-component” bonuses to ensure optimism and guide the exploration." But, very little time is spent conveying the insight and the intuitions behind this advance in a way that would help the reader use the idea in other contexts.
Correctness: Claims/methods appear correct.
Clarity: Paper is adequately clear.
Relation to Prior Work: Prior work on analyzing algorithms for finite-horizon MDPs is summarized in a useful way.
Additional Feedback: Response to author feedback: From the informal discussion about the cross-component counters, I'm getting that it's somehow bad if different components have been explored unevenly and therefore encouraging more balanced exploration (pairwise) reduces overall variance in the amount of exploration between components. I'm sure there's a lot I'm not getting, but that helps a bit. Regarding "factored MDP", I'm still not buying it. I think it should be the case that you recover an object when you multiply its factors together (for the appropriate definition of "multiply"). There are papers (well, just one I can think of) that deal with truly factored MDPs that are the product of simpler MDPs. They correctly call their MDPs factored. What you (and, I know, many before you) call "factored MDPs" do not have this property. The transition probabilities are indeed factored, as the probability of an outcome can be constructed by multiplying the probabilities of the outcomes of their components. But, that's just part of an MDP, so the MDP object itself is NOT factored. I understand that I'm fighting a losing battle here, but one tries where one can... Original review follows. I object to the term "Factored Markov Decision Processes" because the MDP isn't factored, just its state-space representation is. (Edit: "and transition probabilities".) "develop near-optimal regret bound of FMDPs" -> "develop a near-optimal regret bound for FMDPs". "A key benefit of FMDPs": I think there are a lot of caveats that belong here. FMDPs CAN result in lower representational, computational and sample complexity, but they need not (worst case). I think you need to acknowledge that fact to avoiding leaving in inaccurate impression. "size of the scope of the i-th component": "Scope" is (yet) not defined. "or essentially": Can you be more specific? Is it "equivalently" or "which implies"? Or something else? To be "essentially" seems like "approximately", which isn't a very formal thing to say. "nondegerate" -> "nondegenerate"? Throughout the bibliography capitalization is an issue (mdp, bernstein, more, q, etc.) Please review and fix.
Summary and Contributions: The paper presents two algorithms for finite horizon factored MDPs with a rigorous regret analysis. Lower bound results suggest that one of the algorithms has an optimal regret bound and the other has a slightly worse bound.
Strengths: The paper makes strong theoretical contributions to the literature on factored MDPs where both states and actions are factored.
Weaknesses: The work does not consider function approximation and assumes an oracle solver for for the MDPs. It also assumes the factors of the state and reward variables are given.
Correctness: The claims and proofs in the paper appear to be correct.
Clarity: The paper is well written in spite of the technical depth and the notation.
Relation to Prior Work: The prior work is described well and covers the relevant papers.
Additional Feedback: Equation 1 and the last line in page 3, shouldn't r_i's be R_i's? Please give an intuitive explanation of why the cross-component bonuses are needed. If you need them, why is it sufficient to stop there and not consider higher order interactions, i.e,., between triples of features. I have read the authors' response. I stand by my review and support the paper. Line 197. I believe you mean "unknown" here. Line 200. What do you mean by the bounds do not assume the knowledge of actual Q_i, R_i and G - since they occur in the bound.
Summary and Contributions: This paper introduces two reinforcement algorithms for exploration in factored MDPs. The authors also provide worst case and problem dependant regret bounds for each algorithm. Lower bounds for regret in factored MDPs are also provided in the paper.
Strengths: This work shows that Bernstein-type exploration bonuses can be applied to the setting of factored MDPs which allows to regret bounds for factored MDPs bby a factor \sqrt(H). The author made the effort to provide both worst-case and problem specific bounds for their algorithm. The provided lower bounds are also useful to understand the complexity of factored MDPs.
Weaknesses: My main issue with this work is the lack of novelty. This work simply extends Bernstein type bonuses to factored MDPs and appear incremental. The analysis is not trivial and quite technical and relies mostly on a clever telescoping trick. However the paper does not provide new proof techniques that could be applied in other setting. In its current state I believe the work is incremental and I cannot recommend acceptance. The setting also seems a bit restrictive given that the factorization must be known. At the moment it is not clear if factored MDPs are useful without a lot of prior knowledge about the environment. Post rebuttal update: After reading the author response I agree that the regret bound provided is indeed interesting given that the transition and reward factorizations may differ arbitrarily, this is something I had missed. I updated my score accordingly.
Correctness: I was not able to do a detailed review of the proof in the appendix.
Clarity: The paper is well written and easy to follow. The proof sketch was helpful to understand the analysis of the paper.
Relation to Prior Work: Related work is appropriately discussed.