开发者:上海品职教育科技有限公司 隐私政策详情

应用版本:4.2.11(IOS)|3.2.5(安卓)APP下载

Pina · 2020年06月03日

问一道题:NO.PZ2015120204000030

问题如下:

Paul suggests the following step which would be repeated every quarter.
Step 1 We apply ML techniques to a model including fundamental and technical variables (features) to predict next quarter’s return for each of the 100 stocks currently in our portfolio.
Then,
the 20 stocks with the lowest estimated return are identified for replacement.

Assuming regularization is utilized in the machine learning technique used for executing Step 1, which of the following ML models would be least appropriate:

选项:

A.

Regression tree with pruning

B.

LASSO with lambda (λ) equal to 0

C.

LASSO with lambda (λ) between 0.5 and 1

解释:

B is correct. It is least appropriate because with LASSO, when λ = 0 the penalty (i.e., regularization) term reduces to zero, so there is no regularization and the regression is equivalent to an ordinary least squares (OLS) regression.

A is incorrect. With Classification and Regression Trees (CART), one way that regularization can be implemented is via pruning which will reduce the size of the regression tree—sections that provide little explanatory power are pruned (i.e., removed).

C is incorrect. With LASSO, when λ is between 0.5 and 1 the relatively large penalty (i.e., regularization) term requires that a feature makes a sufficient contribution to model fit to offset the penalty from including it in the model.

老师好, 这题是在问以下哪一个是最不合适的, 也就是错误最多的一款是哪个, 是吗? 那么,选项A, pruning是CART里的一种regularization方法 根本和regression 无关, 不是错的比B 多吗?谢谢。或者A , B 都是一半对一半错?

1 个答案

星星_品职助教 · 2020年06月03日

同学你好,

CART的全称是Classification and REGRESSION Tree,Regression tree用于对于连续型的变量的分类。pruning是CART里针对Regression tree的一种regularization方法,A选项是正确的

  • 1

    回答
  • 1

    关注
  • 978

    浏览
相关问题

LASSO with lamb (λ) equto 0 LASSO with lamb (λ) between 0.5 an1 B is correct. It is least appropriate because with LASSO, when λ = 0 the penalty (i.e., regularization) term reces to zero, so there is no regularization anthe regression is equivalent to ornary least squares (OLS) regression. A is incorrect. With Classification anRegression Trees (CART), one wthregularization cimplementeis via pruning whiwill rethe size of the regression tree—sections thprovi little explanatory power are prune(i.e., remove. C is incorrect. With LASSO, when λ is between 0.5 an1 the relatively large penalty (i.e., regularization) term requires tha feature makes a sufficient contribution to mol fit to offset the penalty from inclung it in the mol. 老师,我可以理解成AC都用来导致overfitting加重惩罚项?

2020-07-12 16:20 1 · 回答

LASSO with lamb (λ) equto 0 LASSO with lamb (λ) between 0.5 an1 B is correct. It is least appropriate because with LASSO, when λ = 0 the penalty (i.e., regularization) term reces to zero, so there is no regularization anthe regression is equivalent to ornary least squares (OLS) regression. A is incorrect. With Classification anRegression Trees (CART), one wthregularization cimplementeis via pruning whiwill rethe size of the regression tree—sections thprovi little explanatory power are prune(i.e., remove. C is incorrect. With LASSO, when λ is between 0.5 an1 the relatively large penalty (i.e., regularization) term requires tha feature makes a sufficient contribution to mol fit to offset the penalty from inclung it in the mol. 老师,可以麻烦提供一下解题思路吗?没有看到考点,谢谢

2020-03-09 16:14 3 · 回答