LassoLarsIc / Regressor Layer

Lasso LARS with Information Criterion Selection.

Mathematical formulation: where:

  • IC is Information Criterion (AIC/BIC)
  • n is sample size
  • RSS is Residual Sum of Squares
  • k is model complexity
  • penalty is 2 (AIC) or log(n) (BIC)

Key characteristics:

  • Automatic model selection
  • Complexity penalization
  • Path-based computation
  • Statistical foundations

Advantages:

  • Objective selection
  • Balances fit and complexity
  • Theoretical guarantees
  • Interpretable criteria

Common applications:

  • Model selection
  • Feature importance
  • Scientific modeling
  • Time series analysis
  • High-dimensional data

Outputs:

  1. Predicted Table: Results with predictions
  2. Validation Results: Cross-validation metrics
  3. Test Metric: Hold-out performance
  4. Feature Importances: Selected coefficients
Table
0
0
Predicted Table
1
Validation Results
2
Test Metric
3
Feature Importances

SelectFeatures

[column, ...]

Feature column selection for Lasso LARS IC:

Requirements:

  1. Data properties:

    • Numeric values
    • No missing data
    • Finite numbers
    • Standardized features
  2. Statistical considerations:

    • Independence
    • Multicollinearity check
    • Scale compatibility
    • Noise patterns
  3. IC-specific needs:

    • Feature relevance
    • Complexity impact
    • Selection stability
    • Path behavior
  4. Preprocessing:

    • Scaling mandatory
    • Outlier treatment
    • Feature engineering
    • Correlation analysis

Best practices:

  • Consider model complexity
  • Monitor IC sensitivity
  • Check feature stability
  • Validate selections

Note: If empty, uses all numeric columns except target

Target column specification for Lasso LARS IC:

Requirements:

  1. Data type:

    • Numeric continuous
    • No missing values
    • Finite numbers
    • Real-valued
  2. Statistical properties:

    • Normality preferred
    • Constant variance
    • Independence
    • Signal-to-noise ratio
  3. IC considerations:

    • Noise estimation
    • Scale effects
    • RSS computation
    • Model selection impact
  4. Quality checks:

    • Distribution analysis
    • Outlier detection
    • Variance stability
    • Scale assessment

Best practices:

  • Validate noise assumptions
  • Monitor IC behavior
  • Check scale effects
  • Document transformations

Note: Must be a single numeric column

Params

oneof
DefaultParams

Default configuration for Lasso LARS IC:

Core settings:

  1. Model structure:

    • AIC criterion
    • Intercept included
    • Unrestricted coefficients
  2. Computation:

    • 500 max iterations
    • Machine precision eps
    • Auto noise variance
  3. Selection specifics:

    • Path-based computation
    • Information criterion
    • Automatic stopping

Best suited for:

  • Standard problems
  • Automatic selection
  • Statistical inference
  • Model comparison

Customizable parameters for Lasso LARS IC:

Parameter categories:

  1. Selection criteria:

    • Information criterion
    • Model complexity
    • Noise estimation
  2. Computation:

    • Numerical precision
    • Iteration limits
    • Stability control
  3. Model structure:

    • Intercept options
    • Constraints
    • Path computation

Trade-offs:

  • Bias vs variance
  • Complexity vs fit
  • Speed vs accuracy
Aic

Model selection criterion:

AIC (Akaike Information Criterion):

  • Penalty = 2k
  • Efficient prediction
  • Less conservative
  • Asymptotically unbiased

BIC (Bayesian Information Criterion):

  • Penalty = k·log(n)
  • Consistent selection
  • More conservative
  • True model recovery

Selection guide:

  • Prediction focus: AIC
  • Model selection: BIC
  • Small samples: AIC
  • Large samples: BIC
Aic ~
Bic ~
true

Intercept calculation control:

Model forms: With intercept: Without intercept:

Effects when True:

  • Centers predictions
  • Affects IC calculation
  • Improves model fit
  • Counts in complexity

Effects when False:

  • Origin-constrained
  • Simpler model
  • Lower complexity
  • Theory-driven cases
500

Maximum number of iterations to perform.

Impacts:

  • Path length limit
  • Model candidates
  • IC computation
  • Resource usage

