Searcharxiv⌕ Search

arXiv subjects

Zhou Wang

Publications and source records attributed to Zhou Wang.

At least 19 recordsLinked to original sources

Turing LLM Post-Training: Calibrated Distillation and Efficient Dynamic-MoE Execution

We study post-training for dynamically routed mixture-of-experts (MoE) models, focusing on integrating independently optimized specialists while keeping consolidation efficient. Our approach combines calibrated multi-teacher on-policy distillation (C-MOPD), which matches each selected teacher on a local Top-$K$ support with teacher-wise loss normalization and clipping, with an execution path that uses post-capacity bounded-width dispatch, final-route replay, and asynchronous rollout--training overlap. On Turing-20B-A2B, the selected model achieves a four-domain normalized integration score of 0.9988 and retains at least 90.16\% of the measured specialist gain in every domain. At matched $K=32$, the full calibration objective scores 0.9962, compared with 0.9724 without calibration and 0.9834 without clipping. At a matched 8K response cap, the model exceeds both shared SFT and Qwen3-8B on all four reasoning-enabled mathematics and code benchmarks (unweighted mean: 85.92, versus 80.33 for Qwen3-8B and 74.21 for SFT), and improves over SFT on ten of twelve broader evaluation metrics. In a PPU-based profile, the combined execution configuration reduces consolidation step time from 398.7 to 139.3 seconds, an observed 2.86$\times$ speedup over serial execution. These results demonstrate strong specialist integration alongside more efficient consolidation, while reflecting the complete training and execution framework rather than any single component.

cs.LG↗

Prior-Guided Single-Exposure HDR Novel View Synthesis via Base-Gain Representation

Single-exposure high dynamic range (HDR) novel view synthesis (NVS) recovers HDR scenes from low dynamic range (LDR) views captured at a single exposure and estimates camera response function (CRF) for LDR re-exposure. Without HDR ground-truth, using single-exposure LDR views as the sole source of direct supervision underconstrains HDR reconstruction and cannot ensure its faithful recovery, motivating the need for learned LDR-to-HDR reconstruction priors. Moreover, single-exposure LDR views supervise CRF only over a limited range, necessitating a learnable prior for reliable re-exposure beyond it. We propose PriorGS, a 3D Gaussian Splatting framework that addresses both challenges by (1) guiding HDR recovery with pseudo-HDR supervision from 2D single-exposure HDR reconstruction methods while anchoring it to input LDR views through a closed reconstruction loop; and (2) regularizing CRF modeling with a learnable prior that guarantees monotonicity and promotes plausible responses. Yet cross-view inconsistencies in independently generated pseudo-HDR targets impair scene reconstruction when HDR is encoded directly as Gaussian's color attribute. We therefore introduce a 3D base-gain HDR representation that factors HDR radiance into an LDR base and an overlaid 3D gain field, promoting robustness to such inconsistencies and enabling 3D HDR appearance editing. Extensive experiments demonstrate PriorGS's substantial superiority over baselines.

cs.CV↗

RubricOpt: Self-Revision of Semantic Rubrics for Preference Optimization

A model's failures can reveal gaps in the behavioral criteria guiding its training. We introduce RubricOpt, a framework that lets a policy revise these criteria within preference optimization. The policy diagnoses its own rubric-free outputs, retains requirements already covered by the rubric, and edits clauses that leave recurring failures unaddressed. A shared semantic representation connects task demands, preference-data contrasts, and rubric clauses, while a deterministic gate checks evidence references and fixed semantic anchors. The rubric then guides Direct Preference Optimization (DPO) during training, with preference pairs, labels, and the objective held fixed, and is removed at evaluation. Our analysis relates the local effect on rubric-free success to semantic alignment and a residual beyond the measured factors. Experiments on capability and open-ended generation benchmarks show that rubric conditioning can improve outcomes over ordinary DPO, with gains and regressions varying across models and datasets. A matched continuation isolates the contribution of revision from additional training and finds mixed incremental effects for the tested edit, whose feedback overlaps the evaluation set. RubricOpt thus brings the behavioral specification itself into the policy's feedback loop.

cs.AI↗

The throttling refrigeration system for high cooling power recovery of the PandaX-xT cryogenic distillation system for radon removal

