第 4 / 5 页
非代码面试题
显示 20 / 91 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
2575Why Bagging Rarely Fixes High Bias 11Why should you not expect bagging alone to rescue a learner whose individual trees are systematically misspecified?机器学习困难essay未尝试面试订阅2576Why Feature Subsampling Helps When One Predictor Dominates 12Why can random feature subsampling improve a forest when one very strong predictor would otherwise appear at the top of almost every tree?机器学习简单essay未尝试免费2578Why Tiny max_features Can Raise Bias 14Why can making max features too small hurt a random forest even though it lowers correlation?机器学习中等essay未尝试免费2579Infer Tree Correlation From the Variance Floor 23A single tree has variance 6, while an extremely large forest appears to level off at variance 1.8. What pairwise tree correlation rho is implied?机器学习中等数值题未尝试面试订阅2580Why More Trees Usually Do Not Create Classical Overfit 15Why does adding more trees to a random forest typically plateau rather than create the kind of explosive overfit seen in some single-model families?机器学习困难essay未尝试面试订阅2584Marginal Variance Reduction From One More Tree 3Under the equicorrelated-tree model, derive how much the ensemble variance falls when you move from B trees to B+1 trees.机器学习困难derivation未尝试面试订阅2585Trees Needed for a Target Variance Cap 4Suppose each tree has variance sigma 2 and pairwise correlation rho. Derive the minimum B needed to make the ensemble variance at most V, assuming V > rho sigma 2.机器学习困难derivation未尝试面试订阅2591Why OOB Can Be Noisy on Small Samples 19Why can out-of-bag error fluctuate a lot on a small dataset even when the forest itself is reasonably stable?机器学习简单essay未尝试免费2592Effective Independent Tree Count 8Define B eff by matching the correlated-forest variance sigma 2 [rho + (1-rho)/B] to the variance sigma 2 / B eff of averaging independent trees. Derive B eff.机器学习简单derivation未尝试免费2593Why Averaging Cannot Cure Systematic Label Noise 20Why can a larger forest fail to repair performance when the training labels themselves are systematically corrupted?机器学习中等essay未尝试面试订阅2599Why Boosting Mostly Attacks Bias 9Why is boosting usually described as a bias-reduction method more than a variance-reduction method?机器学习中等essay未尝试免费2602Why Early Stopping Matters Even if Train Loss Falls 12Why can validation performance start to deteriorate even while the training objective of boosting keeps improving?机器学习中等essay未尝试免费2604Why Label Noise Is Especially Toxic 13Why does boosting often suffer badly when labels are noisy?机器学习中等essay未尝试免费2607Why Overly Deep Base Trees Can Cancel Shrinkage Discipline 15Why can a very deep base tree undermine the regularizing effect of a small learning rate?机器学习简单essay未尝试免费2611Why Boosting Parallelizes Worse Than Random Forests 16Why is boosting fundamentally harder to parallelize across rounds than random forests?机器学习简单essay未尝试免费2614Why the Initial Prediction Matters 18Why can the choice of the initial prediction F 0 matter for the early trajectory of boosting?机器学习中等essay未尝试面试订阅2615Why Calibration Can Degrade Before Ranking 19Why can late-stage boosting sometimes keep ranking examples well while making the predicted scores less well calibrated?机器学习困难essay未尝试面试订阅2616Why Leaf-Wise Growth Can Be Higher Variance 20Why can leaf-wise tree growth be more variance-prone than level-wise growth inside a boosting system?机器学习简单essay未尝试免费2618Why Many Small Corrections Can Beat One Big Tree 21Why can an additive sequence of small boosting steps outperform a single large tree with similar in-sample flexibility?机器学习中等essay未尝试面试订阅2619Why Flat Late-Round Validation Gains Still Suggest Stopping 22If the validation gain per boosting round becomes tiny and erratic late in training, why is that often a strong argument for stopping?机器学习中等essay未尝试面试订阅