{"id":"56536565-f3a3-42bd-b251-965ce268c578","arxiv_id":"2606.29104","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":4.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"The spca R package provides a computational framework for least squares sparse PCA with efficient implementations and variable selection methods.","lead":"The paper presents an R package called spca that implements least squares sparse principal component analysis with C++ backends for tall and fat matrices and options for variable selection. A smart generalist might read it to access tools for creating interpretable sparse components from high-dimensional data while aiming to keep them uncorrelated and variance-maximizing.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Variable selection + stopping rules lack guarantee that sPCs remain uncorrelated and variance-maximizing on real data","rationale":"The reader's weakest_assumption directly identifies the same heuristic gap; the full manuscript does not appear to supply additional theoretical safeguards or exhaustive Monte-Carlo validation that would remove it. Consequently the UNVERDICTED status is left unchanged.","tokens_in":1820,"tokens_out":305,"duration_ms":9979,"concrete_test":"Re-run the package on the two real-data examples from the manuscript; extract the score matrix for the LS-SPCA solution, compute its Gram matrix, and test whether all off-diagonal entries are smaller than 1e-10; simultaneously compare total explained variance against the dense PCA truncation of equal cardinality. If either test fails on either dataset, the claim does not hold.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that the three variable-selection engines (simple forward, stepwise forward, backward elimination) stopped by cumulative-variance or R² thresholds produce loadings whose resulting scores are exactly uncorrelated, explain at least as much variance as the corresponding dense PCs, and retain high correlation with those PCs. These are combinatorial heuristics; nothing in the described framework supplies a proof that the selected support yields an orthogonal solution or a global variance optimum once the stopping criterion is met. Demonstrations on real data therefore rest on the unverified assumption that the heuristics will not violate the statistical properties the package advertises.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript introduces the R package 'spca' for least-squares sparse principal component analysis (LS-SPCA). It claims that LS-SPCA produces uncorrelated sparse principal components (sPCs) that maximize explained variance while retaining strong correlations with ordinary PCs; it also describes computationally cheaper variants that allow mild correlations and often achieve lower cardinality with equal or greater variance. The package supplies a C++ backend with separate engines for tall and fat matrices, three variable-selection engines (simple forward, stepwise forward, backward elimination), and two stopping rules (cumulative variance or R² threshold). The paper demonstrates typical workflows on real data, compares LS-SPCA solutions, and reports timing results on large matrices.","tokens_in":1954,"tokens_out":543,"duration_ms":18682,"significance":"If the implemented procedures reliably deliver the stated statistical properties, the package would supply a practical, computationally efficient tool for interpretable sparse PCA in high-dimensional settings. The C++ backend and dual tall/fat engines address a genuine performance gap, and the comparison utilities could facilitate adoption. The work is primarily a software contribution rather than a new methodological derivation.","major_comments":[{"comment":"Abstract and § on LS-SPCA framework: the central claim that the three variable-selection engines stopped by cumulative-variance or R² thresholds 'generate uncorrelated sparse principal components that effectively maximize the explained variance' is presented without any derivation, orthogonality proof, or guarantee that the selected support preserves exact uncorrelatedness or attains a global variance optimum. The skeptic note correctly identifies this as an unverified assumption; demonstrations on real data alone do not establish the property for arbitrary inputs.","section":"Abstract / LS-SPCA framework description"},{"comment":"Demonstration and performance sections: no tables or quantitative results are supplied that report the actual pairwise correlations among the computed sPCs, the difference in explained variance relative to dense PCs, or the cardinality-variance trade-off for the 'mildly correlated' variants on the real datasets used. Without these metrics the reader cannot verify that the advertised properties hold in practice.","section":"Demonstration / performance sections"}],"minor_comments":[{"comment":"The sentence 'Then it compares different LS-SPCA solutions obtained from the dataset' is grammatically incomplete; rephrase for clarity.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is a software description rather than a methodological advance; confirm whether the journal's scope for stat.CO includes package papers without accompanying theoretical results. The citation list should be checked for completeness regarding existing SPCA implementations."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive comments on our manuscript describing the spca R package. We address each major comment below.","responses":[{"response":"The manuscript is a software contribution describing an implementation of the LS-SPCA method. The core statistical properties (uncorrelated sPCs that maximize explained variance) follow from the least-squares formulation in the original LS-SPCA literature; the package simply provides efficient engines to compute them. We acknowledge that the current text does not re-derive these properties or prove that the heuristic variable-selection procedures (forward, stepwise, backward) with early stopping always preserve exact uncorrelatedness or attain a global optimum. We will revise the abstract and framework section to (i) add explicit citations to the methodological papers establishing the LS-SPCA guarantees, (ii) clarify that the three selection engines are heuristics that approximate the optimal support, and (iii) distinguish the exact LS-SPCA solutions from the computationally cheaper mildly-correlated variants. This addresses the concern without misrepresenting the software focus of the paper.","revision_made":"yes","referee_comment":"[Abstract / LS-SPCA framework description] Abstract and § on LS-SPCA framework: the central claim that the three variable-selection engines stopped by cumulative-variance or R² thresholds 'generate uncorrelated sparse principal components that effectively maximize the explained variance' is presented without any derivation, orthogonality proof, or guarantee that the selected support preserves exact uncorrelatedness or attains a global variance optimum. The skeptic note correctly identifies this as an unverified assumption; demonstrations on real data alone do not establish the property for arbitrary inputs."},{"response":"We agree that the absence of these quantitative metrics limits the reader's ability to verify the claimed properties on the example data. In the revised manuscript we will add tables (and accompanying text) in the demonstration section that report: (a) pairwise correlations among the computed sPCs for each variant, (b) the difference in explained variance relative to the corresponding dense PCs, and (c) the cardinality-variance trade-off curves for both the uncorrelated LS-SPCA solutions and the mildly correlated variants, using the same real datasets already presented.","revision_made":"yes","referee_comment":"[Demonstration / performance sections] Demonstration and performance sections: no tables or quantitative results are supplied that report the actual pairwise correlations among the computed sPCs, the difference in explained variance relative to dense PCs, or the cardinality-variance trade-off for the 'mildly correlated' variants on the real datasets used. Without these metrics the reader cannot verify that the advertised properties hold in practice."}],"tokens_in":1488,"tokens_out":517,"duration_ms":39367,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper's main contribution is an R package called spca that implements least-squares sparse PCA. It supplies C++ engines for tall and fat matrices, three variable-selection routines (simple forward, stepwise, backward), and stopping rules based on cumulative variance or R2 thresholds. It also adds comparison tools and ways to wrap other SPCA outputs as spca objects.\n\nWhat works is the practical focus. The package makes the uncorrelated version of LS-SPCA available in R with decent speed claims for large data, and the authors show workflow examples on real datasets plus timing results on tall and fat matrices. That is useful for users who already want the LS-SPCA formulation.\n\nThe soft spot is the reliance on heuristics. The selection procedures are combinatorial and stopped by simple thresholds; nothing in the description shows they reliably produce exactly uncorrelated scores or match the variance of the dense PCs once the stopping rule fires. The paper demonstrates on examples but supplies no error analysis, formal bounds, or systematic benchmarks that would confirm the properties hold beyond the cases shown. The faster mildly-correlated variants are presented as often better in practice, yet again rest on the same unproven selection steps.\n\nThis is for applied statisticians or data analysts working in R who need sparse components with the uncorrelated property and are willing to treat the output as a computational tool rather than a proven optimum. Readers hunting for new theory or first-principles derivations will find little.\n\nIt is worth sending to peer review for a software-oriented venue. The implementation choices and usability features are concrete enough that referees can check whether the code actually delivers what the abstract claims.","headline":"This is a software paper packaging an existing LS-SPCA method into an R package with C++ backends and selection heuristics, but the variable-selection steps lack any guarantee they preserve the advertised uncorrelated and variance-maximizing properties.","tokens_in":2460,"tokens_out":416,"would_cite":false,"duration_ms":16936,"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":"The spca R package implements LS-SPCA to produce uncorrelated sparse principal components that maximize explained variance.","keywords":["sparse principal component analysis","LS-SPCA","R package","variable selection","explained variance","uncorrelated components","matrix computations","forward selection"],"falsifier":"On a dataset where the sparse components produced by spca explain less total variance than the first k standard principal components or show correlations among themselves above the level allowed by the chosen variant, the performance claims would not hold.","tokens_in":2699,"feed_emoji":"","tokens_out":675,"duration_ms":28429,"temperature":0.7,"pith_summary":"This paper introduces the R package spca for least squares sparse principal component analysis. LS-SPCA creates sparse versions of principal components that stay uncorrelated with each other and explain as much variance as possible while staying close to the directions found by ordinary principal components. The package also supplies faster variants that permit mild correlations among the sparse components, which can use fewer variables yet still match or exceed the variance explained by the strictly uncorrelated versions. Variable selection can proceed by forward selection, stepwise selection, or backward elimination, with stopping rules tied to cumulative variance explained or correlation with the standard components. The code runs on an efficient C++ backend that handles both tall and wide data matrices, and the package supplies comparison, grouping, and plotting tools.","feed_headline":"spca R package produces uncorrelated sparse principal components","feed_subtitle":"LS-SPCA maximizes variance explained while keeping the components uncorrelated and close to ordinary principal components.","key_machinery":"The LS-SPCA framework that applies variable selection (simple forward, stepwise forward, or backward elimination) together with stopping rules based on cumulative variance explained or R-squared with the ordinary principal components.","core_discovery":"LS-SPCA generates uncorrelated sparse principal components (sPCs) that effectively maximize the explained variance while maintaining strong correlations with standard principal components (PCs). The framework also includes more computationally efficient variants that produce mildly correlated sPCs, which often have lower cardinality while explaining equal or greater variance than the LS-SPCA optimal sPCs.","pith_inferences":["The same selection logic could be applied to other orthogonal decomposition methods such as canonical correlation analysis to enforce sparsity.","In settings with many redundant predictors, the uncorrelated constraint may reduce instability when the sparse components are used as regressors in a second stage.","Simulation studies that plant known sparse structures and measure recovery rates would test whether the stopping rules consistently select the planted variables."],"forward_implications":["Analysts obtain sparse loadings that remain orthogonal and therefore preserve the additive variance decomposition of ordinary PCA.","Faster variants trade strict uncorrelatedness for lower cardinality while preserving or increasing explained variance.","Users can compare multiple spca solutions on the same data and convert foreign SPCA results into the package's object format.","The C++ engines allow direct application to large tall or fat matrices without custom coding."],"fun_headline_variants":["spca R package yields uncorrelated sparse principal components","LS-SPCA maximizes variance with uncorrelated sparse PCs in R","Uncorrelated sPCs from spca R package maximize explained variance","spca package offers mildly correlated sPC variants with lower cardinality"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Variable selection procedures paired with variance or R-squared stopping rules will produce sparse components whose claimed uncorrelatedness and variance properties hold on real data without further adjustment.","fun_headline_variants_meta":{"raw":{"variants":["spca R package yields uncorrelated sparse principal components","LS-SPCA maximizes variance with uncorrelated sparse PCs in R","Uncorrelated sPCs from spca R package maximize explained variance","spca package offers mildly correlated sPC variants with lower cardinality"]},"model":"grok-4.3","cost_usd":0.010866,"raw_usage":{"total_tokens":4806,"prompt_tokens":704,"num_sources_used":0,"completion_tokens":66,"cost_in_usd_ticks":108662000,"prompt_tokens_details":{"text_tokens":704,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":4036,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":704,"tokens_out":66,"duration_ms":34031,"temperature":1.0,"reasoning_tokens":4036,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-30T07:55:09.208791+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"On a dataset where the sparse components produced by spca explain less total variance than the first k standard principal components or show correlations among themselves above the level allowed by the chosen variant, the performance claims would not hold.","supporting_citations":[],"review_version":1}