SearcharxivSearch

arXiv subjects

Honglin Zhu

Publications and source records attributed to Honglin Zhu.

11 recordsLinked to original sources

Beyond Uniform Token-Level Trust Region in LLM Reinforcement Learning

Reinforcement learning with verifiable rewards (RLVR) has become standard for improving LLM reasoning. However, existing PPO-style trust-region mechanisms remain position-agnostic by enforcing uniform thresholds across all tokens independently. This pointwise treatment conflicts with autoregressive generation in two critical ways. First, uniform thresholds ignore autoregressive asymmetry. Early-stage deviations produce compounding sequence-level drift, causing static thresholds to under-regulate early divergence and excessively constrain late-stage exploration. Second, evaluating token-level divergence in isolation overlooks cumulative prefix drift, granting the same divergence allowance regardless of how far the conditioning history has already deviated from the rollout policy. To address this limitation, we propose CPPO (Cumulative Prefix-divergence Policy Optimization), a token-level masking rule that aligns updates with a finite-horizon policy-improvement bound via two coupled mechanisms. First, a position-weighted threshold imposes stricter limits at early positions whose effects persist longer, relaxing constraints for late-stage tokens. Second, a cumulative prefix budget tracks historical deviations, dynamically restricting further token-level deviation to prevent compounding errors along the prefix. Empirically, CPPO enhances training stability and significantly improves reasoning accuracy across various model scales.

cs.LG

FalconGEMM: Surpassing Hardware Peaks with Lower-Complexity Matrix Multiplication

Peak breaking Matrix Multiplication is a promising technique to improve the performance of DL, especially in LLM training and inference. We present FalconGEMM, a cross-platform framework that automates the deployment, optimization, and selection of Lower-Complexity Matrix Multiplication Algorithms (LCMAs) across diverse hardware. There are three key innovations: (1) a Deployment Module that enables portable execution across various hardware and input configurations through code generation; (2) an Execution Module with Group-Parallel Optimizations that maximizes on-chip data reuse, utilizes parallel resources, and reduces bandwidth overhead; and (3) a Decision Module featuring a lightweight analytical performance model to select the optimal strategy based on matrix shapes and hardware profiles. Extensive evaluation is conducted on LLM workloads across GPU (H20, A100) and CPU (ARM, x86) architectures with multiple data types. FalconGEMM succeeds in delivering peak breaking performance and outperforms GEMM libraries (e.g., cuBLAS, CUTLASS, Intel MKL, etc) by 7.59%-17.85% and LCMA competitors like AlphaTensor by 12.41%-55.61%. Our framework makes the theoretical promise of LCMAs practical for production deployment across the heterogeneous landscape of modern hardware.

cs.DC

Vortex: Efficient Sample-Free Dynamic Tensor Program Optimization via Hardware-aware Strategy Space Hierarchization

Dynamic-shape deep neural networks (DNNs) are rapidly evolving, attracting attention for their ability to handle variable input sizes in real-time applications. However, existing compilation optimization methods for such networks often rely heavily on predefined samples to guide the compilation process, which restricts their adaptability and efficiency. These sample-driven methods struggle to efficiently manage the diverse and unpredictable shapes encountered in real-world scenarios, often resulting in suboptimal performance. To tackle these issues, we introduce Vortex, a hardware-driven and sample-free compiler tailored for dynamic-shape tensor programs. Vortex capitalizes on detailed hardware information and hierarchizes the strategy space to facilitate high-performance code generation without relying on runtime shape samples. It features a unique bidirectional compilation workflow, combining top-down abstraction for aligning tensor program execution with hardware hierarchies and bottom-up kernel construction to narrow the search space, enabling Vortex to achieve remarkable efficiency. Comprehensive evaluations confirm that Vortex reduces compilation time by $176\times$ compared to the existing dynamic-shape compiler. Additionally, it substantially outperforms existing vendor-provided libraries and dynamic-shape compilers on both CPU and GPU platforms, delivering speedups of $2.53\times$ and $3.01\times$, respectively.

cs.DC

Sphere packing proper colorings of an expander graph

