Pith. sign in

REVIEW 2 cited by

Sparse CCA via Precision Adjusted Iterative Thresholding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1311.6186 v1 pith:2WRJS5LF submitted 2013-11-24 math.ST stat.MEstat.MLstat.TH

classification math.STstat.MEstat.MLstat.TH
keywords sparsecancerprocedureanalysisappliedbeenbreastcanonical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sparse Canonical Correlation Analysis (CCA) has received considerable attention in high-dimensional data analysis to study the relationship between two sets of random variables. However, there has been remarkably little theoretical statistical foundation on sparse CCA in high-dimensional settings despite active methodological and applied research activities. In this paper, we introduce an elementary sufficient and necessary characterization such that the solution of CCA is indeed sparse, propose a computationally efficient procedure, called CAPIT, to estimate the canonical directions, and show that the procedure is rate-optimal under various assumptions on nuisance parameters. The procedure is applied to a breast cancer dataset from The Cancer Genome Atlas project. We identify methylation probes that are associated with genes, which have been previously characterized as prognosis signatures of the metastasis of breast cancer.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Canonical Correlation Analysis with Sparsity

    stat.ME 2025-07 conditional novelty 6.0 of 10

    ECCAR reformulates sparse CCA as a Lasso-style regression on the identity matrix, yielding fast computation with proved error bounds and one-sided support recovery.

  2. Stochastic optimization over expectation-formulated generalized Stiefel manifold

    math.OC 2024-12 conditional novelty 6.0 of 10

    A new sixth-order penalty function makes stochastic optimization over expectation-formulated generalized Stiefel manifolds equivalent to unconstrained optimization, enabling stochastic gradient methods with O(epsilon^...

Pith tools