Non-convex feature learning via l p, ∞ operator

Explore this paper's citation graph

Summary

A feature selection method is presented for solving sparse regularization problem, which has a composite regularization of lp norm and l∞ norm, and brings some insight for solving sparsity-favoring norm.

Type
article
Published
2014-07-27
Cited by
8
References
31

Keywords

Norm (philosophy), Proximal gradient methods for learning, Regularization (linguistics), Regular polygon, Feature selection

References

Cited by

Related papers