Searcharxiv⌕ Search

arXiv subjects

Chen Zhou

Publications and source records attributed to Chen Zhou.

At least 37 records · Page 2Linked to original sources

Generalized Linear Models for Extremes: Estimation and Inference in High Dimensions

We propose a regression model for the extreme tail of a response variable, in which covariates rescale the tail without changing its shape. A single covariate-dependent function then characterizes the entire conditional tail, in contrast to extreme quantile regression, which targets a quantile at a pre-specified level. The tail shape itself is left unrestricted: heavy-, light- and short-tailed responses are covered by the same framework. We specify the function through a link function and a linear combination of the covariates, which is in the spirit of a generalized linear model. In estimation, we match the parametric specification to the underlying tail function under a Bregman divergence, over a region localized at the largest observations. The resulting loss is convex, and an $\ell_1$-penalty allows the number of covariates to exceed the effective sample size. The tail localization makes the asymptotic theory deviate from that for classical penalized generalized linear models. Only the tail observations selected by a random threshold are used in the statistical analysis, making them dependent. We derive the convergence rate of the penalized estimator and propose a debiased estimator that is asymptotically normal, yielding confidence intervals for individual coefficients. Its asymptotic variance is determined by the covariance of the score, which under tail localization differs from the Hessian and must be estimated separately. We apply the method to automobile insurance claims data.

stat.ME↗

Extending the Comisso-Asenjo Energy Extraction Mechanism to Pure Lovelock Gravity

In this paper, we extend the Comisso-Asenjo magnetic reconnection (MR) mechanism to rotating black holes (BHs) in pure Lovelock/Gauss-Bonnet (GB) gravity in dimension $2N+2\leq D\leq 4N+1$ (where $N$ is the Lovelock polynomial degree of $N$th order term in the action). We perform a comprehensive analysis of the efficiency and power of extracted energy by exploring the effects of the spin parameter, plasma magnetization, magnetic field orientation, and reconnection location. Our results reveal distinctive energetic features of pure Lovelock BHs relative to their Einstein counterparts, except in the special case of $D=3N+1$, where the two theories coincide. Our results demonstrate that magnetic reconnection becomes increasingly efficient in extracting rotational energy from rapidly rotating pure Lovelock BHs with single rotation configuration as the spacetime dimension increases from $D=6$ to $9$. Furthermore, the Comisso-Asenjo MR mechanism can produce higher extraction power than the Blandford-Znajek (BZ) process in certain regions of parameter space because of its enhanced energy extraction rate. These results show that magnetic reconnection is an efficient mechanism for extracting rotational energy from rapidly rotating pure Lovelock/GB BHs, highlighting their relevance to high-energy astrophysical phenomena.

gr-qc↗

JoyNexus: Service-Oriented Multi-Tenant Post-Training for VLA Models

The post-training of Vision-Language-Action (VLA) models is essential due to the diversity of simulators, robot embodiments, and task objectives. Existing compute services, whether offered as direct accelerator rental or batch-workload submission, typically allocate an exclusive set of GPU and CPU resources to a single tenant. While this paradigm maximizes client flexibility, it burdens users with infrastructure adaptation, and the fixed card-hour accounting model renders short or bursty workloads both expensive for tenants and inefficient for the service provider. To address these challenges, we present JoyNexus, a unified service for multi-tenant VLA supervised fine-tuning, reinforcement learning, and evaluation. JoyNexus decouples the Training Model Service, Inference Model Service, and Environment Service, each accessed through APIs and backed by resident shared base models with tenant-specific slots. Tenants can directly invoke high-level semantic APIs for training, rollout, and evaluation, or compose custom algorithms using lower-level APIs and their assigned endpoints. Multiple tenants submit workloads concurrently; their action modules, optimizers, rollout records, and policy versions remain isolated, and the service is scheduled by the global Training Queue and Inference Queue. To further improve multi-tenant training efficiency, JoyNexus introduces group batching for heterogeneous VLA data schemas that share a compatible model-facing prefix, enabling a single shared backbone forward pass over grouped samples. Finally, we evaluate JoyNexus through workload simulation and a group-batching pipeline in a realistic embodied scenario. Results show that, compared with isolated single-tenant execution, JoyNexus reduces aggregate GPU time and improves service utilization via cross-tenant scheduling on shared resources.

