efficiency

Tag

Cards List
#efficiency

@shikhargupta02: I’ve been learning about latent attention (by deepseek). Instead of storing a full K and a V vector per token, it rathe…

X AI KOLs Timeline · yesterday Cached

The author shares insights from training a small model with DeepSeek's latent attention, observing layer-dependent latent usage and a test-time trick that reduces KV cache 4x without loss change.

0 favorites 0 likes
#efficiency

I'm excited for Intel after testing the XPS 13

Jeff Geerling · yesterday Cached

Jeff Geerling reviews the Dell XPS 13 with Intel Core 5 320, highlighting its impressive power efficiency and Linux compatibility, and expresses optimism about Intel's low-end processor direction.

0 favorites 0 likes
#efficiency

1.3B activated params out of 7.9B total, aimed at agent work. Where does this curve flatten?

Reddit r/ArtificialInteligence · 2d ago

InclusionAI (Ant Group's lab) launched Ling 3.0 Tiny, a closed API model with 1.3B activated params out of 7.9B total, 256K context, native function calling, and a thinking/instant mode, aimed at multi-turn agent tool loops. The article questions the efficiency curve and notes no independent evals or open weights.

0 favorites 0 likes
#efficiency

GROM: Gradient-Free Rapid One-Shot Machine Unlearning

arXiv cs.LG · 2d ago Cached

Introduces GROM, a gradient-free one-shot machine unlearning method that computes a closed-form additive weight update via ridge-regularized least squares, achieving state-of-the-art forgetting-utility trade-offs on benchmarks like TOFU and WMDP, and resisting quantization-based recovery attacks.

0 favorites 0 likes
#efficiency

@maximelabonne: Wow, this gives me flashbacks of early model merging. Complete insanity, I love it!

X AI KOLs Following · 2d ago Cached

A new sub-6B sparse activation AI model built with a fusion architecture combines weights from LFM2.5-2.6B and Qwen3.6-35B-A3B, achieving near-Qwen3.6-35B performance at a fraction of the size.

0 favorites 0 likes
#efficiency

EASy: Towards Efficient LLM-Based Agentic System

arXiv cs.CL · 3d ago Cached

The paper proposes EASy, a trainable agentic framework that uses reinforcement learning to jointly optimize task performance and computational efficiency, introducing a milestone-plan-act workflow, dependency-aware execution graphs, and tree-structured rollout for training.

0 favorites 0 likes
#efficiency

Training-Free Hashing-Based Attention via Binary Principal Components

arXiv cs.LG · 3d ago Cached

Introduces BinaryPC, a training-free hashing-based sparse attention method for long-context LLMs that uses binary principal components to construct hash codes, preserving accuracy while improving decoding throughput by 3.56x over FlashAttention.

0 favorites 0 likes
#efficiency

EvtGraph: Event-Adaptive Compression for Sparse Temporal Graph Learning in Multimodal Time Series

arXiv cs.LG · 3d ago Cached

This paper introduces EvtGraph, a framework for efficient multimodal temporal graph learning that compresses sequences into event-level tokens under a budget constraint, demonstrating improved performance and efficiency over Transformer and recurrent baselines on clinical and cross-domain benchmarks.

0 favorites 0 likes
#efficiency

Attention-Only White-Box Transformer via LeJEPA-Based Self-Supervised Pretraining

arXiv cs.LG · 3d ago Cached

This paper proposes an attention-only white-box Transformer trained with LeJEPA-based self-supervised pretraining, achieving competitive accuracy on CIFAR-10/100 while cutting parameters by ~31% compared to CRATE, and further shows MLP redundancy in standard ViTs.

0 favorites 0 likes
#efficiency

Recurrent Residual Quantization: A Progressive Multi-Precision Representation for LLMs

arXiv cs.LG · 3d ago Cached

Introduces Recurrent Residual Quantization (RRQ), a post-training quantization framework that enables multiple effective precisions from a single LLM checkpoint via additive residual refinement, improving flexibility and construction speed.

0 favorites 0 likes
#efficiency

PaDoc: Layout-Grounded Parallel Decoding for Document Parsing

Hugging Face Daily Papers · 3d ago Cached

PaDoc introduces a layout-grounded parallel decoding method for end-to-end document parsers, decoupling layout and content decoding to reduce decoding depth and improve throughput. It achieves state-of-the-art results on OmniDocBenchFull and significantly speeds up inference compared to sequential baselines.

0 favorites 0 likes
#efficiency

A 460M VLM gets first-token latency down to 0.3s on an iPhone by using only 64 visual tokens

Reddit r/LocalLLaMA · 3d ago

VisionPsy-Nano-460M-Flash is a new 460M vision-language model that uses only 64 visual tokens per image, cutting first-token latency to 0.3s on iPhone while retaining roughly 99% of the full model's benchmark score. The optimization trades off some OCR and fine-detail quality.

0 favorites 0 likes
#efficiency

AcceptMoE: Commitment-Weighted Self-Sizing Verifier Expert Sets for Efficient MoE Speculative Decoding

arXiv cs.LG · 4d ago Cached

AcceptMoE is a verifier-side expert selection method for speculative decoding of MoE LLMs, which reduces expert-weight traffic and improves throughput by up to 2.06x under expert offloading with minimal accuracy loss.

0 favorites 0 likes
#efficiency

ATFlash: Per-RoPE-Wavelength Attention Windows for Compute/Memory-Efficient LLM Inference

arXiv cs.LG · 4d ago Cached

ATFlash introduces a per-RoPE-wavelength distance window that prunes query-key inner-product terms proportional to each frequency pair's wavelength, cutting 37-48% of attention compute with minimal quality loss and up to 1.31x speedups on long-context LLM inference.

0 favorites 0 likes
#efficiency

Intern S2 Mobius

Reddit r/LocalLLaMA · 4d ago

Intern-S2 Mobius is a Qwen3.5-35B derived model with an architectural difference claimed to improve throughput and reduce token consumption.

0 favorites 0 likes
#efficiency

OoO-Spec: Out-of-Order Semantic Speculation for Fast Tool Calling

arXiv cs.CL · 5d ago Cached

Introduces OoO-Spec, a method that accelerates LLM tool calling by computing semantic slots out of order via a small sidecar model, achieving up to 5.34x speedup over autoregressive decoding and outperforming existing drafter methods across multiple targets and benchmarks.

0 favorites 0 likes
#efficiency

SparseKAN: Compressing Kolmogorov--Arnold Networks Across Basis Functions, Neurons, and Bits

arXiv cs.LG · 5d ago Cached

SparseKAN is a unified compression method for Kolmogorov–Arnold Networks that prunes basis functions, neurons, and numerical precision under learnable gates, achieving up to 73% parameter reduction and significant latency improvements on software and FPGA hardware.

0 favorites 0 likes
#efficiency

OmniPack: Unified Token Compression for Efficient Omni-modal Large Language Models

Hugging Face Daily Papers · 5d ago Cached

OmniPack proposes a training-free token compression framework for omni-modal LLMs, combining structural pre-LLM compression with task-relevant inner-LLM semantic refinement, achieving strong performance-efficiency trade-offs on multiple benchmarks.

0 favorites 0 likes
#efficiency

@peony__snow: +3.2 on ARC-E with only +0.0024% parameters and +0.056% FLOPs. Frac-Connections revisits residuals by partitioning hidd…

X AI KOLs Timeline · 5d ago Cached

Frac-Connections is a new method that partitions hidden states instead of expanding them, extending Hyper-Connections to fractional expansion rates. It achieves stronger downstream performance than residual connections with virtually no extra compute, as validated on up to 7B MoE language models.

0 favorites 0 likes
#efficiency

Implicit Machine Learning Force Fields Accelerate Molecular Dynamics Simulations

arXiv cs.LG · 6d ago Cached

Introduces implicit machine learning force fields (I-MLFFs) that replace deep neural network stacks with fixed-point equations, enabling warm-starting and up to 5x compute/memory savings across graph neural network architectures for molecular dynamics simulations.

0 favorites 0 likes
Next →
← Back to home

Submit Feedback