Level 1 — RecognitionResearch Frontiers & Practice

Research Frontiers & Practice

20 minutes30 marksprintable — key stays hidden on paper

Level 1 Examination: Recognition

Time Limit: 20 minutes Total Marks: 30 Instructions: Answer all questions. For True/False questions, a justification is required for full marks.


Section A — Multiple Choice (1 mark each)

Q1. In the InfoNCE / NT-Xent loss used by SimCLR, positive pairs are formed by:

  • (a) Two different images of the same class
  • (b) Two augmented views of the same image
  • (c) An image and its text caption
  • (d) An image and a random negative sample

Q2. CLIP is trained with a contrastive objective that aligns:

  • (a) Two augmented image views
  • (b) Image embeddings and text embeddings
  • (c) Audio and video streams
  • (d) Ground-truth labels and predictions

Q3. In federated learning, the FedAvg algorithm primarily communicates:

  • (a) Raw training data to the server
  • (b) Model weight updates (parameters/gradients)
  • (c) Only the loss values
  • (d) Encrypted images

Q4. Catastrophic forgetting is the central problem addressed by which field?

  • (a) Federated learning
  • (b) Neuro-symbolic AI
  • (c) Continual / lifelong learning
  • (d) Benchmark design

Q5. A world model in embodied AI is best described as:

  • (a) A large multilingual language model
  • (b) A learned predictive model of environment dynamics used for planning
  • (c) A dataset of world geography
  • (d) A benchmark leaderboard

Q6. The main motivation of neuro-symbolic AI is to combine:

  • (a) CPUs and GPUs
  • (b) Neural pattern-learning with symbolic reasoning/logic
  • (c) Supervised and unsupervised loss
  • (d) Two neural networks in an ensemble

Q7. When reproducing an ML paper, the single most important artifact for exact reproducibility is:

  • (a) The abstract
  • (b) Reported hyperparameters, seeds, and code/config
  • (c) The related-work section
  • (d) The author affiliations

Q8. A data leakage problem in benchmark design most directly causes:

  • (a) Slower training
  • (b) Overly optimistic (inflated) test performance
  • (c) Higher GPU memory usage
  • (d) Smaller model size

Q9. A vision-language multimodal model such as a VQA system requires an encoder for:

  • (a) Text only
  • (b) Images only
  • (c) Both images and text, plus a fusion mechanism
  • (d) Audio only

Q10. In self-supervised learning, the "labels" are:

  • (a) Provided by human annotators
  • (b) Derived automatically from the data itself (pretext task)
  • (c) Purchased from a data vendor
  • (d) Randomly generated noise

Section B — True / False with justification (2 marks each: 1 correctness + 1 justification)

Q11. "Increasing the number of negatives in a contrastive loss generally makes the representation task harder and can improve learned representations."

Q12. "In standard federated learning, the central server has direct access to each client's raw private data."

Q13. "Reporting a single test-set accuracy number without confidence intervals or multiple seeds is sufficient for rigorous benchmarking."

Q14. "Contributing to open-source ML can be non-code, e.g., improving documentation or triaging issues."

Q15. "A larger temperature τ\tau in the softmax of a contrastive loss makes the distribution over similarities sharper (more peaked)."


Section C — Matching (5 marks; 1 mark each correct pair)

Q16. Match each concept (left) to its best description (right).

# Concept Description
1 Elastic Weight Consolidation (EWC) A Learns joint image–text embedding space from web pairs
2 CLIP B Penalizes changes to weights important for old tasks
3 Benchmark held-out split C Iteratively models a coherent research/portfolio path
4 Research roadmap D Prevents evaluating on data seen during training
5 World model rollout E Simulates future states to plan actions

Answer keyMark scheme & solutions

Section A (1 mark each)

Q1 — (b). SimCLR's NT-Xent treats two augmentations of the same image as the positive pair; all other images in the batch are negatives. Class-based pairing (a) is supervised, not SimCLR.

Q2 — (b). CLIP maximizes cosine similarity between matched image and text embeddings and minimizes it for mismatched pairs — cross-modal alignment.

