Searcharxiv⌕ Search

arXiv subjects

Jun Zhang

Publications and source records attributed to Jun Zhang.

At least 19 recordsLinked to original sources
arXiv2026

Construction of Multi-sequences With High Nonlinear Complexity via Narrow Ray Class Fields

Nonlinear complexity is a fundamental criterion in the evaluation of pseudorandom sequences. The construction of multi-sequences with high nonlinear complexity is both theoretically and practically important in cryptography. Motivated by prior constructions of multi-sequences with high nonlinear complexity in [IEEE Trans. Inf. Theory, 60(10), 2014] and [IEEE Trans. Inf. Theory, 63(12), 2017], we provide a unified framework via narrow ray class fields, the cyclic descent due to Guruswami and Xing in [J. Combin. Theory Ser. A 129 (2015) ]. Then we can generate new multi-sequences with high nonlinear complexity over function fields with arbitrary genera.

cs.IT↗
arXiv2026

MSSP: Multi-Scale Spatially-Constrained Partition for Unsupervised Semantic Segmentation of 3D Point Clouds

3D point cloud semantic segmentation is essential for real-world spatial understanding, yet the prohibitive cost of human annotations motivates unsupervised approaches that require no labels. Existing superpoint-based methods typically rely on spectral analysis at a fixed granularity, failing to capture the hierarchical semantic structures inherent in complex indoor scenes. To bridge this gap, we present a Multi-Scale Spatially-Constrained Partition (MSSP) framework that combines multi-scale spectral analysis with spatially-constrained clustering. Multi-scale spectral analysis constructs enriched superpoint descriptors across multiple clustering granularities; however, the resulting high-dimensional feature space calls for a structural prior to translate into cleaner segmentation. Spatially-constrained clustering supplies this prior by restricting superpoint merging to physically adjacent regions, imposing the spatial coherence needed for multi-scale features to be effective. Extensive experiments on S3DIS and ScanNet show that MSSP achieves the best mIoU among unsupervised methods on the main benchmarks, with particularly significant gains on S3DIS. Notably, our ablation reveals a regularize-then-enrich interaction: multi-scale features alone do not improve final segmentation, yet become highly effective when coupled with spatial regularization, underscoring that spatial coherence is aprerequisite for multi-scale representations in superpoint clustering.

cs.CV↗
arXiv2026

One Merger, Three Bands: Multiband Detection Rates and Parameter Estimation of Stellar-mass Binary Black Hole Coalescences from Millihertz to Kilohertz

Stellar-mass binary black holes sweep through the millihertz, decihertz, and kilohertz gravitational-wave bands before merger, making them prime targets for multiband observations. We forecast their detection rates and parameter-estimation precision for networks combining the millihertz observatories LISA, Taiji, and TianQin; the decihertz concepts LGWA, AMIGO, and AMIGO-5; and the ground-based LVK and Cosmic Explorer. Using the binary-black-hole mass and redshift distributions inferred from GWTC-4, we first estimate the single-band yields and then account explicitly for detector lifetimes and relative mission start times when calculating multiband rates. For a signal-to-noise-ratio threshold of 8, the LISA--Taiji--TianQin network is expected to detect $53.6^{+19.7}_{-14.1}$ systems in the millihertz band, while the largest three-band yield is $23.5^{+8.7}_{-6.2}$ events for LISA--Taiji--TianQin combined with LGWA. The yield is maximized when the decihertz observation begins approximately $0$--$3\,{\rm yr}$ after the millihertz mission. Ground-informed subthreshold searches with a threshold of 5 increase the multiband yields by a factor of approximately $4$--$5$, reaching $125.1^{+46.1}_{-32.9}$ events for the same network. Fisher-matrix forecasts for a GW150914-like source show that decihertz observations provide the dominant improvement in most multiband parameter constraints, whereas millihertz data primarily sharpen the detector-frame chirp mass and sky localization. Combining the three bands improves the chirp-mass precision by orders of magnitude relative to ground-based observations alone and can reduce the localization area and coalescence-time uncertainty substantially. These results demonstrate that coordinated mission scheduling and targeted subthreshold searches are essential for realizing the scientific potential of stellar-mass multiband gravitational-wave astronomy.

