y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#llm-optimization News & Analysis

226 articles tagged with #llm-optimization. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

226 articles
AINeutralarXiv – CS AI · May 296/10
🧠

When Cloud Agents Meet Device Agents: Lessons from Hybrid Multi-Agent Systems

Researchers present a systematic analysis of hybrid multi-agent systems combining cloud-based large language models with on-device small language models, revealing that optimal architecture design is highly task-dependent and that increased frontier compute does not guarantee better performance across the power-cost-accuracy Pareto frontier.

AINeutralarXiv – CS AI · May 296/10
🧠

Unifying Temporal and Structural Credit Assignment in LLM-Based Multi-Agent Prompt Optimization

Researchers propose a novel method for optimizing multi-agent LLM systems by decomposing credit assignment into temporal and structural components, enabling more efficient prompt optimization through targeted refinement rather than global updates. The approach uses state-space bottleneck analysis and role-based policy isolation to identify and fix weak components in collaborative AI systems, reducing computational queries while improving reasoning performance across benchmarks.

AIBullisharXiv – CS AI · May 296/10
🧠

Loong: A Human-Like Long Document Translation Agent with Observe-and-Act Adaptive Context Selection

Researchers introduce Loong, an AI agent designed to improve long document translation by selectively retrieving relevant context from a 3E memory module rather than processing all available information. The system uses reinforcement learning to optimize context selection and demonstrates significant translation quality improvements across multiple language pairs, achieving gains up to 13 points on standard evaluation metrics.

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
🧠

MGRetrieval: Memory-Guided Reflective Retrieval for Long-Term Dialogue Agents

Researchers introduce MGRetrieval, a novel retrieval strategy for long-term dialogue agents that uses semantic memory structures to guide multi-step retrieval rather than one-shot approaches. The method improves performance on dialogue benchmarks by 8-11% while maintaining computational efficiency, addressing a key limitation in LLM-based conversational systems.

AINeutralarXiv – CS AI · May 286/10
🧠

Token Optimization Strategies for LLM-Based Oracle-to-PostgreSQL Migration

Researchers present twelve token optimization strategies for using LLMs to migrate Oracle databases to PostgreSQL, addressing cost and quality degradation challenges. Adaptive routing emerges as the optimal approach, reducing token consumption by 8.72% while maintaining 88.40% semantic match accuracy, demonstrating that token optimization requires balancing multiple objectives rather than simple prompt shortening.

AIBullisharXiv – CS AI · May 286/10
🧠

Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches

Researchers present an LLM-powered framework that enables non-expert end users to re-optimize deployed decision-support systems through natural language interaction, eliminating dependency on operations research specialists. The system combines language models with an optimization toolbox to dynamically adapt models to changing business conditions while maintaining solution quality and interpretability.

AINeutralarXiv – CS AI · May 286/10
🧠

Detecting and Mitigating the Correct-Answer Extinction Window in Test-Time Reinforcement Learning with Majority Voting

Researchers identify a critical failure mode in test-time reinforcement learning (TTRL) where majority voting locks onto incorrect answers, permanently suppressing correct signals in low-ability problems. They introduce TTRL-Guard, a framework using flip-rate monitoring and selective updating to prevent this 'Correct-Answer Extinction Window,' achieving 54% relative improvement on AIME 2025 benchmarks.

AIBullisharXiv – CS AI · May 276/10
🧠

CroCo: Cross-Lingual Contrastive Preference Tuning on Self-Generations

Researchers demonstrate that cross-lingual contrastive preference tuning (CroCo) enables large language models to improve performance across 14 languages without language-specific annotations by leveraging English-trained reward models. The method shows consistent gains in both structured and open-ended generation tasks across multiple languages while avoiding catastrophic forgetting.

AINeutralarXiv – CS AI · May 276/10
🧠

Persona Generators: Generating Diverse Synthetic Personas for Arbitrary Contexts

Researchers introduce Persona Generators, AI functions that create diverse synthetic populations for evaluating AI systems across varied user demographics without needing extensive real-world data collection. Using iterative optimization with large language models, the approach generates lightweight code that produces synthetic personas spanning rare trait combinations and long-tail behaviors, outperforming existing baselines on diversity metrics.

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
🧠

SearchSkill: Teaching LLMs to Use Search Tools with Evolving Skill Banks

SearchSkill is a new framework that teaches language models to perform more effective web searches by explicitly planning queries through reusable skill cards rather than treating search as an undifferentiated action. The system maintains an evolving skill bank that improves from failure patterns, demonstrating better performance on knowledge-intensive QA tasks with fewer wasted queries and improved reasoning accuracy.

AINeutralarXiv – CS AI · May 126/10
🧠

TRACE: Distilling Where It Matters via Token-Routed Self On-Policy Alignment

Researchers introduce TRACE, a novel training method that improves AI model performance by selectively applying different optimization techniques to critical versus routine tokens in reasoning tasks. The approach addresses inefficiencies in standard self-distillation by concentrating training effort on important decision points, achieving 2.76 percentage point improvements over baseline methods while better preserving out-of-distribution generalization.

AIBullisharXiv – CS AI · May 126/10
🧠

