- Rating
- 3(+2)
- Confidence
- 3
- Informativeness
- 2(+1)
- Presentation
- 2
- Soundness
- 3(+1)
Read review
Paper summary
This paper considers performative bilevel optimization problems where the inner distribution depends on the outer variable and the outer distribution depends on the inner variable. The authors assume these distributions evolve linearly with respect to these variables and propose AdaBiO, an algorithm that jointly solves the problem, leveraging approximate implicit differentiation, and learns the linear map describing the distributions' evolution. They provide a complexity result of . A numerical illustration with the Give Me Some Credit dataset is provided.
Critical strengths
- S1: Unlike prior bilevel performative work, which targets performatively stable points, the paper directly targets stationary points of the performative risk, which is novel in the bilevel setting to my knowledge.
Critical weaknesses
-
W1 (Motivation and novelty): While performative learning and bilevel optimization are each well motivated, the specific problem (1a-b) is not. Why does depend only on , and only on ? Which practical situation does this model? The experiment does not clarify this either. Moreover, under Assumption 1 the problem reduces to a classical bilevel problem with and . AdaBiO is then stocBiO on with replaced by least-squares estimates, as in [1].
-
W2 (The guarantees implicitly require bounded iterates): Assumption 4 requires and to be bounded uniformly over all parameters and samples. This does not hold as soon as the data interact multiplicatively with trainable parameters (linear models, GLMs, or any network whose first layer is linear in the input), since then scales with the parameter norm. Moreover, the final sample complexity depends on and . A complexity bound should not depend on the iterates of the algorithm. Note that [1] avoids both issues by restricting the parameters to a ball.
Questions for authors
- Q1: Is there a concrete example for which the proposed formulation makes sense?
- Q2: Under Assumption 1, the problem can be rewritten as a standard bilevel problem with fixed distributions (see W1). Beyond combining stocBiO with the estimation procedure of [1], what are the specific technical challenges of this setting?
4 comments
Additional clarification on W2.
We would like to further clarify that, instead of imposing bounded feasible sets and introducing projection, we can directly adopt a bounded-iterate assumption, i.e., and for all iterations, with constants independent of . Such an assumption is common in stochastic nonconvex optimization, as explicitly noted by Na and Mahoney [4, Assumption 4.1]. Under this additional assumption and our existing regularity conditions, Theorem 1 directly yields additional sample complexity for each distribution map, without modifying the algorithm or its convergence proof.
We hope this clarification can resolve your concerns.
[4] Na and Mahoney, "Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming," JMLR, 2025.
I thank the authors for their response, which addresses my concerns about the assumptions and the motivation. Given their answer and the additional experimental work to address the other reviewers’ concerns, I have updated my score.
We sincerely thank you for your kindness and thoughtful reconsideration. Your constructive feedback has greatly helped improve our work.
We thank the reviewer for the careful reading and important questions. We have uploaded a revised manuscript, with changes highlighted in blue. We address the two weaknesses and related questions below.
1. Motivation and a concrete example (W1 and Q1).
Our formulation follows the bilevel performative learning framework introduced by [2]. As discussed in [2], meta-learning provides a natural motivation for this problem: the UL model learns a shared initialization, while the LL model adapts it to individual tasks. When model deployment changes the data distributions, performative effects can arise at both levels.
Consider financial markets as a practical example. A financial institution may develop a shared investment model x that is used across different trading desks. Deploying this model influences their initial trading decisions and the resulting market data, such as transaction prices and trading volumes. The data collected for adapting the model to a particular trading desk therefore depend on x, giving the LL distribution D(x). Based on these data, the LL problem learns an adapted trading model y⋆(x). When this adapted model is deployed, its trading decisions can further affect market prices, liquidity, and transaction costs. Consequently, the data used to evaluate its performance follow the UL distribution C(y⋆(x)).
Thus, the two distribution dependencies correspond to different stages of model deployment: the shared model affects the data used for LL adaptation, while the adapted model affects the data used for UL evaluation. This explains the structure of Problem (1).
Furthermore, following [2], we have added a meta-strategic classification experiment in Section 5, Fig. 3 of the revised manuscript. This experiment considers the same type of coupled decision-dependent distributions and provides additional empirical support for the proposed framework.
2. Technical challenges beyond standard bilevel optimization (W1 and Q2).
We agree with the reviewer that if both distribution matrices are known, the location-family model can be rewritten as a stochastic bilevel problem over fixed base distributions. However, when A(d) and A(c) are unknown, the required transformed gradients cannot be evaluated directly: the performative hypergradient contains distributional derivatives involving both matrices, Eqs. (4)–(5).
Our contribution is to estimate both maps online while optimizing the bilevel problem and establish convergence with their estimation errors. The LL map error affects both the LL updates and the tracking of y⋆(xr); errors from both maps affect the hypergradient. These errors are coupled with stochastic gradient noise and the Neumann inverse-Hessian approximation. Proposition 1 bounds online map-estimation errors, Lemma 1 controls their effect on the performative hypergradient, and Lemma 2 controls LL solution tracking. Theorem 1 then establishes convergence to a stationary point of the performative risk, rather than the performatively stable point studied in [2]. Thus, the key contribution is the error analysis and convergence guarantee with two unknown coupled maps, not simply applying stocBiO with known matrices.
3. Boundedness and sample complexity (W2).
Bounded parameter domains are common in performative prediction, including [1,3]. Similarly, we can impose ∥x∥≤Rx and ∥y∥≤Ry to bound parameter-dependent gradients, with suitable conditions on the data. Our analysis considers unconstrained optimization under Assumptions 1–4, and a constrained extension would use projected updates and a modified convergence analysis.
Theorem 1 also covers bounded iterates: if ∥xr∥≤Rx and ∥yr,K∥≤Ry uniformly, with bounds independent of ϵ, the additional sample complexity for each distribution map becomes O(LΦϵ−1). Thus, the iterate dependence is absorbed into constants.
We also added experiments beyond our theoretical assumptions. Appendix B.3.5 (Figs. 9–10) tests nonlinear shifts beyond the linear location-family model; Appendix B.3.7 (Fig. 12) tests a trainable ReLU MLP, which violates global smoothness and does not guarantee bounded gradients. AdaBiO remains effective in both settings, supporting its robustness beyond our theoretical assumptions.
We hope these explanations address your concerns. If you find that our response resolves your concerns, we would kindly ask you to reconsider your rating. We welcome further questions and would be happy to clarify them.
[1] Miller et al., "Outside the Echo Chamber: Optimizing the Performative Risk," ICML, 2021.
[2] Lu, "Bilevel Optimization with Coupled Decision-Dependent Distributions," ICML, 2023.
[3] Yan et al., "Zero-Regret Performative Prediction Under Inequality Constraints," NeurIPS, 2023.