Typical ranges:

  • Small problems: 100-300
  • Standard: 500
  • Complex: 1000+

Note: Each step evaluates IC

Eps

f64
1

Numerical precision parameter:

Usage:

Effects:

  • Cholesky stability
  • Path computation
  • IC calculation
  • Solution reliability

Typical values:

  • Standard: 1.0
  • Ill-conditioned: 10-100
  • Extreme cases: 100+
false

Whether to restrict coefficients to be >= 0.

Mathematical impact:

Applications:

  • Signal processing
  • Physical quantities
  • Concentration studies
  • Non-negative data

Effects:

  • Constrains path
  • Affects IC values
  • Modifies selection
  • Domain meaning

The estimated noise variance of the data.

Usage:

  • 0: Auto-estimated via OLS
  • >0: User-specified value

Impact on IC:

  • RSS scaling
  • Model selection
  • Complexity balance
  • Criterion accuracy

Best practices:

  • Use domain knowledge
  • Validate estimates
  • Consider uncertainty
  • Monitor sensitivity

Hyperparameter optimization for Lasso LARS IC:

Search space organization:

  1. Model selection:

    • Information criteria
    • Complexity control
    • Noise estimation
  2. Computation:

    • Numerical stability
    • Path computation
    • Resource limits
  3. Model structure:

    • Constraints
    • Intercept options
    • Parameter bounds

Best practices:

  • Compare criteria
  • Validate stability
  • Monitor complexity
  • Check consistency

Criterion

[enum, ...]
Aic

Model selection criterion:

AIC (Akaike Information Criterion):

  • Penalty = 2k
  • Efficient prediction
  • Less conservative
  • Asymptotically unbiased

BIC (Bayesian Information Criterion):

  • Penalty = k·log(n)
  • Consistent selection
  • More conservative
  • True model recovery

Selection guide:

  • Prediction focus: AIC
  • Model selection: BIC
  • Small samples: AIC
  • Large samples: BIC
Aic ~
Bic ~

FitIntercept

[bool, ...]
true

Intercept inclusion search:

Options:

  1. Standard: [true]

    • Normal modeling
    • Better fit
  2. Zero-intercept: [false]

    • Theory-driven
    • Simpler models
  3. Compare: [true, false]

    • Impact analysis
    • Complexity study

MaxIter

[u32, ...]
500

Maximum iterations search:

Search patterns:

  1. Basic range:

    • [100, 300, 500]
    • Standard problems
  2. Extended search:

    • [500, 1000, 2000]
    • Complex problems
  3. Comprehensive:

    • Based on features
    • Path complexity
    • Resource limits

Eps

[f64, ...]
1

Numerical precision search:

Search ranges:

  1. Standard stability:

    • [1.0, 10.0]
    • Normal cases
  2. Ill-conditioned:

    • [10.0, 100.0, 1000.0]
    • Numerical issues
  3. Extreme cases:

    • Higher values
    • Stability critical

Positive

[bool, ...]
false

Positive constraint search:

Options:

  1. Unconstrained: [false]

    • Standard modeling
    • Faster computation
  2. Constrained: [true]

    • Physical meaning
    • Domain requirements
  3. Compare: [true, false]

    • Impact study
    • Selection effects

NoiseVariance

[f64, ...]
0

Noise variance search space:

Search options:

  1. Auto-estimate: [0.0]

    • OLS-based
    • Data-driven
  2. Fixed values:

    • Domain knowledge
    • Prior estimates
  3. Range study:

    • Sensitivity analysis
    • Selection stability
R2score

Regression model evaluation metrics:

Purpose:

  • Model performance evaluation
  • Error measurement
  • Quality assessment
  • Model comparison

Selection criteria:

  • Error distribution
  • Scale sensitivity
  • Domain requirements
  • Business objectives
Default ~

Model's native scoring method:

  • Typically R² score
  • Model-specific implementation
  • Standard evaluation
  • Quick assessment
R2score ~

Coefficient of determination (R²):

Formula:

Properties:

  • Range: (-∞, 1]
  • 1: Perfect prediction
  • 0: Constant model
  • Negative: Worse than mean

Best for:

  • General performance
  • Variance explanation
  • Model comparison
  • Standard reporting
