FastText is a word embedding model that extends Word2Vec by considering subword information
through character n-grams (e.g., bi-grams, tri-grams). Which of the following statements about
FastText's behavior and capabilities are true?
6406533516406.
FastText can generate embeddings for unseen words by summing the
embeddings of their subword n-grams.
6406533516407.
FastText considers only complete words and does not split them into subword
n-grams.
6406533516408.
FastText embeddings for morphologically similar words (e.g., "run" and
"running") will be highly similar because they share many n-grams.
6406533516409.
FastText cannot distinguish between semantically unrelated words like
"mouse" and "house" because they share common n-grams(e.g., "ouse").
A published solution is not available for this question yet.
Which of the following are suitable choices for an autoregressive language model with the primary
objective of using it to generate text based on a given prompt?
(1) Vanilla RNN
(2) Bidirectional RNN
6406533516411.
Only (1)
6406533516412.
Only (2)
6406533516413.
Both (1) and (2)
A published solution is not available for this question yet.
Which of the following approaches would be the best fit for these specific use cases?
1. A system that retrieves the latest financial data to provide investment advice.
2. Optimizing a general-purpose model for sentiment analysis on product reviews.
3. Generating concise summaries from a pre-trained model with a carefully worded input.
4. Using a general-purpose language model without any modifications.
6406533516460.
RAG, Fine-tuning, Prompt engineering, Pre-trained model
6406533516461.
Prompt engineering, RAG, Fine-tuning, Pre-trained model
6406533516462.
RAG, Prompt engineering, Fine-tuning, Pre-trained model
6406533516463.
Fine-tuning, RAG, Prompt engineering, Pre-trained model
A published solution is not available for this question yet.
Consider an encoder-decoder transformer used for story generation. If we use exhaustive search
to generate tokens for 20 time steps for a story generation task given a vocabulary of size 5,000 ,
what is the size of the search space?
A decoder-only transformer-based language model is used to generate text based on some
prompt. The language model is prompted ten times with the same prompt. It produces the same
response all ten times. Each run is to be treated independently without any memory of the
previous runs. Which of the following could be the most likely decoding strategy used?
6406533516455.
Beam search with beam width of 4
6406533516456.
Top-k sampling
6406533516457.
Nucleus sampling
6406533516458.
Greedy sampling
A published solution is not available for this question yet.
Why is calculating Shapley values computationally expensive for models with a large number of
features?
6406533516480.
It requires retraining the model for every subset of features.
6406533516481.
It depends on the dataset size, which scales quadratically.
6406533516482.
It evaluates the contribution of all possible feature subsets, which grows
exponentially.
6406533516483.
It computes gradients for every input sample.
**SPG**
**Section Id :** 64065375426
**Section Number :** 10
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 19
**Number of Questions to be attempted :** 19
**Section Marks :** 35
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Section Maximum Duration :** 0
**Section Minimum Duration :** 0
**Section Time In :** Minutes
A published solution is not available for this question yet.