Renewed interest in applications-oriented gradient-based solutions to BLPPs [1]}, led to several works establishing the techniques for obtaining lower level solution gradients with respect to the parameters [2]} and doing so efficiently for convex problems [3]}, [4]}, [5]}. Several computationally optimized, program-form specific approaches have been shown [6]}, [7]}. Most recently [8]}, [9]} apply the techniques to large-scale programs. Most of these applications-oriented works focus on deriving gradient expressions—to be used with a gradient-only BLPP optimizer. These works do not consider the loss landscape or the local curvature of the BLPP; in contrast, in this work, we attempt to quantify that.
