{"id":"4ddcc09a-a4a4-4374-be0b-7332f0426086","arxiv_id":"2608.08718","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"A new framework, ILRO, trains cost predictors through a robust linear program, with a convex surrogate and consistency and convergence guarantees under stated conditions.","lead":"This paper introduces a training and deployment scheme that uses the same robust optimization problem to learn a predictor and to make decisions, replacing the usual predict-then-optimize pipeline. It gives a convex surrogate loss, conditions under which the surrogate matches the true objective, and finite-sample error bounds.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Fisher-consistency regime can be empty for every fixed gamma: Theorem 2 gives gamma_bar(x)>0 only pointwise, while Theorem 4 requires gamma <= gamma_bar(x) almost surely.","rationale":"The reader's conditional verdict already flags the distributional assumptions; I agree but locate the sharper issue one step later. The central finite-sample claim for the surrogate is Theorem 4, and its Condition 1(iii) is not a consequence of the pointwise Fisher-consistency conditions. The gap is not merely technical: the construction in the concrete test satisfies all pointwise hypotheses of Corollary 1 and Theorem 2, yet gamma_bar(x) becomes arbitrarily small, so for any fixed gamma > 0 the surrogate is inconsistent on a positive-probability set. This means the advertised excess-risk rates for RSPO+ do not apply in that natural bounded-mean regime. I do not see a contradiction in the theorem statements themselves; the fix is to add a uniform threshold assumption and to check gamma selection against gamma_bar in experiments. The paper also lacks code, data, and confidence intervals, as the reader noted, but the uniform-threshold gap is the more load-bearing mathematical soft spot. The verdict remains CONDITIONAL: the framework is plausible and the pointwise Fisher-consistency analysis is coherent, but the stated support for one of the two headline guarantees needs an additional condition or a revised claim.","tokens_in":53743,"tokens_out":26751,"duration_ms":301408,"concrete_test":"Construct the counterexample exactly: take Z = {z in R^2 : z1 - z2 <= 1, z1 >= -1, z1, z2 <= 0}, ybar(t) = (1, t)^\top for t in {1/2, 1/3, ...}, let y | x_t ~ N(ybar(t), sigma^2 I2), and give the contexts positive probabilities, e.g., P_x(t_n) = 2^{-n}. Verify: (a) for every t > 0 the nominal problem at ybar(t) has unique solution z* = (-1, -2); (b) the normal cone C is generated by (-1, 1) and (1, 0); (c) solving (12) gives gamma_bar(t) = t. Then for every gamma > 0 choose n with 1/n < gamma; on context t_n, 2ybar is not in Y*_RSPO, so Condition 1(iii) is false despite all pointwise assumptions of Theorem 2 and Corollary 1 holding. If this check verifies, the paper must add an explicit uniform lower bound on gamma_bar(x), or restrict ybar(x) to a compact set uniformly bounded away from normal-cone boundaries, before Theorem 4 can be invoked in such settings.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The single load-bearing concern is that the Fisher-consistent regime can be empty for every fixed gamma, so the finite-sample guarantees for the RSPO+ predictor are not secured by the paper's pointwise conditions. Theorem 2(i) requires gamma <= gamma_bar(x) for P_x-almost every x, and Theorem 2(ii) only proves gamma_bar(x) > 0 pointwise (for bounded polyhedra). Condition 1(iii) in Section 5.2 is exactly this membership, and the text says it holds when gamma <= ess inf_x gamma_bar(x), but no stated assumption rules out ess inf_x gamma_bar(x) = 0. This is not vacuous: for a polyhedron, gamma_bar(x) = sup {gamma >= 0 : 2ybar(x) + gamma z*(ybar(x)) in C(x)} with C(x) = -N_Z(z*(ybar(x))). One can keep ybar(x) inside one normal-cone chamber, so the nominal solution is unique and all symmetry and density assumptions of Corollary 1 hold, while ybar(x) approaches the chamber boundary; then gamma_bar(x) tends to 0. For instance, take Example 1's Z and ybar(t) = (1, t)^\top with t > 0 decreasing to 0; the nominal solution remains (-1,-2), the Gaussian conditional density is positive and centrally symmetric, yet gamma_bar(t) = t -> 0. If a context distribution gives positive mass to t_n = 1/n, then for every fixed gamma > 0 there is a positive-probability set of x with gamma_bar(x) < gamma, so 2ybar(x) is not a target-risk minimizer and Condition 1(iii) fails. Consequently Theorem 4's O_p(N^{-1/4}) and Corollary 3's O_p(N^{-1/2}) do not follow from the assumptions as stated. The theorems are conditionally correct, but the paper's advertised 'Fisher-consistent regime' is pointwise and may contain no positive gamma uniformly over contexts; this gap is load-bearing for the surrogate's statistical guarantees.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an integrated learning and robust optimization (ILRO) framework for contextual linear optimization. The robust decision map z*_γ(ŷ) = argmin_{z∈Z} ŷᵀz + (γ/2)‖z‖² is used both as the deployed decision rule (ILRO-Decision) and as the training loss (ILRO-Learning). Since this map is the projection Π_Z(−ŷ/γ), the RSPO loss is Lipschitz and differentiable almost everywhere, unlike the nominal SPO loss. The authors construct a convex surrogate RSPO+ by a limiting representation and linearization, prove its Fisher consistency when γ does not exceed an explicitly computable threshold γ̄(x), derive a meta excess-risk bound for the RSPO predictor (Theorem 3), and provide excess-risk bounds for the RSPO+ predictor under the Fisher-consistent regime (Theorem 4, Corollary 3). Numerical experiments on transportation and portfolio problems compare RSPO+ with least squares, SPO+, and post-hoc robustified SPO+, reporting that RSPO+ achieves the lowest or comparable normalized decision loss.","tokens_in":54045,"tokens_out":7218,"duration_ms":73912,"significance":"If the guarantees hold as stated, the paper makes a substantial contribution to decision-focused learning: it is the first framework to use the same robust decision map in training and deployment, it provides a convex surrogate with an explicit Fisher-consistency threshold computable by a linear program, and it gives finite-sample rates for both the target and surrogate predictors. The mathematical development is careful and largely self-contained: Lemma 1 derives the projection representation, Proposition 4 and Theorem 2 characterize the target minimizer set and the consistency threshold, and Theorem 3 cleanly separates the role of the robust map (r/γ) from the hypothesis-class complexity (Rademacher complexity). The paper also ships explicit finite-dimensional reformulations (Theorem 1), a closed-form Jacobian of the decision map (Proposition 6), and detailed proofs in the electronic companion. The empirical comparison is well designed, with the post-hoc robust benchmark isolating the value of learning–decision alignment.","major_comments":[{"comment":"Theorem 2(ii) establishes only a pointwise lower bound γ̄(x) ≥ 2 dist(ȳ(x), ∂C(x))/‖z*(ȳ(x))‖, which can vanish as ȳ(x) approaches a normal-cone chamber boundary. The text in Section 5.2 states that Condition 1(iii) holds for a fixed γ > 0 'as soon as γ ≤ ess inf_x γ̄(x)', but no assumption in the paper rules out ess inf_x γ̄(x) = 0. This is not vacuous: take the feasible set Z of Example 1 and ȳ(t) = (1,t)ᵀ for t > 0 decreasing to 0. The nominal solution remains (−1,−2), the conditional Gaussian density is positive and centrally symmetric, and the threshold computation gives γ̄(t) = t (the active-cone conditions yield λ₁ = 2t − 2γ and λ₂ = 2t + 2 − 3γ, so the binding constraint is γ ≤ t). If the context distribution assigns positive mass to t_n = 1/n, then for every fixed γ > 0 there is a positive-probability set of x with γ̄(x) < γ, so the unique surrogate minimizer 2ȳ(x) is not a minimizer of the target RSPO risk and Condition 1(iii) fails. Consequently, Theorem 4's bound (20) and Corollary 3's O_p(N^{-1/2}) rate do not follow from the stated assumptions: Step 5 of the proof of Theorem 4 uses Condition 1(iii) to assert R(g₀) = R⋆, and without the uniform positivity of γ̄(x) that equality can fail. This is a load-bearing gap in the paper's finite-sample guarantees for the RSPO+ predictor.","section":"Section 5.2, Condition 1(iii) and Theorem 4"},{"comment":"The same uniformity issue arises for the local strong-convexity condition. Lemma EC.3 proves (p₀(x)/γ)-strong convexity of R+(·;x) on B(2ȳ(x), ρ) with p₀(x) = P_{y|x}(y ∈ 2ȳ(x) + γK_ρ), and positivity of p₀(x) follows pointwise from the density-positivity assumption on an open set containing 2ȳ + γZ. The paper then says Condition 1(ii) holds with µ = ess inf_x p₀(x)/γ 'provided ess inf_x p₀(x) > 0', but no assumption in the paper guarantees this essential infimum is positive. The same chamber-boundary construction (or any family of conditional distributions whose concentration region approaches the boundary of the relevant set) makes p₀(x) arbitrarily small on a positive-probability set, so the uniform curvature constant µ required in Theorem 4 may fail to exist. Since Condition 1(ii) is stated as an assumption the theorem is not false as a conditional statement, but the paper's presentation suggests that its distributional conditions provide the curvature; they provide it only pointwise, and the uniform version is an additional, unverified hypothesis.","section":"Section 5.2, Condition 1(ii) and Lemma EC.3"}],"minor_comments":[{"comment":"The empirical section reports only boxplots over 20 replications and compares medians; adding confidence intervals or error bars would strengthen the claims about RSPO+ being the lowest or comparable, especially because several figures show overlapping boxes at small sample sizes.","section":"Section 6"},{"comment":"The abstract states that the finite-sample excess-risk bounds hold for the RSPO+ predictor, but the bound in Theorem 4 requires Condition 1, whose uniform version is not established from the paper's stated distributional assumptions. The abstract should qualify these bounds as conditional on the uniform consistency regime.","section":"Abstract and Section 5.2"},{"comment":"The first two rows of Figure 8 are visually nearly identical and the figure caption does not clearly distinguish the two deg settings within the same panel; labelling each row or differentiating line styles would improve readability.","section":"Figure 8"}],"recommendation":"major_revision","confidential_remarks":"The ILRO framework and the convex surrogate construction are interesting and the paper is well written. The main obstacle is the uniformity gap in the Fisher-consistency regime: the pointwise guarantees of Theorem 2 do not imply the almost-sure or essential-infimum conditions needed for the RSPO+ finite-sample bounds. I believe this is fixable within the manuscript's scope by either adding an explicit assumption such as ess inf_x γ̄(x) > 0 (or ess inf_x p₀(x) > 0 for the curvature) to the statements of Theorem 4 and Corollary 3, or by replacing the current claims with bounds that depend on the actual value of these essential infima. With that repair, the paper would be a solid contribution; the empirical section should also report variability measures."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things you should know about this paper. First, the ILRO idea is genuinely good: they train the predictor through the same robust decision map used at deployment, and the projection representation makes the map continuous and differentiable, which fixes a real weakness of nominal SPO. Second, the advertised finite-sample guarantee for the surrogate has a load-bearing gap: the Fisher-consistency threshold is only shown to be positive pointwise, and no condition ensures a uniform positive lower bound over contexts, so Theorem 4 and Corollary 3 can be vacuous for every fixed gamma>0.\n\nWhat is new and works well: the RSPO loss and convex surrogate RSPO+ are carefully constructed; the surrogate is differentiable with an explicit gradient, unlike SPO+. The Fisher-consistency characterization via an LP-computable threshold (Theorem 2) is a nice result, and the N^{-1/2} rates for the target RSPO predictor (Theorem 3) are solid. The experiments, while lacking code and confidence intervals, do show the expected qualitative gains under misspecification and limited samples.\n\nThe main problem is the gamma uniformity. Theorem 2(ii) shows gamma_bar(x)>0 for each x, but the proof gives no lower bound that holds almost surely. The text then says the Fisher-consistent regime holds for fixed gamma as soon as gamma <= ess inf_x gamma_bar(x); however, you can have gamma_bar(x) approach 0 along a sequence of contexts with positive probability, so the essential infimum is 0. Their example with ybar(t)=(1,t) and Z from Example 1 is concrete: nominal solution stays fixed, all the symmetry/density assumptions hold, but gamma_bar(t)=t->0. So for any fixed gamma>0, there is a positive-probability set of x where Condition 1(iii) fails, and the target excess risk bounds in Theorem 4 and Corollary 3 do not follow. This is not a minor technicality; it guts the claim that the surrogate achieves N^{-1/4} or N^{-1/2} rates under the stated assumptions. The theorems are conditionally correct, but the condition can be empty.\n\nMinor soft spots: the distributional assumptions (central symmetry, absolute continuity, unique nominal solution) are restrictive and not discussed much; the empirical section has no error bars and no code/data; and Section 2.3's 'first attempt' priority claim should be softened given related work by Schutte et al. and others.\n\nWho is this for: researchers in contextual optimization / decision-focused learning. It deserves a serious referee, but the referee should push for a fix: either prove a uniform lower bound under stronger, explicitly stated conditions, or reframe the surrogate guarantee as pointwise and drop the finite-sample rates unless the uniform condition is verified. Adding code and data would also help.\n\nI'd bring it to our reading group to discuss the uniform-condition issue. My recommendation: send it to peer review, but with the expectation of major revision.","headline":"Useful framework with a real gap: the advertised finite-sample guarantees for the surrogate rely on a uniform Fisher-consistency condition that can fail for every fixed gamma.","tokens_in":54689,"tokens_out":3300,"would_cite":false,"duration_ms":35803,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["90C15","90C05","90C25","90C47"],"pacs":[],"model":"deepseek-v4-flash","headline":"Using the same robust decision map to train and deploy — $z^\\star_\\gamma(\\hat y)=\\Pi_Z(-\\hat y/\\gamma)$ — makes decisions robust and aligned at once; the convex surrogate provably matches the target up to a computable threshold.","keywords":["integrated learning and optimization","decision-focused learning","robust optimization","contextual stochastic optimization","Fisher consistency","surrogate loss","excess risk bound","Rademacher complexity"],"falsifier":"Replicate the paper's own counterexample at a slope beyond the threshold: fix $x$, take $y\\mid x\\sim N((1,3/2)^\\top,\\sigma^2I_2)$ and $Z=\\{z\\in\\mathbb{R}^2:z_1-z_2\\le 1,\\ z_1\\ge -1,\\ z_1,z_2\\le 0\\}$, for which the paper computes $\\bar\\gamma=3/2$. Train the RSPO+ surrogate with $a=1$ and $\\gamma=2$ on an increasingly large sample and measure the average realized cost of the induced decisions against the best RSPO decision. The theory predicts a strictly positive, nonvanishing gap because $2\\bar y$ lies outside $Y^\\star_{\\mathrm{RSPO}}$; if the gap vanishes, the threshold characterization is wrong. The same setup with $\\gamma=1\\le\\bar\\gamma$ must show the gap shrink to zero, checking both sides of the claim in one experiment.","tokens_in":53459,"feed_emoji":"🎯","tokens_out":24469,"duration_ms":216090,"temperature":0.7,"pith_summary":"Decisions in transportation, portfolio allocation, and similar settings must be made after seeing context but before costs are realized; the standard pipeline predicts the cost vector and then solves a nominal linear program, which is unstable near switching boundaries and blind to the error that remains in any prediction. This paper claims both defects can be cured by one move: replace the nominal decision map with its regularized robust counterpart $z^\\star_\\gamma(\\hat y)=\\arg\\min_{z\\in Z}\\hat y^\\top z+\\frac{\\gamma}{2}\\|z\\|_2^2$, which is just the Euclidean projection $\\Pi_Z(-\\hat y/\\gamma)$ onto the feasible set, and use that same map to define the training loss and the deployed decision (the ILRO framework). The paper proves that the convex surrogate RSPO+ is Fisher consistent — minimizing it leads to decisions that minimize the true robust objective — exactly when the robustness parameter $\\gamma$ stays below a threshold $\\bar\\gamma(x)$ computable as a linear program, and proves finite-sample excess-risk bounds of order $O_p(N^{-1/2})$ for the robust-loss predictor and $O_p(N^{-1/4})$ (improving to $N^{-1/2}$ under extra growth conditions) for the surrogate. If the claims hold, practitioners get one knob, $\\gamma$, that buys hedging against forecast error and decision-quality training at the same time; the experiments place the largest gains precisely in the regimes that motivate decision-focused learning — small samples, high-dimensional decisions, and misspecified models.","feed_headline":"One robust decision map trains and deploys decisions","feed_subtitle":"The convex surrogate provably matches the robust objective up to a computable threshold; gains peak when data is scarce.","key_machinery":"The load-bearing object is the robust decision map $z^\\star_\\gamma(\\hat y)=\\arg\\min_{z\\in Z}\\{\\hat y^\\top z+\\tfrac{\\gamma}{2}\\|z\\|_2^2\\}$, which completing the square identifies with the Euclidean projection $\\Pi_Z(-\\hat y/\\gamma)$ onto the feasible set. This projection identity does three jobs: it makes the decision map $1/\\gamma$-Lipschitz and differentiable almost everywhere, so gradients flow through the actual deployed decision rule and vector contraction transfers loss-side complexity to the prediction class at factor $\\sqrt{2}\\,r/\\gamma$; it yields the convex, everywhere-differentiable surrogate RSPO+ whose gradient is $a(z^\\star_\\gamma(y)-z^\\star_\\gamma(\\hat y-y/a))$; and it identifies the set of target-risk-optimal predictions as the translated normal cone $-N_Z(z^\\star(\\bar y))-\\gamma z^\\star(\\bar y)$, collapsing Fisher consistency of the surrogate to one membership condition, $2\\bar y\\in -N_Z(z^\\star(\\bar y))-\\gamma z^\\star(\\bar y)$, equivalent to $\\gamma\\le\\bar\\gamma(x)$, a linear program when $Z$ is a polyhedron. The companion mechanism for computation is the closed-form Jacobian $\\nabla z^\\star_\\gamma(y_0)=\\tfrac{1}{\\gamma}(A_S^\\top(A_SA_S^\\top)^{-1}A_S-I)$ on the active face, which allows first-order descent on the original nonconvex objective. The RSPO loss itself, $\\ell_{\\mathrm{RSPO}}(\\hat y,y)=y^\\top z^\\star_\\gamma(\\hat y)-v^\\star(y)$, measures the excess realized cost of the robust decision induced by the prediction against the clairvoyant nominal optimum, and is nonnegative by construction.","core_discovery":"The paper's central claim is that replacing the nominal decision map $\\arg\\min_{z\\in Z}\\hat y^\\top z$, which is discontinuous and set-valued, with its regularized robust counterpart $z^\\star_\\gamma(\\hat y)=\\arg\\min_{z\\in Z}\\{\\hat y^\\top z+\\tfrac{\\gamma}{2}\\|z\\|_2^2\\}=\\Pi_Z(-\\hat y/\\gamma)$, and using this same map to define both the training loss (the RSPO loss $\\ell_{\\mathrm{RSPO}}(\\hat y,y)=y^\\top z^\\star_\\gamma(\\hat y)-v^\\star(y)$) and the deployed decision, yields a framework that is simultaneously robust and learning–decision aligned. Three mathematical assertions carry the claim. First, the projection identity makes $z^\\star_\\gamma$ $1/\\gamma$-Lipschitz and differentiable almost everywhere, so the training objective carries informative gradients, and the RSPO loss is Lipschitz in the prediction — the basis for a meta excess-risk bound of order $O_p(N^{-1/2})$ with an explicit factor $r/\\gamma$. Second, the convex surrogate RSPO+ upper-bounds the RSPO loss, is differentiable everywhere, and, with its free parameter set to $a=1$, has unique population minimizer $2\\bar y(x)$ under a central-symmetry condition on $y\\mid x$; because the set of target-risk minimizers is the translated normal cone $Y^\\star_{\\mathrm{RSPO}}=-N_Z(z^\\star(\\bar y))-\\gamma z^\\star(\\bar y)$, Fisher consistency holds exactly when $0<\\gamma\\le\\bar\\gamma(x)$, where $\\bar\\gamma(x)=\\sup\\{\\gamma\\ge 0:2\\bar y+\\gamma z^\\star(\\bar y)\\in -N_Z(z^\\star(\\bar y))\\}$ is computable as a linear program for polyhedral $Z$. Third, outside that regime the surrogate can converge to a predictor that is asymptotically suboptimal under the target RSPO risk — a nonvanishing bias the paper constructs explicitly in Example 1.","pith_inferences":["A model-based calibration rule the paper leaves implicit: because the provably honest regime is $0<\\gamma\\le\\mathrm{ess\\,inf}_x\\,\\bar\\gamma(x)$, a practitioner could restrict hyperparameter tuning to that interval, converting $\\gamma$ from a purely heuristic knob into a quantity with a proven upper bound.","Remark 2 shows the $\\ell_2$ penalty is one instance of a general strongly convex $\\phi$, with $1/\\mu$ in place of $1/\\gamma$; if the Fisher-consistency threshold and the $N^{-1/2}$ rates survive for a non-quadratic $\\phi$ such as a Huber-type penalty, the framework extends well beyond quadratic regularization — a direct testable generalization of the paper's own remark.","The projection identity suggests a template for other discontinuous decision maps: adding a strongly convex perturbation to a non-differentiable optimization layer smooths it into a trainable surrogate, and this paper's theory predicts the price of that smoothing is exactly the factor $1/\\gamma$ in the excess-risk bounds.","A natural experiment the paper does not run: hold $\\gamma$ fixed at several values and plot excess risk versus $N$ on a log-log scale; the theory predicts slope $-1/2$ for the RSPO predictor and $-1/4$ (or $-1/2$ under quadratic growth) for the surrogate, so the reported rates are directly testable."],"forward_implications":["Choosing $\\gamma\\le\\bar\\gamma(x)$ makes surrogate training statistically honest: with unlimited data the predictor converges to a target-risk minimizer, and with finite samples the target excess risk decays at rate $O_p(N^{-1/4})$, improving to $O_p(N^{-1/2})$ when the target risk grows no faster than quadratically near the oracle predictor.","The excess-risk bounds scale as $r/\\gamma$, so a more robust formulation (larger $\\gamma$) needs fewer samples for the same statistical guarantee — the paper states the concrete recommendation that, when data are limited, the decision-maker should seek more robust decisions.","Because the robust decision map is differentiable almost everywhere, the original nonconvex training objective can be descended by first-order methods; in the portfolio experiments, gradient-based refinement of the surrogate solution lowers out-of-sample decision loss further.","Against the post-hoc robust benchmark (identical robust deployment map, nominal training loss), the proposed RSPO+ training attains equal or lower normalized decision loss, with the largest margins at small sample sizes, high decision dimension, and stronger model misspecification — isolating the value of learning–decision alignment itself.","Decision gains appear even when relative prediction loss is worse than the benchmarks, implying that aligned training deliberately trades raw forecasting accuracy for decision-relevant accuracy."],"supporting_citations":[{"why":"The SPO loss, the SPO+ convex surrogate, and the ILO paradigm that ILRO robustifies; RSPO and RSPO+ are constructed as their robust counterparts and the Fisher-consistency analysis follows their pointwise-minimization route.","marker":"Elmachtoub and Grigas (2022)"},{"why":"The vector-contraction inequality that bounds the Rademacher complexity of the Lipschitz-composed robust loss by the prediction class, delivering the r/gamma factor in Theorem 3 and Proposition 8.","marker":"Maurer (2016)"},{"why":"Supplies the Rademacher-complexity and symmetrization framework behind the uniform deviation bound (Proposition 7) and the meta generalization bound of Theorem 3.","marker":"Bartlett and Mendelson (2002)"},{"why":"The interchangeability principle (their Theorem 14.60) that reduces population Fisher consistency to pointwise minimization over predictions, the setup of Section 4.2.","marker":"Rockafellar and Wets (1998)"},{"why":"Foundational robust-optimization modeling (hedging a nominal problem against an uncertainty set) that ILRO-Decision instantiates through the equivalent l2-penalized form of the ball-uncertainty problem.","marker":"Ben-Tal and Nemirovski (1999)"},{"why":"The finite-class concentration lemma used to bound the multivariate Rademacher complexity of polynomial-discrimination classes, yielding the N^{-1/2} rate in Table 2.","marker":"Massart (2000)"},{"why":"Provides the Dudley entropy-integral bound used in Example EC.3 to control the complexity of infinite-dimensional hypothesis classes at the same N^{-1/2} rate.","marker":"Wainwright (2019)"}],"fun_headline_variants":["Train and deploy with the same robust decision map","A convex surrogate provably matches robust decisions to a threshold","When data is scarce, robust integrated learning wins","One robust map, two tasks: learn and decide","Unify learning and robustness with a single decision map"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is distributional symmetry: conditional on the context, the cost vector must be spread symmetrically about its mean, with positive density around twice that mean, so that the surrogate's best predictor is exactly twice the conditional mean — if the noise is skewed, the surrogate can lock onto a predictor that is secretly biased for the robust objective even with unlimited data, and the theory also needs the nominal problem at the true mean to have one unique optimal solution.","fun_headline_variants_meta":{"raw":{"variants":["Train and deploy with the same robust decision map","A convex surrogate provably matches robust decisions to a threshold","When data is scarce, robust integrated learning wins","One robust map, two tasks: learn and decide","Unify learning and robustness with a single decision map"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000419,"raw_usage":{"total_tokens":2283,"prompt_tokens":1197,"completion_tokens":1086,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":813,"completion_tokens_details":{"reasoning_tokens":1011}},"tokens_in":813,"tokens_out":1086,"duration_ms":9773,"temperature":1.0,"reasoning_tokens":1011,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T04:26:14.576466+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Replicate the paper's own counterexample at a slope beyond the threshold: fix $x$, take $y\\mid x\\sim N((1,3/2)^\\top,\\sigma^2I_2)$ and $Z=\\{z\\in\\mathbb{R}^2:z_1-z_2\\le 1,\\ z_1\\ge -1,\\ z_1,z_2\\le 0\\}$, for which the paper computes $\\bar\\gamma=3/2$. Train the RSPO+ surrogate with $a=1$ and $\\gamma=2$ on an increasingly large sample and measure the average realized cost of the induced decisions against the best RSPO decision. The theory predicts a strictly positive, nonvanishing gap because $2\\bar y$ lies outside $Y^\\star_{\\mathrm{RSPO}}$; if the gap vanishes, the threshold characterization is wrong. The same setup with $\\gamma=1\\le\\bar\\gamma$ must show the gap shrink to zero, checking both sides of the claim in one experiment.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"The vector-contraction inequality that bounds the Rademacher complexity of the Lipschitz-composed robust loss by the prediction class, delivering the r/gamma factor in Theorem 3 and Proposition 8."}],"review_version":1}