Pith. sign in

REVIEW

A Scalable and Extensible Framework for Superposition-Structured Models

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 1509.02314 v2 pith:K5W5TYQH submitted 2015-09-08 cs.NA cs.NAmath.OCstat.ML

classification cs.NAmath.OCstat.ML
keywords modelsframeworksuperposition-structuredstructuralextensiblelassoproximalscalable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In many learning tasks, structural models usually lead to better interpretability and higher generalization performance. In recent years, however, the simple structural models such as lasso are frequently proved to be insufficient. Accordingly, there has been a lot of work on "superposition-structured" models where multiple structural constraints are imposed. To efficiently solve these "superposition-structured" statistical models, we develop a framework based on a proximal Newton-type method. Employing the smoothed conic dual approach with the LBFGS updating formula, we propose a scalable and extensible proximal quasi-Newton (SEP-QN) framework. Empirical analysis on various datasets shows that our framework is potentially powerful, and achieves super-linear convergence rate for optimizing some popular "superposition-structured" statistical models such as the fused sparse group lasso.

Discussion (0). Sign in to comment.

Pith tools