Module Expr Str Assign NameStore Str Assign NameStore Str Assign NameStore Str Import alias Import alias identifier ImportFrom alias alias alias alias alias alias alias alias alias ImportFrom alias ImportFrom alias alias Assign NameStore Call AttributeLoad NameLoad attr NameLoad ClassDef bases NameLoad body Expr Str FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam defaults Num Num body Expr Str Expr Call AttributeLoad NameLoad attr NameLoad NameLoad NameLoad keyword NameLoad Assign AttributeStore NameLoad attr NameLoad Assign AttributeStore NameLoad attr NameLoad Assign NameStore Dict For NameStore AttributeLoad NameLoad attr body Assign NameStore SubscriptLoad NameLoad Index Str Assign NameStore Call AttributeLoad NameLoad attr SubscriptLoad NameLoad Index Str SubscriptLoad NameLoad Index Str If CompareIs NameLoad NameLoad body Assign NameStore Call NameLoad Str orelse Assign NameStore Call NameLoad NameLoad Assign SubscriptStore NameLoad Index NameLoad TupleLoad NameLoad NameLoad Assign AttributeStore NameLoad attr Call NameLoad Call AttributeLoad NameLoad attr Assign AttributeStore NameLoad attr Call AttributeLoad NameLoad attr ListComp NameLoad comprehension TupleStore NameStore TupleStore NameStore NameStore AttributeLoad NameLoad attr Assign AttributeStore NameLoad attr Call AttributeLoad NameLoad attr ListComp NameLoad comprehension TupleStore NameStore TupleStore NameStore NameStore AttributeLoad NameLoad attr Assign AttributeStore NameLoad attr Call NameLoad Call NameLoad AttributeLoad NameLoad attr AttributeLoad NameLoad attr Assign TupleStore AttributeStore NameLoad attr AttributeStore NameLoad attr Call NameLoad ListComp SubscriptLoad NameLoad Index Str comprehension TupleStore NameStore TupleStore NameStore NameStore AttributeLoad NameLoad attr keyword Call AttributeLoad AttributeLoad NameLoad attr attr Assign AttributeStore NameLoad attr ListLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore Call NameLoad SubscriptLoad AttributeLoad NameLoad attr Index NameLoad Return BinOpDiv Num BinOpAdd Num BinOpMult NameLoad AttributeLoad NameLoad attr decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults body Expr Str Assign NameStore SubscriptLoad AttributeLoad NameLoad attr Index NameLoad Assign NameStore SubscriptLoad AttributeLoad NameLoad attr Index NameLoad Assign NameStore ListComp SubscriptLoad AttributeLoad NameLoad attr Index NameLoad comprehension NameStore NameLoad If CompareEq NameLoad Num body Assign NameStore Call NameLoad NameLoad For NameStore AttributeLoad NameLoad attr body If CompareIn NameLoad NameLoad body Assign NameStore Call AttributeLoad NameLoad attr NameLoad Assign NameStore TupleLoad SubscriptLoad NameLoad Index NameLoad NameLoad SubscriptLoad NameLoad Index NameLoad Return NameLoad Assign NameStore BinOpSub Call AttributeLoad AttributeLoad NameLoad attr attr BinOpDiv Num AttributeLoad NameLoad attr keyword NameLoad Num Assign NameStore Call AttributeLoad Call AttributeLoad NameLoad attr NameLoad Num BinOpSub Call NameLoad NameLoad Num attr Str Assign NameStore SubscriptLoad Call AttributeLoad NameLoad attr NameLoad Index NameLoad Assign NameStore SubscriptLoad Call AttributeLoad NameLoad attr NameLoad Index NameLoad Assign NameStore SubscriptLoad Call AttributeLoad NameLoad attr NameLoad Index NameLoad Assign NameStore SubscriptLoad Call AttributeLoad NameLoad attr NameLoad Index NameLoad If CompareEq NameLoad Num body Expr Call AttributeLoad AttributeLoad NameLoad attr attr Call NameLoad NameLoad Return TupleLoad NameLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam defaults body Expr Str Assign NameStore Call NameLoad SubscriptLoad AttributeLoad NameLoad attr Index NameLoad If CompareGt NameLoad Num body Assign NameStore SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Assign TupleStore NameStore NameStore NameStore Call AttributeLoad NameLoad attr NameLoad keyword NameLoad TryExcept body Assign NameStore Call NameLoad NameLoad BinOpMod Str AttributeLoad NameLoad attr handlers ExceptHandler type NameLoad body Raise Call NameLoad Str AttributeLoad NameLoad attr Return Call NameLoad NameLoad NameLoad NameLoad NameLoad NameLoad orelse Return Call AttributeLoad NameLoad attr NameLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam NameParam NameParam NameParam defaults NameLoad NameLoad NameLoad body Expr Str If NameLoad body Assign NameStore Call AttributeLoad NameLoad attr NameLoad orelse Assign NameStore NameLoad Assign NameStore SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Assign NameStore SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Assign NameStore BinOpMult BinOpSub NameLoad NameLoad Call AttributeLoad NameLoad attr NameLoad Assign NameStore BinOpMult Num NameLoad Assign NameStore BinOpAdd NameLoad NameLoad Assign NameStore BinOpSub NameLoad NameLoad Assign NameStore Call AttributeLoad NameLoad attr NameLoad NameLoad NameLoad If NameLoad body Return Call NameLoad keyword BinOpSub NameLoad NameLoad keyword BinOpAdd NameLoad NameLoad keyword AttributeLoad NameLoad attr keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str orelse Return Call NameLoad keyword BinOpSub NameLoad NameLoad keyword BinOpAdd NameLoad NameLoad keyword AttributeLoad NameLoad attr keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str decorator_list FunctionDef arguments args NameParam defaults vararg kwarg body Return Call AttributeLoad NameLoad attr keyword NameLoad keyword NameLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam defaults vararg kwarg body Return Call AttributeLoad NameLoad attr keyword NameLoad keyword NameLoad keyword NameLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam defaults vararg kwarg body Return Call AttributeLoad NameLoad attr keyword NameLoad keyword NameLoad keyword NameLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam defaults body Expr Str Assign NameStore SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Assign NameStore Call AttributeLoad NameLoad attr NameLoad If AttributeLoad NameLoad attr body Assign NameStore BinOpDiv Call AttributeLoad NameLoad attr NameLoad keyword NameLoad Call NameLoad AttributeLoad NameLoad attr orelse Assign NameStore Call AttributeLoad NameLoad attr NameLoad Assign NameStore Num Assign NameStore Call AttributeLoad NameLoad attr NameLoad Assign NameStore BinOpAdd BinOpMult BinOpSub Num NameLoad NameLoad BinOpMult NameLoad BinOpDiv Num NameLoad Assign NameStore Call NameLoad keyword NameLoad keyword NameLoad keyword AttributeLoad NameLoad attr keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam defaults body Expr Str Assign NameStore SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str If CompareEq NameLoad Num body Return ListLoad Assign NameStore Call AttributeLoad NameLoad attr NameLoad Assign NameStore NameStore Call AttributeLoad NameLoad attr SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str If CompareEq AttributeLoad NameLoad attr Num body If CompareNotIn Call NameLoad NameLoad TupleLoad Num Call NameLoad NameLoad body Print NameLoad Print NameLoad Print AttributeLoad Call AttributeLoad NameLoad attr NameLoad attr Assert CompareIn Call NameLoad NameLoad TupleLoad Num Call NameLoad NameLoad orelse Assert CompareEq AttributeLoad NameLoad attr Num Assign NameStore SubscriptLoad NameLoad ExtSlice Index AttributeLoad NameLoad attr Slice Assign NameStore SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str If AttributeLoad NameLoad attr body Assign NameStore BinOpDiv Call AttributeLoad NameLoad attr NameLoad keyword NameLoad Call NameLoad AttributeLoad NameLoad attr Assign NameStore Call AttributeLoad NameLoad attr NameLoad orelse Assign NameStore Call AttributeLoad NameLoad attr NameLoad Assign NameStore Num Assign NameStore BinOpAdd BinOpMult BinOpSub Num NameLoad NameLoad BinOpMult NameLoad NameLoad Assert CompareEq AttributeLoad NameLoad attr Num Assign NameStore Call NameLoad keyword NameLoad keyword AttributeLoad NameLoad attr keyword NameLoad If CompareEq AttributeLoad NameLoad attr Num body Assert CompareEq Call NameLoad NameLoad Num Return SubscriptLoad NameLoad Index Num orelse Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam defaults body Expr Str Return Call NameLoad keyword NameLoad keyword BinOpMult SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Call AttributeLoad NameLoad attr NameLoad keyword AttributeLoad NameLoad attr keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam defaults body Expr Str Return Call NameLoad keyword Call AttributeLoad NameLoad attr NameLoad keyword BinOpMult SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Call AttributeLoad NameLoad attr NameLoad keyword AttributeLoad NameLoad attr keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam defaults body Expr Str Return Call NameLoad keyword Call AttributeLoad NameLoad attr BinOpAdd Num NameLoad keyword BinOpMult SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Call AttributeLoad NameLoad attr NameLoad keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str keyword AttributeLoad NameLoad attr keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam defaults body Expr Str Return Call NameLoad keyword NameLoad keyword BinOpMult SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str Call AttributeLoad NameLoad attr NameLoad keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str keyword AttributeLoad NameLoad attr keyword SubscriptLoad NameLoad Index SubscriptLoad AttributeLoad NameLoad attr Index Str decorator_list decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam defaults vararg kwarg body Assign TupleStore NameStore NameLoad Return Call Call NameLoad NameLoad NameLoad NameLoad NameLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam defaults vararg kwarg body Return Call AttributeLoad Call NameLoad NameLoad NameLoad NameLoad NameLoad NameLoad attr NameLoad decorator_list
N/A N/A 
Annealing algorithm for hyperopt

