Company
9 problems tagged for OpenAI.
Divide logits by a temperature scalar before softmax to sharpen or flatten the token probability distribution.
Build the InfoNCE contrastive loss and a CLIP-style training loop that aligns image and text embeddings.
Cache key and value tensors from previous timesteps so each new token only computes attention over one new position.
Inject trainable low-rank decomposition matrices (A, B) into a frozen linear layer for parameter-efficient fine-tuning.
Select the k highest-probability tokens, zero out the rest, renormalize, and sample for controlled text generation.
Sort logits, compute cumulative probabilities, mask tokens below the nucleus threshold, and sample from the filtered distribution.
Compute the Direct Preference Optimization loss that trains a policy directly from preference pairs without a reward model.
Build Proximal Policy Optimization with clipped surrogate objective, value function baseline, and KL penalty for RLHF.
Build Group Relative Policy Optimization that scores multiple completions per prompt and uses group-relative advantages.