Quiz collegato alla guida · Medio Livello

Quiz su AdaBoost

Traccia gli studenti sequenziali di AdaBoost, gli errori ponderati, la riponderazione degli esempi, il voto finale e la sensibilità ai casi difficili e rumorosi.

Percorsi guida correlatiAdaboost
Domanda 1 di 8

Come vengono generalmente formati gli studenti deboli di AdaBoost l'uno rispetto all'altro?

Anteprima di ogni domanda8 domande

Le risposte e le spiegazioni vengono visualizzate mentre rispondi al quiz.

  1. Come vengono generalmente formati gli studenti deboli di AdaBoost l'uno rispetto all'altro?
    • Independently under unchanged sample weights
    • All at once using one common unweighted loss
    • Sequentially, with later rounds adapting to earlier errors
    • By retaining only the final learner and discarding prior rounds
  2. Dopo che uno studente ha classificato erroneamente un esempio, cosa succede solitamente al suo peso di allenamento relativo?
    • It becomes identical to the learner's ensemble vote
    • It increases for a subsequent round
    • It is permanently removed after its first misclassification
    • It is reset to equal weight before every subsequent round
  3. Nella classica formulazione binaria, che tipo di errore ponderato fa guadagnare un utile voto positivo allo studente?
    • An error greater than one-half
    • Any error because the ensemble weight is always positive
    • An error measured only on the final test set
    • A weighted error below one-half
  4. Perché i valori anomali etichettati erroneamente possono essere problematici per AdaBoost?
    • They may keep receiving increased weight
    • Reweighting proves that their labels must be correct
    • Each stump automatically removes examples with inconsistent labels
    • Repeated rounds guarantee such examples have no influence
  5. Con quale soprannome comune è conosciuto un albero decisionale suddiviso in una sola parte?
    • Decision forest
    • Decision branch
    • Decision stump
    • Decision ensemble
  6. What combines the sequence of learners into the final AdaBoost prediction?
    • Only the last learner's prediction
    • A weighted vote of their outputs
    • A vote with necessarily equal weights for every learner
    • The prediction of the learner trained on the largest subset alone
  7. What should a practitioner inspect when several examples remain difficult across rounds?
    • Whether high weight alone proves every case is mislabeled
    • Whether all difficult cases should automatically be removed
    • Whether increasing rounds guarantees that all cases become representative
    • Whether they are valid, mislabeled or outside intended use
  8. Which statement about more boosting rounds is justified?
    • More rounds do not guarantee better generalization
    • Lower training error guarantees lower future error
    • Repeated weighting guarantees correction of noisy labels
    • A large ensemble eliminates the need for held-out evaluation