Searcharxiv⌕ Search

arXiv subjects

Yang

Publications and source records attributed to Yang.

At least 19 recordsLinked to original sources

PALIN: Pixel-Aligned LiDAR-NIR Multimodal 3D Object Detection with Benchmark

3D object detection is critical for intelligent transportation systems. LiDAR has been widely adopted for accurate geometric measurements; however, purely geometric representations remain ambiguous under sparse observations and occlusions, while cross-sensor multimodal fusion suffers from calibration and synchronization errors. To overcome these challenges, we leverage an Ouster LiDAR to construct PALIN (Pixel-Aligned LiDAR-NIR), a large-scale intrinsically pixel-aligned multimodal dataset jointly capturing geometry and NIR intensity, comprising approximately 8,000 annotated frames from static urban intersections and diverse mobile suburban scenes. Building upon this dataset, we propose CMambaFusion, a novel fusion framework consisting of a four-directional Cross-Mamba module for bidirectional cross-modal interaction and a Gated Concat-Mamba module for joint feature refinement. Extensive experiments demonstrate that PALIN enables effective multimodal learning, and CMambaFusion achieves superior accuracy-efficiency trade-offs over both LiDAR-only and representative fusion baselines.

cs.CV↗

Democratizing MoE inference on commodity GPUs with CoMoE

Deploying Mixture-of-Experts (MoE) models relies heavily on Expert Parallelism, which generates intense inter-GPU communication. Consequently, state-of-the-art inference systems require high-bandwidth, P2P interconnects (e.g., NVLink) in datacenter GPUs to handle massive token routing, making deployment prohibitively expensive. Consumer GPUs offer comparable compute power at significantly lower cost, promising to democratize MoE inference for individuals and enable privacy-preserving local deployments. However, their bandwidth-limited (only weak PCIe bus bandwidth) and host-mediated interconnects (no P2P support) introduce severe communication bottlenecks. We present CoMoE, a communication-efficient MoE inference system that resolves this mismatch through novel host-centric routing. Our key insight is that the unique communication topology provides the opportunity to elevate the host to an active routing hub, which can fundamentally reduce communication volume and eliminate global synchronization-induced stalls. Specifically, for token dispatch, we introduce host-backed token multicast to write shared tokens to the host exactly once, eliminating outbound transmission redundancy. For token combine, we propose a fine-grained, token-level aggregation mechanism using host staging buffers, which replaces rigid global synchronization and mitigates straggler effects. Evaluation on RTX 5090 GPUs shows that CoMoE improves inference throughput by up to 1.46x, approaching the performance of NVLink-capable A800 GPUs at only 23.4% of the hardware cost.

cs.DC↗

Towards Easier-to-Tune Training Algorithms: New Results from AlgoPerf

Evaluating deep learning optimizer is challenging because confounding factors such as hyperparameter tuning and optimizer-model co-design often obscure true algorithmic performance. We present results of the updated AlgoPerf V1 benchmark, in which we evaluate a new set of training algorithms on wall-clock time-to-target across nine workloads on fixed hardware. This report focuses on the results of the benchmark's self-tuning ruleset, which requires submissions to use a single configuration across all workloads. Out of the 13 submissions in PyTorch and JAX, Schedule-Free AdamW ranked first. In addition to the wall-clock scores, we also analyze the trade-offs between step efficiency and wall-clock execution, revealing that matrix-preconditioned and two-loop methods achieve good sample efficiency but require more aggressive computational optimizations to be competitive in runtime. Finally, our hyperparameter saliency and retention analyses show that the learning rate and momentum are highly sensitive across domains and algorithms, highlighting the need for methods that are more robust against hyperparameter tuning and can generalize well to new tasks.

cs.LG↗

Comparison principles for stochastic reaction-diffusion equations on metric measure spaces

We study parabolic stochastic partial differential equations on metric measure spaces $(\mathbb{X}, d,m)$ of the form $$ \partial_t u(t,x) = \mathcal{L}^* u(t,x) + b(t,x,u(t,x)) + σ(t,x,u(t,x)) \dot{W}(t,x),\quad t>0,\, x \in \mathbb X, $$ where $\mathcal{L}$ is the generator of a Markov process which possesses transition densities, and $\dot{W}$ is a Gaussian noise that is white in time and possibly with spatial correlation. We assume the coefficients $b$ and $σ$ are Lipschitz and satisfy the linear growth condition. We formulate general and checkable assumptions on $(\mathbb{X},\mathcal{L},\dot{W})$ that ensure existence and uniqueness of probabilistically strong, continuous, tempered mild solutions. We then prove comparison principles (including a strong comparison principle) and strict positivity, relative to initial conditions. Our framework allows non-symmetric heat kernels and includes diffusion-type and stable-type examples, such as metric graphs and fractal spaces with sub-Gaussian heat kernel estimates.