cs.DC↗

Anchored Geodesic Analysis for Multivariate Extremes

Extremal dependence is naturally described by the angular law of large multivariate observations. We introduce anchored geodesic component analysis (AGCA), a dimension-reduction method for extremal angular laws on the positive unit sphere. AGCA approximates angular variation by great subspheres constrained to pass through a chosen reference direction, with balanced complete dependence as the default anchor. Under a bounded sine-squared geodesic loss, the population and empirical problems reduce exactly to eigenanalysis of a second-moment matrix of anchored tangent departures. The resulting scores, loadings, residual risks and explained-variation summaries describe departures from the benchmark and remain well defined for face and near-axis extremes. Low-rank AGCA reconstructions also support tail simulation: bounded Lipschitz functionals and homogeneous tail scores, including portfolio capped excesses and value-at-risk, inherit explicit error bounds from the AGCA residual risk. We establish top-\(k\) consistency for oracle and rank-Pareto AGCA summaries and an oracle central limit theorem whose covariance is that of an independent sample from the limiting angular law. In daily equity-portfolio losses, AGCA finds concentrated benchmark-relative tail directions: ten components explain about \(91\%\) of anchored variation and approximate capped-excess and normalized value-at-risk summaries with about \(1.25\%\) average relative error.

stat.ME↗

Estimating probabilities of multivariate failure sets based on pairwise tail dependence coefficients

Estimating probabilities of extreme events involving multiple risk factors is a critical challenge in fields such as finance and climate science. This paper proposes a parametric approach to estimate the probability that a multivariate random vector falls into an extreme failure set, based on the information in the tail pairwise dependence matrix (TPDM) only. The TPDM provides a summary of tail dependence for all pairs of components of the random vector. We propose an efficient algorithm to obtain approximate completely positive decompositions of the TPDM, enabling the construction of a max-linear model whose TPDM approximates that of the original random vector. We also provide conditions under which the approximation turns out to be exact. Based on the decompositions, we can construct max-linear random vectors to estimate failure probabilities, exploiting their computational simplicity. We apply the proposed method to estimate probabilities of extreme events for real-world datasets, including industry portfolio returns and maximal wind speeds, demonstrating its practical utility for risk assessment.

stat.ME↗

Embodied Operators and Benchmarking: Toward Reusable and Deployable Embodied Intelligence Systems

Embodied intelligence systems require not only end-to-end policy models, but also reusable functional modules that transform multimodal observations, robot states, human demonstrations, and task contexts into structured representations, decisions, trajectories, control references, and system services. This work defines these modules as embodied operators and studies them as independent yet composable units in embodied intelligence pipelines. We clarify their definition boundary, emphasizing task semantics, standardized input-output contracts, deployability, reusability, and multi-layer optimizability. We further construct a taxonomy covering five categories: detection and segmentation, spatial localization and 3D understanding, hand motion recovery, embodied foundation models and task-decision operators, and planning, control, and system support operators. For each category, we summarize representative functions, technical paradigms, application roles, and practical limitations. Beyond taxonomy, we propose a multi-dimensional benchmark framework that evaluates embodied operators in terms of correctness, end-to-end efficiency, resource usage, temporal stability, portability, interface compatibility, deployment reliability, and downstream task utility. We also discuss workflow-level operator acceleration and open challenges in operator composition, data standardization, world models, VLA safety, edge deployment, and real-world application value. Overall, this work argues that embodied operators should be optimized and evaluated as holistic deployable components, providing a foundation for reusable, scalable, and verifiable embodied intelligence systems.

cs.AI↗

Quantum entanglement of photon pairs at proton-proton colliders