Agent-X: Full Pipeline Acceleration of On-device AI Agents

Researchers introduce Agent-X, a software framework that accelerates LLM-based agents running on edge devices by optimizing both prefill and decode stages through prompt rewriting and LLM-free speculative decoding. The framework achieves 1.61x end-to-end speedup with no accuracy loss, addressing a critical performance bottleneck in on-device AI deployments.

AIBullisharXiv – CS AI · May 126/10
🧠

SLASH the Sink: Sharpening Structural Attention Inside LLMs

Researchers present SLASH, a training-free method that improves how Large Language Models understand graph structures by fixing an internal attention bottleneck. The approach leverages LLMs' spontaneous ability to reconstruct graph topologies internally, addressing a fundamental limitation where language-focused attention patterns suppress graph reasoning capabilities.

AIBullisharXiv – CS AI · May 126/10
🧠

Evolving-RL: End-to-End Optimization of Experience-Driven Self-Evolving Capability within Agents

Researchers introduce Evolving-RL, a framework that optimizes how AI agents learn from past experiences to adapt to new tasks. The method jointly improves both experience extraction and utilization through reinforcement learning, achieving significant performance gains on out-of-distribution tasks without requiring test-time experience accumulation.

AIBullisharXiv – CS AI · May 126/10
🧠

HTPO: Towards Exploration-Exploitation Balanced Policy Optimization via Hierarchical Token-level Objective Control

Researchers introduce HTPO, a novel reinforcement learning algorithm that optimizes Large Language Models by assigning different learning objectives to different tokens based on their functional roles in reasoning tasks. The method achieves significant performance improvements on challenging benchmarks like AIME, demonstrating that granular token-level control can better balance exploration and exploitation in AI training.

AINeutralarXiv – CS AI · May 126/10
🧠

Do not copy and paste! Rewriting strategies for code retrieval

Researchers evaluated multiple code retrieval strategies using LLM-based rewriting, finding that full natural language transcription with query-corpus augmentation achieves the largest gains but corpus-only approaches often degrade performance. They introduced Delta H (token entropy) as a cheap, rewriter-agnostic metric to predict when LLM rewriting justifies its computational cost.

AINeutralarXiv – CS AI · May 126/10
🧠

LLMSYS-HPOBench: Hyperparameter Optimization Benchmark Suite for Real-World LLM Systems

Researchers have released LLMSYS-HPOBench, the first comprehensive benchmark suite for hyperparameter optimization in real-world LLM systems, containing 364,450 configurations across 932 settings with multiple fidelity factors and cost metrics. The dataset addresses gaps in existing AutoML benchmarks by capturing the unprecedented complexity of optimizing both AI and non-AI components in production language model systems.

AINeutralarXiv – CS AI · May 126/10
🧠

CDS4RAG: Cyclic Dual-Sequential Hyperparameter Optimization for RAG

Researchers introduce CDS4RAG, a novel optimization framework that improves Retrieval-Augmented Generation systems by cyclically optimizing retriever and generator hyperparameters separately rather than treating them as a monolithic unit. The method achieves up to 1.54x improvements in generation quality while demonstrating faster convergence across multiple benchmarks and language models.

AINeutralarXiv – CS AI · May 126/10
🧠

Evolutionary Ensemble of Agents

Researchers introduce Evolutionary Ensemble (EvE), a decentralized framework that organizes coding agents into a self-evolving system for algorithmic discovery. By co-evolving two populations—functional code solvers and agent guidance states—EvE autonomously discovered novel mechanisms for In-Context Operator Networks, demonstrating that dynamic agent adaptation outperforms static optimization approaches.

AINeutralarXiv – CS AI · May 126/10
🧠

Navigating LLM Valley: From AdamW to Memory-Efficient and Matrix-Based Optimizers

A comprehensive arXiv survey examines the evolution of optimization algorithms for large language model training, moving beyond Adam toward memory-efficient, second-order, and matrix-based approaches. The research emphasizes that modern LLM optimization requires rigorous, scale-aware benchmarking that evaluates convergence, stability, memory usage, and implementation complexity rather than isolated speedup claims.

AINeutralarXiv – CS AI · May 126/10
🧠

Assessment of RAG and Fine-Tuning for Industrial Question-Answering-Applications

A new study compares Retrieval-Augmented Generation (RAG) and fine-tuning approaches for adapting Large Language Models to enterprise question-answering tasks in the automotive industry. The research finds that RAG offers superior cost-efficiency while maintaining comparable answer quality, even enabling open-source models to match premium model performance.

AIBullisharXiv – CS AI · May 126/10
🧠

Metal-Sci: A Scientific Compute Benchmark for Evolutionary LLM Kernel Search on Apple Silicon

Researchers introduce Metal-Sci, a benchmark suite for optimizing machine learning kernels on Apple Silicon using evolutionary LLM-driven search. The system demonstrates speedups ranging from 1.0x to 10.7x across scientific computing tasks while introducing a held-out validation mechanism that catches silent regressions in generalization, revealing critical flaws that in-distribution metrics alone cannot detect.

🧠 GPT-5🧠 Claude🧠 Opus
← PrevPage 7 of 10Next →