GLOBAL SEARCH

搜索课程、模块、题目与收藏题单

搜索在服务端完成,题目解析与答案不会进入搜索结果。登录后可搜索自己的收藏题单。

找到 30 个结果

中文题目
题目4221 · 机器学习

Grouped Permutation Drop Pattern 1

A model starts at validation accuracy 0.82. Permuting feature X1 alone lowers it to 0.79, permuting X2 alone lowers it to 0.8, and permuting them together lowers it to 0.7. What are the three drops, and what pattern does that suggest?

打开 →
题目4223 · 机器学习

Grouped Permutation Drop Pattern 3

A model has baseline AUC 0.70. With a correlated twin present, permuting feature A drops AUC to 0.64. After removing the twin, permuting A drops AUC to 0.58. By how much did feature A's permutation importance increase?

打开 →
题目4225 · 机器学习

Grouped Permutation Drop Pattern 5

A feature's permutation importance is measured as baseline accuracy minus permuted accuracy. Under validation set A the numbers are 0.80 and 0.78; under noisier validation set B they are 0.74 and 0.72. What is the relative drop as a percentage of baseline in each case?

打开 →
题目4231 · 机器学习

Grouped Permutation Remedy

If several sector dummy variables move together and share the same economic information, what diagnostic is often better than permuting one dummy at a time?

打开 →
题目5886 · 数理金融

Two-Step European Call Via Terminal Weights

On a two-step recombining tree with spot=64, strike=70, u=1.25, d=0.8, r=0, Δt=1, price the European call by weighting the three terminal payoffs with the binomial probabilities q^2, 2q(1-q), (1-q)^2.

打开 →
题目4224 · 机器学习

Grouped Permutation Drop Pattern 4

An impurity-based feature ranking is id_hash=0.40, signal_1=0.35, signal_2=0.25. After limiting max depth, id_hash gain is cut in half while the other raw gains are unchanged. What are the new normalized shares?

打开 →
题目075 · 概率

Fixed Points of a Random Permutation Are Not Independent

A permutation $\sigma$ of $\{1,2,3,4\}$ is chosen uniformly at random (each of the $4! = 24$ permutations equally likely). For $i = 1,2,3,4$, define the event $A_i = \{\sigma(i) = i\}$ (element $i$ is a fixed point). (a) By counting, show that $P(A_i) = 1/4$ for every $i$, and $P

打开 →
题目4230 · 机器学习

Negative Permutation Importance

A weak feature shows slightly negative permutation importance on a finite validation set. Should you immediately conclude it is genuinely anti-predictive?

打开 →
题目286 · 概率

Robust Ascents in a Random Permutation

Let $\sigma$ be a uniformly random permutation of $\{1, 2, \dots, n\}$. An ascent at position $i$ (for $1 \le i \le n-1$) is a position where $\sigma(i) < \sigma(i+1)$. Find the expected number of ascents. Additional robustness twist: before observation, an independent random re

打开 →
题目295 · 概率

Robust Cycles in a Random Permutation

Let $\sigma$ be a uniformly random permutation of $\{1, 2, \dots, n\}$. Find the expected number of cycles in the cycle decomposition of $\sigma$. Express your answer as a familiar function of $n$. Additional robustness twist: before observation, an independent random relabeling

打开 →
题目301 · 概率

Robust Descents in a Random Permutation

Let $\sigma$ be a permutation of $\{1, 2, \dots, n\}$ chosen uniformly at random. A descent is a position $i \in \{1, \dots, n-1\}$ where $\sigma(i) > \sigma(i+1)$. What is the expected number of descents? Additional robustness twist: before observation, an independent random re

打开 →
题目306 · 概率

Robust Intermediate Positions in a Permutation

Let $\sigma$ be a uniformly random permutation of $\{1, 2, \dots, n\}$. Call position $i \in \{2, \dots, n-1\}$ an intermediate position if $\sigma(i)$ is strictly between $\sigma(i-1)$ and $\sigma(i+1)$, i.e., $\min(\sigma(i-1), \sigma(i+1)) < \sigma(i) < \max(\sigma(i-1), \sigm

打开 →