Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers
We study adaptive learning rate scheduling for norm-constrained optimizers (e.g., Muon and Lion). We introduce a generalized smoothness assumption under which local curvature decreases with the suboptimality gap and empirically verify that this behavior holds along optimization trajectories. Under this assumption, we establish convergence guarantees under an appropriate choice of learning rate, for which warm-up followed by decay arises naturally from the proof rather than being imposed heuristically. Building on this theory, we develop a practical learning rate scheduler that relies only on standard hyperparameters and adapts the warm-up duration automatically at the beginning of training. We evaluate this method on large language model pretraining with LLaMA architectures and show that our adaptive warm-up selection consistently outperforms or at least matches the best manually tuned warm-up schedules across all considered setups, without additional hyperparameter search. Our source code is available at https://github.com/brain-lab-research/llm-baselines/tree/warmup
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Navigating Robot Swarms Using Collective Intelligence Learned from Golden Shiner Fish
Navigating networked robot swarms often requires knowing where to go, sensing the environment, and path-planning based on the destination and barriers in the environment. Such a process is computationally intensive. More…
Decision MakingNavigateLarge region targets observation scheduling by multiple satellites using resampling particle swarm optimization
The last decades have witnessed a rapid increase of Earth observation satellites (EOSs), leading to the increasing complexity of EOSs scheduling. On account of the widespread applications of large region observation, thi…
Earth ObservationSchedulingSwarmX: Agentic Scheduling for Low-Latency Agentic Systems
Agentic AI applications compose multiple model calls and tool executions, creating new scheduling challenges for GPU-CPU clusters. Their inference time and model-call structure often depend on prompt semantics, making co…
Code GenerationParticle Swarm Optimization with Velocity Restriction and Evolutionary Parameters Selection for Scheduling Problem
The article presents a study of the Particle Swarm optimization method for scheduling problem. To improve the method's performance a restriction of particles' velocity and an evolutionary meta-optimization were realized.…
Job Shop SchedulingSchedulingParticle Swarm Optimization: Fundamental Study and its Application to Optimization and to Jetty Scheduling Problems
The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature. While particle swarm optimizers share such advantages, they outperform evolutionary algorithms …
Combinatorial OptimizationEvolutionary AlgorithmsScheduling