atlas

Research map / Optimization / Optimizers

How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics

AAAI 2020 · Optimization › Optimizers · approach: Memory-efficient LLM optimizers · 16 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
increase GRG learning period from 1 to 2500 (short but growing with n) (ablation)GRG · OneMax n=10^6avg runtime / (n ln n): 1.820 -> 1.589Helped
set GRG learning period tau >= n instead of sublinear (ablation)GRG with RLS1,RLS3 · OneMaxexpected runtimeHurt
set GRG learning period tau >= (1+eps) n ln n instead of o(n) (ablation)GRG with RLS1,RLSk · RIDGEexpected runtime: (1 +- o(1)) 2n^2 -> (1+o(1)) n^2Helped
use adaptive learning period (ARG) instead of static tauGRG · OneMaxavg runtime / (n ln n): remains below 1.86Helped
use F=1.5 instead of F=1+1/sqrt(ln n) in ARG (ablation)ARG · OneMaxruntimeHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy