Searcharxiv⌕ Search

arXiv subjects

Jinglin Wang

Publications and source records attributed to Jinglin Wang.

6 recordsLinked to original sources
arXiv2026

AsmEvo: Agentic Assembly-Level Optimization of AMD GPU Kernels with Functional Equivalence Verification

High-performance ML systems increasingly rely on GPU kernels whose editable source is unavailable, generated, or too distant from final machine code to expose remaining optimizations. Existing LLM kernel optimizers and autotuners mainly operate on CUDA, Triton, HIP, or tensor-program source and validate against reference implementations. We study a stricter setting: optimizing an already compiled AMDGPU code object, where the deployed binary is the only behavioral oracle. We present AsmEvo, an agentic assembly-level optimizer for AMD GPU kernels. Given an AMDGPU code object K0, AsmEvo reconstructs a reassemblable representation, proposes low-level edits with a long-horizon agent, rebuilds an ABI-preserving optimized object, and accepts candidates only after differential verification against K0 under identical launches. AsmEvo combines code-object recovery, metadata-aware rebuilding, profiling-guided hot-window editing, correctness-gated timing, and conservative in-place patch fallback. We conduct extensive experiments with AsmEvo on various AMD GPU kernels. On MI308X, AsmEvo improves 29 of 30 selected KernelBench kernels, reaching 1.35x geometric-mean and 3.88x maximum speedup. On MI300X production workloads, it improves all evaluated AITer binaries and vLLM/SGLang Triton assembly kernels, reaching 1.09x/1.31x and 1.18x/1.34x geometric-mean/maximum speedups, respectively, while preserving functional equivalence.

cs.CL↗
arXiv2026

PaDoc: Layout-Grounded Parallel Decoding for Document Parsing

End-to-end document parsers provide a unified interface, but serialize page layouts and regional contents into one autoregressive sequence. This formulation forces independent regions onto a decoding path whose length grows with the total content, whereas crop-based two-stage parsers expose region-level parallelism at the cost of repeated visual prefills and fragmented page context. To retain full-page context while removing dependencies, we propose PaDoc, a layout-grounded parser that treats the predicted layout as a branching structure over a shared page representation. Under a region-sufficiency assumption, we derive a prefix-conditioned factorization in which the layout stream and regional content branches advance concurrently, reducing the decoding depth to the longest layout-content path. We realize this factorization within a single MLLM: packed variable-length ancestor attention preserves the visibility under standard next-token training, while masked parallel decoding creates branches that the evaluated vLLM backend serves as concurrent requests with cache-resident shared-prefix reuse. On OmniDocBench Full, PaDoc attains an Overall layout F1 of 91.1 and, among end-to-end parsers, a top-tier Overall score of 94.24 together with the best Text Edit (0.038) and Formula CDM (95.59). On a 384-page subset and one A800 GPU, it is the fastest end-to-end parser at five concurrency levels, improving valid-page throughput by 67.4-118% and reducing P95 latency by 39.2-54.9% relative to a same-backbone Sequential SFT baseline. Code is available at https://github.com/Longin-Yu/Padoc

cs.AI↗
arXiv2025

Fine-Graining and Continuous Space Scaling Limit of the $H^{2|2}$ Model on the Hierarchical Lattice

We extend the exact coarse-graining result of Disertori, Merkl and Rolles~\cite{MR4517733} for the random field of $H^{2|2}$-model to the random Schr\"odinger operator representation of the $H^{2|2}$-model. We also introduce a fine-graining procedure as the reverse operation, and establish an associated exponential martingale property. Applying this fine-graining procedure to the $H^{2|2}$-model on the Dyson hierarchical lattice, we establish its continuous space scaling limit as a non-trivial random measure on $[0,1]$. This random measure is almost surely singular with respect to the Lebesgue measure if and only if the Vertex Reinforced Jump Process on the Dyson hierarchical lattice is recurrent. If the process is transient, the random measure almost surely has an absolutely continuous component. The density of this component is everywhere non-trivial and can be identified with the pointwise limit of an exponential martingale associated with the $H^{2|2}$-model on the Dyson hierarchical lattice.

