Conditional Super Learner

12/13/2019
by   Gilmer Valdes, et al.
0

In this article we consider the Conditional Super Learner (CSL), an algorithm which selects the best model candidate from a library conditional on the covariates. The CSL expands the idea of using cross-validation to select the best model and merges it with meta learning. Here we propose a specific algorithm that finds a local minimum to the problem posed, proof that it converges at a rate faster than Op(n^-1/4) and offers extensive empirical evidence that it is an excellent candidate to substitute stacking or for the analysis of Hierarchical problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2020

Bootstrap Bias Corrected Cross Validation applied to Super Learning

Super learner algorithm can be applied to combine results of multiple ba...
research
03/07/2017

Propensity score prediction for electronic healthcare databases using Super Learner and High-dimensional Propensity Score Methods

The optimal learner for prediction modeling varies depending on the unde...
research
04/27/2023

On the Generalization Error of Meta Learning for the Gibbs Algorithm

We analyze the generalization ability of joint-training meta learning al...
research
01/16/2018

One Way Function Candidate based on the Collatz Problem

The one way function based on Collatz problem is proposed. While Colatz ...
research
09/09/2021

Bootstrapped Meta-Learning

Meta-learning empowers artificial intelligence to increase its efficienc...
research
06/02/2019

Sequential Scenario-Specific Meta Learner for Online Recommendation

Cold-start problems are long-standing challenges for practical recommend...

Please sign up or login with your details

Forgot password? Click here to reset