38 articles tagged with #algorithm-design. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers used large language models and evolutionary search to create the first domain-independent heuristics for symbolic AI planning that surpass hand-engineered baselines. These evolved heuristics, written in C++, solve more planning tasks than existing state-of-the-art approaches and maintain the soundness guarantees of traditional planners.
Researchers have developed Glia, an AI architecture using large language models in a multi-agent workflow to autonomously design computer systems mechanisms. The system generates interpretable designs for distributed GPU clusters that match human expert performance while providing novel insights into workload behavior.
Researchers introduce BehaveSim, a new method to measure algorithmic similarity by analyzing problem-solving behavior rather than code syntax. The approach enhances AI-driven algorithm design frameworks and enables systematic analysis of AI-generated algorithms through behavioral clustering.
A3C3 presents a joint optimization methodology that co-designs neural network architectures and hardware accelerators simultaneously, rather than sequentially. This approach addresses inefficiencies in traditional AI system design by automatically generating model-accelerator pairs that balance accuracy, latency, energy, and resource constraints.
Researchers developed a novel approach to help Large Language Models solve bit manipulation puzzles by reframing the problem as string matching and base selection rather than arithmetic logic. Their method achieved 96% validation accuracy on the NVIDIA Nemotron Challenge, placing 7th overall by using backtracking search, error recovery mechanisms, and specialized tokenization to enable LLMs to deduce hidden logical rules from binary string transformations.
Researchers introduce the Fanion family of optimization algorithms that extend beyond spectral norms used in the Muon optimizer, leveraging Ky Fan norm duals for matrix optimization in deep learning. Two variants, F-Muon and S-Muon, match or exceed Muon's performance across diverse tasks, with particular improvements on synthetic convex problems.
Researchers propose an optimal scheduling system for question-answering forums staffed by paid knowledge workers rather than volunteers. The study calculates system capacity, designs efficient schedulers, and explores how expert collaboration can improve request-handling throughput.
Researchers introduce Projected Consistency Inference (PCI), a neural optimization method that solves the Traveling Salesman Problem more efficiently than gradient-based approaches by using structure-aware projections and local search instead of computationally expensive refinement. PCI achieves better optimality gaps (0.17% for 500 cities, 0.31% for 1000 cities) while reducing inference time by 30-40% compared to state-of-the-art FT2T methods.
Researchers introduce Q-RACL, a quantum-enhanced machine learning framework that uses quantum computing to solve a critical constraint satisfaction problem: determining which repairs can restore feasibility to rejected candidates. The system demonstrates quantum advantage in accessing hidden discrete logarithm features that classical algorithms cannot efficiently process, achieving false-veto rates below 1.1% where classical approaches fail.
Researchers have developed AutoModSAT, a framework that leverages large language models to automatically discover and optimize heuristics in SAT solvers, achieving 40% performance improvements over baseline solvers. The approach combines modular solver design with LLM-guided function generation and evolutionary algorithms, demonstrating significant practical gains across diverse datasets.
Researchers introduce Front-to-Attractors (F2A), a new heuristic class that optimizes bidirectional search algorithms by replacing computationally expensive pairwise frontier evaluations with estimates to a small set of dynamically maintained attractor states. The approach achieves 11.2x reduction in pairwise evaluations while maintaining performance gains over simpler heuristics.
Researchers analyzed multi-agent systems (MAS) built on large language models through an entropy lens, discovering that single agents outperform collaborative systems in 43.3% of cases. The study identifies key entropy patterns—certainty preference, base entropy levels, and task awareness—and proposes an Entropy Judger algorithm to improve MAS solution selection across various reasoning tasks.
Researchers introduce Repeated Policy Regret (RP-Regret), a new game-theoretic metric for analyzing regret minimization in repeated games with adaptive opponents who can respond to historical play. The paper proposes three algorithms to minimize RP-Regret despite its non-convex nature and demonstrates that when all players use these algorithms, certain subgame perfect equilibria can be learned, with experiments showing improved cooperation in games like Stag-Hunt.
Researchers present a framework for exact unlearning in reinforcement learning that enables efficient removal of user data upon request, with computational costs only a ρ√ln T fraction of full retraining. The work establishes both an algorithm achieving near-optimal regret bounds for tabular MDPs and matching lower bounds, advancing the theoretical foundation for privacy-preserving machine learning systems.
Researchers prove that fixed-budget best-arm identification in bandit problems is no harder than fixed-confidence approaches up to logarithmic factors, introducing FC2FB—a meta-algorithm that converts fixed-confidence algorithms to fixed-budget ones while maintaining optimal sample complexity. This fundamental result establishes a previously unclear relationship between two core machine learning paradigms and enables improved algorithms across multiple problem classes.
Researchers introduce CoEvo-AHD, an LLM-driven framework that co-evolves paired operator populations to solve coupled combinatorial optimization problems like the Traveling Thief Problem. Unlike previous automated heuristic design methods that treat operators in isolation, this approach captures interactions between decision components, achieving competitive results with traditional heuristics.
Researchers have developed Iteris, an agentic AI system designed to tackle open problems in computational mathematics by combining language models with numerical experimentation and algorithm design. Applied to two unsolved problems from a Simons Workshop, Iteris generated verified results including a phase diagram for optimization algorithms and a counterexample about QR factorization, demonstrating that AI agents can contribute meaningfully to mathematical research when paired with human expertise.
Researchers propose a hybrid machine learning framework combining data-level and algorithm-level balancing techniques to address imbalanced regression problems, where underrepresented target values typically degrade model performance. The framework integrates adaptive partitioning, conditional variational autoencoders, strategic oversampling, and a novel weighted loss function to improve predictions on rare but important cases.
Researchers challenge the conventional autoregressive versus diffusion model dichotomy, arguing that distinguishing between inference procedures (sequence expansion versus state refinement) matters more than model families. The paper advocates designing inference algorithms before training objectives, highlighting that training methods cannot compensate for flawed inference architectures, with implications for improving generative AI efficiency.
Researchers present a unified mathematical framework for gradient aggregation in multi-objective optimization (MOO), establishing convergence guarantees to Pareto stationarity. The work reveals that non-conflicting gradient directions within the convex hull satisfy sufficient conditions for convergence, enabling broader algorithmic approaches including a new method called capped MGDA for federated learning applications.
Researchers introduce simplified and factored cellular Weisfeiler Leman tests alongside maximal clique complexes to enable scalable higher-order graph neural networks. The CliqueWalk algorithm samples maximal cliques efficiently without explicit enumeration, addressing the critical scalability bottleneck that has limited adoption of topological learning approaches in production systems.
Researchers propose a novel framework for understanding equilibrium computation in games by mapping the geometric structure of game spaces to solver effectiveness. Rather than studying algorithms in isolation, they develop a learned representation that identifies which solver mechanisms work best across different game regimes, revealing continuous regions of algorithmic validity and suggesting that solvability is governed by underlying structural properties.
Researchers present optimal algorithms for sparse contextual bandits that achieve sample complexity of Õ((s/ε² + |A|/ε)log|Π|/δ), closing a gap from prior work that had exponential dependence on action set size. The results apply to multiclass classification and combinatorial semi-bandits through information-theoretic and algorithmic approaches.
Researchers demonstrate how selection hyper-heuristics can automatically adjust learning periods to optimize pseudo-Boolean problem solving, eliminating manual parameter tuning. The Random Gradient hyper-heuristic achieves optimal neighbourhood size selection in nearly all iterations while maintaining theoretically optimal performance on the LeadingOnes benchmark.
This academic paper advances Bayesian multiobjective optimization by clarifying how preference transformations affect two key performance indicators—hypervolume and R2—used in algorithm design. The research provides exact computational methods and proves that R2 improvement, contrary to prior assumptions, cannot be directly computed as objective-space hypervolume but instead represents volume in scalarization space, enabling new algorithmic implementations.
