Search arXiv⌕ Search

arXiv subjects

Wenjun Zhang

Publications and source records attributed to Wenjun Zhang.

At least 19 recordsLinked to original sources

ACD-GS: Asymmetric Curvature-aware Densification for 3D Gaussian Splatting

3D Gaussian Splatting (3DGS) has emerged as a powerful paradigm for real-time photorealistic novel view synthesis. However, its training-time densification remains largely heuristic, often resulting in redundant Gaussian proliferation and inaccurate geometric reconstruction. Existing methods predominantly rely on first-order screen-space gradients to trigger cloning and splitting, which fail to distinguish true geometric discontinuities from high-frequency textures or noisy residuals. To address this limitation, we propose ACD-GS, an Asymmetric Curvature-aware Densification framework for compact and geometry-aware 3D Gaussian optimization. Our key insight is that second-order depth responses provide a more reliable structural prior for density control, enabling asymmetric regulation of cloning and splitting to better capture geometric discontinuities. Building on this, we introduce a multi-view photometric consistency constraint to suppress transient single-view errors, together with a capacity-aware adaptive regulation strategy that balances densification and pruning during training. Unlike post-hoc compression or quantization-based approaches, ACD-GS directly prevents redundant Gaussian generation during training, yielding inherently compact representations. Extensive experiments demonstrate that our method reduces nearly 60% of Gaussian count and storage while maintaining competitive rendering fidelity, consistently outperforming existing methods across multiple datasets. Our code is available in https://waveviewer.github.io/ACD-GS/.

cs.CV↗

Generative Rate-Distortion-Perception Theory on Riemannian Manifolds

Generative communication uses transmitted information to control stochastic generation at the receiver. A fundamental question is how much source-specific information must be communicated so that outputs generated at the receiver satisfy prescribed fidelity and reliability requirements while preserving the conditional source distribution. We address this question for sources on compact Riemannian manifolds by developing a generative rate-distortion-perception (GRDP) framework without common randomness. We formulate an asymptotic operational GRDP function under a geodesic distortion radius and a failure-probability constraint, and establish its single-letter characterization through an equivalent informational formulation. Furthermore, for the informational formulation with the high-reliability limit, we derive a geometric lower bound determined by the largest source probability mass of a region with bounded geodesic diameter, together with an upper bound based on probabilistic coverings of the source manifold. Small-radius analysis of the lower bound reveals the roles of intrinsic dimension and scalar curvature in the required communication rate. For uniformly distributed sources on compact homogeneous Riemannian manifolds, we prove that the bounds coincide, yielding an exact characterization of the limiting GRDP function. We further specialize this result to unit spheres, obtaining an explicit expression that relates the minimum communication rate to the geodesic distortion radius and intrinsic dimension, revealing that for the $d$-dimensional unit sphere with $d\ge2$, increasing the communication rate by $d$ bits per source symbol can reduce the distortion radius by more than half.

cs.IT↗

Benchmark Radar: A Living Database and Search Engine for AI Benchmarks and Evaluation

Benchmark researchers and developers of large language models (LLMs) and other AI systems need to find relevant evaluations, locate their benchmark datasets and code, and understand the settings behind reported scores. We present Benchmark Radar, a living database and search engine for retrieval and discovery of AI benchmarks, covering LLM evaluation, agentic and tool-use benchmarks, coding, reasoning, safety, and domain-specific evaluations. The system combines daily discovery of benchmark papers, repositories, datasets, and releases with a searchable benchmark catalog, mentions in model cards and technical reports, and score histories. It retains source identities and citations so readers can inspect candidate benchmarks and their evaluation evidence. Daily discovery draws on 37 sources: 13 direct connectors and 24 first-party research and engineering feeds. The catalog contains 1,283 source records drawn from 4 benchmark catalogs and 12,916 numeric observations on 790 records. We describe collection and retrieval, audit the full catalog, and examine benchmark saturation, adoption trends, and the limits of score comparisons. A worked example walks through a complete prior-art search, showing how to query the catalog and inspect benchmark evidence when designing a new evaluation. We release the web dashboard with a benchmark leaderboard, a Pareto frontier view of score against measured use, saturation and trend views, daily feeds, downloadable evidence, a command-line interface (CLI) for offline queries, and reproducible analysis.