astro-ph.IM↗
arXiv2026

Rapid and high-sensitive NV-based microwave field imaging via digital lock-in amplification for on-chip microstrip diagnostics

High-resolution, high-sensitivity microwave (MW) magnetic field imaging is indispensable for non-destructive integrated circuit (IC) testing, radio-frequency device characterization, and spintronic research. Yet, the practical utility of these techniques is severely constrained by the pervasive challenge of isolating weak magnetic signatures from intense optical and electronic noise, which fundamentally limits both acquisition speed and detection sensitivity. Here, we overcome this barrier by introducing a wide-field imaging scheme based on an ensemble of diamond nitrogen-vacancy (NV) centers, synergistically combined with digital lock-in amplification (DLA). By exploiting digital demodulation, the DLA precisely extracts the MW-field response at a specific modulation frequency from background noise (e.g., laser intensity fluctuations), dramatically improving the signal-to-noise ratio (SNR). Consequently, our system attains a magnetic field sensitivity of 126 nT/$\sqrt(Hz)$. Critically, the unprecedented SNR permits a pixel dwell time of under one millisecond, allowing full-field images to be acquired within seconds-more than an order of magnitude faster than state-of-the-art NV-based wide-field techniques. This combination of speed, sensitivity, and micron-scale spatial resolution (1.6 $\mu$m) paves the way for quasi-real-time, non-invasive diagnostics of dynamic MW devices and integrated circuits.

physics.optics↗
arXiv2026

MegaStyle++: Scaling Image Style Space through Hierarchical Style Definition

Image style is a highly abstract, human-constructed concept shaped by a range of visual factors and intrinsically entangled with content, yet a unified and explicit definition of image style remains lacking. In this work, we first discuss the fundamental question of what is style and then propose a hierarchical style definition that describes image style from an overall style identity to fine-grained visual attributes, providing a more structured, transferable, and interpretable style representation. Based on this definition, we refine the style annotation pipeline of MegaStyle and construct MegaStyle++-8M, a large-scale style dataset containing 150K overall style identities, 1M fine-grained style prompts, and 8M stylized images. Extensive analyses demonstrate that our hierarchical definition substantially expands the style space in both diversity and semantic breadth, while precisely capturing intrinsic visual style of reference images. The dataset and code will be updated at https://github.com/Tencent/MegaStyle, we hope MegaStyle++ provides a scalable foundation for studying and modeling diverse image styles.

cs.CV↗
arXiv2026

Superconductivity of Tellurium Polyhydride with Tc above 90K

We report experimental diacovery of superconductivity (SC) in tellurium (Te) polyhydride. The compound was synthesized at high pressure and high temperature conditions using a diamond anvil cell combined with a laser heating system. Subsequent in situ transport measurements at high pressures, performed as a function of temperature and applied magnetic field, revealed a superconducting transition with a critical temperature Tc about 91 K at 263 GPa. The superconducting phase is assigned to TeH4 with characterized face shared TeH12 cage forming quasi molecular H2 units based on synchrotron x-ray diffraction experiments. Analysis of the SC behavior at magnetic fields yielded a Ginzburg Landau (GL) coherence length of approximately 54 angstroms. Tellurium polyhydride thus becomes another chalcogen polyhydride superconductor in addition to the landmark discovery of the first polyhydride high Tc SC SH3.

cond-mat.supr-con↗
arXiv2026

TailSieve: Partial-Rollout-Guided Tail Routing for LLM Rollouts

