{"id":"8e2daeec-937a-403b-afba-12a246df274c","arxiv_id":"2611.17076","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"An adaptive constraint-sampling scheme for stochastic gradient methods maintains a working set of recently violated constraints and empirically outperforms uniform sampling on large-scale convex optimization and CBF synthesis.","lead":"This paper introduces an adaptive constraint-sampling algorithm for stochastic gradient methods that prioritize recently violated constraints, keeping per-iteration cost independent of the total number of constraints. On synthetic convex problems and a control barrier function synthesis task, it reports up to two orders of magnitude improvement in solution accuracy over uniform constraint sampling.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek/deepseek-v4-flash","headline":"Hyperparameter tuning differs between CST and uniform baselines, making the claimed improvement uninterpretable.","rationale":"The reader's weakest_assumption focuses on the theoretical gap (active-set identification without proof). That is a valid concern, but the paper explicitly acknowledges the lack of theory and defers it to future work. The more immediate empirical concern is that the comparison is not apples-to-apples: hyperparameters differ between CST and uniform baselines. The paper's own Tables 1 and 2 show systematic differences in step sizes, penalty parameters, and other algorithmic knobs. Without a controlled ablation, the reported improvements cannot be attributed to the sampling strategy. This is a concrete, testable issue that does not require new theory. The reader's verdict of CONDITIONAL is appropriate, but the condition should include a fair comparison. I agree partially with the reader: the theoretical gap is real but acknowledged; the empirical gap is more pressing because it undermines the central empirical claim.","tokens_in":15512,"tokens_out":632,"duration_ms":7140,"concrete_test":"Rerun the synthetic experiments (Section 4.1) with identical hyperparameters for CST and uniform sampling, using the hyperparameters from the CST column for both. If the improvement shrinks or vanishes, the claim that adaptive sampling is responsible is unsupported. If the improvement persists, the concern is resolved.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper compares adaptive constraint sampling (CST) against uniform sampling, but the hyperparameters for each method are tuned separately (Tables 1 and 2). For example, in Section 4.1, ABSGD with uniform sampling uses step size γ_ABk = (1/3)(k+1)^{-0.9}, while CST uses γ_ABk = (k+1)^{-0.9} — a factor of 3 difference. Similarly, Huber-penalty SGD uses s_k = (1/3)(k+1)^{-0.9} for uniform but s_k = (k+1)^{-0.9} for CST, and the penalty parameter γ_Hk differs by a factor of ~2000. APDSG uses ϱ=10^4 and η̄=10^4 for uniform, but ϱ=10^3 and η̄=10^3 for CST. These are not the same algorithm with different sampling; they are different algorithms with different step sizes, penalty parameters, and adaptation rates. The central claim — that CST outperforms uniform sampling — conflates the effect of the sampling strategy with the effect of independently tuned hyperparameters. A fair comparison would require identical hyperparameters or a controlled ablation. The paper acknowledges tuning 'to the best of our effort' but does not justify why different hyperparameters are needed or what the comparison would look like with shared hyperparameters. This is a load-bearing concern because the headline improvement (up to 100×) could be driven by the hyperparameter choices rather than the sampling strategy.","agreement_with_reader":"partial"},"referee_report":null,"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"Colleague,\n\nYou should know this paper proposes a practical adaptive constraint-sampling heuristic for stochastic gradient methods on problems with many linear inequality constraints. The core idea—maintaining a working set of recently violated constraints and sampling from it with probability η—is sensible and the per-iteration overhead is indeed O(1) amortized. The empirical results on synthetic problems and a Dubins car CBF synthesis look promising at first glance.\n\nWhat the paper does well: the algorithm is clearly described, the motivation is sound, and the experiments cover several base optimizers (ABSGD, Projection-SGD, Huber-penalty SGD, APDSG) and problem sizes up to 10^6 constraints. The wall-clock overhead is reported as under 10%, which is useful. The authors also show some sensitivity analysis for η and the threshold exponent ω.\n\nNow the soft spots. The main one is the comparison against uniform sampling. The hyperparameters for CST and uniform are tuned separately (Tables 1 and 2), and they differ substantially—step sizes differ by factors of 3, penalty parameters by orders of magnitude. This means the headline improvement (up to 100×) conflates the effect of the sampling strategy with the effect of different step sizes and penalty schedules. The paper acknowledges tuning 'to the best of our effort' but does not justify why different hyperparameters are needed or show what happens with shared hyperparameters. This is a load-bearing flaw: without a controlled ablation, the central claim is uninterpretable.\n\nA secondary concern: there is no convergence theory. The authors state this explicitly and defer it to future work, which is honest, but it means the paper is purely empirical. The informal argument in Section 3.2 is not a proof and depends on unspecified conditions on ε_k and τ_k.\n\nMinor: the paper claims 'amortized O(1)' overhead but does not discuss implementation details that would achieve this (e.g., data structures for the important set). The remark about wall-clock time is helpful but brief.\n\nWho this is for: practitioners working on large-scale constrained optimization who might benefit from a simple adaptive sampling heuristic. The paper is worth reading as an empirical proposal, but the claims need to be tempered.\n\nRecommendation: I would not desk-reject this, but I would send it to review with a strong request for a controlled comparison. The authors should either use identical hyperparameters for CST and uniform, or clearly separate the effect of sampling from the effect of tuning. Without that, the paper cannot be accepted as is. If the authors can provide a clean ablation, the contribution is real and publishable.","headline":"Interesting algorithm, but the comparison is not controlled enough to support the headline claims.","tokens_in":16400,"tokens_out":617,"duration_ms":7397},"pith_extraction":null,"created_at":"2026-11-13T10:18:19.018733+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":null,"supporting_citations":[],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}