diff options
| author | Gertjan van den Burg <burg@ese.eur.nl> | 2017-01-25 14:00:42 +0100 |
|---|---|---|
| committer | Gertjan van den Burg <burg@ese.eur.nl> | 2017-01-25 14:00:42 +0100 |
| commit | 9a2b911add9fb4f247cc63b13478758e740d1a3a (patch) | |
| tree | cfe252c8f778b9be207229cb63026f5742e3eb6f /man/path.sparsestep.Rd | |
| parent | multiply normalize with sqrt(n) to remove dependence on n in normalization (diff) | |
| download | sparsestep-9a2b911add9fb4f247cc63b13478758e740d1a3a.tar.gz sparsestep-9a2b911add9fb4f247cc63b13478758e740d1a3a.zip | |
Add author and reference to each public method documentation
Diffstat (limited to 'man/path.sparsestep.Rd')
| -rw-r--r-- | man/path.sparsestep.Rd | 11 |
1 files changed, 11 insertions, 0 deletions
diff --git a/man/path.sparsestep.Rd b/man/path.sparsestep.Rd index 4d90956..935d17b 100644 --- a/man/path.sparsestep.Rd +++ b/man/path.sparsestep.Rd @@ -87,6 +87,17 @@ Note that this path algorithm is not faster than running the x <- matrix(rnorm(100*20), 100, 20) y <- rnorm(100) pth <- path.sparsestep(x, y) + +} +\author{ +Gerrit J.J. van den Burg, Patrick J.F. Groenen, Andreas Alfons\cr +Maintainer: Gerrit J.J. van den Burg <gertjanvandenburg@gmail.com> +} +\references{ +Van den Burg, G.J.J., Groenen, P.J.F. and Alfons, A. (2017). + \emph{SparseStep: Approximating the Counting Norm for Sparse Regularization}, + arXiv preprint arXiv:1701.06967 [stat.ME]. + URL \url{https://arxiv.org/abs/1701.06967}. } \seealso{ \code{\link{coef}}, \code{\link{print}}, \code{\link{predict}}, |