y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#efficiency News & Analysis

175 articles tagged with #efficiency. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

175 articles
AINeutralarXiv – CS AI · Jun 26/10
🧠

DASH: Dual-Branch Score Distillation for Guidance-Calibrated Compact Diffusion Models

DASH introduces a dual-branch distillation framework for compressing class-conditional diffusion models while preserving classifier-free guidance effectiveness. By independently supervising both conditional and unconditional score branches, the method achieves 5.9x model compression with minimal quality degradation, addressing a critical limitation in existing distillation approaches where guidance mechanisms collapse during compression.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Neural Network Compression by Approximate Differential Equivalence

Researchers propose a novel neural network compression method using polynomial ODE systems and Approximate Forward Differential Equivalence to aggregate neurons with similar functional behavior, rather than pruning weights independently. The approach achieves significant parameter reduction while maintaining accuracy, outperforming traditional magnitude-based pruning methods across synthetic and public benchmarks.

AINeutralarXiv – CS AI · Jun 16/10
🧠

XOResNet: Exclusive-OR Meta-Residuals Facilitate Deep Spiking Neural Networks Learning

Researchers propose XOResNet, a novel deep spiking neural network architecture that addresses spike redundancy and information loss in residual structures through OR-ADD shortcut connections and XOR meta-residuals. The model demonstrates improved performance over existing deep SNNs on multiple benchmark datasets, offering architectural insights for building more efficient neuromorphic computing systems.

AIBullisharXiv – CS AI · Jun 16/10
🧠

Smaller Models are Natural Explorers for Policy-Level Diversity in GRPO

Researchers propose S2L-PO, a framework that uses smaller language models as natural policy explorers to train larger models more efficiently. By leveraging the inherent policy-level diversity of smaller models rather than token-level randomness, the approach achieves significant accuracy improvements on mathematical reasoning tasks while reducing computational costs.

AINeutralarXiv – CS AI · May 296/10
🧠

Tailoring the Curriculum: Student-Centered Reasoning Distillation via Dynamic Data-Model Compatibility

Researchers introduce the Data-Model Compatibility (DMC) metric to evaluate how well training datasets align with student models during reasoning distillation from large language models. The metric jointly assesses data quality, difficulty, and student capability, demonstrating strong correlation with distillation performance and enabling dynamic dataset selection that improves outcomes across multiple models and tasks.

AINeutralarXiv – CS AI · May 296/10
🧠

Redundant or Necessary? A Benchmark for Detecting Redundant Steps in Agent Trajectories

Researchers introduce RedundancyBench, a new benchmark for detecting redundant steps in LLM-based agent trajectories, revealing that current methods struggle significantly with this task—the best approach achieves only 24.88% accuracy. This work highlights a critical gap in agent evaluation: while task success is commonly measured, execution efficiency and resource optimization remain largely unmeasured, suggesting AI agents require substantial improvements in reasoning efficiency.

AINeutralarXiv – CS AI · May 296/10
🧠

MIRA: Mid-training Rubric Anchoring for Source-Aware Data Selection

Researchers introduce MIRA, a framework for optimizing data selection during mid-training of large language models by dynamically discovering and applying source-specific evaluation rubrics. The approach achieves comparable performance to full-corpus training while reducing token usage by 50% on code-oriented tasks across 21 diverse data sources.

AINeutralarXiv – CS AI · May 296/10
🧠

KLAS: Using Similarity to Stitch Neural Networks for Improved Accuracy-Efficiency Tradeoffs

KLAS is a new framework that automates the selection of neural network stitching configurations by using KL divergence to measure similarity between pretrained models, enabling better accuracy-efficiency tradeoffs. The approach improves upon existing heuristic-based methods and achieves up to 1.21% higher accuracy on ImageNet-1K at equivalent computational cost, or reduces computational requirements by 1.33x while maintaining performance.

AINeutralarXiv – CS AI · May 296/10
🧠

EviLink: Multi-Path Schema Linking with Uncertainty-Guided Evidence Acquisition for Large-Scale Text-to-SQL

EviLink is a new AI framework that improves Text-to-SQL systems by treating schema linking as an uncertainty-aware process across multiple SQL paths rather than a single deterministic selection. The approach balances schema completeness, relevance, and computational cost, achieving 90.15% field-level recall on Spider2-Snow while using fewer tokens than existing methods.

AIBullisharXiv – CS AI · May 296/10
🧠

HyperGuide: Hyperbolic Guidance for Efficient Multi-Step Reasoning in Large Language Models

Researchers introduce HyperGuide, a method that uses hyperbolic geometry to improve multi-step reasoning in large language models by efficiently guiding generation toward solutions. The approach leverages the mathematical properties of hyperbolic space to encode solution proximity and distinguish reasoning branches, achieving consistent improvements across benchmarks with minimal computational overhead compared to tree-search methods.

AINeutralarXiv – CS AI · May 296/10
🧠

CORE-T: COherent REtrieval of Tables for Text-to-SQL

CORE-T introduces a training-free framework for improving table retrieval in text-to-SQL systems by combining dense retrieval with LLM-generated metadata and compatibility caching. The approach achieves significant performance gains—up to 22.7 points in table-selection F1 and 24.4 points in multi-table execution accuracy—while reducing inference tokens by 64-76% compared to LLM-intensive alternatives.

AINeutralarXiv – CS AI · May 286/10
🧠

Do We Really Need Quantum Machine Learning?: A Multidimensional Empirical Study

A comprehensive benchmarking study compares classical and quantum machine learning models for image recognition, finding that quantum models (QSVM and QCNN) achieve superior accuracy and efficiency in specific scenarios. While quantum neural networks require 94% fewer parameters than classical counterparts, they incur higher computational costs, suggesting practical quantum advantage exists only within defined operating windows.