Annealing is a simple but effective variant on random search that
takes some advantage of a smooth response surface.

The simple (but not overly simple) code of simulated annealing makes this file
a good starting point for implementing new search algorithms.

 N/A __authors__ James Bergstra N/A __license__ 3-clause BSD License N/A __contact__ github.com/hyperopt/hyperopt N/A logging N/A numpy np pyll.stochastic categorical normal lognormal qnormal qlognormal uniform loguniform quniform qloguniform base miscs_to_idxs_vals algobase SuggestAlgo ExprEvaluator N/A logger N/A N/A logging getLogger __name__ AnnealingAlgo N/A SuggestAlgo N/A N/A 
    This simple annealing algorithm begins by sampling from the prior,
    but tends over time to sample from points closer and closer to the best
    ones observed.

    In addition to the value of this algorithm as a baseline optimization
    strategy, it is a simple starting point for implementing new algorithms.

    # The Annealing Algorithm

    The annealing algorithm is to choose one of the previous trial points
    as a starting point, and then to sample each hyperparameter from a similar
    distribution to the one specified in the prior, but whose density is more
    concentrated around the trial point we selected.

    This algorithm is a simple variation on random search that leverages
    smoothness in the response surface.  The annealing rate is not adaptive.

    ## Choosing a Best Trial

    The algorithm formalizes the notion of "one of the best trials" by
    sampling a position from a geometric distribution whose mean is the
    `avg_best_idx` parameter.  The "best trial" is the trial thus selected
    from the set of all trials (`self.trials`).

    It may happen that in the process of ancestral sampling, we may find that
    the best trial at some ancestral point did not use the hyperparameter we
    need to draw.  In such a case, this algorithm will draw a new "runner up"
    best trial, and use that one as if it had been chosen as the best trial.

    The set of best trials, and runner-up best trials obtained during the
    process of choosing all hyperparameters is kept sorted by the validation
    loss, and at each point where the best trial does not define a
    required hyperparameter value, we actually go through all the list of
    runners-up too, before giving up and adding a new runner-up trial.


    ## Concentrating Prior Distributions

    To sample a hyperparameter X within a search space, we look at
    what kind of hyperparameter it is (what kind of distribution it's from)
    and the previous successful values of that hyperparameter, and make
    a new proposal for that hyperparameter independently of other
    hyperparameters (except technically any choice nodes that led us to use
    this current hyperparameter in the first place).

    For example, if X is a uniform-distributed hyperparameters drawn from
    `U(l, h)`, we look at the value `x` of the hyperparameter in the selected
    trial, and draw from a new uniform density `U(x - w/2, x + w/2)`, where w
    is related to the initial range, and the number of observations we have for
    X so far. If W is the initial range, and T is the number of observations
    we have, then w = W / (1 + T * shrink_coef).  If the resulting range would
    extend either below l or above h, we shift it to fit into the original
    bounds.

     __init__ N/A N/A self domain trials seed avg_best_idx shrink_coef N/A 2.0 0.1 N/A N/A 
        Parameters
        ----------
        avg_best_idx: float
            Mean of geometric distribution over which trial to explore around,
            selecting from trials sorted by score (0 is best)

        shrink_coef: float
            Rate of reduction in the size of sampling neighborhood as more
            points have been explored.
         N/A N/A N/A SuggestAlgo __init__ self domain trials seed seed N/A N/A self avg_best_idx avg_best_idx N/A N/A self shrink_coef shrink_coef N/A doc_by_tid N/A N/A doc N/A trials trials N/A N/A tid N/A doc N/A tid N/A loss N/A N/A domain loss N/A doc N/A result N/A doc N/A spec N/A N/A loss None N/A N/A loss N/A float inf N/A N/A loss N/A float loss N/A N/A doc_by_tid N/A tid N/A doc loss N/A N/A self tid_docs_losses N/A sorted N/A N/A doc_by_tid items N/A N/A self tids N/A N/A np asarray N/A t N/A N/A t N/A d l N/A self tid_docs_losses N/A N/A self losses N/A N/A np asarray N/A l N/A N/A t N/A d l N/A self tid_docs_losses N/A N/A self tid_losses_dct N/A dict N/A zip N/A self tids N/A self losses N/A N/A N/A self node_tids N/A self node_vals N/A miscs_to_idxs_vals N/A N/A d N/A misc N/A N/A tid N/A d l N/A self tid_docs_losses keys N/A N/A N/A domain params keys N/A N/A self best_tids N/A N/A shrinking N/A N/A self label N/A N/A N/A Return fraction of original search width

        Parameters
        ----------
        label: string
            the name of a hyperparameter
         N/A T N/A len N/A N/A self node_vals N/A label N/A N/A 1.0 N/A 1.0 N/A T N/A self shrink_coef N/A choose_ltv N/A N/A self label size N/A N/A N/A Returns (loss, tid, val) of best/runner-up trial
         N/A tids N/A N/A self node_tids N/A label N/A vals N/A N/A self node_vals N/A label N/A losses N/A N/A N/A self tid_losses_dct N/A tid N/A tid tids N/A N/A size 1 N/A N/A tid_set N/A set tids N/A tid N/A self best_tids N/A N/A N/A tid tid_set N/A N/A idx N/A N/A tids index tid N/A rval N/A N/A losses N/A idx tid N/A vals N/A idx N/A rval N/A good_idx N/A N/A N/A N/A self rng geometric N/A 1.0 N/A self avg_best_idx size size 1 N/A good_idx N/A N/A N/A N/A np clip good_idx 0 N/A N/A len tids 1 astype int32 N/A picks N/A N/A N/A np argsort losses N/A good_idx N/A picks_loss N/A N/A N/A np asarray losses N/A picks N/A picks_tids N/A N/A N/A np asarray tids N/A picks N/A picks_vals N/A N/A N/A np asarray vals N/A picks N/A N/A size 1 N/A N/A N/A N/A N/A self best_tids append N/A int picks_tids N/A N/A picks_loss picks_tids picks_vals N/A on_node_hyperparameter N/A N/A self memo node label N/A N/A N/A 
        Return a new value for one hyperparameter.

        Parameters:
        -----------

        memo - a partially-filled dictionary of node -> list-of-values
               for the nodes in a vectorized representation of the
               original search space.

        node - an Apply instance in the vectorized search space,
               which corresponds to a hyperparameter

        label - a string, the name of the hyperparameter


        Returns: a list with one value in it: the suggested value for this
        hyperparameter


        Notes
        -----

        This function works by delegating to self.hp_HPTYPE functions to
        handle each of the kinds of hyperparameters in hyperopt.pyll_utils.

        Other search algorithms can implement this function without
        delegating based on the hyperparameter type, but it's a pattern
        I've used a few times so I show it here.

         N/A n_observations N/A len N/A N/A self node_vals N/A label N/A N/A n_observations 0 N/A N/A size N/A memo N/A N/A N/A node arg N/A size N/A N/A loss tid val N/A N/A self choose_ltv label size size N/A N/A N/A handler N/A getattr self N/A hp_%s N/A node name N/A N/A N/A AttributeError N/A N/A N/A NotImplementedError Annealing N/A node name N/A N/A handler memo node label tid val N/A N/A N/A N/A ExprEvaluator on_node self memo node N/A hp_uniform N/A N/A self memo node label tid val log_scale pass_q uniform_like N/A False False uniform N/A N/A 
        Return a new value for a uniform hyperparameter.

        Parameters:
        -----------

        memo - (see on_node_hyperparameter)

        node - (see on_node_hyperparameter)

        label - (see on_node_hyperparameter)

        tid - trial-identifier of the model trial on which to base a new sample

        val - the value of this hyperparameter on the model trial

        Returns: a list with one value in it: the suggested value for this
        hyperparameter
         N/A log_scale N/A N/A midpt N/A N/A np log val N/A N/A midpt val N/A high N/A memo N/A N/A N/A node arg N/A high N/A low N/A memo N/A N/A N/A node arg N/A low N/A width N/A N/A high low N/A N/A self shrinking label N/A half N/A 0.5 width N/A min_midpt N/A low half N/A max_midpt N/A high half N/A clipped_midpt N/A N/A np clip midpt min_midpt max_midpt N/A pass_q N/A N/A N/A uniform_like low N/A clipped_midpt half high N/A clipped_midpt half rng N/A self rng q N/A memo N/A N/A N/A node arg N/A q size N/A memo N/A N/A N/A node arg N/A size N/A N/A N/A uniform_like low N/A clipped_midpt half high N/A clipped_midpt half rng N/A self rng size N/A memo N/A N/A N/A node arg N/A size N/A hp_quniform N/A N/A self N/A args kwargs N/A N/A N/A N/A self hp_uniform pass_q True uniform_like quniform args kwargs N/A hp_loguniform N/A N/A self N/A args kwargs N/A N/A N/A N/A self hp_uniform log_scale True pass_q False uniform_like loguniform args kwargs N/A hp_qloguniform N/A N/A self N/A args kwargs N/A N/A N/A N/A self hp_uniform log_scale True pass_q True uniform_like qloguniform args kwargs N/A hp_randint N/A N/A self memo node label tid val N/A N/A N/A 
        Parameters: See `hp_uniform`
         N/A upper N/A memo N/A N/A N/A node arg N/A upper N/A val1 N/A N/A np atleast_1d val N/A N/A val1 size N/A N/A counts N/A N/A N/A np bincount val1 minlength upper N/A float N/A val1 size N/A N/A counts N/A N/A np zeros upper N/A prior 1.0 N/A prior N/A N/A self shrinking label N/A p N/A N/A N/A 1 prior counts N/A prior N/A 1.0 upper N/A rval N/A categorical p p upper upper rng N/A self rng size N/A memo N/A N/A N/A node arg N/A size N/A rval N/A hp_categorical N/A N/A self memo node label tid val N/A N/A N/A 
        Parameters: See `hp_uniform`
         N/A size N/A memo N/A N/A N/A node arg N/A size N/A N/A size 0 N/A N/A N/A N/A val1 N/A N/A np atleast_1d val N/A p p_orig N/A N/A np asarray N/A memo N/A N/A N/A node arg N/A p N/A N/A N/A p ndim 2 N/A N/A N/A N/A len p N/A 1 N/A len val1 N/A N/A node N/A p N/A N/A N/A N/A np asarray p shape N/A N/A N/A len p N/A 1 N/A len val1 N/A N/A N/A N/A p ndim 1 N/A p N/A p N/A N/A N/A np newaxis N/A N/A upper N/A memo N/A N/A N/A node arg N/A upper N/A N/A val1 size N/A N/A counts N/A N/A N/A np bincount val1 minlength upper N/A float N/A val1 size N/A prior N/A N/A self shrinking label N/A N/A counts N/A N/A np zeros upper N/A prior 1.0 N/A new_p N/A N/A N/A 1 prior counts N/A prior p N/A N/A N/A new_p ndim 2 N/A rval N/A categorical p new_p rng N/A self rng size size N/A N/A N/A p_orig ndim 1 N/A N/A N/A N/A len rval 1 N/A N/A rval N/A 0 N/A N/A rval N/A hp_normal N/A N/A self memo node label tid val N/A N/A N/A 
        Parameters: See `hp_uniform`
         N/A N/A normal mu val sigma N/A N/A memo N/A N/A N/A node arg N/A sigma N/A N/A self shrinking label rng N/A self rng size N/A memo N/A N/A N/A node arg N/A size N/A hp_lognormal N/A N/A self memo node label tid val N/A N/A N/A 
        Parameters: See `hp_uniform`
         N/A N/A lognormal mu N/A N/A np log val sigma N/A N/A memo N/A N/A N/A node arg N/A sigma N/A N/A self shrinking label rng N/A self rng size N/A memo N/A N/A N/A node arg N/A size N/A hp_qlognormal N/A N/A self memo node label tid val N/A N/A N/A 
        Parameters: See `hp_uniform`
         N/A N/A qlognormal mu N/A N/A np log N/A 1e-16 val sigma N/A N/A memo N/A N/A N/A node arg N/A sigma N/A N/A self shrinking label q N/A memo N/A N/A N/A node arg N/A q rng N/A self rng size N/A memo N/A N/A N/A node arg N/A size N/A hp_qnormal N/A N/A self memo node label tid val N/A N/A N/A 
        Parameters: See `hp_uniform`
         N/A N/A qnormal mu val sigma N/A N/A memo N/A N/A N/A node arg N/A sigma N/A N/A self shrinking label q N/A memo N/A N/A N/A node arg N/A q rng N/A self rng size N/A memo N/A N/A N/A node arg N/A size N/A N/A suggest N/A N/A new_ids domain trials seed N/A args kwargs N/A N/A N/A new_id new_ids N/A N/A N/A AnnealingAlgo domain trials seed args kwargs new_id N/A suggest_batch N/A N/A new_ids domain trials seed N/A args kwargs N/A N/A N/A N/A N/A AnnealingAlgo domain trials seed args kwargs batch new_ids N/A