Intrinsic optimality of the linear evaluation complexity measure
Determine whether the instance-dependent quantity \(\rho^\star\), defined as the minimum over mixtures of target policies of the maximum quadratic uncertainty of their feature means under the mixture’s feature second-moment matrix, captures the intrinsic difficulty of simultaneous policy evaluation in stochastic contextual bandits with linear reward structure.
References
An open question is whether $\rho\opt$ captures the intrinsic difficulty of evaluation in the linear setting. Our analysis provides an upper bound in terms of this quantity, but does not establish its necessity. Matching lower bounds would help determine when mixtures of target policies achieve the optimal evaluation cost and whether more general sampling strategies can improve upon them.