The PandaX-xT cryogenic distillation system for removing radon (Rn) is designed to operate at a high liquid flow rate of 856 kg/h, equal to 5 liters per minute (LPM), to meet the required Rn concentration. However, it is challenging to maintain a continuous supply of cooling power (20 kW) for the Rn-removal system. This work proposes a throttling refrigeration system to address the power supply problem for the next-generation PandaX-xT dark matter detection experiment. The system utilizes carbon tetrafluoride (R14) refrigerant to recover power based on heat pump principles. The cooling power from the liquid xenon (LXe) in the reboiler at 178 K is transferred to liquefy the gaseous xenon (GXe) in the cryostat through the phase change circulation of R14, enabling xenon (Xe) to return to the detector in the same state as when it was extracted. Consequently, a stable circulation for liquid distillation is established. Given the high cost of Xe, a research and development (R&D) experiment has been conducted to validate the feasibility of this high-cooling-recovery system by using ethanol as a substitute for Xe. Experimental results indicate that the proposed system could achieve a cooling power recovery of 25 kW, with a recovery efficiency of 99%+-0.5%. Additionally, process simulation and optimization of the throttling refrigeration cycle are performed using Aspen Hysys. The deviation between the simulation and experimental results is found to be <3.64%. These findings demonstrate that implementing Rn-removal distillation at a high flow rate is feasible, eliminating the need for liquid nitrogen or cryocoolers. This system could save approximately 3650 m3 of liquid nitrogen per year or reduce power consumption by 230 kW.

physics.ins-det↗

AdaptDuplex: From Static to Adaptive Full-Duplex Spoken Dialogue

Full-duplex spoken dialogue requires simultaneous listening and speaking at sub-second latency, under conversational timing and cognitive demands that change moment to moment. Yet current models mostly impose static operating points, lacking a systematic mechanism for adaptive decisions. We present AdaptDuplex, which extends Qwen3-Omni with such a mechanism, co-designed across three layers. A compact token-level protocol represents every window as a canonical sequence, trains dual-stream alignment through a bounded text lead over speech, and exposes every behavioral decision as an explicit token for training-free runtime control via logits bias. Adaptive mechanisms dynamically predict among discrete window durations and augment direct response as needed with non-blocking cognitive consolidation and multi-flight external reasoning. A progressive pipeline introduces these behaviors through a three-stage Thinker curriculum, then Talker-only and joint SFT, with GRPO as a preliminary increment. On Full-Duplex-Bench v1 and v1.5, AdaptDuplex outperforms DuplexOmni on 18 of 21 comparable turn-taking, overlap-behavior, and timing metrics and MiniCPM-o 4.5 on 19 of 22, with gains in both interaction decisions and response timing. On human-recorded HumDial-FDBench, it attains the top Final score (69.6) of the compared duplex models.

cs.SD↗

Anytime-Valid LLM Leaderboards via Benchmark-weighted and Block-Factorized e-Processes

Large language model (LLM) leaderboards compare model capabilities by ranking models according to their mean performance on fixed benchmarks. However, variability in evaluation outcomes across runs may produce unsupported claims of model superiority on the benchmark, a risk compounded by leaderboard updates. In this paper, we propose BB-EDGE (Benchmark-Weighted and Block-Factorized e-processes for Directed Graph Evaluation), a principled framework that represents an LLM leaderboard as a directed graph whose edges certify pairwise mean-performance advantages, with anytime-valid family-wise error rate (FWER) control. Concretely, for each direction, BB-EDGE constructs an empirical-Bernstein e-process by factorizing evidence over protocol-defined blocks and assigning stakes proportional to the corresponding block weights, then applies direct e-Holm across these $e$-processes to certify directional advantages as edges. Theoretically, we characterize weight-proportional linear stakes under heterogeneous benchmark-average nulls and prove anytime FWER control under arbitrary within-block and cross-pair dependence. BB-EDGE further supports anytime-valid Top-$k$ certification and simultaneous rank intervals. Extensive experiments on synthetic data and four real-world benchmarks demonstrate that BB-EDGE maintains anytime FWER control while achieving high efficiency.

cs.LG↗

Component Benchmark: Hierarchical Model Profiling for Large-scale Recommendation Systems