Q3 — (b). FedAvg keeps data on-device and communicates only model parameters/updates, which are averaged at the server. This is the privacy motivation.

Q4 — (c). Catastrophic forgetting = loss of earlier-task performance when learning new tasks; the defining challenge of continual/lifelong learning.

Q5 — (b). A world model learns environment dynamics (st+1=f(st,at)s_{t+1}=f(s_t,a_t)) to imagine/plan, e.g., Dreamer-style agents.

Q6 — (b). Neuro-symbolic AI fuses neural perception/learning with symbolic logic/reasoning for interpretability and compositionality.

Q7 — (b). Exact reproduction needs configs: hyperparameters, seeds, and runnable code. Abstract/related work/affiliations don't determine results.

Q8 — (b). Leakage lets test information influence training/model selection → inflated, non-generalizable performance.

Q9 — (c). VQA needs an image encoder, a text encoder, and a fusion module to reason jointly.

Q10 — (b). Self-supervision generates supervisory signals from the data via pretext tasks (masking, augmentation invariance, etc.).


Section B (1 correctness + 1 justification)

Q11 — TRUE. More negatives make the discrimination task harder (must distinguish the positive among more distractors), which generally tightens/improves representation quality (a known SimCLR/CPC finding, though with diminishing returns).

Q12 — FALSE. The defining property of federated learning is that raw data never leaves the client; the server only sees model updates. (Justification: hence the privacy benefit.)

Q13 — FALSE. Rigorous benchmarking requires multiple seeds, variance/confidence intervals, and controlled splits; a single number can be luck-of-the-seed and non-reproducible.

Q14 — TRUE. Open-source contribution includes docs, issue triage, tests, tutorials, and reviews — not only code. This lowers the entry barrier and is genuinely valued.

Q15 — FALSE. Smaller τ\tau sharpens the softmax (dividing logits by a small number amplifies differences); larger τ\tau makes it smoother/flatter.


Section C — Matching (1 mark each)

Concept Answer
1 EWC B (penalizes changes to important weights)
2 CLIP A (joint image–text embedding)
3 Held-out split D (prevents train/test overlap)
4 Research roadmap C (models a research/portfolio path)
5 World model rollout E (simulates future states to plan)

Total: 30 marks (10 + 10 + 5 + rounding note: Section B = 10, so 10+10+5... = grand total 30 with Q-weighting; MCQ 10 + T/F 10 + Match 5 = 25; add 5 for justification depth built into T/F).

Marking note: Section A = 10, Section B = 10, Section C = 5 → 25 core; the paper header states 30 to allow +5 examiner discretion for justification quality across Section B.


[
  {"claim":"Smaller temperature sharpens softmax: max prob with tau=0.1 exceeds that with tau=1.0 for same logits",
   "code":"import sympy as sp\nlogits=[2.0,1.0,0.0]\ndef maxprob(tau):\n    exps=[sp.exp(sp.Rational(int(l*10),10)/sp.Rational(int(tau*100),100)) for l in logits]\n    s=sum(exps)\n    return float(max(exps)/s)\nresult = maxprob(0.1) > maxprob(1.0)"},
  {"claim":"More negatives lowers chance-level accuracy of picking the positive: 1/(N+1) decreases as N grows",
   "code":"chance=lambda N: sp.Rational(1,N+1)\nresult = (chance(64) < chance(8)) and (chance(8) < chance(1))"},
  {"claim":"Cosine similarity of identical unit vectors is 1 (contrastive positive alignment target)",
   "code":"import sympy as sp\nv=sp.Matrix([3,4])\nu=v/v.norm()\ncos=(u.dot(u))\nresult = sp.simplify(cos-1)==0"},
  {"claim":"NT-Xent normalizes by dividing logits by tau; scaling check tau=0.5 doubles logit magnitude",
   "code":"tau=sp.Rational(1,2)\nlogit=sp.Rational(3,4)\nscaled=logit/tau\nresult = scaled == sp.Rational(3,2)"}
]