{"id":"4582c998-ab6b-4228-9dd6-7201c519e291","arxiv_id":"2607.12343","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":3,"one_line_summary":"A convex homothetic-tube MPC embeds non-asymptotic least-squares parameter confidence sets to guarantee high-probability feasibility, constraint satisfaction, and ISS for uncertain linear systems.","lead":"This paper builds a learning-based tube model-predictive controller that estimates unknown linear-system parameters online and still keeps hard constraints with high probability. It matters because it turns non-asymptotic least-squares confidence sets into a convex, implementable robust MPC scheme with explicit stability bounds.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified beyond the abstract-only information limit already flagged by the reader.","rationale":"The reader correctly identified that the abstract alone cannot support a soundness verdict and that the embedding of the non-asymptotic confidence set is the critical uncheckable step. No stronger or more specific load-bearing concern can be extracted without the proofs, the precise form of the tube update, or numerical evidence. Consequently the UNVERDICTED / LOW-confidence assessment remains appropriate; no adjustment is warranted.","tokens_in":1962,"tokens_out":350,"duration_ms":3592,"concrete_test":"Obtain the full paper and verify that the high-probability outer approximation property of the RLS set is preserved under the specific homothetic-tube propagation and constraint-tightening maps used in the convex program (i.e., that the set remains a valid robust outer bound at every predicted step). If that preservation holds with the stated probability, the central claim stands; otherwise the feasibility/ISS arguments fail.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The abstract presents a coherent claim: a high-probability confidence set from non-asymptotic regularized least-squares is embedded into a convex homothetic-tube MPC, yielding high-probability recursive feasibility, robust constraint satisfaction, ISS, and explicit non-asymptotic state bounds. Nothing in the abstract is internally inconsistent or contradicts known properties of tube MPC or non-asymptotic RLS. The load-bearing premise (that the confidence set can be so embedded without destroying the guarantees) is uncheckable without proofs or algorithms, but that is precisely the information deficit already recorded by the reader; it is not a new technical flaw.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The manuscript proposes a learning-based homothetic-tube MPC for constrained stabilization of discrete-time linear systems with unknown parameters and additive bounded disturbances. A high-probability parameter confidence set is constructed online via non-asymptotic regularized least-squares estimation and embedded into robust tube propagation and constraint tightening, producing a convex program with linear and second-order-cone constraints. The authors claim high-probability recursive feasibility, robust constraint satisfaction, input-to-state stability, and explicit non-asymptotic state bounds, with a numerical example offered as illustration.","tokens_in":2065,"tokens_out":728,"duration_ms":5758,"significance":"If the claimed guarantees hold with the stated non-asymptotic character, the work would meaningfully advance learning-based robust MPC by replacing a priori uncertainty sets with data-driven high-probability sets while retaining convexity and classical tube-MPC properties (recursive feasibility, ISS). Explicit non-asymptotic state bounds and a convex SOCP formulation would be practically useful for systems with parametric uncertainty and bounded disturbances. Because only the abstract is available, these contributions cannot yet be verified; their significance therefore remains conditional on the proofs and numerical evidence that the full manuscript is expected to contain.","major_comments":[{"comment":"Only the abstract is available for review. Consequently the central technical claims—high-probability recursive feasibility, robust constraint satisfaction, ISS, and explicit non-asymptotic state bounds—cannot be inspected. The load-bearing construction (embedding of the non-asymptotic RLS confidence set into homothetic-tube propagation and constraint tightening without destroying convexity or the probabilistic guarantees) is asserted but not checkable. A full manuscript with theorems, proofs, algorithm statements, and numerical data is required before any soundness judgment can be rendered.","section":null},{"comment":"The abstract states that the confidence set is “embedded into robust tube propagation and constraint tightening, yielding a convex formulation with linear and second-order-cone constraints.” Without the explicit set description, the tube-update equations, or the resulting optimization program, it is impossible to verify that the embedding preserves convexity and that the high-probability outer approximation remains valid under closed-loop dynamics. This step is essential to the paper’s contribution and must be supplied and scrutinized.","section":null}],"minor_comments":[{"comment":"The abstract mentions free design parameters (regularization strength, confidence level, tube scaling/shape) but does not indicate how they are chosen or how they affect the non-asymptotic bounds; the full paper should clarify this dependence.","section":null},{"comment":"A numerical example is claimed to illustrate effectiveness and theoretical guarantees; the full manuscript should report the concrete system, sample sizes, realized failure probabilities, and comparison baselines so that the non-asymptotic claims can be assessed quantitatively.","section":null}],"recommendation":"uncertain","confidential_remarks":"This is an abstract-only review (arXiv:2607.12343). The abstract is coherent and free of obvious internal contradictions with known tube-MPC or non-asymptotic RLS results, but no theorems, proofs, or data are present. I therefore cannot recommend accept, minor_revision, major_revision, or reject; the only defensible recommendation is uncertain pending the full manuscript. If the full paper is later supplied, the two major comments above become the natural starting points for a detailed technical review."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The one thing to know: this is an abstract-only package that claims a clean technical combination—non-asymptotic regularized least-squares confidence sets embedded into homothetic-tube MPC so the whole thing stays convex (linear + SOC) and still delivers high-probability recursive feasibility, robust constraint satisfaction, ISS, and explicit finite-sample state bounds for discrete-time linear systems with unknown parameters and bounded disturbances. That is the punchline; everything else is uninspectable.\n\nWhat looks new and useful is the joint embedding itself. Homothetic tubes and non-asymptotic RLS sets each exist; putting the data-driven set into tube propagation and constraint tightening without losing convexity or the usual robust-MPC guarantees is a solid incremental step inside learning-based and robust MPC. The abstract is clear about the deliverables and does not invent entities. Circularity burden looks low on the stated logic: the set is built from data, then used for robust design, with high-probability statements about that set.\n\nSoft spots are almost entirely information-limit soft spots, not internal contradictions. The load-bearing premise—that the confidence set can be embedded without destroying recursive feasibility or the ISS/state bounds—is exactly what the proofs would have to show, and we cannot see them. Free parameters (regularization strength, failure probability, tube shape/scaling) are the usual ones; nothing smells like post-hoc fitting from the abstract alone. Stress-test found no new technical objection beyond that deficit, and I agree: nothing in the abstract is inconsistent with known tube-MPC or non-asymptotic RLS properties.\n\nWho it is for: people already working on learning-based robust/tube MPC who care about finite-sample guarantees and convexity. A serious referee should see the full proofs, the exact embedding, and the numerical example. I would send it to peer review rather than desk-reject; if the math checks out it is a useful reference in that subfield. I would not cite it yet and would only bring it to reading group once the full text is available.","headline":"Coherent abstract-only claim for convex learning-based homothetic tube MPC with non-asymptotic guarantees; nothing checkable yet, but worth a referee if the proofs land.","tokens_in":2716,"tokens_out":521,"would_cite":false,"duration_ms":4394,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"Learning-based homothetic-tube MPC with non-asymptotic guarantees for unknown linear systems","keywords":["learning-based MPC","homothetic tube MPC","non-asymptotic estimation","regularized least-squares","input-to-state stability","constraint tightening","parameter uncertainty","robust MPC"],"falsifier":"Simulate a discrete-time linear system with known but withheld parameters and bounded noise; if the online convex program becomes infeasible or the state trajectory exits the claimed high-probability bound with frequency exceeding the stated probability, the central guarantee fails.","tokens_in":2820,"feed_emoji":"📊","tokens_out":567,"duration_ms":4218,"temperature":0.7,"pith_summary":"This paper develops a learning-based model predictive controller for discrete-time linear systems whose parameters are unknown and that are subject to additive bounded disturbances. Instead of assuming a fixed uncertainty set up front, the method builds a high-probability confidence set for the unknown parameters from non-asymptotic regularized least-squares estimation. That confidence set is then embedded inside a homothetic-tube MPC formulation, producing a convex optimization problem with only linear and second-order-cone constraints. The authors prove that the resulting closed-loop system is recursively feasible and robustly constraint-satisfying with high probability, that it is input-to-state stable, and that explicit non-asymptotic bounds on the state can be written down. A numerical example is used to illustrate that the guarantees hold in practice. The contribution therefore turns a purely robust tube-MPC scheme into one that can learn its own uncertainty description while still delivering concrete probabilistic performance certificates.","feed_headline":"Learning-based tube MPC with non-asymptotic guarantees","feed_subtitle":"High-probability confidence sets turn robust tube MPC into a convex, learnable controller with explicit state bounds.","key_machinery":"The high-probability parameter confidence set generated by non-asymptotic regularized least-squares estimation, embedded into homothetic tube propagation and constraint tightening so that the online problem remains a convex program with linear and second-order-cone constraints.","core_discovery":"A homothetic-tube MPC controller whose uncertainty set is a high-probability confidence set obtained from non-asymptotic regularized least-squares yields a convex program that guarantees high-probability recursive feasibility, robust constraint satisfaction, input-to-state stability, and explicit non-asymptotic state bounds for discrete-time linear systems with unknown parameters and bounded disturbances.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Homothetic tube MPC learns via non-asymptotic least-squares sets","Convex tube MPC with high-probability non-asymptotic state bounds","Non-asymptotic confidence sets yield learnable robust tube MPC","High-probability LS sets make homothetic tube MPC recursively feasible","Learning-based tube MPC: convex program with ISS and explicit bounds"],"cache_read_input_tokens":128,"weakest_assumption_plain":"That the non-asymptotic regularized least-squares confidence set is a valid high-probability outer approximation of the true parameters and can be embedded into tube propagation without destroying recursive feasibility or the claimed stability and state bounds.","fun_headline_variants_meta":{"raw":{"variants":["Homothetic tube MPC learns via non-asymptotic least-squares sets","Convex tube MPC with high-probability non-asymptotic state bounds","Non-asymptotic confidence sets yield learnable robust tube MPC","High-probability LS sets make homothetic tube MPC recursively feasible","Learning-based tube MPC: convex program with ISS and explicit bounds"]},"model":"grok-4.5","effort":"low","cost_usd":0.003548,"raw_usage":{"total_tokens":1030,"prompt_tokens":658,"num_sources_used":0,"completion_tokens":75,"cost_in_usd_ticks":35480000,"prompt_tokens_details":{"text_tokens":658,"audio_tokens":0,"image_tokens":0,"cached_tokens":0},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":297,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":658,"tokens_out":75,"duration_ms":3167,"temperature":1.0,"reasoning_tokens":297,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-15T06:50:58.206034+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Simulate a discrete-time linear system with known but withheld parameters and bounded noise; if the online convex program becomes infeasible or the state trajectory exits the claimed high-probability bound with frequency exceeding the stated probability, the central guarantee fails.","supporting_citations":[],"review_version":1}