arXiv subjects

Yuan Zhong

Publications and source records attributed to Yuan Zhong.

At least 19 recordsLinked to original sources

arXiv2026

Sparse Bayesian Modeling of EEG Channel Interactions Improves P300 Brain-Computer Interface Performance

Electroencephalography (EEG)-based P300 brain-computer interfaces (BCIs) enable communication without physical movement by detecting stimulus-evoked neural responses. Accurate and efficient decoding remains challenging due to high dimensionality, temporal dependence, and complex interactions across EEG channels. Existing approaches often treat channels independently or rely on black-box models, limiting interpretability and personalization. We propose a sparse Bayesian time-varying regression framework that explicitly models pairwise EEG channel interactions while performing temporal feature selection, where a relaxed-thresholded Gaussian process prior induces structured sparsity in both channel-specific and interaction effects, enabling interpretable identification of task-relevant channels and channel pairs. Applied to a public P300 speller dataset of 55 participants, our method achieves a 96.4% median character-level accuracy using all sequence repetitions and attains the best overall decoding performance among competing statistical and deep learning approaches. Incorporating channel interactions yields subgroup-specific gains in character-level accuracy, particularly among participants abstained from alcohol (median 7%, up to 14%). Importantly, our approach improves median BCI-Utility by more than 10% at its optimal operating point, achieving peak throughput after only six sequence repetitions. These results demonstrate that explicitly modeling structured EEG channel interactions within a principled Bayesian framework enhances accuracy and user-centric throughput, and supports personalization in P300 BCI systems.

stat.ME↗

arXiv2026

Can Generalist Vision Language Models (VLMs) Rival Specialist Medical VLMs? Benchmarking and Strategic Insights

Vision Language Models (VLMs) have shown promise in automating image diagnosis and interpretation in clinical settings. However, developing specialist medical VLMs requires substantial computational resources and carefully curated datasets, and it remains unclear under which conditions generalist and specialist medical VLMs each perform best. This study highlights the complementary strengths of specialist medical and generalist VLMs. Specialists remain valuable in modality-aligned use cases, but we find that efficiently fine-tuned generalist VLMs can achieve comparable or even superior performance in most tasks, particularly when transferring to unseen or rare OOD medical modalities. These results suggest that generalist VLMs, rather than being constrained by their lack of specialist medical pretraining, may offer a scalable and cost-effective pathway for advancing clinical AI development.

eess.IV↗

arXiv2026

High-dimensional Supermode Photonics Enabled by Hierarchical Supersymmetric Transformation

Modes provide a fundamental degree of freedom for photonic information processing, yet conventional multimode waveguides exhibit non-equidistant effective-index distributions, making closely spaced modes vulnerable to intermodal crosstalk. Supermode photonics can overcome this limitation by geometrically engineering coupled waveguide arrays to realize large and equidistant effective-index spacing, but precise supermode excitation and detection remain challenging at the subwavelength scale. Here, we report a hierarchical second-order discrete supersymmetric (DSUSY) transformation method that enables high-purity excitation and extraction of arbitrary target supermodes in a compact and scalable architecture. We experimentally demonstrate six-supermode multiplexing systems on silicon-on-insulator and silicon nitride platforms. Benefiting from the large supermode index spacing and the isospectrality of DSUSY transformations, the fabricated devices exhibit low insertion losses (<2.6 dB) and intermodal crosstalk (<-11.1 dB) for all channels over a 100-nm wavelength range. A high-speed transmission experiment on the silicon device achieves an aggregate data rate of 1.2 Tbit/s, with all channel bit error rates below the 7% hard-decision forward-error-correction threshold. The method can further support polarization-insensitive architectures, enabling compact polarization-supermode hybrid multiplexing. This work provides a scalable route toward high-dimensional supermode photonics for high-capacity optical interconnects, highly parallel AI optical computing, and high-dimensional quantum information processing.

physics.optics↗

arXiv2026

First Law for Nonsingular Black Holes in 2D Dilaton Gravity

