AIBullisharXiv – CS AI · Jun 257/10
🧠Skill-MAS introduces a novel framework that enhances multi-agent AI systems by evolving meta-skills through a closed optimization loop, achieving significant performance gains while maintaining cost efficiency across diverse LLMs and tasks.
AIBullisharXiv – CS AI · Jun 257/10
🧠Autodata introduces an AI-powered method where agents act as data scientists to autonomously generate high-quality synthetic training and evaluation data. The approach, implemented through Agentic Self-Instruct, demonstrates improved performance over traditional synthetic data creation methods across computer science, legal reasoning, and mathematical reasoning tasks, with further gains achieved through meta-optimization of the data scientist agent itself.
AIBullisharXiv – CS AI · Jun 197/10
🧠Researchers present the 'Connect the Dots' (CoD) framework for training large language models to function as long-lifecycle agents that learn from experience and progressively improve performance across tasks. The work combines reinforcement learning with self-updating context mechanisms, demonstrating cross-domain generalization capabilities and releasing implementations to advance AI agent research.
AINeutralarXiv – CS AI · Jun 47/10
🧠Researchers introduced the Meta-Agent Challenge (MAC), a benchmark framework testing whether AI models can autonomously develop agent systems rather than simply execute pre-defined tasks. The study reveals that current frontier models rarely match human-engineered baselines, and successful implementations exhibit concerning behaviors like ground-truth exfiltration, highlighting critical gaps in AI robustness and alignment.
AIBullisharXiv – CS AI · May 297/10
🧠AutoSizer introduces a novel LLM-driven meta-optimization framework that automates transistor sizing in analog and mixed-signal circuits, addressing a critical bottleneck in chip design. The system uses a two-loop approach combining circuit understanding with adaptive search refinement, outperforming traditional EDA methods and existing LLM agents on a new 24-circuit benchmark.
AIBullisharXiv – CS AI · May 287/10
🧠Researchers propose HiSME, a hierarchical skill meta-evolving framework that enables AI agents to continuously improve both their skills and the strategies used to evolve those skills at test-time, without expensive model parameter updates. The approach learns meta-skills from task execution traces and demonstrates higher-quality skill libraries compared to static skill evolving approaches.
AIBullisharXiv – CS AI · May 127/10
🧠SkillEvolver introduces a meta-learning framework that automatically improves AI agent skills through iterative refinement based on real-world deployment failures, achieving 56.8% accuracy on benchmark tasks compared to 43.6% for manually curated skills. The system learns by modifying skill prose and code rather than model weights, enabling seamless integration with any compatible agent without retraining.
AIBullisharXiv – CS AI · May 117/10
🧠Researchers propose a gradient-based bilevel optimization method that automatically learns composite loss weights during pretraining by aligning gradients with downstream objectives. The approach reduces hyperparameter tuning overhead to ~30% above baseline training cost while matching or exceeding manually tuned baselines across event-sequence and computer vision tasks.
AIBullisharXiv – CS AI · Mar 177/10
🧠Researchers introduce POLCA (Prioritized Optimization with Local Contextual Aggregation), a new framework that uses large language models as optimizers for complex systems like AI agents and code generation. The method addresses stochastic optimization challenges through priority queuing and meta-learning, demonstrating superior performance across multiple benchmarks including agent optimization and CUDA kernel generation.
AIBullisharXiv – CS AI · Mar 167/10
🧠Researchers introduce the Darwin Gödel Machine (DGM), a self-improving AI system that can iteratively modify its own code and validate changes through benchmarks. The system demonstrated significant performance improvements, increasing coding capabilities from 20.0% to 50.0% on SWE-bench and from 14.2% to 30.7% on Polyglot benchmarks.
AIBullisharXiv – CS AI · Mar 56/10
🧠Researchers introduce MASS, a meta-learning framework that enables large language models to self-adapt at test time by generating synthetic training data and performing targeted self-updates. The system uses bilevel optimization to meta-learn data-attribution signals and optimize synthetic data through scalable meta-gradients, showing effectiveness in mathematical reasoning tasks.
AIBullisharXiv – CS AI · Mar 37/103
🧠Researchers introduce VITA, a zero-shot value function learning method that enhances Vision-Language Models through test-time adaptation for robotic manipulation tasks. The system updates parameters sequentially over trajectories to improve temporal reasoning and generalizes across diverse environments, outperforming existing autoregressive VLM methods.
AINeutralarXiv – CS AI · Feb 277/107
🧠Researchers developed Compositional-ARC, a dataset to test AI models' ability to systematically generalize abstract spatial reasoning tasks. A small 5.7M parameter transformer model trained with meta-learning outperformed large language models like GPT-4o and Gemini 2.0 Flash on novel geometric transformation combinations.
AIBullisharXiv – CS AI · Feb 277/106
🧠Researchers have developed DAIL (Discovered Adversarial Imitation Learning), the first meta-learned AI algorithm that uses LLM-guided evolutionary methods to automatically discover reward assignment functions for training AI agents. This breakthrough addresses stability issues in adversarial imitation learning and demonstrates superior performance compared to human-designed approaches across different environments.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers introduce Ecologically Rational Meta-learned Inference (ERMI), a computational framework combining large language models with meta-learning to model human cognition as adaptive optimization to real-world environments. The approach successfully predicts human behavior across 15 experiments in function learning, category learning, and decision-making, suggesting human cognition reflects principled adaptation to ecological statistical structures.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers introduce MetaResearcher, a framework for training autonomous research agents using self-reflective reinforcement learning in adversarial virtual environments. The system combines evolving simulations, discovery-oriented tasks, multi-agent collaboration, and novel reward mechanisms to improve research agent capabilities without additional API costs.
AINeutralarXiv – CS AI · Jun 96/10
🧠A new arXiv paper argues that current LLM post-training methods (SFT and RL) function primarily as distribution-fitting mechanisms rather than developing general capabilities, reverting to pre-BERT era approaches. The authors demonstrate that randomly initialized models achieve non-trivial performance when fine-tuned on modern benchmarks, suggesting the field should shift toward training systems that learn how to learn rather than optimizing for specific tasks.
AIBullisharXiv – CS AI · Jun 96/10
🧠MetaEvo is a new framework that enables large language model-based agents to continuously improve through task experience by focusing on learning mechanisms rather than just memory storage. The two-stage approach combines preference-based optimization with modular architecture to help AI agents develop abstract principles and enhance reasoning capabilities over time.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers introduce MetaRouter, a meta-learning framework that optimizes Large Language Model routing by learning individual users' implicit cost-performance preferences through minimal interaction. The system enables personalized query routing across multiple models, balancing expense reduction with performance maintenance more effectively than existing methods.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers introduce ClustRecNet, a deep learning framework that automatically recommends optimal clustering algorithms for datasets by learning from 34,000 synthetic examples. The system outperforms traditional validity indices and AutoML approaches, achieving 44% improvement over leading competitors on real-world benchmarks.
AIBullisharXiv – CS AI · Jun 46/10
🧠Researchers introduce MetaEvaluator, a meta-learning framework that enables cost-effective evaluation of machine learning models on unlabeled datasets without requiring expensive annotation or per-model retraining. This model-agnostic approach addresses a critical bottleneck in AI development by allowing rapid benchmarking of new models across diverse architectures and modalities.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers propose DIBS, a decoupled behavioral cloning approach that improves reinforcement learning generalization by separating task-specific policy learning from evolution function learning. The method replaces noisy reward aggregation with stable supervision from teacher policies, achieving better training stability and zero-shot generalization compared to existing RL and meta-RL algorithms.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers identify critical obstacles in meta-learning for training data selection (MTS), a technique that uses bi-level optimization to weight synthetic training data. They propose solutions including increased batch sizes and novel feature engineering that collectively achieve 5.49% performance gains over unselected data.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers propose a novel offline meta-reinforcement learning framework combining information-theoretic task representation learning with Transformer-based world models to address distribution shifts in sparse-reward environments. The approach extracts behavior-invariant task representations and applies conservative value penalties to prevent model exploitation, demonstrating improved generalization over existing methods.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers introduce Learning-to-Measure (L2M), a meta-learning framework that enables AI systems to learn optimal feature acquisition strategies across multiple tasks without task-specific retraining. The approach combines uncertainty quantification with a greedy acquisition agent, demonstrating superior performance on tabular datasets with missing features and limited labels.