# GLM¶

## Introduction¶

Generalized Linear Models (GLM) estimate regression models for outcomes following exponential distributions. In addition to the Gaussian (i.e. normal) distribution, these include Poisson, binomial, and gamma distributions. Each serves a different purpose, and depending on distribution and link function choice, can be used either for prediction or classification.

The GLM suite includes:

- Gaussian regression
- Poisson regression
- Binomial regression (classification)
- Multinomial classification
- Gamma regression

## Defining a GLM Model¶

model_id: (Optional) Specify a custom name for the model to use as a reference. By default, H2O automatically generates a destination key.

training_frame: (Required) Specify the dataset used to build the model.

**NOTE**: In Flow, if you click the**Build a model**button from the`Parse`

cell, the training frame is entered automatically.validation_frame: (Optional) Specify the dataset used to evaluate the accuracy of the model.

nfolds: Specify the number of folds for cross-validation.

seed: Specify the random number generator (RNG) seed for algorithm components dependent on randomization. The seed is consistent for each H2O instance so that you can create models with the same starting conditions in alternative configurations.

y: (Required) Specify the column to use as the independent variable.

- For a regression model, this column must be numeric (
**Real**or**Int**). - For a classification model, this column must be categorical
(
**Enum**or**String**). If the family is**Binomial**, the dataset cannot contain more than two levels.

