pyerualjetwork 4.1.9b2__py3-none-any.whl → 4.2.0b1__py3-none-any.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- pyerualjetwork/__init__.py +1 -1
- pyerualjetwork/data_operations.py +1 -1
- pyerualjetwork/plan.py +3 -11
- pyerualjetwork/plan_cuda.py +2 -1
- pyerualjetwork/planeat.py +394 -344
- pyerualjetwork/planeat_cuda.py +418 -343
- {pyerualjetwork-4.1.9b2.dist-info → pyerualjetwork-4.2.0b1.dist-info}/METADATA +1 -1
- {pyerualjetwork-4.1.9b2.dist-info → pyerualjetwork-4.2.0b1.dist-info}/RECORD +10 -10
- {pyerualjetwork-4.1.9b2.dist-info → pyerualjetwork-4.2.0b1.dist-info}/WHEEL +0 -0
- {pyerualjetwork-4.1.9b2.dist-info → pyerualjetwork-4.2.0b1.dist-info}/top_level.txt +0 -0
pyerualjetwork/planeat.py
CHANGED
@@ -1,6 +1,8 @@
|
|
1
1
|
"""
|
2
2
|
MAIN MODULE FOR PLANEAT
|
3
3
|
|
4
|
+
Examples: https://github.com/HCB06/PyerualJetwork/tree/main/Welcome_to_PyerualJetwork/ExampleCodes
|
5
|
+
|
4
6
|
ANAPLAN document: https://github.com/HCB06/Anaplan/blob/main/Welcome_to_Anaplan/ANAPLAN_USER_MANUEL_AND_LEGAL_INFORMATION(EN).pdf
|
5
7
|
|
6
8
|
@author: Hasan Can Beydili
|
@@ -12,7 +14,7 @@ ANAPLAN document: https://github.com/HCB06/Anaplan/blob/main/Welcome_to_Anaplan/
|
|
12
14
|
|
13
15
|
import numpy as np
|
14
16
|
import random
|
15
|
-
|
17
|
+
import math
|
16
18
|
|
17
19
|
### LIBRARY IMPORTS ###
|
18
20
|
from .plan import feed_forward
|
@@ -69,155 +71,197 @@ def define_genomes(input_shape, output_shape, population_size, dtype=np.float32)
|
|
69
71
|
return np.array(population_weights, dtype=dtype), population_activations
|
70
72
|
|
71
73
|
|
72
|
-
def
|
74
|
+
def evolver(weights,
|
75
|
+
activation_potentiations,
|
76
|
+
what_gen,
|
77
|
+
fitness,
|
78
|
+
show_info=False,
|
79
|
+
policy='aggresive',
|
80
|
+
bad_genomes_selection_prob=None,
|
81
|
+
bar_status=True,
|
82
|
+
strategy='normal_selective',
|
83
|
+
target_fitness='max',
|
84
|
+
mutations=True,
|
85
|
+
bad_genomes_mutation_prob=None,
|
86
|
+
activation_mutate_prob=0.5,
|
87
|
+
save_best_genom=True,
|
88
|
+
fitness_bias=None,
|
89
|
+
cross_over_mode='tpm',
|
90
|
+
activation_mutate_add_prob=0.5,
|
91
|
+
activation_mutate_delete_prob=0.5,
|
92
|
+
activation_mutate_change_prob=0.5,
|
93
|
+
weight_mutate_prob=1,
|
94
|
+
weight_mutate_rate=32,
|
95
|
+
activation_selection_add_prob=0.6,
|
96
|
+
activation_selection_change_prob=0.4,
|
97
|
+
activation_selection_rate=2,
|
98
|
+
dtype=np.float32):
|
73
99
|
"""
|
74
|
-
Applies the evolving process of a population of genomes using selection, crossover, mutation, and activation function potentiation.
|
75
|
-
The function modifies the population's weights and activation functions based on a specified policy, mutation probabilities, and strategy.
|
100
|
+
Applies the evolving process of a population of genomes using selection, crossover, mutation, and activation function potentiation.
|
101
|
+
The function modifies the population's weights and activation functions based on a specified policy, mutation probabilities, and strategy.
|
76
102
|
|
77
|
-
|
78
|
-
|
79
|
-
(first returned value of define_genomes function)
|
80
|
-
|
81
|
-
activation_potentiations (list): A list of activation functions for each genome.
|
82
|
-
(second returned value of define_genomes function)
|
83
|
-
|
84
|
-
what_gen (int): The current generation number, used for informational purposes or logging.
|
85
|
-
|
86
|
-
fitness (numpy.ndarray): A 1D array containing the fitness values of each genome.
|
87
|
-
The array is used to rank the genomes based on their performance. PLANEAT maximizes or minimizes this fitness for looking 'target' hyperparameter.
|
88
|
-
|
89
|
-
show_info (bool, optional): If True, prints information about the current generation and the
|
90
|
-
maximum reward obtained. Also shows the current configuration. Default is False.
|
91
|
-
|
92
|
-
strategy (str, optional): The strategy for combining the best and bad genomes. Options:
|
93
|
-
- 'cross_over': Perform crossover between the best genomes and replace bad genomes.
|
94
|
-
(Classic NEAT crossover)
|
95
|
-
- 'potentiate': Cumulate the weight of the best genomes and replace bad genomes.
|
96
|
-
(PLAN feature, similar to arithmetic crossover but different.)
|
97
|
-
Default is 'cross_over'.
|
98
|
-
|
99
|
-
bar_status (bool, optional): Loading bar status during evolving process of genomes. True or False. Default: True
|
103
|
+
'selection' args effects cross-over.
|
104
|
+
'mutate' args effects mutation.
|
100
105
|
|
101
|
-
|
102
|
-
|
103
|
-
|
104
|
-
|
105
|
-
|
106
|
-
|
107
|
-
|
108
|
-
|
109
|
-
|
110
|
-
|
111
|
-
|
112
|
-
|
113
|
-
|
114
|
-
|
115
|
-
|
116
|
-
|
117
|
-
|
118
|
-
|
119
|
-
|
120
|
-
|
121
|
-
|
122
|
-
|
123
|
-
cross_over_mode (str, optional): Specifies the crossover method to use. Options:
|
124
|
-
- 'tpm': Two-Point Matrix Crossover
|
125
|
-
- 'plantic': plantic Crossover
|
126
|
-
Default is 'tpm'.
|
127
|
-
|
128
|
-
activation_add_prob (float, optional): The probability of adding a new activation function to the genome for mutation.
|
129
|
-
Must be in the range [0, 1]. Default is 0.5.
|
130
|
-
|
131
|
-
activation_delete_prob (float, optional): The probability of deleting an existing activation function
|
132
|
-
from the genome for mutation. Must be in the range [0, 1]. Default is 0.5.
|
133
|
-
|
134
|
-
activation_change_prob (float, optional): The probability of changing an activation function in the genome for mutation.
|
135
|
-
Must be in the range [0, 1]. Default is 0.5.
|
136
|
-
|
137
|
-
weight_mutate_prob (float, optional): The probability of mutating a weight in the genome.
|
138
|
-
Must be in the range [0, 1]. Default is 1.
|
139
|
-
|
140
|
-
weight_mutate_rate (int, optional): If the value you enter here is equal to the result of input layer * output layer,
|
141
|
-
only a single weight will be mutated during each mutation process. If the value you enter here is half
|
142
|
-
of the result of input layer * output layer, two weights in the weight matrix will be mutated.
|
143
|
-
WARNING: if you don't understand do NOT change this value. Default is 32.
|
106
|
+
Args:
|
107
|
+
weights (numpy.ndarray): Array of weights for each genome.
|
108
|
+
(first returned value of define_genomes function)
|
109
|
+
|
110
|
+
activation_potentiations (list): A list of activation functions for each genome.
|
111
|
+
(second returned value of define_genomes function)
|
112
|
+
|
113
|
+
what_gen (int): The current generation number, used for informational purposes or logging.
|
114
|
+
|
115
|
+
fitness (numpy.ndarray): A 1D array containing the fitness values of each genome.
|
116
|
+
The array is used to rank the genomes based on their performance. PLANEAT maximizes or minimizes this fitness based on the `target_fitness` parameter.
|
117
|
+
|
118
|
+
show_info (bool, optional): If True, prints information about the current generation and the
|
119
|
+
maximum reward obtained. Also shows the current configuration. Default is False.
|
120
|
+
|
121
|
+
strategy (str, optional): The strategy for combining the best and bad genomes. Options:
|
122
|
+
- 'normal_selective': Normal selection based on reward, where a portion of the bad genes are discarded.
|
123
|
+
- 'more_selective': A more selective strategy, where fewer bad genes survive.
|
124
|
+
- 'less_selective': A less selective strategy, where more bad genes survive.
|
125
|
+
Default is 'normal_selective'.
|
126
|
+
|
127
|
+
bar_status (bool, optional): Loading bar status during evolving process of genomes. True or False. Default: True
|
144
128
|
|
145
|
-
|
146
|
-
|
147
|
-
|
148
|
-
|
149
|
-
|
150
|
-
|
151
|
-
activation_selection_rate (int, optional): If the activation list of a good genome is smaller than the value entered here, only one activation will undergo a crossover operation. In other words, this parameter controls the model complexity. Default is 2.
|
152
|
-
|
153
|
-
dtype (numpy.dtype): Data type for the arrays. np.float32 by default. Example: np.float64 or np.float16. [fp32 for balanced devices, fp64 for strong devices, fp16 for weak devices: not reccomended!] (optional)
|
154
|
-
|
155
|
-
Raises:
|
156
|
-
ValueError:
|
157
|
-
- If `policy` is not one of the specified values ('normal_selective', 'more_selective', 'less_selective').
|
158
|
-
- If `cross_over_mode` is not one of the specified values ('tpm', 'plantic').
|
159
|
-
- If `bad_genoms_mutation_prob`, `activation_mutate_prob`, or other probability parameters are not in the range [0, 1].
|
160
|
-
- If the population size is odd (ensuring an even number of genomes is required for proper selection).
|
161
|
-
|
162
|
-
Returns:
|
163
|
-
tuple: A tuple containing:
|
164
|
-
- weights (numpy.ndarray): The updated weights for the population after selection, crossover, and mutation.
|
165
|
-
The shape is (population_size, output_shape, input_shape).
|
166
|
-
- activation_potentiations (list): The updated list of activation functions for the population.
|
167
|
-
|
168
|
-
Notes:
|
169
|
-
- **Selection Process**:
|
170
|
-
- The genomes are sorted by their fitness (based on `fitness`), and then split into "best" and "bad" halves.
|
171
|
-
- The best genomes are retained, and the bad genomes are modified based on the selected strategy.
|
172
|
-
|
173
|
-
- **Crossover and Potentiation Strategies**:
|
174
|
-
- The **'cross_over'** strategy performs crossover, where parts of the best genomes' weights are combined with the other good genomes to create new weight matrices.
|
175
|
-
- The **'potentiate'** strategy strengthens the best genomes by potentiating their weights towards the other good genomes.
|
176
|
-
|
177
|
-
- **Mutation**:
|
178
|
-
- Mutation is applied to both the best and bad genomes, depending on the mutation probability and the `policy`.
|
179
|
-
- `bad_genoms_mutation_prob` determines the probability of applying mutations to the bad genomes.
|
180
|
-
- If `activation_mutate_prob` is provided, activation function mutations are applied to the genomes based on this probability.
|
181
|
-
|
182
|
-
- **Population Size**: The population size must be an even number to properly split the best and bad genomes. If `fitness` has an odd length, an error is raised.
|
183
|
-
|
184
|
-
- **Logging**: If `show_info=True`, the current generation and the maximum reward from the population are printed for tracking the learning progress.
|
129
|
+
policy (str, optional): The selection policy that governs how genomes are selected for reproduction. Options:
|
130
|
+
|
131
|
+
- 'aggresive': Aggressive policy using very aggressive selection policy.
|
132
|
+
Advantages: fast training.
|
133
|
+
Disadvantages: may lead to fitness stuck in a local maximum or minimum.
|
185
134
|
|
186
|
-
|
187
|
-
|
188
|
-
|
189
|
-
|
135
|
+
- 'explorer': Explorer policy increases population diversity.
|
136
|
+
Advantages: fitness does not get stuck at local maximum or minimum.
|
137
|
+
Disadvantages: slow training.
|
138
|
+
|
139
|
+
Suggestions: Use hybrid and dynamic policy. When fitness appears stuck, switch to the 'explorer' policy.
|
140
|
+
|
141
|
+
Default: 'aggresive'.
|
142
|
+
|
143
|
+
target_fitness (str, optional): Target fitness strategy for PLANEAT optimization. ('max' maximizes fitness, 'min' minimizes fitness.) Default: 'max'.
|
144
|
+
|
145
|
+
fitness_bias (float, optional): Fitness bias must be a probability value between 0 and 1 that determines the effect of fitness on the crossover process. Default: Determined by the `strategy`.
|
146
|
+
|
147
|
+
mutations (bool, optional): If True, mutations are applied to the bad genomes and potentially
|
148
|
+
to the best genomes as well. Default is True.
|
149
|
+
|
150
|
+
bad_genomes_mutation_prob (float, optional): The probability of applying mutation to the bad genomes.
|
151
|
+
Must be in the range [0, 1]. Also affects the mutation probability of the best genomes inversely.
|
152
|
+
For example, a value of 0.7 for bad genomes implies 0.3 for best genomes. Default: Determined by `policy`.
|
153
|
+
|
154
|
+
activation_mutate_prob (float, optional): The probability of applying mutation to the activation functions.
|
155
|
+
Must be in the range [0, 1]. Default is 0.5 (50%).
|
156
|
+
|
157
|
+
save_best_genom (bool, optional): If True, ensures that the best genomes are saved and not mutated
|
158
|
+
or altered during reproduction. Default is True.
|
159
|
+
|
160
|
+
cross_over_mode (str, optional): Specifies the crossover method to use. Options:
|
161
|
+
- 'tpm': Two-Point Matrix Crossover.
|
162
|
+
Default is 'tpm'.
|
163
|
+
|
164
|
+
activation_mutate_add_prob (float, optional): The probability of adding a new activation function to the genome for mutation.
|
165
|
+
Must be in the range [0, 1]. Default is 0.5.
|
166
|
+
|
167
|
+
activation_mutate_delete_prob (float, optional): The probability of deleting an existing activation function
|
168
|
+
from the genome for mutation. Must be in the range [0, 1]. Default is 0.5.
|
169
|
+
|
170
|
+
activation_mutate_change_prob (float, optional): The probability of changing an activation function in the genome for mutation.
|
171
|
+
Must be in the range [0, 1]. Default is 0.5.
|
172
|
+
|
173
|
+
weight_mutate_prob (float, optional): The probability of mutating a weight in the genome.
|
174
|
+
Must be in the range [0, 1]. Default is 1.
|
175
|
+
|
176
|
+
weight_mutate_rate (int, optional): If the value entered here equals the result of input_layer * output_layer,
|
177
|
+
only a single weight will be mutated during each mutation process. If the value is half of the result,
|
178
|
+
two weights will be mutated. WARNING: If you don't understand, do NOT change this value. Default is 32.
|
179
|
+
|
180
|
+
activation_selection_add_prob (float, optional): The probability of adding an existing activation function for crossover.
|
181
|
+
Must be in the range [0, 1]. Default is 0.6. (WARNING! Higher values increase complexity. For faster training, increase this value.)
|
182
|
+
|
183
|
+
activation_selection_change_prob (float, optional): The probability of changing an activation function in the genome for crossover.
|
184
|
+
Must be in the range [0, 1]. Default is 0.4.
|
185
|
+
|
186
|
+
activation_selection_rate (int, optional): If the activation list of a good genome is smaller than this value, only one activation will undergo crossover. This parameter controls model complexity. Default is 2.
|
187
|
+
|
188
|
+
dtype (numpy.dtype): Data type for the arrays. Default: np.float32.
|
189
|
+
Example: np.float64 or np.float16 [fp32 for balanced devices, fp64 for strong devices, fp16 for weak devices: not recommended!].
|
190
|
+
|
191
|
+
Raises:
|
192
|
+
ValueError:
|
193
|
+
- If `policy` is not one of the specified values ('aggresive', 'explorer').
|
194
|
+
- If 'strategy' is not one of the specified values ('less_selective', 'normal_selective', 'more_selective')
|
195
|
+
- If `cross_over_mode` is not one of the specified values ('tpm').
|
196
|
+
- If `bad_genomes_mutation_prob`, `activation_mutate_prob`, or other probability parameters are not in the range 0 and 1.
|
197
|
+
- If the population size is odd (ensuring an even number of genomes is required for proper selection).
|
198
|
+
- If 'fitness_bias' value is not in range 0 and 1.
|
199
|
+
|
200
|
+
Returns:
|
201
|
+
tuple: A tuple containing:
|
202
|
+
- weights (numpy.ndarray): The updated weights for the population after selection, crossover, and mutation.
|
203
|
+
The shape is (population_size, output_shape, input_shape).
|
204
|
+
- activation_potentiations (list): The updated list of activation functions for the population.
|
205
|
+
|
206
|
+
Notes:
|
207
|
+
- **Selection Process**:
|
208
|
+
- The genomes are sorted by their fitness (based on `fitness`), and then split into "best" and "bad" halves.
|
209
|
+
- The best genomes are retained, and the bad genomes are modified based on the selected strategy.
|
210
|
+
|
211
|
+
- **Crossover Strategies**:
|
212
|
+
- The **'cross_over'** strategy performs crossover, where parts of the best genomes' weights are combined with other good genomes to create new weight matrices.
|
213
|
+
|
214
|
+
- **Mutation**:
|
215
|
+
- Mutation is applied to both the best and bad genomes, depending on the mutation probability and the `policy`.
|
216
|
+
- `bad_genomes_mutation_prob` determines the probability of applying mutations to the bad genomes.
|
217
|
+
- If `activation_mutate_prob` is provided, activation function mutations are applied to the genomes based on this probability.
|
218
|
+
|
219
|
+
- **Population Size**: The population size must be an even number to properly split the best and bad genomes. If `fitness` has an odd length, an error is raised.
|
220
|
+
|
221
|
+
- **Logging**: If `show_info=True`, the current generation and the maximum reward from the population are printed for tracking the learning progress.
|
222
|
+
|
223
|
+
Example:
|
224
|
+
```python
|
225
|
+
weights, activation_potentiations = planeat.evolver(weights, activation_potentiations, 1, fitness, show_info=True, strategy='normal_selective', policy='aggresive')
|
226
|
+
```
|
227
|
+
|
228
|
+
- The function returns the updated weights and activations after processing based on the chosen strategy, policy, and mutation parameters.
|
229
|
+
"""
|
190
230
|
|
191
|
-
- The function returns the updated weights and activations after processing based on the chosen strategy, policy, and mutation parameters.
|
192
|
-
"""
|
193
|
-
|
194
231
|
### ERROR AND CONFIGURATION CHECKS:
|
195
232
|
|
196
|
-
if
|
197
|
-
if
|
198
|
-
|
233
|
+
if strategy == 'normal_selective':
|
234
|
+
if bad_genomes_mutation_prob is None: bad_genomes_mutation_prob = 0.7 # EFFECTS MUTATION
|
235
|
+
if bad_genomes_selection_prob is None: bad_genomes_selection_prob = 0.25 # EFFECTS CROSS-OVER
|
236
|
+
if fitness_bias is None: fitness_bias = 0.5 # The pressure applied by FITNESS to the CROSS-OVER
|
199
237
|
|
200
|
-
elif
|
201
|
-
if
|
202
|
-
|
238
|
+
elif strategy == 'more_selective':
|
239
|
+
if bad_genomes_mutation_prob is None: bad_genomes_mutation_prob = 0.85 # EFFECTS MUTATION
|
240
|
+
if bad_genomes_selection_prob is None: bad_genomes_selection_prob = 0.1 # EFFECTS CROSS-OVER
|
241
|
+
if fitness_bias is None: fitness_bias = 0.7 # The pressure applied by FITNESS to the CROSS-OVER
|
203
242
|
|
204
|
-
elif
|
205
|
-
if
|
206
|
-
|
243
|
+
elif strategy == 'less_selective':
|
244
|
+
if bad_genomes_mutation_prob is None: bad_genomes_mutation_prob = 0.6 # EFFECTS MUTATION
|
245
|
+
if bad_genomes_selection_prob is None: bad_genomes_selection_prob = 0.5 # EFFECTS CROSS-OVER
|
246
|
+
if fitness_bias is None: fitness_bias = 0.3 # The pressure applied by FITNESS to the CROSS-OVER
|
207
247
|
|
208
248
|
else:
|
209
|
-
raise ValueError("
|
249
|
+
raise ValueError("strategy parameter must be: 'normal_selective' or 'more_selective' or 'less_selective'")
|
210
250
|
|
211
|
-
|
212
|
-
|
251
|
+
if ((activation_mutate_add_prob < 0 or activation_mutate_add_prob > 1) or
|
252
|
+
(activation_mutate_change_prob < 0 or activation_mutate_change_prob > 1) or
|
253
|
+
(activation_mutate_delete_prob < 0 or activation_mutate_delete_prob > 1) or
|
254
|
+
(weight_mutate_prob < 0 or weight_mutate_prob > 1) or
|
255
|
+
(activation_selection_add_prob < 0 or activation_selection_add_prob > 1) or (
|
256
|
+
activation_selection_change_prob < 0 or activation_selection_change_prob > 1)):
|
257
|
+
|
213
258
|
raise ValueError("All hyperparameters ending with 'prob' must be a number between 0 and 1.")
|
259
|
+
|
260
|
+
if fitness_bias < 0 or fitness_bias > 1: raise ValueError("fitness_bias value must be a number between 0 and 1.")
|
214
261
|
|
215
|
-
if
|
216
|
-
|
217
|
-
|
218
|
-
if bad_genoms_mutation_prob is not None:
|
219
|
-
if not isinstance(bad_genoms_mutation_prob, float) or bad_genoms_mutation_prob < 0 or bad_genoms_mutation_prob > 1:
|
220
|
-
raise ValueError("bad_genoms_mutation_prob parameter must be float and 0-1 range")
|
262
|
+
if bad_genomes_mutation_prob is not None:
|
263
|
+
if not isinstance(bad_genomes_mutation_prob, float) or bad_genomes_mutation_prob < 0 or bad_genomes_mutation_prob > 1:
|
264
|
+
raise ValueError("bad_genomes_mutation_prob parameter must be float and 0-1 range")
|
221
265
|
|
222
266
|
if activation_mutate_prob is not None:
|
223
267
|
if not isinstance(activation_mutate_prob, float) or activation_mutate_prob < 0 or activation_mutate_prob > 1:
|
@@ -242,90 +286,93 @@ Example:
|
|
242
286
|
|
243
287
|
### GENOMES ARE DIVIDED INTO TWO GROUPS: GOOD GENOMES AND BAD GENOMES:
|
244
288
|
|
245
|
-
|
289
|
+
good_weights = weights[slice_center:]
|
246
290
|
bad_weights = weights[:slice_center]
|
247
|
-
|
291
|
+
best_weights = good_weights[-1]
|
248
292
|
|
249
|
-
|
293
|
+
good_activations = list(activation_potentiations[slice_center:])
|
250
294
|
bad_activations = list(activation_potentiations[:slice_center])
|
251
|
-
|
295
|
+
best_activations = good_activations[-1]
|
252
296
|
|
253
297
|
|
254
|
-
###
|
298
|
+
### PLANEAT IS APPLIED ACCORDING TO THE SPECIFIED POLICY, STRATEGY, AND PROBABILITY CONFIGURATION:
|
255
299
|
|
256
300
|
bar_format = loading_bars()[0]
|
257
301
|
|
258
|
-
if bar_status: progress = initialize_loading_bar(len(bad_weights), desc="GENERATION: " + str(what_gen), bar_format=bar_format, ncols=50
|
259
|
-
|
260
|
-
for i in range(len(bad_weights)):
|
261
|
-
|
262
|
-
if policy == 'normal_selective':
|
263
|
-
|
264
|
-
if strategy == 'cross_over':
|
265
|
-
bad_weights[i], bad_activations[i] = cross_over(best_weight, best_weights[i], best_activations=best_activation, good_activations=best_activations[i], cross_over_mode=cross_over_mode, activation_selection_add_prob=activation_selection_add_prob, activation_selection_change_prob=activation_selection_change_prob, activation_selection_rate=activation_selection_rate)
|
266
|
-
|
267
|
-
|
268
|
-
elif strategy == 'potentiate':
|
269
|
-
bad_weights[i], bad_activations[i] = potentiate(best_weight, best_weights[i], best_activations=best_activation, good_activations=best_activations[i], dtype=dtype)
|
270
|
-
|
271
|
-
|
272
|
-
if mutations is True:
|
273
|
-
|
274
|
-
mutation_prob = random.uniform(0, 1)
|
275
|
-
|
276
|
-
if mutation_prob > bad_genoms_mutation_prob:
|
277
|
-
if (save_best_genom == True and not np.array_equal(best_weights[i], best_weight)) or save_best_genom == False:
|
278
|
-
best_weights[i], best_activations[i] = mutation(best_weights[i], best_activations[i], activation_mutate_prob=activation_mutate_prob, activation_add_prob=activation_add_prob, activation_delete_prob=activation_delete_prob, activation_change_prob=activation_change_prob, weight_mutate_prob=weight_mutate_prob, threshold=weight_mutate_rate, dtype=dtype)
|
279
|
-
|
280
|
-
elif mutation_prob < bad_genoms_mutation_prob:
|
281
|
-
bad_weights[i], bad_activations[i] = mutation(bad_weights[i], bad_activations[i], activation_mutate_prob=activation_mutate_prob, activation_add_prob=activation_add_prob, activation_delete_prob=activation_delete_prob, activation_change_prob=activation_change_prob, weight_mutate_prob=weight_mutate_prob, threshold=weight_mutate_rate, dtype=dtype)
|
282
|
-
|
283
|
-
if policy == 'more_selective':
|
284
|
-
|
285
|
-
if strategy == 'cross_over':
|
286
|
-
bad_weights[i], bad_activations[i] = cross_over(best_weight, best_weights[i], best_activations=best_activation, good_activations=best_activations[i], cross_over_mode=cross_over_mode, activation_selection_add_prob=activation_selection_add_prob, activation_selection_change_prob=activation_selection_change_prob, activation_selection_rate=activation_selection_rate)
|
287
|
-
|
288
|
-
elif strategy == 'potentiate':
|
289
|
-
bad_weights[i], bad_activations[i] = potentiate(best_weight, best_weights[i], best_activations=best_activation, good_activations=best_activations[i], dtype=dtype)
|
290
|
-
|
291
|
-
if mutations is True:
|
292
|
-
|
293
|
-
mutation_prob = random.uniform(0, 1)
|
294
|
-
|
295
|
-
if mutation_prob > bad_genoms_mutation_prob:
|
296
|
-
if (save_best_genom == True and not np.array_equal(best_weights[i], best_weight)) or save_best_genom == False:
|
297
|
-
best_weights[i], best_activations[i] = mutation(best_weights[i], best_activations[i], activation_mutate_prob=activation_mutate_prob, activation_add_prob=activation_add_prob, activation_delete_prob=activation_delete_prob, activation_change_prob=activation_change_prob, weight_mutate_prob=weight_mutate_prob, threshold=weight_mutate_rate, dtype=dtype)
|
298
|
-
|
299
|
-
elif mutation_prob < bad_genoms_mutation_prob:
|
300
|
-
bad_weights[i], bad_activations[i] = mutation(bad_weights[i], bad_activations[i], activation_mutate_prob=activation_mutate_prob, activation_add_prob=activation_add_prob, activation_delete_prob=activation_delete_prob, activation_change_prob=activation_change_prob, weight_mutate_prob=weight_mutate_prob, threshold=weight_mutate_rate, dtype=dtype)
|
302
|
+
if bar_status: progress = initialize_loading_bar(len(bad_weights), desc="GENERATION: " + str(what_gen), bar_format=bar_format, ncols=50)
|
303
|
+
normalized_fitness = abs(normalization(fitness, dtype=dtype))
|
301
304
|
|
305
|
+
best_fitness = normalized_fitness[-1]
|
302
306
|
|
307
|
+
child_W = np.copy(bad_weights)
|
308
|
+
child_act = bad_activations.copy()
|
303
309
|
|
304
|
-
|
305
|
-
|
306
|
-
|
307
|
-
|
308
|
-
|
309
|
-
|
310
|
+
for i in range(len(bad_weights)):
|
311
|
+
second_parent_W, second_parent_act, s_i = second_parent_selection(good_weights, bad_weights, good_activations, bad_activations, bad_genomes_selection_prob)
|
312
|
+
|
313
|
+
if policy == 'aggresive':
|
314
|
+
child_W[i], child_act[i] = cross_over(best_weights,
|
315
|
+
second_parent_W,
|
316
|
+
best_activations,
|
317
|
+
second_parent_act,
|
318
|
+
cross_over_mode=cross_over_mode,
|
319
|
+
activation_selection_add_prob=activation_selection_add_prob,
|
320
|
+
activation_selection_change_prob=activation_selection_change_prob,
|
321
|
+
activation_selection_rate=activation_selection_rate,
|
322
|
+
bad_genomes_selection_prob=bad_genomes_selection_prob,
|
323
|
+
first_parent_fitness=best_fitness,
|
324
|
+
fitness_bias=fitness_bias,
|
325
|
+
second_parent_fitness=normalized_fitness[s_i]
|
326
|
+
)
|
327
|
+
elif policy == 'explorer':
|
328
|
+
child_W[i], child_act[i] = cross_over(good_weights[i],
|
329
|
+
second_parent_W,
|
330
|
+
good_activations[i],
|
331
|
+
second_parent_act,
|
332
|
+
cross_over_mode=cross_over_mode,
|
333
|
+
activation_selection_add_prob=activation_selection_add_prob,
|
334
|
+
activation_selection_change_prob=activation_selection_change_prob,
|
335
|
+
activation_selection_rate=activation_selection_rate,
|
336
|
+
bad_genomes_selection_prob=bad_genomes_selection_prob,
|
337
|
+
first_parent_fitness=normalized_fitness[i],
|
338
|
+
fitness_bias=fitness_bias,
|
339
|
+
second_parent_fitness=normalized_fitness[s_i]
|
340
|
+
)
|
341
|
+
|
342
|
+
else: raise ValueError("policy parameter must be: 'aggresive' or 'explorer'")
|
343
|
+
|
344
|
+
if mutations is True:
|
345
|
+
mutation_prob = random.uniform(0, 1)
|
346
|
+
|
347
|
+
if mutation_prob > bad_genomes_mutation_prob:
|
348
|
+
if (save_best_genom == True and not np.array_equal(good_weights[i], best_weights)) or save_best_genom == False:
|
349
|
+
good_weights[i], good_activations[i] = mutation(good_weights[i],
|
350
|
+
good_activations[i],
|
351
|
+
activation_mutate_prob=activation_mutate_prob,
|
352
|
+
activation_add_prob=activation_mutate_add_prob,
|
353
|
+
activation_delete_prob=activation_mutate_delete_prob,
|
354
|
+
activation_change_prob=activation_mutate_change_prob,
|
355
|
+
weight_mutate_prob=weight_mutate_prob,
|
356
|
+
threshold=weight_mutate_rate,
|
357
|
+
genome_fitness=normalized_fitness[i]
|
358
|
+
)
|
310
359
|
|
311
|
-
|
312
|
-
|
360
|
+
elif mutation_prob < bad_genomes_mutation_prob:
|
361
|
+
bad_weights[i], bad_activations[i] = mutation(bad_weights[i],
|
362
|
+
bad_activations[i],
|
363
|
+
activation_mutate_prob=activation_mutate_prob,
|
364
|
+
activation_add_prob=activation_mutate_add_prob,
|
365
|
+
activation_delete_prob=activation_mutate_delete_prob,
|
366
|
+
activation_change_prob=activation_mutate_change_prob,
|
367
|
+
weight_mutate_prob=weight_mutate_prob,
|
368
|
+
threshold=weight_mutate_rate,
|
369
|
+
genome_fitness=normalized_fitness[i]
|
370
|
+
)
|
313
371
|
|
314
|
-
if mutations is True:
|
315
|
-
|
316
|
-
mutation_prob = random.uniform(0, 1)
|
317
|
-
|
318
|
-
if mutation_prob > bad_genoms_mutation_prob:
|
319
|
-
if (save_best_genom == True and not np.array_equal(best_weights[i], best_weight)) or save_best_genom == False:
|
320
|
-
best_weights[i], best_activations[i] = mutation(best_weights[i], best_activations[i], activation_mutate_prob=activation_mutate_prob, activation_add_prob=activation_add_prob, activation_delete_prob=activation_delete_prob, activation_change_prob=activation_change_prob, weight_mutate_prob=weight_mutate_prob, threshold=weight_mutate_rate, dtype=dtype)
|
321
|
-
|
322
|
-
elif mutation_prob < bad_genoms_mutation_prob:
|
323
|
-
bad_weights[i], bad_activations[i] = mutation(bad_weights[i], bad_activations[i], activation_mutate_prob=activation_mutate_prob, activation_add_prob=activation_add_prob, activation_delete_prob=activation_delete_prob, activation_change_prob=activation_change_prob, weight_mutate_prob=weight_mutate_prob, threshold=weight_mutate_rate, dtype=dtype)
|
324
|
-
|
325
372
|
if bar_status: progress.update(1)
|
326
373
|
|
327
|
-
weights = np.vstack((
|
328
|
-
activation_potentiations =
|
374
|
+
weights = np.vstack((child_W, good_weights))
|
375
|
+
activation_potentiations = child_act + good_activations
|
329
376
|
|
330
377
|
### INFO PRINTING CONSOLE
|
331
378
|
|
@@ -334,22 +381,21 @@ Example:
|
|
334
381
|
print("*** Configuration Settings ***")
|
335
382
|
print(" POPULATION SIZE: ", str(len(weights)))
|
336
383
|
print(" STRATEGY: ", strategy)
|
337
|
-
|
338
|
-
if strategy == 'cross_over':
|
339
|
-
print(" CROSS OVER MODE: ", cross_over_mode)
|
340
|
-
|
384
|
+
print(" CROSS OVER MODE: ", cross_over_mode)
|
341
385
|
print(" POLICY: ", policy)
|
342
386
|
print(" MUTATIONS: ", str(mutations))
|
343
|
-
print(" BAD GENOMES MUTATION PROB: ", str(
|
344
|
-
print(" GOOD GENOMES MUTATION PROB: ", str(round(1 -
|
387
|
+
print(" BAD GENOMES MUTATION PROB: ", str(bad_genomes_mutation_prob))
|
388
|
+
print(" GOOD GENOMES MUTATION PROB: ", str(round(1 - bad_genomes_mutation_prob, 2)))
|
389
|
+
print(" BAD GENOMES SELECTION PROB: ", str(bad_genomes_selection_prob))
|
345
390
|
print(" WEIGHT MUTATE PROB: ", str(weight_mutate_prob))
|
346
391
|
print(" WEIGHT MUTATE RATE (THRESHOLD VALUE FOR SINGLE MUTATION): ", str(weight_mutate_rate))
|
347
392
|
print(" ACTIVATION MUTATE PROB: ", str(activation_mutate_prob))
|
348
|
-
print(" ACTIVATION ADD PROB: ", str(
|
349
|
-
print(" ACTIVATION DELETE PROB: ", str(
|
350
|
-
print(" ACTIVATION CHANGE PROB: ", str(
|
393
|
+
print(" ACTIVATION MUTATE ADD PROB: ", str(activation_mutate_add_prob))
|
394
|
+
print(" ACTIVATION MUTATE DELETE PROB: ", str(activation_mutate_delete_prob))
|
395
|
+
print(" ACTIVATION MUTATE CHANGE PROB: ", str(activation_mutate_change_prob))
|
351
396
|
print(" ACTIVATION SELECTION ADD PROB: ", str(activation_selection_add_prob))
|
352
397
|
print(" ACTIVATION SELECTION CHANGE PROB: ", str(activation_selection_change_prob))
|
398
|
+
print(" FITNESS BIAS: ", str(fitness_bias))
|
353
399
|
print(" ACTIVATION SELECTION RATE (THRESHOLD VALUE FOR SINGLE CROSS OVER):", str(activation_selection_rate) + '\n')
|
354
400
|
|
355
401
|
print("*** Performance ***")
|
@@ -377,7 +423,7 @@ def evaluate(x_population, weights, activation_potentiations, rl_mode=False, dty
|
|
377
423
|
activation_potentiations (list or str): A list where each entry represents an activation function
|
378
424
|
or a potentiation strategy applied to each genome. If only one
|
379
425
|
activation function is used, this can be a single string.
|
380
|
-
rl_mode (bool, optional): If True, reinforcement learning mode is activated, this accepts x_population is a single
|
426
|
+
rl_mode (bool, optional): If True, reinforcement learning mode is activated, this accepts x_population is a single genome. (Also weights and activation_potentations a single genomes part.)
|
381
427
|
Default is False.
|
382
428
|
|
383
429
|
dtype (numpy.dtype): Data type for the arrays. np.float32 by default. Example: np.float64 or np.float16. [fp32 for balanced devices, fp64 for strong devices, fp16 for weak devices: not reccomended!] (optional)
|
@@ -402,7 +448,7 @@ def evaluate(x_population, weights, activation_potentiations, rl_mode=False, dty
|
|
402
448
|
outputs = evaluate(x_population, weights, activation_potentiations, rl_mode=False)
|
403
449
|
```
|
404
450
|
|
405
|
-
- The function returns a list of outputs after processing the population, where each element corresponds to
|
451
|
+
- The function returns a list of outputs after processing the population, where each element corresponds to
|
406
452
|
the output for each genome in `x_population`.
|
407
453
|
"""
|
408
454
|
|
@@ -435,39 +481,67 @@ def evaluate(x_population, weights, activation_potentiations, rl_mode=False, dty
|
|
435
481
|
return outputs
|
436
482
|
|
437
483
|
|
438
|
-
def cross_over(
|
484
|
+
def cross_over(first_parent_W,
|
485
|
+
second_parent_W,
|
486
|
+
first_parent_act,
|
487
|
+
second_parent_act,
|
488
|
+
cross_over_mode,
|
489
|
+
activation_selection_add_prob,
|
490
|
+
activation_selection_change_prob,
|
491
|
+
activation_selection_rate,
|
492
|
+
bad_genomes_selection_prob,
|
493
|
+
first_parent_fitness,
|
494
|
+
second_parent_fitness,
|
495
|
+
fitness_bias):
|
439
496
|
"""
|
440
|
-
Performs a
|
497
|
+
Performs a crossover operation on two sets of weights and activation functions.
|
441
498
|
This function combines two individuals (represented by their weights and activation functions)
|
442
499
|
to create a new individual by exchanging parts of their weight matrices and activation functions.
|
443
500
|
|
444
501
|
Args:
|
445
|
-
|
446
|
-
|
447
|
-
|
448
|
-
|
502
|
+
first_parent_W (numpy.ndarray): The weight matrix of the first individual (parent).
|
503
|
+
second_parent_W (numpy.ndarray): The weight matrix of the second individual (parent).
|
504
|
+
first_parent_act (str or list): The activation function(s) of the first individual.
|
505
|
+
second_parent_act (str or list): The activation function(s) of the second individual.
|
449
506
|
cross_over_mode (str): Determines the crossover method to be used. Options:
|
450
|
-
|
451
|
-
|
452
|
-
|
453
|
-
|
507
|
+
- 'tpm': Two-Point Matrix Crossover, where sub-matrices of weights are swapped between parents.
|
508
|
+
activation_selection_add_prob (float): Probability of adding new activation functions
|
509
|
+
from the second parent to the child genome.
|
510
|
+
activation_selection_change_prob (float): Probability of replacing an activation function in the child genome
|
511
|
+
with one from the second parent.
|
512
|
+
activation_selection_rate (float): Determines how quickly activation functions are added or replaced
|
513
|
+
during the crossover process.
|
514
|
+
bad_genomes_selection_prob (float): Probability of selecting a "bad" genome for replacement with the offspring.
|
515
|
+
first_parent_fitness (float): Fitness score of the first parent.
|
516
|
+
second_parent_fitness (float): Fitness score of the second parent.
|
517
|
+
fitness_bias (float): A bias factor used to favor fitter parents during crossover operations.
|
454
518
|
|
455
519
|
Returns:
|
456
520
|
tuple: A tuple containing:
|
457
|
-
-
|
458
|
-
-
|
521
|
+
- child_W (numpy.ndarray): The weight matrix of the new individual created by crossover.
|
522
|
+
- child_act (list): The list of activation functions of the new individual created by crossover.
|
459
523
|
|
460
524
|
Notes:
|
461
525
|
- The crossover is performed based on the selected `cross_over_mode`.
|
462
|
-
|
463
|
-
|
464
|
-
- The crossover operation combines the activation functions of both parents:
|
465
|
-
- If the activation functions are passed as strings, they are converted to lists for uniform handling.
|
466
|
-
- The resulting activation functions depend on the crossover method and the parent's configuration.
|
526
|
+
- In 'tpm' mode, random sub-matrices from the parent weight matrices are swapped.
|
527
|
+
- Activation functions from both parents are combined using the probabilities and rates provided.
|
467
528
|
|
468
529
|
Example:
|
469
530
|
```python
|
470
|
-
new_weights, new_activations = cross_over(
|
531
|
+
new_weights, new_activations = cross_over(
|
532
|
+
first_parent_W=parent1_weights,
|
533
|
+
second_parent_W=parent2_weights,
|
534
|
+
first_parent_act=parent1_activations,
|
535
|
+
second_parent_act=parent2_activations,
|
536
|
+
cross_over_mode='tpm',
|
537
|
+
activation_selection_add_prob=0.8,
|
538
|
+
activation_selection_change_prob=0.5,
|
539
|
+
activation_selection_rate=0.1,
|
540
|
+
bad_genomes_selection_prob=0.7,
|
541
|
+
first_parent_fitness=0.9,
|
542
|
+
second_parent_fitness=0.85,
|
543
|
+
fitness_bias=0.6
|
544
|
+
)
|
471
545
|
```
|
472
546
|
"""
|
473
547
|
|
@@ -475,8 +549,29 @@ def cross_over(best_weight, good_weight, best_activations, good_activations, cro
|
|
475
549
|
|
476
550
|
start = 0
|
477
551
|
|
478
|
-
row_end =
|
479
|
-
col_end =
|
552
|
+
row_end = first_parent_W.shape[0]
|
553
|
+
col_end = first_parent_W.shape[1]
|
554
|
+
|
555
|
+
total_gene = row_end * col_end
|
556
|
+
half_of_gene = int(total_gene / 2)
|
557
|
+
|
558
|
+
decision = dominant_parent_selection(bad_genomes_selection_prob)
|
559
|
+
|
560
|
+
if decision == 'first_parent':
|
561
|
+
dominant_parent_W = np.copy(first_parent_W)
|
562
|
+
dominant_parent_act = first_parent_act
|
563
|
+
|
564
|
+
undominant_parent_W = np.copy(second_parent_W)
|
565
|
+
undominant_parent_act = second_parent_act
|
566
|
+
succes = second_parent_fitness
|
567
|
+
|
568
|
+
elif decision == 'second_parent':
|
569
|
+
dominant_parent_W = np.copy(second_parent_W)
|
570
|
+
dominant_parent_act = second_parent_act
|
571
|
+
|
572
|
+
undominant_parent_W = np.copy(first_parent_W)
|
573
|
+
undominant_parent_act = first_parent_act
|
574
|
+
succes = first_parent_fitness
|
480
575
|
|
481
576
|
while True:
|
482
577
|
|
@@ -486,48 +581,47 @@ def cross_over(best_weight, good_weight, best_activations, good_activations, cro
|
|
486
581
|
row_cut_end = int(random.uniform(start, row_end))
|
487
582
|
col_cut_end = int(random.uniform(start, col_end))
|
488
583
|
|
489
|
-
if (row_cut_end > row_cut_start) and
|
584
|
+
if ((row_cut_end > row_cut_start) and
|
585
|
+
(col_cut_end > col_cut_start) and
|
586
|
+
(((row_cut_end + 1) - (row_cut_start + 1) * 2) + ((col_cut_end + 1) - (col_cut_start + 1) * 2) <= half_of_gene)):
|
490
587
|
break
|
588
|
+
|
589
|
+
selection_bias = random.uniform(0, 1)
|
491
590
|
|
492
|
-
|
493
|
-
|
494
|
-
|
495
|
-
if cross_over_mode == 'tpm':
|
496
|
-
new_weight[row_cut_start:row_cut_end, col_cut_start:col_cut_end] = best_w2[row_cut_start:row_cut_end, col_cut_start:col_cut_end]
|
497
|
-
|
498
|
-
elif cross_over_mode == 'plantic':
|
499
|
-
new_weight[row_cut_start:row_cut_end,:] = best_w2[row_cut_start:row_cut_end,:]
|
591
|
+
if fitness_bias > selection_bias:
|
592
|
+
row_cut_start = math.floor(row_cut_start * succes)
|
593
|
+
row_cut_end = math.ceil(row_cut_end * succes)
|
500
594
|
|
595
|
+
col_cut_start = math.floor(col_cut_start * succes)
|
596
|
+
col_cut_end = math.ceil(col_cut_end * succes)
|
501
597
|
|
502
|
-
|
503
|
-
best = [best_activations]
|
598
|
+
child_W = dominant_parent_W
|
504
599
|
|
505
|
-
if
|
506
|
-
|
600
|
+
if cross_over_mode == 'tpm':
|
601
|
+
child_W[row_cut_start:row_cut_end, col_cut_start:col_cut_end] = undominant_parent_W[row_cut_start:row_cut_end, col_cut_start:col_cut_end]
|
507
602
|
|
508
|
-
if isinstance(best_activations, list):
|
509
|
-
best = best_activations
|
510
603
|
|
511
|
-
if isinstance(
|
512
|
-
|
604
|
+
if isinstance(dominant_parent_act, str): dominant_parent_act = [dominant_parent_act]
|
605
|
+
if isinstance(undominant_parent_act, str): undominant_parent_act = [undominant_parent_act]
|
513
606
|
|
514
|
-
|
607
|
+
child_act = list(np.copy(dominant_parent_act))
|
515
608
|
|
516
609
|
activation_selection_add_prob = 1 - activation_selection_add_prob # if prob 0.8 (%80) then 1 - 0.8. Because 0-1 random number probably greater than 0.2
|
517
610
|
potential_activation_selection_add = random.uniform(0, 1)
|
518
611
|
|
519
612
|
if potential_activation_selection_add > activation_selection_add_prob:
|
520
613
|
|
614
|
+
activation_selection_rate = activation_selection_rate / succes
|
521
615
|
new_threshold = activation_selection_rate
|
522
616
|
|
523
617
|
while True:
|
524
618
|
|
525
|
-
|
526
|
-
|
619
|
+
random_index = int(random.uniform(0, len(undominant_parent_act)-1))
|
620
|
+
random_undominant_activation = undominant_parent_act[random_index]
|
527
621
|
|
528
|
-
|
622
|
+
child_act.append(random_undominant_activation)
|
529
623
|
|
530
|
-
if len(
|
624
|
+
if len(dominant_parent_act) > new_threshold:
|
531
625
|
new_threshold += activation_selection_rate
|
532
626
|
pass
|
533
627
|
|
@@ -538,69 +632,36 @@ def cross_over(best_weight, good_weight, best_activations, good_activations, cro
|
|
538
632
|
potential_activation_selection_change_prob = random.uniform(0, 1)
|
539
633
|
|
540
634
|
if potential_activation_selection_change_prob > activation_selection_change_prob:
|
541
|
-
|
635
|
+
|
636
|
+
activation_selection_rate = activation_selection_rate / succes
|
542
637
|
new_threshold = activation_selection_rate
|
543
638
|
|
544
639
|
while True:
|
545
640
|
|
546
|
-
|
547
|
-
|
548
|
-
|
641
|
+
random_index_undominant = int(random.uniform(0, len(undominant_parent_act)-1))
|
642
|
+
random_index_dominant = int(random.uniform(0, len(dominant_parent_act)-1))
|
643
|
+
random_undominant_activation = undominant_parent_act[random_index_undominant]
|
549
644
|
|
550
|
-
|
645
|
+
child_act[random_index_dominant] = random_undominant_activation
|
551
646
|
|
552
|
-
if len(
|
647
|
+
if len(dominant_parent_act) > new_threshold:
|
553
648
|
new_threshold += activation_selection_rate
|
554
649
|
pass
|
555
650
|
|
556
651
|
else:
|
557
652
|
break
|
558
653
|
|
559
|
-
return
|
560
|
-
|
561
|
-
def
|
562
|
-
|
563
|
-
|
564
|
-
|
565
|
-
|
566
|
-
|
567
|
-
|
568
|
-
|
569
|
-
|
570
|
-
good_activations (str or list): The activation function(s) of the second individual.
|
571
|
-
dtype (numpy.dtype): Data type for the arrays. np.float32 by default. Example: np.float64 or np.float16. [fp32 for balanced devices, fp64 for strong devices, fp16 for weak devices: not reccomended!] (optional)
|
572
|
-
|
573
|
-
Returns:
|
574
|
-
tuple: A tuple containing:
|
575
|
-
- new_weight (numpy.ndarray): The new weight matrix after potentiation and normalization. (Max abs normalization.)
|
576
|
-
- new_activations (list): The new activation functions after concatenation.
|
577
|
-
|
578
|
-
Notes:
|
579
|
-
- The weight matrices are element-wise added and then normalized using the `normalization` function. (Max abs normalization.)
|
580
|
-
- The activation functions from both parents are concatenated to form the new activation functions list.
|
581
|
-
- If the activation functions are passed as strings, they are converted to lists for uniform handling.
|
582
|
-
"""
|
583
|
-
|
584
|
-
new_weight = best_weight + good_weight
|
585
|
-
new_weight = normalization(new_weight, dtype=dtype)
|
586
|
-
|
587
|
-
if isinstance(best_activations, str):
|
588
|
-
best = [best_activations]
|
589
|
-
|
590
|
-
if isinstance(good_activations, str):
|
591
|
-
good = [good_activations]
|
592
|
-
|
593
|
-
if isinstance(best_activations, list):
|
594
|
-
best = best_activations
|
595
|
-
|
596
|
-
if isinstance(good_activations, list):
|
597
|
-
good = good_activations
|
598
|
-
|
599
|
-
new_activations = best + good
|
600
|
-
|
601
|
-
return new_weight, new_activations
|
602
|
-
|
603
|
-
def mutation(weight, activations, activation_mutate_prob, activation_add_prob, activation_delete_prob, activation_change_prob, weight_mutate_prob, threshold, dtype=np.float32):
|
654
|
+
return child_W, child_act
|
655
|
+
|
656
|
+
def mutation(weight,
|
657
|
+
activations,
|
658
|
+
activation_mutate_prob,
|
659
|
+
activation_add_prob,
|
660
|
+
activation_delete_prob,
|
661
|
+
activation_change_prob,
|
662
|
+
weight_mutate_prob,
|
663
|
+
threshold,
|
664
|
+
genome_fitness):
|
604
665
|
"""
|
605
666
|
Performs mutation on the given weight matrix and activation functions.
|
606
667
|
- The weight matrix is mutated by randomly changing its values based on the mutation probability.
|
@@ -615,8 +676,7 @@ def mutation(weight, activations, activation_mutate_prob, activation_add_prob, a
|
|
615
676
|
activation_change_prob (float): Probability of replacing an existing activation function with a new one.
|
616
677
|
weight_mutate_prob (float): The probability of mutating weight matrix.
|
617
678
|
threshold (float): If the value you enter here is equal to the result of input layer * output layer, only a single weight will be mutated during each mutation process. If the value you enter here is half of the result of input layer * output layer, two weights in the weight matrix will be mutated.
|
618
|
-
|
619
|
-
|
679
|
+
genome_fitness (float): Fitness value of genome
|
620
680
|
Returns:
|
621
681
|
tuple: A tuple containing:
|
622
682
|
- mutated_weight (numpy.ndarray): The weight matrix after mutation.
|
@@ -634,8 +694,7 @@ def mutation(weight, activations, activation_mutate_prob, activation_add_prob, a
|
|
634
694
|
the optimization process.
|
635
695
|
"""
|
636
696
|
|
637
|
-
if isinstance(activations, str):
|
638
|
-
activations = [activations]
|
697
|
+
if isinstance(activations, str): activations = [activations]
|
639
698
|
|
640
699
|
weight_mutate_prob = 1 - weight_mutate_prob # if prob 0.8 (%80) then 1 - 0.8. Because 0-1 random number probably greater than 0.2
|
641
700
|
potential_weight_mutation = random.uniform(0, 1)
|
@@ -645,6 +704,8 @@ def mutation(weight, activations, activation_mutate_prob, activation_add_prob, a
|
|
645
704
|
start = 0
|
646
705
|
row_end = weight.shape[0]
|
647
706
|
col_end = weight.shape[1]
|
707
|
+
|
708
|
+
threshold = threshold * genome_fitness
|
648
709
|
new_threshold = threshold
|
649
710
|
|
650
711
|
while True:
|
@@ -659,8 +720,7 @@ def mutation(weight, activations, activation_mutate_prob, activation_add_prob, a
|
|
659
720
|
pass
|
660
721
|
|
661
722
|
else:
|
662
|
-
break
|
663
|
-
|
723
|
+
break
|
664
724
|
|
665
725
|
activation_mutate_prob = 1 - activation_mutate_prob
|
666
726
|
potential_activation_mutation = random.uniform(0, 1)
|
@@ -684,13 +744,7 @@ def mutation(weight, activations, activation_mutate_prob, activation_add_prob, a
|
|
684
744
|
|
685
745
|
random_index_all_act = int(random.uniform(0, len(all_acts)-1))
|
686
746
|
activations.append(all_acts[random_index_all_act])
|
687
|
-
|
688
|
-
for i in range(weight.shape[0]):
|
689
747
|
|
690
|
-
weight[i,:] = apply_activation(weight[i,:], activations[-1])
|
691
|
-
|
692
|
-
weight = normalization(weight, dtype=dtype)
|
693
|
-
|
694
748
|
except:
|
695
749
|
|
696
750
|
activation = activations
|
@@ -699,26 +753,12 @@ def mutation(weight, activations, activation_mutate_prob, activation_add_prob, a
|
|
699
753
|
activations.append(activation)
|
700
754
|
activations.append(all_acts[int(random.uniform(0, len(all_acts)-1))])
|
701
755
|
|
702
|
-
for i in range(weight.shape[0]):
|
703
|
-
|
704
|
-
weight[i,:] = apply_activation(weight[i,:], activations[-1])
|
705
|
-
|
706
|
-
weight = normalization(weight, dtype=dtype)
|
707
|
-
|
708
756
|
if potential_activation_delete_prob > activation_delete_prob and len(activations) > 1:
|
709
757
|
|
710
758
|
random_index = random.randint(0, len(activations) - 1)
|
711
|
-
|
712
|
-
wc = np.copy(weight)
|
713
|
-
for i in range(weight.shape[0]):
|
714
|
-
|
715
|
-
wc[i,:] = apply_activation(wc[i,:], activations[random_index])
|
716
|
-
weight[i,:] -= wc[i,:]
|
717
|
-
|
718
759
|
activations.pop(random_index)
|
719
|
-
weight = normalization(weight, dtype=dtype)
|
720
760
|
|
721
|
-
|
761
|
+
|
722
762
|
if potential_activation_change_prob > activation_change_prob:
|
723
763
|
|
724
764
|
random_index_all_act = int(random.uniform(0, len(all_acts)-1))
|
@@ -726,18 +766,28 @@ def mutation(weight, activations, activation_mutate_prob, activation_add_prob, a
|
|
726
766
|
|
727
767
|
activations[random_index_genom_act] = all_acts[random_index_all_act]
|
728
768
|
|
729
|
-
|
730
|
-
for i in range(weight.shape[0]):
|
769
|
+
return weight, activations
|
731
770
|
|
732
|
-
|
733
|
-
|
771
|
+
def second_parent_selection(good_weights, bad_weights, good_activations, bad_activations, bad_genomes_selection_prob):
|
772
|
+
|
773
|
+
selection_prob = random.uniform(0, 1)
|
774
|
+
random_index = int(random.uniform(0, len(good_weights) - 1))
|
775
|
+
|
776
|
+
if selection_prob > bad_genomes_selection_prob:
|
777
|
+
second_selected_W = good_weights[random_index]
|
778
|
+
second_selected_act = good_activations[random_index]
|
734
779
|
|
735
|
-
|
780
|
+
else:
|
781
|
+
second_selected_W = bad_weights[random_index]
|
782
|
+
second_selected_act = bad_activations[random_index]
|
736
783
|
|
737
|
-
|
784
|
+
return second_selected_W, second_selected_act, random_index
|
785
|
+
|
786
|
+
def dominant_parent_selection(bad_genomes_selection_prob):
|
738
787
|
|
739
|
-
|
788
|
+
selection_prob = random.uniform(0, 1)
|
740
789
|
|
741
|
-
|
790
|
+
if selection_prob > bad_genomes_selection_prob: decision = 'first_parent'
|
791
|
+
else: decision = 'second_parent'
|
742
792
|
|
743
|
-
return
|
793
|
+
return decision
|