gradient_free_optimizers.optimizers.grid.grid_search.GridSearchOptimizer.__init__() - Code Metrics - Inspection of "Merge branch 'dev'" - SimonBlanke/Gradient-Free-Optimizers - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 502a6e...660aa4 )

by Simon

created 2024-05-09 13:43 UTC

GridSearchOptimizer.init() A

↳ Parent: gradient_free_optimizers.optimizers.grid.grid_search

Complexity

Conditions

Size

Total Lines	17
Code Lines	12

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	3
eloc	12
nop	5
dl	0
loc	17
rs	9.8
c	0
b	0
f	0

# Author: Simon Blanke
# Email: [email protected]
# License: MIT License

from ..base_optimizer import BaseOptimizer
from .diagonal_grid_search import DiagonalGridSearchOptimizer
from .orthogonal_grid_search import OrthogonalGridSearchOptimizer


class GridSearchOptimizer(BaseOptimizer):
    name = "Grid Search"
    _name_ = "grid_search"
    __name__ = "GridSearchOptimizer"

    optimizer_type = "global"
    computationally_expensive = False

    def __init__(self, *args, step_size=1, direction="diagonal", **kwargs):
        super().__init__(*args, **kwargs)

        self.step_size = step_size
        self.direction = direction

        if direction == "orthogonal":
            self.grid_search_opt = OrthogonalGridSearchOptimizer(
                *args, step_size=step_size, **kwargs
            )
        elif direction == "diagonal":
            self.grid_search_opt = DiagonalGridSearchOptimizer(
                *args, step_size=step_size, **kwargs
            )
        else:
            msg = ""
            raise Exception(msg)

    @BaseOptimizer.track_new_pos
    def iterate(self):
        return self.grid_search_opt.iterate()

    @BaseOptimizer.track_new_score
    def evaluate(self, score_new):
        self.grid_search_opt.evaluate(score_new)


1			# Author: Simon Blanke
2			# Email: [email protected]
3			# License: MIT License
4
5			from ..base_optimizer import BaseOptimizer
6			from .diagonal_grid_search import DiagonalGridSearchOptimizer
7			from .orthogonal_grid_search import OrthogonalGridSearchOptimizer
8
9
10			class GridSearchOptimizer(BaseOptimizer):
11			name = "Grid Search"
12			_name_ = "grid_search"
13			__name__ = "GridSearchOptimizer"
14
15			optimizer_type = "global"
16			computationally_expensive = False
17
18			def __init__(self, args, step_size=1, direction="diagonal", *kwargs):
19			super().__init__(args, *kwargs)
20
21			self.step_size = step_size
22			self.direction = direction
23
24			if direction == "orthogonal":
25			self.grid_search_opt = OrthogonalGridSearchOptimizer(
26			args, step_size=step_size, *kwargs
27			)
28			elif direction == "diagonal":
29			self.grid_search_opt = DiagonalGridSearchOptimizer(
30			args, step_size=step_size, *kwargs
31			)
32			else:
33			msg = ""
34			raise Exception(msg)
35
36			@BaseOptimizer.track_new_pos
37			def iterate(self):
38			return self.grid_search_opt.iterate()
39
40			@BaseOptimizer.track_new_score
41			def evaluate(self, score_new):
42			self.grid_search_opt.evaluate(score_new)
43

SimonBlanke / Gradient-Free-Optimizers

Push — master ( 502a6e...660aa4 )

GridSearchOptimizer.__init__() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

GridSearchOptimizer.init() A