Topic: inference
12 stories found
Yesterday
BlockLock: Reproducible LLM Inference with Fixed Batch Geometry
BlockLock introduces a method for ensuring reproducible Large Language Model (LLM) inference by maintaining fixed batch geometry, addressing limitations of existing approaches that either constrain every operation or isolate prefilling. This technique is crucial for applications requiring consistent outputs across different requests in the same batch.
Thursday, November 5, 2026
Matching the Training-Time Weight Rule in Inference-Time Expert Deactivation
Researchers have compared different methods of expert deactivation during inference to understand their impact on model performance, focusing on token routing and weight adjustments. This study is crucial for optimizing the efficiency and effectiveness of large language models without compromising accuracy.
Wednesday, November 4, 2026
From Lookups to Lessons: Turning Retrieved Knowledge into Parametric Memory
A new method called retrieval-augmented generation (RAG) allows large language models to answer factual questions outside their training data, but at increased storage and inference costs. To address these costs, researchers propose distilling retrieved information into parametric memories for reuse, enhancing efficiency while maintaining performance.
Saturday, October 31, 2026
Amortized Localized Posterior Inference for Model Calibration with Application to an Ocean Turbulence Closure
A new method called amortized localized posterior inference is introduced to address model calibration issues by accounting for uncertainties in both observations and contexts, particularly in complex systems like ocean turbulence. This approach aims to improve the reliability of physical response predictions across different scenarios.
Tuesday, October 27, 2026
Linear-Time Context Compression with State-Space Encoding
A new method for compressing context in large language models has been proposed to reduce computational and memory demands, addressing the challenges posed by increasing context sizes in transformer-based models. This technique aims to make LLMs more efficient without significantly compromising performance.
Monday, October 26, 2026
LazyFlash: Forward-Dense, Backward-Sparse Attention for Accelerated Long-Context Fine-Tuning
A new method called LazyFlash has been introduced to address the computational challenges of processing long sequences in large language models by using forward-dense, backward-sparse attention, which aims to accelerate fine-tuning while reducing computational demands. This innovation is crucial as it potentially enables more efficient training of models with longer contexts without sacrificing performance.
šæ That's all for now. Come back tomorrow.
12 of 12 items shown. Sources: 169 days indexed.