math.PR↗

The first type of power mean bounds for the Gaussian hypergeometric function

In this paper, by using a signs rule for a class of special power series and a recurrence relation of coefficients involving hypergeometric series, we find the necessary and sufficient conditions for the sharp (at the left endpoint) inequalities between the hypergeometric function and power mean (Hm-Pm inequality) to hold in all possible cases, which greatly extends those known results and solve the rest of problem on the sharp (at the left endpoint) power mean bounds for the hypergeometric mean.

math.GM↗

From Individual-Based Models to General Stochastic Reaction Diffusion Equations

In this article, we construct, for a broad class of one-dimensional stochastic reaction-diffusion equations, a sequence of spatially-structured individual-based models whose rescaled empirical processes converge to the solution of the equation. The purpose of this article is to show that, whenever the rescaled one-step mean and variance of a reasonable individual-based model converge to those of an SDE with drift $b(x)x(1-x)+θ^+(1-x)-θ^-x$ and noise coefficient $\sqrt{σ(x)x(1-x)}$, under certain moment conditions there also exists a corresponding multi-island model, composed of independent and identically distributed copies of the individual-based model on each island, with selection and mutation scaled to the diffusive time scale, coupled through migration, which converges to an SPDE with a Laplacian plus the same drift and noise coefficients, provided this SPDE is unique in law.

math.PR↗

SAGE: SLO-Aware Adaptive Retrieval for Production RAG Systems

Retrieval-Augmented Generation (RAG) systems in production operate under strict service level objectives (SLOs) on tail latency and infrastructure cost. However, standard retrieval pipelines rely on fixed retrieval budgets that ignore query difficulty, over-retrieving for easy queries and under-serving hard ones, forcing operators to trade answer quality against SLO compliance. This paper proposes SAGE, a learned SLO-aware adaptive retrieval policy that dynamically selects the number of passages k per query. SAGE uses lightweight features derived from initial retrieval (e.g., score distributions, rank gaps, lexical signals) and is trained offline via imitation learning from an oracle that approximates optimal latency-quality trade-offs. At inference, it adds no LLM calls and minimal overhead. On Natural Questions, under a 5s P95 latency SLO, SAGE achieves 95% SLO compliance versus 30% for the best static baseline (k=20), reduces P95 latency by 36% and retrieval cost by 51% with only 2 percentage points Exact Match (EM) loss. A single policy trained on Natural Questions generalizes across HotpotQA, UnSeenTimeQA, and four LLM families (Llama, Qwen, Mistral, Gemma), consistently yielding +45-52 point SLO improvements without quality degradation.

cs.LG↗

Unleashing the Potential of Large Language Models: A Blueprint for Real-Time, Enterprise-Ready Deployments

Large language models deployed in real-time, regulated settings face knowledge staleness, catastrophic forgetting, hallucination, and weak feedback loops. We present a unified, pattern-driven LLMOps architecture integrating real-time data ingestion, continual learning, retrieval-augmented generation (RAG), and human-in-the-loop feedback into a single operational pipeline. Four contributions map to established software design patterns: an adaptive ingestion pattern orchestrator (AIPO) evaluated with FreshStreamBench; STAR+FAR continual learning with sparse temporal adapter routing and freshness-aware replay; SAGE, an SLO-aware adaptive retrieval policy predicting a per-query passage budget to meet tail-latency targets; and an automated feedback-driven convergence stage with RLHF triggers. The result reduces latency-cost-accuracy trade-offs while supporting auditability and rollback for high-risk sectors such as health care and finance.

cs.LG↗

ArcLP: A Matlab implementation of an $\mathcal{O}(\sqrt{n}L)$ arc-search infeasible interior-point algorithm for linear programming

This paper presents a Matlab implementation of an arc-search infeasible interior point algorithm for linear programming (LP), which has a proven polynomial bound of $\mathcal{O}(\sqrt{n}L)$, the best among all interior-point algorithms for LP. Software architecture and major functions are discussed. Its ease of use is described by a simple example. Crucial strategies are summarized. Quality of the software is assured because this software has been extensively tested on both PC and Linux for the widely used Netlib benchmark linear programming problems in standard form. Some benchmark test problems involve tens of thousands of constraints and hundreds of thousands of variables. For all tested problems, the code found the optimal solution. The numerical results have been compared to those obtained by the popular Mehrotra's predictor-corrector algorithm. We conclude that the implemented algorithm not only has the best polynomial bound but also is computationally competitive compared to the popular Mehrotra's predictor-corrector algorithm.

math.OC↗

Who Gets the Reward & Who Gets the Blame? Evaluation-Aligned Training Signals for Multi-LLM Agents

