Topic / Trend Stable

Efficient ML Methods and Evaluation Limits

Research on quantization, fine-tuning without backprop, block attention and routing shows progress on efficiency, while coding benchmarks reveal generalization limits.

Detected: 2026-08-22 · Updated: 2026-08-22

Related Coverage

2026-08-20 ArXiv cs.LG

ECASQ: Entropy-Constrained Adaptive Stochastic Quantization

ECASQ jointly optimizes adaptive quantization and lossless compression by minimizing MSE under an entropy budget and an unbiasedness constraint. The optimal dynamic program runs in O(sd^2) time and O(d^2) space. A GPU-friendly approximate version red...

#Hardware #LLM On-Premise #DevOps
2026-08-18 ArXiv cs.LG

FPO Speeds Up LLM Fine-Tuning Without Cross-Layer Backpropagation

FPO adapts LLMs without a backward pass through the model body, reaching 2.7–3.2x the throughput of standard fine-tuning and about 40% less peak training memory. On OLMo-2-7B, Qwen3-8B, and Falcon3-7B, it improves in-domain perplexity while leaving M...

#Hardware #LLM On-Premise #Fine-Tuning
2026-08-17 ArXiv cs.LG

Benchmarks as Targets: Ranking Distortion and On-Premise Risks

Fine-tuning on SWE-bench does not transfer capability to suites like Django or LiveCodeBench. The benchmark becomes a training target and stops measuring general ability. For self-hosted LLM operators, an inflated score distorts VRAM, quantization, a...

2026-08-17 ArXiv cs.CL

BCMT: Blockwise Causal Memory Reduces the Weight of Global Attention

BCMT separates local token interaction from global context propagation. In tests up to 1024 tokens, it achieves validation performance comparable to Dense Transformers, with higher training throughput and lower memory consumption. The exponential cau...

#Hardware #LLM On-Premise #Fine-Tuning
← Back to All Topics