{"id":"8c206f24-995b-4330-9035-cb6072391e75","arxiv_id":"2411.14884","paper_version":3,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A chance-constrained uncertain StQP with location-scale quadratic forms is equivalent to a deterministic StQP with matrix M + F^{-1}(α) S.","lead":"This paper introduces a chance-constrained version of the standard quadratic optimization problem, where the data matrix is random with a known distribution. It shows that under a location-scale assumption on the quadratic form, the chance-constrained problem reduces exactly to a deterministic quadratic optimization over the simplex.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 4's GOE scale parameter is wrong by a factor of sqrt(2), so the paper's verification that the GOE model satisfies Property 5 is incorrect as written; this is a local but load-bearing error in the bridge from the motivating model to Theorem 7.","rationale":"The reader's verdict of CONDITIONAL is appropriate, and the reader did notice the sqrt(2) inconsistency, but the reader's stated weakest assumption was the general restrictiveness of Property 5, whereas the more concrete load-bearing problem is the incorrect verification of Property 5 for the GOE case in Proposition 4. This error is load-bearing because Proposition 4 is the paper's only bridge from the GOE perturbation model to the assumptions of Theorem 7; using the stated S = beta I_n with Theorem 7 gives a deterministic matrix that is wrong by the factor sqrt(2). However, the main theorem itself is sound conditional on Property 5, and the correct formula already appears in Corollary 8 and Theorem 9, so the error is local and correctable rather than fatal. The concrete test would settle the matter by direct variance computation and Monte Carlo comparison. Since the central contribution survives after a local correction, the reader's CONDITIONAL verdict should stand unchanged.","tokens_in":8420,"tokens_out":9156,"duration_ms":95103,"concrete_test":"Directly compute Var(x^T eG x) from Definition 2 for n = 2, x = (a, b): Var = 2a^4 + 4a^2 b^2 + 2b^4 = 2(a^2 + b^2)^2, so the standard deviation is sqrt(2)||x||^2, and with beta scaling it is sqrt(2) beta ||x||^2. Then run a Monte Carlo check: generate 10^5 GOE matrices eG, fix x = (0.5, 0.5), Qnom = 0, beta = 1, and compare the empirical CDF of x^T(Qnom + beta eG)x against Phi((t - mu)/(beta||x||^2)) and against Phi((t - mu)/(sqrt(2) beta||x||^2)). Only the latter will match, decisively showing that S must be sqrt(2) beta I_n in Proposition 4.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 7 is a clean conditional statement: if Property 5 holds for some (F, M, S), then the CCEStQP value equals min_{x in Delta} x^T (M + F^{-1}(alpha) S) x. The proof is sound. The load-bearing step is the claim that the paper's flagship random-matrix models actually satisfy Property 5, and that claim is where an internal inconsistency appears. In Proposition 4, for the GOE perturbation model eQ = Qnom + beta eG, the authors state that x^T eG x ~ N(0, 2||x||^4), then set M = Qnom, S = beta I_n, and F = Phi (standard normal). These three statements are mutually inconsistent. With S = beta I_n, Property 5 gives P[x^T eQ x <= t] = Phi((t - x^T Qnom x)/(beta ||x||^2)). But the standard deviation of beta x^T eG x is sqrt(2) beta ||x||^2, so the correct scale matrix is S = sqrt(2) beta I_n, and the correct deterministic matrix is Q = Qnom + sqrt(2) beta Phi^{-1}(alpha) I_n. The paper itself uses this correct formula in Corollary 8 and Theorem 9 (rho = sqrt(2) beta Phi^{-1}(alpha)), which confirms the discrepancy. As written, Proposition 4 cannot be used together with Theorem 7: a reader who follows Proposition 4 literally will obtain Q = Qnom + beta Phi^{-1}(alpha) I_n, off by the factor sqrt(2) from the true value-at-risk. The error is localized and easily corrected, so it does not invalidate the main theorem, but it does mean the paper's validation of Property 5 for the GOE model is currently incorrect as stated.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a chance-constrained epigraphic reformulation of standard quadratic optimization problems with a random data matrix. For a fixed decision vector x, the objective x^T Q̃ x is a random variable, and the authors minimize its value-at-risk at confidence level α subject to x lying in the standard simplex. The central mathematical contribution is Theorem 7, which shows that if the random quadratic forms satisfy a location-scale property (Property 5) with location x^T M x and scale x^T S x, then the chance-constrained epigraphic problem is exactly equivalent to the deterministic StQP with matrix M + F^{-1}(α) S. The paper verifies Property 5 for two families of indefinite random matrices: the GOE perturbation model and the shifted Wishart model. It then specializes the deterministic reformulation to the GOE case, relates it to a Frobenius-ball robust counterpart, and reports numerical experiments comparing the chance-constrained solutions with nominal and robust solutions.","tokens_in":8812,"tokens_out":6682,"duration_ms":66935,"significance":"If the stated results hold, the paper provides a clean and useful observation: under a distributional location-scale assumption, an uncertain StQP with chance constraints can be solved by a single deterministic StQP in the same problem class. The proof of Theorem 7 is a direct and sound quantile-inversion argument, and the numerical experiments provide a falsifiable check of the GOE model by comparing empirical coverage frequencies with the nominal confidence level. The connection with Frobenius-ball robust optimization is also instructive. The main weakness is that the GOE verification in Proposition 4 contains a scale-factor error: the variance calculation and the claimed scale matrix S = β I_n are inconsistent, although Corollary 8 and Theorem 9 use the correct factor √2 β. This error is local and easily corrected, but it is load-bearing for the paper's validation of Property 5 for the flagship GOE model.","major_comments":[{"comment":"The GOE case of Proposition 4 is internally inconsistent. The proof correctly states that x^T eG x ∼ N(0, 2||x||^4) and hence, for eQ = Q(nom) + β eG, that x^T eQ x has standard deviation √2 β ||x||^2. But the proof then sets S = β I_n, which would give, under Property 5, the quantile shift β Φ^{-1}(α)||x||^2. The correct scale matrix is S = √2 β I_n, yielding the deterministic matrix Q = Q(nom) + √2 β Φ^{-1}(α) I_n. This is exactly the formula used in Corollary 8 and Theorem 9, which confirms the intended statement. As written, however, Proposition 4 cannot be combined with Theorem 7 to obtain Corollary 8; a reader following the proof literally would obtain the wrong factor. Please correct the scale matrix in Proposition 4 and its proof, and state explicitly that β > 0 there.","section":"§2.2, Proposition 4"},{"comment":"The empirical coverage check is reported only as a rough approximation (# counts divided by 100 ≈ α, with one interval cited for α = 0.70). Since this is the main numerical validation of the chance-constrained model, the paper should report the full range over all α or a table of empirical frequencies, and ideally a confidence interval for the binomial proportion. This is not a correctness issue for Theorem 7, but it would make the experimental claim more precise.","section":"§4.3"}],"minor_comments":[{"comment":"The formula for the GOE perturbation generation appears to contain a typographical error: 'eQ := Q(nom) + β√2 (eR + eR⊤)' should presumably read 'eQ := Q(nom) + (β/√2)(eR + eR⊤)' to match Definition 2 and Corollary 8.","section":"§2.2(i)"},{"comment":"There are several small language slips: 'ranging portfolio optimization' should be 'ranging from portfolio optimization', 'suppossed' should be 'supposed', and 'familiar interpretation familiar' should be 'familiar interpretation'.","section":"Abstract and introduction"},{"comment":"The statement should explicitly assume β > 0 (as in Proposition 4) because the formula σ(x) = √2 β x^T I_n x is otherwise ambiguous for negative β.","section":"Corollary 8"},{"comment":"The proof relies on [6, Theorem 4] without stating the mapping of notation. A brief sentence explaining how C = I, the definition of L, and the sign convention in [6] translate to the current uncertainty set would improve readability.","section":"Theorem 9"}],"recommendation":"major_revision","confidential_remarks":"This is a short, clearly written note whose main theorem is correct. The GOE scale-factor error in Proposition 4 is the only substantive technical problem; because that proposition is the bridge from the motivating model to the deterministic reformulation, I regard the revision as major rather than minor. The corrected version should be publishable as a note in this journal, provided the authors also tighten the numerical reporting as suggested."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe paper's main equivalence (Theorem 7) is correct and the proof is complete. The CCEStQP model is new for this problem class, and the reduction to a deterministic StQP under a location-scale property is a legitimate contribution. The link to Frobenius-ball robustness via Bomze et al. is a nice touch, and the numerical experiments do verify that the empirical probability tracks alpha, with a sensible comparison against a robust formulation.\n\nThe stress-test note is right. Proposition 4 states the GOE scale as S = beta I_n, but the variance of x^T beta G x is 2 beta^2 ||x||^4, so the scale should be sqrt(2) beta I_n. The paper itself uses sqrt(2) beta in Corollary 8 and Theorem 9, so the proposition is internally inconsistent with the rest of the paper. As written, a reader who follows Proposition 4 literally would obtain a deterministic matrix off by sqrt(2). This is a load-bearing step in the bridge from the motivating model to Theorem 7, but it is a one-line fix. The conditional statement in Theorem 7 stands.\n\nTwo smaller soft spots. The phrase \"apparently for the first time\" is not supported by a literature search; a quick check would verify it or soften it. And the numerical experiments are not packaged with code or data, which limits reproducibility. Both are minor.\n\nNone of this is fatal. Theorem 7 is a solid conditional result, and the paper is written in the same problem class it studies, which is elegant. The paper deserves a serious referee; a referee should ask for the Proposition 4 correction and a cleaner novelty claim, but not much else.\n\nFor whom: anyone working on uncertain quadratic optimization, robust StQP, or chance-constrained optimization. I would cite Theorem 7 after the scale issue is fixed and would bring the paper to a reading group, mostly to discuss the location-scale property and its limits.","headline":"Main equivalence is correct and clean, but a localized sqrt(2) error in the GOE verification of Property 5 needs fixing before the bridge from the model to Theorem 7 is sound.","tokens_in":9338,"tokens_out":1895,"would_cite":true,"duration_ms":42895,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["90C20","90C15","90C26"],"pacs":[],"model":"deepseek-v4-flash","headline":"A chance-constrained formulation of the uncertain standard quadratic problem reduces, under a location-scale condition, to an ordinary deterministic StQP.","keywords":["standard quadratic optimization","chance-constrained optimization","epigraphic formulation","Gaussian Orthogonal Ensemble","random matrices","value-at-risk","robust optimization","location-scale distributions"],"falsifier":"Take a random symmetric matrix whose entries are independent but non-Gaussian, for instance shifted exponential entries, and check whether the empirical distributions of $x^\\top \\tilde Q x$ for different $x$ are all of the form $F((t - x^\\top M x)/(x^\\top S x))$ with fixed $M$, $S$, $F$. If they are not, solve the CCEStQP by sampling and compare its value with $\\min_{x\\in\\Delta} x^\\top(M + F^{-1}(\\alpha)S)x$; a mismatch for some $\\alpha$ would show the deterministic reduction relies on Property 5 and does not hold generally.","tokens_in":8219,"feed_emoji":"🎲","tokens_out":9055,"duration_ms":78852,"temperature":0.7,"pith_summary":"The paper studies standard quadratic optimization (minimizing $x^\\top Q x$ over the simplex) when the matrix $Q$ is random with known distribution. It introduces a chance-constrained epigraphic version: find the smallest $t$ such that, with probability at least $\\alpha$, the realized quadratic form $x^\\top \\tilde Q x$ does not exceed $t$. The central result is that if the random matrix satisfies a location-scale property for every simplex point, then this stochastic problem is exactly an ordinary StQP with data matrix $Q = M + F^{-1}(\\alpha) S$. This matters because the decision-maker stays in the same problem class and can use existing StQP algorithms; for Gaussian-orthogonal-ensemble perturbations the matrix becomes explicit, and moderate confidence levels give solutions less conservative than a robust box approach.","feed_headline":"Uncertain quadratic problems reduce to one deterministic StQP","feed_subtitle":"A location-scale assumption turns a probability constraint on an uncertain quadratic form into a fixed matrix Q = M + F^{-1}(α)S.","key_machinery":"The machinery is the epigraphic variable $t$ combined with Property 5, a location-scale assumption on the uncertain quadratic forms. Property 5 asserts that there are fixed symmetric matrices $M$ and $S$, with $x^\\top S x > 0$ on $\\Delta$, and a continuous, strictly increasing cdf $F$ such that $P[x^\\top \\tilde Q x \\le t] = F((t - x^\\top M x)/(x^\\top S x))$ for every $x\\in\\Delta$. Because $F$ is invertible at $\\alpha$, the chance constraint is equivalent to $x^\\top M x + F^{-1}(\\alpha)x^\\top S x \\le t$, so the whole CCEStQP reduces to $\\min_{x\\in\\Delta} x^\\top [M + F^{-1}(\\alpha)S] x$. The GOE perturbation model and shifted Wishart model are shown to satisfy Property 5, giving explicit $M$, $S$, and $F$.","core_discovery":"On its own terms, the paper claims Theorem 7: for a random symmetric matrix $\\tilde Q$ with distribution $P$ obeying Property 5, the CCEStQP value equals $\\min_{x\\in\\Delta} x^\\top Q x$ with $Q = M + F^{-1}(\\alpha) S$. The proof inverts the strictly increasing cdf $F$, turning the chance constraint $P[x^\\top \\tilde Q x \\le t] \\ge \\alpha$ into the deterministic quadratic inequality $x^\\top Q x \\le t$, so the epigraphic lift collapses to a deterministic StQP. For the GOE perturbation model $\\tilde Q = Q^{(\\mathrm{nom})} + \\beta \\tilde G$, this gives $Q^{(\\mathrm{cce})} = Q^{(\\mathrm{nom})} + \\sqrt{2}\\beta \\Phi^{-1}(\\alpha) I_n$, and the solution coincides with the robust StQP over a Frobenius ball of radius $\\sqrt{2}\\beta \\Phi^{-1}(\\alpha)$. The paper also characterizes when the reformulation becomes convex (Proposition 10) and reports numerical experiments in which the chance-constrained solutions achieve near-$\\alpha$ empirical coverage and, for $\\alpha$ below about 0.72 to 0.79, are less conservative than box-robust solutions.","pith_inferences":["The mechanism suggests a general template: whenever a random objective is affine in the random parameter and its distribution at each decision point is location-scale with parameters that are themselves quadratic in $x$, a chance constraint can be collapsed to a deterministic problem; this may extend to other elliptically contoured ensembles.","Since only $F^{-1}(\\alpha)$ enters the reformulation, the whole trade-off curve in $\\alpha$ can be traced by a one-dimensional root find on $F$, and Proposition 10's threshold provides a simple convexity certificate for tuning $\\alpha$ adaptively.","A testable extension would construct synthetic distributions that satisfy Property 5 but are neither GOE nor Wishart, and verify whether the deterministic formula holds exactly or only approximately.","Conversely, because Property 5 fails for general distributions, one could perturb the assumed distribution and measure how much the optimal value and empirical coverage of the CCE solution degrade, quantifying the price of the location-scale assumption."],"forward_implications":["A decision-maker facing an uncertain StQP whose distribution satisfies Property 5 can solve one deterministic StQP; the chance constraint adds no new computational complexity.","In the GOE perturbation model, raising the confidence level $\\alpha$ only shifts the data matrix by $\\sqrt{2}\\beta \\Phi^{-1}(\\alpha) I_n$, and the problem becomes convex once $\\alpha \\ge \\Phi(|\\lambda_{\\min}|/(\\sqrt{2}\\beta))$ even when the nominal matrix is indefinite.","The CCEStQP for GOE perturbations coincides with the robust StQP over a Frobenius-ball uncertainty set of radius $\\sqrt{2}\\beta \\Phi^{-1}(\\alpha)$, giving a probabilistic meaning to that robust radius.","Numerical experiments show the chance-constrained solutions attain empirical coverage close to $\\alpha$ and are less conservative than box-robust solutions for $\\alpha \\le 0.72$ in the nominal comparison and $\\alpha \\le 0.79$ against realized instances.","For shifted Wishart models the deterministic reformulation still applies, but the paper argues the robust-ball characterization does not carry over because the location matrix is negative."],"supporting_citations":[{"why":"Supplies the robust StQP framework and the Frobenius-ball deterministic reduction used in Theorem 9, and the box-robust counterpart used in the numerical comparisons.","marker":"[6]"},{"why":"Introduces worst-case value-at-risk through chance constraints, motivating the epigraphic formulation used here.","marker":"[8]"},{"why":"Defines value-at-risk, giving the risk-management interpretation of the chance constraint $P[x^\\top \\tilde Q x \\le t] \\ge \\alpha$.","marker":"[11]"},{"why":"Establishes that StQP contains maximum clique, showing why indefinite instances are hard and motivating the uncertain indefinite setting.","marker":"[15]"},{"why":"Presents the earlier two-stage stochastic StQP model, against which the full-matrix random model is positioned.","marker":"[5]"}],"fun_headline_variants":["Chance constraints reduce to a single StQP","Uncertain StQP becomes deterministic via one matrix","One matrix solves the uncertain StQP","Location-scale assumption yields deterministic StQP","Cdf inversion turns chance constraint into fixed Q"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The result rests on Property 5: every quadratic form $x^\\top \\tilde Q x$ must follow the same baseline distribution after shifting by $x^\\top M x$ and scaling by $x^\\top S x$, with a single cdf $F$ valid for all $x$ in the simplex.","fun_headline_variants_meta":{"raw":{"variants":["Chance constraints reduce to a single StQP","Uncertain StQP becomes deterministic via one matrix","One matrix solves the uncertain StQP","Location-scale assumption yields deterministic StQP","Cdf inversion turns chance constraint into fixed Q"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000251,"raw_usage":{"total_tokens":1545,"prompt_tokens":919,"completion_tokens":626,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":535,"completion_tokens_details":{"reasoning_tokens":573}},"tokens_in":535,"tokens_out":626,"duration_ms":7009,"temperature":1.0,"reasoning_tokens":573,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T14:45:32.768414+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a random symmetric matrix whose entries are independent but non-Gaussian, for instance shifted exponential entries, and check whether the empirical distributions of $x^\\top \\tilde Q x$ for different $x$ are all of the form $F((t - x^\\top M x)/(x^\\top S x))$ with fixed $M$, $S$, $F$. If they are not, solve the CCEStQP by sampling and compare its value with $\\min_{x\\in\\Delta} x^\\top(M + F^{-1}(\\alpha)S)x$; a mismatch for some $\\alpha$ would show the deterministic reduction relies on Property 5 and does not hold generally.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the robust StQP framework and the Frobenius-ball deterministic reduction used in Theorem 9, and the box-robust counterpart used in the numerical comparisons."},{"cited_title":"El Ghaoui, M","cited_arxiv_id":null,"evidence_quote":"Introduces worst-case value-at-risk through chance constraints, motivating the epigraphic formulation used here."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines value-at-risk, giving the risk-management interpretation of the chance constraint $P[x^\\top \\tilde Q x \\le t] \\ge \\alpha$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes that StQP contains maximum clique, showing why indefinite instances are hard and motivating the uncertain indefinite setting."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Presents the earlier two-stage stochastic StQP model, against which the full-matrix random model is positioned."}],"review_version":1}