Pith. sign in

REVIEW 6 cited by

Large Language Model-Based Evolutionary Optimizer: Reasoning with elitism

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.02054 v1 pith:YXZG3BUL submitted 2024-03-04 cs.AI

classification cs.AI
keywords llmsoptimizationmethodevolutionarylanguagelargenumericaloptimizer
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large Language Models (LLMs) have demonstrated remarkable reasoning abilities, prompting interest in their application as black-box optimizers. This paper asserts that LLMs possess the capability for zero-shot optimization across diverse scenarios, including multi-objective and high-dimensional problems. We introduce a novel population-based method for numerical optimization using LLMs called Language-Model-Based Evolutionary Optimizer (LEO). Our hypothesis is supported through numerical examples, spanning benchmark and industrial engineering problems such as supersonic nozzle shape optimization, heat transfer, and windfarm layout optimization. We compare our method to several gradient-based and gradient-free optimization approaches. While LLMs yield comparable results to state-of-the-art methods, their imaginative nature and propensity to hallucinate demand careful handling. We provide practical guidelines for obtaining reliable answers from LLMs and discuss method limitations and potential research directions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Overcoming the Weakest-Link Effect in LLM-Driven Program Optimization via Heterogeneous Edit Recombination

    cs.LG 2026-07 conditional novelty 6.0 of 10

    HERO optimizes programs by generating atomic edits without score feedback and selecting the highest-scoring subset of those edits, avoiding the 'weakest-link' failure of accepting or rejecting whole edit bundles.

  2. Evolving Deeper LLM Thinking

    cs.AI 2025-01 conditional novelty 6.0 of 10

    Mind Evolution, an LLM-driven evolutionary search guided by a programmatic scorer, solves over 98% of TravelPlanner and Natural Plan instances with Gemini 1.5 Pro, outperforming Best-of-N and sequential revision at co...

  3. QUBE: Enhancing Automatic Heuristic Design via Quality-Uncertainty Balanced Evolution

    cs.NE 2024-12 conditional novelty 6.0 of 10

    QUBE adds a UCB-style uncertainty term to FunSearch's parent selection and finds better heuristics on bin packing and TSP, with cap set gains only over a same-hardware reproduction.

  4. REMoH: A Reflective Evolution of Multi-objective Heuristics approach via Large Language Models

    cs.AI 2025-06 reject novelty 5.0 of 10

    REMoH evolves LLM-written heuristics with NSGA-II and a reflection mechanism, reporting competitive FJSSP results that are weakened by test-set selection.

  5. Using Large Language Models for Parametric Shape Optimization

    cs.CE 2024-12 conditional novelty 5.0 of 10

    An LLM-driven evolutionary search, LLM-PSO, finds near-optimal airfoil and Stokes-flow body shapes on two benchmarks, generally converging faster than classical optimizers.

  6. An Overview and Discussion on Using Large Language Models for Implementation Generation of Solutions to Open-Ended Problems

    cs.CL 2024-12 unverdicted novelty 3.0 of 10

    A survey and position paper that reviews LLM prompting, RAG, and RL techniques and argues they could support open-ended implementation generation, without presenting new results.

Pith tools