Large-scale recommendation models pose distinct, under-explored profiling challenges. Most recommendation model architectures are structurally heterogeneous, intermixing memory-bandwidth-bound operations, small compute-bound dense layers, dynamic shapes from jagged categorical features, and low-arithmetic-intensity operations. Recommendation models evolve rapidly as modeling engineers experiment with compositions, often written without visibility into hardware execution characteristics. Standard profiling tools offer either end-to-end throughput or operator-level traces, but cannot attribute performance to the submodules that practitioners reason about. We present Component Benchmark (CB), a profiling system that independently characterizes each submodule performance in a hierarchical manner, providing a tree-structured, interactive visualization that brings performance clarity to ML practitioners. At its core, CB provides a simple yet extensible, submodule-based benchmarking framework with a plugin architecture that enables hierarchical performance analysis. These large-scale recommendation models are TB-scale, run on thousands of GPUs and ingest 100B examples per day. We demonstrate CB's effectiveness on common open sourced models and discuss how CB has been leveraged to accelerate modern recommendation model performance analysis and optimization.

cs.IR↗

DuplexDrama: A Synthesized Dialogue Dataset with Scenarios, Full-Duplex Behaviors, Expressive Speech, and Sound Events

We present DuplexDrama, the first synthesized spoken dialogue dataset that simultaneously covers four dimensions: (i) complete persona and scenario settings; (ii) three full-duplex behaviors (interruption, backchannel, incomplete); (iii) expressive speech with persona-aligned emotion labels; and (iv) script-aware sound events. DuplexDrama is built via a 4-stage pipeline; quality validation on both scripts and synthesized audio confirms its quality. We have produced more than 2,000 hours audio data with a 64-voice timbre pool spanning 13 personas and 5 age buckets; 3.8% of all turns carry at least one full-duplex behavior. This data has been validated through internal full-duplex model training. We will release a curated subset of 6,400 bilingual dialogues (800 h, Chinese ~500 h + English ~300 h) to advance full-duplex spoken dialogue model research. Data samples are available at our demo page and LLM-judge evaluation prompts will be released with the dataset.

cs.CL↗

Same Words, Different Actions: Paired Turn-Taking Evaluation under Rewritten Dialogue Contexts

Real-time spoken dialogue systems must distinguish interruptions that require yielding the floor from backchannels that permit continued speaking. Existing benchmarks typically score events independently and may therefore assign high scores to systems with fixed action preferences rather than context-sensitive decision policies. We introduce ECHO, a paired diagnostic benchmark for Chinese turn-taking evaluation. ECHO pairs examples with the same overlap transcript but contrasting preceding multi-turn dialogue contexts, with one requiring Yield and the other Keep. It additionally includes off-talk examples for diagnosing unnecessary yielding. We introduce pair accuracy, which requires correct decisions on both members of a pair and assigns no credit to constant-action policies. Experiments on four speech systems show that three exhibit a severe over-yielding bias: they correctly keep the floor on fewer than 13% of backchannels, resulting in near-zero pairwise success rates equal or less than 4%. While the remaining system remains comparatively balanced across contexts, these findings broadly demonstrate that interruption-only evaluation can severely overestimate practical turn-taking reliability.

cs.CL↗

Unifying Image Quality Assessment Datasets: MOSAIQ-500K and MOSAIQ-Bench

Image quality assessment (IQA) datasets use different subjective protocols and rating scales, so their scores are not directly comparable. The lack of a common perceptual scale hinders multi-dataset training and precludes direct inter-dataset evaluation. We address this by conducting a new subjective experiment and using its ratings as perceptual anchors to fit monotonic mappings that place the existing scores of 23 IQA datasets on a common quality scale while preserving within-dataset rankings. The resulting dataset, MOSAIQ-500K, contains over 500,000 images and is, to our knowledge, the largest IQA dataset with perceptually aligned subjective scores. We also propose MOSAIQ-Bench, an inter-dataset benchmark, and use it to evaluate 31 IQA methods, revealing substantial gaps between intra- and inter-dataset performance, particularly on authentic distortions. The aligned scores offer a key advantage: replacing specialized multi-dataset training mechanisms with standard regression losses yields comparable intra-dataset accuracy and better inter-dataset performance. MOSAIQ thus provides a practical foundation for combining heterogeneous IQA datasets to train more generalizable IQA models. Code and dataset will be made public at ivc.uwaterloo.ca/projects/unifying_iqa_datasets/ upon acceptance.

eess.IV↗

Weighted Endpoint Variational and Jump Inequalites for Rough Singular Integrals

