Cuestionario vinculado a una guía · Medio Nivel
Perplexity y cuestionario de métricas del lenguaje
Revise la probabilidad de los tokens de referencia, la entropía cruzada, las líneas de base uniformes, la tokenización comparable, BLEU, los límites de calidad, las ventanas de contexto y los modelos enmascarados.
Pregunta 1 de 8
Under the same autoregressive text-scoring setup, what does lower perplexity indicate?
Vista previa de cada pregunta8 preguntas
Las respuestas y explicaciones aparecen a medida que realiza el cuestionario.
- Under the same autoregressive text-scoring setup, what does lower perplexity indicate?
- Lower average negative log-likelihood for the reference tokens
- A guarantee of more factually correct generated answers
- A guarantee of a larger parameter count
- A requirement that every top-choice prediction be correct
- Using natural-log negative log-likelihood, how is autoregressive perplexity computed from its average?
- By multiplying the parameter count by the context length
- By subtracting the average from the number of attention heads
- By taking the average learning rate
- By exponentiating the average negative log-likelihood
- Un modelo asigna probabilidad uniforme en un vocabulario de 10.000 palabras sin aprendizaje. ¿Cuál es su perplejidad?
- 1
- 10.000
- 0
- 100
- Why do tokenizer and corpus settings matter when directly comparing per-token perplexity values?
- Perplexity ignores every scored reference token
- All corpora necessarily produce the same likelihood
- They change the units or reference data over which probabilities are averaged
- Only model parameter count determines the score
- Which translation-reference metric uses modified n-gram precision and a brevity penalty?
- Perplexity
- Error de píxel cuadrático medio
- El recuento de parámetros del modelo.
- AZUL
- ¿Qué limitación clave empuja a los investigadores más allá de la perplejidad a la hora de juzgar la calidad del mundo real?
- Perplexity mide la predicción de la siguiente palabra, no si la salida es útil, verdadera o útil
- Perplexity es demasiado caro para calcularlo
- Perplexity no se puede calcular en datos de texto
- Perplexity solo funciona durante la inferencia, no durante el entrenamiento
- When scoring a long text with a fixed-context model, what can a sliding-window procedure provide that disjoint chunks lose near boundaries?
- A new vocabulary learned automatically at every boundary
- A guarantee that generated answers are factually correct
- More preceding context for the scored target tokens
- A requirement to count each overlapping target repeatedly
- Why is conventional left-to-right perplexity not directly the same score for a BERT-style masked language model?
- BERT has no learned parameters
- The masked model does not directly define the same autoregressive sequence factorization
- Every masked-token probability is necessarily zero
- Perplexity is defined only for image pixels