Large-scale rollouts have become a core component of modern LLM systems, spanning reinforcement learning (RL) post-training, on-policy distillation (OPD), and sampling-heavy evaluation pipelines. Unlike online serving, which is typically optimized for request-level latency and throughput, a small number of long-tail generations can dominate the end-to-end makespan of an entire rollout step. In practice, rollout requests are often routed uniformly across replicas, which can place extremely long generations inside high-concurrency decoding batches. To address this, we present TailSieve, a partial-rollout-guided framework that jointly controls tail routing and replica allocation for LLM rollouts. In an idealized setting with known completion lengths, we show that makespan-optimal routing in the long-tail regime combines tail isolation with load balancing, and that a simple top-k policy closely approximates this offline optimum. Leveraging the observation that long-tail prompts tend to remain long-tailed across policy updates, TailSieve uses partial rollouts as a training-free signal for identifying candidate tail groups. A hierarchical controller then jointly adapts the number of isolated groups and the replica split between the tail and bulk pools using collected response-work history and a measured concurrency-throughput model. TailSieve achieves up to 1.67x routing-only speedup over uniform group routing. The resulting low-concurrency tail pool further enables route-specialized speculative decoding with MTP or DFlash, achieving up to 2.59x speedup over uniform routing. Selected prompts are regenerated under the current policy, preserving on-policy generation and avoiding additional routing-induced length bias in steady state.

cs.AI↗
arXiv2026

WildHandBench: A Benchmark for Handwritten Text Understanding that Challenges MLLMs and Humans

While the top model on OmniDocBench now reaches 96.34% overall on printed-document parsing, the ability of current models to handle challenging handwritten documents remains largely uncharacterized. Existing benchmarks focus on isolated text or formulas, overlook handwritten tables and real-world degradation, and report aggregate accuracy without explaining why models fail. We present WildHandBench, a benchmark containing 500 handwritten documents across three structures (free text, tables, formulas), four languages, and nine real-world scenarios. We introduce a Prior-Driven Error (PDE) metric that quantifies whether errors originate from language priors rather than visual evidence. Evaluating 18 state-of-the-art models together with calibrated human baselines, we find: (1) the best model achieves only 71.85% overall; (2) humans outperform all models yet the gap is narrow (77.09% vs. 71.85%); and (3) model errors are qualitatively different from human errors -- 63-91% of model errors are prior-driven versus only 49% for humans, exposing systematic reliance on language priors that conventional accuracy metrics cannot capture.

cs.CV↗
arXiv2026

Buried in Textual Debt: Context Pruning with Visual Evidence Preservation for MLLM Agents

Multimodal Large Language Models (MLLMs) are increasingly deployed as multi-step agents, where explicit reasoning supports task decomposition and tool coordination but also accumulates self-generated text. Over long trajectories, this text can dominate the context and suppress visual evidence, creating textual debt. We observe that reasoning becomes redundant once task-relevant visual evidence is grounded, while stale hypotheses can misguide later inference when grounding remains uncertain. Pruning must therefore remove redundant text without discarding visual evidence. We propose SPARE, a Kullback-Leibler (KL)-guided framework for pruning accumulated reasoning in multimodal tool-use agents. SPARE uses a compact task-state summary as privileged diagnostic context. For each candidate segment, it replays the same model under the original and summary-conditioned contexts. Reverse-KL divergence from on-policy self-distillation (OPSD) then tests whether the summary sufficiently covers the segment without disrupting future reasoning. We further fine-tune the summarizer with supervised fine-tuning (SFT), enabling more compact summaries, broader coverage, and more aggressive pruning. Across multi-step visual tool-use benchmarks, SPARE achieves the highest average accuracy among pruning methods while removing 37.89-64.58\% of reasoning tokens. This favorable accuracy-context trade-off shows that reducing textual dominance restores reliance on visual evidence and mitigates over-conditioning on self-generated language.

cs.AI↗
arXiv2026

Multi-scale Decomposed Convolution Refinement Network for Visible-Infrared Person Re-Identification

