LogisticRegression#
- classsklearn.linear_model.LogisticRegression(penalty='l2',*,dual=False,tol=0.0001,C=1.0,fit_intercept=True,intercept_scaling=1,class_weight=None,random_state=None,solver='lbfgs',max_iter=100,multi_class='deprecated',verbose=0,warm_start=False,n_jobs=None,l1_ratio=None)[source]#
Logistic Regression (aka logit, MaxEnt) classifier.
This class implements regularized logistic regression using the‘liblinear’ library, ‘newton-cg’, ‘sag’, ‘saga’ and ‘lbfgs’ solvers.Notethat regularization is applied by default. It can handle both denseand sparse input. Use C-ordered arrays or CSR matrices containing 64-bitfloats for optimal performance; any other input format will be converted(and copied).
The ‘newton-cg’, ‘sag’, and ‘lbfgs’ solvers support only L2 regularizationwith primal formulation, or no regularization. The ‘liblinear’ solversupports both L1 and L2 regularization, with a dual formulation only forthe L2 penalty. The Elastic-Net regularization is only supported by the‘saga’ solver.
Formulticlass problems, all solvers but ‘liblinear’ optimize the(penalized) multinomial loss. ‘liblinear’ only handle binary classification but canbe extended to handle multiclass by using
OneVsRestClassifier.Read more in theUser Guide.
- Parameters:
- penalty{‘l1’, ‘l2’, ‘elasticnet’, None}, default=’l2’
Specify the norm of the penalty:
None: no penalty is added;'l2': add a L2 penalty term and it is the default choice;'l1': add a L1 penalty term;'elasticnet': both L1 and L2 penalty terms are added.
Warning
Some penalties may not work with some solvers. See the parameter
solverbelow, to know the compatibility between the penalty andsolver.Added in version 0.19:l1 penalty with SAGA solver (allowing ‘multinomial’ + L1)
- dualbool, default=False
Dual (constrained) or primal (regularized, see alsothis equation) formulation. Dual formulationis only implemented for l2 penalty with liblinear solver. Prefer dual=False whenn_samples > n_features.
- tolfloat, default=1e-4
Tolerance for stopping criteria.
- Cfloat, default=1.0
Inverse of regularization strength; must be a positive float.Like in support vector machines, smaller values specify strongerregularization.
- fit_interceptbool, default=True
Specifies if a constant (a.k.a. bias or intercept) should beadded to the decision function.
- intercept_scalingfloat, default=1
Useful only when the solver
liblinearis usedandself.fit_interceptis set toTrue. In this case,xbecomes[x,self.intercept_scaling],i.e. a “synthetic” feature with constant value equal tointercept_scalingis appended to the instance vector.The intercept becomesintercept_scaling*synthetic_feature_weight.Note
The synthetic feature weight is subject to L1 or L2regularization as all other features.To lessen the effect of regularization on synthetic feature weight(and therefore on the intercept)
intercept_scalinghas to be increased.- class_weightdict or ‘balanced’, default=None
Weights associated with classes in the form
{class_label:weight}.If not given, all classes are supposed to have weight one.The “balanced” mode uses the values of y to automatically adjustweights inversely proportional to class frequencies in the input dataas
n_samples/(n_classes*np.bincount(y)).Note that these weights will be multiplied with sample_weight (passedthrough the fit method) if sample_weight is specified.
Added in version 0.17:class_weight=’balanced’
- random_stateint, RandomState instance, default=None
Used when
solver== ‘sag’, ‘saga’ or ‘liblinear’ to shuffle thedata. SeeGlossary for details.- solver{‘lbfgs’, ‘liblinear’, ‘newton-cg’, ‘newton-cholesky’, ‘sag’, ‘saga’}, default=’lbfgs’
Algorithm to use in the optimization problem. Default is ‘lbfgs’.To choose a solver, you might want to consider the following aspects:
For small datasets, ‘liblinear’ is a good choice, whereas ‘sag’and ‘saga’ are faster for large ones;
Formulticlass problems, all solvers except ‘liblinear’ minimize thefull multinomial loss;
‘liblinear’ can only handle binary classification by default. To apply aone-versus-rest scheme for the multiclass setting one can wrap it with the
OneVsRestClassifier.‘newton-cholesky’ is a good choice for
n_samples>>n_features*n_classes, especially with one-hot encodedcategorical features with rare categories. Be aware that the memory usageof this solver has a quadratic dependency onn_features*n_classesbecause it explicitly computes the full Hessian matrix.
Warning
The choice of the algorithm depends on the penalty chosen and on(multinomial) multiclass support:
solver
penalty
multinomial multiclass
‘lbfgs’
‘l2’, None
yes
‘liblinear’
‘l1’, ‘l2’
no
‘newton-cg’
‘l2’, None
yes
‘newton-cholesky’
‘l2’, None
yes
‘sag’
‘l2’, None
yes
‘saga’
‘elasticnet’, ‘l1’, ‘l2’, None
yes
Note
‘sag’ and ‘saga’ fast convergence is only guaranteed on featureswith approximately the same scale. You can preprocess the data witha scaler from
sklearn.preprocessing.See also
Refer to theUser Guide for moreinformation regarding
LogisticRegressionand more specifically theTablesummarizing solver/penalty supports.Added in version 0.17:Stochastic Average Gradient (SAG) descent solver. Multinomial support inversion 0.18.
Added in version 0.19:SAGA solver.
Changed in version 0.22:The default solver changed from ‘liblinear’ to ‘lbfgs’ in 0.22.
Added in version 1.2:newton-cholesky solver. Multinomial support in version 1.6.
- max_iterint, default=100
Maximum number of iterations taken for the solvers to converge.
- multi_class{‘auto’, ‘ovr’, ‘multinomial’}, default=’auto’
If the option chosen is ‘ovr’, then a binary problem is fit for eachlabel. For ‘multinomial’ the loss minimised is the multinomial loss fitacross the entire probability distribution,even when the data isbinary. ‘multinomial’ is unavailable when solver=’liblinear’.‘auto’ selects ‘ovr’ if the data is binary, or if solver=’liblinear’,and otherwise selects ‘multinomial’.
Added in version 0.18:Stochastic Average Gradient descent solver for ‘multinomial’ case.
Changed in version 0.22:Default changed from ‘ovr’ to ‘auto’ in 0.22.
Deprecated since version 1.5:
multi_classwas deprecated in version 1.5 and will be removed in 1.8.From then on, the recommended ‘multinomial’ will always be used forn_classes>=3.Solvers that do not support ‘multinomial’ will raise an error.Usesklearn.multiclass.OneVsRestClassifier(LogisticRegression())if youstill want to use OvR.- verboseint, default=0
For the liblinear and lbfgs solvers set verbose to any positivenumber for verbosity.
- warm_startbool, default=False
When set to True, reuse the solution of the previous call to fit asinitialization, otherwise, just erase the previous solution.Useless for liblinear solver. Seethe Glossary.
Added in version 0.17:warm_start to supportlbfgs,newton-cg,sag,saga solvers.
- n_jobsint, default=None
Number of CPU cores used when parallelizing over classes ifmulti_class=’ovr’”. This parameter is ignored when the
solverisset to ‘liblinear’ regardless of whether ‘multi_class’ is specified ornot.Nonemeans 1 unless in ajoblib.parallel_backendcontext.-1means using all processors.SeeGlossary for more details.- l1_ratiofloat, default=None
The Elastic-Net mixing parameter, with
0<=l1_ratio<=1. Onlyused ifpenalty='elasticnet'. Settingl1_ratio=0is equivalentto usingpenalty='l2', while settingl1_ratio=1is equivalentto usingpenalty='l1'. For0<l1_ratio<1, the penalty is acombination of L1 and L2.
- Attributes:
- classes_ndarray of shape (n_classes, )
A list of class labels known to the classifier.
- coef_ndarray of shape (1, n_features) or (n_classes, n_features)
Coefficient of the features in the decision function.
coef_is of shape (1, n_features) when the given problem is binary.In particular, whenmulti_class='multinomial',coef_correspondsto outcome 1 (True) and-coef_corresponds to outcome 0 (False).- intercept_ndarray of shape (1,) or (n_classes,)
Intercept (a.k.a. bias) added to the decision function.
If
fit_interceptis set to False, the intercept is set to zero.intercept_is of shape (1,) when the given problem is binary.In particular, whenmulti_class='multinomial',intercept_corresponds to outcome 1 (True) and-intercept_corresponds tooutcome 0 (False).- n_features_in_int
Number of features seen duringfit.
Added in version 0.24.
- feature_names_in_ndarray of shape (
n_features_in_,) Names of features seen duringfit. Defined only when
Xhas feature names that are all strings.Added in version 1.0.
- n_iter_ndarray of shape (n_classes,) or (1, )
Actual number of iterations for all classes. If binary or multinomial,it returns only 1 element. For liblinear solver, only the maximumnumber of iteration across all classes is given.
Changed in version 0.20:In SciPy <= 1.0.0 the number of lbfgs iterations may exceed
max_iter.n_iter_will now report at mostmax_iter.
See also
SGDClassifierIncrementally trained logistic regression (when given the parameter
loss="log_loss").LogisticRegressionCVLogistic regression with built-in cross validation.
Notes
The underlying C implementation uses a random number generator toselect features when fitting the model. It is thus not uncommon,to have slightly different results for the same input data. Ifthat happens, try with a smaller tol parameter.
Predict output may not match that of standalone liblinear in certaincases. Seedifferences from liblinearin the narrative documentation.
References
- L-BFGS-B – Software for Large-scale Bound-constrained Optimization
Ciyou Zhu, Richard Byrd, Jorge Nocedal and Jose Luis Morales.http://users.iems.northwestern.edu/~nocedal/lbfgsb.html
- LIBLINEAR – A Library for Large Linear Classification
- SAG – Mark Schmidt, Nicolas Le Roux, and Francis Bach
Minimizing Finite Sums with the Stochastic Average Gradienthttps://hal.inria.fr/hal-00860051/document
- SAGA – Defazio, A., Bach F. & Lacoste-Julien S. (2014).
“SAGA: A Fast Incremental Gradient Method With Supportfor Non-Strongly Convex Composite Objectives”
- Hsiang-Fu Yu, Fang-Lan Huang, Chih-Jen Lin (2011). Dual coordinate descent
methods for logistic regression and maximum entropy models.Machine Learning 85(1-2):41-75.https://www.csie.ntu.edu.tw/~cjlin/papers/maxent_dual.pdf
Examples
>>>fromsklearn.datasetsimportload_iris>>>fromsklearn.linear_modelimportLogisticRegression>>>X,y=load_iris(return_X_y=True)>>>clf=LogisticRegression(random_state=0).fit(X,y)>>>clf.predict(X[:2,:])array([0, 0])>>>clf.predict_proba(X[:2,:])array([[9.82e-01, 1.82e-02, 1.44e-08], [9.72e-01, 2.82e-02, 3.02e-08]])>>>clf.score(X,y)0.97
For a comparison of the LogisticRegression with other classifiers see:Plot classification probability.
- decision_function(X)[source]#
Predict confidence scores for samples.
The confidence score for a sample is proportional to the signeddistance of that sample to the hyperplane.
- Parameters:
- X{array-like, sparse matrix} of shape (n_samples, n_features)
The data matrix for which we want to get the confidence scores.
- Returns:
- scoresndarray of shape (n_samples,) or (n_samples, n_classes)
Confidence scores per
(n_samples,n_classes)combination. In thebinary case, confidence score forself.classes_[1]where >0 meansthis class would be predicted.
- densify()[source]#
Convert coefficient matrix to dense array format.
Converts the
coef_member (back) to a numpy.ndarray. This is thedefault format ofcoef_and is required for fitting, so callingthis method is only required on models that have previously beensparsified; otherwise, it is a no-op.- Returns:
- self
Fitted estimator.
- fit(X,y,sample_weight=None)[source]#
Fit the model according to the given training data.
- Parameters:
- X{array-like, sparse matrix} of shape (n_samples, n_features)
Training vector, where
n_samplesis the number of samples andn_featuresis the number of features.- yarray-like of shape (n_samples,)
Target vector relative to X.
- sample_weightarray-like of shape (n_samples,) default=None
Array of weights that are assigned to individual samples.If not provided, then each sample is given unit weight.
Added in version 0.17:sample_weight support to LogisticRegression.
- Returns:
- self
Fitted estimator.
Notes
The SAGA solver supports both float64 and float32 bit arrays.
- get_metadata_routing()[source]#
Get metadata routing of this object.
Please checkUser Guide on how the routingmechanism works.
- Returns:
- routingMetadataRequest
A
MetadataRequestencapsulatingrouting information.
- get_params(deep=True)[source]#
Get parameters for this estimator.
- Parameters:
- deepbool, default=True
If True, will return the parameters for this estimator andcontained subobjects that are estimators.
- Returns:
- paramsdict
Parameter names mapped to their values.
- predict(X)[source]#
Predict class labels for samples in X.
- Parameters:
- X{array-like, sparse matrix} of shape (n_samples, n_features)
The data matrix for which we want to get the predictions.
- Returns:
- y_predndarray of shape (n_samples,)
Vector containing the class labels for each sample.
- predict_log_proba(X)[source]#
Predict logarithm of probability estimates.
The returned estimates for all classes are ordered by thelabel of classes.
- Parameters:
- Xarray-like of shape (n_samples, n_features)
Vector to be scored, where
n_samplesis the number of samples andn_featuresis the number of features.
- Returns:
- Tarray-like of shape (n_samples, n_classes)
Returns the log-probability of the sample for each class in themodel, where classes are ordered as they are in
self.classes_.
- predict_proba(X)[source]#
Probability estimates.
The returned estimates for all classes are ordered by thelabel of classes.
For a multi_class problem, if multi_class is set to be “multinomial”the softmax function is used to find the predicted probability ofeach class.Else use a one-vs-rest approach, i.e. calculate the probabilityof each class assuming it to be positive using the logistic functionand normalize these values across all the classes.
- Parameters:
- Xarray-like of shape (n_samples, n_features)
Vector to be scored, where
n_samplesis the number of samples andn_featuresis the number of features.
- Returns:
- Tarray-like of shape (n_samples, n_classes)
Returns the probability of the sample for each class in the model,where classes are ordered as they are in
self.classes_.
- score(X,y,sample_weight=None)[source]#
Returnaccuracy on provided data and labels.
In multi-label classification, this is the subset accuracywhich is a harsh metric since you require for each sample thateach label set be correctly predicted.
- Parameters:
- Xarray-like of shape (n_samples, n_features)
Test samples.
- yarray-like of shape (n_samples,) or (n_samples, n_outputs)
True labels for
X.- sample_weightarray-like of shape (n_samples,), default=None
Sample weights.
- Returns:
- scorefloat
Mean accuracy of
self.predict(X)w.r.t.y.
- set_fit_request(*,sample_weight:bool|None|str='$UNCHANGED$')→LogisticRegression[source]#
Configure whether metadata should be requested to be passed to the
fitmethod.Note that this method is only relevant when this estimator is used as asub-estimator within ameta-estimator and metadata routing is enabledwith
enable_metadata_routing=True(seesklearn.set_config).Please check theUser Guide on how the routingmechanism works.The options for each parameter are:
True: metadata is requested, and passed tofitif provided. The request is ignored if metadata is not provided.False: metadata is not requested and the meta-estimator will not pass it tofit.None: metadata is not requested, and the meta-estimator will raise an error if the user provides it.str: metadata should be passed to the meta-estimator with this given alias instead of the original name.
The default (
sklearn.utils.metadata_routing.UNCHANGED) retains theexisting request. This allows you to change the request for someparameters and not others.Added in version 1.3.
- Parameters:
- sample_weightstr, True, False, or None, default=sklearn.utils.metadata_routing.UNCHANGED
Metadata routing for
sample_weightparameter infit.
- Returns:
- selfobject
The updated object.
- set_params(**params)[source]#
Set the parameters of this estimator.
The method works on simple estimators as well as on nested objects(such as
Pipeline). The latter haveparameters of the form<component>__<parameter>so that it’spossible to update each component of a nested object.- Parameters:
- **paramsdict
Estimator parameters.
- Returns:
- selfestimator instance
Estimator instance.
- set_score_request(*,sample_weight:bool|None|str='$UNCHANGED$')→LogisticRegression[source]#
Configure whether metadata should be requested to be passed to the
scoremethod.Note that this method is only relevant when this estimator is used as asub-estimator within ameta-estimator and metadata routing is enabledwith
enable_metadata_routing=True(seesklearn.set_config).Please check theUser Guide on how the routingmechanism works.The options for each parameter are:
True: metadata is requested, and passed toscoreif provided. The request is ignored if metadata is not provided.False: metadata is not requested and the meta-estimator will not pass it toscore.None: metadata is not requested, and the meta-estimator will raise an error if the user provides it.str: metadata should be passed to the meta-estimator with this given alias instead of the original name.
The default (
sklearn.utils.metadata_routing.UNCHANGED) retains theexisting request. This allows you to change the request for someparameters and not others.Added in version 1.3.
- Parameters:
- sample_weightstr, True, False, or None, default=sklearn.utils.metadata_routing.UNCHANGED
Metadata routing for
sample_weightparameter inscore.
- Returns:
- selfobject
The updated object.
- sparsify()[source]#
Convert coefficient matrix to sparse format.
Converts the
coef_member to a scipy.sparse matrix, which forL1-regularized models can be much more memory- and storage-efficientthan the usual numpy.ndarray representation.The
intercept_member is not converted.- Returns:
- self
Fitted estimator.
Notes
For non-sparse models, i.e. when there are not many zeros in
coef_,this may actuallyincrease memory usage, so use this method withcare. A rule of thumb is that the number of zero elements, which canbe computed with(coef_==0).sum(), must be more than 50% for thisto provide significant benefits.After calling this method, further fitting with the partial_fitmethod (if any) will not work until you call densify.
Gallery examples#
Pipelining: chaining a PCA and a logistic regression
Visualizing the probabilistic predictions of a VotingClassifier
Recursive feature elimination with cross-validation
Decision Boundaries of Multinomial and One-vs-Rest Logistic Regression
Multiclass sparse logistic regression on 20newgroups
MNIST classification using multinomial logistic + L1
Post-tuning the decision threshold for cost-sensitive learning
Balance model complexity and cross-validated score
Class Likelihood Ratios to measure classification performance
Multiclass Receiver Operating Characteristic (ROC)
Post-hoc tuning the cut-off point of decision function
Multilabel classification using a classifier chain
Restricted Boltzmann Machine features for digit classification
Classification of text documents using sparse features
