REVIEW 2 cited by
Adaptive sieving: A dimension reduction technique for sparse optimization problems
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
read the original abstract
In this paper, we propose an adaptive sieving (AS) strategy for solving general sparse machine learning models by effectively exploring the intrinsic sparsity of the solutions, wherein only a sequence of reduced problems with much smaller sizes need to be solved. We further apply the proposed AS strategy to generate solution paths for large-scale sparse optimization problems efficiently. We establish the theoretical guarantees for the proposed AS strategy including its finite termination property. Extensive numerical experiments are presented in this paper to demonstrate the effectiveness and flexibility of the AS strategy to solve large-scale machine learning models.
Forward citations
Cited by 2 Pith papers
-
Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing
An ALM with semismooth Newton-CG and an adaptive sieving strategy solves large-scale support matrix machines with per-iteration cost driven by active samples and solution rank.
-
Low Rank Convex Clustering For Matrix-Valued Observations
Matrix-valued data can be clustered by a convex objective that fuses centroids and penalizes their nuclear norms, with exact and asymptotic recovery guarantees and finite-sample error bounds.
Discussion (0). Continue with ORCID to comment.