AIBullisharXiv – CS AI · Jun 257/10
🧠Researchers demonstrate that training vision-language models (VLMs) on curated, concise data significantly reduces inference costs without sacrificing accuracy. By focusing on output brevity rather than traditional model compression techniques, the approach achieves 35x efficiency gains over verbose models while maintaining competitive performance.
AIBullisharXiv – CS AI · Jun 257/10
🧠Researchers introduce MiniOpt, a reinforcement learning framework that enables compact language models (3B parameters) to solve diverse optimization problems efficiently without requiring large supervised datasets or expensive expert annotations. The approach uses a hierarchical reward function and structured decomposition strategy, achieving competitive performance compared to larger models while significantly reducing training overhead.
AIBullisharXiv – CS AI · Jun 257/10
🧠Researchers developed a multi-agent AI system that autonomously designs hardware-compatible computing systems using an Evolutionary Knowledge Graph, successfully compressing a 235-billion-parameter foundation model onto constrained dual-A100 servers with 75% memory reduction. The framework evolved two novel compression techniques (Q-Enhance and MoE-Salient-AQ) that outperform manually-engineered alternatives, establishing a scalable paradigm for hardware-software co-design in AI deployment.
AIBullisharXiv – CS AI · Jun 237/10
🧠GRINQH introduces a weight-only quantization framework that optimizes large language model inference by dynamically assigning different precision levels to weight channels based on activation magnitudes. The approach achieves state-of-the-art performance on Llama3 and Qwen3 models at 2-4 bit settings, addressing the GPU memory bandwidth bottleneck that constrains decoding speed in edge-computing environments.
🧠 Llama
AIBullisharXiv – CS AI · Jun 237/10
🧠Researchers propose ACOER, a novel training method that stabilizes efficiency optimization in large language models by applying length penalties only to correct answers, avoiding the reward collapse problems that plague existing approaches. The technique achieves 60% token reduction while maintaining or improving reasoning accuracy across mathematical benchmarks.
AIBullisharXiv – CS AI · Jun 237/10
🧠HyperQuant is a new post-training quantization pipeline that compresses large language and diffusion models to 3-5 bits per weight while maintaining near-lossless quality, outperforming existing methods like HIGGS and TurboQuant. The technique combines Hadamard transforms, optimal lattice quantization, and entropy coding to achieve 3.9x compression on model weights and 3.79x on KV cache, enabling more efficient deployment of large AI models.
AIBullisharXiv – CS AI · Jun 237/10
🧠Researchers introduce LUQ, the first ultra-low-bit quantization method for multimodal large language models that achieves 40% memory reduction compared to 4-bit models by analyzing layer-wise entropy and selectively applying extreme compression to simpler layers. The breakthrough addresses a critical deployment bottleneck for vision-language AI systems by recognizing that multimodal tokens require different precision handling than text tokens.
AIBullisharXiv – CS AI · Jun 197/10
🧠Researchers introduce StreamKL, a novel GPU optimization for computing KL divergence in attention distillation that reduces memory requirements from O(N_Q N_K) to O(1) and delivers up to 43x forward-pass speedups. This advancement enables efficient knowledge distillation and model compression for long-context language models on standard hardware.
AIBullisharXiv – CS AI · Jun 197/10
🧠Researchers demonstrate that Vision-Language-Action (VLA) models used in robotic manipulation contain significant layer-wise redundancy, enabling a training-free compression method that reduces model depth by up to 50% while improving downstream fine-tuning speed by 40-50% and inference speed by 30%. This finding suggests advanced robotics foundation models can operate effectively with substantially fewer parameters than currently assumed.
AIBullisharXiv – CS AI · Jun 117/10
🧠Researchers present a novel compression technique for speech foundation models using parameter clustering and k-means pruning without requiring training data or fine-tuning. The method demonstrates significant performance improvements over traditional magnitude-based pruning on HuBERT-large and Whisper-large-v3, with 27-59% relative WER reductions at various sparsity levels.
AIBullisharXiv – CS AI · Jun 107/10
🧠Researchers introduce NuWa, a novel model compression technique that derives lightweight, class-specific Vision Transformers optimized for edge devices. By identifying and removing class-detrimental weights through self-knowledge purification, NuWa achieves up to 29% accuracy improvements on specialized tasks while reducing pruning costs by 99.83% compared to existing methods.
AIBullisharXiv – CS AI · Jun 107/10
🧠Researchers introduce PiSO (Piecewise Scale Optimization), an algorithm that optimizes quantization scaling factors for compressing large language models more effectively than existing heuristic methods. By using calibration data to compute optimal channel-wise scales, PiSO demonstrates consistent improvements in model perplexity and downstream accuracy across Llama and Qwen models, with gains becoming more pronounced at lower bit-widths.
🏢 Perplexity🧠 Llama
AIBullisharXiv – CS AI · Jun 107/10
🧠Researchers introduce Sigma-Branch, a neural network restructuring framework that reduces per-inference active parameters by 58-60% while maintaining full model capacity in memory. The approach uses hierarchical routing and binary tree architecture to enable efficient edge deployment without permanent model compression trade-offs.
AIBullisharXiv – CS AI · Jun 107/10
🧠Researchers propose improved post-training quantization techniques for large language models using quantile-robust scaling policies and learned channel scales, demonstrating 18.5% error reduction on LLaMA-3.2-1B under W4A4 quantization. The work addresses activation quantization challenges caused by outlier-dominated channels, offering practical efficiency improvements for LLM deployment without requiring full model retraining.
AIBullisharXiv – CS AI · Jun 97/10
🧠ScaleSweep introduces an optimized block scale initialization method for NVFP4 quantization of large language models, improving upon traditional AbsMax approaches. The technique theoretically bounds the search space and empirically achieves 93% performance retention under aggressive 4-bit quantization, advancing hardware-efficient AI inference.
🧠 Llama
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers introduced ZEDA, a framework that converts fully-trained Mixture-of-Experts language models into dynamic variants capable of skipping unnecessary experts, reducing computational requirements by over 50% with minimal accuracy loss. The method uses self-distillation to adapt post-trained models without retraining from scratch, achieving ~1.20x end-to-end inference speedup on major language models.
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers introduce APEX4, a pure INT4 inference system that addresses the long-standing challenge of W4A4 quantization in large language models by adapting compute strategies based on GPU architecture. The system achieves up to 2.09× speedup on consumer GPUs while maintaining quality within 0.63 perplexity points of FP16 baselines, making efficient LLM inference more practical across diverse hardware platforms.
$ADA🏢 Perplexity
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers introduce I-Segmenter, the first fully integer-only Vision Transformer framework for semantic segmentation that eliminates floating-point operations to enable efficient deployment on resource-constrained devices. The model achieves only 5.1% accuracy loss compared to standard floating-point versions while reducing model size by 3.8x and improving inference speed by 1.2x, with a novel activation function addressing quantization challenges.
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers introduce RAPID, a depth-aware token reduction framework for Vision Transformers that uses different pruning and merging strategies across network layers to reduce computational costs while maintaining accuracy. The method achieves superior performance compared to existing approaches like ToMe, with up to 4.29% higher accuracy in aggressive compression scenarios.
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers introduce OptiKIT, an open-source distributed framework that automates LLM optimization for enterprise deployments, delivering over 2x GPU throughput improvements while eliminating the need for specialized optimization expertise. The system democratizes model compression and tuning through dynamic resource allocation and intelligent pipeline orchestration, addressing a critical bottleneck in scaling AI initiatives within compute-constrained environments.
AIBullisharXiv – CS AI · Jun 87/10
🧠ActQuant introduces a novel post-training quantization framework that compresses Vision-Language-Action models to sub-4-bit weights while maintaining 94-95% performance, enabling practical deployment on edge devices. The method combines action-guided bit allocation with curvature-aware optimization, achieving 5.3× compression on major VLA models and validated performance on physical robotic hardware.
AIBullisharXiv – CS AI · Jun 87/10
🧠OffQ introduces a novel quantization technique for large language models that addresses activation outliers through an offsetting mechanism, enabling efficient W4A4KV4 low-bit quantization. The method uses top-1 PCA to identify outlier subspaces and concentrates high-magnitude activations into a single channel via rotation, then converts this into a shared offset to reduce standard deviation. This approach maintains uniform-grid quantization while improving accuracy across diverse LLM architectures.
AIBullisharXiv – CS AI · Jun 57/10
🧠SAGE-PTQ introduces a novel ultra-low-bit quantization framework for large language models that dramatically reduces scaling overhead while maintaining accuracy. The method achieves 1.03 weight bits per parameter with minimal scaling costs, outperforming existing approaches like BiLLM by orders of magnitude in perplexity metrics while requiring significantly less GPU memory.
🏢 Nvidia🏢 Perplexity
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers introduce Drive-KD, a knowledge distillation framework that compresses large vision-language models for autonomous driving by decomposing the task into perception, reasoning, and planning components. The method achieves superior performance with 42x less GPU memory and 11.4x higher throughput compared to larger baseline models, advancing the practical deployment of AI in safety-critical driving systems.
🧠 GPT-5
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers introduce Channel-Wise Mixed-Precision Quantization (CMPQ), a novel technique that reduces Large Language Model memory requirements by assigning different precision levels to different weight channels based on activation patterns. The method enables fractional-bit quantization between 2-4 bits while preserving critical information through outlier extraction, addressing deployment constraints on edge devices.