Large Language Models (LLMs) in multi-agent systems (MAS) have shown promise for complex tasks, yet current training methods lack principled ways to connect system-level evaluation with agent- and message-level learning. We propose a theoretical framework that unifies cooperative game-theoretic attribution with process reward modeling to transform system evaluation to agent credit to response-level signals. Unlike prior approaches that rely only on attribution (Shapley) or step-level labels (PRM), our method produces local, signed, and credit-conserving signals. In success cases, Shapley-based credit assignment fairly allocates outcomes across agents and is refined into per-message rewards that promote cooperation while discouraging redundancy or sabotage; in failure cases, first-error localization yields repair-aware preferences that penalize harmful steps while rewarding corrective attempts. The resulting signals are bounded, cooperative, and directly compatible with reinforcement- or preference-based post-training, providing a unified and auditable pathway from global evaluation to local supervision in LLM multi-agent training. Our contribution is conceptual: we present a theoretical foundation and training signals, leaving empirical validation for future work.

cs.MA↗

SLFS: a Flexible, Low-Cost Distributed File System Using Serverless Designs

Large-scale distributed file systems must provision resources for peak demand, yet file access patterns fluctuate significantly, leaving substantial capacity idle during off-peak periods. Existing scaling mechanisms operate at the granularity of entire servers and take minutes to hours, making them unable to track the rapid, fine-grained load variations that file systems commonly experience. Serverless computing, with its millisecond-granularity elasticity and pay-per-use pricing, offers a compelling alternative. We present SLFS, the first distributed file system built with serverless functions for both data and metadata operations. SLFS implements file services on top of key-value stores, keeping function operations simple and short, and introduces a novel multi-threaded, short-lived server design that overcomes the cold-start problem while maintaining low cost. A policy-enforcing coordinator efficiently maps files to function instances, scales the system elastically, and controls function lifetimes to balance performance and cost. SLFS can flexibly run on diverse storage backends -- from cloud-native services like S3 to user-managed key-value stores -- enabling configurable cost-performance trade-offs. Our evaluation shows that SLFS mitigates cold starts by 580$\times$ compared to the base serverless design and outperforms $λ$FS, EFS, and Ceph at up to 63%, 68%, and 63% lower cost, respectively.

cs.DC↗

Characterizing Driver Interactions with Autonomous Vehicles via Response Maps

Understanding human responses to autonomous vehicle (AV) behaviors is essential for socially aware interaction, which is crucial for socially compatible navigation in shared traffic environments. We characterize human driving responses in interactions with AVs as feedback laws over the coupled state space of the human driven vehicle and the AV. We model the human driver's actions using a response map, a concept based in game theory, and employ a linear representation to capture driver behaviors as a function of AV behaviors, based on empirical data from a driving simulator study. Our results show that 1) human driver acceleration behavior can be captured using response maps, and 2) human driver responses differ significantly with respect to AV behaviors of yielding, non-yielding, and responsive to the human driver.

eess.SY↗

Wick Renormalized Parabolic Stochastic Quantization Equations on Rough Metric Measure Spaces

On metric measure spaces with sub-Gaussian heat kernel behavior in small time, we obtain a sufficient condition to solve Wick renormalized stochastic quantization equations with polynomial interaction. Given the power of the nonlinearity, the local solution condition depends on the Hausdorff dimension $d_h$, the walk dimension $d_w$, and the maximal spatial Hölder regularity of the heat kernel $Θ$. A slightly more restrictive condition based on the same parameters is required for a global solution. For all global solutions, we construct an invariant measure for the Markov process defined by the solution. Our results apply to many rough spaces such as Barlow--Kigami type fractals as well as their Cartesian products and open up the possibility of making rigorous various structures in quantum field theory and statistical mechanics in non-integer dimensions. In the process, we build entirely from the short-time heat semigroup the necessary analytic framework that accommodates the issues which come with allowing rough local geometry.

math.PR↗

Half Strong Ill-Posedness of $2 \frac{1}{2}$D Electron Magnetohydrodynamics with Fractional Resistivity

We study the $2\frac{1}{2}$D electron magnetohydrodynamics (MHD): the electron MHD system that has $3$D magnetic field but is independent of $z$-variable. We establish a "half" strong ill-posedness result in $2\frac{1}{2}$D electron MHD with fractional resistivity $(-Δ)^α$ in the supercritical Sobolev space $H^β\times H^{β-1}$ for $3<β<4-2α$. Specifically, we construct small initial data $(a_0,b_0)$ whose solution develops a norm inflation in $a$ but the norm of $b$ remains small.

math.AP↗

HDLxGraph: Bridging Large Language Models and HDL Repositories via HDL Graph Databases

