Feat C++ API
A feature engineering automation tool
n_add.cc
Go to the documentation of this file.
1 /* FEAT
2 copyright 2017 William La Cava
3 license: GNU/GPL v3
4 */
5 
6 #include "n_add.h"
7 
8 namespace FT{
9 
10  namespace Pop{
11  namespace Op{
12  NodeAdd::NodeAdd(vector<float> W0)
13  {
14  name = "+";
15  otype = 'f';
16  arity['f'] = 2;
17  complexity = 1;
18 
19  if (W0.empty())
20  {
21  for (int i = 0; i < arity['f']; i++) {
22  W.push_back(r.rnd_dbl());
23  }
24  }
25  else
26  W = W0;
27  }
28 
29  #ifndef USE_CUDA
31  void NodeAdd::evaluate(const Data& data, State& state)
32  {
33  ArrayXf x1 = state.pop<float>();
34  ArrayXf x2 = state.pop<float>();
35  state.push<float>(limited(this->W[0]*x1+this->W[1]*x2));
36  /* state.push<float>(limited(this->W[0]*state.pop<float>()+this->W[1]*state.pop<float>())); */
37  }
38  #else
39  void NodeAdd::evaluate(const Data& data, State& state)
40  {
41  GPU_Add(state.dev_f, state.idx[otype], state.N, (float)W[0], (float)W[1]);
42  }
43  #endif
44 
46  void NodeAdd::eval_eqn(State& state)
47  {
48  state.push<float>("(" + to_string(W[0], 4) + "*" + state.popStr<float>() + "+"
49  + to_string(W[1], 4) + "*" + state.popStr<float>() + ")");
50  }
51 
52  // NEED TO MAKE SURE CASE 0 IS TOP OF STACK, CASE 2 IS w[0]
53  ArrayXf NodeAdd::getDerivative(Trace& state, int loc)
54  {
55  ArrayXf x1 = state.get<float>()[state.size<float>()-1];
56  ArrayXf x2 = state.get<float>()[state.size<float>()-2];
57 
58  switch (loc) {
59  case 3: // d/dW[1]
60  return x2;
61  case 2: // d/dW[0]
62  return x1;
63  case 1: // d/dx2
64  return this->W[1] * ArrayXf::Ones(x2.size());
65  case 0: // d/dx1
66  default:
67  return this->W[0] * ArrayXf::Ones(x1.size());
68  }
69  }
70 
71  NodeAdd* NodeAdd::clone_impl() const { return new NodeAdd(*this); }
72 
73  NodeAdd* NodeAdd::rnd_clone_impl() const { return new NodeAdd(); }
74  }
75  }
76 }
data holding X, y, and Z data
Definition: data.h:42
NodeAdd * rnd_clone_impl() const override
Definition: n_add.cc:73
NodeAdd(vector< float > W0=vector< float >())
Definition: n_add.cc:12
void evaluate(const Data &data, State &state)
Evaluates the node and updates the state states.
Definition: n_add.cc:31
void eval_eqn(State &state)
Evaluates the node symbolically.
Definition: n_add.cc:46
ArrayXf getDerivative(Trace &state, int loc)
Definition: n_add.cc:53
NodeAdd * clone_impl() const override
Definition: n_add.cc:71
std::vector< float > W
Definition: n_Dx.h:16
string name
node type
Definition: node.h:56
std::map< char, unsigned int > arity
arity of the operator
Definition: node.h:59
ArrayXf limited(ArrayXf x)
limits node output to be between MIN_FLT and MAX_FLT
Definition: node.cc:37
char otype
output type
Definition: node.h:58
int complexity
complexity of node
Definition: node.h:60
float rnd_dbl(float min=0.0, float max=1.0)
Definition: rnd.cc:89
void GPU_Add(float *x, size_t idx, size_t N, float W0, float W1)
static Rnd & r
Definition: rnd.h:135
std::string to_string(const T &value)
template function to convert objects to string for logging
Definition: utils.h:422
main Feat namespace
Definition: data.cc:13
int i
Definition: params.cc:552
contains various types of State actually used by feat
Definition: state.h:102
string popStr()
Definition: state.h:143
Eigen::Array< T, Eigen::Dynamic, 1 > pop()
Definition: state.h:128
void push(Eigen::Array< T, Eigen::Dynamic, 1 > value)
Definition: state.h:123
used for tracing stack outputs for backprop algorithm.
Definition: state.h:232
unsigned int size()
Definition: state.h:242
vector< Eigen::Array< T, Eigen::Dynamic, 1 > > & get()
Definition: state.h:237