__ Summary and Contributions__: This paper present an extension of Contextual Bandits to continuous action spaces. Them main idea is to simultaneously discretize the action space into a regular 1-D grid and to smoothen the policy, by allowing an action to be drawn randomly from an interval centered around the grid points. One key point is to ensure the efficiency of the algorithm: this is realised by reducing the problem to building a binary tree of cost-sensitive multi-class classifiers, that can be trained efficiently and incrementally on-line. A computational complexity of O(logK) is achieved, where K is the discretization level.

__ Strengths__: * This work has strong theoretical grounding and, to the best of my knowledge, is quite novel in the way it addresses both the efficiency and discretization issues.
* The approach (by reduction to a set of cost-sensitive multi-class classification problems) is elegant and simple.

__ Weaknesses__: * Relevant to a minority of the NeurIPS community
* The experimental section -limited to on-line regression problems - is a bit disappointing. The experimental part should have addressed true and realistic contextual bandits problems (e.g. all the concrete examples and cases cited in the second paragraph of the introduction; reinforcement learning problems).
* There are some important hyper-parameters in the method. How to choose them in function of the task and the dataset (except by brute-force, as it is done in Algorithm 3) remains an open issue.
EDIT AFTER Rebuttal: @authors: it would be great if you can include the paragraph in the rebuttal that handles that point in the paper as well.

__ Correctness__: Claims, theorems and proofs seem to be correct (to the best of my understanding and knowledge).

__ Clarity__: The paper is well written: motivations are clearly exposed, ideas and methods are well structured and the paper is, globally, easy to read (even if some sections need to be read two times before being understandable).

__ Relation to Prior Work__: To the best of my knowledge, the paper explains clearly the landscape of the current state-of-the-art and how the proposed approach differs from it.

__ Reproducibility__: Yes

__ Additional Feedback__: It will be useful to better describe the link and relationship between the choice of h (smoothing bandwidth) and K (discretization level), and how this choice influences the bias/variance trade-off.
Minor comments:
* Line 110: add 'h' subscript to 'Smooth' (Smooth --> Smooth_h)
* Line 194: replace 'line 5 in CATS' by 'line 5 in Train_Tree)
* Line 6 of Algo3: replace $T_{t,h}^{...}$ by $T_{t}^{...}$. BTW, why to draw randomly from the set and not to choose the last one (i.e t=T)?

__ Summary and Contributions__: ---- I have read the rebuttal and I am still convinced that it is a good paper and a clear accept.
The paper reduces contextual bandits with continuous actions places to cost sensitive classification over a discretized set of actions followed by uniform smoothing. The algorithm is made efficient by making the policy class to be a hierarchical tree policy class, where at each internal mode there is a binary classification pool-icy from some class F. The algorithm has a train and prediction cost of O(log K) per example (K is the number of discretized arms). Regret guarantees are provided in the realizable setting. Some empirical comparisons are done comparing the algorithm to contextual bandits with policy class dTree and standard one vs all.

__ Strengths__: 1. The algorithm is a reduction style algorithm. Thus any progress ins tree based extreme classification can be carried over to this approach in a seem-less manner.
2. The proposed algorithm has a computational training cost and inference cost of O(log K) per sample. This can support a much finer discretization of the space in a computationally efficient manner.
3. Formal regret guarantees are provided for the algorithm. Except for the K^{2/3} dependence, the guarantee seems to be optimal.

__ Weaknesses__: 1. The paper is very terse in some important areas which made it difficult to understand some of the claims.
For instance, I do not fully understand the point being made in line 208 to 213. It would be great of the authors add an example as to why the cost of finding the nodes which need to be updated is only O(log K).
2. The dependency on K in the regret if O(K^{2/3}), which does not seem to be optimal as mentioned in the paper as well. Intuitively epoch-greedy algorithm should have the usual K^{1/3} dependency. However, I do not fully understand the explanation or guess provided in the paper wrt why this happens. In the realizable setting, what exactly is the approximation in Train_tree in terms of computing the ERM? It would be great if the authors can add some explanation regarding this.
3. It is not clear what exactly the dTree based algorithm is in the empirical results. Is the algorithm just discretizing the set and treating them as K arms. Then the filter-tree algorithm is used as the function class for contextual bandits?