cs.AI↗

Risk measures for infinite-server queues driven by a Cox-BESQ process

This paper introduces a model for infinite-server queues driven by a Cox process with stochastic intensity given by a squared Bessel (BESQ) process. Exploiting the affine structure of the underlying dynamics, we derive a closed-form expression for the joint moment-generating function (MGF) of the arrival intensity, the number of customers in the system, and the integral of the number of customers in the system over a time interval. This MGF can also be obtained at two (or more) dates, thereby allowing an analysis of the time evolution of infinite-server queues driven by a Cox--BESQ process. The availability of these explicit MGFs enables the development of risk measures for these variables, such as the joint moments of the arrival intensity, the number of customers in the system, and the integral of the number of customers in the system over a time interval, conditional on one of these variables exceeding a critical threshold. These risk measures can be determined at one or two dates. They rely essentially on the explicit form of the MGF of the state variables and on Fourier representations of the risk measures. Numerical experiments demonstrate the practical implementation of the proposed methodology and highlight the relevance of the theoretical results.

math.PR↗

Polarization Observations of NGC 315 with FAST

We present new continuum and polarization observations of radio galaxy NGC 315 obtained with the Five-hundred-meter Aperture Spherical radio Telescope (FAST) over 1.0-1.5 GHz. The FAST data detect diffuse large-scale polarized emission with a noise level of 0.065 mJy beam$^{-1}$ at resolution of $4'$. We derived a rotation measure (RM) map with an error of 1.1 rad m$^{-2}$ including systematic error. The intrinsic RM map was obtained after subtracting the Galactic foreground contribution. We estimated a total magnetic field strength of $\lesssim 1$ $μ$G across the source and a thermal electron density of $\sim 10^{-4}$ cm$^{-3}$ toward the northwest lobe. The fractional polarization analysis suggests a random magnetic-field component over a large area toward the northwest lobe.

astro-ph.GA↗

Pilot-Based Sensing With OFDM and AFDM: A Resource-Matched Performance Comparison

As a waveform candidate for next-generation wireless systems, affine frequency division multiplexing (AFDM) has often been compared with orthogonal frequency division multiplexing (OFDM) under different configurations, while a systematic comparison of their pilot-based sensing performance remains lacking. This paper establishes a comparison with the same bandwidth, frame duration, pilot energy, and reserved-resource overhead. OFDM-random, OFDM-fixed-comb, and OFDM-shifted-comb pilots are compared with AFDM pilots surrounded by guard resources using aperiodic ambiguity functions without cyclic prefix/chirp-periodic prefix (CP/CPP) and cyclic ambiguity functions with CP/CPP, followed by target detection experiments. The results show that OFDM-fixed-comb exhibits low range sidelobes but periodic range ambiguity peaks, while AFDM and OFDM-shifted-comb effectively suppress zero-Doppler range ambiguities. Within the common unambiguous region, all pilot configurations for both waveforms exhibit similar detection thresholds in strong-target detection, while structured OFDM and AFDM pilot placements outperform OFDM-random in weak-target detection. At high mobility, the AFDM receiver using the discrete affine Fourier transform (DAFT) can resolve integer Doppler beyond the conventional slow-time maximum unambiguous velocity, outperforming the tested conventional OFDM and AFDM receivers at the increased search complexity. These results separate the effects of waveform, pilot placement, and receiver processing, providing a basis for AFDM and OFDM pilot-based sensing design.

eess.SP↗

Tokenized Joint Source-Network Coding for Loss-Resilient Video Streaming

