{"id":"759c1938-2be9-42db-8071-f4e819127e8b","arxiv_id":"2608.02576","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For any elementwise strictly convex ψ with ψ(0)=0, optimizing f over a product of simplices is equivalent in weak second-order KKT sense to optimizing f∘ψ over a product of spheres or similar manifolds.","lead":"The paper proves that replacing simplex constraints with a broad family of smooth, strictly convex elementwise maps preserves weak second-order optimality conditions, and uses this to run Riemannian gradient methods on tensor decomposition and curve registration problems. A generalist reader would care because it supplies theoretical backing for a popular practical trick — unconstrained manifold optimization for constrained probability and alignment problems.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"KKT mapping is sound, but the 'weak second-order' certificate is near-vacuous at vertices; Remark 4.1's universal claim is false when first-order KKT fails.","rationale":"The reader's CONDITIONAL verdict is appropriate. I independently re-derived the multiplier arguments in Theorems 4.2-4.4, including the product Hessian formula (10) and the 'special tangent vector' step in Theorem 4.3; the proofs are sound. The most important concern is not a gap in the mathematical derivation but the meaning of the delivered certificate: the weak second-order KKT condition is vacuous on vertices that satisfy first-order KKT, so a local maximum at a vertex can satisfy the paper's guarantee. The paper's own Remark 4.1 attempts to illustrate this weakness but states it incorrectly, claiming every vertex is weak second-order KKT regardless of objective. The counterexample f(v)=v1 shows this is false because first-order KKT can fail at a vertex. This is a minor internal inconsistency, not a flaw in the central theorems. It does not change the verdict, but the paper should be revised to state the correct version (every first-order-KKT vertex is weak second-order KKT) and to avoid implying that a weak second-order KKT point is a local-minimum certificate. The numerical concerns raised by the reader (no error bars, overstrong performance claims) also remain valid and support CONDITIONAL.","tokens_in":15707,"tokens_out":27315,"duration_ms":235906,"concrete_test":"Analytically solve the KKT system (4) for f(v)=v1 on Delta^2 at v=(1,0,0). Show that the stationarity equations force beta_2=beta_3=-1, contradicting beta>=0, so the vertex is not a weak second-order KKT point. Then repeat for f(v)=-(v1-1)^2 at the same vertex, where lambda=0, beta=0, first-order KKT holds, and the vertex is a local maximum yet satisfies the weak second-order condition (6) vacuously. This settles whether Remark 4.1's universal claim and the paper's practical optimality interpretation are accurate.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorems 4.2-4.4 are internally consistent: the Hessian decomposition (10), the construction of beta-hat in Theorem 4.3, and the tangent-space arguments in Theorem 4.4 all check out. The load-bearing weakness is interpretive but consequential. The weak second-order condition (6) forces Delta v_i = 0 for every active nonnegativity constraint regardless of the multiplier. At a vertex, this leaves only Delta v = 0, so the curvature test is automatically satisfied whenever first-order KKT holds. Thus a local maximum at a vertex, e.g. f(v)=-(v1-1)^2 on Delta^2 at (1,0,0), passes the advertised certificate. This is not a contradiction of the theorem, but it means the central claim 'second-order KKT points on the smooth manifold map to weak second-order KKT points' does not provide a meaningful local-minimality guarantee at boundary solutions. Moreover, Remark 4.1 overclaims that every vertex is a weak second-order KKT point 'regardless of the objective function'. This is false: for f(v)=v1 on Delta^2 at v=(1,0,0), the first-order KKT equations force lambda=-1 and beta=(0,-1,-1), violating beta>=0. The correct statement is that every vertex satisfying first-order KKT is trivially weak second-order KKT. This error does not invalidate the main theorems but should be corrected and the strength of the guarantee should be stated more carefully.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a general smooth reparameterization of optimization problems over product spaces of simplices, using elementwise maps ψ: R→R≥0 with ψ(0)=0 and ψ''>0, of which the Hadamard map is a special case. The central theoretical result is a KKT correspondence: weak second-order KKT points of the original simplex-constrained problem (P_simplex) map to second-order KKT points of the reparameterized manifold problem (P_×smooth) (Theorem 4.2), and conversely every second-order KKT point of the manifold problem maps to a weak second-order KKT point of the simplex problem (Theorems 4.3–4.4). The authors apply this framework to simplex-constrained canonical polyadic tensor decomposition and SRVF-based functional data registration, and present numerical experiments with Riemannian gradient descent (RGD) variants outperforming projected gradient descent (PGD) in both settings.","tokens_in":16030,"tokens_out":4474,"duration_ms":30869,"significance":"If the theoretical correspondence is correct, it extends the known Hadamard-parameterization results to a broader class of smooth reparameterizations and to product simplices with Euclidean components, which is a meaningful generalization for tensor factorization and functional data analysis. The proofs are self-contained, the distinction between weak and strong second-order conditions is clearly articulated, and the accompanying code is a useful asset. The numerical results are suggestive but not statistically validated, and the practical strength of the weak second-order certificate is limited, especially at boundary points. Nevertheless, the core KKT mapping appears sound and the paper makes a credible contribution to constrained optimization on simplex-structured feasible sets.","major_comments":[{"comment":"The statement that 'regardless of the objective function, every vertex of the simplex is a weak second-order KKT point' is false as written. A weak second-order KKT point must first satisfy the first-order KKT conditions (4). For f(v)=v1 on Δ^2 at v=(1,0,0), the condition (4a) with β⊙v=0 forces β2=-1, violating β≥0. Thus the vertex is not even first-order KKT. The correct statement is that every vertex that satisfies first-order KKT automatically satisfies the weak second-order condition because (6c) forces Δv=0. This should be corrected, and the dependence of the claim on first-order feasibility should be acknowledged.","section":"§4, Remark 4.1"},{"comment":"The advertised guarantee is nearly vacuous at boundary points. Condition (6c) forces Δv_i=0 for every coordinate where v_i=0, regardless of the multiplier β_i. At a vertex, this leaves Δv=0, so Δv^T ∇^2 L1 Δv = 0 is an identity. Consequently, the 'weak second-order KKT' certification provides no local-minimality information at vertices; it only says that no negative curvature is detected along the (empty) admissible tangent cone. The paper should either prove a nontrivial result involving the strong second-order condition on a subset of tangent directions, or explicitly discuss this limitation when interpreting Theorems 4.2–4.4. As it stands, the abstract's phrase 'second-order KKT points' may overstate the practical strength of the guarantee for boundary solutions.","section":"§4, Eq. (6) and Thms 4.2–4.4"}],"minor_comments":[{"comment":"The step 'Absorbing g_l in β_l' between Eqs. (21) and (22) is informal. The residual g_l should be defined precisely, e.g., β̂_l = β_l + g_l, and the sign conventions checked before proceeding to the complementarity argument. The proof is recoverable but requires more care.","section":"§4, Theorem 4.3"},{"comment":"There is a subscript typo: the expression '∆θ^T ∇^2_v L2 ∆θ' should be '∆θ^T ∇^2_θ L2 ∆θ', since the Hessian is taken with respect to θ, not v.","section":"§4, Theorem 4.4, Eq. (29)"},{"comment":"The numerical comparisons report objective values without error bars, standard deviations, or statistical tests. For the tensor experiments, the number of trials is not stated; the registration section mentions 50 trials, but the plots would benefit from showing variability across seeds. Adding such information would strengthen the empirical claims.","section":"§6, Figs. 2–3"},{"comment":"The relaxation from γ̇>0 to γ̇≥0 is essential for the problem to fit the product-simplex framework, but its effect on the registration solution is not discussed. The KKT theory applies to the relaxed problem, and the paper should clarify that the original diffeomorphism constraint is only approximately represented.","section":"§5.2, Eq. (50)"},{"comment":"The pseudocode and the algorithms work with the Hadamard parameterization specifically (line 'θ⊙θ'), whereas the theoretical development allows any ψ satisfying (1). If the numerical experiments use only ψ(θ)=θ², this should be stated explicitly; otherwise the algorithms should be written for general ψ.","section":"Algorithms 1–2"}],"recommendation":"major_revision","confidential_remarks":"The central KKT-correspondence theorems appear sound; the reviewer's primary concerns are the false universal claim in Remark 4.1 and the interpretive weakness of the weak second-order certificate at boundary points. These are fixable within the scope of the manuscript, but they require a substantive revision of the framing rather than a mere typo correction. The numerical section also needs statistical rigor. If the authors correct the remark, temper the claims about the strength of the second-order guarantee, and improve the experi- mental reporting, the paper could be acceptable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe short version: the paper does what it says — extends the Hadamard-parameterization KKT result of Li et al. to product simplices with Euclidean blocks and to any elementwise strictly convex ψ with ψ(0)=0 and ψ''>0. The main theorems (4.1–4.4) are sound as far as I can tell. I stress-tested the multiplier arguments, the tangent-space logic, and the Hessian decomposition (10), and found no fatal gap. The weak/strong KKT distinction and the Legendre-transform family are genuinely new, though the proof strategy closely follows Li et al. That is incremental but legitimate work.\n\nThe softer spots, in order of importance. First, the advertised 'weak second-order KKT' certificate is almost vacuous at vertices. At a vertex, the tangent constraints (6c) force Δv=0, so the curvature inequality holds automatically whenever first-order KKT holds. Thus a local maximum at a vertex passes the certificate. This is not a contradiction of the theorem, but it means the practical optimality guarantee is much weaker than a local-minimality certificate. Relatedly, Remark 4.1 overstates: it claims every vertex is weak second-order KKT regardless of objective. That is false because first-order KKT must hold; e.g., f(v)=v1 on Δ² at (1,0,0) violates β≥0. The correct statement is that any vertex that is first-order KKT is trivially weak second-order KKT. This should be fixed.\n\nSecond, the numerical comparisons are presented without error bars or statistical tests. The 'outperforms PGD' claim rests on a few hand-tuned step sizes and no variance; for a paper whose theory is the main contribution, this is not disqualifying but the empirical claims should be toned down. Third, the discretized SRVF registration relaxes γ̇>0 to γ̇≥0, so the warping functions can have flat spots; the authors acknowledge this but it means the product-simplex model is an approximation to the true diffeomorphic registration problem. Minor issues: Theorem 4.3's 'absorbing g_l in β_l' step is informal (though it can be made rigorous), and Eq. (29) has a subscript typo.\n\nWho should read this: people working on simplex-constrained optimization who want to know whether they can replace the simplex with a smooth manifold and keep KKT guarantees. For that audience, it is useful and deserves serious refereeing. My recommendation: send it to a good optimization journal, require a corrected Remark 4.1, a more careful statement of what the weak certificate does and does not imply, and better uncertainty treatment in the experiments. I'd take it in a reading group, and I'd cite it if I were writing about reparameterization tricks.","headline":"Solid incremental generalization of the Hadamard KKT result, with a real flaw in Remark 4.1 and a weak practical optimality certificate.","tokens_in":16507,"tokens_out":2650,"would_cite":true,"duration_ms":22867,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65K05","53B21","70G45"],"pacs":[],"model":"deepseek-v4-flash","headline":"Simplex-constrained optimization can be replaced by a smooth manifold problem using any elementwise strictly convex map ψ with ψ(0)=0 and ψ''>0, and this replacement preserves weak second-order KKT points.","keywords":["Riemannian Optimization","Tensor Decomposition","Functional Data Registration","Hadamard Parametrization","product simplex","weak second-order KKT","SRVF","reparameterization"],"falsifier":"On the 2-simplex in R^3 with a quadratic objective and ψ(θ)=θ², pick a boundary point with exactly one active zero coordinate. Verify whether every preimage θ* satisfies the manifold second-order condition 1^T(ψ'(θ*)⊙Δθ)=0 ⇒ Δθ^T∇²L2Δθ≥0, while the simplex weak-KKT quadratic form is nonnegative on its tangent set. A single point where the two signs disagree disproves the claimed equivalence.","tokens_in":15602,"feed_emoji":"🧮","tokens_out":11371,"duration_ms":95288,"temperature":0.7,"pith_summary":"Many practical optimization problems pin variables to products of probability simplices, such as low-rank discrete probability tensors and the warping functions used to align functional curves. The paper shows that these non-smooth constraints can be replaced by a smooth manifold using any elementwise map ψ(θ) with ψ(0)=0 and ψ''>0, and that this replacement preserves the correct optimality notion: weak second-order KKT points of the simplex problem correspond exactly to second-order KKT points of the manifold problem. The proof runs through a Hessian decomposition that separates a positive diagonal boundary term from the pulled-back Hessian of the objective. On the applied side, the paper introduces Riemannian gradient descent, including a spectral-step variant, and reports faster convergence than projected gradient descent on tensor factorization and smoother, more accurate warping functions in square-root-velocity functional data registration.","feed_headline":"Reparameterize simplices smoothly and optimality conditions survive","feed_subtitle":"A strictly convex map smooths simplex constraints while preserving weak second-order optimality.","key_machinery":"The engine is the reparameterization class Ψ = {ψ : R → R_{≥0} | ψ(0)=0, ψ''>0}, applied coordinatewise to each simplex block; the coordinatewise square map ψ(θ)=θ² is the special case, but the class also includes even polynomials with positive coefficients, cosh θ−1, and Legendre transforms of such maps. The key identity is a Hessian formula showing that the manifold Hessian splits into a diagonal term carrying ψ''(θ_l) times the KKT multiplier β_l, plus the objective Hessian pulled back through the Jacobian of φ. Because ψ''>0 and β_l≥0 at simplex KKT points, this diagonal term cannot make the quadratic form negative; the reverse direction uses tangent vectors supported on zero coordinates","core_discovery":"The central claim is an optimality correspondence between the constrained problem on a product simplex and the reparameterized problem on a smooth manifold. For every ψ in the allowed class, the image of every first-order KKT point of the simplex problem is a first-order KKT point of the manifold problem, and the image of every weak second-order KKT point is a second-order KKT point. Conversely, every second-order KKT point of the manifold problem maps to a weak second-order KKT point of the simplex problem. The paper stresses that only the weak form is preserved: the strong second-order condition can fail on the simplex even when the manifold point is second-order critical, and every vertex","pith_inferences":["A natural stress test is to pick ψ(θ)=θ⁴+θ² or ψ(θ)=cosh θ−1 in the same two applications and check whether the practical speed advantage persists; the theory guarantees the KKT correspondence, but not the conditioning advantage, so this separates the theorem from the algorithm.","Because the proof treats f as any twice-differentiable function, the result should transfer to other product-simplex problems such as hyperspectral unmixing or nonnegative matrix factorization; the same Riemannian recipe is a plausible drop-in replacement for projected methods there.","The discretized registration problem relaxes strict warp monotonicity ˙γ>0 to ˙γ≥0; a follow-up consistency check would be whether the recovered discrete warping functions, when interpolated, remain strictly increasing, or whether a strict-positivity regularizer is needed in practice."],"forward_implications":["Any Riemannian optimization algorithm that converges to a second-order KKT point on the smooth manifold returns a point that meets the weak second-order necessary conditions of the original product-simplex problem.","The KKT-preserving behavior is intrinsic to the whole class ψ(0)=0, ψ''>0, not a special feature of the coordinatewise square map, giving practitioners freedom to choose reparameterizations that improve conditioning.","The correspondence extends to feasible sets that are products of several simplices plus Euclidean blocks, covering simplex-constrained tensor factorization and SRVF-based functional data registration.","In the numerical experiments, Riemannian gradient descent with a spectral step reaches lower objective values in less time than projected gradient descent, and the resulting warping functions are smoother and closer to the true shapes.","The strong second-order KKT condition is not preserved, and every simplex vertex is a weak second-order KKT point, so manifold algorithms can terminate at a vertex without the weak condition certifying genuine local optimality."],"fun_headline_variants":["Smooth simplex reparameterization keeps weak KKT","Reparameterization preserves optimality on simplices","Riemannian gradient beats projected on simplex","Simplex problems solved via smooth maps","Weak second-order KKT survives reparameterization"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The equivalence leans on reparameterizations with ψ(0)=0 and ψ''>0, which force ψ and ψ' to vanish only at zero so that zero simplex coordinates correspond to zero manifold coordinates; the registration experiments additionally assume the discrete warping-rate problem faithfully represents the continuous problem after relaxing ˙γ>0 to ˙γ≥0.","fun_headline_variants_meta":{"raw":{"variants":["Smooth simplex reparameterization keeps weak KKT","Reparameterization preserves optimality on simplices","Riemannian gradient beats projected on simplex","Simplex problems solved via smooth maps","Weak second-order KKT survives reparameterization"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000209,"raw_usage":{"total_tokens":1214,"prompt_tokens":684,"completion_tokens":530,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":428,"completion_tokens_details":{"reasoning_tokens":460}},"tokens_in":428,"tokens_out":530,"duration_ms":5510,"temperature":1.0,"reasoning_tokens":460,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-04T04:25:56.432316+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"On the 2-simplex in R^3 with a quadratic objective and ψ(θ)=θ², pick a boundary point with exactly one active zero coordinate. Verify whether every preimage θ* satisfies the manifold second-order condition 1^T(ψ'(θ*)⊙Δθ)=0 ⇒ Δθ^T∇²L2Δθ≥0, while the simplex weak-KKT quadratic form is nonnegative on its tangent set. A single point where the two signs disagree disproves the claimed equivalence.","supporting_citations":[],"review_version":1}