Retrieval Augmented Generation (RAG) is an essential agent for Large Language Model (LLM) aided Description Language (HDL) tasks, addressing the challenges of limited training data and prohibitively long prompts. However, its performance in handling ambiguous queries and real-world, repository-level HDL projects containing thousands or even tens of thousands of code lines remains limited. Our analysis demonstrates two fundamental mismatches, structural and vocabulary, between conventional semantic similarity-based RAGs and HDL codes. To this end, we propose HDLxGraph, the first framework that integrates the inherent graph characteristics of HDLs with RAGs for LLM-assisted tasks. Specifically, HDLxGraph incorporates Abstract Syntax Trees (ASTs) to capture HDLs' hierarchical structures and Data Flow Graphs (DFGs) to address the vocabulary mismatch. In addition, to overcome the lack of comprehensive HDL search benchmarks, we introduce HDLSearch, an LLM generated dataset derived from real-world, repository-level HDL projects. Evaluations show that HDLxGraph improves search, debugging, and completion accuracy by 12.04%/12.22%/5.04% and by 11.59%/8.18%/4.07% over state-of-the-art similarity-based RAG and software-code Graph RAG baselines, respectively. The code of HDLxGraph and HDLSearch benchmark are available at https://github.com/UMN-ZhaoLab/HDLxGraph.

cs.AR↗

Mozart: Modularized and Efficient MoE Training on 3.5D Wafer-Scale Chiplet Architectures

Mixture-of-Experts (MoE) architecture offers enhanced efficiency for Large Language Models (LLMs) with modularized computation, yet its inherent sparsity poses significant hardware deployment challenges, including memory locality issues, communication overhead, and inefficient computing resource utilization. Inspired by the modular organization of the human brain, we propose Mozart, a novel algorithm-hardware co-design framework tailored for efficient training of MoE-based LLMs on 3.5D wafer-scale chiplet architectures. On the algorithm side, Mozart exploits the inherent modularity of chiplets and introduces: (1) an expert allocation strategy that enables efficient on-package all-to-all communication, and (2) a fine-grained scheduling mechanism that improves communication-computation overlap through streaming tokens and experts. On the architecture side, Mozart adaptively co-locates heterogeneous modules on specialized chiplets with a 2.5D NoP-Tree topology and hierarchical memory structure. Evaluation across three popular MoE models demonstrates significant efficiency gains, enabling more effective parallelization and resource utilization for large-scale modularized MoE-LLMs.

cs.AR↗

Hallucination reduction with CASAL: Contrastive Activation Steering For Amortized Learning

Large Language Models (LLMs) exhibit impressive capabilities but often hallucinate, confidently providing incorrect answers instead of admitting ignorance. Prior work has shown that models encode linear representations of their own knowledge and that activation steering can reduce hallucinations. These approaches, however, require real-time monitoring and intervention during inference. We introduce Contrastive Activation Steering for Amortized Learning (CASAL), an efficient algorithm that connects interpretability with amortized optimization. CASAL directly bakes the benefits of activation steering into model's weights. Once trained, LLMs answer questions they know while abstaining from answering those they do not. CASAL's light-weight design requires training only a submodule of a single transformer layer and yet reduces hallucination by 30%-40% across multiple short-form QA benchmarks. CASAL is 30x more compute-efficient and 20x more data-efficient than strong LoRA-based baselines such as SFT and DPO, boosting its practical applicability in data scarce domains. Importantly, CASAL also generalizes effectively to out-of-distribution (OOD) domains. We showcase CASAL's flexibility in mitigating hallucinations in both text-only and vision-language models. To our knowledge, CASAL is the first steering-based training method that has been shown to be effective for both dense and Mixture-of-Experts (MoE) models. CASAL represents a promising step forward for applying interpretability-inspired method for practical deployment in production systems.

cs.CL↗

HiVeGen -- Hierarchical LLM-based Verilog Generation for Scalable Chip Design

With Large Language Models (LLMs) recently demonstrating impressive proficiency in code generation, it is promising to extend their abilities to Hardware Description Language (HDL). However, LLMs tend to generate single HDL code blocks rather than hierarchical structures for hardware designs, leading to hallucinations, particularly in complex designs like Domain-Specific Accelerators (DSAs). To address this, we propose HiVeGen, a hierarchical LLM-based Verilog generation framework that decomposes generation tasks into LLM-manageable hierarchical submodules. HiVeGen further harnesses the advantages of such hierarchical structures by integrating automatic Design Space Exploration (DSE) into hierarchy-aware prompt generation, introducing weight-based retrieval to enhance code reuse, and enabling real-time human-computer interaction to lower error-correction cost, significantly improving the quality of generated designs.

cs.LG↗