6 articles tagged with #algorithm-discovery. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce AHD Agent, a reinforcement learning framework that enables language models to autonomously design heuristics for solving complex combinatorial optimization problems. A 4-billion-parameter model achieves performance comparable to much larger systems while requiring significantly fewer computational evaluations, advancing the frontier of AI-driven algorithm design.
Researchers introduce EVIL, an LLM-guided evolutionary approach that discovers interpretable Python algorithms for zero-shot inference on time series and event sequences without traditional neural network training. The evolved algorithms match or exceed deep learning performance while remaining transparent and significantly faster, demonstrating a novel paradigm for dynamical systems inference.
Researchers introduce Kalman Evolve, a framework that uses large language models to discover improved filtering algorithms for state estimation by optimizing both noise parameters and the update structure of classical Kalman filters. The approach addresses performance gaps in nonlinear sensing scenarios like Doppler radar and LiDAR, achieving up to 12% RMSE improvement over standard methods.
Researchers propose a teacher-aware evolutionary framework that leverages pre-trained learned optimization policies to guide the automatic design of heuristic programs for combinatorial optimization problems. The method uses behavioral feedback from teacher policies during evolution rather than relying solely on endpoint performance, achieving better results than baseline LLM-driven approaches without requiring neural inference at deployment.
Researchers have developed an automated method to discover optimal generation orders for sequential computation tasks, using loss profiling to evaluate candidate orders efficiently. The technique successfully raises success rates from ~10% to ~100% on order-sensitive tasks and rediscovers known efficient patterns like reverse-digit ordering for multiplication.
Researchers have developed a method to make transformer neural networks interpretable by studying how they perform in-context classification from few examples. By enforcing permutation equivariance constraints, they extracted an explicit algorithmic update rule that reveals how transformers dynamically adjust to new data, offering the first identifiable recursion of this kind.
