pyerualjetwork 4.2.5__py3-none-any.whl → 4.2.6b1__py3-none-any.whl

pyerualjetwork/__init__.py

@@ -1,4 +1,4 @@
-__version__ = "4.2.5"
+__version__ = "4.2.6b1"
 __update__ = "* Changes: https://github.com/HCB06/PyerualJetwork/blob/main/CHANGES\n* PyerualJetwork Homepage: https://github.com/HCB06/PyerualJetwork/tree/main\n* PyerualJetwork document: https://github.com/HCB06/PyerualJetwork/blob/main/Welcome_to_PyerualJetwork/PYERUALJETWORK_USER_MANUEL_AND_LEGAL_INFORMATION(EN).pdf\n* YouTube tutorials: https://www.youtube.com/@HasanCanBeydili"
 
 def print_version(__version__):

pyerualjetwork/planeat.py

@@ -15,6 +15,7 @@ ANAPLAN document: https://github.com/HCB06/Anaplan/blob/main/Welcome_to_Anaplan/
 import numpy as np
 import random
 import math
+import copy
 
 ### LIBRARY IMPORTS ###
 from .plan import feed_forward
@@ -82,8 +83,7 @@ def evolver(weights,
             strategy='normal_selective', 
             target_fitness='max', 
             bad_genomes_mutation_prob=None, 
-            activation_mutate_prob=0.5, 
-            save_best_genome=True, 
+            activation_mutate_prob=0.5,  
             fitness_bias=None, 
             cross_over_mode='tpm', 
             activation_mutate_add_prob=0.5, 
@@ -150,9 +150,6 @@ def evolver(weights,
       activation_mutate_prob (float, optional): The probability of applying mutation to the activation functions. 
          Must be in the range [0, 1]. Default is 0.5 (50%).
       
-      save_best_genom (bool, optional): If True, ensures that the best genomes are saved and not mutated 
-         or altered during reproduction. Default is True.
-      
       cross_over_mode (str, optional): Specifies the crossover method to use. Options:
          - 'tpm': Two-Point Matrix Crossover.
          Default is 'tpm'.
@@ -274,6 +271,7 @@ def evolver(weights,
 
    if target_fitness == 'max': sort_indices = np.argsort(fitness)
    elif target_fitness == 'min': sort_indices = np.argsort(-fitness)
+   else: raise ValueError("target_fitness value just be 'max' or 'min'")
 
    fitness = fitness[sort_indices]
    weights = weights[sort_indices]
@@ -284,11 +282,11 @@ def evolver(weights,
 
    good_weights = weights[slice_center:]
    bad_weights = weights[:slice_center]
-   best_weight = good_weights[-1]
+   best_weight = np.copy(good_weights[-1])
 
    good_activations = list(activation_potentiations[slice_center:])
    bad_activations = list(activation_potentiations[:slice_center])
-   best_activations = good_activations[-1]
+   best_activations =  copy.deepcopy(good_activations[-1])
 
    
 ### PLANEAT IS APPLIED ACCORDING TO THE SPECIFIED POLICY, STRATEGY, AND PROBABILITY CONFIGURATION:
@@ -302,10 +300,10 @@ def evolver(weights,
    epsilon = np.finfo(float).eps
 
    child_W = np.copy(bad_weights)
-   child_act = bad_activations.copy()
+   child_act = copy.deepcopy(bad_activations)
 
    mutated_W = np.copy(bad_weights)
-   mutated_act = bad_activations.copy()
+   mutated_act = copy.deepcopy(bad_activations)
 
    for i in range(len(bad_weights)):
       
@@ -363,9 +361,8 @@ def evolver(weights,
 
       if bar_status: progress.update(1)
 
-   if save_best_genome:
-      child_W[-1] = best_weight
-      child_act[-1] = best_activations
+   child_W[0] = best_weight
+   child_act[0] = best_activations
 
    weights = np.vstack((child_W, mutated_W))
    activation_potentiations = child_act + mutated_act
@@ -395,13 +392,13 @@ def evolver(weights,
 
 
       print("*** Performance ***")
-      print("  MAX FITNESS: ", str(round(max(fitness), 2)))
+      print("  MAX FITNESS: ", str(round(max(fitness) if target_fitness == 'max' else min(fitness), 2)))
       print("  MEAN FITNESS: ", str(round(np.mean(fitness), 2)))
-      print("  MIN FITNESS: ", str(round(min(fitness), 2)) + '\n')
+      print("  MIN FITNESS: ", str(round(min(fitness)) if target_fitness == 'max' else max(fitness), 2) + '\n')
 
-      print("  BEST GENOME ACTIVATION LENGTH: ", str(len(activation_potentiations[-1])))
-      print("  BEST GENOME INDEX: ", str(len(weights)-1))
-      print("  NOTE: Genomes are always sorted from the least successful to the most successful according to their performance ranking. Therefore, the genome at the last index is the king of the previous generation. " + '\n')
+      print("  BEST GENOME ACTIVATION LENGTH: ", str(len(best_activations)))
+      print("  BEST GENOME INDEX: ", str(0))
+      print("  NOTE: The returned genome at the first index is the best of the previous generation." + '\n')
       
 
    return weights, activation_potentiations

pyerualjetwork/planeat_cuda.py

@@ -16,6 +16,7 @@ import cupy as cp
 import numpy as np
 import random
 import math
+import copy
 
 
 ### LIBRARY IMPORTS ###
@@ -85,7 +86,6 @@ def evolver(weights,
             target_fitness='max', 
             bad_genomes_mutation_prob=None, 
             activation_mutate_prob=0.5, 
-            save_best_genome=True, 
             fitness_bias=None, 
             cross_over_mode='tpm',
             activation_mutate_add_prob=0.5, 
@@ -152,9 +152,6 @@ def evolver(weights,
       activation_mutate_prob (float, optional): The probability of applying mutation to the activation functions. 
          Must be in the range [0, 1]. Default is 0.5 (50%).
       
-      save_best_genome (bool, optional): If True, ensures that the best genomes are saved and not mutated 
-         or altered during reproduction. Default is True.
-      
       cross_over_mode (str, optional): Specifies the crossover method to use. Options:
          - 'tpm': Two-Point Matrix Crossover.
          Default is 'tpm'.
@@ -274,6 +271,7 @@ def evolver(weights,
 
    if target_fitness == 'max': sort_indices = cp.argsort(fitness)
    elif target_fitness == 'min': sort_indices = cp.argsort(-fitness)
+   else: raise ValueError("target_fitness value just be 'max' or 'min'")
 
    fitness = fitness[sort_indices]
    weights = weights[sort_indices]
@@ -284,11 +282,11 @@ def evolver(weights,
 
    good_weights = weights[slice_center:]
    bad_weights = weights[:slice_center]
-   best_weight = good_weights[-1]
+   best_weight = cp.copy(good_weights[-1])
 
    good_activations = list(activation_potentiations[slice_center:])
    bad_activations = list(activation_potentiations[:slice_center])
-   best_activations = good_activations[-1]
+   best_activations =  copy.deepcopy(good_activations[-1])
 
    
 ### PLANEAT IS APPLIED ACCORDING TO THE SPECIFIED POLICY, STRATEGY, AND PROBABILITY CONFIGURATION:
@@ -302,10 +300,10 @@ def evolver(weights,
    epsilon = cp.finfo(float).eps
 
    child_W = cp.copy(bad_weights)
-   child_act = bad_activations.copy()
+   child_act = copy.deepcopy(bad_activations)
 
    mutated_W = cp.copy(bad_weights)
-   mutated_act = bad_activations.copy()
+   mutated_act = copy.deepcopy(bad_activations)
 
 
    for i in range(len(bad_weights)):
@@ -364,9 +362,8 @@ def evolver(weights,
             
       if bar_status: progress.update(1)
 
-   if save_best_genome:
-      child_W[-1] = best_weight
-      child_act[-1] = best_activations
+   child_W[0] = best_weight
+   child_act[0] = best_activations
 
    weights = cp.vstack((child_W, mutated_W))
    activation_potentiations = child_act + mutated_act
@@ -394,13 +391,13 @@ def evolver(weights,
       print("  ACTIVATION SELECTION RATE (THRESHOLD VALUE FOR SINGLE CROSS OVER):", str(activation_selection_rate) + '\n')
       
       print("*** Performance ***")
-      print("  MAX REWARD: ", str(cp.round(max(fitness), 2)))
-      print("  MEAN REWARD: ", str(cp.round(cp.mean(fitness), 2)))
-      print("  MIN REWARD: ", str(cp.round(min(fitness), 2)) + '\n')
+      print("  MAX FITNESS: ", str(cp.round(max(fitness)  if target_fitness == 'max' else min(fitness), 2)))
+      print("  MEAN FITNESS: ", str(cp.round(cp.mean(fitness), 2)))
+      print("  MIN FITNESS: ", str(cp.round(min(fitness) if target_fitness == 'max' else max(fitness), 2)) + '\n')
 
       print("  BEST GENOME ACTIVATION LENGTH: ", str(len(activation_potentiations)))
-      print("  BEST GENOME INDEX: ", str(len(weights)-1))
-      print("  NOTE: Genomes are always sorted from the least successful to the most successful according to their performance ranking. Therefore, the genome at the last index is the king of the previous generation. " + '\n')
+      print("  BEST GENOME INDEX: ", str(0))
+      print("  NOTE: The returned genome at the first index is the best of the previous generation." + '\n')
       
 
    return weights, activation_potentiations

{pyerualjetwork-4.2.5.dist-info → pyerualjetwork-4.2.6b1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: pyerualjetwork
-Version: 4.2.5
+Version: 4.2.6b1
 Summary: PyerualJetwork is a machine learning library supported with GPU(CUDA) acceleration written in Python for professionals and researchers including with PLAN algorithm, PLANEAT algorithm (genetic optimization). Also includes data pre-process and memory manegament
 Author: Hasan Can Beydili
 Author-email: tchasancan@gmail.com
@@ -38,7 +38,6 @@ GitHub Page: https://github.com/HCB06/PyerualJetwork
       Optimized for Visual Studio Code
       
       requires=[
-        'setuptools==75.6.0',
  	    'scipy==1.13.1',
 	    'tqdm==4.66.4',
 	    'seaborn==0.13.2',
@@ -52,8 +51,6 @@ GitHub Page: https://github.com/HCB06/PyerualJetwork
         ]
 
      matplotlib, seaborn, networkx (optional).
-     PyerualJetwork checks and install all dependencies with optional ones for every runing.
-     If your version is higher or lower, PyerualJetwork automaticly delete other versions and installs this versions.
           
 ##############################
 
@@ -61,7 +58,7 @@ ABOUT PYERUALJETWORK:
 
 PyerualJetwork is a machine learning library written in Python for professionals, incorporating advanced, unique, new, and modern techniques with optimized GPU acceleration. Its most important component is the PLAN (Potentiation Learning Artificial Neural Network) https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4862342. (THIS ARTICLE IS FIRST VERSION OF PLAN.) MODERN VERSION OF PLAN: https://github.com/HCB06/PyerualJetwork/blob/main/Welcome_to_PLAN/PLAN.pdf
 Both the PLAN algorithm and the PyerualJetwork library were created by Author, and all rights are reserved by Author.
-PyerualJetwork is free to use for commercial business and individual users. PyerualJetwork is written in fully functional programming with non-oop elements. PyerualJetwork consists of many functions that complement each other, which facilitates the learning process and debugging during use.
+PyerualJetwork is free to use for commercial business and individual users.
 As of 12/21/2024, the library includes PLAN and PLANEAT module, but other machine learning modules are expected to be added in the future.
 
 PyerualJetwork ready for both eager execution(like PyTorch) and static graph(like Tensorflow) concepts because PyerualJetwork using only functions.

{pyerualjetwork-4.2.5.dist-info → pyerualjetwork-4.2.6b1.dist-info}/RECORD

@@ -1,4 +1,4 @@
-pyerualjetwork/__init__.py,sha256=fV7YBz3b2FZMKUupZAxBk4wWAI7DPML7Xst0KZaosFA,639
+pyerualjetwork/__init__.py,sha256=2ptsYxeF5I7fBMiVaPiz1IvDHgbuLch-ANuiLsreL_8,641
 pyerualjetwork/activation_functions.py,sha256=WWOdMd5pI6ZKe-ieKCIsKAYPQODHuXYxx7tzhA5xjes,11767
 pyerualjetwork/activation_functions_cuda.py,sha256=KmXJ5Cdig46XAMYakXFPEOlxSxtFJjD21-i3nGtxPjE,11807
 pyerualjetwork/data_operations.py,sha256=pb5CqJ0Th6fCjTNMCtqQMiwH3KezTxAijacglsKUxmY,14730
@@ -13,12 +13,12 @@ pyerualjetwork/model_operations.py,sha256=RKqnh7-MByFosxqme4q4jC1lOndX26O-OVXYV6
 pyerualjetwork/model_operations_cuda.py,sha256=XnKKq54ZLaqCm-NaJ6d8IToACKcKg2Ttq6moowVRRWo,13365
 pyerualjetwork/plan.py,sha256=UzCTFCA9cTv9ITCtsqfJ1g02rCMyescoIV6j1amvYGw,32134
 pyerualjetwork/plan_cuda.py,sha256=hpXZl3h7B1qAVYW-gZebwKMZd4-ftAZ-u05teOJjsno,33525
-pyerualjetwork/planeat.py,sha256=4XcmQhMHXA6hUWsDZXC2T3I18BeSP4V-GmPYToGR0kg,39638
-pyerualjetwork/planeat_cuda.py,sha256=xaDqH0kWwkmjx-YrBIuLoE1G26qk6rjuOvkH8oRWqyI,39598
+pyerualjetwork/planeat.py,sha256=Z1GkhcD-zIQrSy8HY6ywT4xz6hM7HTKVJewMaFl9_k0,39471
+pyerualjetwork/planeat_cuda.py,sha256=-uRgs4fQ0Zk7urDKDqvuWcsE5RJ6tXghGgt_pdcwPl4,39445
 pyerualjetwork/ui.py,sha256=wu2BhU1k-w3Kcho5Jtq4SEKe68ftaUeRGneUOSCVDjU,575
 pyerualjetwork/visualizations.py,sha256=1SKMZaJ80OD2qHUyMxW1IOv8zwmxzMPxclfbeq1Xr4g,28772
 pyerualjetwork/visualizations_cuda.py,sha256=KbMhfsLlxujy_i3QrwCf734Q-k6d7Zn_7CEbm3gzK9w,29186
-pyerualjetwork-4.2.5.dist-info/METADATA,sha256=jKYtON123TeRvm_ZF_Be0Jjki4e7pc-JLCWk6bnkfMQ,7912
-pyerualjetwork-4.2.5.dist-info/WHEEL,sha256=2wepM1nk4DS4eFpYrW1TTqPcoGNfHhhO_i5m4cOimbo,92
-pyerualjetwork-4.2.5.dist-info/top_level.txt,sha256=BRyt62U_r3ZmJpj-wXNOoA345Bzamrj6RbaWsyW4tRg,15
-pyerualjetwork-4.2.5.dist-info/RECORD,,
+pyerualjetwork-4.2.6b1.dist-info/METADATA,sha256=UV_m504Bd7zwKJ0WadzUeSdFqhPRsxm5jniDDDhEl1w,7454
+pyerualjetwork-4.2.6b1.dist-info/WHEEL,sha256=2wepM1nk4DS4eFpYrW1TTqPcoGNfHhhO_i5m4cOimbo,92
+pyerualjetwork-4.2.6b1.dist-info/top_level.txt,sha256=BRyt62U_r3ZmJpj-wXNOoA345Bzamrj6RbaWsyW4tRg,15
+pyerualjetwork-4.2.6b1.dist-info/RECORD,,