第 11 / 14 页
非代码面试题
显示 20 / 268 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
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?机器学习简单数值题未尝试免费2647Why Grouped CV Beats Row-Wise CV for Repeated EntitiesWhy is row-wise cross-validation inappropriate when each entity appears many times and the model can recognize entity-specific signatures?机器学习中等essay未尝试免费2651Why Repeated CV Replicates Are Not Independent ExperimentsWhy should a practitioner be cautious about treating 20 repeated CV scores as if they were 20 independent experiments?机器学习简单essay未尝试免费2656Why Random Row CV Breaks With Overlapping Label HorizonsWhy can ordinary random row cross-validation severely overstate performance when each label depends on the next 5 trading days and adjacent rows overlap in those horizons?机器学习简单essay未尝试免费2657Why Fold-to-Fold Variation Is Not a Standard Error of DeploymentWhy is the standard deviation of fold scores not automatically the standard error of future production performance?机器学习简单essay未尝试免费2661Why Time-Series CV Is About Information Availability, Not Calendar PurityWhy is the real principle in time-series CV 'never train on information from the future' rather than 'always use a particular fold geometry'?机器学习简单essay未尝试免费2663Why Comparing CV Scores Across Different Fold Rules Can MisleadWhy is it dangerous to compare one model's score from random k-fold CV with another model's score from grouped or blocked CV?机器学习中等essay未尝试面试订阅2666Why Outer-Fold Disagreement Is InformativeIf different outer folds in nested CV keep selecting different hyperparameters, what does that usually say about the learning problem?机器学习简单essay未尝试免费2667Why Class Stratification Is Not Enough for Repeated EntitiesWhy can class-stratified cross-validation still fail badly when the same issuer appears many times and issuer identity carries predictive information?机器学习简单essay未尝试免费2670Why the Best CV Design Depends on the Deployment UnitWhy should the fold rule mirror the unit on which the model will actually generalize in production?机器学习困难essay未尝试面试订阅2681Why Live Deployment Changes the Labeling EnvironmentWhy can a model that looked predictive in backtests become less predictive once a desk actually starts trading on it?机器学习简单essay未尝试免费2691Why More Panels Do Not Solve Regime DriftWhy does adding more securities or more firms not automatically solve the problem of regime drift over time?机器学习简单essay未尝试免费2706Why an Untouched Holdout Stops Being UntouchedWhy does a final holdout lose its evidential value once researchers repeatedly inspect it during idea iteration?机器学习简单essay未尝试面试订阅2707Why Cost Assumptions Count as HyperparametersWhy does changing slippage curves, fee schedules, or borrow assumptions after seeing backtest performance count as extra model search?机器学习简单essay未尝试面试订阅2760General Procurement Bid Function With Four SuppliersA procurement auction has four risk-neutral suppliers with i.i.d. costs Uniform (0,1). The lowest bid wins and is paid its own bid. Derive the symmetric equilibrium bid function, and compute the bid of a supplier with cost 0.3.脑筋急转弯中等derivation未尝试面试订阅2769General 2x2 Zero-Sum FormulaFor the zero-sum matrix game \[ \begin pmatrix a & b \\ c & d \end pmatrix , \] assume there is no pure saddle point and a-b-c+d 0. Derive the mixed strategy of Row, the mixed strategy of Column, and the value of the game.脑筋急转弯困难derivation未尝试面试订阅2867A Generalized Markov Bound from the Fourth MomentSuppose X is any random variable with E[X 4]=81. Use Markov's inequality on a suitable nonnegative variable to bound P(|X|\ge 6).概率中等derivation未尝试面试订阅2989Expected Shortest Piece with Five PiecesFour cut points are drawn independently and uniformly on [0,1] and ordered, producing five pieces. Let M be the shortest piece length. Compute E[M].概率困难derivation未尝试面试订阅2990Expected Longest Piece with Five PiecesFour cut points are drawn independently and uniformly on [0,1] and ordered, producing five pieces. Let L be the longest piece length. Compute E[L].概率困难derivation未尝试面试订阅3437Why Coarse-Graining Lowers EntropyWhy does merging labels generally reduce entropy rather than increase it?数学中等essay未尝试面试订阅