metacountregressor 0.1.73__py3-none-any.whl → 0.1.83__py3-none-any.whl

metacountregressor/metaheuristics.py

@@ -15,8 +15,14 @@ from datetime import datetime
 import numpy as np
 import pandas as pd
 
-from .pareto_file import Pareto, Solution
-from .solution import ObjectiveFunction
+try:
+    from .pareto_file import Pareto, Solution
+    from .solution import ObjectiveFunction
+except:
+    print('Exception relative import')
+    from pareto_file import Pareto, Solution
+    from solution import ObjectiveFunction
+
 
 HarmonySearchResults = namedtuple('HarmonySearchResults',
                                   ['elapsed_time', 'best_harmony', 'best_fitness', 'harmony_memories',
@@ -32,7 +38,7 @@ DifferentialEvolutionMulti = namedtuple('DifferentialEvolutionMulti',
                                         ['elapsed_time', 'best_solutions', 'population_solutions'])
 
 
-#helper function to plot the bic
+# helper function to plot the bic
 def _plot(x, y, z, xlabel=None, ylabel=None, zlabel=None, filename=None):
     from matplotlib import pyplot as plt
 
@@ -54,7 +60,8 @@ def _plot(x, y, z, xlabel=None, ylabel=None, zlabel=None, filename=None):
         plt.savefig('bic.png')
         plt.show()
 
-#helper function to grab dictionary means
+
+# helper function to grab dictionary means
 def dict_mean(dict_list,
               ignore=None):
     if ignore is None:
@@ -65,7 +72,7 @@ def dict_mean(dict_list,
             mean_dict[key] = sum(d[key] for d in dict_list) / len(dict_list)
         return mean_dict
     else:
-
+        mean_dict = {}
         for key in dict_list[0].keys():
             if key in ignore:
                 continue
@@ -204,8 +211,7 @@ def different_evolution(objective_function, initial_slns=None, **kwargs):
 
 
 def differential_evolution(objective_function, initial_slns=None, **kwargs):
-    if not isinstance(objective_function, ObjectiveFunction):
-        raise Exception
+
     start = datetime.now()
 
     man = None
@@ -220,11 +226,8 @@ def differential_evolution(objective_function, initial_slns=None, **kwargs):
             de = Mutlithreaded_Meta(objective_function, **kwargs)
             best, pare = de.run_mp(initial_slns=initial_slns, mod_init=man)
         else:
-
             print('Not Multi Threaded')
-
             de = DifferentialEvolution(objective_function, **kwargs)
-
             best, pare = de.differential_evolution_run(initial_slns=initial_slns, mod_init=man)
 
         end = datetime.now()
@@ -393,20 +396,19 @@ class DifferentialEvolution(object):
     """
 
     def __init__(self, objective_function, **kwargs):
-
-        if not isinstance(objective_function, ObjectiveFunction):
-            raise TypeError
         self._obj_fun = objective_function
         if self._obj_fun._obj_1 is None:
-            raise Exception
+            print('no objective found, automatically selecting BIC')
+            self._obj_fun._obj_1 = 'bic'
 
         self._pop_size = kwargs.get('_pop_size', 20)
+        print('Population size is', self._pop_size)
         if not isinstance(self._pop_size, int):
             raise ValueError("_pop_size must be an integer")
         elif self._pop_size <= 3:
             raise ValueError("_pop_size must be greater than 4")
 
-        self.F = kwargs.get('_AI', 2)  # mustation scale
+        self.F = kwargs.get('_AI', 2)  # mutation scale
         self.iter = kwargs.get('_max_iter', 10000)
         self.cr = kwargs.get('_crossover_perc') or kwargs.get('_cr', 0.2)
         self.instance_number = str(kwargs.get('instance_number', 1))
@@ -415,12 +417,9 @@ class DifferentialEvolution(object):
         self._population = list()
         self.it_process = 1
         if objective_function.is_multi:
-
             self.obj_1 = objective_function._obj_1
             self.obj_2 = objective_function._obj_2
-
             self.pf = Pareto(self.obj_1, self.obj_2, True)
-
             self._pareto_population = list()
         else:
             self.obj_1 = objective_function._obj_1
@@ -555,7 +554,6 @@ class DifferentialEvolution(object):
         average_iteration = 0
         iterations_without_improvement = 0
 
-
         start_time = datetime.now()
         if self._obj_fun.use_random_seed():
             self._obj_fun.set_random_seed()
@@ -621,7 +619,7 @@ class DifferentialEvolution(object):
                                                                                      1)
 
                     if len(self._pareto_population) == 1:
-                        print('the size of the population is only 1')
+                        print('Pareto Population Size is only 1')
                     if self.pf.check_dominance([obj_trial[self.pf.obj_key_1], obj_trial[self.pf.obj_key_2]],
                                                [self._population[j][self.pf.obj_key_1], self._population[j][
                                                    self.pf.obj_key_2]]):  # if solution dominates existing #FIXME some error here true but not entering
@@ -790,7 +788,7 @@ class SimulatedAnnealing(object):
         self.accept = 0
         self.profiler = []
         self.update_t = self.cooling_linear_m
-        self.get_direcotory()
+        self.get_directory()
         self._crossover_perc = float(kwargs.get('_crossover_perc', 0.2)) or float(kwargs.get('_cr', 0.2))
         self._obj_fun = objective_function
         if objective_function.is_multi:  # TODO Define more specific objectives in the intialiser
@@ -804,7 +802,7 @@ class SimulatedAnnealing(object):
             self.pf = Pareto(self.obj_1, self.obj_2, False)
             self._sa_memory = list()
 
-    def get_direcotory(self):
+    def get_directory(self):
         # checking if the directory demo_folder2 
         # exist or not.
         if not os.path.isdir(self.instance_number):
@@ -949,10 +947,9 @@ class SimulatedAnnealing(object):
             output_step.append(a)
             output_energy.append(b)
             output_best_energy.append(c)
-    
 
-        return {'elapsed_time': elapsed_time, 'Iteration': iteration}  #TODO make this reachavble
-        #return output_step, output_energy, output_best_energy, self.best_energy, self.best_struct
+        return {'elapsed_time': elapsed_time, 'Iteration': iteration}  # TODO make this reachavble
+        # return output_step, output_energy, output_best_energy, self.best_energy, self.best_struct
 
     def _get_neighbour(self, current, mutations=None):
         neighbour = copy.deepcopy(current)
@@ -963,7 +960,6 @@ class SimulatedAnnealing(object):
 
         # number of paramaters in the model #TODO get the last value if 2
 
-
         num_of_changeablePARMs = 0
 
         self._obj_fun.nbr_routine(current)
@@ -1009,7 +1005,7 @@ class SimulatedAnnealing(object):
                     elif num_of_changeablePARMs == 0:
                         rdm_i = random.choice(range(len(prmVect)))
                         if self._obj_fun.get_num_discrete_values(rdm_i) <= 1:
-                            print('hold gimct')
+                            print('retry')
 
                     while self._obj_fun.get_num_discrete_values(rdm_i) <= 1:
                         rdm_i = random.randint(0, self._obj_fun.get_num_parameters() - 1)
@@ -1051,7 +1047,7 @@ class SimulatedAnnealing(object):
                             get_rdm_j = random.randint(0, self._obj_fun.get_num_discrete_values(rdm_i) - 1)
                             if (self._obj_fun.get_num_discrete_values(
                                     rdm_i) - 1) < 1:  # TODO: remove this is just a test
-                                print('fucking fix this sln algorithm')
+                               
                                 break
                             new_nbr_i = self._obj_fun.get_value(rdm_i, get_rdm_j)
                             neighbour[rdm_i] = new_nbr_i
@@ -1242,14 +1238,25 @@ class HarmonySearch(object):
             Initialize HS with the specified objective function. Note that this objective function must implement ObjectiveFunctionInterface.
         """
         self._obj_fun = objective_function
+        ## NEW CODE, TRYING TO EXCTACT OUT THE PARAMATERS
+        self._hms = kwargs.get('_hms', 20)
+        self._par = kwargs.get('_par', .30)
+        self.F = kwargs.get('_AI', 2)  # mutation scale
+        self.iter = kwargs.get('_max_iter', 10000)
+        self.cr = kwargs.get('_crossover_perc') or kwargs.get('_cr', 0.2)
+        self.instance_number = str(kwargs.get('instance_number', 1))
+
 
+
+        # for printing basics metrics
+        self.print_verbose = kwargs.get('verbose', False)
         # harmony_memory stores the best hms harmonies
         self._harmony_memory = list()
         # harmony_history stores all hms harmonies every nth improvisations (i.e., one 'generation')
         self._harmony_history = list()
         # saves the best fitness
         self.instance_number = str(objective_function.instance_number)
-        self.get_direcotory()
+        self.get_directory()
         self._harmony_trace_best = list()
         self._harmony_trace_incumbent = list()
         if self._obj_fun.is_multi:  # TODO Define more specific objectives in the intialiser
@@ -1265,7 +1272,7 @@ class HarmonySearch(object):
 
             self.pf = Pareto(self.obj_1, self.obj_2, False)
 
-    def get_direcotory(self):
+    def get_directory(self):
         # checking if the directory demo_folder2 
         # exist or not.
         if not os.path.isdir(self.instance_number):
@@ -1294,7 +1301,7 @@ class HarmonySearch(object):
     def does_it_appear(self, new):
         for d in self._harmony_memory:
             if self.mixed_list_chescker(d['layout'], new):
-                #print('same sln appears in population')
+                # print('same sln appears in population')
                 return True
 
         return False
@@ -1314,6 +1321,7 @@ class HarmonySearch(object):
             self._obj_fun.set_random_seed()
         # fill harmony_memory using random parameter values by default, but with initial_harmonies if provided
         self._initialize(initial_harmonies, mod_init)
+        if self.print_verbose: print('Initialization complete')
         if self.pf.get_objective_is_multi():
             self._pareto_harmony_memory = self.pf.non_dominant_sorting(self._harmony_memory)
             generation_best = self._pareto_harmony_memory[0]
@@ -1333,6 +1341,9 @@ class HarmonySearch(object):
                 iterations_without_improvement < self._obj_fun.get_termination_iter()):
             # generate new harmony
             elapsed_time = (datetime.now() - start_time).total_seconds()
+            if self.print_verbose:
+                print('Time: ', elapsed_time)
+                print('Improvisation: ', num_imp)
             harmony = list()
 
             for i in range(0, self._obj_fun.get_num_parameters()):
@@ -1374,6 +1385,7 @@ class HarmonySearch(object):
                                                                          self.pf.get_objective_is_multi())
             num_imp += 1
             if iterations_without_improvement == 0:  # if there is any kind of improvement updae the logs
+                if self.print_verbose: print('improvement found at improvisation', num_imp)
                 if self.pf.get_objective_is_multi():
                     try:
                         logger(num_imp, fitness, self._harmony_memory, True, self.get_instance_name(),

metacountregressor/setup.py

@@ -8,7 +8,7 @@ with codecs.open("README.rst", encoding='utf8') as fh:
 setuptools.setup(name='metacountregressor',
                  version='0.1.63',
                  description='Extensions for a Python package for \
-                              GPU-accelerated estimation of mixed logit models.',
+                             estimation of data count models.',
                  long_description=long_description,
                  long_description_content_type="text/x-rst",
                  url='https://github.com/zahern/CountDataEstimation',
@@ -20,5 +20,6 @@ setuptools.setup(name='metacountregressor',
                  python_requires='>=3.10',
                  install_requires=[
                      'numpy>=1.13.1',
-                     'scipy>=1.0.0'
+                     'scipy>=1.0.0',
+                     'latextable'
                  ])