Pith. sign in

Astraios: Parameter-efficient instruction tuning code large language models

3 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.

3 Pith papers citing it
2 external citations · Pith
abstract

The high cost of full-parameter fine-tuning (FFT) of Large Language Models (LLMs) has led to a series of parameter-efficient fine-tuning (PEFT) methods. However, it remains unclear which methods provide the best cost-performance trade-off at different model scales. We introduce Astraios, a suite of 28 instruction-tuned OctoCoder models using 7 tuning methods and 4 model sizes up to 16 billion parameters. Through investigations across 5 tasks and 8 different datasets encompassing both code comprehension and code generation tasks, we find that FFT generally leads to the best downstream performance across all scales, and PEFT methods differ significantly in their efficacy based on the model scale. LoRA usually offers the most favorable trade-off between cost and performance. Further investigation into the effects of these methods on both model robustness and code security reveals that larger models tend to demonstrate reduced robustness and less security. At last, we explore the relationships among updated parameters, cross-entropy loss, and task performance. We find that the tuning effectiveness observed in small models generalizes well to larger models, and the validation loss in instruction tuning can be a reliable indicator of overall downstream performance.

citation-role summary

background 1

citation-polarity summary

years

2026 3

roles

background 1

polarities

background 1

representative citing papers

Rethinking Code Performance Benchmarks for LLMs

cs.SE · 2026-07-08 · conditional · novelty 6.0

Re-evaluating four LLM code-efficiency benchmarks with 30-run statistical testing shows 93.89% of 'performant' implementations are indistinguishable from baselines; a multi-agent test-generation framework reveals hidden significant improvements in ~24% of previously non-significant tasks.

LoRA vs. Full Fine-Tuning: A Theoretical Perspective

cs.LG · 2026-05-18 · unverdicted · novelty 5.0

In linear regression, LoRA can achieve lower excess risk than full fine-tuning when the pretraining-downstream difference is low-rank, and small LoRA ranks can improve generalization by acting as regularization.

citing papers explorer

Showing 3 of 3 citing papers.

  • Rethinking Code Performance Benchmarks for LLMs cs.SE · 2026-07-08 · conditional · none · ref 83 · internal anchor

    Re-evaluating four LLM code-efficiency benchmarks with 30-run statistical testing shows 93.89% of 'performant' implementations are indistinguishable from baselines; a multi-agent test-generation framework reveals hidden significant improvements in ~24% of previously non-significant tasks.

  • BoostAPR: Boosting Automated Program Repair via Execution-Grounded Reinforcement Learning with Dual Reward Models cs.AI · 2026-05-09 · unverdicted · none · ref 10 · 2 links

    BoostAPR boosts automated program repair by training a sequence-level assessor and line-level credit allocator from execution outcomes, then applying them in PPO to reach 40.7% on SWE-bench Verified.

  • LoRA vs. Full Fine-Tuning: A Theoretical Perspective cs.LG · 2026-05-18 · unverdicted · none · ref 29

    In linear regression, LoRA can achieve lower excess risk than full fine-tuning when the pretraining-downstream difference is low-rank, and small LoRA ranks can improve generalization by acting as regularization.