Skip to main content

Search AEX CONTINUUM

Titles, abstracts, authors, keywords and DOIs across all five collections.

7 results for “models” in keywordSearch & filters ↓

PreprintsShort CommunicationNot peer reviewed

Cheap Reward Models for Small-Scale RLHF Experiments

Jonas Berg, Anders Holm

Version 1 · 29 October 2026 · 10.xxxx/ctm.pp.2026.0008

Preference-based fine-tuning is expensive to study because reward models are large. We show that a reward model distilled to 1% of the size of the original recovers 94% of its ranking accuracy on held-out preference pairs, and that policies trained against the small model transfer to the large one with a modest loss. The result lowers the cost of reward-modelling experiments for groups with limited compute.

Abstract PDF 1,480 5120 cited
ProceedingsFull paperBest paper

Mixed-Precision Distillation for 4-bit Phone-Class Models

Yuki Saito, Daniel Okafor

SEODML 2026 · pp. 1–10 · 1 October 2026 · 10.xxxx/ctm.pr.2026.0006

Four-bit quantisation of small language models often hurts instruction following. We distil from a full-precision teacher while letting the student's layers use different bit widths chosen by a sensitivity analysis. The resulting 1.1B-parameter model fits in 700 MB and retains 96% of teacher accuracy on our instruction-following suite.

Abstract PDF 980 3601 cited
PublishingResearch ArticleUnder peer review

Quantisation-Aware Distillation for On-Device Assistants

Daniel Okafor, Yuki Saito, Priya Venkataraman

Version 1 · 1 reviewer report · 28 August 2026 · 10.xxxx/ctm.pb.2026.0006

Running assistant-grade language models on phones requires both small models and low-precision arithmetic, yet distillation and quantisation are usually applied one after the other. We train a 1.3B-parameter student with distillation losses computed through simulated 4-bit quantisation, so that the student learns to be robust to its own rounding error. Compared with distilling first and quantising afterwards, the joint procedure recovers 41% of the accuracy lost to 4-bit quantisation, reaches 94% of the full-precision student on a suite of assistant tasks, and runs 3.1× faster on a mid-range mobile processor.

Abstract PDF 2,144 7862 cited
PreprintsShort CommunicationNot peer reviewed

Speculative Decoding Under Memory Constraints

Rahul Desai, Yuki Saito

Version 1 · 5 November 2026 · 10.xxxx/ctm.pp.2026.0009

Speculative decoding accelerates generation by letting a small draft model propose tokens that a larger model verifies, but the draft model competes with the target model for scarce memory on edge devices. We characterise the trade-off between draft-model size, speed-up and memory footprint, and propose a draft that shares the target model's embedding table and lower layers. The shared draft reduces extra memory from 11% to 3% of the target model and retains 88% of the speed-up of an independent draft.

Abstract PDF 437 1210 cited