A central issue in the thermodynamics of nonsingular black holes is the apparent violation of the first law. In this work, we use 2D dilaton gravity as a simple theoretical setting to study this issue. We systematically construct a broad class of nonsingular black hole solutions with metric function $A(x)=f(x)+c$, through a procedure that is considerably simpler than in higher-dimensional theories. Using the Iyer-Wald covariant phase space formalism, we derive the correct energy formula and establish a consistent first law for this entire class of solutions. The apparent violation of the first law in a previous work arises because the energy used therein is not the Hamiltonian conjugate to the fixed time-translation generator adopted. Under the boundary conditions and normalization convention specified in the present work, the Iyer-Wald Hamiltonian energy is $E=-\frac{c}{2}$, and the first law is restored. Moreover, the energy formula agrees with the Casimir function in 2D dilaton gravity, thus confirming its interpretation as the physical black hole energy. Our results clarify the correct first law for 2D nonsingular black holes and may provide insights into the first law of nonsingular black holes in higher dimensions.

gr-qc↗

arXiv2026

Kink collisions in a two-dimensional gravity model

We numerically study kink-antikink collisions in the self-gravitating $ϕ^4$ model coupled to the two-dimensional dilaton gravity theory proposed by Mann et al. The static kink solutions interpolate between an anti-de Sitter (AdS$_2$) region and a Minkowski region, and can be regarded as two-dimensional analogues of certain thick branes. By scanning the initial velocity for several gravitational couplings, we find that gravity modifies the scattering structure: the resonance windows shift toward higher initial velocities and become progressively narrower as the coupling $κ$ increases, while the critical escape velocity increases mildly. A linear perturbation analysis further indicates that the shape modes turn into long-lived quasi-bound states in the weak-gravity regime, which could leak energy during collisions and may therefore contribute to the shift and narrowing of the windows and the increase of the critical velocity. The collisions further produce a clear geometrical response: the conformal factor decreases after the collision, corresponding to a contraction of the local proper spatial scale in the conformal gauge, and this effect becomes stronger for larger $κ$. Meanwhile, the Ricci scalar develops transient peaks during kink encounters but remains finite in all simulations considered. Thus, in contrast to higher-dimensional thick-brane collisions, we find no evidence for spacetime singularity formation in this two-dimensional model.

hep-th↗

arXiv2026

KAMR: Grounding Generation via Knowledge-Aligned Multi-hop Retrieval

Graph-based retrieval-augmented generation increasingly relies on multi-hop retrieval, where answering a query requires composing multiple connected knowledge-graph triplets. However, existing retrievers often rank triplets independently via global semantic matching. Moreover, many multi-hop benchmarks provide only final answers, which limits supervision for query--triplet alignment and causes structurally necessary but weakly aligned facts to be missed. To address these issues, we propose a knowledge-aligned multi-hop retriever, KAMR, which distinguishes anchor triplets that are strongly constrained by the query from connected triplets that are weakly aligned yet structurally linked to the anchors. To mitigate the lack of query-triplet alignment supervision, we build a partial alignment dataset by masking triplet elements and prompting an LLM to generate corresponding queries, and optimize two contrastive objectives for pair-level and element-level matching. At inference time, KAMR retrieves anchors globally and then expands locally to collect connected evidence. Across four benchmarks, three LLM backbones, and fourteen baselines, KAMR consistently improves multi-hop retrieval and downstream question answering performance.

cs.IR↗

arXiv2026

GrocLM: Grocery Category Recommendation in E-Commerce with Large Language Models

The rapid growth of online grocery shopping requires recommendation systems that capture cyclical purchasing behavior and diverse user intents. Traditional item-level methods face scalability and accuracy challenges, motivating category-level recommendation as a more structured and practical alternative. We present GROCLM, a fine-tuned language model for grocery category recommendation in a real-world production environment. GROCLM employs a two-stage LoRA-based training strategy to encode cyclical purchasing patterns directly into model parameters, enabling more effective utilization of rebuying signals compared to prompt-based conditioning. To ensure valid and controllable outputs, we further introduce a trie-based constrained decoding mechanism over a predefined category space. Experiments on both proprietary production data and a public benchmark demonstrate that GROCLM consistently outperforms strong baselines. In a live production restocking task, GROCLM achieves a 7.5% relative improvement in cart-adds per impression, while maintaining efficient inference by generating all categories jointly. These results highlight the effectiveness and practicality of integrating large language models into structured recommendation systems.

cs.AI↗