Diphoton systems, with photon polarizations measurable at low energies, serve as ideal qubits and were first used to demonstrate quantum entanglement. However, due to the current absence of dedicated polarimeters at high-energy colliders, the entanglement properties of diphoton systems remain largely unexplored at the high-energy frontier. Studying quantum entanglement at the high-energy frontier, where particle colliders serve as a natural relativistic laboratory, helps us better understand the quantum nature and seek new physics. In this letter, we propose a novel method to measure the entanglement of diphoton systems at proton-proton colliders. The photon spin analyzing power arises from the Bethe-Heitler process occurring in the tracker, where photons scatter off nuclei to produce electron-positron pairs whose joint angular distribution encodes the polarization of the diphoton system. Simulation results show that, under HL-LHC conditions, the statistical significance of quantum entanglement in the Higgs $\to γγ$ process is $0.007σ$, while measuring the continuum diphoton process $q\bar{q} \to γγ$ alone can reach about $1.5σ$.

hep-ph↗

UltraVR: A Diagnostic Ultra-Resolution Image-VQA Benchmark for Evidence-Grounded Reasoning

Vision-language models (VLMs) excel on visual question answering and multimodal reasoning benchmarks. Yet their capability on ultra-resolution images - where critical evidence is tiny, subtle, spatially distant, or distributed - remains unclear. Existing evaluations largely report final-answer accuracy, offering limited insight into whether models acquire and integrate the necessary visual evidence. We introduce UltraVR, a diagnostic benchmark for evidence-grounded visual reasoning over ultra-resolution images. UltraVR spans four high-value scenarios: CCTV surveillance, remote sensing (RS), whole-slide image (WSI) pathology, and industrial anomaly detection (AD). These domains pose complementary challenges: fine-grained object grounding in crowded CCTV scenes, long-range spatial comparison in RS, multi-scale evidence navigation in WSI, and subtle irregularity detection in repetitive industrial layouts. Beyond standard QA triples, each instance includes a structured ground-truth chain of thought with step-level questions, intermediate answers, and reasoning labels. These labels decompose reasoning into evidence grounding, local perception, quantification, evidence integration, and decision inference, enabling process-level diagnosis over black-box scoring. Using UltraVR, we evaluate frontier VLMs and show that current models remain far from reliable on ultra-resolution reasoning. Importantly, the structured annotations allow us to localize failures across the visual-to-decision pipeline: errors concentrate in evidence grounding and local perception, while downstream inference often recovers when intermediate visual facts are supplied. These findings demonstrate UltraVR as a diagnostic testbed for measuring not only whether VLMs answer correctly, but where their ultra-resolution reasoning process breaks.

cs.CV↗

Taming Real-World Space-Time Video Super-Resolution with One-Step Diffusion

Diffusion models have demonstrated exceptional success in video super-resolution (VSR), exhibiting powerful capabilities for generating fine-grained details. However, their potential for space-time video super-resolution (STVSR), which necessitates not only recovering realistic high-resolution visual content but also improving the frame rate with coherent temporal dynamics, remains largely underexplored. Moreover, existing STVSR methods predominantly address spatiotemporal upsampling under simple degradation assumptions, thus failing in real-world scenarios with complex unknown degradations. To address these challenges, we propose OSDEnhancer, the first framework that achieves robust STVSR in one-step diffusion. OSDEnhancer begins with a linear initialization to establish essential spatiotemporal structures and adapt the model for one-step reconstruction. It then applies a divide-and-conquer strategy, introducing the temporal coherence (TC) and texture enrichment (TE) LoRAs that progressively specialize in inter-frame dynamics modeling and fine-grained texture recovery, respectively, while collaborating during inference for enhanced overall performance. A bidirectional VAE decoder employs deformable recurrent blocks to leverage the multi-scale structure of the vanilla VAE, enhancing latent-to-pixel reconstruction through joint multi-scale deformable aggregation and inter-frame feature propagation. Experimental results demonstrate that the proposed method attains state-of-the-art performance with superior generalization in real-world scenarios. The code is available at https://github.com/W-Shuoyan/OSDEnhancer.

cs.CV↗

Learning from all particles in high-energy collisions

