y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#llm-optimization News & Analysis

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

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

MARFT: Multi-Agent Reinforcement Fine-Tuning

Researchers present MARFT (Multi-Agent Reinforcement Fine-Tuning), a framework for optimizing LLM-based multi-agent systems using reinforcement learning. The work introduces Flex-MG, a new Markov Game formulation, and addresses key challenges in applying traditional MARL to collaborative AI systems, providing open-source implementation for advancing adaptive agentic systems.

AINeutralarXiv – CS AI · Jun 26/10
🧠

Optimizing Diversity and Quality through Base-Aligned Model Collaboration

Researchers propose Base-Aligned Model Collaboration (BACo), an inference-time framework that dynamically combines base and aligned language models to improve both output diversity and quality simultaneously. The method uses token-level routing strategies based on uncertainty signals, achieving a 21.3% joint improvement in diversity-quality metrics without requiring expensive retraining or multi-pass decoding.

AINeutralarXiv – CS AI · Jun 26/10
🧠

AnomSeer: Reinforcing Multimodal LLMs to Reason for Time-Series Anomaly Detection

Researchers introduced AnomSeer, a system that enhances multimodal large language models for time-series anomaly detection by grounding reasoning in precise structural details rather than coarse heuristics. Using a novel reinforcement learning approach called TimerPO, AnomSeer outperforms larger commercial models like GPT-4o in classification and localization accuracy while providing interpretable reasoning traces.

🧠 GPT-4
AINeutralarXiv – CS AI · Jun 16/10
🧠

When are LLMs Sufficient Policy Optimizers for Sequential RL Tasks?

Researchers introduce Prompted Policy Optimization (PromptPO), a method using large language models as black-box policy optimizers for reinforcement learning tasks. The approach demonstrates competitive or superior performance to traditional RL algorithms in exploration-heavy and robotics domains while requiring fewer environment interactions, though it underperforms in continuous control tasks like MuJoCo.

AINeutralarXiv – CS AI · Jun 16/10
🧠

On the impact of retrieved content representations in RAG Pipelines

Researchers conducted a controlled study examining how retrieved documents should be formatted when fed into language models within RAG pipelines, rather than for human readers. Testing 14 different document representations across summarization, selection, and reformulation techniques, they found that answer retention—whether documents preserve answer-bearing content after transformation—is the primary driver of generation accuracy, while other factors like wording and length have minimal impact.

AINeutralarXiv – CS AI · Jun 16/10
🧠

SAC-Opt: Semantic Anchors for Iterative Correction in Optimization Modeling

Researchers introduce SAC-Opt, a framework that improves how large language models generate optimization code by grounding corrections in semantic accuracy rather than solver feedback alone. The approach achieves 7.7% average improvement in modeling accuracy across datasets, with gains up to 21.9% on complex problems, addressing silent logical errors in LLM-generated optimization models.

AINeutralarXiv – CS AI · May 296/10
🧠

Harmonizing Real-Time Constraints and Long-Horizon Reasoning: An Asynchronous Agentic Framework for Dynamic Scheduling

Researchers introduce RACE-Sched, an asynchronous AI framework that combines real-time symbolic heuristics with LLM-powered reasoning to solve dynamic job shop scheduling problems in industrial systems. The approach decouples fast reactive execution from slower deliberative optimization, enabling superior performance over deep reinforcement learning baselines while maintaining interpretability and millisecond-level response times.

AIBullisharXiv – CS AI · May 296/10
🧠

CoHyDE: Iterative Co-Training of LLM Rewriter & Dense Encoder for Tool Retrieval

Researchers introduce CoHyDE, an iterative co-training method that jointly optimizes a dense encoder and LLM rewriter to improve tool retrieval for AI agents. The approach outperforms single-component baselines by 2.5-8 percentage points on standard and vague queries, addressing the fundamental challenge of bridging colloquial user language with technical API vocabularies.

AIBullisharXiv – CS AI · May 296/10
🧠

NaRA: Noise-Aware LoRA for Parameter-Efficient Fine-Tuning of Diffusion LLMs

Researchers introduce NaRA (Noise-aware Low-Rank Adaptation), a parameter-efficient fine-tuning method designed specifically for diffusion large language models that adapts to noise levels during the denoising process. Unlike existing methods like LoRA that use static parameters, NaRA employs a hypernetwork to dynamically adjust low-rank matrices based on noise, achieving better performance on reasoning and code generation tasks.

AIBullisharXiv – CS AI · May 296/10
🧠

Enhancing Multi-Agent Communication through Attention Steering with Context Relevance

Researchers introduce Agent-Radar, a training-free context management method that improves multi-agent LLM systems by dynamically filtering irrelevant information from long conversation histories. The technique uses temporal and spatial decay mechanisms to maintain focus on relevant context, achieving up to 7.64% performance improvements across five benchmarks.

AINeutralarXiv – CS AI · May 296/10
🧠

TIMEGATE: Sustainable Time-Boxed Promotion Gates for Continual ML Adaptation Under Resource Constraints

TIMEGATE is a new policy framework that optimizes machine learning system adaptation by intelligently managing computational budgets across training, labeling, and evaluation cycles. The research demonstrates 2.3x efficiency gains in labeling versus training and achieves 66% evaluation-compute savings without compromising model accuracy, with validated results across tabular data and large language models like LLaMA-3.1-8B.

AIBullisharXiv – CS AI · May 296/10
🧠

Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits

Researchers propose BaSE, a multi-armed bandit algorithm that optimizes how large language models allocate computational resources during evolutionary search tasks. By dynamically distributing LLM calls across parallel trajectories, BaSE improves mean fitness by 12.3% over existing baselines while addressing the reliability gap between reported best-case and typical run performance.

AINeutralarXiv – CS AI · May 296/10
🧠

Discovering Cooperative Pipelines: Autoresearch for Sequential Social Dilemmas

Researchers demonstrate an autoresearch framework where an AI agent autonomously optimizes LLM-based policy synthesis for multi-agent cooperation problems. The system discovers objective-dependent pipeline designs that outperform hand-crafted baselines, with fairness mechanisms emerging only when optimizing for equitable outcomes rather than efficiency.

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.

← PrevPage 7 of 10Next →