In this present paper, we study the weighted weak type $(1,\,1)$ bounds for rough maximal singular integral operators as well as the the corresponding variation and jump operators. Our first result is the weighted weak type $(1,\,1)$ bound for the maximal singular integral $$T_Ω^{*}f(x)=\sup\limits_{\varepsilon>0}|T_{\varepsilon,Ω}f(x)|=\sup\limits_{\varepsilon>0}\bigg|\int_{|x-y|>\varepsilon} \frac{Ω(x-y)}{|x-y|^{d}}f(y)dy\bigg|,$$ where $Ω\in L^\infty(\mathbb{S}^{d-1})$, homogeneous of degree zero, and satisfies the cancellation condition. We show that $$\|T_Ω^{*}\|_{L^1(w)\rightarrow L^{1,\infty}(w)}\lesssim[w]_{A_1}[w]_{A_\infty}\log([w]_{A_\infty}+1),$$ where $w$ belongs to the Muckenhoupt class $A_1(\mathbb{R}^d)$. This represents an essential improvement of a result (Honz\'ık, Inter.Math. Res. Not. 2020) and a result (Bhojak and Mohanty, J. Funct. Anal.2023). Our second one is the weighted weak type $(1,\,1)$ bounds for variation and jump operators corresponding to $\{T_{\varepsilon,Ω}\}_{\varepsilon\in2^{\mathbb{Z}}}$ and $\{T_{\varepsilon, Ω}^ϕ\}_{\varepsilon\in\mathbb{R}^{+}}$ under the condition $Ω\in L^\infty(\mathbb{S}^{d-1})$, where $T_{ε,Ω}^ϕ$ represents a smooth truncation of rough singular integral operator.These results of this part are the first weighted weak type $(1,\,1)$ variation inequalities and jump inequalities for rough singular integrals.

math.CA↗

Search for neutrinoless quadruple beta decay of $^{136}$Xe in PandaX-4T detector

The observation of neutrinoless quadruple beta decay (0$ν$4$β$) in the absence of neutrinoless double beta decay (0$ν$2$β$) has been argued to provide a strong indication that neutrinos are Dirac particles. We report a search for 0$ν$4$β$ decay of $^{136}\text{Xe}$ using a total $^{136}\text{Xe}$ exposure of 148.4 kg$\cdot$yr, collected during the commissioning and the first science runs of the PandaX-4T experiment. No significant excess of events over the background is observed. A lower limit on the 0$ν$4$β$ decay half-life of $^{136}\text{Xe}$ is set at 6.01 x $10^{24}$ yr at the 90% confidence level. This result establishes the most stringent constraint on this process in xenon, demonstrating the unique capability of the PandaX-4T detector in probing lepton number violation and shedding light on the fundamental nature of neutrinos.

nucl-ex↗

GC360IQ: Generic-to-Individualized Quality Assessment for Stitched 360-Degree Panoramas

Existing image quality assessment (IQA) methods typically predict mean opinion scores (MOSs) but struggle to capture variations in individual subject behaviors. This limitation is highly pronounced in immersive visual applications such as stitched 360-degree panoramas, where user opinions diverge drastically based on personal sensitivity to blending-induced luminance inconsistency, detail loss, and geometric misalignment. Here we propose GC360IQ, a novel Generic-to-Individualized IQA framework that establishes a learned explicit feature space to characterize individual subject behaviors. First, we construct a specialized 360-degree panorama database focusing on blending-induced luminance and detail degradation while minimizing geometric misalignment, providing multidimensional quality ratings alongside complete individual scores. Second, we develop a generic quality model that utilizes unblended views as a perceptual reference. Dual feature extraction branches capture gradient and structural information specifically around stitching regions to predict baseline quality. Third, we construct a compact preference embedding space that acts as an explicit feature domain to model each subject's deviation from generic quality perceptions. We also introduce a maximum a posteriori (MAP) adaptation mechanism. By leveraging a preference prior learned within our explicit feature space, a new subject's unique behavioral embedding is mapped progressively with an increasing number of anchor ratings. Experiments demonstrate that the generic model provides accurate stitching quality predictions and that subject adaptation further improves individual score predictions. Deeper analysis of the collected ratings and learned embeddings reveals that observer differences contain structured variation related to scoring tendencies and sensitivity to stitching artifacts, rather than merely random rating noise.

eess.IV↗

Towards Disentangled Preference Optimization Dynamics: Suppress the Loser, Preserve the Winner

Preference optimization is widely used to align large language models (LLMs) with human preferences. However, many margin-based methods also suppress the chosen response when they try to suppress the rejected one, and there is no general way to prevent this across different objectives. We address this issue with a unified incentive-score decomposition of preference optimization, revealing that different objectives share the same local update directions and differ only in their scalar weights. This decomposition provides a common framework for analyzing objectives that were previously studied in separate settings. Building on this decomposition, by analyzing the dynamics of the chosen/rejected likelihoods, we identify the disentanglement band (DB), a simple, testable condition that tells us when training can follow the desired path: suppress the loser while preserving the winner, possibly after an early stage. Using the DB, we propose reward calibration (RC), a plug-and-play method that adaptively rebalances the updates for chosen and rejected responses to satisfy the DB, without redesigning the base objective. Empirical results show that RC leads to more disentangled dynamics, with better downstream performance observed across several settings. Our code is available at https://github.com/IceyWuu/DisentangledPreferenceOptimization.

cs.LG↗

Measurement of solar $pp$ neutrino flux with the new PandaX-4T data

We report a new measurement of the solar proton--proton ($pp$) neutrino flux via neutrino--electron elastic scattering using the PandaX-4T Run 2 data set collected between 2024 and 2026, corresponding to an exposure of 1.9 tonne$\cdot$yr. Before Run 2 data taking, the detector underwent a series of upgrades to improve its response and background conditions. Time variations of radioactive noble-gas impurities are constrained using the physics data themselves, complemented by measurements from the gas-assay system. The analysis introduced improvements in the data processing chain, detector response characterization, and background models. A blind spectral analysis was then performed on the electronic-recoil data across a wide energy range from 20 to 1000 keV. In combination with the Run 0 data published earlier, the fitted $pp$ flux is $(8.5 \pm 3.5)\times 10^{10}$ $\mathrm{cm^{-2}s^{-1}}$, consistent with the prediction of the Standard Solar Model. With a statistical significance of $2.2σ$ above background, this marks the first positive indication of solar $pp$ neutrino--electron scattering below an electronic-recoil energy of 165 keV.

hep-ex↗

Generated Contents Enrichment

We study Generated Contents Enrichment (GCE), a conditional image-generation task in which a sparse scene description is first enriched through an explicit scene representation and then rendered into semantically richer visual content. Conventional image-generation systems can produce visually realistic outputs from limited scene descriptions, but the added content is usually implicit in the generator rather than represented as an inspectable intermediate structure. In contrast, GCE seeks to make scene enrichment explicit at the scene-representation level while examining its visual consequences during generation, with the goal of encouraging generated content that is visually plausible, structurally coherent, and semantically richer than the sparse input. To instantiate GCE, we propose a jointly trained adversarial framework that enriches scene graphs by modeling object semantics and inter-object relations. Our approach first represents the input description as a scene graph, where nodes model objects and edges capture inter-object relations. The framework uses graph convolutional networks to predict additional objects and their relations to the existing scene. Finally, the enriched scene graph is passed through the downstream image-generation pipeline to generate the corresponding visual content. We evaluate the framework with proxy scene graph enrichment metrics, image-quality comparisons, qualitative examples, and user studies on the Visual Genome dataset.

cs.CV↗

Boosting Image Quality Assessment Performance: Unsupervised Score Fusion by Deep Maximum a Posteriori Estimation

Over the past decades, numerous Image Quality Assessment (IQA) models have emerged, aiming to predict the perceptual quality of images. However, individual models are often biased toward certain types of image content or distortions, depending on the design principle and process. An intuitive idea is to harness the strengths and mitigate the weaknesses of each IQA model, by fusing the scores of multiple models into a stronger one. Here we make one of the first attempts to seek an optimal solution for the idea and propose a general framework for unsupervised IQA score fusion using deep Maximum a Posteriori (MAP) estimation. The proposed model conducts fine-grained uncertainty estimation at the score level to increase the accuracy and reduce the uncertainty in fused predictions. Comprehensive experiments demonstrate the superiority of the proposed model over individual IQA models and other fusion methods. It also exhibits an interesting capability of rejecting ``bad" models in the fusion process.

cs.CV↗

Probing scalar-neutrino and scalar-dark-matter interactions with PandaX-4T

Scalar-mediated interactions may exist among neutrinos, dark matter particles, or between the two. Double $β$-decay experiments provide a powerful tool to probe such exotic interactions. Using $^{136}$Xe double $β$-decay data from PandaX-4T, we perform the first direct spectral search in the energy range of 20 to 2800~keV, setting the most stringent limits to date on scalar-mediated neutrino self-interactions for mediator masses below 2~MeV$/c^2$. These results place significant constraints on models invoking such interactions to alleviate the Hubble Tension. Assuming the same scalar also mediates dark matter self-interactions, constraints on the dark matter-scalar interactions can be placed in conjunction with cosmological constraints.

hep-ex↗