Codestral and Llama3 Inference Latency and Throughput on LiveCodeBench Programming Tasks
Description
This report synthesises findings from 4 peer-reviewed papers addressing the following research question: How do inference latency and token throughput differ between Codestral and Llama3 when generating solutions for LiveCodeBench's multi-step programming problems. 8 claims were extracted from source literature; 8 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.5/10. This report is a machine-generated literature synthesis and does not constitute original research.
Research goal: How do inference latency and token throughput differ between Codestral and Llama3 when generating solutions for LiveCodeBench's multi-step programming problems?
Autonomous literature synthesis. Automated review score: 8.5/10. Full text and citation available at Assignee Research.
Notes
Files
paper.pdf
Files
(80.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:0c03d4e5ad09ca086d83b4db1066501c
|
80.6 kB | Preview Download |
Additional details
Related works
- Is compiled by
- https://assignee.net (URL)