Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
How Many Ranks Does a Token Need? A Noise-Floor Squelch for Rank-One LoRA Experts
Mei Okonkwo, Owen Castellanos, Ingrid Solberg +1
Low-rank adaptation (LoRA) applies every rank-one component of its update to every token, and mixture-of-experts variants replace this with a learned router that activates a fixed…
cs.LG2026
Prompts Live on an Arc: Gaussian Curricula in Fisher--Rao Coordinates for Rollout-Efficient GRPO
Mei Okonkwo, Pixel Nomand, Julian Berg +5
Group relative policy optimization (GRPO) learns only from prompts whose sampled responses disagree: a group that is entirely correct or entirely incorrect has zero reward variance…