Quiz collegato alla guida · Medio Livello

The Feature Hashing Trick Quiz

Covers fixed-dimensional hash buckets, vocabulary memory tradeoffs, collisions, signed hashing, and why hashed features are harder to inspect afterward.

Percorsi guida correlatiFeature Hashing Trick
Domanda 1 di 8

Quale problema fondamentale risolve il trucco dell'hashing delle feature per le feature categoriche o testuali?

Anteprima di ogni domanda8 domande

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

  1. Quale problema fondamentale risolve il trucco dell'hashing delle feature per le feature categoriche o testuali?
    • It speeds up gradient descent convergence
    • Elimina la necessità di qualsiasi funzione di perdita
    • It avoids needing an explicit, growing dictionary to map every unique feature value to a fixed position
    • It guarantees zero hash collisions
  2. In un FeatureHasher a dimensione fissa, in che modo il nome di una feature seleziona la sua coordinata di output?
    • By applying a hash function to the feature's string representation and taking the result modulo the number of buckets
    • By alphabetically sorting all feature values first
    • By counting how often the feature appears in the training set
    • By asking a human annotator
  3. Due stringhe di token non correlate finiscono nello stesso bucket di output. Quale evento di hashing si è verificato?
    • When the hash function crashes during training
    • When a feature value has no valid hash
    • When two buckets are empty at the same time
    • When two different feature values map to the same bucket, merging their signal
  4. Nell'hashing delle feature con segno, cosa determina se il contributo di una feature viene aggiunto o sottratto?
    • The current training label only
    • A sign derived from the feature hash, which can be +1 or −1
    • The order in which examples arrive
    • The magnitude of the learning rate
  5. Perché la variante di hashing con segno è generalmente preferita rispetto a quella senza segno?
    • It prevents all different features from colliding
    • It stores the original feature dictionary for later recovery
    • It turns hashed vectors into dense PCA components
    • It can reduce systematic collision bias and preserve inner products in expectation under the hashing assumptions
  6. What common misconception about feature hashing does the guide directly correct?
    • That it can only be used for text data
    • That it is a form of dimensionality reduction like PCA meant to preserve variance or structure
    • That it requires labeled data
    • That it cannot be used in streaming settings
  7. Which named libraries or systems are mentioned as implementing feature hashing for streaming or out-of-core learning?
    • scikit-learn's FeatureHasher and Vowpal Wabbit
    • TensorFlow and PyTorch
    • pandas and NumPy
    • Only custom in-house tools with no public libraries
  8. In modern deep learning, what alternative to feature hashing has become common for representing categorical features, though hashing is still sometimes combined with it?
    • One-vs-rest classifiers
    • Decision tree binning
    • Learned embedding tables
    • VC dimension bounds