RandomGreedy(cost_fn='memory-removed-jitter', temperature=1.0, rel_temperature=True, nbranch=8, **kwargs)¶
cost_fn (callable, optional) – A function that returns a heuristic ‘cost’ of a potential contraction with which to sort candidates. Should have signature
cost_fn(size12, size1, size2, k12, k1, k2).
temperature (float, optional) – When choosing a possible contraction, its relative probability will be proportional to
exp(-cost / temperature). Thus the larger
temperatureis, the further random paths will stray from the normal ‘greedy’ path. Conversely, if set to zero, only paths with exactly the same cost as the best at each step will be explored.
rel_temperature (bool, optional) – Whether to normalize the
temperatureat each step to the scale of the best cost. This is generally beneficial as the magnitude of costs can vary significantly throughout a contraction. If False, the algorithm will end up branching when the absolute cost is low, but stick to the ‘greedy’ path when the cost is high - this can also be beneficial.
nbranch (int, optional) – How many potential paths to calculate probability for and choose from at each step.
kwargs – Supplied to RandomOptimizer.
__init__(cost_fn='memory-removed-jitter', temperature=1.0, rel_temperature=True, nbranch=8, **kwargs)¶
Initialize self. See help(type(self)) for accurate signature.
__call__(inputs, output, size_dict, memory_limit)
Call self as a function.
Implement delattr(self, name).
Default dir() implementation.
Default object formatter.
Return getattr(self, name).
__init__([cost_fn, temperature, …])
This method is called when a class is subclassed.
Create and return a new object.
Helper for pickle.
Helper for pickle.
__setattr__(name, value, /)
Implement setattr(self, name, value).
Size of object in memory, in bytes.
Abstract classes can override this to customize issubclass().
Utility that stateful optimizers can use to ensure they are not called with different contractions across separate runs.
_gen_results_parallel(repeats, trial_fn, args)
Lazily generate results from an executor without submitting all jobs at once.
setup(inputs, output, size_dict)
list of weak references to the object (if defined)
The function that chooses which contraction to take - make this a property so that
The best path found so far.