For decades, conventional video streaming systems have relied on packet-level forward error correction (FEC) codes and retransmissions to ensure reliable video delivery. However, in real-time communications, FEC is inherently inefficient under unknown and time-varying packet-loss conditions, while retransmission can incur excessive latency and fail to meet stringent playout deadlines. Emerging deep joint source-channel coding (DeepJSCC) provides an alternative by learning channel-noise-resilient representations, yet its tight coupling with the physical layer makes it difficult to integrate into today's layered network architectures and protocols. In this paper, we propose TokJSNC, a simple-but-effective tokenized joint source-network coding paradigm for packet-loss-resilient video streaming. Rather than first compressing video into a compact bitstream and then protecting it with packet-level FEC, TokJSNC directly encodes video into variable-length discrete token-stream, whose transmission rate is jointly adapted to video content complexity and network conditions. By exploiting the spatiotemporal correlations among learned video tokens, TokJSNC enables robust video reconstruction over a wide range of packet-loss rates without explicit FEC or retransmissions. Consequently, TokJSNC brings the JSCC-like graceful degradation property to the network layer while remaining compatible with existing network architectures and transport protocols. Experimental results show that TokJSNC maintains an average playback frame rate above 22 fps even at a 70% packet-loss rate, whereas the best-performing baseline drops below 12 fps. Overall, TokJSNC establishes a practical pathway for repurposing modern generative video tokenizers for loss-resilient streaming, while providing a fundamental framework for video token communications.

eess.IV↗

Recasting DiT for Extreme Image Compression with Hierarchical Visual Priors

Pretrained diffusion models provide powerful generative priors for extreme image compression, but their stochastic, iterative generation processes are not designed to decode compressed representations directly. We present PrismCodec, which recasts a pretrained Diffusion Transformer (DiT) as a bitstream-grounded one-step generative decoder. PrismCodec uses the decoded representation in two complementary roles: a projected codec state defines the starting state for generation, while hierarchical visual priors derived from the same decoded latent provide semantic and structural guidance. To bridge the gap between stochastic, iterative generation and deterministic one-step decoding, we develop a progressive adaptation strategy. We first learn codec-conditioned transport from a noisy neighborhood centered on the codec state, distill it into a one-step mapping, and finally anneal the source perturbation to zero during end-to-end optimization. The resulting decoder reconstructs deterministically from the received representation without additional conditioning bits. Across Kodak, CLIC, and DIV2K, PrismCodec consistently improves rate-perception performance over prior generative codecs, achieving BD-rate reductions of 70-75% in LPIPS and 75-81% in DISTS over StableCodec. Code will be released upon acceptance.

cs.CV↗

A Survey on the Symbiosis of Artificial Intelligence and Terahertz Networks

The Terahertz (THz) band (0.1-10 THz) has emerged as a critical frontier for future communication systems, offering ultra-wide bandwidths that enable Terabits-per-second (Tbps) wireless links and high-precision sensing and imaging. However, practical deployment of THz systems is hindered by unique challenges, including intricate channel characteristics, high-dimensional and large-scale optimization problems, and highly dynamic network environments. Artificial Intelligence (AI) serves as a transformative enabler to address these challenges, providing robust capabilities for precise modeling, advanced signal processing, complex optimization, real-time decision-making, and prediction, among others. Reciprocally, the unprecedented bandwidth and high-resolution sensing capabilities of THz networks provide a promising physical infrastructure for AI, facilitating training, inference, and data collection. This survey presents a systematic and comprehensive overview of AI-driven solutions across the entire THz communication network and the symbiosis of AI and THz networks. To begin with, a foundational overview of AI technologies tailored for wireless communications is presented. Subsequently, AI-based innovations are investigated, spanning from hardware design, channel modeling, physical layer optimization, up to higher-layer network protocols and advanced THz services, including mobile edge computing and sensing-empowered applications. In parallel, the capacity of THz networks to serve AI is examined, underscoring a profound paradigm shift towards a mutual symbiosis where AI and THz co-evolve and empower each other. Finally, by synthesizing these state-of-the-art advancements and identifying open research directions, this survey highlights the potential of AI in copilot with development of THz communication systems.

eess.SP↗

Toward Generative Video Communication: A Dual-Stream Digital Transmission Framework