arXiv2026

A Computational Method for Solving the Stochastic Joint Replenishment Problem in High Dimensions

We consider a discrete-time formulation for a class of high-dimensional stochastic joint replenishment problems. First, we approximate the problem by a continuous-time impulse control problem. Exploiting connections among the impulse control problem, backward stochastic differential equations (BSDEs) with jumps, and the stochastic target problem, we develop a novel, simulation-based computational method that relies on deep neural networks to solve the impulse control problem. Based on that solution, we propose an implementable inventory control policy for the original (discrete-time) stochastic joint replenishment problem, and test it against the best available benchmarks in a series of test problems. For the problems studied thus far, our method matches or beats the best benchmark we could find, and it is computationally feasible up to at least 50 dimensions -- that is, 50 stock-keeping units (SKUs).

math.OC↗

arXiv2026

A Cascaded Generative Approach for e-Commerce Recommendations

Personalized storefronts in large e-commerce marketplaces are often assembled from many independent components: static themes per page section ("placement"), retrieval systems to fetch eligible products per placement, and pointwise rankers to order content. While effective in optimizing for aggregate preferences, this paradigm is rigid and can limit personalization and semantic cohesion across the page. This makes it poorly suited to support dynamic objectives and merchandising requirements over time. To address this, we introduce a cascaded merchandising framework that decomposes storefront construction into two generative tasks: (i) placement-level theme generation and (ii) constrained keyword generation per placement to power product retrieval. Teacher-student fine-tuning is leveraged to improve scalability of this framework under production latency and cost constraints. Fine-tuned model ablations are shown to approach closed-weight LLM performance. We further contribute frameworks for AI-driven content evaluation and quality filtering, enabling safe and automated deployment of dynamic content at scale. Generative output is fused with traditional ranking models to preserve hybrid infrastructure. In online experiments, this framework yields an estimated +2.7% lift in cart adds per page view over a strong baseline.

cs.AI↗

arXiv2026

PolarNet: Single-Minima Neural Network for Modeling Lyapunov Functions

Learning control strategies with provable stability guarantees continues to be a challenging problem. In this work, we examine a family of training-time behaviors exhibited by existing neural Lyapunov control methods under specific conditions, which can hinder the synthesis of a provably stable controller. We identify the root cause as the lack of neural network architectural guarantees on the learned Lyapunov function, and propose PolarNet, a network architecture that provably addresses these issues by structurally guarantee to have a single critical point. We provide theoretical guarantee regarding the properness and universality of PolarNet for modeling Lyapunov functions, and show that using it as a drop-in replacement in existing neural Lyapunov control methods can effectively circumvent particular difficulties in training. We conduct a set of numerical experiments to verify that PolarNet consistently maintains a single critical point and, when used as a drop-in replacement in existing neural Lyapunov control methods, successfully avoids training failures caused by the lack of architectural guarantees. The code of this paper is available at https://github.com/23-zy/PolarNet.

eess.SY↗

arXiv2026

Replica Phase Transition with Quantum Gravity Corrections

Motivated by bulk replica wormholes, we study the boundary effective theory that describes the near-horizon fluctuations of a near-extremal Reissner-Nordström black hole. This theory consists of a Schwarzian mode and a $U(1)$ phase mode. We compute the partition function of this boundary theory on connected geometries, from which the entropy is derived. Our analysis reveals a rich phase structure, in which the dominance of connected or disconnected configurations leads to a phase transition controlled by the temperature and the coupling constants $C$, $K$, and $\mathcal{E}$ of the 1d effective theory.

hep-th↗

arXiv2026

A Theoretical Framework for Auxiliary-Loss-Free Load Balancing of Sparse Mixture-of-Experts in Large-Scale AI Models