Particle colliders stand as an irreplaceable pillar of inquiry for exploring the fundamental building blocks of matter and forces of the Universe, yet fully decoding complex collision event information remains a significant challenge. Recent advances in artificial intelligence (AI) have revolutionized complex data analysis across scientific disciplines, inspiring novel strategies to extract the rich information embedded in collider events. Here we introduce two complementary concepts -- the holistic approach and Advanced Color Singlet Identification -- to enhance signal-background separation, which is a critical prerequisite for precise physics measurements. By leveraging all reconstructed particles and inferring their parentage via deep learning, these methods improve the precision of key Higgs physics benchmark measurements by up to sixfold and enable realistic prospects for observing rare Higgs decays previously deemed inaccessible. Our results demonstrate how integrating particle-level information with modern AI technologies can substantially boost the discovery potential of high-energy colliders, paving a new path to unravel the fundamental physical laws underlying particle physics experiments.

hep-ex↗

JoyAI-RA 0.1: A Foundation Model for Robotic Autonomy

Robotic autonomy in open-world environments is fundamentally limited by insufficient data diversity and poor cross-embodiment generalization. Existing robotic datasets are often limited in scale and task coverage, while relatively large differences across robot embodiments impede effective behavior knowledge transfer. To address these challenges, we propose JoyAI-RA, a vision-language-action (VLA) embodied foundation model tailored for generalizable robotic manipulation. JoyAI-RA presents a multi-source multi-level pretraining framework that integrates web data, large-scale egocentric human manipulation videos, simulation-generated trajectories, and real-robot data. Through training on heterogeneous multi-source data with explicit action-space unification, JoyAI-RA effectively bridges embodiment gaps, particularly between human manipulation and robotic control, thereby enhancing cross-embodiment behavior learning. JoyAI-RA outperforms state-of-the-art methods in both simulation and real-world benchmarks, especially on diverse tasks with generalization demands.

cs.RO↗

Probing Cosmic Ray Composition and Muon-philic Dark Matter via Muon Tomography

This work presents a novel cosmic-ray scattering experiment employing a Resistive Plate Chambers (RPC) muon tomography system. By introducing the scattering angle between incident and outgoing cosmic-ray tracks as a key observable, this approach enables simultaneous studies of secondary cosmic-ray composition and searching for new physics. During a 63-day campaign, 1.18 million cosmic ray scattering events were recorded and analyzed. By performing combined template fits to the observed angular distribution, particle abundances are measured -- for example, resolving the electron component at $\sim 2\%$ precision. Furthermore, constraints are established on elastic muon dark matter (DM) scattering cross-sections for muon-philic dark matter. At the $95\%$ confidence level, the limit reaches 1.61 $\times$ $10^{-17}$ $\rm{cm}^{2}$ for 1 GeV slow DM, demonstrating sensitivity limit to light muon-coupled slow DM, in scenarios where a strongly interacting dark matter component is captured and thermalized within the Earth, leading to large surface densities.

hep-ex↗

Graphical lasso for extremes

In this paper, we estimate the sparse dependence structure in the tail region of a multivariate random vector, potentially of high dimension. The tail dependence is modeled via a graphical model for extremes embedded in the Hüsler-Reiss distribution. We propose the extreme graphical lasso procedure to estimate the sparsity in the tail dependence, similar to the Gaussian graphical lasso in high dimensional statistics. We prove its consistency in identifying the graph structure and estimating model parameters. The efficiency and accuracy of the proposed method are illustrated by simulations and real data examples.

stat.ME↗

LoViF 2026 The First Challenge on Weather Removal in Videos

This paper presents a review of the LoViF 2026 Challenge on Weather Removal in Videos. The challenge encourages the development of methods for restoring clean videos from inputs degraded by adverse weather conditions such as rain and snow, with an emphasis on achieving visually plausible and temporally consistent results while preserving scene structure and motion dynamics. To support this task, we introduce a new short-form WRV dataset tailored for video weather removal. It consists of 18 videos 1,216 synthesized frames paired with 1,216 real-world ground-truth frames at a resolution of 832 x 480, and is split into training, validation, and test sets with a ratio of 1:1:1. The goal of this challenge is to advance robust and realistic video restoration under real-world weather conditions, with evaluation protocols that jointly consider fidelity and perceptual quality. The challenge attracted 37 participants and received 5 valid final submissions with corresponding fact sheets, contributing to progress in weather removal for videos. The project is publicly available at https://www.codabench.org/competitions/13462/.