__ Correctness__: I think the claims are correct. The empirical methodology is correct and adequate for the setting. It would however be a bonus to compare with CGP-UCB style algorithms.

__ Clarity__: The paper is clearly written modulo the terse-ness related issues I mentioned above.

__ Relation to Prior Work__: Prior work is discussed adequately.

__ Reproducibility__: Yes

__ Additional Feedback__:

__ Summary and Contributions__: +++++
The authors have done a good job on the rebuttal, I assume they will update correspondingly according to all comments and suggestions, hence I increased my score.
+++++
This submission tries to study stale contextual bandits with continuous actions having the unknown structure to make you choose the best action given the context and comparing it with dLinear and dTree.

__ Strengths__: 1. this draft is easy to understand and follow that extends from [35]'s data-dependent regret bounds as[2]
2. your core idea of smoothing of /epsilon-greedy as[3] and discrete action space is expected
3. training tree is a subset of graphical structure like clusters of graphs found

__ Weaknesses__: 1. your abstract need to rewrite to describe what are the main challenges and how you solve them in order to advance this field
2. your contributions are problematic, you may want to write, why you propose those are way more important
3. in fig 1 your proposed method achieves performance similar to dLinear

__ Correctness__: Yes

__ Clarity__: Readable, but away from high quality

__ Relation to Prior Work__: Not yet

__ Reproducibility__: Yes

__ Additional Feedback__: 1. baselines are too few and weak, related state-of-the-art that replaced traditional contextual bandits you may want to compare to demonstrate your significance: [1]Fast Distributed Bandits for Online Recommendation Systems, [2]On Context-Dependent Clustering of Bandits, [3]Improved Algorithm on Online Clustering of Bandits, especially with [2,3]'s regret analysis that sharing the same spirit of data-dependent and exploration
2. about naive implementation and corresponding places in the draft you may remove that is trivial to save some spaces
3. your main assumptions are impractical and unrealistic, Theorems 6 and 7 their practical insights are unclear
4. your experimental results are not significant, e.g., data sets' brief description should be described, and you relay on a specific platform which is another drawback, you may want to report generic experimental environments for a large-scale setting as[1] to show your practicalness
5. your conclusion is not well-shaped too, overall writing throughout can be largely improved

__ Summary and Contributions__: The paper proposes a computationally tractable algorithm for contextual bandits with continuous actions. The algorithm is a tree algorithm that has sub-linear regret with respect to the tree policy class under realizability assumption. An off-policy version of the algorithm is also proposed and analyzed. Simulation experiments demonstrate that the algorithm has superior performance compared to other benchmark algorithms.

__ Strengths__: The problem studied is very relevant to the NeurIPS community. The results showed in this paper seem significant because of the exponential improvement in the computational complexity of the proposed algorithm. The argument is convincing because the simulation experiments verify that the proposed algorithm performs similarly to an algorithm with exponentially worse complexity argument, and performs better than an algorithm with similar complexity. It is also good to see that off-policy optimization works for the proposed algorithm because theoretically and empirically.

__ Weaknesses__: I cannot think of any obvious limitation.

__ Correctness__: I am not familiar with relevant literature on tree policies or discretized algorithms for bandits so I am unable to verify the details of the proofs. The theoretical claims look correct and the simulation experiments are convincing.

__ Clarity__: Perhaps because I am not familiar with relevant literature, I find the discussion section starting on line 47 a little bit hard to follow. Is the “smoothing” approach the main innovation? When will the best single action impossible to find? Why do we need to guess width but the location can be automatically adjusted?
Other than this, the paper is in general well-written.

__ Relation to Prior Work__: Yes, the relation to prior work is clearly discussed.

__ Reproducibility__: Yes

__ Additional Feedback__: I have a few questions for the authors.
1. Is it possible to theoretically show or at least empirically check that the thee realizability assumption is satisfied?
2. Why are the confidence intervals calculated with a single run instead of multiple runs? Is it because of the computational time or resources?
3. Line 264 states that you believe the suboptimal dependence on K is a price to pay for using the computationally efficient algorithm, is there any evidence to support this claim?
------------------
The author's response answers my questions. But I would like to keep my score the same.