360 Secure SkillHub
360 安全技能中心

Oraclaw Cmaes

提供 optimize_cmaes 工具,通过外部服务执行 CMA-ES 连续优化:输入维度、初始均值、初始步长、最大迭代次数与目标权重,返回最优解、最优适应度、迭代与评估次数、是否收敛及耗时。适用超参数调优、参数校准与连续分配优化。

whatsonyourmind
whatsonyourmind
热度 42.29
最近更新 2026-05-11 17:37:23
分类:数据依赖:第三方 API应用场景:数据处理 / 自动化脚本 / 财务

安装技能

复制下面的话术发给你的 Agent,它会通过 secure-skills 检索并安装该技能。

执行命令安装此 skill: npx secure-skills-cli add oraclaw-cmaes
Metadata
name
oraclaw-cmaes
description
CMA-ES continuous optimization for AI agents. State-of-the-art derivative-free optimizer. 10-100x more sample-efficient than genetic algorithms on continuous problems. Hyperparameter tuning, portfolio optimization, parameter calibration.
version
1.0.0
metadata
{"openclaw":{"requires":{"env":["ORACLAW_API_KEY"]},"primaryEnv":"ORACLAW_API_KEY","emoji":"🔬","homepage":"https://oraclaw.dev/cmaes","tags":["cma-es","optimization","continuous","hyperparameter","derivative-free","black-box","evolution-strategy"],"price":0.1,"currency":"USDC"}}

OraClaw CMA-ES — SOTA Continuous Optimizer for Agents

You are an optimization agent that uses CMA-ES (Covariance Matrix Adaptation Evolution Strategy) — the gold standard for derivative-free continuous optimization. Used by Google for hyperparameter tuning.

When to Use This Skill

Use when the user or agent needs to:

  • Optimize continuous parameters (learning rates, weights, thresholds)
  • Tune hyperparameters for ML models
  • Calibrate model parameters to match observed data
  • Find optimal continuous allocations (portfolio weights, pricing)
  • Any black-box optimization where you can evaluate f(x) but don't have gradients

Why CMA-ES vs. Genetic Algorithm?

  • CMA-ES: 10-100x more sample-efficient on smooth continuous problems. Learns the correlation structure of the search space. SOTA for continuous optimization.
  • GA (oraclaw-evolve): Better for discrete/combinatorial problems, multi-objective Pareto frontiers.
  • Use CMA-ES for continuous. Use GA for discrete.

Tool: optimize_cmaes

{
  "dimension": 3,
  "initialMean": [0.5, 0.5, 0.5],
  "initialSigma": 0.3,
  "maxIterations": 200,
  "objectiveWeights": [2.0, 1.5, 1.0]
}

Returns: bestSolution, bestFitness, iterations, evaluations, converged, executionTimeMs.

Rules

  1. dimension = number of continuous parameters to optimize
  2. initialMean = starting point (center of search). If unknown, use 0.5 for normalized params.
  3. initialSigma = initial step size (0.1-0.5 typical). Too small = slow convergence, too large = unstable.
  4. CMA-ES MINIMIZES the objective. To maximize, negate the weights.
  5. Converges in O(dimension^2) iterations typically. Dimension 10 needs ~100-300 iterations.

Pricing

$0.10 per optimization. USDC on Base via x402. Free tier: 1,000 calls/month.