引導式測驗 · 中等 等級

沒有免費的午餐定理測驗

涵蓋了定理的有限問題空間平均、歸納偏差,以及為什麼特定於任務的驗證仍然可以識別真實資料的強大演算法。

相關引導路徑沒有免費午餐定理
問題 1 的 8

Under the classic finite-domain No Free Lunch result, what happens when search algorithms are averaged uniformly over the complete set of objective functions?

預覽每個問題8 問題

當您參加測驗時,就會出現答案和解釋。

  1. Under the classic finite-domain No Free Lunch result, what happens when search algorithms are averaged uniformly over the complete set of objective functions?
    • Their average performance is equal under the theorem’s assumptions
    • An algorithm using gradients always wins
    • The random algorithm always wins
    • The algorithm with the most parameters wins
  2. Why does a convolutional network often outperform other models on natural images despite NFL?
    • Images are randomly structured so any model works equally well
    • NFL only applies to text data
    • Its built-in assumption of spatial locality matches how real images are structured
    • Convolutional networks have no inductive bias
  3. Who formalized the No Free Lunch theorems referenced in this guide, and when?
    • 傑弗瑞‧辛頓,2006 年
    • David Wolpert and William Macready in 1997
    • 1950 年的艾倫‧圖靈
    • 1998 年的揚‧樂昆 (Yann LeCun)
  4. What does the No Free Lunch result imply about a benchmark leaderboard?
    • It proves one algorithm is best on every task
    • It makes cross-validation unnecessary
    • It means measured benchmark differences are errors
    • It supports conclusions about the tested task distribution, not universal superiority
  5. When does an algorithm’s inductive bias help its performance, according to the guide?
    • When the bias matches regularities in the task problems it encounters
    • When the algorithm has the largest number of parameters
    • When every possible objective function is equally likely in production
    • When the training set contains no repeated examples
  6. What does 'inductive bias,' as described in this guide, refer to?
    • A dataset labeling error
    • A hardware limitation on model size
    • The average number of features in a dataset
    • An algorithm's built-in preference for certain kinds of patterns or hypotheses
  7. How does the technical section describe the NFL proof's treatment of the objective function?
    • As a uniformly random draw from all possible functions over a fixed domain
    • As a fixed, known function chosen by the researcher
    • As always being a linear function
    • As irrelevant to the proof
  8. Per the guide, what should NFL practically motivate a practitioner to do when picking a model for a hospital readmission-risk task?
    • Assume the winner of a published benchmark elsewhere will transfer directly
    • Pick the newest published architecture regardless of data
    • Test several algorithms against their own specific dataset rather than assume a universal winner
    • Ignore cross-validation since NFL makes it pointless