Visible-infrared person re-identification (VI-ReID) suffers from cross-modal discrepancies and limited discriminative capabilities, leading to suboptimal recognition performance. Current approaches exhibit limitations in semantic mining, cross-modal fusion and feature constraints. To tackle these challenges, we propose MDCRNet, a Multi-scale Decomposed Convolution Refinement Network that enhances cross-modal feature learning and discriminative metric learning. Specifically, we introduce a Hierarchical Learning Module (HLM) containing four Hierarchical Decomposed Convolution Attention (HDCA) modules, each equipped with lightweight channel attention and multi-scale spatial perception blocks to capture multi-scale spatial dependencies. Moreover, we develop a Joint Discriminative Metric Loss (JDML) incorporating a novel Granularity Discriminative Loss (GDL) that simultaneously optimizes intra-identity compactness and inter-identity separability across modalities. Extensive experiments on SYSU-MM01 and RegDB datasets demonstrate that MDCRNet achieves state-of-the-art performance on both benchmarks. Code is available at https://github.com/Kevin-zms/MDCRNet.

cs.CV↗
arXiv2026

Fast Nondestructive Readout for High-Clock-Rate Atom Array Quantum Processor

Neutral-atom arrays have rapidly advanced to support thousands of qubits and execute high-fidelity logical operations. However, these processors remain severely throttled by their slowest fundamental operation: nondestructive qubit measurement, which requires milliseconds and fundamentally limits the system's clock rate. This bottleneck arises from both an inherent photon-budget dilemma---sufficient fluorescence for reliable state discrimination must be collected without excessive heating or loss---and frame-based imaging, which imposes one common exposure and decision latency on intrinsically independent, site-local measurements. Here, we overcome these limitations with a fast, nondestructive readout architecture based on real-time, site-resolved adaptive protection. By integrating continuous photon counting with a dynamic feedforward framework, we decode qubit states with sub-microsecond latency and instantly shield atoms from redundant scattering. Demonstrated in parallel across a 100-qubit reconfigurable atom array, with adaptive protection on a 25-site subarray, this dynamic decision protocol reduces the average probe time to just $15\ \mu\text{s}$. Model-free benchmarking yields a discrimination infidelity of $4.1 \times 10^{-5}$ and an atom loss of $2.1 \times 10^{-4}$, simultaneously setting new performance records for atom arrays. Exploiting this capability, we operate repeated quantum circuits at an unprecedented 1.7 kHz clock rate with atoms reused over 120 consecutive rounds---nearly sevenfold higher than the previous record---and enter the sub-millisecond cycle regime for the first time. By removing nondestructive readout as the dominant cycle-time bottleneck, this work unlocks high-clock-rate mid-circuit syndrome extraction, paving the way for high-throughput, fault-tolerant quantum computation.

quant-ph↗
arXiv2026

Superconducting Hydride Mg2RhH6 Experimentally Achieved at Lower Pressure

Although tremendous progress has been made in recent years in the field of polyhydride superconductors, the realization of high critical temperature superconductivity still relies on formidable high pressures. Searching for superconducting hydrides at lower pressures is of particular importance. Here we report the first experimental synthesis of the Mg2RhH6, which achieves superconductivity under a significantly reduced pressure of 30 GPa. The synthesis of Mg2RhH6 proceeds via a two step process (1) preparation of the Mg2RhH5 precursor containing hydrogen atoms stabilized by covalent bonds, followed by (2) hydrogen supplementation resulting in the filling of electrons into anti bonding orbitals above 30 GPa, which was accompanied by the structural transition from RhH5 square pyramid to RhH6 octahedron. Superconductivity is achieved at 30 GPa with a Tc of 24 K, which is further enhanced to 29 K at 53 GPa, evidenced by a sharp drop of resistivity to zero and characteristic suppression of Tc under applied magnetic fields. Our experiments prove the Mg2RhH6 superconductor to be thermodynamically stable above 30 GPa, making it the first case exhibiting a Tc of approximately 30 K at a readily accessible pressure. This study pioneers a highly promising pathway for the rational design and discovery of high temperature superconductors within phonon mediated BCS framework.