Generative video communication has shown promise for bandwidth-constrained wireless transmission and has the potential to support personalized content delivery. In this article, we propose a dual-stream digital generative video communication (DGVC) framework that integrates a traditional digital link with a generative link. The traditional link provides source-grounded visual references, while the generative link conveys compact semantic and perceptual information for receiver-side generation. We further discuss three bandwidth-dependent operating regimes and key technologies for dual-stream coordination, synchronization, reliability, and latency control. A practical case study demonstrates the perceptual and temporal-quality benefits of DGVC under wireless fading channels. Finally, we discuss open challenges and future research directions for generative video communication.

cs.MM↗

CompactSplat: Spatially Adaptive Gaussian Distribution for Feedforward Scene Reconstruction

Reconstructing 3D scenes from sparse views without per-scene optimization remains highly challenging, especially for recovering accurate geometry and fine textures. While recent feedforward approaches leverage generalizable 3D Gaussian Splatting (3DGS) for scene generation, they typically assign one or multiple Gaussians to each pixel. Such uniform allocation not only produces highly redundant representations by wasting primitives in homogeneous areas, but also fails to exploit the inherent geometric priors of planar surfaces, often resulting in sub-optimal structural modeling. To address these limitations, we present CompactSplat, a novel feedforward framework that enables a content-aware allocation of 3D Gaussians. By integrating texture-guided spatial partitioning with hierarchical sampling, CompactSplat adaptively distributes primitives - concentrating dense Gaussians in complex regions while tiling flat areas with expanded, scale-modulated primitives. Moreover, our framework inherently supports dynamic sparsity control at inference time, enabling seamless trade-offs between rendering fidelity and memory footprint without requiring network retraining. Extensive experiments on RealEstate10K, DL3DV, and ScanNet demonstrate that CompactSplat consistently outperforms prior methods on both standard metrics and high-resolution rendering consistency, achieving high-fidelity reconstructions with significantly fewer primitives.

cs.CV↗

Constrained Dynamic Gaussian Splatting

While Dynamic Gaussian Splatting enables high-fidelity 4D reconstruction, its deployment is severely hindered by a fundamental dilemma: unconstrained densification leads to excessive memory consumption incompatible with edge devices, whereas heuristic pruning fails to achieve optimal rendering quality under preset Gaussian budgets. In this work, we propose Constrained Dynamic Gaussian Splatting (CDGS), a novel framework that formulates dynamic scene reconstruction as a budget-constrained optimization problem to enforce a strict, user-defined Gaussian budget during training. Our key insight is to introduce a differentiable budget controller as the core optimization driver. Guided by a multi-modal unified importance score, this controller fuses geometric, motion, and perceptual cues for precise capacity regulation. To maximize the utility of this fixed budget, we further introduce an adaptive static-dynamic allocation strategy that separates the Gaussian representation into static and dynamic branches and distributes the shared global capacity between them according to motion complexity. Furthermore, we implement a three-phase training strategy to seamlessly integrate these constraints, ensuring precise adherence to the target count. After training, a dual-mode hybrid compression scheme further reduces storage overhead. CDGS therefore not only strictly adheres to the specified Gaussian-count budget (error<2%) but also achieves favorable rate-distortion performance. Extensive experiments demonstrate that CDGS delivers optimal rendering quality under varying capacity limits and favorable rate-distortion performance, achieving over 3x model compression compared with the state-of-the-art method Ex4DGS.

cs.CV↗

From Pixel to Coding: Evaluating the Figure Reproduction Capabilities of MLLMs

