- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper studies policy learning with many treatments, given an ML predictor and a doubly robust score. The paper proposes a family of first-order corrections to a softmax policy target and derives the optimal weight matrix for a local quadratic target and orthogonality. They show that $A=I$ uniquely achieves first-order orthogonality with respect to the preliminary predictor, whereas minimizing local quadratic target risk yields , which balances prediction error against causal-score noise.
Critical strengths
-
The problem is well-motivated. When there is multiple treatments, using a double robust estimator alone can have large variance, and using an ML predictor alone can have large bias.
-
This paper derives the closed-form characterization of the weight matrix A for orthogonality and local quadratic loss.
Critical weaknesses
-
This paper only considers the softmax of the policy value, which is only an approximation of the optimal policy value. I wonder if it is possible to generalize the results to the optimal policy value.
-
Similar techniques have already appeared in the literature. For example, [1] uses softmax smoothing to develop an inference method for the optimal policy value. This paper does not discuss the connection and differences with this paper. At a rough glance, [1] seems to have a similar orthogonal estimator and has developed an inference theorem for their estimator.
-
This paper discusses the optimal weight for the local MSE weight, but under that weight (or even for the proposed weight ), the estimator is not orthogonal, and it is hard to do inference. I wonder if there is a way to do inference while still achieving a good MSE loss.
[1] Whitehouse, J., Chen, Q., Austern, M., and Syrgkanis, V. (2025). “Inference on Optimal Policy Values and Other Irregular Functionals via Softmax Smoothing.” arXiv preprint, arXiv:2507.11780.
Questions for authors
Please see the critical weakness section.