#include <dicts.h>

Detailed Description

template<typename T>
class spams::Trainer< T >

Definition at line 128 of file dicts.h.

Public Member Functions
void	getA (Matrix< T > &A) const

void	getB (Matrix< T > &B) const

void	getD (Matrix< T > &D) const

int	getIter () const

void	train (const Data< T > &X, const ParamDictLearn< T > &param)

void	train (const Data< T > &X, const vector_groups &groups, const int J, const constraint_type mode, const bool whiten=false, const T *param_C=NULL, const int p=1, const bool pattern=false)

	Trainer ()

	Trainer (const int k, const int batchsize=256, const int NUM_THREADS=-1)

	Trainer (const Matrix< T > &D, const int batchsize=256, const int NUM_THREADS=-1)

	Trainer (const Matrix< T > &A, const Matrix< T > &B, const Matrix< T > &D, const int itercount, const int batchsize, const int NUM_THREADS)

void	trainOffline (const Data< T > &X, const ParamDictLearn< T > &param)

Private Member Functions
void	cleanDict (const Data< T > &X, Matrix< T > &G, const bool posD=false, const constraint_type_D modeD=L2, const T gamma1=0, const T gamma2=0, const T maxCorrel=0.999999)

void	cleanDict (Matrix< T > &G)

Trainer< T > &	operator= (const Trainer< T > &trainer)

	Trainer (const Trainer< T > &trainer)

Private Attributes
Matrix< T >	_A

Matrix< T >	_B

int	_batchsize

Matrix< T >	_D

bool	_initialDict

int	_itercount

int	_k

int	_NUM_THREADS

Constructor & Destructor Documentation

template<typename T >

spams::Trainer< T >::Trainer ( )

Empty constructor.

Definition at line 187 of file dicts.h.

References spams::Trainer< T >::_batchsize, spams::Trainer< T >::_NUM_THREADS, MAX_THREADS, and MIN.

template<typename T >

spams::Trainer< T >::Trainer	(	const int	k,
		const int	batchsize = `256`,
		const int	NUM_THREADS = `-1`
	)

Constructor with data.

Definition at line 197 of file dicts.h.

References spams::Trainer< T >::_NUM_THREADS, MAX_THREADS, and MIN.

template<typename T >

spams::Trainer< T >::Trainer	(	const Matrix< T > &	D,
		const int	batchsize = `256`,
		const int	NUM_THREADS = `-1`
	)

Constructor with initial dictionary.

Definition at line 210 of file dicts.h.

References spams::Trainer< T >::_A, spams::Trainer< T >::_B, spams::Trainer< T >::_D, spams::Trainer< T >::_NUM_THREADS, spams::Matrix< T >::m(), MAX_THREADS, MIN, and spams::Matrix< T >::n().

Here is the call graph for this function:

template<typename T >

spams::Trainer< T >::Trainer	(	const Matrix< T > &	A,
		const Matrix< T > &	B,
		const Matrix< T > &	D,
		const int	itercount,
		const int	batchsize,
		const int	NUM_THREADS
	)

Constructor with existing structure.

Definition at line 226 of file dicts.h.

References spams::Trainer< T >::_A, spams::Trainer< T >::_B, spams::Trainer< T >::_D, spams::Trainer< T >::_NUM_THREADS, MAX_THREADS, and MIN.

template<typename T>

spams::Trainer< T >::Trainer ( const Trainer< T > & trainer )

explicitprivate

Forbid lazy copies.

Member Function Documentation

template<typename T >

void spams::Trainer< T >::cleanDict	(	const Data< T > &	X,
		Matrix< T > &	G,
		const bool	posD = `false`,
		const constraint_type_D	modeD = `L2`,
		const T	gamma1 = `0`,
		const T	gamma2 = `0`,
		const T	maxCorrel = `0.999999`
	)

private

clean the dictionary

remove element j and replace it by a random element of X

Definition at line 243 of file dicts.h.

References spams::Trainer< T >::_D, spams::abs(), spams::Vector< T >::copy(), spams::Data< T >::getData(), spams::L1L2, spams::L2, spams::Data< T >::n(), spams::Vector< T >::normalize(), spams::Matrix< T >::rawX(), spams::Matrix< T >::refCol(), spams::Vector< T >::sparseProject(), and spams::Vector< T >::thrsPos().

Referenced by spams::Trainer< T >::train(), and spams::Trainer< T >::trainOffline().

Here is the call graph for this function:

Here is the caller graph for this function:

template<typename T >

void spams::Trainer< T >::cleanDict ( Matrix< T > & G )

private

clean the dictionary

Definition at line 284 of file dicts.h.

References spams::Trainer< T >::_D, and spams::Matrix< T >::rawX().

Here is the call graph for this function:

template<typename T>

void spams::Trainer< T >::getA ( Matrix< T > & A ) const

inline

Accessors.

Definition at line 154 of file dicts.h.

References spams::Matrix< T >::copy().

Here is the call graph for this function:

template<typename T>

void spams::Trainer< T >::getB ( Matrix< T > & B ) const

inline

Definition at line 155 of file dicts.h.

References spams::Matrix< T >::copy().

Here is the call graph for this function:

template<typename T>

void spams::Trainer< T >::getD ( Matrix< T > & D ) const

inline

Definition at line 156 of file dicts.h.

References spams::Matrix< T >::copy().

Here is the call graph for this function:

template<typename T>

int spams::Trainer< T >::getIter ( ) const

inline

Definition at line 157 of file dicts.h.

References spams::ParamDictLearn< T >::gamma1, spams::ParamDictLearn< T >::gamma2, spams::L2, spams::ParamDictLearn< T >::modeD, and spams::ParamDictLearn< T >::posD.

template<typename T>

Trainer<T>& spams::Trainer< T >::operator= ( const Trainer< T > & trainer )

private

Forbid lazy copies.

template<typename T >

void spams::Trainer< T >::train	(	const Data< T > &	X,
		const ParamDictLearn< T > &	param
	)

train or retrain using the matrix X

Dictionary Update Check the epoch parity

Definition at line 295 of file dicts.h.

Here is the call graph for this function:

template<typename T>

void spams::Trainer< T >::train	(	const Data< T > &	X,
		const vector_groups &	groups,
		const int	J,
		const constraint_type	mode,
		const bool	whiten = `false`,
		const T *	param_C = `NULL`,
		const int	p = `1`,
		const bool	pattern = `false`
	)