math.PR↗
arXiv2025

OmniAlpha: Aligning Transparency-Aware Generation via Multi-Task Unified Reinforcement Learning

Transparency-aware generation requires modeling not only RGB appearance but also alpha-based opacity and cross-layer composition, which are essential for tasks such as image matting, object removal, layer decomposition, and multi-layer content creation. However, existing RGBA-related methods remain largely fragmented, with separate pipelines designed for individual tasks. While a unified model is desirable, supervised fine-tuning alone is insufficient, as localized regression objectives cannot directly optimize the compositional fidelity, alpha-boundary precision, and structural consistency required for high-quality RGBA generation. To address this, we propose OmniAlpha, a unified multi-task reinforcement learning framework for transparency-aware generation and manipulation. OmniAlpha combines an end-to-end alpha-aware VAE and a sequence-to-sequence Diffusion Transformer, with a bi-directional layer axis in positional encoding to jointly model multiple RGBA inputs and outputs within a single forward pass. Built on a multi-task SFT cold start, it further performs GRPO-style post-training with layer-aware rewards defined on decoded RGBA outputs, enabling direct optimization of cross-layer coherence and fine transparency details. Experiments across five categories of transparency-aware tasks show that OmniAlpha consistently outperforms its unified SFT baseline and achieves strong performance against specialized expert models, including a 9.07% relative reduction in RGB L1 on layer decomposition and 74%/68% improvements over conventional matting tools on SAD/Grad for automatic matting.

cs.CV↗
arXiv2025

VRJP recurrence and fractional-moment decay for the \(H^{2|2}\) model's effective field on the hierarchical lattice

We prove recurrence of the vertex-reinforced jump process on the hierarchical lattice for spectral dimension \(d<2\) for every value of the conductance parameter \(\overline{W}\), and at the critical spectral dimension \(d=2\) for sufficiently strong reinforcement, i.e., sufficiently small \(\overline{W}\). The key estimate is a fractional-moment bound for the Green's function of the associated random Schr\"odinger operator, expressed as geometric decay across hierarchical scales for the effective \(H^{2|2}\) field. The proof combines the fractional-moment method with an exact hierarchical coarse-graining identity, which turns the path expansion into a recursion over block scales and controls the combinatorial growth created by long-range edges. Together with existing long-range-order results in the regime \(d>2\), these estimates identify the recurrent side of the hierarchical VRJP phase diagram, leaving only the weak-reinforcement critical regime open.

math.PR↗
arXiv2022

A Multibias-mitigated and Sentiment Knowledge Enriched Transformer for Debiasing in Multimodal Conversational Emotion Recognition

Multimodal emotion recognition in conversations (mERC) is an active research topic in natural language processing (NLP), which aims to predict human's emotional states in communications of multiple modalities, e,g., natural language and facial gestures. Innumerable implicit prejudices and preconceptions fill human language and conversations, leading to the question of whether the current data-driven mERC approaches produce a biased error. For example, such approaches may offer higher emotional scores on the utterances by females than males. In addition, the existing debias models mainly focus on gender or race, where multibias mitigation is still an unexplored task in mERC. In this work, we take the first step to solve these issues by proposing a series of approaches to mitigate five typical kinds of bias in textual utterances (i.e., gender, age, race, religion and LGBTQ+) and visual representations (i.e, gender and age), followed by a Multibias-Mitigated and sentiment Knowledge Enriched bi-modal Transformer (MMKET). Comprehensive experimental results show the effectiveness of the proposed model and prove that the debias operation has a great impact on the classification performance for mERC. We hope our study will benefit the development of bias mitigation in mERC and related emotion studies.

cs.CL↗