gradDescent
3.0Gradient Descent for Regression Tasks
Overview
An implementation of various learning algorithms based on Gradient Descent for dealing with regression tasks. The variants of gradient descent algorithm are : Mini-Batch Gradient Descent (MBGD), which is an optimization to use training data partially to reduce the computation load. Stochastic Gradient Descent (SGD), which is an optimization to use a random data in learning to reduce the computation load drastically. Stochastic Average Gradient (SAG), which is a SGD-based algorithm to minimize stochastic step to average. Momentum Gradient Descent (MGD), which is an optimization to speed-up gradient descent learning. Accelerated Gradient Descent (AGD), which is an optimization to accelerate gradient descent learning. Adagrad, which is a gradient-descent-based algorithm that accumulate previous cost to do adaptive learning. Adadelta, which is a gradient-descent-based algorithm that use hessian approximation to do adaptive learning. RMSprop, which is a gradient-descent-based algorithm that combine Adagrad and Adadelta adaptive learning ability. Adam, which is a gradient-descent-based algorithm that mean and variance moment to do adaptive learning. Stochastic Variance Reduce Gradient (SVRG), which is an optimization SGD-based algorithm to accelerates the process toward converging by reducing the gradient. Semi Stochastic Gradient Descent (SSGD),which is a SGD-based algorithm that combine GD and SGD to accelerates the process toward converging by choosing one of the gradients at a time. Stochastic Recursive Gradient Algorithm (SARAH), which is an optimization algorithm similarly SVRG to accelerates the process toward converging by accumulated stochastic information. Stochastic Recursive Gradient Algorithm+ (SARAHPlus), which is a SARAH practical variant algorithm to accelerates the process toward converging provides a possibility of earlier termination.
Install
Health
CRAN check results are not tracked yet.
Documentation
- Examples that run
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- References docs
- 63%
Downloads
Dependencies
Nothing depends on this yet.
Code & Tests
- Cyclomatic complexity
- 3.0 median / 18 max
Test coverage
Line coverage
–
Expression
–
Tests / Examples
–
Functions
29 22 exported
Complexity
3.5 avg / 18 max
Call network
29 nodes / 39 edges
Test coverage has not been measured for this package yet; nodes fall back to a neutral fill.
Call graph
Open call graph →Lowest coverage
Per-function coverage is not measured for this package yet.
People & History
3 releases. Pick two to compare their code metrics. R releases are shown for context.
- RR 4.3.0 released · 2023-04-21
- archivedRemoved from CRAN2022-04-27check issues were not corrected in time length > 1 in && or ||
- RR 4.2.0 released · 2022-04-22
- RR 4.1.0 released · 2021-05-18
- RR 4.0.0 released · 2020-04-24
- RR 3.6.0 released · 2019-04-26
- RR 3.5.0 released · 2018-04-23
- 3.02018-01-25 · diff ↗
- RR 3.4.0 released · 2017-04-21
- 2.0.12017-03-11 · diff ↗
- 2.02016-12-29
- RR 3.3.0 released · 2016-05-03
Package metadata
- Total releases
- 3
- License
- GPL (>= 2) | file LICENSE OSI
- Bundled data
- 24 KB / 1 file
- Download size
- not tracked yet
- Installed size
- not tracked yet
- With dependencies
- not tracked yet