AIBullisharXiv – CS AI · May 276/10
🧠

Scaling GraphLLM with Bilevel-Optimized Sparse Querying

Researchers introduce BOSQ, a framework that optimizes the use of large language models for graph neural network tasks by selectively querying LLMs only when necessary. This approach reduces computational costs by orders of magnitude while maintaining or improving performance on text-attributed graph datasets, addressing a critical bottleneck in practical LLM-enhanced graph learning.

AIBullisharXiv – CS AI · May 126/10
🧠

E-TCAV: Formalizing Penultimate Proxies for Efficient Concept Based Interpretability

Researchers introduce E-TCAV, an optimized version of TCAV that improves the efficiency and stability of neural network interpretability testing by leveraging penultimate layer representations. The method achieves linear speed-ups while maintaining accuracy, advancing practical tools for model debugging and real-time concept-guided training across vision and language tasks.

AIBullisharXiv – CS AI · May 126/10
🧠

When Few Steps Are Enough: Training-Free Acceleration of Identity-Preserved Generation

Researchers demonstrate that identity-preserved image generation using FLUX can be accelerated 5.9x by replacing the standard diffusion backbone with a distilled version, without retraining the identity adapter. Analysis reveals identity fidelity stabilizes within 4-8 steps while later steps primarily refine visual details, enabling efficient personalized generation at deployment.

AINeutralarXiv – CS AI · May 126/10
🧠

Rethinking Random Transformers as Adaptive Sequence Smoothers for Sleep Staging

Researchers challenge the assumption that Transformers improve sleep staging through learning complex dependencies, instead revealing that random, untrained Transformers substantially boost performance by acting as adaptive smoothers. The findings suggest sleep staging relies more on architectural inductive bias than parameter learning, enabling simpler, more efficient models suitable for edge deployment in healthcare systems.

AINeutralarXiv – CS AI · May 116/10
🧠

Experience Sharing in Mutual Reinforcement Learning for Heterogeneous Language Models

Researchers introduce Mutual Reinforcement Learning, a framework enabling heterogeneous language models to share training experiences while maintaining separate parameters and tokenizers. The system uses three mechanisms—Shared Experience Exchange, Multi-Worker Resource Allocation, and a Tokenizer Heterogeneity Layer—to coordinate reinforcement learning across incompatible model architectures, with outcome-level success transfer showing the best stability-support trade-off.

AIBullisharXiv – CS AI · May 96/10
🧠

Policy-Guided Stepwise Model Routing for Cost-Effective Reasoning

Researchers propose a reinforcement learning-based policy for routing intermediate reasoning steps across language models of varying sizes, reducing inference costs while maintaining accuracy on math benchmarks. The method uses threshold calibration to balance performance and efficiency without requiring large process reward models, outperforming handcrafted routing strategies.

AINeutralarXiv – CS AI · Apr 146/10
🧠

Frugal Knowledge Graph Construction with Local LLMs: A Zero-Shot Pipeline, Self-Consistency and Wisdom of Artificial Crowds

Researchers demonstrate a zero-shot knowledge graph construction pipeline using local open-source LLMs on consumer hardware, achieving 0.70 F1 on document relations and 0.55 exact match on multi-hop reasoning through ensemble methods. The study reveals that strong model consensus often signals collective hallucination rather than accuracy, challenging traditional ensemble assumptions while maintaining low computational costs and carbon footprint.

AIBullisharXiv – CS AI · Apr 146/10
🧠

Advancing Polish Language Modeling through Tokenizer Optimization in the Bielik v3 7B and 11B Series

Researchers have optimized the Bielik v3 language models (7B and 11B parameters) by replacing universal tokenizers with Polish-specific vocabulary, addressing inefficiencies in morphological representation. This optimization reduces token fertility, lowers inference costs, and expands effective context windows while maintaining multilingual capabilities through advanced training techniques including supervised fine-tuning and reinforcement learning.

AIBullisharXiv – CS AI · Apr 136/10
🧠

WAND: Windowed Attention and Knowledge Distillation for Efficient Autoregressive Text-to-Speech Models

Researchers introduce WAND, a framework that reduces computational and memory costs of autoregressive text-to-speech models by replacing full self-attention with windowed attention combined with knowledge distillation. The approach achieves up to 66.2% KV cache memory reduction while maintaining speech quality, addressing a critical scalability bottleneck in modern AR-TTS systems.

AIBullisharXiv – CS AI · Apr 76/10
🧠

PRAISE: Prefix-Based Rollout Reuse in Agentic Search Training

Researchers introduce PRAISE, a new framework that improves training efficiency for AI agents performing complex search tasks like multi-hop question answering. The method addresses key limitations in current reinforcement learning approaches by reusing partial search trajectories and providing intermediate rewards rather than only final answer feedback.

AIBullisharXiv – CS AI · Apr 76/10
🧠

ANX: Protocol-First Design for AI Agent Interaction with a Supporting 3EX Decoupled Architecture

ANX is a new protocol-first framework designed for AI agent interaction, featuring a 3EX decoupled architecture that reduces token consumption by up to 66% compared to existing methods. The open-source protocol addresses security and efficiency issues in current AI agent implementations through agent-native design and integrated CLI, Skill, and MCP components.

🧠 GPT-4
AIBullisharXiv – CS AI · Apr 76/10
🧠

GROUNDEDKG-RAG: Grounded Knowledge Graph Index for Long-document Question Answering

Researchers introduced GroundedKG-RAG, a new retrieval-augmented generation system that creates knowledge graphs directly grounded in source documents to improve long-document question answering. The system reduces resource consumption and hallucinations while maintaining accuracy comparable to state-of-the-art models at lower cost.

← PrevPage 5 of 7Next →