sgҩ ddlmZddlmZmZmZddlmZmZddl Z ddl m Z m Z ddlmZddlmZdd lmZmZdd lmZdd lmZmZd d lmZmZd dlmZd dlm Z m!Z!ddgZ"GddZ#dZ$GddeZ%Gdde%Z&Gdde%Z'y))abstractmethod)ceilfloorlog)IntegralRealN) _fit_context is_classifier)get_scorer_names)resample)Interval StrOptions)check_classification_targets) _num_samples validate_data) ParameterGridParameterSampler) BaseSearchCV)_yields_constant_splitscheck_cvHalvingGridSearchCVHalvingRandomSearchCVceZdZdZdZdZy)_SubsampleMetaSplitterz8Splitter that subsamples a given fraction of the datasetc<||_||_||_||_yNbase_cvfractionsubsample_test random_state)selfr r!r"r#s e/var/www/html/venv/lib/python3.12/site-packages/sklearn/model_selection/_search_successive_halving.py__init__z_SubsampleMetaSplitter.__init__s    ,(c +\K|jj||fi|D]\}}t|d|jt |j t |z}|jr8t|d|jt |j t |z}||fyw)NF)replacer# n_samples)r splitr r#intr!lenr")r$Xykwargs train_idxtest_idxs r%r+z_SubsampleMetaSplitter.split s#54<<#5#5a#Ef#E & Ix !..dmmc)n<= I ""#!!%!2!2!$--#h-"?@  X% % &sB*B,N)__name__ __module__ __qualname____doc__r&r+r'r%rrsB) &r'rcJd|d|d|dfD\}}}tj||k(}||}tjtj|tjtj |}tj |||| dS)Nc3FK|]}tj|ywr)npasarray).0as r% z_top_k..4s *  1 *s!itermean_test_scoreparams)r: flatnonzerorollargsort count_nonzeroisnanarray) resultskitr iterationr@rA iter_indicesscoressorted_indicess r%_top_krO2s*&/7+<#=wx?PQ*&I>>)s"23L \ *FWWRZZ/1A1A"((6BR1STN 88F<()<= >>r'ceZdZUdZiej eeee dgdge e dddedhge e dddedd hge ge e dddgd gd Zeed <ej!d ddddddej$ddddddd fd ZdZedZeddfd ZdZedZxZS)BaseSuccessiveHalvingzImplements successive halving. Ref: Almost optimal exploration in multi-armed bandits, ICML 13 Zohar Karnin, Tomer Koren, Oren Somekh Nr#rneitherclosedautoexhaustsmallestboolean)scoringr# max_resources min_resourcesresourcefactoraggressive_elimination_parameter_constraints pre_dispatchTr*F) rYn_jobsrefitcvverboser# error_scorereturn_train_scorerZr[r\r]r^c t||||||||| ||_| |_| |_| |_| |_||_y)N)rYrcrdrerfrgrh)superr&r#rZr\r]r[r^)r$ estimatorrYrcrdrerfr#rgrhrZr[r\r]r^ __class__s r%r&zBaseSuccessiveHalving.__init__\s_$  #1  )*   *&<#r'ct|js td|jdk7r_|j|jj vr9td|jd|jj jt|tr+|j|jcxk(rdk(r td|j|_ |jdvr|jdk(r|jj||fi|}d}||z|_ t|jrXt|d | }t!|t#j$|j&d }|xj|zc_ nd |_ |j(|_|j*d k(r*|jdk(s tdt-||_|j|j*kDr&td|jd|j*d|jd k(rtd|jdy)Nz{The cv parameter must yield consistent folds across calls to split(). Set its random_state to an int, or set shuffle=False.r*zCannot use resource=z% which is not supported by estimator rVz?n_candidates and min_resources cannot be both set to 'exhaust'.)rWrVr no_validation)r.r/rrrUz:resource can only be 'n_samples' when max_resources='auto'zmin_resources_=z is greater than max_resources_=.z+: you might have passed an empty dataset X.)r_checked_cv_orig ValueErrorr\rk get_paramsrlr3 isinstancerr[ n_candidatesmin_resources_ get_n_splitsr rrr:uniqueshaperZmax_resources_r)r$r.r/ split_paramsn_splits magic_factor n_classess r%_check_input_parametersz-BaseSuccessiveHalving._check_input_parameterss:'t'<'<=!  MM[ ( T^^%>%>%@@&t}}o6 $ 8 8 A ABD  d1 2!!T%6%6C)C!U D#00   "9 9}} +=400==aSlS &.&=# 0%doCA03 " ! 2 21 5I''94'&'##00   & (==K/ P#/q/D    !4!4 4!$"5"5!67''+':':&;1>    ! #!$"5"5!67&&  $r'ctj|d}tj|d|k(}|d|}tj|j rd}||Stj |}||S)aQCustom refit callable to return the index of the best candidate. We want the best candidate out of the last iteration. By default BaseSearchCV would return the best candidate out of all iterations. Currently, we only support for a single metric thus `refit` and `refit_metric` are not required. r?r@r)r:maxrBrFall nanargmax)rd refit_metricrH last_iterlast_iter_indices test_scoresbest_idxs r%_select_best_indexz(BaseSuccessiveHalving._select_best_indexsFF76?+ NN76?i+GH/01BC  88K $ $ &H!**||K0H **r')prefer_skip_nested_validationc `t|j|t|j|_|j |}|j |||jjt||_ t|0|fd|i||jd|j|_|S)aRun fit with all sets of parameters. Parameters ---------- X : array-like, shape (n_samples, n_features) Training vector, where `n_samples` is the number of samples and `n_features` is the number of features. y : array-like, shape (n_samples,) or (n_samples, n_output), optional Target relative to X for classification or regression; None for unsupervised learning. **params : dict of string -> object Parameters passed to the ``fit`` method of the estimator. Returns ------- self : object Instance of fitted estimator. ) classifier)r.r/rzr/r@)rrer rkrp_get_routed_params_for_fitr~splitterr+r_n_samples_origrjfit cv_results_ best_index_ best_score_)r$r.r/rA routed_paramsrls r%rzBaseSuccessiveHalving.fits4!) GGQ=#@! 77?  $$1=#9#9#?#? %  ,A  A%%f% ++,=>t?O?OP r'c j}jdk7r-tfd|Drtdjddt t t |jz}jdk(r:|dz }tjjj|zz_ dt t jjzjz}jr|}n t||}jrtd|td|td |td jtd jtd jtd jg_g_t%|D]}|}jrtd||z |z}t'j|zjz} t| j} j j)| t |} j"j)| jr5tdtd|td| td| jdk(r1t+j,| j.z dj0} n?|D cgc]} | j3}} |D]} | | j<j,} |g| z| g| zd}||| |}t5| jz }t7|||}t |_|_|_|_ycc} w)Nr*c3:K|]}j|vywr)r\)r< candidater$s r%r>z4BaseSuccessiveHalving._run_search..s0 +4DMMY &0 szCannot use parameter z= as the resource since it is part of the searched parameters.rrVzn_iterations: zn_required_iterations: zn_possible_iterations: zmin_resources_: zmax_resources_: zaggressive_elimination: zfactor: rz ----------ziter: zn_candidates: z n_resources: Tr)r? n_resources) more_results) _generate_candidate_paramsr\anyrqrrr-r]r[rruryr^minrfprint n_resources_ n_candidates_ranger,appendrrprr#copyrrOn_remaining_candidates_n_required_iterations_n_possible_iterations_ n_iterations_)r$evaluate_candidatescandidate_paramsn_required_iterationslast_iterationn_possible_iterations n_iterationsrJpowerrrtrecrrrHn_candidates_to_keeps` r% _run_searchz!BaseSuccessiveHalving._run_searchs::< ==K 'C0 8H0 - ' 799 !"E#c2B.CT[[*Q$R R    *3Q6N"%####t{{N'BB#D !"E ##t':'::DKK H% !   & &0L46KLL << N<.1 2 +,A+BC D +,A+BC D $T%8%8$9: ; $T%8%8$9: ; ,T-H-H,IJ K HT[[M* +&2 JCE** As%::=RRSdkk5043F3FFGKk4+>+>?K    $ $[ 1/0L    % %l 3||hsen%|n56 k]34}} ++ 11(4+?+??#'!%!2!2 7G#GAFFH#G #G!1;I/:Idmm,;** , +}|;L * "<G$( t{{(B#C %g/CSI e2 Jh(++;'<$&;#&;#))$Hs*N cyrr7r$s r%rz0BaseSuccessiveHalving._generate_candidate_paramsqs r'r)r3r4r5r6rr_rsetr callablerrstrrdict__annotations__popr:nanr&r~ staticmethodrr rrrr __classcell__rls@r%rQrQAs;$  - -$s#3#5674H'( Xq$y 9 x  Xq$y 9  :. / ED!T)<=#,+$D"~.  FF$!"=H?B++,&+& &Pk*Z  r'rQceZdZUdZiej deegiZeed<dddddd d d e jd d d d d fd Z dZ xZ S)ra1Search over specified parameter values with successive halving. The search strategy starts evaluating all the candidates with a small amount of resources and iteratively selects the best candidates, using more and more resources. Read more in the :ref:`User guide `. .. note:: This estimator is still **experimental** for now: the predictions and the API might change without any deprecation cycle. To use it, you need to explicitly import ``enable_halving_search_cv``:: >>> # explicitly require this experimental feature >>> from sklearn.experimental import enable_halving_search_cv # noqa >>> # now you can import normally from model_selection >>> from sklearn.model_selection import HalvingGridSearchCV Parameters ---------- estimator : estimator object This is assumed to implement the scikit-learn estimator interface. Either estimator needs to provide a ``score`` function, or ``scoring`` must be passed. param_grid : dict or list of dictionaries Dictionary with parameters names (string) as keys and lists of parameter settings to try as values, or a list of such dictionaries, in which case the grids spanned by each dictionary in the list are explored. This enables searching over any sequence of parameter settings. factor : int or float, default=3 The 'halving' parameter, which determines the proportion of candidates that are selected for each subsequent iteration. For example, ``factor=3`` means that only one third of the candidates are selected. resource : ``'n_samples'`` or str, default='n_samples' Defines the resource that increases with each iteration. By default, the resource is the number of samples. It can also be set to any parameter of the base estimator that accepts positive integer values, e.g. 'n_iterations' or 'n_estimators' for a gradient boosting estimator. In this case ``max_resources`` cannot be 'auto' and must be set explicitly. max_resources : int, default='auto' The maximum amount of resource that any candidate is allowed to use for a given iteration. By default, this is set to ``n_samples`` when ``resource='n_samples'`` (default), else an error is raised. min_resources : {'exhaust', 'smallest'} or int, default='exhaust' The minimum amount of resource that any candidate is allowed to use for a given iteration. Equivalently, this defines the amount of resources `r0` that are allocated for each candidate at the first iteration. - 'smallest' is a heuristic that sets `r0` to a small value: - ``n_splits * 2`` when ``resource='n_samples'`` for a regression problem - ``n_classes * n_splits * 2`` when ``resource='n_samples'`` for a classification problem - ``1`` when ``resource != 'n_samples'`` - 'exhaust' will set `r0` such that the **last** iteration uses as much resources as possible. Namely, the last iteration will use the highest value smaller than ``max_resources`` that is a multiple of both ``min_resources`` and ``factor``. In general, using 'exhaust' leads to a more accurate estimator, but is slightly more time consuming. Note that the amount of resources used at each iteration is always a multiple of ``min_resources``. aggressive_elimination : bool, default=False This is only relevant in cases where there isn't enough resources to reduce the remaining candidates to at most `factor` after the last iteration. If ``True``, then the search process will 'replay' the first iteration for as long as needed until the number of candidates is small enough. This is ``False`` by default, which means that the last iteration may evaluate more than ``factor`` candidates. See :ref:`aggressive_elimination` for more details. cv : int, cross-validation generator or iterable, default=5 Determines the cross-validation splitting strategy. Possible inputs for cv are: - integer, to specify the number of folds in a `(Stratified)KFold`, - :term:`CV splitter`, - An iterable yielding (train, test) splits as arrays of indices. For integer/None inputs, if the estimator is a classifier and ``y`` is either binary or multiclass, :class:`StratifiedKFold` is used. In all other cases, :class:`KFold` is used. These splitters are instantiated with `shuffle=False` so the splits will be the same across calls. Refer :ref:`User Guide ` for the various cross-validation strategies that can be used here. .. note:: Due to implementation details, the folds produced by `cv` must be the same across multiple calls to `cv.split()`. For built-in `scikit-learn` iterators, this can be achieved by deactivating shuffling (`shuffle=False`), or by setting the `cv`'s `random_state` parameter to an integer. scoring : str, callable, or None, default=None A single string (see :ref:`scoring_parameter`) or a callable (see :ref:`scoring_callable`) to evaluate the predictions on the test set. If None, the estimator's score method is used. refit : bool, default=True If True, refit an estimator using the best found parameters on the whole dataset. The refitted estimator is made available at the ``best_estimator_`` attribute and permits using ``predict`` directly on this ``HalvingGridSearchCV`` instance. error_score : 'raise' or numeric Value to assign to the score if an error occurs in estimator fitting. If set to 'raise', the error is raised. If a numeric value is given, FitFailedWarning is raised. This parameter does not affect the refit step, which will always raise the error. Default is ``np.nan``. return_train_score : bool, default=False If ``False``, the ``cv_results_`` attribute will not include training scores. Computing training scores is used to get insights on how different parameter settings impact the overfitting/underfitting trade-off. However computing the scores on the training set can be computationally expensive and is not strictly required to select the parameters that yield the best generalization performance. random_state : int, RandomState instance or None, default=None Pseudo random number generator state used for subsampling the dataset when `resources != 'n_samples'`. Ignored otherwise. Pass an int for reproducible output across multiple function calls. See :term:`Glossary `. n_jobs : int or None, default=None Number of jobs to run in parallel. ``None`` means 1 unless in a :obj:`joblib.parallel_backend` context. ``-1`` means using all processors. See :term:`Glossary ` for more details. verbose : int Controls the verbosity: the higher, the more messages. Attributes ---------- n_resources_ : list of int The amount of resources used at each iteration. n_candidates_ : list of int The number of candidate parameters that were evaluated at each iteration. n_remaining_candidates_ : int The number of candidate parameters that are left after the last iteration. It corresponds to `ceil(n_candidates[-1] / factor)` max_resources_ : int The maximum number of resources that any candidate is allowed to use for a given iteration. Note that since the number of resources used at each iteration must be a multiple of ``min_resources_``, the actual number of resources used at the last iteration may be smaller than ``max_resources_``. min_resources_ : int The amount of resources that are allocated for each candidate at the first iteration. n_iterations_ : int The actual number of iterations that were run. This is equal to ``n_required_iterations_`` if ``aggressive_elimination`` is ``True``. Else, this is equal to ``min(n_possible_iterations_, n_required_iterations_)``. n_possible_iterations_ : int The number of iterations that are possible starting with ``min_resources_`` resources and without exceeding ``max_resources_``. n_required_iterations_ : int The number of iterations that are required to end up with less than ``factor`` candidates at the last iteration, starting with ``min_resources_`` resources. This will be smaller than ``n_possible_iterations_`` when there isn't enough resources. cv_results_ : dict of numpy (masked) ndarrays A dict with keys as column headers and values as columns, that can be imported into a pandas ``DataFrame``. It contains lots of information for analysing the results of a search. Please refer to the :ref:`User guide` for details. best_estimator_ : estimator or dict Estimator that was chosen by the search, i.e. estimator which gave highest score (or smallest loss if specified) on the left out data. Not available if ``refit=False``. best_score_ : float Mean cross-validated score of the best_estimator. best_params_ : dict Parameter setting that gave the best results on the hold out data. best_index_ : int The index (of the ``cv_results_`` arrays) which corresponds to the best candidate parameter setting. The dict at ``search.cv_results_['params'][search.best_index_]`` gives the parameter setting for the best model, that gives the highest mean score (``search.best_score_``). scorer_ : function or a dict Scorer function used on the held out data to choose the best parameters for the model. n_splits_ : int The number of cross-validation splits (folds/iterations). refit_time_ : float Seconds used for refitting the best model on the whole dataset. This is present only if ``refit`` is not False. multimetric_ : bool Whether or not the scorers compute several metrics. classes_ : ndarray of shape (n_classes,) The classes labels. This is present only if ``refit`` is specified and the underlying estimator is a classifier. n_features_in_ : int Number of features seen during :term:`fit`. Only defined if `best_estimator_` is defined (see the documentation for the `refit` parameter for more details) and that `best_estimator_` exposes `n_features_in_` when fit. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Only defined if `best_estimator_` is defined (see the documentation for the `refit` parameter for more details) and that `best_estimator_` exposes `feature_names_in_` when fit. .. versionadded:: 1.0 See Also -------- :class:`HalvingRandomSearchCV`: Random search over a set of parameters using successive halving. Notes ----- The parameters selected are those that maximize the score of the held-out data, according to the scoring parameter. All parameter combinations scored with a NaN will share the lowest rank. Examples -------- >>> from sklearn.datasets import load_iris >>> from sklearn.ensemble import RandomForestClassifier >>> from sklearn.experimental import enable_halving_search_cv # noqa >>> from sklearn.model_selection import HalvingGridSearchCV ... >>> X, y = load_iris(return_X_y=True) >>> clf = RandomForestClassifier(random_state=0) ... >>> param_grid = {"max_depth": [3, None], ... "min_samples_split": [5, 10]} >>> search = HalvingGridSearchCV(clf, param_grid, resource='n_estimators', ... max_resources=10, ... random_state=0).fit(X, y) >>> search.best_params_ # doctest: +SKIP {'max_depth': None, 'min_samples_split': 10, 'n_estimators': 9} param_gridr_rbr*rUrVFraNTr) r]r\rZr[r^rerYrdrgrhr#rcrfc Nt||| || ||| | | |||||||_yN) rYrcrdrfrer#rgrhrZr\r]r[r^)rjr&r)r$rkrr]r\rZr[r^rerYrdrgrhr#rcrfrls r%r&zHalvingGridSearchCV.__init__sJ&  %#1''#9  %r'c,t|jSr)rrrs r%rz.HalvingGridSearchCV._generate_candidate_paramssT__--r')r3r4r5r6rQr_rlistrr:rr&rrrs@r%rrvsmYv$  6 6$tTl$D$ FF##%J.r'ceZdZUdZiej eegee ddde dhgdZee d<dd d d d d ddde jdddddfd ZdZxZS)ra4Randomized search on hyper parameters. The search strategy starts evaluating all the candidates with a small amount of resources and iteratively selects the best candidates, using more and more resources. The candidates are sampled at random from the parameter space and the number of sampled candidates is determined by ``n_candidates``. Read more in the :ref:`User guide`. .. note:: This estimator is still **experimental** for now: the predictions and the API might change without any deprecation cycle. To use it, you need to explicitly import ``enable_halving_search_cv``:: >>> # explicitly require this experimental feature >>> from sklearn.experimental import enable_halving_search_cv # noqa >>> # now you can import normally from model_selection >>> from sklearn.model_selection import HalvingRandomSearchCV Parameters ---------- estimator : estimator object This is assumed to implement the scikit-learn estimator interface. Either estimator needs to provide a ``score`` function, or ``scoring`` must be passed. param_distributions : dict or list of dicts Dictionary with parameters names (`str`) as keys and distributions or lists of parameters to try. Distributions must provide a ``rvs`` method for sampling (such as those from scipy.stats.distributions). If a list is given, it is sampled uniformly. If a list of dicts is given, first a dict is sampled uniformly, and then a parameter is sampled using that dict as above. n_candidates : "exhaust" or int, default="exhaust" The number of candidate parameters to sample, at the first iteration. Using 'exhaust' will sample enough candidates so that the last iteration uses as many resources as possible, based on `min_resources`, `max_resources` and `factor`. In this case, `min_resources` cannot be 'exhaust'. factor : int or float, default=3 The 'halving' parameter, which determines the proportion of candidates that are selected for each subsequent iteration. For example, ``factor=3`` means that only one third of the candidates are selected. resource : ``'n_samples'`` or str, default='n_samples' Defines the resource that increases with each iteration. By default, the resource is the number of samples. It can also be set to any parameter of the base estimator that accepts positive integer values, e.g. 'n_iterations' or 'n_estimators' for a gradient boosting estimator. In this case ``max_resources`` cannot be 'auto' and must be set explicitly. max_resources : int, default='auto' The maximum number of resources that any candidate is allowed to use for a given iteration. By default, this is set ``n_samples`` when ``resource='n_samples'`` (default), else an error is raised. min_resources : {'exhaust', 'smallest'} or int, default='smallest' The minimum amount of resource that any candidate is allowed to use for a given iteration. Equivalently, this defines the amount of resources `r0` that are allocated for each candidate at the first iteration. - 'smallest' is a heuristic that sets `r0` to a small value: - ``n_splits * 2`` when ``resource='n_samples'`` for a regression problem - ``n_classes * n_splits * 2`` when ``resource='n_samples'`` for a classification problem - ``1`` when ``resource != 'n_samples'`` - 'exhaust' will set `r0` such that the **last** iteration uses as much resources as possible. Namely, the last iteration will use the highest value smaller than ``max_resources`` that is a multiple of both ``min_resources`` and ``factor``. In general, using 'exhaust' leads to a more accurate estimator, but is slightly more time consuming. 'exhaust' isn't available when `n_candidates='exhaust'`. Note that the amount of resources used at each iteration is always a multiple of ``min_resources``. aggressive_elimination : bool, default=False This is only relevant in cases where there isn't enough resources to reduce the remaining candidates to at most `factor` after the last iteration. If ``True``, then the search process will 'replay' the first iteration for as long as needed until the number of candidates is small enough. This is ``False`` by default, which means that the last iteration may evaluate more than ``factor`` candidates. See :ref:`aggressive_elimination` for more details. cv : int, cross-validation generator or an iterable, default=5 Determines the cross-validation splitting strategy. Possible inputs for cv are: - integer, to specify the number of folds in a `(Stratified)KFold`, - :term:`CV splitter`, - An iterable yielding (train, test) splits as arrays of indices. For integer/None inputs, if the estimator is a classifier and ``y`` is either binary or multiclass, :class:`StratifiedKFold` is used. In all other cases, :class:`KFold` is used. These splitters are instantiated with `shuffle=False` so the splits will be the same across calls. Refer :ref:`User Guide ` for the various cross-validation strategies that can be used here. .. note:: Due to implementation details, the folds produced by `cv` must be the same across multiple calls to `cv.split()`. For built-in `scikit-learn` iterators, this can be achieved by deactivating shuffling (`shuffle=False`), or by setting the `cv`'s `random_state` parameter to an integer. scoring : str, callable, or None, default=None A single string (see :ref:`scoring_parameter`) or a callable (see :ref:`scoring_callable`) to evaluate the predictions on the test set. If None, the estimator's score method is used. refit : bool, default=True If True, refit an estimator using the best found parameters on the whole dataset. The refitted estimator is made available at the ``best_estimator_`` attribute and permits using ``predict`` directly on this ``HalvingRandomSearchCV`` instance. error_score : 'raise' or numeric Value to assign to the score if an error occurs in estimator fitting. If set to 'raise', the error is raised. If a numeric value is given, FitFailedWarning is raised. This parameter does not affect the refit step, which will always raise the error. Default is ``np.nan``. return_train_score : bool, default=False If ``False``, the ``cv_results_`` attribute will not include training scores. Computing training scores is used to get insights on how different parameter settings impact the overfitting/underfitting trade-off. However computing the scores on the training set can be computationally expensive and is not strictly required to select the parameters that yield the best generalization performance. random_state : int, RandomState instance or None, default=None Pseudo random number generator state used for subsampling the dataset when `resources != 'n_samples'`. Also used for random uniform sampling from lists of possible values instead of scipy.stats distributions. Pass an int for reproducible output across multiple function calls. See :term:`Glossary `. n_jobs : int or None, default=None Number of jobs to run in parallel. ``None`` means 1 unless in a :obj:`joblib.parallel_backend` context. ``-1`` means using all processors. See :term:`Glossary ` for more details. verbose : int Controls the verbosity: the higher, the more messages. Attributes ---------- n_resources_ : list of int The amount of resources used at each iteration. n_candidates_ : list of int The number of candidate parameters that were evaluated at each iteration. n_remaining_candidates_ : int The number of candidate parameters that are left after the last iteration. It corresponds to `ceil(n_candidates[-1] / factor)` max_resources_ : int The maximum number of resources that any candidate is allowed to use for a given iteration. Note that since the number of resources used at each iteration must be a multiple of ``min_resources_``, the actual number of resources used at the last iteration may be smaller than ``max_resources_``. min_resources_ : int The amount of resources that are allocated for each candidate at the first iteration. n_iterations_ : int The actual number of iterations that were run. This is equal to ``n_required_iterations_`` if ``aggressive_elimination`` is ``True``. Else, this is equal to ``min(n_possible_iterations_, n_required_iterations_)``. n_possible_iterations_ : int The number of iterations that are possible starting with ``min_resources_`` resources and without exceeding ``max_resources_``. n_required_iterations_ : int The number of iterations that are required to end up with less than ``factor`` candidates at the last iteration, starting with ``min_resources_`` resources. This will be smaller than ``n_possible_iterations_`` when there isn't enough resources. cv_results_ : dict of numpy (masked) ndarrays A dict with keys as column headers and values as columns, that can be imported into a pandas ``DataFrame``. It contains lots of information for analysing the results of a search. Please refer to the :ref:`User guide` for details. best_estimator_ : estimator or dict Estimator that was chosen by the search, i.e. estimator which gave highest score (or smallest loss if specified) on the left out data. Not available if ``refit=False``. best_score_ : float Mean cross-validated score of the best_estimator. best_params_ : dict Parameter setting that gave the best results on the hold out data. best_index_ : int The index (of the ``cv_results_`` arrays) which corresponds to the best candidate parameter setting. The dict at ``search.cv_results_['params'][search.best_index_]`` gives the parameter setting for the best model, that gives the highest mean score (``search.best_score_``). scorer_ : function or a dict Scorer function used on the held out data to choose the best parameters for the model. n_splits_ : int The number of cross-validation splits (folds/iterations). refit_time_ : float Seconds used for refitting the best model on the whole dataset. This is present only if ``refit`` is not False. multimetric_ : bool Whether or not the scorers compute several metrics. classes_ : ndarray of shape (n_classes,) The classes labels. This is present only if ``refit`` is specified and the underlying estimator is a classifier. n_features_in_ : int Number of features seen during :term:`fit`. Only defined if `best_estimator_` is defined (see the documentation for the `refit` parameter for more details) and that `best_estimator_` exposes `n_features_in_` when fit. .. versionadded:: 0.24 feature_names_in_ : ndarray of shape (`n_features_in_`,) Names of features seen during :term:`fit`. Only defined if `best_estimator_` is defined (see the documentation for the `refit` parameter for more details) and that `best_estimator_` exposes `feature_names_in_` when fit. .. versionadded:: 1.0 See Also -------- :class:`HalvingGridSearchCV`: Search over a grid of parameters using successive halving. Notes ----- The parameters selected are those that maximize the score of the held-out data, according to the scoring parameter. All parameter combinations scored with a NaN will share the lowest rank. Examples -------- >>> from sklearn.datasets import load_iris >>> from sklearn.ensemble import RandomForestClassifier >>> from sklearn.experimental import enable_halving_search_cv # noqa >>> from sklearn.model_selection import HalvingRandomSearchCV >>> from scipy.stats import randint >>> import numpy as np ... >>> X, y = load_iris(return_X_y=True) >>> clf = RandomForestClassifier(random_state=0) >>> np.random.seed(0) ... >>> param_distributions = {"max_depth": [3, None], ... "min_samples_split": randint(2, 11)} >>> search = HalvingRandomSearchCV(clf, param_distributions, ... resource='n_estimators', ... max_resources=10, ... random_state=0).fit(X, y) >>> search.best_params_ # doctest: +SKIP {'max_depth': None, 'min_samples_split': 10, 'n_estimators': 9} rNrRrSrV)param_distributionsrtr_rbr*rUrWFraT)rtr]r\rZr[r^rerYrdrgrhr#rcrfc\t||| || || || | |||||||_||_yr)rjr&rrt)r$rkrrtr]r\rZr[r^rerYrdrgrhr#rcrfrls r%r&zHalvingRandomSearchCV.__init__sS(  %#1''#9  $7 (r'c|j}|dk(r|j|jz}t|j||j S)NrV)r#)rtryrurrr#)r$n_candidates_first_iters r%rz0HalvingRandomSearchCV._generate_candidate_paramssQ"&"3"3 "i /'+&9&9T=P=P&P #  $ $ #**  r')r3r4r5r6rQr_rrrrrrr:rr&rrrs@r%rrsjX $  6 6$ $d| Xq$y 9  { # $D $ FF%%)N  r')(abcrmathrrrnumbersrrnumpyr:baser r metrics._scorerr utilsr utils._param_validationrrutils.multiclassrutils.validationrrrr_searchr_splitrr__all__rrOrQrrr7r'r%rsy!!"..:;:-!5 "9 :&&6 ?r Lr j G./G.T g 1g r'