Pith. sign in

REVIEW 9 cited by

Large Language Model Agent for Hyper-Parameter Optimization

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 2402.01881 v3 pith:XVV3FVJD submitted 2024-02-02 cs.LG cs.AI

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

Hyperparameter optimization is critical in modern machine learning, requiring expert knowledge, numerous trials, and high computational and human resources. Despite the advancements in Automated Machine Learning (AutoML), challenges in terms of trial efficiency, setup complexity, and interoperability still persist. To address these issues, we introduce a novel paradigm leveraging Large Language Models (LLMs) to automate hyperparameter optimization across diverse machine learning tasks, which is named AgentHPO (short for LLM Agent-based Hyperparameter Optimization). Specifically, AgentHPO processes the task information autonomously, conducts experiments with specific hyperparameters (HPs), and iteratively optimizes them based on historical trials. This human-like optimization process largely reduces the number of required trials, simplifies the setup process, and enhances interpretability and user trust, compared to traditional AutoML methods. Extensive empirical experiments conducted on 12 representative machine-learning tasks indicate that AgentHPO not only matches but also often surpasses the best human trials in terms of performance while simultaneously providing explainable results. Further analysis sheds light on the strategies employed by the LLM in optimizing these tasks, highlighting its effectiveness and adaptability in various scenarios.

Discussion (0). Sign in to comment.

Forward citations

Cited by 9 Pith papers

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

  1. Agentic Bayesian Optimization through Surrogate-Augmented Autoresearch

    cs.LG 2026-07 conditional novelty 6.0 of 10

    An LLM agent that fully controls a reconfigurable Bayesian-optimization backend preserves standard BO reliability, outperforms LLM-only optimizers, and exploits natural-language priors and mid-run problem reformulation.

  2. Interactive Training 2: Auditable Control Plane for Live Model Training

    cs.LG 2026-07 conditional novelty 6.0 of 10

    A reusable control plane lets controllers steer live ML runs through typed settings and actions, with an auditable journal of every request and result.

  3. Reinforcement Learning for Machine Learning Engineering Agents

    cs.LG 2025-09 conditional novelty 6.0 of 10

    RL-trained Qwen2.5-3B outperforms prompted Claude-3.5-Sonnet and GPT-4o on 12 MLEBench tasks by an average of 22% and 24%, using two targeted RL modifications.

  4. Matryoshka Agent: Unfolding Sub-Agents for Long-Horizon Machine Learning Engineering

    cs.AI 2026-07 conditional novelty 5.0 of 10

    Matryoshka Agent’s orchestrator–sub-agent hierarchy plus tree-ranked RL raises MLE-Dojo HumanRank, letting a 4B orchestrator approach o4-mini and giving a 30B coder up to 36.7% relative gain.

  5. A Language-Guided Bayesian Optimization for Efficient LoRA Hyperparameter Search

    cs.CL 2026-01 conditional novelty 5.0 of 10

    LLM embeddings plus Bayesian optimization find better LoRA hyperparameters in ~30 proxy trials than standard published settings.

  6. DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression

    cs.CL 2025-09 reject novelty 5.0 of 10

    DaMoC combines data filtering, token compression, and layer pruning to select the best LLM for domain fine-tuning, claiming ~20x faster training while preserving model rankings.

  7. 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.

  8. OptiMindTune: A Multi-Agent Framework for Intelligent Hyperparameter Optimization

    cs.LG 2025-05 reject novelty 4.0 of 10

    OptiMindTune assigns recommendation, evaluation, and decision roles to three Gemini-powered agents for hyperparameter search, but its reported 3-dataset advantage over Optuna lacks code, error bars, and a fair baselin...

  9. Systematic Optimization of Open Source Large Language Models for Mathematical Reasoning

    cs.LG 2025-09 reject novelty 3.0 of 10

    A hyperparameter search for LLM math reasoning that reports simulated, not measured, performance gains.

Pith tools