ExplainedVariance ~

Explained variance score:

Formula:

Properties:

  • Range: (-∞, 1]
  • Accounts for bias
  • Variance focus
  • Similar to R²

Best for:

  • Variance analysis
  • Bias assessment
  • Model stability
MaxError ~

Maximum absolute error:

Formula:

Properties:

  • Worst case error
  • Original scale
  • Sensitive to outliers
  • Upper error bound

Best for:

  • Critical applications
  • Error bounds
  • Safety margins
  • Risk assessment
NegMeanAbsoluteError ~

Negative mean absolute error:

Formula:

Properties:

  • Linear error scale
  • Robust to outliers
  • Original units
  • Negated for optimization

Best for:

  • Robust evaluation
  • Interpretable errors
  • Outlier presence
NegMeanSquaredError ~

Negative mean squared error:

Formula:

Properties:

  • Squared error scale
  • Outlier sensitive
  • Squared units
  • Negated for optimization

Best for:

  • Standard optimization
  • Large error penalty
  • Statistical analysis
NegRootMeanSquaredError ~

Negative root mean squared error:

Formula:

Properties:

  • Original scale
  • Outlier sensitive
  • Interpretable units
  • Negated for optimization

Best for:

  • Standard reporting
  • Interpretable errors
  • Model comparison
NegMeanSquaredLogError ~

Negative mean squared logarithmic error:

Formula:

Properties:

  • Relative error scale
  • For positive values
  • Sensitive to ratios
  • Negated for optimization

Best for:

  • Exponential growth
  • Relative differences
  • Positive predictions
NegMedianAbsoluteError ~

Negative median absolute error:

Formula:

Properties:

  • Highly robust
  • Original scale
  • Outlier resistant
  • Negated for optimization

Best for:

  • Robust evaluation
  • Heavy-tailed errors
  • Outlier presence
NegMeanPoissonDeviance ~

Negative Poisson deviance:

Formula:

Properties:

  • For count data
  • Non-negative values
  • Poisson assumption
  • Negated for optimization

Best for:

  • Count prediction
  • Event frequency
  • Rate modeling
NegMeanGammaDeviance ~

Negative Gamma deviance:

Formula:

Properties:

  • For positive continuous data
  • Constant CV assumption
  • Relative errors
  • Negated for optimization

Best for:

  • Positive continuous data
  • Multiplicative errors
  • Financial modeling
NegMeanAbsolutePercentageError ~

Negative mean absolute percentage error:

Formula:

Properties:

  • Percentage scale
  • Scale independent
  • For non-zero targets
  • Negated for optimization

Best for:

  • Relative performance
  • Scale-free comparison
  • Business metrics
D2AbsoluteErrorScore ~

D² score with absolute error:

Formula:

Properties:

  • Range: (-∞, 1]
  • Robust version of R²
  • Linear error scale
  • Outlier resistant

Best for:

  • Robust evaluation
  • Non-normal errors
  • Alternative to R²
D2PinballScore ~

D² score with pinball loss:

Properties:

  • Quantile focus
  • Asymmetric errors
  • Risk assessment
  • Distribution modeling

Best for:

  • Quantile regression
  • Risk analysis
  • Asymmetric costs
  • Distribution tails
D2TweedieScore ~

D² score with Tweedie deviance:

Properties:

  • Compound Poisson-Gamma
  • Flexible dispersion
  • Mixed distributions
  • Insurance modeling

Best for:

  • Insurance claims
  • Mixed continuous-discrete
  • Compound distributions
  • Specialized modeling

Split

oneof
DefaultSplit

Standard train-test split configuration optimized for general classification tasks.

Configuration:

  • Test size: 20% (0.2)
  • Random seed: 98
  • Shuffling: Enabled
  • Stratification: Based on target distribution

Advantages:

  • Preserves class distribution
  • Provides reliable validation
  • Suitable for most datasets

Best for:

  • Medium to large datasets
  • Independent observations
  • Initial model evaluation

Splitting uses the ShuffleSplit strategy or StratifiedShuffleSplit strategy depending on the field stratified. Note: If shuffle is false then stratified must be false.

Configurable train-test split parameters for specialized requirements. Allows fine-tuning of data division strategy for specific use cases or constraints.

