cでxor

概要

cでxorやってみた。

サンプルコード

# include <stdio.h>
# include <math.h>

int x[3];
int t[3];
double g[3];
double z[3];
double h[3][3];
double w[3][3];
# define sigmoid(a)	  		(1.0 / (1.0 + exp(-(a))))
int main()
{
	srand((unsigned) time(NULL));
	double alpha = 0.06;
	for (int j = 0; j <= 2; j++)
	{
		for (int i = 0; i <= 2; i++)
		{
			w[j][i] = (double) ((rand() % 2000) - 1000) / 1000;
		}
	}
	for (int j = 0; j <= 2; j++)
	{
		for (int i = 0; i <= 2; i++)
		{
			h[j][i] = (double) ((rand() % 2000) - 1000) / 1000;
		}
	}
	for (int count = 0; count < 70001; count++)
	{
		x[0] = 1;
		x[1] = rand() % 2;
		x[2] = rand() % 2;
		t[0] = (x[1] ^ x[2]);
		for (int i = 0; i <= 2; i++)
		{
			double sum = 0;
			for (int j = 0; j <= 2; j++)
			{
				sum += w[j][i] * x[j];
			}
			g[i] = sigmoid(sum);
		}
		for (int i = 0; i < 1; i++)
		{
			double sum = 0;
			for (int j = 0; j <= 2; j++)
			{
				sum += h[j][i] * g[j];
			}
			z[i] = sigmoid(sum);
		}
		alpha = 0.06;
		for (int j = 0; j < 1; j++)
		{
			for (int i = 0; i <= 2; i++)
			{
				h[i][j] += alpha * g[i] * (t[j] - z[j]) * z[j] * (1.0 - z[j]);
			}
		}
		for (int k = 0; k < 1; k++)
		{
			for (int j = 0; j <= 2; j++)
			{
				double dj = (t[k] - z[k]) * z[k] * (1.0 - z[k]) * h[j][k] * g[j] * (1.0 - g[j]);
				for (int i = 0; i <= 2; i++)
				{
					w[i][j] += alpha * x[i] * dj;
				}
			}
		}
		double error = 0;
		for (int i = 0; i < 1; i++)
		{
			error += (t[i] - z[i]) * (t[i] - z[i]);
		}
		if ((count % 10000) != 0) continue;
		printf ("epoc : %6d loss : %.4f \n", count, error);
	}
	printf("0,0 = ");
	x[1] = 0;
	x[2] = 0;
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += w[j][i] * x[j];
		}
		g[i] = sigmoid(sum);
	}
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += h[j][i] * g[j];
		}
		z[i] = sigmoid(sum);
	}
	printf("%.2f\n", z[0]);
	printf("0,1 = ");
	x[1] = 0;
	x[2] = 1;
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += w[j][i] * x[j];
		}
		g[i] = sigmoid(sum);
	}
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += h[j][i] * g[j];
		}
		z[i] = sigmoid(sum);
	}
	printf("%.2f\n", z[0]);
	printf("1,0 = ");
	x[1] = 1;
	x[2] = 0;
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += w[j][i] * x[j];
		}
		g[i] = sigmoid(sum);
	}
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += h[j][i] * g[j];
		}
		z[i] = sigmoid(sum);
	}
	printf("%.2f\n", z[0]);
	printf("1,1 = ");
	x[1] = 1;
	x[2] = 1;
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += w[j][i] * x[j];
		}
		g[i] = sigmoid(sum);
	}
	for (int i = 0; i <= 2; i++)
	{
		double sum = 0;
		for (int j = 0; j <= 2; j++)
		{
			sum += h[j][i] * g[j];
		}
		z[i] = sigmoid(sum);
	}
	printf("%.2f\n", z[0]);
}

成果物

以上。