SearcharxivSearch

arXiv subjects

Euijin Hong

Publications and source records attributed to Euijin Hong.

2 recordsLinked to original sources

Activation-Keyed Momentum: An Anisotropic Momentum Update via the Delta Rule

Most modern optimizers form their momentum as an exponential moving average (EMA) of past gradients, forgetting every direction at one fixed rate. However, the inputs a deep network sees during training can be highly anisotropic, with a few directions queried frequently while most are seen rarely. Preconditioning methods address this anisotropy by wrapping extra processing around this buffer and leave the momentum update itself unchanged. We propose Activation-Keyed Momentum (AK-Momentum), which builds direction-awareness into the momentum update rule. The gradient of a linear layer splits into an input activation that acts as a key and an output-side error that acts as a value. Keying on that activation, AK-Momentum updates the momentum buffer by the canonical delta rule, so each direction is forgotten at a rate set by how often it appears. We prove that it is a valid momentum, that it applies the input-side curvature correction without matrix inversion, and that it clears stale directions faster than EMA under both a fixed and a drifting optimum. It is a drop-in replacement for the momentum buffer of any optimizer, its coefficient transfers across widths under $\mu$P, and its extra compute stays between $22.2\%$ and $25.0\%$ of a gated-MLP block's linear cost with no persistent memory. In FineWeb-Edu pretraining, AdamW with AK-Momentum (AK-AdamW) reaches AdamW's validation loss in up to $46.39 \pm 4.32\%$ fewer steps at 67M and $22.12 \pm 0.80\%$ at 370M over three seeds, and the gain persists at 1B on a Chinchilla-optimal budget. A Muon baseline tuned under the same protocol sits above AK-AdamW at both language-model scales, and the gain holds for SGD, ResNet-18, and ViT-Tiny on CIFAR-10. Training-time diagnostics confirm the predicted mechanism, better gradient tracking and healthier input directions.

cs.LG

Isometry-Dual Flags of AG Codes

Consider a complete flag $\{0\} = C_0 < C_1 < \cdots < C_n = \mathbb{F}^n$ of one-point AG codes of length $n$ over the finite field $\mathbb{F}$. The codes are defined by evaluating functions with poles at a given point $Q$ in points $P_1,\dots,P_n$ distinct from $Q$. A flag has the isometry-dual property if the given flag and the corresponding dual flag are the same up to isometry. For several curves, including the projective line, Hermitian curves, Suzuki curves, Ree curves, and the Klein curve over the field of eight elements, the maximal flag, obtained by evaluation in all rational points different from the point $Q$, is self-dual. More generally, we ask whether a flag obtained by evaluation in a proper subset of rational points is isometry-dual. In [3] it is shown, for a curve of genus $g$, that a flag of one-point AG codes defined with a subset of $n > 2g+2$ rational points is isometry-dual if and only if the last code $C_n$ in the flag is defined with functions of pole order at most $n+2g-1$. Using a different approach, we extend this characterization to all subsets of size $n \geq 2g+2$. Moreover we show that this is best possible by giving examples of isometry-dual flags with $n=2g+1$ such that $C_n$ is generated by functions of pole order at most $n+2g-2$. We also prove a necessary condition, formulated in terms of maximum sparse ideals of the Weierstrass semigroup of $Q$, under which a flag of punctured one-point AG codes inherits the isometry-dual property from the original unpunctured flag.

cs.IT