Idanwo ti o sopọ mọ itọsọna · Alabọde Ipele

Idanwo Ẹkọ Alabojuto Ologbele

Review mixed label availability, self-training, consistency, cluster assumptions, FixMatch, error reinforcement, graph propagation, and unlabeled markers.

Jẹmọ itọsọna awọn ọnaSemi Abojuto Learning
Ibeere 1 ti 8

Ẹkọ alabojuto ologbele jẹ apẹrẹ fun awọn ipo nibiti:

Awotẹlẹ gbogbo ibeere8 ibeere

Awọn idahun ati awọn alaye han bi o ṣe n mu ibeere naa.

  1. Ẹkọ alabojuto ologbele jẹ apẹrẹ fun awọn ipo nibiti:
    • Gbogbo apẹẹrẹ ti ni aami ni kikun
    • O ko ni data rara
    • Awọn aami jẹ olowo poku ailopin lati gba
    • O ni data ti o ni aami kekere ati ọpọlọpọ data ti ko ni aami
  2. How does self-training use selected predictions on unlabeled examples?
    • It treats selected model guesses as pseudo-labels for further fitting
    • It converts every guess into a verified human annotation
    • It permanently removes the original labeled examples by definition
    • It chooses labels only from alphabetical order
  3. Under consistency regularization, what agreement is encouraged across chosen class-preserving augmentations?
    • A requirement that every arbitrary edit preserve the class
    • Opposite predictions for every view of an example
    • Agreement in the model's predictions
    • Removal of every unlabeled input from the loss
  4. What does a cluster assumption propose for grouped observations in a semi-supervised method?
    • Every possible cluster must contain every class equally
    • They are likely to share a label under the assumed data structure
    • All semi-supervised methods guarantee identical clusters
    • Labels are determined by filename order
  5. Bawo ni FixMatch ṣe darapọ awọn imọran akọkọ meji?
    • O ṣe aami aipe-iṣamisi titẹ sii ti ko lagbara, lẹhinna ṣe ikẹkọ ẹya ti a pọ si ni agbara lati baamu
    • O nlo data ti o ni aami nikan o si kọju ohun gbogbo miiran
    • O npa awọn augmentations patapata
    • O fi awọn akole sọtọ laileto
  6. How can confirmation bias arise during pseudo-label training?
    • Only low-confidence labels can ever be wrong
    • Every selected prediction becomes a verified fact
    • Using any verified label prevents the model from learning
    • Incorrect model-generated labels are accepted and then reinforced
  7. Which structure distinguishes graph-based label propagation from repeatedly selecting a classifier's confident guesses?
    • Only a threshold on independently predicted class probabilities
    • A similarity graph over labeled and unlabeled observations
    • A list of random output labels with no input similarities
    • A requirement to discard every relationship between observations
  8. In the stated scikit-learn semi-supervised interface, which integer marks an unlabeled target entry?
    • Zero, necessarily the first actual class label
    • One, necessarily the second actual class label
    • Minus one
    • Fifty, interpreted as a percentage-confidence threshold