In large-scale AI training, Sparse Mixture-of-Experts (s-MoE) layers enable scaling by activating only a small subset of experts per token. An operational challenge in this design is load balancing: routing tokens to minimize the number of idle experts, which is important for the efficient utilization of costly GPUs and for the thorough training of architecture parameters across all experts. We provide a theoretical framework for analyzing the Auxiliary-Loss-Free Load Balancing (ALF-LB) procedure -- proposed by DeepSeek's Wang et al. (2024) -- by casting it as a primal-dual method using a single-shot, constant-time update per training iteration for solving an assignment problem. First, in a stylized deterministic setting, our framework yields several insightful structural properties: (i) a monotonic improvement condition for the Lagrangian objective, (ii) a preference rule that moves tokens from overloaded to underloaded experts, and (iii) an approximate-balancing guarantee. Then, we incorporate the stochastic and dynamic nature of AI training using a generalized online optimization formulation. In the online setting, we derive a strong convexity property of the objective that leads to a logarithmic expected regret bound under certain step-size choices. Additionally, we present real experiments on 1B-parameter DeepSeekMoE models to complement our theoretical findings. Together, these results build a principled framework for analyzing the Auxiliary-Loss-Free Load Balancing of s-MoE in AI models.

math.OC↗

arXiv2026

Integrated Supermode Photonics Enabled by Supersymmetric Transformation

We report a systematic methodology to obtain supermodes with equidistant effective index distribution and to excite arbitrary target supermodes with high precision. By employing a multi-well optical potential realized by a judiciously designed waveguide array, the supported supermodes achieve maximal spacing and an equidistant distribution in effective index. More importantly, we develop a 2nd-order discrete supersymmetric (DSUSY) transformation method that enables the excitation and detection of two supermodes at the same time and can be extended to any number of supermodes via simple cascading. Together, these findings overcome the long-standing bottlenecks in integrated supermode photonics and provide an intrinsically scalable route towards harnessing supermodes as a new degree of freedom for encoding, transmitting, and processing information. We experimentally demonstrate the feasibility and universality of this method by realizing two- and four-supermode multiplexing systems. Benefitting from the large effective index spacing between supermodes and the isospectral nature of the DSUSY transformation, the fabricated devices show low insertion losses (< 2.48 dB at 1550 nm) and intermodal crosstalk (< -18 dB at 1550 nm) for all mode channels over a 100-nm wavelength range (1500-1600 nm). The high-speed data transmission experiment performed on the four-channel system achieves an aggregate data rate of 1.024 Tb/s while maintaining considerably low bit error rates, underscoring the potential of supermode photonics for high-capacity on-chip optical communications. This work lays the foundation for integrated supermode photonics, which uses supermodes as a new degree of freedom for light manipulation and opens new avenues for supermode-based applications including but not limited to on-chip optical communications, intelligent optical computing and quantum information technologies.

physics.optics↗

arXiv2026

Quaternion optical computing chip for parallel high-dimensional data processing

Optical computing chips have emerged as a transformative computing technology due to their high computational density, low energy consumption, and compact footprint. While real- and complex-valued computing chips have been well developed, their fundamental limitations in representing high-dimensional data significantly constrain their applicability in modern signal processing. Quaternions enable direct operations on three- and four-dimensional data, powering high-dimensional processing in data analytics and artificial intelligence. Here we demonstrate a quaternion optical computing chip (QOCC) for the first time and benchmark its performance in several typical application scenarios: three-dimensional point cloud processing, RGB chromatic transformation, and quaternion convolutional neural network for color image recognition. The QOCC harnesses high parallelism of light by wavelength-division multiplexing, processing high-dimensional data simultaneously through multiple optical wavelength channels. Compared to the electronic computing counterpart, our QOCC achieves higher computational fidelity (root mean square error < 0.035) and substantially reduced computational load (2/3 lower). It paves the way towards next-generation optical computing, overcoming the limitations of traditional computing systems in high-dimensional data processing.

physics.optics↗

arXiv2025

MoReMouse: Monocular Reconstruction of Laboratory Mouse

Laboratory mice, particularly the C57BL/6 strain, are essential animal models in biomedical research. However, accurate 3D surface motion reconstruction of mice remains a significant challenge due to their complex non-rigid deformations, textureless fur-covered surfaces, and the lack of realistic 3D mesh models. Moreover, existing visual datasets for mice reconstruction only contain sparse viewpoints without 3D geometries. To fill the gap, we introduce MoReMouse, the first monocular dense 3D reconstruction network specifically designed for C57BL/6 mice. To achieve high-fidelity 3D reconstructions, we present three key innovations. First, we create the first high-fidelity, dense-view synthetic dataset for C57BL/6 mice by rendering a realistic, anatomically accurate Gaussian mouse avatar. Second, MoReMouse leverages a transformer-based feedforward architecture combined with triplane representation, enabling high-quality 3D surface generation from a single image, optimized for the intricacies of small animal morphology. Third, we propose geodesic-based continuous correspondence embeddings on the mouse surface, which serve as strong semantic priors, improving surface consistency and reconstruction stability, especially in highly dynamic regions like limbs and tail. Through extensive quantitative and qualitative evaluations, we demonstrate that MoReMouse significantly outperforms existing open-source methods in both accuracy and robustness.

