lale.search.search_space module¶

class lale.search.search_space.SearchSpace(default: Optional[Any] = None)[source]¶

Bases: object

default() → Optional[Any][source]¶: Return an optional default value, if None. if not None, the default value should be in the search space

classmethod focused_path_string(path: List[SearchSpace]) → str[source]¶

str_with_focus(path: Optional[List[SearchSpace]] = None, default: Optional[Any] = None) → Union[str, Any][source]¶: Given a path list, returns a string for the focused path. If the path is None, returns everything, without focus. If the path does not start with self, returns None

class lale.search.search_space.SearchSpaceArray(prefix: Optional[List[SearchSpace]], minimum: int = 0, *, maximum: int, additional: Optional[SearchSpace] = None, is_tuple=False)[source]¶

Bases: SearchSpace

items(max_elts: Optional[int] = None) → Iterable[SearchSpace][source]¶

class lale.search.search_space.SearchSpaceBool(pgo: Optional[Union[FrequencyDistribution, Iterable[Tuple[Any, int]]]] = None, default: Optional[Any] = None)[source]¶

Bases: SearchSpaceEnum

pgo: Optional[FrequencyDistribution]¶

vals: List[Any]¶

class lale.search.search_space.SearchSpaceConstant(v, pgo: Optional[Union[FrequencyDistribution, Iterable[Tuple[Any, int]]]] = None)[source]¶

Bases: SearchSpaceEnum

pgo: Optional[FrequencyDistribution]¶

vals: List[Any]¶

class lale.search.search_space.SearchSpaceDict(d: Dict[str, SearchSpace])[source]¶: Bases: SearchSpace

class lale.search.search_space.SearchSpaceEmpty[source]¶: Bases: SearchSpace

class lale.search.search_space.SearchSpaceEnum(vals: Iterable[Any], pgo: Optional[Union[FrequencyDistribution, Iterable[Tuple[Any, int]]]] = None, default: Optional[Any] = None)[source]¶

Bases: SearchSpacePrimitive

pgo: Optional[FrequencyDistribution]¶

vals: List[Any]¶

exception lale.search.search_space.SearchSpaceError(sub_path: Any, message: Optional[str] = None)[source]¶

Bases: VisitorPathError

get_message_str() → str[source]¶

path_string() → str[source]¶

class lale.search.search_space.SearchSpaceNumber(minimum=None, exclusiveMinimum: bool = False, maximum=None, exclusiveMaximum: bool = False, discrete: bool = False, distribution='uniform', pgo: Optional[Union[FrequencyDistribution, Iterable[Tuple[Any, int]]]] = None, default: Optional[Any] = None)[source]¶

Bases: SearchSpacePrimitive

discrete: bool¶

distribution: str¶

exclusiveMaximum: bool¶

exclusiveMinumum: bool¶

getInclusiveMax() → Optional[float][source]¶: Return the maximum as an inclusive maximum (exclusive maxima are adjusted accordingly)

getInclusiveMin() → Optional[float][source]¶: Return the maximum as an inclusive minimum (exclusive minima are adjusted accordingly)

maximum: Optional[float]¶

minimum: Optional[float]¶

pgo: Optional[FrequencyDistribution]¶

class lale.search.search_space.SearchSpaceObject(longName: str, keys: List[str], choices: Iterable[Any])[source]¶: Bases: SearchSpace

class lale.search.search_space.SearchSpaceOperator(sub_space: SearchSpace, default: Optional[Any] = None)[source]¶

Bases: SearchSpace

sub_space: SearchSpace¶

class lale.search.search_space.SearchSpacePrimitive(default: Optional[Any] = None)[source]¶: Bases: SearchSpace

class lale.search.search_space.SearchSpaceProduct(sub_spaces: List[Tuple[str, SearchSpace]], default: Optional[Any] = None)[source]¶

Bases: SearchSpace

get_indexed_spaces() → Iterable[Tuple[str, int, SearchSpace]][source]¶

sub_spaces: List[Tuple[str, SearchSpace]]¶

class lale.search.search_space.SearchSpaceSum(sub_spaces: List[SearchSpace], default: Optional[Any] = None)[source]¶

Bases: SearchSpace

sub_spaces: List[SearchSpace]¶

lale.search.search_space.should_print_search_space(*s: str)[source]¶