cond-mat.supr-con↗
arXiv2026

DrEM: Dual-Side Robust Ensemble Ranking from Noisy User Preference Predictions in Video Recommendation

Industrial video recommendation systems typically adopt a multi-stage architecture. At the ensemble ranking stage, multi-dimensional user preference predictions (pxtrs) from an upstream multi-task model are fused into a unified ranking score to reflect user satisfaction. Since users' true satisfaction is difficult to observe directly, ensemble ranking models commonly use pxtrs both as input features and as a source for constructing proxy preferences. However, as outputs of an upstream prediction model, pxtrs inevitably contain prediction noise, which propagates to downstream learning across two sides. On the supervision side, noisy pxtrs may flip proxy preferences and introduce erroneous gradients. On the feature side, pxtr noise may propagate through model inputs and destabilize ranking scores. Existing ensemble ranking methods typically treat pxtrs as reliable signals and overlook such prediction noise. To address this, we propose DrEM, a dual-side robust ensemble ranking framework. Our DrEM introduces a risk-denoising robust loss that corrects the empirical risk using estimated preference flip probability. Meanwhile, it samples perturbations from the distribution of prediction noise and introduces a preference-preserving ranking consistency regularizer to improve feature-side output stability. Theoretically, we obtain an approximate distribution of the prediction noise and prove that the robust loss remains superior under flip probability estimation error. Extensive offline experiments and large-scale online A/B tests demonstrate the effectiveness and robustness of our DrEM.

cs.IR↗
arXiv2026

Generator-Guided Inverse Sampling for L\'evy-Driven Generative Models

This paper studies inverse sampling for L\'evy-driven generative models from the perspective of Markov generators. Unlike conventional diffusion models, L\'evy-driven dynamics involve infinite jump activities, which makes their reverse process nonlocal and difficult to characterize using score information alone. We address this challenge by analyzing the forward and reversed generators. It is derived that the reversed jump component generally becomes a state-dependent Markov jump process governed by a nonlocal density ratio. This observation motivates a structured reverse sampler that decomposes the dynamics into diffusion, small jump, and large jump components. Based on this characterization, we develop a computationally tractable sampler for a class of isotropic linear L\'evy SDEs with symmetric $\alpha$-stable jump components. For the jump component, the neural network is used only to amortize the rate of large jump activities, while jump amplitudes are generated from analytically derived conditional distributions, which improves interpretability and controllability. Efficient implementation techniques are further introduced under this setting to avoid expensive high-dimensional integration and sampling. The sampler is further adapted to approximate observation-guided sampling and applied to OFDM-SISO channel estimation under mixed Gaussian and impulsive noise. Simulations show robust estimation performance with a favorable tradeoff between complexity and performance.

cs.LG↗
arXiv2026

GLocFM: A Geometry-Aware Foundation Model for 3D Indoor Wireless Localization

Learning-based wireless localizers often fail to utilize geometric information about the propagation environment, limiting their ability to exploit non-line-of-sight (NLoS) propagation and generalize across scenes. To bridge this gap, we propose GLocFM, a Geometry-aware Localization Foundation Model, which jointly exploits WiFi measurements and scene geometry represented as a 3D point cloud. We formulate localization as a maximum-likelihood (ML) estimation problem, where the goal is to find a transmitter position that maximizes the likelihood of the wireless observations conditioned on the scene geometry. The likelihood of a candidate transmitter position is calculated by a learned scoring function that matches the observed delay--angle-of-arrival (AoA) spectrum against the spectrum predicted for that candidate. A hierarchical scene encoder extracts propagation-relevant features to produce geometric priors for LoS and one-bounce reflection paths. For scenarios with imperfect synchronization, we further introduce a time-of-flight (ToF)-robust GLocFM model to handle unknown ToF offsets. GLocFM is trained on a multi-modal synthetic indoor localization dataset comprising 221 diverse scenes whose associated wireless signals are generated using Sionna RT. On both synthetic and the NeRF$^{2}$ dataset based on real measurements, GLocFM reduces mean 3D localization error relative to one of the state-of-the-art localization baselines by 49.5\% and 48.8\%, respectively. Ablations across different number of receiver, bandwidths, and array sizes further demonstrate the effectiveness and robustness of the proposed framework.

