model-based-rl/putils.cpp at master · suhasjs/model-based-rl · GitHub

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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
#include "putils.h"
#include <stdio.h>
// Complex outer product with multiple states. the output size is HxVx(S-1)
int* outer_product( int nhidden, int nvisible, int nstates, int* hidden, int* visible ){

    auto op = new int[ nhidden * nvisible ];

    for( int h = 0; h < nhidden; h++ ){

        for( int v = 0; v < nvisible; v++ ){

            for( int k = 1; k < nstates; k++ ){

                op[h * nvisible * ( nstates - 1 ) + v * ( nstates - 1 ) + k - 1 ] = ( visible[v] == k ) ? hidden[h] : 0;

            }

        }

    }

    return op;

}


int binary_softmax( double p0, double p1 ){

    double r = ( ( (double)rand() ) / RAND_MAX );
    double disc = exp( - p1 )/( exp(-p0) + exp(-p1) );

    return ( disc > r ) ? 1 : 0;

}

void softmax( double* arr, int size, double* output ){
    double denominator = 0;
    for( int i = 0; i < size; i++ ){
        denominator += ( exp( -arr[i] ) );
    }

    for( int k = 0; k < size; k++ ){
        output[k] = exp( -arr[k] )/denominator;
    }
}
void softmax_adjusted( double* arr, int size, double* output ){

    double denominator = 1;
    for( int i = 0; i < size-1; i++ ){
        denominator += ( exp( -arr[i] ) );
    }

    for( int k = 1; k < size + 1; k++ ){
        output[k] = exp( -arr[k-1] )/denominator;
    }
    output[0] = 1.0 / denominator;

}

int sample_softmax( double* arr, int size ){

    double sfmax[size];
    softmax( arr, size, sfmax );

    double cumsum[size+1];
    cumsum[0] = 0;
    for( int k = 1; k < size + 1; k++ ){
        cumsum[k] = cumsum[k-1] + sfmax[k-1];
    }

    double randVal = doubleRand();
    for( int k = 1 ; k < size + 1; k++ ){
        if( cumsum[k] > randVal )
            return k - 1;
    }
    return size - 1;

}
char* cols[6] = { "\x1B[31m", "\x1B[32m", "\x1B[37m", "\x1B[37m", "\x1B[35m", "\x1B[33m"};
void printVisibleState( int* field, int width, int height ){

    for( int i = 0; i < width; i++ ){
        printf("\n");
        for( int j = 0; j < height; j++ ){
            printf("%s%s ", cols[ field[ i * height + j ] ], "\u25A0" );
        }

    }
    printf("\n\x1B[0m");

}

void printVS( VisibleState* field, int width, int height ){

    for( int i = 0; i < width; i++ ){
        printf("\n");
        for( int j = 0; j < height; j++ ){
            if( field->mask[ i * height + j ] )
                printf("%s\u25A0", cols[ field->values[ i * height + j ] ] );
            else
                printf("%s\u25A0", cols[2] );
        }

    }
    printf("\n\x1B[0m");

}

void printVSI( VisibleState* field, VisibleState* imagined, int width, int height, int x, int y ){

    for( int i = 0; i < width; i++ ){
        printf("\n");
        for( int j = 0; j < height; j++ ){
            if( field->mask[ i * height + j ] )
                printf("%s\u25A0 ", ( (x != i || y != j) ? cols[ field->values[ i * height + j ] ] : cols[5] ) );//, (char)219 );
            else
                printf("%s\u25A0 ", cols[ imagined->values[i * height + j] + 3 ] );//, (char)219);
        }

    }
    printf("\n\x1B[0m");

}

void printVisibleCoeffs( double* coeffs, int width, int height, int hidden, int states ){

    for( int g = 0; g < hidden; g++ ){
    for( int k = 1; k < states; k++ ){
        printf("HIDDEN:%d \nSTATE: %d\n", g, k );
        for( int i = 0; i < width; i++ ){
            printf("\n");
            for( int j = 0; j < height; j++ ){
                printf("%.3lf\t", coeffs[ g * width * height * ( states - 1 ) + ( i * height + j ) * ( states - 1 ) + k - 1 ]);
            }

        }
    }
    }
    printf("\n");

}

int find_min ( double* arr, int len ){
    int min = +1000;
    int pos = 0;
    for( int i = 0; i < len; i++ ){

        if( arr[i] < min ) {
            min = arr[i];
            pos = i;
        }

    }
    return pos;
}

void printVisibleBias( double* coeffs, int width, int height, int states ){

    for( int k = 1; k < states; k++ ){
        printf("STATE: %d\n", k);
        for( int i = 0; i < width; i++ ){
            printf("\n");
            for( int j = 0; j < height; j++ ){
                printf("%.3lf\t", coeffs[ ( i * height + j ) * ( states - 1 ) + k - 1 ]);
            }

        }
    }

    printf("\n");

}
int sample_softmax_adjusted( double* arr, int size ){

    double sfmax[size];
    softmax_adjusted( arr, size, sfmax );

    double cumsum[size+1];
    cumsum[0] = 0;
    for( int k = 1; k < size + 1; k++ ){
        cumsum[k] = cumsum[k-1] + sfmax[k-1];
    }

    double randVal = doubleRand();
    for( int k = 1 ; k < size + 1; k++ ){
        if( cumsum[k] > randVal )
            return k - 1;
    }
    return size - 1;

}