Improved Sample Complexity Analysis For First Order Bilevel Reinforcement Learning

Bilevel reinforcement learning optimizes an upper-level objective through the policy response to a lower-level reinforcement learning problem. Such problems arise when learning a reward model while adapting a policy to that reward. However, a gap remains between sample-complexity guarantees and practical actor–critic training. Tabular analyses restrict applicability to finite spaces, while continuous-state analyses often impose a uniform Polyak-Lojasiewicz (PL) condition. We show that this condition need not hold even for smooth positive policies with exactly representable values. We develop a single-loop, fully first-order method for continuous states and finite actions with specified multilayer neural actors and a persistently trained nonlinear critic built from fixed features. Under explicit initialization, regularity, feature-excitation, and value-realizability conditions, fixed reference-KL regularization yields local curvature, and we prove containment of the coupled iterates. Shared trajectories control sampling noise, while paired critic analysis controls normalized critic-error differences as the response perturbation shrinks. A joint descent and tracking argument establishes an improved $\tilde{\mathcal{O}}({\epsilon }^{-2})$ sample complexity for $O(\epsilon )$ expected squared gradient norm of the upper objective induced by the selected regularized policy response, including critic training.