We introduce graphical error-correcting codes, a new notion of error-correcting codes on $[q]^n$, where a code is a set of proper $q$-colorings of some fixed $n$-vertex graph $G$. We then say that a set of $M$ proper $q$-colorings of $G$ form a $(G, M, d)$ code if any pair of colorings in the set have Hamming distance at least $d$. This directly generalizes typical $(n, M, d)$ codes of $q$-ary strings of length $n$ since we can take $G$ as the empty graph on $n$ vertices. We investigate how one-sided spectral expansion relates to the largest possible set of error-correcting colorings on a graph. For fixed $(\delta, \lambda) \in [0, 1] \times [-1, 1]$ and positive integer $d$, let $f_{\delta, \lambda, d}(n)$ denote the maximum $M$ such that there exists some $d$-regular graph $G$ on at most $n$ vertices with normalized second eigenvalue at most $\lambda$ that has a $(G, M, d)$ code. We study the growth of $f$ as $n$ goes to infinity. We partially characterize the regimes of $(\delta, \lambda)$ where $f$ grows exponentially or is bounded by a constant, respectively. We also prove several sharp phase transitions between these regimes.

math.CO

The maximum number of cycles in a triangular-grid billiards system with a given perimeter

Given a (simple) grid polygon $P$ in a grid of equilateral triangles, Defant and Jiradilok considered a billiards system where beams of light bounce around inside of $P$. We study the relationship between the perimeter $\operatorname{perim}(P)$ of $P$ and the number of different trajectories $\operatorname{cyc}(P)$ that the billiards system has. Resolving a conjecture of Defant and Jiradilok, we prove the sharp inequality $\operatorname{cyc}(P) \leq (\operatorname{perim}(P) + 2)/4$ and characterize the equality cases.

math.CO

The connectivity of friends-and-strangers graphs on complete multipartite graphs

For simple graphs $X$ and $Y$ on $n$ vertices, the friends-and-strangers graph $\mathsf{FS}(X,Y)$ is the graph whose vertex set consists of all bijections $\sigma: V(X) \to V(Y)$, where two bijections $\sigma$ and $\sigma'$ are adjacent if and only if they agree on all but two adjacent vertices $a, b \in V(X)$ such that $\sigma(a), \sigma(b) \in V(Y)$ are adjacent in $Y$. Resolving a conjecture of Wang, Lu, and Chen, we completely characterize the connectedness of $\mathsf{FS}(X, Y)$ when $Y$ is a complete bipartite graph. We further extend this result to when $Y$ is a complete multipartite graph. We also determine when $\mathsf{FS}(X, Y)$ has exactly two connected components where $X$ is bipartite and $Y$ is a complete bipartite graph.

math.CO

Maximum Overlap Area of Several Convex Polygons Under Translations

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of the $k$ polygons is maximized. Given one such placement, we also give an $O(n)$ time algorithm which computes the set of all translations of the polygons which achieve this maximum.

cs.CG

Classifying Isometries

An isometry is a geometric transformation that preserves distances between pairs of points. We present methods to classify isometries in the Euclidean plane, and extend these methods to spherical, single elliptical, and hyperbolic geometry. We then classify all isometries of the plane equipped with the $\ell_p$ metric for any $p \geq 1$ and $p = \infty$.

math.MG

Maximum overlap area of a convex polyhedron and a convex polygon under translation

Let $P$ be a convex polyhedron and $Q$ be a convex polygon with $n$ vertices in total in three-dimensional space. We present a deterministic algorithm that finds a translation vector $v \in \mathbb{R}^3$ maximizing the overlap area $|P \cap (Q + v)|$ in $O(n \log^2 n)$ time. We then apply our algorithm to solve two related problems. We give an $O(n \log^3 n)$ time algorithm that finds the maximum overlap area of three convex polygons with $n$ vertices in total. We also give an $O(n \log^2 n)$ time algorithm that minimizes the symmetric difference of two convex polygons under scaling and translation.

cs.CG

The Hermitian axiom on two-dimensional topological quantum field theories

In this paper, we examine Atiyah's Hermitian axiom for two-dimensional complex topological quantum field theories. Building on the correspondence between 2D TQFTs and Frobenius algebras, we find the algebraic objects corresponding to Hermitian and unitary TQFTs respectively and prove structure theorems about them. We then clarify a few older results on unitary TQFTs using our structure theorems.

math.AT