LoginSignup
0
1

More than 5 years have passed since last update.

@ohisama@github

cでnn その2

Last updated at Posted at 2018-08-18

概要

cでnnやってみた。
sin問題やってみた。

ライブラリー

結果

image.png

-3.00, 0.427, 0.429
-2.75, 0.317, 0.309
-2.50, 0.197, 0.201
-2.25, 0.103, 0.111
-2.00, 0.051, 0.045
-1.75, 0.030, 0.008
-1.50, 0.026, 0.001
-1.25, 0.035, 0.026
-1.00, 0.068, 0.079
-0.75, 0.143, 0.159
-0.50, 0.261, 0.260
-0.25, 0.390, 0.376
0.00, 0.504, 0.500
0.25, 0.613, 0.624
0.50, 0.735, 0.740
0.75, 0.852, 0.841
1.00, 0.930, 0.921
1.25, 0.965, 0.974
1.50, 0.975, 0.999
1.75, 0.972, 0.992
2.00, 0.953, 0.955
2.25, 0.905, 0.889
2.50, 0.811, 0.799
2.75, 0.685, 0.691
3.00, 0.564, 0.571

サンプルコード


#include <stdio.h>

#ifdef __cplusplus
extern "C" {
#endif
#ifndef GENANN_RANDOM
#define GENANN_RANDOM() (((double)rand())/RAND_MAX)
#endif
struct genann;
typedef double (*genann_actfun)(const struct genann *ann, double a);
typedef struct genann {
    int inputs, hidden_layers, hidden, outputs;
    genann_actfun activation_hidden;
    genann_actfun activation_output;
    int total_weights;
    int total_neurons;
    double * weight;
    double * output;
    double * delta;
} genann;
genann *genann_init(int inputs, int hidden_layers, int hidden, int outputs);
genann *genann_read(FILE *in);
void genann_randomize(genann *ann);
genann *genann_copy(genann const *ann);
void genann_free(genann *ann);
double const *genann_run(genann const *ann, double const *inputs);
void genann_train(genann const *ann, double const *inputs, double const *desired_outputs, double learning_rate);
void genann_write(genann const *ann, FILE *out);
void genann_init_sigmoid_lookup(const genann *ann);
double genann_act_sigmoid(const genann *ann, double a);
double genann_act_sigmoid_cached(const genann *ann, double a);
double genann_act_threshold(const genann *ann, double a);
double genann_act_linear(const genann *ann, double a);
#ifdef __cplusplus
}
#endif
#include <assert.h>
#include <errno.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifndef genann_act
#define genann_act_hidden genann_act_hidden_indirect
#define genann_act_output genann_act_output_indirect
#else
#define genann_act_hidden genann_act
#define genann_act_output genann_act
#endif
#define LOOKUP_SIZE 4096
double genann_act_hidden_indirect(const struct genann * ann, double a)
{
    return ann->activation_hidden(ann, a);
}
double genann_act_output_indirect(const struct genann * ann, double a)
{
    return ann->activation_output(ann, a);
}
const double sigmoid_dom_min = -15.0;
const double sigmoid_dom_max = 15.0;
double interval;
double lookup[LOOKUP_SIZE];
#ifdef __GNUC__
#define likely(x)       __builtin_expect(!!(x), 1)
#define unlikely(x)     __builtin_expect(!!(x), 0)
#define unused          __attribute__((unused))
#else
#define likely(x)       x
#define unlikely(x)     x
#define unused
#pragma warning(disable : 4996)
#endif
double inline genann_act_sigmoid(const genann * ann unused, double a)
{
    if (a < -45.0) return 0;
    if (a > 45.0) return 1;
    return 1.0 / (1 + exp(-a));
}
void genann_init_sigmoid_lookup(const genann * ann)
{
    const double f = (sigmoid_dom_max - sigmoid_dom_min) / LOOKUP_SIZE;
    int i;
    interval = LOOKUP_SIZE / (sigmoid_dom_max - sigmoid_dom_min);
    for (i = 0; i < LOOKUP_SIZE; ++i)
    {
        lookup[i] = genann_act_sigmoid(ann, sigmoid_dom_min + f * i);
    }
}
double inline genann_act_sigmoid_cached(const genann * ann unused, double a)
{
    assert(!isnan(a));
    if (a < sigmoid_dom_min) return lookup[0];
    if (a >= sigmoid_dom_max) return lookup[LOOKUP_SIZE - 1];
    size_t j = (size_t) ((a - sigmoid_dom_min) * interval + 0.5);
    if (unlikely(j >= LOOKUP_SIZE)) return lookup[LOOKUP_SIZE - 1];
    return lookup[j];
}
double inline genann_act_linear(const struct genann * ann unused, double a)
{
    return a;
}
double inline genann_act_threshold(const struct genann * ann unused, double a)
{
    return a > 0;
}
genann * genann_init(int inputs, int hidden_layers, int hidden, int outputs)
{
    if (hidden_layers < 0) return 0;
    if (inputs < 1) return 0;
    if (outputs < 1) return 0;
    if (hidden_layers > 0 && hidden < 1) return 0;
    const int hidden_weights = hidden_layers ? (inputs + 1) * hidden + (hidden_layers - 1) * (hidden + 1) * hidden : 0;
    const int output_weights = (hidden_layers ? (hidden + 1) : (inputs + 1)) * outputs;
    const int total_weights = (hidden_weights + output_weights);
    const int total_neurons = (inputs + hidden * hidden_layers + outputs);
    const int size = sizeof(genann) + sizeof(double) * (total_weights + total_neurons + (total_neurons - inputs));
    genann * ret = malloc(size);
    if (!ret) return 0;
    ret->inputs = inputs;
    ret->hidden_layers = hidden_layers;
    ret->hidden = hidden;
    ret->outputs = outputs;
    ret->total_weights = total_weights;
    ret->total_neurons = total_neurons;
    ret->weight = (double *) ((char *) ret + sizeof(genann));
    ret->output = ret->weight + ret->total_weights;
    ret->delta = ret->output + ret->total_neurons;
    genann_randomize(ret);
    ret->activation_hidden = genann_act_sigmoid_cached;
    ret->activation_output = genann_act_sigmoid_cached;
    genann_init_sigmoid_lookup(ret);
    return ret;
}
genann * genann_read(FILE * in)
{
    int inputs,
        hidden_layers,
        hidden,
        outputs;
    int rc;
    errno = 0;
    rc = fscanf(in, "%d %d %d %d", &inputs, &hidden_layers, &hidden, &outputs);
    if (rc < 4 || errno != 0)
    {
        perror("fscanf");
        return NULL;
    }
    genann * ann = genann_init(inputs, hidden_layers, hidden, outputs);
    int i;
    for (i = 0; i < ann->total_weights; ++i)
    {
        errno = 0;
        rc = fscanf(in, " %le", ann->weight + i);
        if (rc < 1 || errno != 0)
        {
            perror("fscanf");
            genann_free(ann);
            return NULL;
        }
    }
    return ann;
}
genann * genann_copy(genann const * ann)
{
    const int size = sizeof(genann) + sizeof(double) * (ann->total_weights + ann->total_neurons + (ann->total_neurons - ann->inputs));
    genann * ret = malloc(size);
    if (!ret) return 0;
    memcpy(ret, ann, size);
    ret->weight = (double *) ((char *) ret + sizeof(genann));
    ret->output = ret->weight + ret->total_weights;
    ret->delta = ret->output + ret->total_neurons;
    return ret;
}
void genann_randomize(genann * ann)
{
    int i;
    for (i = 0; i < ann->total_weights; ++i)
    {
        double r = GENANN_RANDOM();
        ann->weight[i] = r - 0.5;
    }
}
void genann_free(genann * ann)
{
    free(ann);
}
double const * genann_run(genann const * ann, double const * inputs)
{
    double const * w = ann->weight;
    double * o = ann->output + ann->inputs;
    double const * i = ann->output;
    memcpy(ann->output, inputs, sizeof(double) * ann->inputs);
    int h,
        j,
        k;
    if (!ann->hidden_layers)
    {
        double * ret = o;
        for (j = 0; j < ann->outputs; ++j)
        {
            double sum = * w++ * -1.0;
            for (k = 0; k < ann->inputs; ++k)
            {
                sum += * w++ * i[k];
            }
            * o++ = genann_act_output(ann, sum);
        }
        return ret;
    }
    for (j = 0; j < ann->hidden; ++j)
    {
        double sum = * w++ * -1.0;
        for (k = 0; k < ann->inputs; ++k)
        {
            sum += * w++ * i[k];
        }
        * o++ = genann_act_hidden(ann, sum);
    }
    i += ann->inputs;
    for (h = 1; h < ann->hidden_layers; ++h)
    {
        for (j = 0; j < ann->hidden; ++j)
        {
            double sum = * w++ * -1.0;
            for (k = 0; k < ann->hidden; ++k)
            {
                sum += * w++ * i[k];
            }
            * o++ = genann_act_hidden(ann, sum);
        }
        i += ann->hidden;
    }
    double const * ret = o;
    for (j = 0; j < ann->outputs; ++j)
    {
        double sum = * w++ * -1.0;
        for (k = 0; k < ann->hidden; ++k)
        {
            sum += * w++ * i[k];
        }
        * o++ = genann_act_output(ann, sum);
    }
    assert(w - ann->weight == ann->total_weights);
    assert(o - ann->output == ann->total_neurons);
    return ret;
}
void genann_train(genann const * ann, double const * inputs, double const * desired_outputs, double learning_rate)
{
    genann_run(ann, inputs);
    int h,
        j,
        k;
    {
        double const * o = ann->output + ann->inputs + ann->hidden * ann->hidden_layers;
        double * d = ann->delta + ann->hidden * ann->hidden_layers;
        double const * t = desired_outputs;
        if (genann_act_output == genann_act_linear || ann->activation_output == genann_act_linear)
        {
            for (j = 0; j < ann->outputs; ++j)
            {
                * d++ = * t++ - * o++;
            }
        }
        else
        {
            for (j = 0; j < ann->outputs; ++j)
            {
                * d++ = (* t - * o) * * o * (1.0 - * o);
                ++o;
                ++t;
            }
        }
    }
    for (h = ann->hidden_layers - 1; h >= 0; --h)
    {
        double const * o = ann->output + ann->inputs + (h * ann->hidden);
        double * d = ann->delta + (h * ann->hidden);
        double const * const dd = ann->delta + ((h + 1) * ann->hidden);
        double const * const ww = ann->weight + ((ann->inputs + 1) * ann->hidden) + ((ann->hidden + 1) * ann->hidden * (h));
        for (j = 0; j < ann->hidden; ++j)
        {
            double delta = 0;
            for (k = 0; k < (h == ann->hidden_layers - 1 ? ann->outputs : ann->hidden); ++k)
            {
                const double forward_delta = dd[k];
                const int windex = k * (ann->hidden + 1) + (j + 1);
                const double forward_weight = ww[windex];
                delta += forward_delta * forward_weight;
            }
            * d = * o * (1.0 - * o) * delta;
            ++d; 
            ++o;
        }
    }
    {
        double const * d = ann->delta + ann->hidden * ann->hidden_layers;
        double * w = ann->weight + (ann->hidden_layers ? ((ann->inputs + 1) * ann->hidden + (ann->hidden + 1) * ann->hidden * (ann->hidden_layers - 1)) : (0));
        double const * const i = ann->output + (ann->hidden_layers ? (ann->inputs + (ann->hidden) * (ann->hidden_layers - 1)) : 0);
        for (j = 0; j < ann->outputs; ++j)
        {
            * w++ += * d * learning_rate * - 1.0;
            for (k = 1; k < (ann->hidden_layers ? ann->hidden : ann->inputs) + 1; ++k)
            {
                * w++ += * d * learning_rate * i[k - 1];
            }
            ++d;
        }
        assert(w - ann->weight == ann->total_weights);
    }
    for (h = ann->hidden_layers - 1; h >= 0; --h)
    {
        double const * d = ann->delta + (h * ann->hidden);
        double const * i = ann->output + (h ? (ann->inputs + ann->hidden * (h - 1)) : 0);
        double * w = ann->weight + (h ? ((ann->inputs + 1) * ann->hidden + (ann->hidden + 1) * (ann->hidden) * (h - 1)) : 0);
        for (j = 0; j < ann->hidden; ++j)
        {
            * w++ += * d * learning_rate * -1.0;
            for (k = 1; k < (h == 0 ? ann->inputs : ann->hidden) + 1; ++k)
            {
                * w++ += * d * learning_rate * i[k - 1];
            }
            ++d;
        }
    }
}
void genann_write(genann const * ann, FILE * out)
{
    fprintf(out, "%d %d %d %d", ann->inputs, ann->hidden_layers, ann->hidden, ann->outputs);
    int i;
    for (i = 0; i < ann->total_weights; ++i)
    {
        fprintf(out, " %.20e", ann->weight[i]);
    }
}
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define PI 3.14159265358979323846
int main(int argc, char * argv[])
{
    int i, 
        j;
    double s[1], 
        t[1];
    genann * ann = genann_init(1, 1, 8, 1);
    for (i = 0; i < 2000; i++)
    {
        for (j = -12; j < 13; j++)
        {
            t[0] = (double) j / 4;
            s[0] = sin(t[0]) / 2.0 + 0.5;
            genann_train(ann, t, s, 3);
        }
    }
    for (j = -12; j < 13; j++)
    {
        t[0] = (double) j / 4;
        s[0] = sin(t[0]) / 2.0 + 0.5;
        //printf("Output for [%1.2f] is %1.3f (%1.3f)\n", t[0], * genann_run(ann, t), s[0]);
        printf("%1.2f, %1.3f, %1.3f\n", t[0], * genann_run(ann, t), s[0]);
    }
    genann_free(ann);
    return 0;
}

成果物

https://paiza.io/projects/lEWdKfzy62475Ntnvx1s9g
http://jsdo.it/ohisama1/KFdB

以上。

0
1
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
Sign upLogin
0
1