Multimodal Large Language Models (MLLMs) have demonstrated impressive capabilities in both visual understanding and code generation. However, existing benchmarks typically evaluate these two modalities in isolation, lacking a dedicated assessment of their unification, i.e., how a model can perceive complex visual structures and synthesize them into precise, executable code. Moreover, current visual code generation benchmarks often rely on simplified layouts within single programming environments, falling short of evaluating true unified multimodal reasoning. To bridge this gap, we propose FigCodeBench, a comprehensive framework for rigorously evaluating MLLMs on figure reproduction, integrating multimodal comprehension and generation. We first design a systematic dataset construction pipeline, resulting in a total of 6,194 instances that cover 7 functional categories and 4 types of programming languages. We further categorize figure reproduction into three tiers with visual and code complexity modeling, specifically targeting complex structural reasoning, varying aspect ratios, and dense geometric constraints. We introduce a multi-dimensional evaluation protocol, encompassing visual fidelity and syntactic isomorphism, that aligns highly with the Mean Machine Opinion Score (MMOS) and human preferences. Based on our framework, we conducted extensive experiments on 24 widely used proprietary and open-source MLLMs (e.g., Gemini 3.1 Pro, GPT-5.4, and Kimi-K2.5), where we observed a universal, non-linear performance cliff across different programming languages and difficulty scenarios for all models, and gained several insights, such as the significant metric decline in rigid declarative languages.

cs.CV↗

Mockenhaupt's Three-Term Hardy-Littlewood Majorant Conjecture

For an integer $k \ge 0$, let $f_k(x) = 1 + e(x) + e((k+2)x)$ and $g_k(x) = 1 + e(x) - e((k+2)x)$ on $\mathbb{T} = \mathbb{R}/\mathbb{Z}$, where $e(x) = e^{2πi x}$. Mockenhaupt conjectured that $\|g_k\|_{L^p(\mathbb{T})} > \|f_k\|_{L^p(\mathbb{T})}$ whenever $2k < p < 2k+2$. The conjecture was previously known for $k \le 5$. We give a single analytic proof valid for every $k \ge 4$; in particular, this settles all previously open cases $k \ge 6$ and establishes the conjecture for every $k \ge 0$. The proof reduces the norm comparison to resonant Fourier coefficients on the two-torus and represents these coefficients, after analytic continuation, by triple-Bessel integrals. Neumann's product formula and the Weber-Schafheitlin formula yield a quantitative positive lower bound for the leading mode, while the remaining odd modes are controlled by a uniform tail estimate. The leading mode is then shown to dominate the tail for every $k \ge 4$. AI Usage. The mathematical argument of this paper was produced by the auto-research system Apex Math, an AI system built by Apex Intelligence. See Appendix A for the complete AI usage statement.

math.CA↗

Controlling Atom Array in an Ultra-high-cooperativity Optical Cavity

Neutral-atom array and cavity quantum electrodynamics offer complementary strengths for quantum science: scalable, reconfigurable qubit architectures and strong coherent light-matter coupling. Combining them in a single platform requires an optical cavity with simultaneously high cooperativity, sufficient mode volume to accommodate atom array, and ample side optical access for atom trapping, imaging, cooling, and rearrangement, a combination that is challenging to achieve. Here we realize an atomic array integrated with a millimeter-scale Fabry--Pérot cavity whose optically-characterized single-atom cooperativity reaches $η_{\mathrm{cav}}=125\pm13$. Atom-cavity transmission spectra of trapped atoms yield an effective spectroscopic cooperativity $η_{\mathrm{spec}}=106\pm 3$, providing an in-situ verification of strong coupling in the integrated platform. In this integrated system, we achieve a state-measurement fidelity of $99.925^{+15}_{-18}\%$ for a single atom with a 4-$μ$s readout time. We also demonstrate simultaneous coupling of up to 21 individually trapped atoms to the antinode of the cavity mode. The key technical advance is a two-step mirror-fabrication method combining precision mechanical shaping and carbon-dioxide laser polishing, which produces concave fused-silica mirrors with sub-millimeter radii of curvature and residual roughness below $2~Å$. Our results establish a regime of cavity-integrated atomic array that simultaneously provides high cooperativity, large mode volume, and flexible manipulation of individual atoms, opening opportunities for cavity-assisted quantum state readout and long-range entanglement-engineering in atom-array platforms.

quant-ph↗

Compressing 3D Gaussian Splatting via Cross-Representation Priors

