SearcharxivSearch

arXiv subjects

Isaac Zhu

Publications and source records attributed to Isaac Zhu.

3 recordsLinked to original sources

SparseRL-Sync: Lossless Weight Synchronization with ~100x Less Communication

In large-scale reinforcement learning (RL) systems with decoupled Trainer-Rollout execution, the Trainer must regularly synchronize policy weights to the Rollout side to limit policy staleness. When inter-node bandwidth is abundant, such synchronization is usually only a small fraction of end-to-end cost. As model size grows, however, the communication demand rises rapidly. In bandwidth-constrained or network-variable deployments -- for example, cross-datacenter or cross-cluster settings, heterogeneous resource pools, and online RL -- weight synchronization can become a dominant bottleneck for throughput and tail latency. We observe that, in mainstream large-model RL training, the locations where parameters actually change are highly sparse at the element level (often 99%+ sparsity). Building on this observation, we propose and implement SparseRL-Sync, which replaces full-weight transfers with a lossless sparse update payload (indices and values) that can be exactly reconstructed on the inference side, thereby preserving 100% fidelity. Under a simplified cost model, sparse synchronization reduces the per-update communication volume from S to approximately S/X; with 99% sparsity (X ~ 100), this yields about a 100x reduction in transmitted data. Combined with appropriate bucketing, SparseRL-Sync also reduces launch and control-plane overhead, significantly improving scalability and end-to-end efficiency in bandwidth-limited and highly asynchronous RL settings.

cs.LG

Knizhnik-Zamolodchikov equations in Deligne categories

We consider the Knizhnik-Zamolodchikov equations in Deligne Categories in the context of $(\mathfrak{gl}_m,\mathfrak{gl}_{n})$ and $(\mathfrak{so}_m,\mathfrak{so}_{2n})$ dualities. We derive integral formulas for the solutions in the first case and compute monodromy in both cases.

math.RT

Patterns in the Lattice Homology of Seifert Homology Spheres

In this paper, we study various homology cobordism invariants for Seifert fibered integral homology 3-spheres derived from Heegaard Floer homology. Our main tool is lattice homology, a combinatorial invariant defined by Ozsváth-Szabó and Némethi. We reprove the fact that the $d$-invariants of Seifert homology spheres $Σ(a_1,a_2,\dots,a_n)$ and $Σ(a_1,a_2,\dots,a_n+a_1a_2\cdots a_{n-1})$ are the same using an explicit understanding of the behavior of the numerical semigroup minimally generated by $a_1a_2\cdots a_n/a_i$ for $i\in[1,n]$. We also study the maximal monotone subroots of the lattice homologies, another homology cobordism invariant introduced by Dai and Manolescu. We show that the maximal monotone subroots of the lattice homologies of Seifert homology spheres $Σ(a_1,a_2,\dots,a_n)$ and $Σ(a_1,a_2,\dots,a_n+2a_1a_2\cdots a_{n-1})$ are the same.

math.GT