{"id":"31c13d21-4938-4d6e-865a-fee057cd3633","arxiv_id":"2412.13990","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The orthogonal Procrustes problem satisfies weak-quasi-strong-convexity, yielding linear convergence of Riemannian gradient descent for invertible matrices and O(1/t) function-value convergence for singular ones.","lead":"This paper proves that the classic problem of finding the best rotation to align two datasets, known as the orthogonal Procrustes problem, has a hidden convexity-like structure. Because of this structure, a simple iterative rotation search converges quickly, even though the problem is not convex on its surface.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified; the main caveat is the explicit initialization condition dist(X0,X*)<π, which is restrictive but correctly stated.","rationale":"The reader's weakest-assumption analysis identified exactly the load-bearing point: the initialization dist(X0,X*)<π is required to keep a(Xt) positive throughout the iteration and to ensure the algorithm stays in a region where the Riemannian logarithm is well-defined. My independent check of the proofs confirms this is the only substantive limitation, and it is explicitly stated in Theorems 10 and 11. The algebra in Proposition 3 is correct: the trace identity is valid, the blockwise positivity of α = r/sin r - r/(tan r cos r) + r sin r + c(cos r-1) reduces to sin r (r - sin r) ≥ 0 on (-π,π), and the PSD structure of A is used properly. Proposition 4's quadratic growth is correct because 1-cos r ≥ 2r^2/π^2 on (-π,π] and λmin(P^T U Σ U^T P) = σmin(C). The smoothness computation in Proposition 7 is consistent with the second derivative of f along a geodesic, and the bound |Tr(CXΩΩ^T)| ≤ σmax(C)||Ω||^2 is a valid application of Von Neumann's trace inequality. The contraction in Proposition 9 and the induction in Theorem 10 are algebraically sound; the step-size condition η ≤ a(Xt)/L is maintained because dist(Xt,X*) is nonincreasing. Theorem 11's function-value bound follows by a standard descent-plus-WQSC summation. Thus the central claim is well supported. The only points worth noting are non-mathematical: the abstract's 'full landscape analysis' is stronger than what is delivered, and the practical relevance is limited because the step size depends on the unknown distance to the optimum and the algorithm is not competitive with SVD-based methods. These do not affect correctness. I therefore agree with the reader's ACCEPT verdict and see no reason to adjust it.","tokens_in":13554,"tokens_out":21782,"duration_ms":193996,"concrete_test":"Test whether Theorem 10 can be relaxed from dist(X0,X*)<π to the weaker condition |r|max(X0,X*)<π while keeping a step size based on cos(|r|max(X0,X*)): re-derive the induction in Theorem 10 without the distance inequality, or run gradient descent on a 4x4 example with dist(X0,X*)≈1.2π but |r|max<π and check whether linear contraction still holds. If it fails, the restrictive initialization is essential; if it succeeds, the theorem statement is unnecessarily conservative.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I checked the proof chain for the central claim, Theorem 10, and found no internal inconsistency. The weak-quasi-strong-convexity inequality (Proposition 5) follows from Proposition 3 and Proposition 4; the key trace manipulations in Proposition 3 are valid, including the blockwise positivity argument; the quadratic growth constant 2σmin(C)/π^2 is correctly derived; the smoothness constant σmax(C) is correct; and the induction in Theorem 10 properly maintains |r|max(Xt,X*)<π because dist(Xt,X*)≤dist(X0,X*)<π. Proposition 9's contraction argument and Theorem 11's O(1/t) summation are algebraically sound. The one genuinely load-bearing assumption is dist(X0,X*)<π. This is stronger than mere injectivity of the exponential map at X0 toward X*, since |r|max<π alone would suffice for the local WQSC coefficient to be positive; the distance bound is used to propagate positivity of a(Xt) through the iteration. The assumption also excludes starting points in the other connected component of O(n), where no continuous curve can reach the chosen polar factor. This is a real limitation of scope, and the abstract's unqualified phrasing could mislead, but the theorem statement itself is explicit and the proof does not violate it. I do not find a mathematical flaw that would change the verdict.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper analyzes the orthogonal Procrustes problem, equivalent to computing the polar factor of a square matrix, as an optimization problem on the orthogonal group O(n). It establishes a weak-quasi-strong-convexity (WQSC) inequality by combining a geodesic weak-quasi-convexity bound (Prop. 3) with a quadratic growth bound (Prop. 4), and proves geodesic smoothness with constant sigma_max(C) (Prop. 7). These ingredients are used to analyze Riemannian gradient descent: for invertible C, Theorem 10 gives linear convergence of the squared distance to the unique polar factor under a fixed step size, provided the initialization satisfies dist(X0, X*) < pi; Theorem 11 gives an O(1/t) rate on function values for general nonzero C under the same initialization condition. The paper also discusses the geometry of O(n), including the injectivity domain of the exponential map and distance formulas.","tokens_in":13708,"tokens_out":32864,"duration_ms":256112,"significance":"The paper provides a clean structural explanation for the tractability of the Procrustes problem, in the same spirit as the authors' earlier work on the symmetric eigenvalue problem. The main inequalities are derived from scratch in a self-contained manner, with explicit constants, and the convergence results are stated with precise step-size and initialization conditions. A particular strength is that the proofs are largely algebraic and checkable, and the delicate trace identity in Proposition 3 is valid once the implicit replacement of P_X(X*) by X* is justified. The main limitation, the initialization condition dist(X0, X*) < pi, is restrictive but correctly stated in the theorems; the abstract, however, omits this qualification. Overall, this is a solid theoretical contribution, though the presented algorithm is not intended to compete with state-of-the-art SVD-based methods.","major_comments":[],"minor_comments":[{"comment":"The abstract claims linear and algebraic convergence for gradient descent without mentioning the initialization condition dist(X0, X*) < pi. Since this condition is load-bearing in both theorems, the abstract should be qualified accordingly to avoid overclaiming.","section":"Abstract and Theorems 10–11"},{"comment":"The proof of Theorem 11 states that 'we still satisfy all the hypotheses of Theorem 10', but Theorem 10 explicitly assumes sigma_min(C) > 0, which fails when C is singular. The required bound dist(Xt, X*) <= dist(X0, X*) follows instead by induction from Proposition 9, which does not use invertibility; the proof should be rephrased to invoke Proposition 9 directly.","section":"Theorem 11 proof"},{"comment":"The equality <PX(CT), PX(X*)P phi/sin(phi) P^T> = <Xskew(X^T C^T), X* P phi/sin(phi) P^T> is not immediate. It holds because the difference between PX(X*) and X* contributes a term X P cos(phi)(phi/sin(phi)) P^T, whose trace against the skew-symmetric matrix P^T skew(X^T C^T) P vanishes. Please add a sentence making this justification explicit.","section":"Proposition 3 proof"},{"comment":"There are several typographical issues: 'slew-symmetric' in Section 3; in the proof of Theorem 11, 'Lemma 9' should be 'Proposition 9', and the phrase '−ηtXt+1 is in the injectivity domain' should read '−ηt gradf(Xt) is in the injectivity domain'.","section":"Throughout"},{"comment":"In the proof of Proposition 4, the reduction from Tr((I−D^T)A) to Tr((I−cos phi)A) is correct, but the cancellation of the off-diagonal sin r terms relies on the trace structure of each 2x2 block; a brief explanatory sentence would improve readability.","section":"Proposition 4 proof"},{"comment":"The distance formula dist(X,Y) = ||phi||_2 uses a vector phi that lists each rotation angle r together with its negative for two-dimensional blocks but lists r=0 only once; a short note on this convention would help the reader.","section":"Equation (5)"}],"recommendation":"minor_revision","confidential_remarks":"The paper is a solid theoretical contribution in optimization on manifolds. The novelty relative to the authors' own previous work [4] is the new WQSC derivation for the Procrustes problem, and the convergence results are explicit. The minor issues identified are local and should be straightforward to address in revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThis paper shows that the orthogonal Procrustes problem has a weak-quasi-strong-convexity type structure on O(n), and uses it to prove linear convergence of Riemannian gradient descent when C is invertible and O(1/t) function-value convergence when singular. The new content is the WQSC inequality (Proposition 5) and the convergence rates (Theorems 10 and 11), derived specifically for Procrustes. I checked the delicate trace identity in Proposition 3: the skew-symmetric discrepancy vanishes, and the blockwise positivity argument works. The quadratic growth constant and smoothness constant are correct, and the induction in Theorem 10 properly maintains |r|max < π.\n\nThe soft spots are real but not fatal. The initialization bound dist(X0,X*) < π is load-bearing; it excludes the other connected component of O(n), so the convergence claim is genuinely local to the basin around the chosen polar factor. The abstract's \"full landscape analysis\" oversells — the paper does not classify critical points or saddles, it proves inequalities around a global minimizer. The algorithm is not competitive with SVD or Halley-type methods, and the authors admit as much; the value is conceptual. The WQSC framework comes from their prior paper, but the Procrustes-specific derivation is new, and the self-citation is appropriate.\n\nThis is a serious theory paper. The central arguments hold up under checking, and the result adds a meaningful data point to the optimization-on-manifolds literature. I would send it to peer review; it deserves referee time despite the slow algorithm, because the structural insight is the contribution.\n\nYour friend.","headline":"A solid theory paper: proves a convexity-like inequality for the Procrustes problem with linear convergence of Riemannian GD, caveated by a local initialization bound.","tokens_in":14335,"tokens_out":2184,"would_cite":true,"duration_ms":17739,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65K10","90C26","65F25"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper shows the orthogonal Procrustes problem—equivalently, computing the polar factor of a square matrix—satisfies a weak-quasi-strong-convexity inequality along geodesics, yielding linear convergence of Riemannian gradient descent…","keywords":["polar decomposition","orthogonal Procrustes problem","Riemannian gradient descent","weak-quasi-strong-convexity","geodesic convexity","matrix manifold optimization","linear convergence","quadratic growth"],"falsifier":"Run Riemannian gradient descent on f(X) = -Tr(C^T X) for C = diag(1, 2) on O(2), starting from X0 a rotation by angle $\\theta$ with dist(X0, I) < pi (e.g., $\\theta$ = 0.5), using step size eta exactly at the theorem's bound, and measure the squared-distance contraction over many iterations; if the observed contraction factor ever exceeds the predicted (1 - (1/$pi^{2}$)(1+cos(dist0))*sigma_min(C)*eta), the central rate claim is refuted.","tokens_in":13252,"feed_emoji":"🧮","tokens_out":9174,"duration_ms":79338,"temperature":0.7,"pith_summary":"The paper proves that the non-convex problem of finding the polar factor of a square matrix, formulated as minimizing f(X) = -Tr(C^T X) over the orthogonal group, is geodesically weak-quasi-strongly convex near the optimum. This convexity-like structure supplies explicit constants, a(X) = (1 + cos(|r|max))/4 and mu = 4*sigma_min(C)/$pi^{2}$, and explains why the problem is tractable by first-order optimization. From it, the authors derive that Riemannian gradient descent with a fixed step size converges linearly when C is invertible, at a rate depending only on the singular values of C and the initialization distance, and with an O(1/t) rate when C is singular.","feed_headline":"Convexity-like structure powers polar factor computation","feed_subtitle":"Riemannian gradient descent converges linearly for invertible matrices, O(1/t) for singular ones.","key_machinery":"The load-bearing object is the weak-quasi-strong-convexity (WQSC) inequality on the orthogonal group, assembled from Proposition 3 (geodesic weak-quasi-convexity) and Proposition 4 (quadratic growth). The proof machinery is the canonical form of the relative rotation X^T X* = P D P^T, which diagonalizes the Riemannian logarithm as P skew(D) (phi/sin phi) P^T and reduces the key trace inequality to verifying that the diagonal matrix phi/sin phi - D^T (phi/sin phi) D + c(D^T - I) is positive semidefinite block-wise, with c = 1 + cos(|r|max). This block structure is what turns a global non-convex landscape into a locally convex-on-geodesics one.","core_discovery":"The central discovery is that the orthogonally constrained objective f(X) = -Tr(C^T X) obeys a weak-quasi-strong-convexity (WQSC) inequality: for every X with |r|max < pi, f(X) - f* <= (1/a(X))<grad f(X), -log_X(X*)> - (mu/2) $dist^{2}$(X, X*), where a(X) = (1+cos|r|max)/4 and mu = 4*sigma_min(C)/$pi^{2}$. This inequality combines a geodesic weak-quasi-convexity lower bound on the inner product between the gradient and the logarithm map with a quadratic-growth lower bound on the objective gap. The paper derives both from the canonical form of the orthogonal matrix X^T X*, reducing the argument to trace inequalities on 2x2 rotation blocks. With this structure in hand, the authors prove an explicit linear convergence theorem for Riemannian gradient descent: starting at any X0 with dist(X0, X*) < pi and using step size eta <= (1+cos(dist(X0,X*)))/(4*sigma_max(C)), the squared distance to the polar factor contracts by the factor (1 - (1/$pi^{2}$)(1+cos(dist(X0,X*)))*sigma_min(C)*eta) at each iteration when C is invertible.","pith_inferences":["A direct implication is that any first-order method respecting the same step-size and initialization restrictions—not just gradient descent—should inherit the same linear or algebraic rates, since WQSC plus smoothness is the whole mechanism.","The authors suggest robust polar decomposition as a min-max problem that classical linear algebra cannot handle; the WQSC structure may provide the missing curvature control for gradient-descent-ascent algorithms on that nonconvex-nonconcave landscape.","The square-matrix restriction is a clear next test: if a similar WQSC inequality holds on Stiefel manifolds for the rectangular Procrustes problem, the same convergence theory would carry over, though the paper predicts the geometry makes this harder.","One can test the sharpness of the constants by running the algorithm with eta exactly at the bound on a sequence of matrices with growing condition number; the observed contraction should approach the formula's prediction if the constants are tight."],"forward_implications":["For invertible C and an initialization closer than pi to the polar factor, fixed-step Riemannian gradient descent on O(n) contracts the squared distance to the optimum at a linear rate with an explicitly computable contraction factor.","For singular C the same algorithm retains an O(1/t) bound on the objective gap, so the approach covers the full range of square matrices.","The convexity-like constants are expressed directly in the singular values of C, making the convergence theory applicable as an a priori complexity certificate for first-order methods on the polar factor problem.","The analysis extends the WQSC framework previously used for the symmetric eigenvalue problem to a second fundamental matrix factorization, suggesting a common structural explanation for the tractability of these problems."],"supporting_citations":[{"why":"Establishes the WQSC framework for the symmetric eigenvalue problem, which this paper extends to the polar factor problem.","marker":"[4]"},{"why":"Supplies the mathematical foundation for polar decomposition and its equivalence to the orthogonal Procrustes problem.","marker":"[14]"},{"why":"Provides the closed-form solution to the orthogonal Procrustes problem, namely X* = V U^T, used throughout the analysis.","marker":"[22]"},{"why":"Gives the differential-geometric background on the orthogonal group, including the exponential map, Riemannian logarithm, and distance formula.","marker":"[21]"},{"why":"Provides the Riemannian Taylor expansion and smoothness machinery used in the convergence proofs.","marker":"[1]"}],"fun_headline_variants":["Polar factor via geodesic quasi-convexity","Convexity hidden in polar decomposition","Linear convergence for polar factor descent","Gradient descent solves polar factor fast"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The initialization must lie within a geodesic distance strictly less than pi of the optimal polar factor; if the starting orthogonal matrix is further away, or in the other connected component of O(n), the key positive parameter a(X) can degenerate and the convergence proof no longer applies.","fun_headline_variants_meta":{"raw":{"variants":["Polar factor via geodesic quasi-convexity","Convexity hidden in polar decomposition","Linear convergence for polar factor descent","Gradient descent solves polar factor fast"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000508,"raw_usage":{"total_tokens":2459,"prompt_tokens":913,"completion_tokens":1546,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":529,"completion_tokens_details":{"reasoning_tokens":1493}},"tokens_in":529,"tokens_out":1546,"duration_ms":11502,"temperature":1.0,"reasoning_tokens":1493,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T12:37:43.987304+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run Riemannian gradient descent on f(X) = -Tr(C^T X) for C = diag(1, 2) on O(2), starting from X0 a rotation by angle $\\theta$ with dist(X0, I) < pi (e.g., $\\theta$ = 0.5), using step size eta exactly at the theorem's bound, and measure the squared-distance contraction over many iterations; if the observed contraction factor ever exceeds the predicted (1 - (1/$pi^{2}$)(1+cos(dist0))*sigma_min(C)*eta), the central rate claim is refuted.","supporting_citations":[{"cited_title":"Geodesic convex ity of the sym- metric eigenvalue problem and convergence of steepest desc ent","cited_arxiv_id":null,"evidence_quote":"Establishes the WQSC framework for the symmetric eigenvalue problem, which this paper extends to the polar factor problem."},{"cited_title":"Functions of matrices: Theory and co mputation, 2008","cited_arxiv_id":null,"evidence_quote":"Supplies the mathematical foundation for polar decomposition and its equivalence to the orthogonal Procrustes problem."},{"cited_title":"A generalized solution of the ortho gonal procrustes problem","cited_arxiv_id":null,"evidence_quote":"Provides the closed-form solution to the orthogonal Procrustes problem, namely X* = V U^T, used throughout the analysis."},{"cited_title":"Introduction to Differential Geometry","cited_arxiv_id":null,"evidence_quote":"Gives the differential-geometric background on the orthogonal group, including the exponential map, Riemannian logarithm, and distance formula."},{"cited_title":"Optimization algo- rithms on matrix manifolds","cited_arxiv_id":null,"evidence_quote":"Provides the Riemannian Taylor expansion and smoothness machinery used in the convergence proofs."}],"review_version":1}