cs.CV↗

Traffic-Aware Domain Partitioning and Load-Balanced Inter-Domain Routing for LEO Satellite Networks

Low Earth Orbit (LEO) satellite networks provide global coverage and low latency, yet high node mobility, uneven traffic distribution, and stochastic link failures pose severe challenges for inter-domain routing. Existing approaches either neglect graph-structured topology or lack dynamic awareness of real-time link states, struggling to balance load distribution and routing reliability. This paper proposes DTAR, a traffic-aware deep reinforcement learning approach for inter-domain routing in LEO satellite networks. A multi-objective NSGA-II algorithm first generates an offline domain partition maximizing intra-domain traffic ratio and minimizing load imbalance. A Graph Attention Network dynamically encodes inter-domain link traffic intensity, load distribution, and fault status, upon which an action-masked PPO agent learns routing decisions online. Simulations on a 288-satellite Walker constellation against multiple baselines demonstrate that DTAR significantly reduces link load imbalance and end-to-end delay, while improving routing success rate and reducing packet loss rate across normal, traffic surge, and fault scenarios.

cs.NI↗

All Block Maxima method for estimating the extreme value index

The block maxima (BM) approach in extreme value analysis fits a sample of block maxima to the Generalized Extreme Value (GEV) distribution. We consider all potential blocks from a sample, which leads to the All Block Maxima (ABM) estimator. Different from existing estimators based on the BM approach, the ABM estimator is permutation invariant. We show the asymptotic behavior of the ABM estimator, which has the lowest asymptotic variance among all estimators using the BM approach. Simulation studies justify our asymptotic theories. A key step in establishing the asymptotic theory for the ABM estimator is to obtain asymptotic expansions for the tail empirical process based on higher order statistics with weights.

math.ST↗

Trends in tail dependence of heteroscedastic extremes

We consider multivariate extreme value statistics for independent but nonidentically distributed random vectors. In particular, the data may have varying tail copulas and also heteroscedastic marginal distributions. Assuming smoothly changing tail copulas, we propose a nonparametric estimator for the integrated tail copula and establish its asymptotic behavior. Notably, the heteroscedastic marginals do not affect the limiting processes. We use the main result for the integrated tail copula to test for a constant tail copula across all observations. Finally, a simulation study shows the good finite-sample behavior of our limit theorems as well as high power of the test.

math.ST↗

Thousand-GPU Large-Scale Training and Optimization Recipe for AI-Native Cloud Embodied Intelligence Infrastructure

Embodied intelligence is a key step towards Artificial General Intelligence (AGI), yet its development faces multiple challenges including data, frameworks, infrastructure, and evaluation systems. To address these issues, we have, for the first time in the industry, launched a cloud-based, thousand-GPU distributed training platform for embodied intelligence, built upon the widely adopted LeRobot framework, and have systematically overcome bottlenecks across the entire pipeline. At the data layer, we have restructured the data pipeline to optimize the flow of embodied training data. In terms of training, for the GR00T-N1.5 model, utilizing thousand-GPU clusters and data at the scale of hundreds of millions, the single-round training time has been reduced from 15 hours to just 22 minutes, achieving a 40-fold speedup. At the model layer, by combining variable-length FlashAttention and Data Packing, we have moved from sample redundancy to sequence integration, resulting in a 188% speed increase; π-0.5 attention optimization has accelerated training by 165%; and FP8 quantization has delivered a 140% speedup. On the infrastructure side, relying on high-performance storage, a 3.2T RDMA network, and a Ray-driven elastic AI data lake, we have achieved deep synergy among data, storage, communication, and computation. We have also built an end-to-end evaluation system, creating a closed loop from training to simulation to assessment. This framework has already been fully validated on thousand-GPU clusters, laying a crucial technical foundation for the development and application of next-generation autonomous intelligent robots, and is expected to accelerate the arrival of the era of human-machine integration.

cs.RO↗