eess.SP↗
arXiv2026

A Height-Constrained 2-Point Minimal Solver for Pose Estimation from Active LED Markers with Event Cameras

In many autonomous applications requiring real-time localization, active marker-based systems are preferred due to their low latency and ease of deployment compared to computationally demanding feature-based methods. Event~\mbox{cameras} offer high temporal resolution and minimal delay and are commonly used with active LED markers for robust real-time localization. Existing methods typically rely on Perspective-n-Point (PnP) solvers for pose estimation. However, structured marker layouts can be challenging to deploy in space-constrained scenarios, while partial self-motion information (e.g., gravity direction and altitude) is readily available from onboard sensors. We derive a robust and accurate minimal solver that estimates camera pose from only two LED markers by incorporating known tilt angle and camera height measured by an onboard sensor, such as an IMU or an altimeter. The proposed formulation uniquely determines the camera pose through both a closed-form and a linear least-squares solution. We further analyze degenerate configurations and characterize the conditions under which height information does not contribute to rotation estimation. For evaluation, we developed an event-based active marker system to collect real-world data with ground truth from a motion capture system. Experiments on both synthetic and real data demonstrate improved accuracy over the state-of-the-art P2P solver and competitive performance relative to P3P.

cs.CV↗
arXiv2026

Omni-LiveAvatar: Minute-Level Real-Time Streaming Joint Audio-Video Avatar Generation

Joint audio-video generative models serve as foundation for immersive and interactive digital-human generation. Nevertheless, most existing models rely on bidirectional attention and multi-step denoising and can generate only short clips, making them unsuitable for real-time interaction over extended durations. We present Omni-LiveAvatar, the first framework for minute-level, real-time streaming joint audio-video avatar generation. Specifically, we propose (1) a progressive autoregressive distillation pipeline that transfers a large bidirectional joint audio-video diffusion model into a few-step autoregressive generator without auxiliary stabilization mechanisms; (2) a synchronized audio-video long-short-term memory that preserves global consistency under a bounded memory budget; and (3) a hierarchical rolling prompt planning strategy that enables coherent semantic evolution and seamless prompt transitions. Extensive experiments show that Omni-LiveAvatar generates high-quality, synchronized minute-level avatars in real time. In terms of speed, it achieves a 33$\times$ generation speedup over its teacher, LTX-2, on a single NVIDIA H200 GPU; in terms of generation quality, it outperforms accelerated baselines across visual quality, audio quality, cross-modal synchronization, and human fidelity. Our code is available at https://github.com/Aoko955/Omni-LiveAvatar.

cs.MM↗
arXiv2026

GSBF: Gaussian Splatting for Environment-Aware Beamforming

Beamforming plays a key role in multiple-input-multiple-output (MIMO) communication systems. However, conventional beamforming design normally requires accurate instantaneous channel state information (CSI) and iterative optimization, which incur substantial pilot overhead and computational complexity. Recognizing that radio propagation is intrinsically governed by the physical geometry, we develop a 3D Gaussian splatting for environment-aware beamforming (GSBF) pipeline based on multi-modal data, which characterizes the environment through a persistent 3D Gaussian representation. Specifically, GSBF models the environmental scattering response with reciprocity-preserving bidirectional spherical Gaussian (Bi-SG) kernels and performs two-sided electromagnetic rasterization to render an angular propagator map. The rendered map is then aggregated through an over-complete array-manifold dictionary and projected to the constant-modulus beamformers, thereby synthesizing beams directly from the access point (AP) pose and user position without online instantaneous CSI. Simulations demonstrate that GSBF consistently outperforms baselines such as exhaustive beam alignment (EBA) with lower latency.

cs.AI↗