24 #ifndef MLPACK_METHODS_LARS_LARS_HPP 25 #define MLPACK_METHODS_LARS_LARS_HPP 30 namespace regression {
102 LARS(
const bool useCholesky =
false,
103 const double lambda1 = 0.0,
104 const double lambda2 = 0.0,
105 const double tolerance = 1e-16);
119 LARS(
const bool useCholesky,
120 const arma::mat& gramMatrix,
121 const double lambda1 = 0.0,
122 const double lambda2 = 0.0,
123 const double tolerance = 1e-16);
140 LARS(
const arma::mat& data,
141 const arma::rowvec& responses,
142 const bool transposeData =
true,
143 const bool useCholesky =
false,
144 const double lambda1 = 0.0,
145 const double lambda2 = 0.0,
146 const double tolerance = 1e-16);
164 LARS(
const arma::mat& data,
165 const arma::rowvec& responses,
166 const bool transposeData,
167 const bool useCholesky,
168 const arma::mat& gramMatrix,
169 const double lambda1 = 0.0,
170 const double lambda2 = 0.0,
171 const double tolerance = 1e-16);
188 double Train(
const arma::mat& data,
189 const arma::rowvec& responses,
191 const bool transposeData =
true);
207 double Train(
const arma::mat& data,
208 const arma::rowvec& responses,
209 const bool transposeData =
true);
220 void Predict(
const arma::mat& points,
221 arma::rowvec& predictions,
222 const bool rowMajor =
false)
const;
225 const std::vector<size_t>&
ActiveSet()
const {
return activeSet; }
229 const std::vector<arma::vec>&
BetaPath()
const {
return betaPath; }
232 const arma::vec&
Beta()
const {
return betaPath.back(); }
236 const std::vector<double>&
LambdaPath()
const {
return lambdaPath; }
244 template<
typename Archive>
245 void serialize(Archive& ar,
const unsigned int );
249 arma::mat matGramInternal;
252 const arma::mat* matGram;
255 arma::mat matUtriCholFactor;
274 std::vector<arma::vec> betaPath;
277 std::vector<double> lambdaPath;
280 std::vector<size_t> activeSet;
283 std::vector<bool> isActive;
288 std::vector<size_t> ignoreSet;
291 std::vector<bool> isIgnored;
298 void Deactivate(
const size_t activeVarInd);
305 void Activate(
const size_t varInd);
312 void Ignore(
const size_t varInd);
315 void ComputeYHatDirection(
const arma::mat& matX,
316 const arma::vec& betaDirection,
317 arma::vec& yHatDirection);
320 void InterpolateBeta();
322 void CholeskyInsert(
const arma::vec& newX,
const arma::mat& X);
324 void CholeskyInsert(
double sqNormNewX,
const arma::vec& newGramCol);
326 void GivensRotate(
const arma::vec::fixed<2>& x,
327 arma::vec::fixed<2>& rotatedX,
330 void CholeskyDelete(
const size_t colToKill);
337 #include "lars_impl.hpp" void serialize(Archive &ar, const unsigned int)
Serialize the LARS model.
void Predict(const arma::mat &points, arma::rowvec &predictions, const bool rowMajor=false) const
Predict y_i for each data point in the given data matrix using the currently-trained LARS model...
The core includes that mlpack expects; standard C++ includes and Armadillo.
const std::vector< arma::vec > & BetaPath() const
Access the set of coefficients after each iteration; the solution is the last element.
double Train(const arma::mat &data, const arma::rowvec &responses, arma::vec &beta, const bool transposeData=true)
Run LARS.
LARS(const bool useCholesky=false, const double lambda1=0.0, const double lambda2=0.0, const double tolerance=1e-16)
Set the parameters to LARS.
An implementation of LARS, a stage-wise homotopy-based algorithm for l1-regularized linear regression...
const arma::mat & MatUtriCholFactor() const
Access the upper triangular cholesky factor.
const std::vector< double > & LambdaPath() const
Access the set of values for lambda1 after each iteration; the solution is the last element...
const std::vector< size_t > & ActiveSet() const
Access the set of active dimensions.
const arma::vec & Beta() const
Access the solution coefficients.