- For a regression model, this column must be numeric (
keep_cross_validation_predictions: Specify whether to keep the cross-validation predictions.

keep_cross_validation_fold_assignment: Enable this option to preserve the cross-validation fold assignment.

fold_assignment: (Applicable only if a value for

**nfolds**is specified and**fold_column**is not specified) Specify the cross-validation fold assignment scheme. The available options are AUTO (which is Random), Random, Modulo, or Stratified (which will stratify the folds based on the response variable for classification problems).fold_column: Specify the column that contains the cross-validation fold index assignment per observation.

ignored_columns: (Optional) Specify the column or columns to be excluded from the model. In Flow, click the checkbox next to a column name to add it to the list of columns excluded from the model. To add all columns, click the

**All**button. To remove a column from the list of ignored columns, click the X next to the column name. To remove all columns from the list of ignored columns, click the**None**button. To search for a specific column, type the column name in the**Search**field above the column list. To only show columns with a specific percentage of missing values, specify the percentage in the**Only show columns with more than 0% missing values**field. To change the selections for the hidden columns, use the**Select Visible**or**Deselect Visible**buttons.ignore_const_cols: Enable this option to ignore constant training columns, since no information can be gained from them. This option is enabled by default.

score_each_iteration: (Optional) Enable this option to score during each iteration of the model training.

offset_column: Specify a column to use as the offset; the value cannot be the same as the value for the

`weights_column`

.**Note**: Offsets are per-row “bias values” that are used during model training. For Gaussian distributions, they can be seen as simple corrections to the response (y) column. Instead of learning to predict the response (y-row), the model learns to predict the (row) offset of the response column. For other distributions, the offset corrections are applied in the linearized space before applying the inverse link function to get the actual response values. For more information, refer to the following link.weights_column: Specify a column to use for the observation weights, which are used for bias correction. The specified

`weights_column`

must be included in the specified`training_frame`

.*Python only*: To use a weights column when passing an H2OFrame to`x`

instead of a list of column names, the specified`training_frame`

must contain the specified``weights_column``.**Note**: Weights are per-row observation weights and do not increase the size of the data frame. This is typically the number of times a row is repeated, but non-integer values are supported as well. During training, rows with higher weights matter more, due to the larger loss function pre-factor.family: Specify the model type.

- If the family is
**gaussian**, the data must be numeric (**Real**or**Int**). - If the family is
**binomial**, the data must be categorical 2 levels/classes or binary (**Enum**or**Int**). - If the family is
**multinomial**, the data can be categorical with more than two levels/classes (**Enum**). - If the family is
**poisson**, the data must be numeric and non-negative (**Int**). - If the family is
**gamma**, the data must be numeric and continuous and positive (**Real**or**Int**). - If the family is
**tweedie**, the data must be numeric and continuous (**Real**) and non-negative. - If the family is
**quasibinomial**, the data must be numeric.

- If the family is
tweedie_variance_power: (Only applicable if

*Tweedie*is specified for**Family**) Specify the Tweedie variance power.tweedie_link_power: (Only applicable if

*Tweedie*is specified for**Family**) Specify the Tweedie link power.solver: Specify the solver to use (AUTO, IRLSM, L_BFGS, COORDINATE_DESCENT_NAIVE, or COORDINATE_DESCENT). IRLSM is fast on problems with a small number of predictors and for lambda search with L1 penalty, while L_BFGS scales better for datasets with many columns. COORDINATE_DESCENT is IRLSM with the covariance updates version of cyclical coordinate descent in the innermost loop. COORDINATE_DESCENT_NAIVE is IRLSM with the naive updates version of cyclical coordinate descent in the innermost loop. COORDINATE_DESCENT_NAIVE and COORDINATE_DESCENT are currently experimental.

alpha: Specify the regularization distribution between L1 and L2.

lambda: Specify the regularization strength.

lambda_search: Specify whether to enable lambda search, starting with lambda max. If you also specify a value for

`lambda_min_ratio`

, then this value is interpreted as lambda min. If you do not specify a value for`lambda_min_ratio`

, then GLM will calculate the minimum lambda.early_stopping: Specify whether to stop early when there is no more relative improvement on the training or validation set.

nlambdas: (Applicable only if

**lambda_search**is enabled) Specify the number of lambdas to use in the search. The default is 100.standardize: Specify whether to standardize the numeric columns to have a mean of zero and unit variance. Standardization is highly recommended; if you do not use standardization, the results can include components that are dominated by variables that appear to have larger variances relative to other attributes as a matter of scale, rather than true contribution. This option is enabled by default.

missing_values_handling: Specify how to handle missing values (Skip or MeanImputation).

compute_p_values: Request computation of p-values. Only applicable with no penalty (lambda = 0 and no beta constraints). Setting remove_collinear_columns is recommended. H2O will return an error if p-values are requested and there are collinear columns and remove_collinear_columns flag is not enabled.

remove_collinear_columns: Specify whether to automatically remove collinear columns during model-building. When enabled, collinear columns will be dropped from the model and will have 0 coefficient in the returned model. This can only be set if there is no regularization (lambda=0).

intercept: Specify whether to include a constant term in the model. This option is enabled by default.

non_negative: Specify whether to force coefficients to have non-negative values.

max_iterations: Specify the number of training iterations.

objective_epsilon: Specify a threshold for convergence. If the objective value is less than this threshold, the model is converged.

beta_epsilon: Specify the beta epsilon value. If the L1 normalization of the current beta change is below this threshold, consider using convergence.

gradient_epsilon: (For L-BFGS only) Specify a threshold for convergence. If the objective value (using the L-infinity norm) is less than this threshold, the model is converged.

link: Specify a link function (Identity, Family_Default, Logit, Log, Inverse, or Tweedie).

- If the family is
**Gaussian**, then**Identity**,**Log**, and**Inverse**are supported. - If the family is
**Binomial**, then**Logit**is supported. - If the family is
**Poisson**, then**Log**and**Identity**are supported. - If the family is
**Gamma**, then**Inverse**,**Log**, and**Identity**are supported. - If the family is
**Tweedie**, then only**Tweedie**is supported. - If the family is
**Multinomial**, then only**Family_Default**is supported. (This defaults to`multinomial`

.) - If the family is
**Quasibinomial**, then only**Logit**is supported.

- If the family is
prior: Specify prior probability for p(y==1). Use this parameter for logistic regression if the data has been sampled and the mean of response does not reflect reality.

**Note**: This is a simple method affecting only the intercept. You may want to use weights and offset for a better fit.lambda_min_ratio: Specify the minimum lambda to use for lambda search (specified as a ratio of

**lambda_max**).beta_constraints: Specify a dataset to use beta constraints. The selected frame is used to constraint the coefficient vector to provide upper and lower bounds. The dataset must contain a names column with valid coefficient names.

max_active_predictors: Specify the maximum number of active predictors during computation. This value is used as a stopping criterium to prevent expensive model building with many predictors.

interactions: Specify a list of predictor column indices to interact. All pairwise combinations will be computed for this list.

## Interpreting a GLM Model¶

By default, the following output displays:

- A graph of the normalized coefficient magnitudes
- Output (model category, model summary, scoring history, training metrics, validation metrics, best lambda, threshold, residual deviance, null deviance, residual degrees of freedom, null degrees of freedom, AIC, AUC, binomial, rank)
- Coefficients
- Coefficient magnitudes

## Classification and Regression¶

GLM can produce two categories of models: classication (binary classication only) and regression. Logistic regression is the GLM performing binary classication.

The data type of the response column determines the model category. If the response is a categorical variable (also called a factor or an enum), then a classication model is created. If the response column data type is numeric (either integer or real), then a regression model is created.

### Handling of Categorical Variables¶

If the response column is categorical, then a classication model is created. GLM only supports binary classication, so the response column can only have two levels. Categorical predictor columns may have more than two levels. We recommend letting GLM handle categorical columns, as it can take advantage of the categorical column for better performance and memory utilization.

We strongly recommend avoiding one-hot encoding categorical columns with any levels into many binary columns, as this is very inefficient. This is especially true for Python users who are used to expanding their categorical variables manually for other frameworks.

### Handling of Numeric Variables¶

When GLM performs regression (with factor columns), one category can be left out to avoid multicollinearity. If regularization is disabled (`lambda = 0`

), then one category is left out. However, when using a the default lambda parameter, all categories are included.

The reason for the different behavior with regularization is that collinearity is not a problem with regularization. And it’s better to leave regularization to find out which level to ignore (or how to distribute the coefficients between the levels).

## Family and Link Functions¶

GLM problems consist of three main components:

- A random component \(f\) for the dependent variable \(y\): The density function \(f(y;\theta,\phi)\) has a probability distribution from the exponential family parametrized by \(\theta\) and \(\phi\). This removes the restriction on the distribution of the error and allows for non-homogeneity of the variance with respect to the mean vector.
- A systematic component (linear model) \(\eta\): \(\eta = X\beta\), where \(X\) is the matrix of all observation vectors \(x_i\).
- A link function \(g\): \(E(y) = \mu = {g^-1}(\eta)\) relates the expected value of the response \(\mu\) to the linear component \(\eta\). The link function can be any monotonic differentiable function. This relaxes the constraints on the additivity of the covariates, and it allows the response to belong to a restricted range of values depending on the chosen transformation \(g\).

Accordingly, in order to specify a GLM problem, you must choose a family function \(f\), link function \(g\), and any parameters needed to train the model.

### Families¶

The `family`

option specifies a probability distribution from an exponential family. You can specify one of the following, based on the response column type:

`gaussian`

: The data must be numeric (Real or Int). This is the default family.`binomial`

: The data must be categorical 2 levels/classes or binary (Enum or Int).`quasibinomial`

: The data must be numeric.`multinomial`

: The data can be categorical with more than two levels/classes (Enum).`poisson`

: The data must be numeric and non-negative (Int).`gamma`

: The data must be numeric and continuous and positive (Real or Int).`tweedie`

: The data must be numeric and continuous (Real) and non-negative.

**Note**: If your response column is binomial, then you must convert that column to a categorical (`.asfactor()`

in Python and `as.factor()`

in R) and set `family = binomial`

. The following configurations can lead to unexpected results.

- If you DO convert the response column to categorical and DO NOT to set
`family=binomial`

, then you will receive an error message.- If you DO NOT convert response column to categorical and DO NOT set the family, then GLM will assume the 0s and 1s are numbers and will provide a Gaussian solution to a regression problem.

#### Linear Regression (Gaussian Family)¶

Linear regression corresponds to the Gaussian family model. The link function \(g\) is the identity, and density \(f\) corresponds to a normal distribution. It is the simplest example of a GLM but has many uses and several advantages over other families. Specifically, it is faster and requires more stable computations. Gaussian models the dependency between a response \(y\) and a covariates vector \(x\) as a linear function:

The model is fitted by solving the least squares problem, which is equivalent to maximizing the liklihood for the Gaussian family.

The deviance is the sum of the squared prediction errors:

#### Logistic Regression (Binomial Family)¶

Logistic regression is used for binary classification problems where the response is a categorical variable with two levels. It models the probability of an observation belonging to an output category given the data (for example, \(Pr(y=1|x)\)). The canonical link for the binomial family is the logit function (also known as log odds). Its inverse is the logistic function, which takes any real number and projects it onto the [0,1] range as desired to model the probability of belonging to a class. The corresponding s-curve is below:

The fitted model has the form:

This can alternatively be written as:

The model is fitted by maximizing the following penalized likelihood:

The corresponding deviance is equal to:

#### Pseudo-Logistic Regression (Quasibinomial Family)¶

The quasibinomial family option works in the same way as the aforementioned binomial family. The difference is that binomial models only support 0/1 for the values of the target. A quasibinomial model supports “pseudo” logistic regression and allows for two arbitrary integer values (for example -4, 7). Additional information about the quasibinomial option can be found in the “Estimating Effects on Rare Outcomes: Knowledge is Power” paper.

#### Multiclass Classification (Multinomial Family)¶

Multinomial family generalization of the binomial model is used for multi-class response variables. Similar to the binomail family, GLM models the conditional probability of observing class “c” given “x”. A vector of coefficients exists for each of the output classes. (\(\beta\) is a matrix.) The probabilities are defined as:

where \(\beta_c\) is a vector of coefficients for class “c”, and \(y_{i,k}\) is the \(k\text{th}\) element of the binary vector produced by expanding the response variable using one-hot encoding (i.e., \(y_{i,k} == 1\) iff the response at the \(i\text{th}\) observation is “k”; otherwise it is 0.)

#### Poisson Models¶

Poisson regression is typically used for datasets where the response represents counts, and the errors are assumed to have a Poisson distribution. In general, it can be applied to any data where the response is non-negative. It models the dependency between the response and covariates as:

The model is fitted by maximizing the corresponding penalized likelihood:

The corresponding deviance is equal to:

#### Gamma Models¶

The gamma distribution is useful for modeling a positive continuous response variable, where the conditional variance of the response grows with its mean, but the coefficientof variation of the response \(\sigma^2(y_i)/\mu_i\) is constant. It is usually used with the log link \(g(\mu_i) = \text{log}(\mu_i)\) or the inverse link \(g(\mu_i) = \dfrac {1} {\mu_i}\), which is equivalent to the canonical link.

The model is fitted by solving the following likelihood maximization:

The corresponding deviance is equal to:

#### Tweedie Models¶

Tweedie distributions are a family of distributions that include gamma, normal, Poisson, and their combination. Tweedie distributions are especially useful for modeling positive continuous variables with exact zeros. The variance of the Tweedie distribution is proportional to the \(p\text{th}\) power of the mean \(var(y_i) = \phi\mu{^p_i}\).

The Tweedie distribution is parametrized by variance power \(p\). It is defined for all \(p\) values except in the (0,1) interval and has the following distributions as special cases:

- \(p = 0\): Normal
- \(p = 1\): Poisson
- \(p \in (1,2)\): Compound Poisson, non-negative with mass at zero
- \(p = 2\): Gamma
- \(p = 3\): Gaussian
- \(p > 2\): Stable, with support on the positive reals

For \(p > 1\), the model likelood to maximize has the form:

where \(\kappa(\mu,p) = \mu^{2-p} / (2-p)\) for \(p \neq 2\) and \(\kappa(\mu,p) = \text{log} (\mu)\) for \(p=2\), and where the function \(a(y_i,\phi)\) is evaluated using series expansion because it does not have an analytical solution. The link function in the GLM representation of the Tweedie distribution defaults to \(g(\mu) = \mu^q = \eta = X\beta\) with \(q=1-p\). The link power \(q\) can be set to other values, including \(q=0\), which is interpreated as \(\text{log}(\mu)=\eta\).

The corresponding deviance when \(p \neq 1\) and \(p \neq 2\) is equal to:

### Links¶

As indicated previously, a link function \(g\): \(E(y) = \mu = {g^-1}(\eta)\) relates the expected value of the response \(\mu\) to the linear component \(\eta\). The link function can be any monotonic differentiable function. This relaxes the constraints on the additivity of the covariates, and it allows the response to belong to a restricted range of values depending on the chosen transformation \(g\).

H2O’s GLM supports the following link functions: Family_Default, Identity, Logit, Log, Inverse, and Tweedie.

The following table describes the allowed Family/Link combinations.

Family |
Link Function |
|||||

Family_Default | Identity | Logit | Log | Inverse | Tweedie | |

Binomial | X | X | ||||

Quasibinomial | X | X | ||||

Multinomial | X | |||||

Gaussian | X | X | X | X | ||

Poisson | X | X | X | |||

Gamma | X | X | X | X | ||

Tweedie | X | X |

## Regularization¶

Regularization is used to attempt to solve problems with overfitting that can occur in GLM. Penalties can be introduced to the model building process to avoid overfitting, to reduce variance of the prediction error, and to handle correlated predictors. The two most common penalized models are ridge regression and LASSO (least absolute shrinkage and selection operator). The elastic net combines both penalties using both the `alpha`

and `lambda`

options (i.e., values greater than 0 for both).

### LASSO and Ridge Regression¶

LASSO represents the \(\ell{_1}\) penalty and is an alternative regularized least squares method that penalizes the sum of the absolute coefficents \(||\beta||{_1} = \sum{^p_{k=1}} \beta{^2_k}\). LASSO leads to a sparse solution when the tuning parameter is sufficiently large. As the tuning parameter value \(\lambda\) is increased, all coefficients are set to zero. Because reducing parameters to zero removes them from the model, LASSO is a good selection tool.

Ridge regression penalizes the \(\ell{_2}\) norm of the model coefficients \(||\beta||{^2_2} = \sum{^p_{k=1}} \beta{^2_k}\). It provides greater numerical stability and is easier and faster to compute than LASSO. It keeps all the predictors in the model and shrinks them proportionally. Ridge regression reduces coefficient values simultaneously as the penalty is increased without setting any of them to zero.

Variable selection is important in numerous modern applications wiht many covariates where the \(\ell{_1}\) penalty has proven to be successful. Therefore, if the number of variables is large or if the solution is known to be sparse, we recommend using LASSO, which will select a small number of variables for sufficiently high \(\lambda\) that could be crucial to the inperpretability of the mode. The \(\ell{_2}\) norm does not have this effect; it shrinks the coefficients but does not set them exactly to zero.

The two penalites also differ in the presence of correlated predictors. The \(\ell{_2}\) penalty shrinks coefficients for correlated columns toward each other, while the \(\ell{_1}\) penalty tends to select only one of them and sets the other coefficients to zero. Using the elastic net argument \(\alpha\) combines these two behaviors.

The elastic net method selects variables and preserves the grouping effect (shrinking coefficients of correlated columns together). Moreover, while the number of predictors that can enter a LASSO model saturates at min \((n,p)\) (where \(n\) is the number of observations, and \(p\) is the number of variables in the model), the elastic net does not have this limitation and can fit models with a larger number of predictors.

### Elastic Net Penalty¶

As indicated previously, elastic net regularization is a combination of the \(\ell{_1}\) and \(\ell{_2}\) penalties parametrized by the \(\alpha\) and \(\lambda\) arguments (similar to “Regularization Paths for Genarlized Linear Models via Coordinate Descent” by Friedman et all).

- \(\alpha\) controls the elastic net penalty distribution between the \(\ell_1\) and \(\ell_2\) norms. It can have any value in the [0,1] range or a vector of values (via grid search). If \(\alpha=0\), then H2O solves the GLM using ridge regression. If \(\alpha=1\), then LASSO penalty is used.
- \(\lambda\) controls the penalty strength. The range is any positive value or a vector of values (via grid search). Note that \(\lambda\) values are capped at \(\lambda_{max}\), which is the smallest \(\lambda\) for which the solution is all zeros (except for the intercept term).

The combination of the \(\ell_1\) and \(\ell_2\) penalties is beneficial because \(\ell_1\) induces sparsity, while \(\ell_2\) gives stability and encourages the grouping effect (where a group of correlated variables tend to be dropped or added into the model simultaneously). When focusing on sparsity, one possible use of the \(\alpha\) argument involves using the \(\ell_1\) mainly with very little \(\ell_2\) (\(\alpha\) almost 1) to stabilize the computation and improve convergence speed.

### Regularization Parameters in GLM¶

To get the best possible model, we need to find the optimal values of the regularization parameters \(\alpha\) and \(\lambda\). To find the optimal values, H2O allows you to perform a grid search over \(\alpha\) and a special form of grid search called “lambda search” over \(\lambda\).

The recommended way to find optimal regularization settings on H2O is to do a grid search over a few \(\alpha\) values with an automatic lambda search for each \(\alpha\).

**Alpha**

The`alpha`

parameter controls the distribution between the \(\ell{_1}\) (LASSO) and \(\ell{_2}\) (ridge regression) penalties. A value of 1.0 for`alpha`

represents LASSO, and an`alpha`

value of 0.0 produces ridge reguression.

**Lambda**

The`lambda`

parameter controls the amount of regularization applied. If`lambda`

is 0.0, no regularization is applied, and the`alpha`

parameter is ignored. The default value for`lambda`

is calculated by H2O using a heuristic based on the training data. If you allow H2O to calculate the value for`lambda`

, you can see the chosen value in the model output.

### Lambda Search¶

If the `lambda_search`

option is set, GLM will compute models for full regularization path similar to glmnet. (See the glmnet paper.) Regularization path starts at lambda max (highest lambda values which makes sense - i.e. lowest value driving all coefficients to zero) and goes down to lambda min on log scale, decreasing regularization strength at each step. The returned model will have coefficients corresponding to the “optimal” lambda value as decided during training.

When looking for a sparse solution (`alpha`

> 0), lambda search can also be used to efficiently handle very wide datasets because it can filter out inactive predictors (noise) and only build models for a small subset of predictors. A possible use case for lambda search is to run it on a dataset with many predictors but limit the number of active predictors to a relatively small value.

Lambda search can be configured along with the following arguments:

`alpha`

: Regularization distribution between \(\ell_1\) and \(\ell_2\).`validation_frame`

and/or`nfolds`

: Used to select the best lambda based on the cross-validation performance or the validation or training data. If available, cross-validation performance takes precedence. If no validation data is available, the best lambda is selected based on training data performance and is therefore guaranteed to always be the minimal lambda computed since GLM cannot overfit on a training dataset.

Note: If running lambda search with a validation dataset and cross-validation disabled, the chosen lambda value corresponds to the lambda with the lowest validation error. The validation dataset is used to select the model, and the model performance should be evaluated on another independent test dataset.

`lambda_min_ratio`

and`nlambdas`

: The sequence of the \(\lambda\) values is automatically generated as an exponentially decreasing sequence. It ranges from \(\lambda_{max}\) (the smallest \(\lambda\) so that the solution is a model with all 0s) to \(\lambda_{min} =\)`lambda_min_ratio`

\(\times\) \(\lambda_{max}\).

H2O computes \(\lambda\) models sequentially and in decreasing order, warm-starting the model (using the previous solutin as the initial prediction) for \(\lambda_k\) with the solution for \(\lambda_{k-1}\). By warm-starting the models, we get better performance. Typically models for subsequent \(\lambda\) values are close to each other, so only a few iterations per \(\lambda\) are needed (two or three). This also achieves greater numerical stability because models with a higher penalty are easier to compute. This method starts with an easy problem and then continues to make small adjustments.

Note:`lambda_min_ratio`

and`nlambdas`

also specify the relative distance of any two lambdas in the sequence. This is important when applying recursive strong rules, which are only effective if the neighboring lambdas are “close” to each other. The default value for`lambda_min_ratio`

is \(1e^{-4}\), and the default value for`nlambdas`

is 100. This gives a ratio of 0.912. For best results when using strong rules, keep the ratio close to this default.

`max_active_predictors`

: This limits the number of active predictors. (The actual number of non-zero predictors in the model is going to be slightly lower.) It is useful when obtaining a sparse solution to avoid costly computation of models with too many predictors.

### Full Regularization Path¶

It can sometimes be useful to see the coefficients for all lambda values or to override default lambda selection. Full regularization path can be extracted from both R and python clients (currently not from Flow). It returns coefficients (and standardized coefficients) for all computed lambda values and also the explained deviances on both train and validation. Subsequently, the makeGLMModel call can be used to create an H2O GLM model with selected coefficients.

To extract the regularization path from R or python:

## Solvers¶

This section provides general guidelines for best performance from the GLM implementation details. The optimal solver depends on the data properties and prior information regarding the variables (if available). In general, the data are considered sparse if the ratio of zeros to non-zeros in the input matrix is greater than 10. The solution is sparse when only a subset of the original set of variables is intended to be kept in the model. In a dense solution, all predictors have non-zero coefficients in the final model.

In GLM, you can specify one of the following solvers:

- IRLSM: Iteratively Reweighted Least Squares Method (default)
- L_BFGS: Limited-memory Broyden-Fletcher-Goldfarb-Shanno algorithm
- AUTO: Sets the solver based on given data and parameters.
- COORDINATE_DESCENT: Coordinate Decent (experimental)
- COORDINATE_DESCENT_NAIVE: Coordinate Decent Naive (experimental)

### IRLSM and L-BFGS¶

IRLSM (the default) uses a Gram Matrix approach, which is efficient for tall and narrow datasets and when running lambda search via a sparse solution. For wider and dense datasets (thousands of predictors and up), the L-BFGS solver scales better. If there are fewer than 500 predictors (or so) in the data, then use the default solver (IRLSM). For larger numbers of predictors, we recommend running IRLSM with a lambda search, and then comparing it to L-BFGS with just one \(\ell_2\) penalty. For advanced users, we recommend the following general guidelines:

- For a dense solution and a dense dataset, use IRLSM if there are fewer than 500 predictors in the data; otherwise, use L-BFGS. Set
`alpha=0`

to include \(\ell_2\) regularization in the elastic net penalty term to avoid inducing sparsity in the model. - For a dense solution with a sparse dataset, use IRLSM if there are fewer than 2000 predictors in the data; otherwise, use L-BFGS. Set
`alpha=0`

. - For a sparse solution with a dense dataset, use IRLSM with
`lambda_search=TRUE`

if fewer than 500 active predictors in the solution are expected; otherwise, use L-BFGS. Set`alpha`

to be greater than 0 to add in an \(\ell_1\) penalty to the elastic net regularization, which induces sparsity in the estimated coefficients. - For a sparse solution with a sparse dataset, use IRLSM with
`lambda_search=TRUE`

if you expect less than 5000 active predictors in the solution; otherwise, use L-BFGS. Set`alpha`

to be greater than 0.

If you are unsure whether the solution should be sparse or dense, try both along with a grid of alpha values. The optimal model can be picked based on its performance on the validation data (or alternatively, based on the performance in cross-validation when not enough data is available to have a separate validation dataset).

### Coordinate Descent¶

In addition to IRLSM and L-BFGS, H2O’s GLM includes options for specifying Coordinate Descent. Cyclical Coordinate Descent is able to handle large datasets well and deals efficiently with sparse features. It can improve the performance when the data contains categorical variables with a large number of levels, as it is implemented to deal with such variables in a parallelized way.

**Note**: Both of these options are EXPERIMENTAL.

- Coordinate Descent is IRLSM with the covariance updates version of cyclical coordinate descent in the innermost loop. This version is faster when \(N > p\) and \(p\) ~ \(500\).
- Coordinate Descent Naive is IRLSM with the naive updates version of cyclical coordinate descent in the innermost loop.
- Coordinate Descent provides much better results if lambda search is enabled. Also, with bounds, it tends to get higher accuracy.

Both of the above method are explained in the glmnet paper.

## Modifying or Creating Custom GLM Model¶

In R and python, the makeGLMModel call can be used to create an H2O model from given coefficients. It needs a source GLM model trained on the same dataset to extract the dataset information. To make a custom GLM model from R or python:

- R: call h2o.makeGLMModel. This takes a model, a vector of coefficients, and (optional) decision threshold as parameters.
- Pyton: H2OGeneralizedLinearEstimator.makeGLMModel (static method) takes a model, a dictionary containing coefficients, and (optional) decision threshold as parameters.

## FAQ¶

**How does the algorithm handle missing values during training?**

Depending on the selected missing value handling policy, they are either imputed mean or the whole row is skipped. The default behavior is mean imputation. Note that categorical variables are imputed by adding an extra “missing” level. Optionally, glm can skip all rows with any missing values.

**How does the algorithm handle missing values during testing?**

Same as during training. If the missing value handling is set to skip and we are generating predictions, skipped rows will have Na (missing) prediction.

**What happens if the response has missing values?**

The rows with missing response are ignored during model training and validation.

**What happens during prediction if the new sample has categorical levels not seen in training?**

The value will be filled with either 0 or a special missing level (if trained with missing values, and`missing_value_handling`

was set toMeanImputation).

**Does it matter if the data is sorted?**

No.

**Should data be shuffled before training?**

No.

**How does the algorithm handle highly imbalanced data in a response column?**

GLM does not require special handling for imbalanced data.

**What if there are a large number of columns?**

IRLS will get quadratically slower with the number of columns. Try L-BFGS for datasets with more than 5-10 thousand columns.

**What if there are a large number of categorical factor levels?**

GLM internally one-hot encodes the categorical factor levels; the same limitations as with a high column count will apply.

**When building the model, does GLM use all features or a selection of the best features?**

Typically, GLM picks the best predictors, especially if lasso is used (`alpha = 1`

). By default, the GLM model includes an L1 penalty and will pick only the most predictive predictors.

**When running GLM, is it better to create a cluster that uses many smaller nodes or fewer larger nodes?**

A rough heuristic would be:

\(nodes ~=M *N^2/(p * 1e8)\)where \(M\) is the number of observations, \(N\) is the number of columns (categorical columns count as a single column in this case), and \(p\) is the number of CPU cores per node.

For example, a dataset with 250 columns and 1M rows would optimally use about 20 nodes with 32 cores each (following the formula \(250^2 *1000000/(32* 1e8) = 19.5 ~= 20)\).

**How is variable importance calculated for GLM?**

For GLM, the variable importance represents the coefficient magnitudes.

**How does GLM define and check for convergence during logistic regression?**

GLM includes three convergence criteria outside of max iterations:

`beta_epsilon`

: beta stops changing. This is used mostly with IRLSM.`gradient_epsilon`

: gradient is too small. This is used mostly with L-BFGS.`objective_epsilon`

: relative objective improvement is too small. This is used by all solvers.The default values below are based on a heuristic:

- The default for
`beta_epsilon`

is 1e-4.- The default for
`gradient_epsilon`

is 1e-6 if there is no regularization (`lambda = 0`

) or you are running with`lambda_search`

; 1e-4 otherwise.- The default for
`objective_epsilon`

is 1e-6 if`lambda = 0`

; 1e-4 otherwise.The default for

`max_iterations`

depends on the solver type and whether you run with lambda search:

- for IRLSM, the default is 50 if no lambda search; 10* number of lambdas otherwise
- for LBFGS, the default is number of classes (1 if not classification) * max(20, number of predictors /4 ) if no lambda search; it is number of classes * 100 * n-lambdas with lambda search.
You will receive a warning if you reach the maximum number of iterations. In some cases, GLM can end prematurely if it can not progress forward via line search. This typically happens when running a lambda search with IRLSM solver. Note that using CoordinateDescent solver fixes the issue.

## GLM Algorithm¶

Following the definitive text by P. McCullagh and J.A. Nelder (1989) on the generalization of linear models to non-linear distributions of the response variable Y, H2O fits GLM models based on the maximum likelihood estimation via iteratively reweighed least squares.

Let \(y_{1},…,y_{n}\) be n observations of the independent, random response variable \(Y_{i}\).

Assume that the observations are distributed according to a function from the exponential family and have a probability density function of the form:

\(f(y_{i})=exp[\frac{y_{i}\theta_{i} - b(\theta_{i})}{a_{i}(\phi)} + c(y_{i}; \phi)]\) where \(\theta\) and \(\phi\) are location and scale parameters, and \(a_{i}(\phi)\), \(b_{i}(\theta{i})\), and \(c_{i}(y_{i}; \phi)\) are known functions.

\(a_{i}\) is of the form \(a_{i}= \frac{\phi}{p_{i}}\) where \(p_{i}\) is a known prior weight.

When \(Y\) has a pdf from the exponential family:

\(E(Y_{i})=\mu_{i}=b^{\prime} var(Y_{i})=\sigma_{i}^2=b^{\prime\prime}(\theta_{i})a_{i}(\phi)\)

Let \(g(\mu_{i})=\eta_{i}\) be a monotonic, differentiable transformation of the expected value of \(y_{i}\). The function \(\eta_{i}\) is the link function and follows a linear model.

\(g(\mu_{i})=\eta_{i}=\mathbf{x_{i}^{\prime}}\beta\)

When inverted: \(\mu=g^{-1}(\mathbf{x_{i}^{\prime}}\beta)\)

**Maximum Likelihood Estimation**

For an initial rough estimate of the parameters \(\hat{\beta}\), use the estimate to generate fitted values: \(\mu_{i}=g^{-1}(\hat{\eta_{i}})\)

Let \(z\) be a working dependent variable such that \(z_{i}=\hat{\eta_{i}}+(y_{i}-\hat{\mu_{i}})\frac{d\eta_{i}}{d\mu_{i}}\),

where \(\frac{d\eta_{i}}{d\mu_{i}}\) is the derivative of the link function evaluated at the trial estimate.

Calculate the iterative weights: \(w_{i}=\frac{p_{i}}{[b^{\prime\prime}(\theta_{i})\frac{d\eta_{i}}{d\mu_{i}}^{2}]}\)

where \(b^{\prime\prime}\) is the second derivative of \(b(\theta_{i})\) evaluated at the trial estimate.

Assume \(a_{i}(\phi)\) is of the form \(\frac{\phi}{p_{i}}\). The weight \(w_{i}\) is inversely proportional to the variance of the working dependent variable \(z_{i}\) for current parameter estimates and proportionality factor \(\phi\).

Regress \(z_{i}\) on the predictors \(x_{i}\) using the weights \(w_{i}\) to obtain new estimates of \(\beta\).

\(\hat{\beta}=(\mathbf{X}^{\prime}\mathbf{W}\mathbf{X})^{-1}\mathbf{X}^{\prime}\mathbf{W}\mathbf{z}\)where \(\mathbf{X}\) is the model matrix, \(\mathbf{W}\) is a diagonal matrix of \(w_{i}\), and \(\mathbf{z}\) is a vector of the working response variable \(z_{i}\).

This process is repeated until the estimates \(\hat{\beta}\) change by less than the specified amount.

**Cost of computation**

H2O can process large data sets because it relies on parallel processes. Large data sets are divided into smaller data sets and processed simultaneously and the results are communicated between computers as needed throughout the process.

In GLM, data are split by rows but not by columns, because the predicted Y values depend on information in each of the predictor variable vectors. If O is a complexity function, N is the number of observations (or rows), and P is the number of predictors (or columns) then

\(Runtime \propto p^3+\frac{(N*p^2)}{CPUs}\)

Distribution reduces the time it takes an algorithm to process because it decreases N.

Relative to P, the larger that (N/CPUs) becomes, the more trivial p becomes to the overall computational cost. However, when p is greater than (N/CPUs), O is dominated by p.

\(Complexity = O(p^3 + N*p^2)\)

For more information about how GLM works, refer to the Generalized Linear Modeling booklet.

## References¶

Breslow, N E. “Generalized Linear Models: Checking Assumptions and Strengthening Conclusions.” Statistica Applicata 8 (1996): 23-41.

Frome, E L. “The Analysis of Rates Using Poisson Regression Models.” Biometrics (1983): 665-674.

Snee, Ronald D. “Validation of Regression Models: Methods and Examples.” Technometrics 19.4 (1977): 415-428.