arXiv:2603. 17863v2 Announce Type: replace-cross Abstract: Automating the development of machine learning algorithms has the potential to unlock new breakthroughs.
arXiv:2604.16625v2 Announce Type: replace-cross Abstract: Recent large language model (LLM) agents have shown promise in using execution feedback for test-time adaptation. However, robust self-improv...
arXiv:2603. 17216v2 Announce Type: replace Abstract: With the advent of AI agents, automated scientific discovery is becoming an increasingly plausible goal.
arXiv:2607. 06764v1 Announce Type: new Abstract: Recent progress on ARC-AGI-1 from disclosed architectures has come broadly from two regimes: heavy test-time compute over frontier models (evolutionary search, exhaustive sampling, extended chain-of-thought), or benchmark-specific training in which small models are fine-tuned on ARC data, often with task-specialized architectures.
Generative Adversarial Loops (GAL) is a framework that alternates between a discriminator generating adversarial data to expose weaknesses in current AI systems and a generator discovering algorithms to overcome those weaknesses. Applied to tasks such as KV compression, sparse video generation, sparse attention, and context extension, GAL’s discriminator identifies shortcomings in state‑of‑the‑art techniques, while the generator produces new algorithms that improve performance on both adversarial and established benchmarks. The study demonstrates significant gains, for example boosting CompactorPress on KV compression from 0.35 to 0.97 on the discriminator dataset and improving Dual Chunk Attention from 0.20 to 0.90.
arXiv:2609.36679v1 Announce Type: new Abstract: Machine learning engineering (MLE) agents have made substantial progress, but learning through ML experimentation remains costly in time and computatio...
arXiv:2607. 21971v1 Announce Type: new Abstract: Test-time scaling through iterative self-evolution with environment feedback, as demonstrated by AlphaEvolve, shows remarkable performance gains.
arXiv:2607. 27953v1 Announce Type: new Abstract: Combinatorial optimization problems (COPs) underpin many real-world decisions, but their exponentially large search spaces make high-quality solutions costly to obtain.
arXiv:2606. 04261v1 Announce Type: new Abstract: Curating training data is among the most consequential yet labor-intensive parts of modern AI development: practitioners iteratively propose, implement, evaluate, and revise data policies against noisy benchmark feedback.
The paper introduces Strategy Accumulation and Guided Execution (SAGE), a two-stage framework that makes automated fine-tuning of large language models cumulative. In the first stage, a multi-agent pipeline uses Monte Carlo Tree Search to explore training strategies while a Distillation Agent records task-specific insights and cross-task confidence scores into a structured repository. In the second stage, SAGE retrieves relevant experience from this repository to guide training on new tasks, achieving a 12.4‑percentage‑point improvement over a baseline pipeline without accumulated experience on nine unseen tasks.
arXiv:2512. 23236v4 Announce Type: replace-cross Abstract: Making deep learning recommendation model (DLRM) training and inference fast and efficient is important.
AlgoEvo introduces a unified agentic framework for automated algorithm discovery that replaces rigid search pipelines with an interactive, knowledge‑accumulating process. An autonomous agent inspects, diagnoses, and edits code using runtime feedback, while a design skill hub decouples paradigm‑specific knowledge from the core engine, enabling a single workflow to handle single‑objective, multi‑objective, and multi‑component design tasks. The hierarchical experience mechanism organizes search trajectories into a task‑level tree, guiding exploration and consolidating cross‑task patterns into reusable skills, resulting in performance that matches or surpasses specialized methods with fewer evaluations and reduced token consumption.
arXiv:2608. 06714v1 Announce Type: new Abstract: Recent systems for optimizing prompts, programs, and ML workflows typically rely on explicit outer-loop controllers such as evolutionary search, bandits, or textual-gradient methods.