第 20 / 88 页
非代码面试题
显示 20 / 1751 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
2577Why OOB Is Unsafe for Grouped or Temporal Data 13Why can out-of-bag error be misleading when rows are linked by entity or time rather than being exchangeable?机器学习中等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未尝试面试订阅2589Bagged MSE When Bias Stays Fixed 7Assume each tree has the same squared bias b 2 and prediction noise floor nu, while bagging only changes the variance term according to the equicorrelated-tree formula. Derive the bagged test MSE with B trees.机器学习困难derivation未尝试面试订阅2596Optimal Leaf Update Under Squared Loss 1In gradient boosting for squared error, a terminal region R is assigned one constant update gamma. Derive the gamma that minimizes sum i in R (r i-gamma) 2, where r i are the current residuals.机器学习简单derivation未尝试免费2597Weighted Region Update 2If observations in a boosting region R carry positive weights w i, derive the constant update gamma that minimizes sum i in R w i (r i-gamma) 2.机器学习简单derivation未尝试免费2598Final Prediction After Three Boosting Rounds 23A boosting model starts from F 0(x)=10. For one observation, the leaf updates along its path are +1.2, -0.5, and +0.8 across three rounds, with learning rate eta=0.1 each round. What is the final prediction?机器学习中等数值题未尝试免费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未尝试免费2608Residual After Two Shrunken Updates 24A point currently has residual 6. Two boosting rounds hit its region with leaf updates 1.5 and 0.8, using learning rate eta=0.2 in both rounds. What residual remains after the two rounds?机器学习中等数值题未尝试免费2613L2-Regularized Region Update 7In one boosting region, choose a constant update gamma to minimize sum i in R (r i-gamma) 2 + lambda gamma 2. Let S = sum i in R r i and n = |R|. Derive gamma.机器学习困难derivation未尝试面试订阅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未尝试面试订阅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未尝试面试订阅2620A Bound on Total Function Movement 8Suppose every boosting round changes any one point's prediction by at most eta A in absolute value. What upper bound does this imply on the total prediction movement after M rounds?机器学习困难derivation未尝试面试订阅2645Why Global-Norm Clipping Preserves Direction 14Why does global-norm clipping change the magnitude of a gradient vector but not its direction whenever clipping is active?机器学习困难derivation未尝试面试订阅2646Model-Fit Count in a Nested CV SearchA team runs 5 outer folds. Inside each outer-training split, it evaluates 6 hyperparameter settings by 4-fold CV, then refits the chosen model once on the full outer-training split. How many total model fits are performed?机器学习简单数值题未尝试免费