blob: be0a6ed6e2ad4d937a906dc6505c946ff061796c (
plain)
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
|
package arr;
import java.util.Arrays;
import java.util.Random;
public class F {
public static Random rng = new Random();
public static void randomise(double probs[])
{
randomise(probs, true);
}
public static void randomise(double probs[], boolean normalise)
{
double z = 0;
for (int i = 0; i < probs.length; ++i)
{
probs[i] = 10 + rng.nextDouble();
if (normalise)
z += probs[i];
}
if (normalise)
for (int i = 0; i < probs.length; ++i)
probs[i] /= z;
}
public static void uniform(double probs[])
{
for (int i = 0; i < probs.length; ++i)
probs[i] = 1.0 / probs.length;
}
public static void l1normalize(double [] a){
double sum=0;
for(int i=0;i<a.length;i++){
sum+=a[i];
}
if(sum==0)
Arrays.fill(a, 1.0/a.length);
else
{
for(int i=0;i<a.length;i++){
a[i]/=sum;
}
}
}
public static void l1normalize(double [][] a){
double sum=0;
for(int i=0;i<a.length;i++){
for(int j=0;j<a[i].length;j++){
sum+=a[i][j];
}
}
if(sum==0){
return;
}
for(int i=0;i<a.length;i++){
for(int j=0;j<a[i].length;j++){
a[i][j]/=sum;
}
}
}
public static double l1norm(double a[]){
// FIXME: this isn't the l1 norm for a < 0
double norm=0;
for(int i=0;i<a.length;i++){
norm += a[i];
}
return norm;
}
public static double l2norm(double a[]){
double norm=0;
for(int i=0;i<a.length;i++){
norm += a[i]*a[i];
}
return Math.sqrt(norm);
}
public static int argmax(double probs[])
{
double m = Double.NEGATIVE_INFINITY;
int mi = -1;
for (int i = 0; i < probs.length; ++i)
{
if (probs[i] > m)
{
m = probs[i];
mi = i;
}
}
return mi;
}
}
|
