Skip to main content
SpringerLink
Log in

A note on “Reguralizers for structured sparsity”

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

In this note, the notion of admissible sets contained in the strictly positive orthant introduced in Micchelli et al. (Adv. Comp. Math. 38(3), 455–489 2013) is analyzed. This notion was used to generalize theoretical results and optimization methods for structured sparsity. Unfortunately, we will prove that there is no generalization using admissible sets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Combettes, P.L.: Perspective functions: properties, constructions, and examples. Set-Valued Var. Anal (2017). https://doi.org/10.1007/s11228-017-0407-x

  2. Maurer, A., Pontil, M.: Structured sparsity and generalization. J. Mach. Learn. Res. 13, 671–690 (2012)

    MathSciNet  MATH  Google Scholar 

  3. McDonald, A., Pontil, M., Stamos, D.: New perspectives on k-support and cluster norms. J. Mach. Learn. Res. 17, 38 (2016)

    MathSciNet  MATH  Google Scholar 

  4. Micchelli, C.A., Morales, J.M., Pontil, M.: A family of penalty functions for structured sparsity. In: Lafferty, J., et al. (eds.) Advance in Neural Information Proceedings System, vol. 23, pp. 1612–1623 (2010)

  5. Micchelli, C.A., Morales, J.M., Pontil, M.: Reguralizers for structured sparsity. Adv. Comp. Math. 38(3), 455–489 (2013)

    Article  MATH  Google Scholar 

  6. Sankaran, R., Bach, F., Bhattacharya, C.: Identifying groups of strongly correlated variables through smoothed ordered weighted ℓ 1-norms. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, PMLR, vol. 54, pp. 1123–1131 (2017)

  7. Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc., B Stat. Methodol. 58(1), 267–288 (1996)

    MathSciNet  MATH  Google Scholar 

  8. van de Geer, S.: Structured sparsity. In: Estimation and Testing Under Sparsity. Lecture Notes in Mathematics, vol. 2159, pp. 75–101 (2016)

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Facultad de Ciencias, Universidad de Tarapacá, Arica, Chile

    F. Lara

Authors
  1. F. Lara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F. Lara.

Additional information

Communicated by: Tomas Sauer

This research was partially supported by Conicyt–Chile under project Fondecyt Postdoctorado 3160205.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lara, F. A note on “Reguralizers for structured sparsity”. Adv Comput Math 44, 1321–1323 (2018). https://doi.org/10.1007/s10444-017-9583-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10444-017-9583-3

Keywords

Mathematics Subject Classification (2010)

Search

Navigation