{"id":"77e07629-981e-4e25-9769-d2e82b38959c","arxiv_id":"2607.14023","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"Adversarial reach-always-avoid and reach-reach value functions decompose exactly into standard reach/avoid value functions in continuous-time finite-horizon games.","lead":"This paper proves that two 'reach plus avoid' style control problems can be exactly split into simpler safety or goal tasks even when a disturbance player actively fights the controller. This makes it possible to reuse standard Hamilton-Jacobi solvers for more complex drug-dosing and robotics safety tasks.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified","rationale":"The reader accepted the paper with moderate confidence and identified the non-anticipativity/continuity of the concatenated strategies as the weakest assumption. I examined the appendix proofs in detail. The switch-time sets are closed by continuity of the value functions, and a nonempty closed subset of [t,T) always has a minimum; this is the only role continuity plays. The concatenated strategy's non-anticipativity can be filled in rigorously: for agreeing controls, any active switch time <= b must coincide for both controls, and if no active switch time is <= b, both strategies use the same primary strategy up to b. The paper's outline for Theorem 2 is terse but correct; no hidden cross-order case breaks it. Measurability of the switch-time map is not needed because Definition 1 only requires pointwise non-anticipativity. The terminal boundary cases also work: if S_v is empty, continuity across T forces r(T) <= V_A(T) (otherwise a switch would exist arbitrarily close to T), so the substitution r=min{r,V_A} is exact at the maximizing time. The central claims are therefore well-supported. The only genuine caveats are expository: the Theorem 2 non-anticipativity proof is sketched rather than fully detailed, and no code/data accompany the drug-dosing examples. These do not threaten the theoretical decomposition, so the reader's ACCEPT verdict stands unchanged.","tokens_in":15275,"tokens_out":28359,"duration_ms":247849,"concrete_test":"Run a numerical validation on 1D/2D benchmark dynamics: compute V_RAA[r,q] directly with a standard HJ reach-avoid solver and compare pointwise against V_RA[min{r,V_A},q] on the same grid (e.g., 101x101, same T); similarly compare V_RR[r1,r2] against V_R[tilde_r]. If max pointwise error exceeds solver tolerance, re-examine the non-anticipativity construction; if error is at solver tolerance, the theorem is corroborated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No significant objection identified. The reader's flagged concern — that the concatenated adversary strategies in the proofs (Theorem 1 after Eq. 12, Theorem 2 after Eq. 32) may fail non-anticipativity if V_A/V_R are not continuous or if switch-time selection is not measurable — does not land. The switch sets S_u are closed because r/V_A (resp. r1,r2/V_R) are continuous; a nonempty closed subset of [t,T) always has a minimum because continuity gives a gap at t if t is not in the set, so the set lies in a compact subinterval [t+delta,T). For two control signals agreeing on [t,b), if an active switch time s <= b, the equal-switch-time argument forces equality for that index; cross-order mismatches are excluded by applying the same argument to whichever switch time is <= b. No measurability of s_u as a function of u is required by Definition 1, which is pointwise. Continuity of V_A, V_R under Assumptions 1-2 is standard (Bardi & Capuzzo-Dolcetta). The apparent terminal issue in Theorem 1's S_v-empty subcase, where r(T) is replaced by min{r(T),V_A(T)}, is justified by continuity: if the inequality failed at T, the gap would force a switch time <T. The epsilon-chains close. Remaining soft spots (sketchiness of Theorem 2's non-anticipativity outline, absence of code/data) affect exposition/reproducibility, not the central claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies exact value-function decompositions for two dual-objective Hamilton-Jacobi reachability (HJR) tasks in the presence of an adversarial disturbance player, in a continuous-time, finite-horizon setting with non-anticipative adversary strategies. Theorem 1 claims that the reach-always-avoid (RAA) value function decomposes as V_RAA[r,q] = V_RA[min{r,V_A[q]}, q]. Theorem 2 claims that the reach-reach (RR) value function decomposes as V_RR[r1,r2] = V_R[max{min{r1,V_R[r2]}, min{r2,V_R[r1]}}]. The proofs in the appendix construct epsilon-optimal concatenated adversary strategies, switching between component-wise strategies at times determined by comparing the running rewards with the relevant basic value functions. The paper also gives two pharmacokinetic/pharmacodynamic dosing examples illustrating how the RAA and RR formulations improve over naive reach-avoid or simultaneous-reach approaches.","tokens_in":15602,"tokens_out":10006,"duration_ms":101949,"significance":"If the theorems are correct, they are a meaningful contribution to adversarial HJR: they certify that two composite value functions can be computed exactly by first solving standard reach, avoid, or reach-avoid problems and then composing the resulting value functions, despite the minimax structure that usually prevents such decompositions. The counterexample in Section III-B correctly shows that not every one-player decomposition survives an adversary, so the positive results are not vacuous. The appendix is careful: the epsilon-chains are detailed, the switch sets are closed due to continuity of the terminal functions and the basic value functions, and the non-anticipativity of the concatenated strategies is checked pointwise, with no measurability of the strategy map required by Definition 1. The potentially fragile point identified in the stress-test—existence of the switch-time minima and equality of switch times for inputs that agree up to a common time—does not land; continuity gives the needed minima, and the equal-switch argument is sound. The simulations are illustrative rather than exhaustive, but they do support the claimed practical benefit. Overall, this is a solid th","major_comments":[],"minor_comments":[{"comment":"The non-anticipativity verification for the composite strategy sigma is compressed to a one-paragraph outline 'for space.' Since admissibility of sigma is load-bearing for the (≤) direction, please expand this to the same level of detail as in Theorem 1, explicitly covering the two-switch-set case and the possibility that one or both switch times equal T.","section":"Appendix, Theorem 2 proof, after Eq. (32)"},{"comment":"No code or numerical-solver details are provided for the simulations. The theoretical claims do not depend on the simulations, but for reproducibility and to allow readers to independently check the claimed comparisons, please state the numerical scheme, grid resolution, and convergence tolerances, or provide code with the revision.","section":"Section V, Figs. 1 and 2"},{"comment":"The convention 's_u := min S_u if S_u≠∅ and s_u := T otherwise' is clear, but the existence of the minimum when S_u is nonempty is only implicit. A one-sentence justification using continuity of r−V_A and r_i−V_R would help the reader.","section":"Eqs. (12) and (30)-(31)"}],"recommendation":"minor_revision","confidential_remarks":"I agree with the reader's assessment. The central theorems are sound and the proof strategy is appropriate; the only requested changes are local (expanding a compressed proof step and adding reproducibility details for the examples). No concerns about circularity or novelty disclosure."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The short version: this paper proves exact decompositions for two composite HJR value functions—reach-always-avoid and reach-reach—that survive an adversarial disturbance player in continuous time. That is genuinely new relative to [7] (adversary-free) and [15] (finite-state, discrete-time, single-player). The counterexample in Section III-B shows the naive ordered RR decomposition breaks with a disturbance, so the positive results are not empty. The main theorems are proved carefully in the appendix; the epsilon-chains check out and the strategy concatenation arguments are sound. The Theorem 2 non-anticipativity claim is sketched \"for space,\" but the pattern is the same as Theorem 1 and the sketch is convincing enough; the equal-switch-time argument goes through using continuity of V_R and V_A. The drug-dosing examples show the intended use but are illustrative—no code or data for the figures, which is a minor reproducibility gap, not a flaw in the theory.\n\nSoft spots, in proportion: the applications section reads as motivation rather than a validation of the theorems; the simulations are not reproducible from the text. The proof of Theorem 2's (≥) direction relies on Lemma 1 and a WLOG ordering argument; both are fine. The main potential worry—whether the concatenated strategies are genuinely non-anticipative—does not land: the switch sets are closed under continuity, the minimum exists if nonempty, and non-anticipativity is checked pointwise, so no measurability issue arises. That was my first instinct too, but reading the appendix carefully it holds.\n\nWho is this for? Researchers in HJR or safe control who want to compute RAA or RR values from standard reach/avoid solvers, or those building on single-player decomposition results. It deserves a serious referee: the result is nontrivial, the proofs are mostly complete, and the connection to prior work is honest. The citations are appropriate; self-citations [7] and [15] are the direct antecedents, not padding.\n\nRecommendation: send it to peer review. If you referee it, ask for the omitted non-anticipativity details in Theorem 2 and for code or at least parameter tables for the simulations. But the central claim is solid.","headline":"Genuinely new adversarial decomposition theorems for RAA and RR value functions in continuous-time HJR; the proofs hold up, and the counterexample motivates the results.","tokens_in":16036,"tokens_out":1681,"would_cite":true,"duration_ms":15886,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["49N70","35D40"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that two composite Hamilton-Jacobi reachability value functions — reach-always-avoid and reach-reach — decompose exactly into basic reach/avoid value functions even when an adversarial disturbance is present, and demonstra","keywords":["Hamilton-Jacobi reachability","value function decomposition","non-anticipative strategies","reach-always-avoid","reach-reach","adversarial games","optimal drug dosing","viscosity solutions"],"falsifier":"Run a dense-grid HJI comparison on the two-compartment PK model (Eq. 4-6) with zero disturbance: if V_RAA[r,q] and V_RA[min{r,V_A[q]},q] differ by more than solver tolerance at any grid point, the identity fails; the same check on a system where V_A[q] is artificially modified to be discontinuous would test the continuity requirement.","tokens_in":15185,"feed_emoji":"🎯","tokens_out":7889,"duration_ms":79892,"temperature":0.7,"pith_summary":"Classic Hamilton-Jacobi reachability gives value functions for reach, avoid, and reach-avoid tasks, but more complex dual-objective tasks such as 'reach the target and then always avoid the obstacle' (RAA) or 'reach both targets in either order' (RR) have had no guarantee that their values factor through the basic solvers once an adversarial disturbance is present. This paper proves that two particular decompositions do hold exactly for continuous-time, finite-horizon systems with non-anticipative adversary strategies: RAA reduces to an avoid value followed by a standard reach-avoid value, and RR reduces to two reach values combined into a single reach problem. The proofs construct non-anticipative strategies that switch at the first time the primal trajectory crosses a value-derived threshold. A companion counterexample shows that not every natural decomposition survives an adversary, highlighting why this certification matters. The authors then demonstrate that the RAA split removes post-therapy toxicity in a pharmacokinetic dosing example and that the RR split enables coordinated target achievement in a mutual-inhibition protein model.","feed_headline":"Proven: two composite value functions split exactly despite an adversary","feed_subtitle":"Proof reduces reach-always-avoid and reach-reach to basic solvers; examples show safer drug dosing.","key_machinery":"The key machinery is the concatenation of non-anticipative strategies at a value-function crossing time. The paper defines, for each control signal u, a switch set S_u on which the running reward r exceeds the appropriate inner value function (V_A for RAA, V_R of the other target for RR), picks s_u = min S_u (with s_u = T if empty), and then builds a composite adversary strategy that plays the primary strategy before s_u and a pre-selected family of secondary strategies after s_u. Continuity of the value functions ensures the switch sets are closed, hence have a minimum; the epsilon-chain argument then shows both directions of the equality. For the RR problem, a second switch set handles the","core_discovery":"On the paper's own terms, the central discovery is a pair of identities: V_RAA[r,q] = V_RA[min{r, V_A[q]}, q] and V_RR[r1,r2] = V_R[max{min{r1,V_R[r2]}, min{r2,V_R[r1]}}], both for continuous r, q, r1, r2 and t < T. The authors prove each identity in two inclusions, using epsilon-optimal strategies: for one inequality they concatenate an adversary strategy for the primal objective with a family of near-optimal strategies for the secondary objective, switching at the first time the target reward reaches the secondary value function; for the other inequality they splice a control signal after an arbitrarily chosen switch time. The paper also exhibits a counterexample (order-constrained reach)","pith_inferences":["The same switch-time argument suggests a general recipe: a composite minimax value decomposes whenever the inner value functions are continuous and act as absorbing 'barriers,' so the adversary cannot improve by crossing them; this could certify decompositions for richer temporal-logic specifications such as reach-avoid-reach or nested reach-avoid.","Because the proof's switch time is defined through exact value functions, approximate learning-based surrogates for V_A or V_R would shift the switch point and may break the guarantee; testing the sensitivity of RAA/RR closed-loop performance to value-function error would be a direct experimental extension.","The two identities are composable: applying Theorem 1 then Theorem 2 (or vice versa) may yield exact factors for a three-objective task such as 'reach target 1, then reach target 2, never entering obstacle,' which is not discussed in the paper.","The PK example treats continuous dosing; translating to discrete pill regimens will interact with the decomposition's exact switch time, a practical question left open."],"forward_implications":["Computing V_RAA becomes a two-stage pipeline: solve an avoid value, form the modified target, then solve a standard reach-avoid; no dedicated RAA HJI PDE is needed.","Computing V_RR likewise reduces to two reach solves and one final reach solve, with the modified target combining the two reach values.","The switching rule from the proof yields a natural closed-loop controller: drive with the composite value until the running reward crosses the secondary value, then hand off to the secondary value's controller.","The counterexample for ordered-reach shows the decomposition is not a formal free-for-all: only the specific min/max structures of RAA and RR are certified to survive an adversary.","In the drug-dosing examples, RAA-based policies keep kidney concentration below the toxic threshold even after the therapeutic goal is met, which reach-avoid policies fail to do."],"fun_headline_variants":["Exact decomposition proves dual-objective values split despite adversary","Adversary-proof decomposition for reach-avoid and reach-reach objectives","Exact value decomposition holds under adversary, enabling safer drug dosing","Two composite value functions split exactly even with an adversary","Drug regimen design improved via exact adversarial value decomposition"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The entire proof rests on being able to define (and keep non-anticipative) a composite adversary strategy that switches at the minimum time the running reward crosses the inner value function; that requires the inner value functions to be continuous and the switch-time map to be measurable, which the paper justifies only by citing standard value-function continuity and sketching the non-anticipativity check.","fun_headline_variants_meta":{"raw":{"variants":["Exact decomposition proves dual-objective values split despite adversary","Adversary-proof decomposition for reach-avoid and reach-reach objectives","Exact value decomposition holds under adversary, enabling safer drug dosing","Two composite value functions split exactly even with an adversary","Drug regimen design improved via exact adversarial value decomposition"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.0008,"raw_usage":{"total_tokens":3316,"prompt_tokens":667,"completion_tokens":2649,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":411,"completion_tokens_details":{"reasoning_tokens":2577}},"tokens_in":411,"tokens_out":2649,"duration_ms":19378,"temperature":1.0,"reasoning_tokens":2577,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T02:59:22.248321+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run a dense-grid HJI comparison on the two-compartment PK model (Eq. 4-6) with zero disturbance: if V_RAA[r,q] and V_RA[min{r,V_A[q]},q] differ by more than solver tolerance at any grid point, the identity fails; the same check on a system where V_A[q] is artificially modified to be discontinuous would test the continuity requirement.","supporting_citations":[],"review_version":1}