Use cases:

  • Time series data
  • Grouped observations
  • Specific train/test ratios
  • Custom validation schemes

Random seed for reproducible splits. Ensures:

  • Consistent train/test sets
  • Reproducible experiments
  • Comparable model evaluations

Same seed guarantees identical splits across runs.

true

Data shuffling before splitting. Effects:

  • true: Randomizes order, better for i.i.d. data
  • false: Maintains order, important for time series

When to disable:

  • Time dependent data
  • Sequential patterns
  • Grouped observations
0.8

Proportion of data for training. Considerations:

  • Larger (e.g., 0.8-0.9): Better model learning
  • Smaller (e.g., 0.5-0.7): Better validation

Common splits:

  • 0.8: Standard (80/20 split)
  • 0.7: More validation emphasis
  • 0.9: More training emphasis
false

Maintain class distribution in splits. Important when:

  • Classes are imbalanced
  • Small classes present
  • Representative splits needed

Requirements:

  • Classification tasks only
  • Cannot use with shuffle=false
  • Sufficient samples per class

Cv

oneof
DefaultCv

Standard cross-validation configuration using stratified 3-fold splitting.

Configuration:

  • Folds: 3
  • Method: StratifiedKFold
  • Stratification: Preserves class proportions

Advantages:

  • Balanced evaluation
  • Reasonable computation time
  • Good for medium-sized datasets

Limitations:

  • May be insufficient for small datasets
  • Higher variance than larger fold counts
  • May miss some data patterns

Configurable stratified k-fold cross-validation for specific validation requirements.

Features:

  • Adjustable fold count with NFolds determining the number of splits.
  • Stratified sampling
  • Preserved class distributions

Use cases:

  • Small datasets (more folds)
  • Large datasets (fewer folds)
  • Detailed model evaluation
  • Robust performance estimation
3

Number of cross-validation folds. Guidelines:

  • 3-5: Large datasets, faster training
  • 5-10: Standard choice, good balance
  • 10+: Small datasets, thorough evaluation

Trade-offs:

  • More folds: Better evaluation, slower training
  • Fewer folds: Faster training, higher variance

Must be at least 2.

K-fold cross-validation without stratification. Divides data into k consecutive folds for iterative validation.

Process:

  • Splits data into k equal parts
  • Each fold serves as validation once
  • Remaining k-1 folds form training set

Use cases:

  • Regression problems
  • Large, balanced datasets
  • When stratification unnecessary
  • Continuous target variables

Limitations:

  • May not preserve class distributions
  • Less suitable for imbalanced data
  • Can create biased splits with ordered data

Number of folds for cross-validation. Selection guide: Recommended values:

  • 5: Standard choice (default)
  • 3: Large datasets/quick evaluation
  • 10: Thorough evaluation/smaller datasets

Trade-offs:

  • Higher values: More thorough, computationally expensive
  • Lower values: Faster, potentially higher variance

Must be at least 2 for valid cross-validation.

Random seed for fold generation when shuffling. Important for:

  • Reproducible results
  • Consistent fold assignments
  • Benchmark comparisons
  • Debugging and validation

Set specific value for reproducibility across runs.

true

Whether to shuffle data before splitting into folds. Effects:

  • true: Randomized fold composition (recommended)
  • false: Sequential splitting

Enable when:

  • Data may have ordering
  • Better fold independence needed

Disable for:

  • Time series data
  • Ordered observations

Stratified K-fold cross-validation maintaining class proportions across folds.

Key features:

  • Preserves class distribution in each fold
  • Handles imbalanced datasets
  • Ensures representative splits

Best for:

  • Classification problems
  • Imbalanced class distributions
  • When class proportions matter

Requirements:

  • Classification tasks only
  • Sufficient samples per class
  • Categorical target variable

Number of stratified folds. Guidelines: Typical values:

  • 5: Standard for most cases
  • 3: Quick evaluation/large datasets
  • 10: Detailed evaluation/smaller datasets

Considerations:

  • Must allow sufficient samples per class per fold
  • Balance between stability and computation time
  • Consider smallest class size when choosing

Seed for reproducible stratified splits. Ensures:

  • Consistent fold assignments
  • Reproducible results
  • Comparable experiments
  • Systematic validation

