Quantization, distillation, pruning and serving work aimed at the same accuracy for less memory, latency and money.
arXiv:2609.08307v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly used as backends for intelligent web services, but serving them across the edge continuum requires bala...
arXiv:2609.06974v1 Announce Type: cross Abstract: Large language models achieve strong performance across diverse tasks, but deployment remains costly because of memory, latency, and energy demands....
arXiv:2609.07236v1 Announce Type: cross Abstract: Selecting a parallelism strategy - the configuration of data, tensor, and pipeline parallelism degrees together with micro- and global-batch sizes -...
arXiv:2609.05916v1 Announce Type: cross Abstract: Large vision-language models (LVLMs) achieve strong multimodal understanding, but the hundreds to thousands of visual tokens they process impose subs...
arXiv:2509.01809v2 Announce Type: replace-cross Abstract: We consider the problem of support recovery for sparse binary signals from noisy linear measurements. For sparse Gaussian measurement matrice...
The paper investigates online linear regression with sparse comparators, focusing on feature priming techniques that reweight features using past data. It establishes sparse‑regret lower bounds that invalidate sparse‑logarithmic guarantees for univariate, Pearson, and multivariate priming rules under a past‑only Moore–Penrose protocol, showing ≥Ω(min{T,√d}) clipped regret for unit‑power rules and linear regret for powered rules in high dimensions. The authors also provide tight rank upper bounds for certain priming schemes and present algebraic constructions yielding Ω(min{T,d^{1/4}}) regret for unit‑power multivariate priming, while noting that the exact multivariate frontier remains open.
arXiv:2609.06663v1 Announce Type: cross Abstract: Although multimodal Large Language Models (MLLMs) excel in diverse tasks, their scalability remains limited by the memory and computational overhead...
arXiv:2609.05760v1 Announce Type: cross Abstract: We present RAGMark, a modular benchmarking framework for advanced Retrieval-Augmented Generation (RAG) systems targeting small-scale multi-GPU enviro...
arXiv:2609.05764v1 Announce Type: cross Abstract: The key-value (KV) cache is the dominant memory bottleneck in long-context large language model (LLM) decoding: every step reads it entirely, so deco...
arXiv:2608.06411v2 Announce Type: replace-cross Abstract: Multimodal large language models (MLLMs) achieve strong performance across diverse vision-language tasks, but their efficiency is limited by...
arXiv:2609.06161v1 Announce Type: cross Abstract: Large language models (LLMs) have achieved remarkable progress, yet their massive storage and memory-bandwidth demands still hinder efficient deploym...
arXiv:2601.20845v2 Announce Type: replace Abstract: Time series forecasting is a fundamental problem with applications in climate, energy, healthcare, and finance. Many existing approaches require do...
arXiv:2609.07901v1 Announce Type: new Abstract: Weight quantization largely determines the economics of serving open-weight LLMs. Its costs are usually assessed with capability benchmarks, on which 4...
arXiv:2512.21653v2 Announce Type: replace-cross Abstract: Speech codecs are usually optimized for waveform fidelity, allocating bits to acoustic detail that can be inferred from linguistic structure....
arXiv:2510.25183v2 Announce Type: replace-cross Abstract: Energy-efficient AI should be evaluated across the full application pipeline, not only by lowest error or shortest training time. We study th...
arXiv:2609.06271v1 Announce Type: cross Abstract: Some low-cost Internet of Things (IoT) sensor deployments lack device-level source authentication, leaving them vulnerable to impersonation or inject...
The paper introduces a cross‑modal distillation framework that combines the accuracy of inertial measurement unit (IMU) data with the practicality of video‑based gait analysis to detect freezing of gait (FOG) in Parkinson’s patients. By extracting invariant latent topologies from a pre‑trained kinematic oracle, the method supervises a visual architecture and fuses skeletal graph nodes with continuous spatial pixels to handle severe spatial occlusion during continuous 360° turns. Experiments on a public multimodal dataset show that this approach reduces tracking entropy and achieves precise FOG predictions without requiring wearable sensors.
arXiv:2609.08248v1 Announce Type: new Abstract: Modern industrial ads ranking stacks are increasingly bottlenecked not by model capacity or training compute, but by the throughput of human ML iterati...
arXiv:2310.18727v2 Announce Type: replace Abstract: The latent class model is a highly effective tool in the analysis of categorical data from social, psychological, and behavioral sciences, where po...
arXiv:2609.07174v1 Announce Type: new Abstract: Efficient, fully automatic, and physically plausible 4D Gaussian synthesis is an important goal for dynamic scene generation. Recent physics-based meth...