Inferring large graphs using \(\ell_1\)-penalized likelihood (Q1704026)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6848123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inferring large graphs using \(\ell_1\)-penalized likelihood |
scientific article; zbMATH DE number 6848123 |
Statements
Inferring large graphs using \(\ell_1\)-penalized likelihood (English)
0 references
8 March 2018
0 references
directed acyclic graphs
0 references
Lasso
0 references
convex program
0 references
optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8230295777320862
0 references
0.8195815682411194
0 references
0.8021132946014404
0 references
0.7859168648719788
0 references
0.778620719909668
0 references