3D Gaussian Splatting (3DGS) enables high-quality novel view synthesis but incurs high storage and transmission costs due to dense Gaussian primitives. Recent anchor-based compression reduces per-primitive redundancy, yet redundancy across anchors remains largely unexploited. We propose CRP-GS (Cross-Representation Priors for Gaussian Splatting), a rate-distortion optimized compression framework that leverages cross-representation priors to improve anchor-level entropy modeling. First, a Correspondence-Oriented Hierarchical Structure (COHS) organizes anchors by feature correspondence rather than spatial proximity, constructing root-leaf dependencies so that selected anchors can act as informative priors to conditionally encode others, yielding more accurate likelihood prediction and lower conditional entropy. Second, Shared Feature Aggregation (SFA) extracts globally shared features from a contextual hash grid and injects them into anchor representations, factoring out scene-consistent low-frequency information that would otherwise be redundantly embedded in individual anchors. Both modules are trained under a unified rate-distortion objective to balance bitrate reduction and rendering fidelity. Experiments across multiple benchmarks show that CRP-GS achieves a favorable overall rate-distortion trade-off, yielding around 30% average bitrate reduction compared to anchor-based baselines while maintaining comparable rendering quality.

cs.CV↗

Tensor Decomposition Based Mixed-Field Sensing for XL-MIMO AFDM Systems

Integrated sensing and communications enabled by extremely large-scale MIMO (XL-MIMO) and affine frequency division multiplexing (AFDM) is a highly promising paradigm for vehicular networks. However, the near-field spherical wavefront distortions induce severe non-linear parameter coupling, while the highly dynamic scattering environments exacerbate mismatch errors. To address these critical challenges, this paper proposes a novel tensor-based sensing scheme for XL-MIMO AFDM systems. First, the received signals are reformulated into a tensor, followed by an efficient decomposition approach that exploits the inherent Vandermonde structure of the factor matrices. This allows parameters to be directly estimated from the decomposed matrices, effectively avoiding inter-parameter coupling. Subsequently, a symmetric decoupling and real-domain manifold optimization algorithm is proposed for angle of arrival estimation, circumventing the high-dimensional searches typically induced by near-field effects. Furthermore, a baseband reconstruction and analytical gradient-based algorithm is developed to perform delay-Doppler estimation in the continuous parameter domain, fundamentally eradicating the grid-mismatch errors inherent in high-mobility scenarios. With these decoupled factors, the remaining unknown angle of departure can be readily extracted. Extensive simulation results demonstrate that the proposed scheme achieves orders-of-magnitude improvements in delay-Doppler accuracy and eliminates the error floors in angular estimation that severely bottleneck state-of-the-art baselines.

eess.SP↗

Decoupled Self-Forcing Distillation for Streaming Talking Head Generation

Streaming talking-head generation produces each frame as its driving audio arrives, yet fidelity and efficiency have so far pulled in opposite directions: end-to-end methods condition a video diffusion model on audio directly and achieve high quality but only at large scale, while cheaper two-stage methods generate an intermediate motion representation and trail in fidelity. We argue the cost of the former lies in the target of fusion: the video latent is dominated by identity, appearance and background, none of which audio bears on, so coupling audio to every pixel blurs detail and wastes capacity. We instead fuse conditions in a low-dimensional identity-disentangled motion space, routing audio and motion captions by their temporal granularity, and generate motion latents with a small causal autoregressive transformer that a pretrained diffusion renderer turns into video. Conditions thus control video transitively, and high fidelity no longer requires a large backbone. Streaming this decomposition needs both models to be causal, and the exposure-bias problem could be solved by self-forcing given a bidirectional teacher. But there is no such teacher in motion space. Our decoupled self-forcing distillation resolves both models under one frozen teacher: conditioned on motion, it distills the renderer into a block-causal student; unconditionally, it scores rendered rollouts against real videos, supervising motion by the video it produces. This lifts the fidelity ceiling from the motion generator onto the stronger renderer. The two models run as parallel causal streams, reaching 15.4 FPS at 1.3 s latency with no quality degradation.

cs.CV↗