{"id":"e55a840e-da3d-45fa-bed3-2620b39294d8","arxiv_id":"2606.29338","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Controlled SA-NODEs uniformly approximate trajectories of nonlinear controlled systems on compact sets and preserve approximate controllability, with error O(P^{-1/2} + Q^{-1/2}) under Sobolev and Barron regularity.","lead":"The paper introduces controlled semiautonomous neural ordinary differential equations (controlled SA-NODEs) to approximate trajectories of nonlinear control-affine systems while using fewer trainable parameters. A smart generalist might read it for insights into making machine learning models for physical control systems more efficient.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest_assumption correctly isolates the regularity conditions that the quantitative and controllability claims depend on. Because the abstract already flags these hypotheses, the load-bearing point is the same whether or not the full proofs are examined; no additional structural flaw is visible.","tokens_in":1684,"tokens_out":263,"duration_ms":34425,"concrete_test":"Read the precise statement of the universal approximation theorem (likely Theorem 3.x or 4.x) and the controllability preservation result; confirm that both are stated with the Sobolev/Barron hypotheses made explicit and that the controllability argument only invokes the uniform trajectory approximation on the relevant compact sets.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claims (universal approximation on compact sets of states/controls, quantitative rates under Sobolev/Barron regularity, and preservation of approximate controllability) are explicitly conditioned on the control-affine structure and the stated regularity assumptions. These conditions are necessary for the approximation rates derived from Barron-type estimates and for the controllability transfer argument; without them the quantitative statements do not hold, but the paper does not claim they do. No internal inconsistency or hidden assumption is apparent from the abstract statement of the results.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript introduces controlled semiautonomous neural ODEs (SA-NODEs) for approximation and learning of nonlinear control-affine dynamical systems. It proves a universal approximation theorem establishing uniform trajectory approximation on compact sets of initial conditions and admissible controls, derives quantitative error bounds of order O(P^{-1/2} + Q^{-1/2}) under Sobolev and Barron regularity assumptions, shows that approximate controllability properties are preserved under the approximation, and validates the approach via numerical experiments on controlled pendulum and Duffing oscillator systems that achieve accurate reconstruction with significantly fewer trainable parameters than standard neural ODEs.","tokens_in":1772,"tokens_out":569,"duration_ms":28308,"significance":"If the central theorems hold, the work supplies a parameter-efficient neural-ODE architecture with explicit approximation rates and controllability transfer for control-affine systems. This combination of universal approximation, quantitative Barron-type bounds, and preservation of controllability is a substantive contribution to the intersection of neural differential equations and nonlinear control theory.","major_comments":[{"comment":"§3, Theorem 3.2 (quantitative estimates): the O(P^{-1/2} + Q^{-1/2}) rate is stated to follow from Barron-space estimates, but the proof must explicitly verify that the control-affine structure and the time-independent coefficients of the SA-NODE do not introduce additional factors that degrade the rate when the control enters the vector field.","section":"§3, Theorem 3.2"},{"comment":"§4, Theorem 4.1 (controllability preservation): the argument that approximate controllability is inherited relies on the trajectory error being small uniformly in controls; the section should contain an explicit estimate showing how the controllability radius or minimal time changes with the approximation error, rather than only invoking continuity of the flow.","section":"§4, Theorem 4.1"}],"minor_comments":[{"comment":"The statements of the main theorems should list the precise function-space assumptions (Sobolev index, Barron norm bound) in the theorem hypotheses rather than only in the surrounding text.","section":null},{"comment":"In the numerical section, report the exact number of trainable parameters for both the SA-NODE and the baseline neural ODE on each example so that the 'significantly fewer' claim can be verified quantitatively.","section":"Numerical experiments"},{"comment":"Notation for the control input dimension and the semiautonomous parameter count (P, Q) should be introduced once in §2 and used consistently thereafter.","section":"§2"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive assessment and the recommendation for minor revision. The two major comments are addressed point-by-point below; both can be resolved by adding explicit clarifications and quantitative estimates to the revised manuscript.","responses":[{"response":"We agree that an explicit verification is helpful. The proof of Theorem 3.2 approximates the drift vector field f and the control vector fields g_i separately in Barron space; because the control enters linearly and the admissible controls lie in a compact set, the standard Barron rates apply directly to each component without multiplicative factors depending on the control dimension. The time-independent coefficients of the SA-NODE are already accounted for in the semiautonomous construction and do not alter the Sobolev-to-Barron embedding constants. In the revision we will insert a short paragraph immediately after the statement of Theorem 3.2 that spells out this decomposition and confirms that no rate degradation occurs.","revision_made":"yes","referee_comment":"[§3, Theorem 3.2] §3, Theorem 3.2 (quantitative estimates): the O(P^{-1/2} + Q^{-1/2}) rate is stated to follow from Barron-space estimates, but the proof must explicitly verify that the control-affine structure and the time-independent coefficients of the SA-NODE do not introduce additional factors that degrade the rate when the control enters the vector field."},{"response":"We accept the suggestion. While the uniform trajectory error bound already implies that controllability is preserved for sufficiently small approximation error, an explicit modulus would be clearer. Under the standing Lipschitz and compactness assumptions, the difference in reachable sets is bounded by the trajectory error ε; consequently the controllability radius changes by at most Cε and the minimal time by at most Cε for a constant C depending only on the Lipschitz constant of the vector field. We will add this quantitative statement, together with the short derivation, to the proof of Theorem 4.1.","revision_made":"yes","referee_comment":"[§4, Theorem 4.1] §4, Theorem 4.1 (controllability preservation): the argument that approximate controllability is inherited relies on the trajectory error being small uniformly in controls; the section should contain an explicit estimate showing how the controllability radius or minimal time changes with the approximation error, rather than only invoking continuity of the flow."}],"tokens_in":1357,"tokens_out":516,"duration_ms":25639,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main takeaway is that this paper extends semiautonomous NODEs to control-affine systems by making the control input enter through time-independent trainable coefficients. They prove a universal approximation result for trajectories on compact sets of states and controls, plus a transfer of approximate controllability, and they report quantitative rates under Sobolev and Barron conditions.\n\nWhat stands out is the explicit architecture choice that keeps parameter count low while still targeting controlled dynamics. The experiments on the pendulum and Duffing oscillator show trajectory reconstruction and controllability performance that matches or beats classical NODEs with far fewer trainable parameters. That empirical comparison is straightforward and directly tied to the claimed advantage.\n\nThe rates and controllability claim only hold when the vector fields meet the stated regularity assumptions, so the quantitative part is narrower than the title might suggest. The numerical tests stay on two low-dimensional oscillators, which leaves scaling and robustness on harder systems unaddressed. Proof details are not visible in the abstract, but the stated claims do not show internal contradictions or circular steps.\n\nThis is for people working at the intersection of neural ODEs and mathematical control who need both approximation guarantees and parameter efficiency. A reader already familiar with NODE literature will see the incremental extension clearly.\n\nIt has formal theorems and reproducible experiments on standard benchmarks, so it deserves a serious referee rather than a desk reject.","headline":"Controlled SA-NODEs give a parameter-light way to approximate trajectories and keep controllability for control-affine systems, backed by theorems and simple experiments.","tokens_in":2220,"tokens_out":347,"would_cite":false,"duration_ms":25230,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Controlled SA-NODEs approximate trajectories of nonlinear control-affine systems uniformly on compact sets and preserve their approximate controllability.","keywords":["neural ordinary differential equations","control-affine systems","universal approximation","approximate controllability","dynamical systems approximation"],"falsifier":"An explicit control-affine system meeting the regularity assumptions whose trajectories on some compact set of initial conditions and controls cannot be approximated to arbitrary accuracy by any controlled SA-NODE, or for which the approximating model loses approximate controllability.","tokens_in":2593,"feed_emoji":"","tokens_out":722,"duration_ms":32130,"temperature":0.7,"pith_summary":"The paper introduces controlled semiautonomous neural ordinary differential equations as a reduced-parameter model for nonlinear control-affine systems. It proves that these models approximate the trajectories of the original systems uniformly over compact sets of initial states and admissible controls. Under Sobolev and Barron regularity on the system functions, the approximation error is bounded by order O(P^{-1/2} + Q^{-1/2}). The construction also transfers approximate controllability from the true system to its neural approximation. Experiments on the controlled pendulum and Duffing oscillator confirm that the models recover trajectories and controllability properties while using far fewer trainable parameters than standard neural ODEs.","feed_headline":"Controlled SA-NODEs approximate nonlinear control-affine trajectories uniformly","feed_subtitle":"The models inherit approximate controllability and achieve O(P^{-1/2}+Q^{-1/2}) error with far fewer parameters than standard neural ODEs.","key_machinery":"Controlled semiautonomous neural ordinary differential equations (controlled SA-NODEs), which embed control-affine structure into a neural ODE while keeping trainable coefficients time-independent.","core_discovery":"Controlled SA-NODEs, formed by extending semiautonomous neural ODEs to control-affine dynamics with time-independent trainable coefficients, uniformly approximate the flow of any nonlinear control-affine system on compact sets of initial conditions and controls. When the drift and control vector fields satisfy the stated Sobolev and Barron conditions, the approximation error admits the quantitative rate O(P^{-1/2} + Q^{-1/2}). The same construction preserves the approximate controllability property of the original system.","pith_inferences":["The same construction might be adapted to systems with state-dependent control coefficients if the regularity assumptions can be relaxed.","Because parameter count is reduced, the approach could scale more readily to high-dimensional or long-horizon control problems than dense neural ODEs.","Preservation of controllability opens the possibility of using the learned model inside model-predictive or reinforcement-learning loops without separate controllability verification."],"forward_implications":["Approximate controllability of the true system is inherited by the neural model, so control designs based on the approximation remain valid for the original dynamics.","The quantitative error bound scales with the number of parameters P and Q, giving explicit guarantees once network widths are chosen.","Trajectory reconstruction on the pendulum and Duffing examples succeeds with significantly fewer parameters than classical neural ODEs.","The framework applies directly to any control-affine system whose vector fields meet the regularity hypotheses."],"fun_headline_variants":["Controlled SA-NODEs uniformly approximate nonlinear control-affine systems","SA-NODEs preserve approximate controllability of original systems","Quantitative rates O(P^{-1/2} + Q^{-1/2}) for SA-NODE approximations","Time-independent coefficients reduce params in controlled SA-NODEs"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The underlying dynamics must be control-affine and the drift and control vector fields must satisfy the Sobolev and Barron regularity conditions needed for the error bounds and controllability transfer.","fun_headline_variants_meta":{"raw":{"variants":["Controlled SA-NODEs uniformly approximate nonlinear control-affine systems","SA-NODEs preserve approximate controllability of original systems","Quantitative rates O(P^{-1/2} + Q^{-1/2}) for SA-NODE approximations","Time-independent coefficients reduce params in controlled SA-NODEs"]},"model":"grok-4.3","cost_usd":0.006514,"raw_usage":{"total_tokens":3035,"prompt_tokens":644,"num_sources_used":0,"completion_tokens":76,"cost_in_usd_ticks":65137000,"prompt_tokens_details":{"text_tokens":644,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2315,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":644,"tokens_out":76,"duration_ms":31665,"temperature":1.0,"reasoning_tokens":2315,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-30T02:42:57.199576+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit control-affine system meeting the regularity assumptions whose trajectories on some compact set of initial conditions and controls cannot be approximated to arbitrary accuracy by any controlled SA-NODE, or for which the approximating model loses approximate controllability.","supporting_citations":[],"review_version":1}