umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Simulated Data for Linear Regression with Structured and Sparse Penalties: Introducing pylearn-simulate
Brainomics Team, Neurospin, CEA Saclay, France.ORCID iD: 0000-0001-7119-7646
Brainomics Team, Neurospin, CEA Saclay, France.
Brainomics Team, Neurospin, CEA Saclay, France.
Brainomics Team, Neurospin, CEA Saclay, France.
Show others and affiliations
2018 (English)In: Journal of Statistical Software, ISSN 1548-7660, E-ISSN 1548-7660, Vol. 87, no 3Article in journal (Refereed) Published
Abstract [en]

A currently very active field of research is how to incorporate structure and prior knowledge in machine learning methods. It has lead to numerous developments in the field of non-smooth convex minimization. With recently developed methods it is possible to perform an analysis in which the computed model can be linked to a given structure of the data and simultaneously do variable selection to find a few important features in the data. However, there is still no way to unambiguously simulate data to test proposed algorithms, since the exact solutions to such problems are unknown.

The main aim of this paper is to present a theoretical framework for generating simulated data. These simulated data are appropriate when comparing optimization algorithms in the context of linear regression problems with sparse and structured penalties. Additionally, this approach allows the user to control the signal-to-noise ratio, the correlation structure of the data and the optimization problem to which they are the solution.

The traditional approach is to simulate random data without taking into account the actual model that will be fit to the data. But when using such an approach it is not possible to know the exact solution of the underlying optimization problem. With our contribution, it is possible to know the exact theoretical solution of a penalized linear regression problem, and it is thus possible to compare algorithms without the need to use, e.g., cross-validation.

We also present our implementation, the Python package pylearn-simulate, available at https://github.com/neurospin/pylearn-simulate and released under the BSD 3clause license. We describe the package and give examples at the end of the paper.

Place, publisher, year, edition, pages
Foundation for Open Access Statistics , 2018. Vol. 87, no 3
Keywords [en]
simulated data, sparse and structured penalties, linear regression, Python
National Category
Other Mathematics
Research subject
Mathematics; Mathematical Statistics
Identifiers
URN: urn:nbn:se:umu:diva-153002DOI: 10.18637/jss.v087.i03OAI: oai:DiVA.org:umu-153002DiVA, id: diva2:1260085
Available from: 2018-11-01 Created: 2018-11-01 Last updated: 2018-11-01

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full texthttps://www.jstatsoft.org/article/view/v087i03

Search in DiVA

By author/editor
Löfstedt, Tommy
In the same journal
Journal of Statistical Software
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 47 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf