{"id":"9ab9cd1b-e234-484b-bcb2-01021a7e7220","arxiv_id":"2605.14019","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Expected regret equals covariance between costs and optimal decisions for linear and quadratic stochastic programs, with explicit bounds on the residual.","lead":"This paper derives that expected regret in stochastic optimization equals the covariance between uncertain parameters and optimal decisions plus a residual term. For linear and quadratic programs the residual vanishes exactly, allowing fast covariance estimation from historical data instead of slow simulations.","discovery_kind":"first_principles","skeptic_critique":{"model":"grok-4.3","headline":"Central decomposition notationally inconsistent: Cov(c, π*(c)) is a fixed expectation while Regret(c) varies with c","rationale":"The reader's note on LP/QP restrictions is correct but secondary. The notational mismatch in the core identity is more immediate and must be resolved before the closed-form claim can be evaluated. Full text allows direct inspection of the expansion; if the paper consistently uses E[Regret] = Cov + E[R] with clear scalarization, the concern dissolves and the verdict can move to ACCEPT.","tokens_in":1787,"tokens_out":396,"duration_ms":51477,"concrete_test":"In the paper's derivation of the decomposition (likely §3), substitute the definition of regret, expand both sides, and verify whether the covariance term remains an unconditional expectation while the regret term does not; if the two sides match only after taking E[·] on the left, the stated pointwise identity does not hold.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The abstract claims an exact decomposition Regret(c) = Cov(c, π*(c)) + R(c) that holds for any stochastic optimization problem, with equality to Cov alone for LPs and unconstrained QPs. Covariance between random vectors c and π*(c) is defined via an outer expectation (e.g., E[(c−μ_c)(π*(c)−μ_π)^T] or its trace/inner-product reduction), yielding a constant. Regret(c) and R(c) are written as functions of the random parameter c. No redefinition of Cov as a random variable (e.g., instantaneous product) is indicated in the given statement. This makes the scalar equality impossible as written unless the left-hand side is actually the unconditional expected regret and the notation Regret(c) is abused. The exact R(c)=0 claim for LPs/QPs inherits the same ambiguity.","agreement_with_reader":"partial"},"referee_report":{"model":"grok-4.3","summary":"The manuscript claims to prove that expected regret in any stochastic optimization problem admits the exact decomposition Regret(c) = Cov(c, π*(c)) + R(c), where c denotes the random parameters, π*(c) the optimal decision, and R(c) a residual term. For linear programs and unconstrained quadratic programs (including Markowitz portfolio optimization), it asserts R(c) = 0 exactly, so regret equals covariance. When historical pairs {(c_i, π*(c_i))} are available, the covariance is estimated in O(nd²) time via a single pass, with accompanying concentration bounds, a CLT, and an asymptotically unbiased residual estimator. Results are validated on synthetic LP/QP/IP instances and a rolling-window experiment on ten years of CRSP equity data.","tokens_in":1992,"tokens_out":691,"duration_ms":24453,"significance":"If the decomposition holds, the result supplies a closed-form, parameter-free link between regret and covariance that replaces expensive SAA simulation with direct sample-covariance estimation. This would be a substantial computational and conceptual advance for stochastic programming and portfolio theory, enabling rapid regret quantification and new theoretical bounds. The explicit residual bounds under Lipschitz/smooth/strongly-convex assumptions, together with the statistical guarantees (concentration, CLT), further strengthen applicability.","major_comments":[{"comment":"Abstract and central theorem statement: the claimed identity is written as Regret(c) = Cov(c, π*(c)) + R(c). Cov(c, π*(c)) is defined via an outer expectation and is therefore a fixed scalar, while Regret(c) is indexed by the random c. The manuscript must clarify whether both sides are understood as unconditional expectations (i.e., E[Regret(c)] = Cov + E[R(c)]) or whether Cov is redefined as a random variable; without this the scalar equality cannot hold as stated and the exact R(c)=0 claim for LPs/QPs inherits the same ambiguity.","section":"Abstract / main theorem"},{"comment":"LP and QP sections: the proof that R(c)=0 exactly for linear programs and unconstrained quadratic programs is load-bearing for the “regret equals covariance” headline. The derivation should be exhibited in full (including the precise definition of the residual R(c)) so that readers can verify it does not rely on additional hidden assumptions beyond linearity or unconstrained quadratic structure.","section":"Proofs for LPs and unconstrained QPs"}],"minor_comments":[{"comment":"The complexity statements O(Bn²d³) for SAA and O(nd²) for the covariance estimator should be derived or referenced to standard algorithmic results rather than asserted.","section":"Complexity discussion"},{"comment":"Figure captions and table footnotes should explicitly state the number of Monte Carlo replications and the precise data-exclusion rules used in the CRSP rolling-window experiment.","section":"Numerical experiments"}],"recommendation":"major_revision","confidential_remarks":"The core idea is novel and potentially high-impact, but the notation inconsistency in the central claim is the primary obstacle to acceptance. If the authors supply a clean re-statement of the theorem (with expectations made explicit) and the full LP/QP proofs, the paper would be suitable for minor revision. No concerns about citation patterns or scope."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the careful and constructive report. The two major comments identify genuine issues of notation and proof presentation that we will resolve in revision. We respond to each below.","responses":[{"response":"We agree the notation is ambiguous as written. The covariance term is a fixed scalar, Cov(c, π*(c)) := E[(c - E[c])(π*(c) - E[π*(c)])]. The intended identity is E[Regret(c)] = Cov(c, π*(c)) + E[R(c)]. For linear programs and unconstrained quadratic programs we in fact prove R(c) = 0 almost surely, so the equality holds pathwise. We will revise the abstract, the statement of the main theorem, and the surrounding text to state the decomposition explicitly in terms of expectations and to note the almost-sure vanishing of R(c) under the stated structural assumptions.","revision_made":"yes","referee_comment":"[Abstract / main theorem] Abstract and central theorem statement: the claimed identity is written as Regret(c) = Cov(c, π*(c)) + R(c). Cov(c, π*(c)) is defined via an outer expectation and is therefore a fixed scalar, while Regret(c) is indexed by the random c. The manuscript must clarify whether both sides are understood as unconditional expectations (i.e., E[Regret(c)] = Cov + E[R(c)]) or whether Cov is redefined as a random variable; without this the scalar equality cannot hold as stated and the exact R(c)=0 claim for LPs/QPs inherits the same ambiguity."},{"response":"We accept that the current exposition of the R(c) = 0 proofs is too condensed. In the revision we will insert complete derivations. We first recall the precise definition R(c) := Regret(c) - Cov(c, π*(c)), where Regret(c) is the random variable cᵀ(π*(c) - π*(E[c])) for linear objectives (and the analogous quadratic expression). For linear programs we then use the fact that π*(c) is piecewise linear in c and show that the covariance term exactly cancels the expected regret term by direct expansion. For unconstrained quadratic programs we substitute the closed-form solution π*(c) = -Q⁻¹c (or its affine generalization) and verify that the quadratic and linear terms cancel identically, again without extra assumptions. The expanded proofs will appear in the main text rather than the appendix.","revision_made":"yes","referee_comment":"[Proofs for LPs and unconstrained QPs] LP and QP sections: the proof that R(c)=0 exactly for linear programs and unconstrained quadratic programs is load-bearing for the “regret equals covariance” headline. The derivation should be exhibited in full (including the precise definition of the residual R(c)) so that readers can verify it does not rely on additional hidden assumptions beyond linearity or unconstrained quadratic structure."}],"tokens_in":1580,"tokens_out":629,"duration_ms":21731,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The key thing to know is that this paper derives a decomposition of expected regret as covariance between parameters and optimal decisions plus a residual term, which is exactly zero for linear and unconstrained quadratic programs. If correct, this replaces expensive SAA simulations with simple covariance calculations from historical data, cutting complexity dramatically. It does well by providing explicit bounds on the residual under standard assumptions like Lipschitz continuity and strong convexity. The computational claim is backed by the O(nd²) estimation time, and they include concentration inequalities and a CLT for the estimator. Testing on synthetic instances and ten years of CRSP data for portfolio optimization adds credibility to the practical side. The main soft spot is the notation flagged in the stress test. Covariance is an unconditional expectation and thus constant, yet it's equated to Regret(c) which depends on the random c. This suggests either the left side is expected regret (with sloppy notation) or the decomposition is not as stated. Without seeing the full derivations, it's hard to tell if this is just abuse of notation or a load-bearing problem. The abstract says they prove it, but the presentation raises questions. This is for people in stochastic optimization, operations research, and finance who optimize under uncertainty and care about regret. A practitioner estimating regret in portfolio problems would get value from the fast method if it works. I recommend sending it to peer review. The potential savings are real, and referees can sort out the notation and verify the proofs. It deserves the attention even with the current ambiguity.","headline":"The paper claims an exact regret-covariance decomposition that could speed up stochastic optimization, but the notation makes the central equality unclear.","tokens_in":2448,"tokens_out":369,"would_cite":false,"duration_ms":33624,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"Regret-covariance decomposition in stochastic optimization shares no machinery with RS forcing chain","alignment":"orthogonal","rationale":"Paper proves Regret(c) = Cov(c, π*(c)) + R(c) with R=0 exactly for LPs/unconstrained QPs (affine π*) via algebraic decomposition and measure-zero arguments on normal cones. No J-cost, φ-ladder, ratio symmetry, 8-tick periodicity, or parameter-free constant derivation appears. RS core (reality_from_one_distinction, Jcost uniqueness in Cost/FunctionalEquation.lean, AbsoluteFloorClosure, AlexanderDuality) derives physics from distinction; this paper is decision-theoretic operations research with no structural overlap.","tokens_in":60070,"confidence":"high","tokens_out":163,"duration_ms":19618,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Expected regret equals the covariance between uncertain costs and optimal decisions in stochastic optimization.","keywords":["regret","covariance","stochastic optimization","linear programming","quadratic programming","portfolio optimization","sample average approximation"],"falsifier":"For a specific linear program, generate many scenarios, compute the average regret via full optimization per scenario, and compare it directly to the covariance between the cost vectors and the corresponding optimal solutions; any significant mismatch would disprove the equality.","tokens_in":2689,"feed_emoji":"📊","tokens_out":619,"duration_ms":35406,"temperature":0.7,"pith_summary":"The paper establishes that in any stochastic optimization problem, the expected regret decomposes exactly into the covariance between the uncertain parameter vector and the optimal decision plus a residual term. For linear programs and unconstrained quadratic programs, including portfolio optimization, this residual is zero, making regret identical to the covariance. This allows computing regret from historical cost-decision pairs using a single pass in linear time relative to the data size, rather than relying on costly Monte Carlo simulations. The result comes with concentration bounds and a central limit theorem for the estimator, and it is verified on both synthetic problems and real financial data.","feed_headline":"Regret equals covariance between costs and decisions","feed_subtitle":"A closed-form identity computes expected regret exactly from historical data for linear and quadratic optimization problems.","key_machinery":"The decomposition of regret into covariance between costs and optimal decisions plus a residual term, which vanishes exactly for linear and quadratic objectives.","core_discovery":"The central discovery is that Regret(c) = Cov(c, π*(c)) + R(c) holds exactly for any stochastic optimization problem, with R(c) = 0 for linear programs and unconstrained quadratic programs. This provides a closed-form characterization that replaces simulation-based estimation with direct covariance calculation from observed pairs.","pith_inferences":["Practitioners could monitor regret in real time for ongoing optimization tasks by tracking covariance in streaming data.","This identity might guide the design of new optimization algorithms that directly target low covariance between costs and decisions.","The framework could be tested on mixed-integer programs to see how small the residual becomes in practice."],"forward_implications":["For linear programs, regret is exactly equal to the covariance without any approximation or simulation.","Unconstrained quadratic programs, such as the Markowitz portfolio problem, also satisfy the exact equality.","Regret can be estimated in O(nd²) time from historical data, compared to O(Bn²d³) for sample average approximation.","The estimator admits concentration bounds, a central limit theorem, and an asymptotically unbiased residual estimator."],"fun_headline_variants":["Regret equals covariance of costs and decisions","Closed-form regret is cost-decision covariance","Regret equals covariance for linear quadratic programs","Stochastic regret is exact covariance with decisions"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The exact zero-residual equality requires the optimization problem to be a linear program or an unconstrained quadratic program; general problems only have a bounded residual.","fun_headline_variants_meta":{"raw":{"variants":["Regret equals covariance of costs and decisions","Closed-form regret is cost-decision covariance","Regret equals covariance for linear quadratic programs","Stochastic regret is exact covariance with decisions"]},"model":"grok-4.3","cost_usd":0.007964,"raw_usage":{"total_tokens":3574,"prompt_tokens":723,"num_sources_used":0,"completion_tokens":53,"cost_in_usd_ticks":79640500,"prompt_tokens_details":{"text_tokens":723,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2798,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":723,"tokens_out":53,"duration_ms":22971,"temperature":1.0,"reasoning_tokens":2798,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-15T02:30:51.911619+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"For a specific linear program, generate many scenarios, compute the average regret via full optimization per scenario, and compare it directly to the covariance between the cost vectors and the corresponding optimal solutions; any significant mismatch would disprove the equality.","supporting_citations":[],"review_version":1}