Fixed seed guarantees identical stratified splits.

false

Data shuffling before stratified splitting. Impact:

  • true: Randomizes while maintaining stratification
  • false: Maintains data order within strata

Use cases:

  • true: Independent observations
  • false: Grouped or sequential data

Class proportions maintained regardless of setting.

Random permutation cross-validator with independent sampling.

Characteristics:

  • Random sampling for each split
  • Independent train/test sets
  • More flexible than K-fold
  • Can have overlapping test sets

Advantages:

  • Control over test size
  • Fresh splits each iteration
  • Good for large datasets

Limitations:

  • Some samples might never be tested
  • Others might be tested multiple times
  • No guarantee of complete coverage

Number of random splits to perform. Consider: Common values:

  • 5: Standard evaluation
  • 10: More thorough assessment
  • 3: Quick estimates

Trade-offs:

  • More splits: Better estimation, longer runtime
  • Fewer splits: Faster, less stable estimates

Balance between computation and stability.

Random seed for reproducible shuffling. Controls:

  • Split randomization
  • Sample selection
  • Result reproducibility

Important for:

  • Debugging
  • Comparative studies
  • Result verification
0.2

Proportion of samples for test set. Guidelines: Common ratios:

  • 0.2: Standard (80/20 split)
  • 0.25: More validation emphasis
  • 0.1: More training data

Considerations:

  • Dataset size
  • Model complexity
  • Validation requirements

It must be between 0.0 and 1.0.

Stratified random permutation cross-validator combining shuffle-split with stratification.

Features:

  • Maintains class proportions
  • Random sampling within strata
  • Independent splits
  • Flexible test size

Ideal for:

  • Imbalanced datasets
  • Large-scale problems
  • When class distributions matter
  • Flexible validation schemes

Number of stratified random splits. Guidelines: Recommended values:

  • 5: Standard evaluation
  • 10: Detailed analysis
  • 3: Quick assessment

Consider:

  • Sample size per class
  • Computational resources
  • Stability requirements

Seed for reproducible stratified sampling. Ensures:

  • Consistent class proportions
  • Reproducible splits
  • Comparable experiments

Critical for:

  • Benchmarking
  • Research studies
  • Quality assurance
0.2

Fraction of samples for stratified test set. Best practices: Common splits:

  • 0.2: Balanced evaluation
  • 0.3: More thorough testing
  • 0.15: Preserve training size

Consider:

  • Minority class size
  • Overall dataset size
  • Validation objectives

It must be between 0.0 and 1.0.

Time Series cross-validator. Provides train/test indices to split time series data samples that are observed at fixed time intervals, in train/test sets. It is a variation of k-fold which returns first k folds as train set and the k + 1th fold as test set. Note that unlike standard cross-validation methods, successive training sets are supersets of those that come before them. Also, it adds all surplus data to the first training partition, which is always used to train the model. Key features:

  • Maintains temporal dependence
  • Expanding window approach
  • Forward-chaining splits
  • No future data leakage

Use cases:

  • Sequential data
  • Financial forecasting
  • Temporal predictions
  • Time-dependent patterns

Note: Training sets are supersets of previous iterations.

Number of temporal splits. Considerations: Typical values:

  • 5: Standard forward chaining
  • 3: Limited historical data
  • 10: Long time series

Impact:

  • Affects training window growth
  • Determines validation points
  • Influences computational load

Maximum size of training set. Should be strictly less than the number of samples. Applications:

  • 0: Use all available past data
  • >0: Rolling window of fixed size

Use cases:

  • Limit historical relevance
  • Control computational cost
  • Handle concept drift
  • Memory constraints

Number of samples in each test set. When 0:

  • Auto-calculated as n_samples/(n_splits+1)
  • Ensures equal-sized test sets

Considerations:

  • Forecast horizon
  • Validation requirements
  • Available future data

Gap

u64
0

Number of samples to exclude from the end of each train set before the test set.Gap between train and test sets. Uses:

  • Avoid data leakage
  • Model forecast lag
  • Buffer periods

Common scenarios:

  • 0: Continuous prediction
  • >0: Forward gap for realistic evaluation
  • Match business forecasting needs