y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#model-compression News & Analysis

191 articles tagged with #model-compression. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

191 articles
AINeutralarXiv – CS AI · Jun 16/10
🧠

Effective Reasoning Chains Reduce Intrinsic Dimensionality

Researchers demonstrate that effective chain-of-thought reasoning reduces intrinsic dimensionality—the minimum number of model dimensions needed to achieve target accuracy—offering a quantifiable metric for understanding why reasoning strategies improve language model generalization. Testing on GSM8K with Gemma models reveals strong inverse correlation between lower intrinsic dimensionality and better performance on both in-distribution and out-of-distribution tasks.

AIBullisharXiv – CS AI · May 296/10
🧠

ConMoE: Expert-Pool Consolidation via Prototype Reassignment for MoE Compression

ConMoE presents a novel post-training compression method for Mixture-of-Experts language models that consolidates expert pools through prototype reassignment rather than pruning or weight merging. The train-free approach selectively retains pretrained experts as reusable prototypes and remaps original expert references to these prototypes, achieving competitive or superior performance on major MoE models while significantly reducing deployment memory requirements.

AINeutralarXiv – CS AI · May 296/10
🧠

Context Distillation as Latent Memory Management

Researchers propose a novel approach to context distillation that treats compressed contextual information as a latent memory management problem, using modular LoRA adapters with intelligent retrieval and self-gating mechanisms to improve efficiency and robustness in machine learning systems.

AINeutralarXiv – CS AI · May 296/10
🧠

Model Fusion via Retrofitting

Researchers introduce a neuron-centric model fusion algorithm that combines independently trained neural networks without retraining by matching intermediate representations and using neuron attribution scores. The method outperforms existing approaches in zero-shot and non-IID scenarios across multiple architectures including VGGs, ResNets, and Vision Transformers.

AINeutralarXiv – CS AI · May 296/10
🧠

An accuracy-aware extension to LRP-based pruning for CNNs to prevent cascading accuracy degradation in data-scarce transfer learning

Researchers propose an accuracy-aware pruning mechanism for CNNs that improves upon existing Layer-wise Relevance Propagation (LRP) methods to reduce model size without degrading performance in transfer learning scenarios with limited data. The approach dynamically adjusts pruning rates using harmonic mean of class accuracy, achieving 15% improvement in compression efficiency while maintaining task-specific accuracy.

AIBullisharXiv – CS AI · May 296/10
🧠

Learn from A Rationalist: Distilling Intermediate Interpretable Rationales

Researchers propose REKD (Rationale Extraction with Knowledge Distillation), a method that improves the interpretability and performance of smaller deep neural networks by having them learn from larger teacher models' rationales and predictions. The approach demonstrates significant performance gains across language and vision tasks, offering a practical framework for making AI systems more transparent and verifiable in high-stakes applications.

AINeutralarXiv – CS AI · May 296/10
🧠

Theoretical Analysis of Sparse Optimization with Reparameterization, Weight Decay, and Adaptive Learning Rate

Researchers introduce ReWA, a novel sparse optimization method combining reparameterization, weight decay, and adaptive learning rates to address instability issues in ℓp regularization. Experiments on CIFAR-10 and ImageNet demonstrate that ReWA achieves superior sparsity compared to ℓ1 regularization while maintaining test accuracy, offering a practical alternative for neural network compression.

AINeutralarXiv – CS AI · May 286/10
🧠

Resource-Constrained Affect Modelling via Variance Regularisation Pruning

Researchers introduce Variance-Regularised Pruning (VR), a neural network pruning technique that reduces model size while maintaining robust performance across diverse users. The method balances computational efficiency with cross-participant stability in affective computing systems, achieving 80% sparsity without sacrificing reliability on the AGAIN emotion recognition dataset.

AINeutralarXiv – CS AI · May 286/10
🧠

Not All NVFP4 QAT Recipes Are Equal: How Architecture and Scale Shape Model Quality for Anomaly Segmentation

Researchers at arXiv demonstrate that model architecture significantly impacts how well neural networks handle FP4 quantization for medical image analysis. Swin Transformers maintain quality across different quantization recipes and scales, while CNNs degrade under certain conditions, establishing practical guidelines for deploying efficient anomaly segmentation models.

AINeutralarXiv – CS AI · May 286/10
🧠

Multi-Teacher Knowledge Distillation via Teacher-Informed Mixture Priors

Researchers introduce Multi-Teacher Bayesian Knowledge Distillation (MT-BKD), a framework that enables student models to learn from multiple teacher models while quantifying uncertainty through Bayesian inference. The approach uses teacher-informed priors and entropy-based weighting to improve model compression, generalization, and interpretability across synthetic and real-world tasks.

AIBullisharXiv – CS AI · May 286/10
🧠

ASTRA: Communication-Efficient Acceleration for Multi-Device Transformer Inference

ASTRA is a new framework that enables efficient multi-device Transformer inference by combining sequence parallelism with mixed-precision attention, allowing non-local token embeddings to be transmitted as compressed codes while maintaining full precision for local attention. The system achieves significant speedups (up to 2.64x) over single-device inference while operating at extremely low bandwidth requirements (as low as 10 Mbps), making it practical for bandwidth-constrained environments.

🧠 Llama
AINeutralarXiv – CS AI · May 276/10
🧠

Tail-Aware HiFloat4: W4A4 Post-Training Quantization for Wan2.2

Researchers have developed Tail-Aware HiFloat4, a post-training quantization method that compresses text-to-video generation models using W4A4 (4-bit weights and activations) while maintaining output quality. The technique introduces activation-tail-aware calibration to handle statistical outliers, enabling efficient model deployment without retraining.

