File: Softmax.cc

package info (click to toggle)
torch 2-1
  • links: PTS
  • area: main
  • in suites: woody
  • size: 5,488 kB
  • ctags: 3,217
  • sloc: cpp: 14,272; makefile: 201
file content (95 lines) | stat: -rw-r--r-- 2,330 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
// Copyright (C) 2002 Ronan Collobert (collober@iro.umontreal.ca)
//                
//
// This file is part of Torch. Release II.
// [The Ultimate Machine Learning Library]
//
// Torch is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Torch is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Torch; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#include "Softmax.h"

namespace Torch {

Softmax::Softmax(int n_units)
{
  n_inputs = n_units;
  n_outputs = n_units;
  addROption("shift", &shift, 0, "shift to avoid overflow", true);
  addBOption("compute shift", &calc_shift, false, "compute shift to avoid overflow", true);
}

int Softmax::numberOfParams()
{
  return(0);
}

void Softmax::forward(List *inputs)
{
  if(calc_shift)
  {
    List *inputs_ = inputs;
    shift = ((real *)inputs_->ptr)[0];
    while(inputs_)
    {
      real *x = (real *)inputs_->ptr;
      for(int j = 0; j < inputs_->n; j++, x++)
      {
        if(*x > shift)
          shift = *x;
      }
      inputs_ = inputs_->next;
    }
  }
  
  real *ptr_out = (real *)outputs->ptr;
  real sum = 0;
  while(inputs)
  {
    real *x = (real *)inputs->ptr;
    for(int j = 0; j < inputs->n; j++)
    {
      real z = exp(*x++ - shift);
      *ptr_out++ = z;
      sum += z;
    }
    inputs = inputs->next;
  }

  ptr_out = (real *)outputs->ptr;
  for(int i = 0; i < n_outputs; i++)
    *ptr_out++ /= sum;
}

void Softmax::backward(List *inputs, real *alpha)
{
  real *ptr_alpha = alpha;
  real *ptr_outputs = (real *)outputs->ptr;
  real sum = 0;
  for(int i = 0; i < n_outputs; i++)
    sum += *ptr_alpha++ * *ptr_outputs++;

  ptr_alpha = alpha;
  ptr_outputs = (real *)outputs->ptr;
  real *ptr_beta = beta;
  for(int i = 0; i < n_outputs; i++)
    *ptr_beta++ = *ptr_outputs++ * (*ptr_alpha++ - sum);
}

Softmax::~Softmax()
{
}

}