cs.CV↗

arXiv2025

SIMBA: Scalable Image Modeling using a Bayesian Approach, A Consistent Framework for Including Spatial Dependencies in fMRI Studies

Bayesian spatial modeling provides a flexible framework for whole-brain fMRI analysis by explicitly incorporating spatial dependencies, overcoming the limitations of traditional massive univariate approaches that lead to information waste. In this work, we introduce SIMBA, a Scalable Image Modeling using a Bayesian Approach, for group-level fMRI analysis, which places Gaussian process (GP) priors on spatially varying functions to capture smooth and interpretable spatial association patterns across the brain volume. To address the significant computational challenges of GP inference in high-dimensional neuroimaging data, we employ a low-rank kernel approximation that enables projection into a reduced-dimensional subspace. This allows for efficient posterior computation without sacrificing spatial resolution, and we have developed efficient algorithms for this implemented in Python that achieve fully Bayesian inference either within minutes using the Gibbs sampler or within seconds using mean-field variational inference (VI). Through extensive simulation studies, we first show that SIMBA outperforms competing methods in estimation accuracy, activation detection sensitivity, and uncertainty quantification, especially in low signal-to-noise settings. We further demonstrate the scalability and interpretability of SIMBA in large-scale task-based fMRI applications, analyzing both volumetric and cortical surface data from the NARPS and ABCD studies.

stat.ME↗

arXiv2025

Two-Dimensional Pinching-Antenna Systems: Modeling and Beamforming Design

Recently, the pinching-antenna system (PASS) has emerged as a promising architecture owing to its ability to reconfigure large-scale path loss and signal phase by activating radiation points along a dielectric waveguide. However, existing studies mainly focus on line-shaped PASS architectures, whose limited spatial flexibility constrains their applicability in multiuser and indoor scenarios. In this paper, we propose a novel two-dimensional (2D) pinching-antenna system (2D-PASS) that extends the conventional line-shaped structure into a continuous dielectric waveguide plane, thereby forming a reconfigurable radiating plane capable of dynamic beam adaptation across a 2D spatial domain. An optimization framework is developed to maximize the minimum received signal-to-noise ratio (SNR) among user equipments (UEs) by adaptively adjusting the spatial configuration of pinching antennas (PAs), serving as an analog beamforming mechanism for dynamic spatial control. For the continuous-position scenario, a particle swarm optimization (PSO)-based algorithm is proposed to efficiently explore the nonconvex search space, while a discrete variant is introduced to accommodate practical hardware constraints with limited PA placement resolution. Simulation results demonstrate that the proposed 2D-PASS substantially improves the minimum SNR compared with conventional line-shaped PASS and fixed-position antenna (FPA) benchmarks, while maintaining robustness under varying user distributions and distances.

eess.SP↗

arXiv2025

Shape-invariant Potentials and Singular Spaces

In this work, we present two brane-world-type solutions in a two-dimensional (2D) dilaton gravity model with singular space-time backgrounds. By employing a first-order superpotential formalism, we first construct the 2D analogues of the thick brane solution previously given by Gremm and analyze the corresponding linear scalar perturbations. We show that for a model with canonical scalar matter fields, the effective potential of the linear perturbation equation is a singular Pöschl--Teller~II type, which does not admit bound states. However, for a model with non-canonical scalar fields, the effective potential becomes an exactly solvable Pöschl--Teller~I potential, which has an infinite tower of normalizable bound states. We also present a second analytic solution inspired by the work of Girardello \emph{et al.}, but with non-canonical scalar field. In this case, the linear perturbation equation is a Schrödinger equation with the Eckart potential, which is also exactly solvable.

hep-th↗