AIBullisharXiv – CS AI · May 276/10
🧠

On the Push-Based Asynchronous Federated Learning: A Bias-Correction Aggregation Approach

Researchers propose PushCen-ADFL, a new framework for asynchronous decentralized federated learning that reduces communication overhead by over 80% while improving accuracy under data heterogeneity. The approach uses centroid-based message compression and bias-correction aggregation to enable stable model training across distributed systems without central coordination.

AIBullisharXiv – CS AI · May 276/10
🧠

Timestep-Aware SVDQuant-GPTQ for W4A4 Quantization of Wan2.2-I2V

Researchers present a new quantization method for large video diffusion models that achieves 59.3% memory reduction while maintaining near-baseline quality. The technique addresses challenges in compressing Wan2.2-I2V's mixture-of-experts architecture by using timestep-aware and expert-specific calibration strategies.

AINeutralDecrypt – AI · May 266/10
🧠

This Half-Gigabyte AI Model Runs Local Agents on Your Phone

OpenBMB has released a 1-billion-parameter AI model optimized for on-device execution on smartphones, featuring Model Context Protocol (MCP) support and agentic tool use capabilities. While the model enables local AI agents without cloud dependency, it demonstrates limitations in handling complex logical reasoning tasks.

This Half-Gigabyte AI Model Runs Local Agents on Your Phone
AINeutralarXiv – CS AI · May 126/10
🧠

DARE: Diffusion Language Model Activation Reuse for Efficient Inference

Researchers introduce DARE, a technique that reduces computational redundancy in Diffusion Language Models by reusing cached attention activations across tokens. The method achieves up to 1.20x per-layer latency improvements while maintaining generation quality, addressing efficiency gaps between diffusion-based and auto-regressive language models.

AIBullisharXiv – CS AI · May 126/10
🧠

TinySSL: Distilled Self-Supervised Pretraining for Sub-Megabyte MCU Models

Researchers introduce CA-DSSL, a new self-supervised learning technique that enables efficient AI model training on microcontrollers with under 500K parameters. The method surpasses existing approaches by 18 percentage points on standard benchmarks while requiring significantly fewer parameters, achieving 94% of supervised learning performance with models deployable in just 378 KB of memory.

AINeutralarXiv – CS AI · May 126/10
🧠

Compressed Video Aggregator: Content-driven Module for Efficient Micro-Video Recommendation

Researchers propose Compressed Video Aggregator (CVA), a lightweight module that improves micro-video recommendation systems by decoupling video processing from preference learning. The method reduces training time and GPU memory by orders of magnitude while maintaining or improving performance through intelligent frame selection based on video titles.

AINeutralarXiv – CS AI · May 126/10
🧠

Fitting Is Not Enough: Smoothness in Extremely Quantized LLMs

Researchers demonstrate that extreme quantization of large language models causes degradation beyond numerical precision loss, specifically through reduced smoothness in prediction spaces. They introduce smoothness-preserving techniques in post-training and quantization-aware training that improve generation quality independent of numerical accuracy gains.

AIBullisharXiv – CS AI · May 126/10
🧠

Evading Visual Aphasia: Contrastive Adaptive Semantic Token Pruning for Vision-Language Models

Researchers introduce COAST, a novel pruning framework for vision-language models that reduces visual tokens by 77.8% while maintaining 98.64% performance and achieving 2.15x speedup. Unlike existing methods that discard low-attention tokens, COAST uses adaptive semantic routing to preserve contextually essential information, preventing 'Visual Aphasia'—a failure mode where models lose visual grounding.

AIBullisharXiv – CS AI · May 126/10
🧠

Distilling 3D Spatial Reasoning into a Lightweight Vision-Language Model with CoT

Researchers have developed a knowledge distillation framework that compresses a 7B 3D vision-language model into a 2.29B student model, achieving 8.7x faster inference while retaining 54-72% performance. The approach introduces "Hidden CoT," learnable latent tokens that enable spatial reasoning without explicit chain-of-thought training data, making 3D scene understanding feasible on resource-constrained devices.

AINeutralarXiv – CS AI · May 116/10
🧠

Edge Deep Learning in Computer Vision and Medical Diagnostics: A Comprehensive Survey

A comprehensive academic survey examines edge deep learning—the integration of deep learning with edge computing—and its applications in computer vision and medical diagnostics. The paper categorizes hardware platforms, reviews model optimization techniques like compression and lightweight design, and identifies future challenges for deploying neural networks on resource-constrained devices.

AINeutralarXiv – CS AI · May 116/10
🧠

Amortized-Precision Quantization for Early-Exit Vision Transformers

Researchers introduce Amortized-Precision Quantization (APQ) and MAQEE, a framework that optimizes Vision Transformers for low-precision deployment with early-exit mechanisms. By jointly optimizing exit thresholds and bit-widths while accounting for quantization noise across layers, the approach achieves up to 95% reduction in computational operations while maintaining accuracy across vision tasks.

AINeutralarXiv – CS AI · May 116/10
🧠

TopoPrune: Robust Data Pruning via Unified Latent Space Topology

TopoPrune introduces a topology-based framework for data pruning that addresses instability issues in geometric methods by leveraging intrinsic data structure rather than extrinsic geometry. The approach combines manifold approximation with persistent homology to achieve high accuracy at extreme pruning rates (90%) while maintaining robustness across architectures and noise conditions.

← PrevPage 6 of 8Next →