Researcher profile

Long Chen

Long Chen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author

104works

0followers

35topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

Adam-SHANG: A Convergent Adam-Type Method for Stochastic Smooth Convex Optimization

We propose Adam-SHANG, a Lyapunov-guided Adam-type method that couples momentum, adaptive preconditioning, and a curvature-aware correction through a more stable lagged-preconditioner update. For stochastic smooth convex optimization, we prove convergence in expectation under an admissible stepsize condition that can always be satisfied by a conservative spectral bound, without imposing global monotonicity on the second-moment sequence. To obtain a less conservative practical rule, we introduce a computable trace-ratio stepsize, motivated by a local coordinatewise alignment condition. The same structural update is also tested beyond the convex setting with simplified parameters. Experiments validate the predicted stochastic decay and show competitive training performance against Adam and AdamW on deep learning tasks.

preprint2026arXiv

An Enigmatic PeVatron in an Area around HII Region G35.6$-$0.5

Identifying Galactic PeVatrons (PeV particle accelerators) from the ultra-high-energy (UHE, >100 TeV) $γ$-ray sources plays a crucial role in revealing the origin of Galactic cosmic rays. The UHE source 1LHAASO J1857+0203u is suggested to be associated with HESS J1858+020, which may be attributed to the possible PeVatron candidate supernova remnant (SNR) G35.6$-$0.4 or HII region G35.6$-$0.5. We perform detailed analysis on the very-high-energy and UHE $γ$-ray emissions towards this region with data from the Large High Altitude Air Shower Observatory (LHAASO). 1LHAASO J1857+0203u is detected with a significance of 11.6$σ$ above 100 TeV, indicating the presence of a PeVatron. It has an extension of $\sim 0.18^\circ$ with a power-law (PL) spectral index of $\sim$2.5 in 1-25 TeV and a point-like emission with a PL spectral index of $\sim$3.2 above 25 TeV. Using the archival CO and HI data, we identify some molecular and atomic clouds that may be associated with the TeV $γ$-ray emissions. Our modelling indicates that the TeV $γ$-ray emissions are unlikely to arise from the clouds illuminated by the protons that escaped from SNR G35.6$-$0.4. In the scenario that HII region G35.6$-$0.5 could accelerate particles to the UHE band, the observed GeV-TeV $γ$-ray emission could be well explained by a hadronic model with a PL spectral index of $\sim$2.0 and cutoff energy of $\sim$450 TeV. However, an evolved pulsar wind nebula origin cannot be ruled out.

preprint2026arXiv

An Ultrahigh-energy $γ$-ray Bubble Powered by a Super PeVatron

We report the detection of a $γ$-ray bubble spanning at least 100$\rm deg^2$ in ultra high energy (UHE) up to a few PeV in the direction of the star-forming region Cygnus X, implying the presence Super PeVatron(s) accelerating protons to at least 10 PeV. A log-parabola form with the photon index $Γ(E) = (2.71 \pm 0.02) + (0.11 \pm 0.02) \times \log_{10} (E/10 \ {\rm TeV})$ is found fitting the gamma-ray energy spectrum of the bubble well. UHE sources, `hot spots' correlated with very massive molecular clouds, and a quasi-spherical amorphous $γ$-ray emitter with a sharp central brightening are observed in the bubble. In the core of $\sim 0.5^{\circ}$, spatially associating with a region containing massive OB association (Cygnus OB2) and a microquasar (Cygnus X-3), as well as previously reported multi-TeV sources, an enhanced concentration of UHE $γ$-rays are observed with 2 photons at energies above 1 PeV. The general feature of the bubble, the morphology and the energy spectrum, are reasonably reproduced by the assumption of a particle accelerator in the core, continuously injecting protons into the ambient medium.

preprint2026arXiv

AnyMS: Bottom-up Attention Decoupling for Layout-guided and Training-free Multi-subject Customization

Multi-subject customization aims to synthesize multiple user-specified subjects into a coherent image. To address issues such as subjects missing or conflicts, recent works incorporate layout guidance to provide explicit spatial constraints. However, existing methods still struggle to balance three critical objectives: text alignment, subject identity preservation, and layout control, while the reliance on additional training further limits their scalability and efficiency. In this paper, we present AnyMS, a novel training-free framework for layout-guided multi-subject customization. AnyMS leverages three input conditions: text prompt, subject images, and layout constraints, and introduces a bottom-up dual-level attention decoupling mechanism to harmonize their integration during generation. Specifically, global decoupling separates cross-attention between textual and visual conditions to ensure text alignment. Local decoupling confines each subject's attention to its designated area, which prevents subject conflicts and thus guarantees identity preservation and layout control. Moreover, AnyMS employs pre-trained image adapters to extract subject-specific features aligned with the diffusion model, removing the need for subject learning or adapter tuning. Extensive experiments demonstrate that AnyMS achieves state-of-the-art performance, supporting complex compositions and scaling to a larger number of subjects.

preprint2026arXiv

AttriLens-Mol: Attribute Guided Reinforcement Learning for Molecular Property Prediction with Large Language Models

Large Language Models (LLMs) have shown promise in assisting molecular property prediction tasks but often rely on human-crafted prompts and chain-of-thought templates. While recent advanced large reasoning models like DeepSeek-R1 employ reinforcement learning for an extended ``thinking'' process, their reasoning can be verbose and lack relevance. We introduce AttriLens-Mol, an attribute-guided reinforcement learning framework for molecular property prediction with LLMs. AttriLens-Mol steers the model's reasoning by using: (1) a format reward encouraging attribute-based structured output, (2) a count reward to avoid enumerating irrelevant attributes, and (3) a rationality reward using advanced LLMs and RDKit to verify the relatedness of the generated attributes. This approach implicitly elicits the model's inherent knowledge of relevant molecular attributes during reasoning, enables making predictions for the molecular property more effectively. Experiments on both in-distribution and out-of-distribution datasets show that, training both 7B-size R1-Distilled-Qwen2.5 and R1-Distilled-LLaMA3.1 models on 4,000 samples with our proposed AttriLens-Mol method significantly boosts the performance, getting comparable or better results than supervised fine-tuning models (Mol-Instructions, ChemDFM, etc.) and advanced models (GPT-3.5, GPT-4o, DeepSeek-V3, DeepSeek-R1, etc.). Further, our extracted attributes for the target property, when used as features for an interpretable decision tree model, yield superior performance compared to attributes generated by prompting LLMs. This shows that AttriLens-Mol effectively elicits more relevant and predictive molecular attributes, leading to enhanced interpretability and performance for property prediction. We release the code in https://github.com/szu-tera/AttriLens-Mol.

preprint2026arXiv

Beyond Imitation: Learning Safe End-to-End Autonomous Driving from Hard Negatives

Existing imitation learning methods for end-to-end autonomous driving predominantly learn from successful demonstrations by minimizing geometric deviations from expert trajectories. This paradigm implicitly assumes that spatial proximity implies behavioral safety, leading to a critical objective mismatch: trajectories with nearly identical imitation losses may exhibit drastically different safety outcomes, where one remains recoverable while the other results in collision. To address this limitation, we propose BeyondDrive, a failure-aware imitation learning framework that jointly learns from successful and failed driving behaviors. First, we introduce a flow matching-based negative trajectory generator that synthesizes safety-critical yet expert-proximate trajectories, enabling explicit modeling of safety asymmetry. Second, we develop a diversity-aware sampling strategy that mitigates mode collapse and improves coverage of diverse failure modes during negative trajectory generation. Third, we propose a Repulsive Distance Loss that simultaneously attracts predictions toward expert demonstrations while repelling them from hard negative trajectories, thereby establishing discriminative safety boundaries in trajectory space. Applied to the uni-modal baseline Latent TransFuser, BeyondDrive achieves 89.7 PDMS on the NAVSIMv1 closed-loop benchmark, outperforming prior state-of-the-art methods. Moreover, BeyondDrive generalizes effectively across different autonomous driving architectures, including multi-modal planners, and further demonstrates strong zero-shot transferability on the HUGSIM benchmark.

preprint2026arXiv

Compositional Feature Augmentation for Unbiased Scene Graph Generation

Scene Graph Generation (SGG) aims to detect all the visual relation triplets $<$\texttt{sub}, \texttt{pred}, \texttt{obj}$>$ in a given image. With the emergence of various advanced techniques for better utilizing both the intrinsic and extrinsic information in each relation triplet, SGG has achieved great progress over the recent years. However, due to the ubiquitous long-tailed predicate distributions, today's SGG models are still easily biased to the head predicates. Currently, the most prevalent debiasing solutions for SGG are re-balancing methods, \eg, changing the distributions of original training samples. In this paper, we argue that all existing re-balancing strategies fail to increase the diversity of the relation triplet features of each predicate, which is critical for robust SGG. To this end, we propose a novel Compositional Feature Augmentation (\textbf{CFA}) strategy, which is the first unbiased SGG work to mitigate the bias issue from the perspective of increasing the diversity of triplet features. Specifically, we first decompose each relation triplet feature into two components: intrinsic feature and extrinsic feature, which correspond to the intrinsic characteristics and extrinsic contexts of a relation triplet, respectively. Then, we design two different feature augmentation modules to enrich the feature diversity of original relation triplets by replacing or mixing up either their intrinsic or extrinsic features from other samples. Due to its model-agnostic nature, CFA can be seamlessly incorporated into various SGG frameworks. Extensive ablations have shown that CFA achieves a new state-of-the-art performance on the trade-off between different metrics.

preprint2026arXiv

Constraining the Cosmic-ray Energy Based on Observations of Nearby Galaxy Clusters by LHAASO

Galaxy clusters act as reservoirs of high-energy cosmic rays (CRs). As CRs propagate through the intracluster medium, they generate diffuse $γ$-rays detectable by arrays such as LHAASO. These $γ$-rays result from proton-proton ($pp$) collisions of very high-energy cosmic rays (VHECRs) or inverse Compton (IC) scattering of positron-electron pairs created by $pγ$ interactions of ultra-high-energy cosmic rays (UHECRs). We analyzed diffuse $γ$-ray emission from the Coma, Perseus, and Virgo clusters using LHAASO data. Diffuse emission was modeled as a disk of radius $R_{500}$ for each cluster while accounting for point sources. No significant diffuse emission was detected, yielding 95\% confidence level (C.L.) upper limits on the $γ$-ray flux: for WCDA (1-25~TeV) and KM2A ($>25$~TeV), less than $(49.4, 13.7, 54.0)$ and $(1.34, 1.14, 0.40) \times 10^{-14}$~ph~cm$^{-2}$~s$^{-1}$ for Coma, Perseus, and Virgo, respectively. The $γ$-ray upper limits can be used to derive model-independent constraints on the integral energy of CRp above 10~TeV (corresponding to the LHAASO observational range $>1$~TeV under the $pp$ scenario) to be less than $(1.96, 0.59, 0.08) \times 10^{61}$~erg. The absence of detectable annuli/ring-like structures, indicative of cluster accretion or merging shocks, imposes further constraints on models in which the UHECRs are accelerated in the merging shocks of galaxy clusters.

preprint2026arXiv

Constraints on heavy decaying dark matter from 570 days of LHAASO observations

The Kilometer Square Array~(KM2A) of the Large High Altitude Air Shower Observatory (LHAASO) aims at surveying the northern gamma-ray sky at energies above 10 TeV with unprecedented sensitivity. Gamma-ray observations have long been one of the most powerful tools for dark matter searches, as e.g., high-energy gamma-rays could be produced by the decays of heavy dark matter particles. In this letter, we present the first dark matter analysis with LHAASO-KM2A, using the first 340~days of data from 1/2-KM2A and 230~days of data from 3/4-KM2A. Several regions of interest are used to search for a signal and account for the residual cosmic-ray background after gamma/hadron separation. We find no excess of dark matter signals, and thus place some of the strongest gamma-ray constraints on the lifetime of heavy dark matter particles with mass between 10^5 and 10^9~GeV. Our results with LHAASO are robust, and have important implications for dark matter interpretations of the diffuse astrophysical high-energy neutrino emission.

preprint2026arXiv

Deep view of Composite SNR CTA1 with LHAASO in $γ$-rays up to 300 TeV

The ultra-high-energy (UHE) gamma-ray source 1LHAASO J0007+7303u is positionally associated with the composite SNR CTA1 that is located at high Galactic Latitude $b\approx 10.5^\circ$. This provides a rare opportunity to spatially resolve the component of the pulsar wind nebula (PWN) and supernova remnant (SNR) at UHE. This paper conducted a dedicated data analysis of 1LHAASO J0007+7303u using the data collected from December 2019 to July 2023. This source is well detected with significances of 21$σ$ and 17$σ$ at 8$-$100 TeV and $>$100 TeV, respectively. The corresponding extensions are determined to be 0.23$^{\circ}\pm$0.03$^{\circ}$ and 0.17$^{\circ}\pm$0.03$^{\circ}$. The emission is proposed to originate from the relativistic electrons and positrons accelerated within the PWN of PSR J0007+7303. The energy spectrum is well described by a power-law with an exponential cutoff function $dN/dE = (42.4\pm4.1)(\frac{E}{20\rm\ TeV})^{-2.31\pm0.11}\exp(-\frac{E}{110\pm25\rm\ TeV})$ $\rm\ TeV^{-1}\ cm^{-2}\ s^{-1}$in the energy range from 8 TeV to 300 TeV, implying a steady-state parent electron spectrum $dN_e/dE_e\propto (\frac{E_e}{100\rm\ TeV})^{-3.13\pm0.16}\exp[(\frac{-E_e}{373\pm70\rm\ TeV})^2]$ at energies above $\approx 50 \rm\ TeV$. The cutoff energy of the electron spectrum is roughly equal to the expected current maximum energy of particles accelerated at the PWN terminal shock. Combining the X-ray and gamma-ray emission, the current space-averaged magnetic field can be limited to $\approx 4.5\rm\ μG$. To satisfy the multi-wavelength spectrum and the $γ$-ray extensions, the transport of relativistic particles within the PWN is likely dominated by the advection process under the free-expansion phase assumption.

preprint2026arXiv

Direct Product Flow Matching: Decoupling Radial and Angular Dynamics for Few-Shot Adaptation

Recent flow matching (FM) methods improve the few-shot adaptation of vision-language models, by modeling cross-modal alignment as a continuous multi-step flow. In this paper, we argue that existing FM methods are inherently constrained by incompatible geometric priors on pre-trained cross-modal features, resulting in suboptimal adaptation performance. We first analyze these methods from a polar decomposition perspective (i.e., radial and angular sub-manifolds). Under this new geometric view, we identify three overlooked limitations in them: 1) Angular dynamics distortion: The radial-angular coupling induces non-uniform speed on the angular sub-manifold, leading to regression training difficulty and extra truncation errors. 2) Radial dynamics neglect: Feature normalization discards modality confidence, failing to distinguish out-of-distribution and in-distribution data, and abandoning crucial radial dynamics. 3) Context-agnostic unconditional flow: Dataset-specific information loss during pre-trained cross-modal feature extraction remains unrecovered. To resolve these issues, we propose warped product flow matching (WP-FM), a unified Riemannian framework that reformulates alignment on a warped product manifold. Within this framework, we derive direct product flow matching (DP-FM) by introducing a constant-warping metric, which yields a decoupled cylindrical manifold (i.e., direct product manifold). DP-FM enables independent radial evolution and constant-speed angular geodesic transport, effectively eliminating angular dynamics distortion while preserving radial consistency. Meanwhile, we incorporate classifier-free guidance by conditioning the flow on the pre-trained VLMs' hidden states to inject missing dataset-specific information. Extensive results across 11 benchmarks have demonstrated that DP-FM achieves a new state-of-the-art for multi-step few-shot adaptation.

preprint2026arXiv

Discovery of a new $γ$-ray source LHAASO J0341+5258 with emission up to 200TeV

We report the discovery of a new unidentified extended $γ$-ray source in the Galactic plane named LHAASO J0341+5258 with a pre-trial significance of 8.2 standard deviations above 25 TeV. The best fit position is R.A.$=55.34^{\circ}\pm0.11^{\circ}$ and Dec$=52.97^{\circ}\pm0.07^{\circ}$. The angular size of LHAASO J0341+5258 is $0.29^\circ \pm 0.06^\circ_{stat} \pm0.02^\circ_{sys}$. The flux above 25 TeV is about $20\%$ of the flux of Crab Nebula. Although a power-law fit of the spectrum from 10 TeV to 200 TeV with the photon index $α=2.98 \pm 0.19_{stat} \pm 0.02_{sys}$ is not excluded, the LHAASO data together with the flux upper limit at 10 GeV set by the Fermi LAT observation, indicate a noticeable steepening of an initially hard power-law spectrum %($α\leq 1.75$) spectrum with a cutoff at $\approx 50$ TeV. We briefly discuss the origin of UHE gamma-rays. The lack of an energetic pulsar and a young SNR inside or in the vicinity of LHAASO J0341+5258 challenge, but do not exclude both the leptonic and hadronic scenarios of gamma-ray production.

preprint2026arXiv

Discovery of the Ultra-high energy gamma-ray source LHAASO J2108+5157

We report the discovery of a UHE gamma-ray source, LHAASO J2108+5157, by analyzing the LHAASO-KM2A data of 308.33 live days. Significant excess of gamma-ray induced showers is observed in both energy bands of 25-100 TeV and $\gt$100 TeV with 9.5 sigma and 8.5 sigma, respectively. This source is not significantly favored as an extensive source with the angular extension smaller than the point-spread function of KM2A. The measured energy spectrum from 20 to 200 TeV can be approximately described by a power-law function with an index of -2.83$\pm$ 0.18stat. A harder spectrum is demanded at lower energies considering the flux upper limit set by Fermi-LAT observations. The position of the gamma-ray emission is correlated with a giant molecular cloud, which favors a hadronic origin. No obvious counterparts have been found, deeper multiwavelength observations will help to shed new light on this intriguing UHE source.

preprint2026arXiv

Energy calibration of LHAASO-KM2A using the cosmic ray Moon shadow

We present a precise measurement of the westward, rigidity-dependent shift of the Moon's shadow using three and a half years of cosmic-ray data collected by the Kilometer Square Array (KM2A) of the Large High Altitude Air Shower Observatory (LHAASO). These measurements enable us to calibrate the detector energy response in the range 20-260 TeV, with results showing excellent agreement with the response derived from Monte Carlo (MC) simulations of the KM2A detector. We also measure a best-fit parameter $ε= 0.015 \pm 0.08$, corresponding to a 95% confidence interval of [-14%, +17%] for the energy-scale estimation. This result establishes the exceptional accuracy of the KM2A-MC in simulating the detector's response within this energy range.

preprint2026arXiv

Energy-Dependent Shifts of Medium-Scale Anisotropies in Very-High-Energy Cosmic Rays Observed by LHAASO-KM2A

Small deviations from isotropy in the arrival directions of Galactic cosmic rays serve as a unique probe of the local magnetic environment. In this Letter, we report observations of medium-scale anisotropies (MSA) at energies above 10 TeV using the LHAASO-KM2A array. Our analysis identifies four regions of excess and four regions of deficit, each spanning angular scales of approximately ten degrees. Crucially, we detect significant energy-dependent shifts in the centroids of two excess regions: Region B and the newly identified Region $\mathrm{\widetilde{D}}$. We also characterize the energy evolution of the fractional relative intensity across both excess and deficit regions. These findings imply that the observed anisotropies are shaped by the specific realization of the local turbulent magnetic field within the cosmic ray scattering length. Such energy-dependent behaviors impose strict constraints on local turbulence models and cosmic ray propagation theories.

preprint2026arXiv

Evidence for particle acceleration approaching PeV energies in the W51 complex

The $γ$-ray emission from the W51 complex is widely acknowledged to be attributed to the interaction between the cosmic rays (CRs) accelerated by the shock of supernova remnant (SNR) W51C and the dense molecular clouds in the adjacent star-forming region, W51B. However, the maximum acceleration capability of W51C for CRs remains elusive. Based on observations conducted with the Large High Altitude Air Shower Observatory (LHAASO), we report a significant detection of $γ$ rays emanating from the W51 complex, with energies from 2 TeV to 200 TeV. The LHAASO measurements, for the first time, extend the $γ$-ray emission from the W51 complex beyond 100 TeV and reveal a significant spectrum bending at tens of TeV. By combining the ``$π^0$-decay bump" featured data from Fermi-LAT, the broadband $γ$-ray spectrum of the W51 region can be well-characterized by a simple pp-collision model. The observed spectral bending feature suggests an exponential cutoff at $\sim400$~TeV or a power-law break at $\sim200$~TeV in the CR proton spectrum, most likely providing the first evidence of SNRs serving as CR accelerators approaching the PeV regime. Additionally, two young star clusters within W51B could also be theoretically viable to produce the most energetic $γ$ rays observed by LHAASO. Our findings strongly support the presence of extreme CR accelerators within the W51 complex and provide new insights into the origin of Galactic CRs.

preprint2026arXiv

Exploring Lorentz Invariance Violation from Ultra-high-energy Gamma Rays Observed by LHAASO

Recently the LHAASO Collaboration published the detection of 12 ultra-high-energy gamma-ray sources above 100 TeV, with the highest energy photon reaching 1.4 PeV. The first detection of PeV gamma rays from astrophysical sources may provide a very sensitive probe of the effect of the Lorentz invariance violation (LIV), which results in decay of high-energy gamma rays in the superluminal scenario and hence a sharp cutoff of the energy spectrum. Two highest energy sources are studied in this work. No signature of the existence of LIV is found in their energy spectra, and the lower limits on the LIV energy scale are derived. Our results show that the first-order LIV energy scale should be higher than about 10^5 times the Planck scale M_{pl} and that the second-order LIV scale is >10^{-3}M_{pl}. Both limits improve by at least one order of magnitude the previous results.

preprint2026arXiv

Extended Very-High-Energy Gamma-Ray Emission Surrounding PSR J0622 + 3749 Observed by LHAASO-KM2A

We report the discovery of an extended very-high-energy (VHE) gamma-ray source around the location of the middle-aged (207.8 kyr) pulsar PSR J0622+3749 with the Large High Altitude Air Shower Observatory (LHAASO). The source is detected with a significance of $8.2σ$ for $E>25$~TeV assuming a Gaussian template. The best-fit location is (R.A., Dec.)$=(95^{\circ}\!.47\pm0^{\circ}\!.11,\,37^{\circ}\!.92 \pm0^{\circ}\!.09)$, and the extension is $0^{\circ}\!.40\pm0^{\circ}\!.07$. The energy spectrum can be described by a power-law spectrum with an index of ${-2.92 \pm 0.17_{\rm stat} \pm 0.02_{\rm sys} }$. No clear extended multi-wavelength counterpart of the LHAASO source has been found from the radio to sub-TeV bands. The LHAASO observations are consistent with the scenario that VHE electrons escaped from the pulsar, diffused in the interstellar medium, and scattered the interstellar radiation field. If interpreted as the pulsar halo scenario, the diffusion coefficient, inferred for electrons with median energies of $\sim160$~TeV, is consistent with those obtained from the extended halos around Geminga and Monogem and much smaller than that derived from cosmic ray secondaries. The LHAASO discovery of this source thus likely enriches the class of so-called pulsar halos and confirms that high-energy particles generally diffuse very slowly in the disturbed medium around pulsars.

preprint2026arXiv

From Failure to Mastery: Generating Hard Samples for Tool-use Agents

The advancement of LLM agents with tool-use capabilities requires diverse and complex training corpora. Existing data generation methods, which predominantly follow a paradigm of random sampling and shallow generation, often yield simple and homogeneous trajectories that fail to capture complex, implicit logical dependencies. To bridge this gap, we introduce HardGen, an automatic agentic pipeline designed to generate hard tool-use training samples with verifiable reasoning. Firstly, HardGen establishes a dynamic API Graph built upon agent failure cases, from which it samples to synthesize hard traces. Secondly, these traces serve as conditional priors to guide the instantiation of modular, abstract advanced tools, which are subsequently leveraged to formulate hard queries. Finally, the advanced tools and hard queries enable the generation of verifiable complex Chain-of-Thought (CoT), with a closed-loop evaluation feedback steering the continuous refinement of the process. Extensive evaluations demonstrate that a 4B parameter model trained with our curated dataset achieves superior performance compared to several leading open-source and closed-source competitors (e.g., GPT-5.2, Gemini-3-Pro and Claude-Opus-4.5). Our code, models, and dataset will be open-sourced to facilitate future research.

preprint2026arXiv

LHAASO Detection of Ultra-High-Energy Gamma-Ray Emission toward the Giant Molecular Clouds

The $γ$-ray from Giant molecular clouds (GMCs) is regarded as the most ideal tool to perform in-situ measurement of cosmic ray (CR) density and spectra in our Galaxy. We report the first detection of $γ$-ray emissions in the very-high-energy (VHE) domain from the five nearby GMCs with a stacking analysis based on a 4.5-year $γ$-ray observation with the Large High Altitude Air Shower Observatory (LHAASO) experiment. The spectral energy distributions derived from the GMCs are consistent with the expected $γ$-ray flux produced via CR interacting with the ISM in the energy interval 1 - 100 $~\rm$ TeV. In addition, we investigate the presence of the CR spectral `knee' by introducing a spectral break in the $γ$-ray data. While no significant evidence for the CR knee is found, the current KM2A measurements from GMCs strongly favor a proton CR knee located above 0.9$~\rm$ PeV, which is consistent with the latest measurement of the CR spectrum by ground-based experiments.

preprint2026arXiv

Measurement of attenuation length of the muon content in extensive air showers from 0.3 to 30 PeV with LHAASO

The attenuation length of the muon content in extensive air showers provides important information regarding the generation and development of air showers. This information can be used not only to improve the description of such showers but also to test fundamental models of hadronic interactions. Using data from the LHAASO-KM2A experiment, the development of the muon content in high-energy air showers was studied. The attenuation length of muon content in the air showers was measured from experimental data in the energy range from 0.3 to 30 PeV using the constant intensity cut method. By comparing the attenuation length of the muon content with predictions from high-energy hadronic interaction models (QGSJET-II-04, SIBYLL 2.3d, and EPOS-LHC), it is evident that LHAASO results are significantly shorter than those predicted by the first two models (QGSJET-II-04 and SIBYLL 2.3d) but relatively close to those predicted by the third model (EPOS-LHC). Thus, the LHAASO data favor the EPOS-LHC model over the other two models. The three interaction models confirmed an increasing trend in the attenuation length as the cosmic-ray energy increases.

preprint2026arXiv

Measurement of Very-high-energy Diffuse Gamma-ray Emissions from the Galactic Plane with LHAASO-WCDA

The diffuse Galactic gamma-ray emission is a very important tool used to study the propagation and interaction of cosmic rays in the Milky Way. In this work, we report the measurements of the diffuse emission from the Galactic plane, covering Galactic longitudes from $15^{\circ}$ to $235^{\circ}$ and latitudes from $-5^{\circ}$ to $+5^{\circ}$, in an energy range of 1 TeV to 25 TeV, with the Water Cherenkov Detector Array (WCDA) of the Large High Altitude Air Shower Observatory (LHAASO). After masking the sky regions of known sources, the diffuse emission is detected with $24.6σ$ and $9.1σ$ significance in the inner Galactic plane and outer Galactic plane, respectively. The WCDA spectra in both regions can be well described by a power-law function, with spectral indices of $-2.67\pm0.05_{\rm stat}$ in the inner region and $-2.83\pm0.19_{\rm stat}$ in the outer region, respectively. Combined with the Square Kilometer Array (KM2A) measurements at higher energies, a clear softening of the spectrum is found in the inner region, with change of spectral indices by $\sim0.5$ at a break energy around $30$ TeV. The fluxes of the diffuse emission are higher by a factor of $1.5-2.7$ than the model prediction assuming local CR spectra and the gas column density, which are consistent with those measured by the KM2A. Along Galactic longitude, the spatial distribution of the diffuse emission shows deviation from that of the gas column density. The spectral shape of the diffuse emission are possibly variation in different longitude region. The WCDA measurements bridge the gap between the low-energy measurements by space detectors and the ultra-high-energy observations by LHAASO-KM2A and other experiments. These results suggest that improved modeling of the wide-band diffuse emission is required.

preprint2026arXiv

RealCam: Real-Time Novel-View Video Generation with Interactive Camera Control

Camera-controlled video-to-video (V2V) generation enables dynamic viewpoint synthesis from monocular footage, holding immense potential for interactive filmmaking and live broadcasting. However, existing implicit synthesis methods fundamentally rely on non-causal, full-sequence processing and rigid prefix-style temporal concatenation. This architectural paradigm mandates bidirectional attention, resulting in prohibitive computational latency, quadratic complexity scaling, and inherent incompatibility with real-time streaming or variable-length inputs. To overcome these limitations, we introduce \texttt{RealCam}, a novel autoregressive framework for interactive, real-time camera-controlled V2V generation. We first design a high-fidelity teacher model grounded in a \textbf{Cross-frame In-context Learning} paradigm. By interleaving source and target frames into synchronized contextual pairs, our design inherently enables length-agnostic generalization and naturally facilitates causal adaptation, breaking the rigid prefix bottleneck. We then distill this teacher into a few-step causal student via Self-Forcing with Distribution Matching Distillation, enabling efficient, on-the-fly streaming synthesis. Furthermore, to mitigate severe loop inconsistency in closed-loop trajectories, we propose \textbf{Loop-Closed Data Augmentation (LoopAug)}, a novel paradigm that synthesizes globally consistent loop sequences from existing multiview datasets. Extensive experiments demonstrate that \texttt{RealCam} achieves state-of-the-art visual fidelity and temporal consistency while enabling truly interactive camera control with orders-of-magnitude faster inference than existing paradigms. Our project page is at https://xyc-fly.github.io/RealCam/.

preprint2026arXiv

Reasoning emerges from constrained inference manifolds in large language models

Reasoning in large language models is predominantly evaluated through labeled benchmarks, conflating task performance with the quality of internal inference. Here we study reasoning as an intrinsic dynamical process by examining the evolution of internal representations during inference. We find that inference-time dynamics consistently self-organize into low-dimensional manifolds embedded within high-dimensional representation spaces. we find that such geometric compression, although pervasive, is not sufficient for stable or reliable reasoning. Instead, effective reasoning dynamics emerge within a constrained structural regime characterized by three conditions: adequate representational expressivity, spontaneous manifold compression, and preservation of non-degenerate information volume within the compressed subspace. Models outside this regime exhibit characteristic pathological inference dynamics. Based on these insights, we introduce a unified, label-free diagnostic computed solely from internal dynamics. These findings suggest that reasoning in LLMs is fundamentally governed by geometric and informational constraints, offering a complementary framework to benchmark-centric assessment.

preprint2026arXiv

SpaAct: Spatially-Activated Transition Learning with Curriculum Adaptation for Vision-Language Navigation

Vision-and-Language Navigation (VLN) aims to enable an embodied agent to follow natural-language instructions and navigate to a target location in unseen 3D environments. We argue that adapting VLMs to VLN requires endowing them with two complementary capabilities for acquiring such awareness, namely backward action reasoning (why) and forward transition prediction~(how). Based on this insight, we propose SpaAct, a simple yet effective training framework that activates the dynamic spatial awareness in VLMs. Specifically, SpaAct introduces two spatial activation tasks: Action Retrospection, which asks the model to infer the executed action sequence from visual transitions, and Future Frame Selection, which forces the model to predict the visual transitions conditioned on history and action. These two objectives provide lightweight supervision on both backward action reasoning and forward transition prediction, encouraging the model to build dynamic spatial awareness in a VLM-friendly way. To further stabilize adaptation, we design TriPA, a Tri-factor Progressive Adaptive curriculum learning method that organizes training samples from easy to hard, allowing the model to gradually acquire navigation skills from basic locomotion to long-horizon reasoning. Experiments on standard VLN-CE benchmarks show that SpaAct consistently improves VLM-based navigation and achieves state-of-the-art performance. We will release the code and models to support future research.

preprint2026arXiv

SparseOccVLA: Bridging Occupancy and Vision-Language Models via Sparse Queries for Unified 4D Scene Understanding and Planning

In autonomous driving, Vision Language Models (VLMs) excel at high-level reasoning , whereas semantic occupancy provides fine-grained details. Despite significant progress in individual fields, there is still no method that can effectively integrate both paradigms. Conventional VLMs struggle with token explosion and limited spatiotemporal reasoning, while semantic occupancy provides a unified, explicit spatial representation but is too dense to integrate efficiently with VLMs. To address these challenges and bridge the gap between VLMs and occupancy, we propose SparseOccVLA, a novel vision-language-action model that unifies scene understanding, occupancy forecasting, and trajectory planning powered by sparse occupancy queries. Starting with a lightweight Sparse Occupancy Encoder, SparseOccVLA generates compact yet highly informative sparse occupancy queries that serve as the single bridge between vision and language. These queries are aligned into the language space and reasoned by the LLM for unified scene understanding and future occupancy forecasting. Furthermore, we introduce an LLM-guided Anchor-Diffusion Planner featuring decoupled anchor scoring and denoising, as well as cross-model trajectory-condition fusion. SparseOccVLA achieves a 7% relative improvement in CIDEr over the state-of-the-art on OmniDrive-nuScenes, a 0.5 increase in mIoU score on Occ3D-nuScenes, and sets state-of-the-art open-loop planning metric on nuScenes benchmark, demonstrating its strong holistic capability.

preprint2026arXiv

SwiftI2V: Efficient High-Resolution Image-to-Video Generation via Conditional Segment-wise Generation

High-resolution image-to-video (I2V) generation aims to synthesize realistic temporal dynamics while preserving fine-grained appearance details of the input image. At 2K resolution, it becomes extremely challenging, and existing solutions suffer from various weaknesses: 1) end-to-end models are often prohibitively expensive in memory and latency; 2) cascading low-resolution generation with a generic video super-resolution tends to hallucinate details and drift from input-specific local structures, since the super-resolution stage is not explicitly conditioned on the input image. To this end, we propose SwiftI2V, an efficient framework tailored for high-resolution I2V. Following the widely used two-stage design, it addresses the efficiency--fidelity dilemma by first generating a low-resolution motion reference to reduce token costs and ease the modeling burden, then performing a strongly image-conditioned 2K synthesis guided by the motion to recover input-faithful details with controlled overhead. Specifically, to make generation more scalable, SwiftI2V introduces Conditional Segment-wise Generation (CSG) to synthesize videos segment-by-segment with a bounded per-step token budget, and adopts bidirectional contextual interaction within each segment to improve cross-segment coherence and input fidelity. On VBench-I2V at 2K resolution, SwiftI2V achieves performance comparable to end-to-end baselines while reducing total GPU-time by 202x. Particularly, it enables practical 2K I2V generation on a single datacenter GPU (e.g., H800) or consumer GPU (e.g., RTX 4090).

preprint2026arXiv

The RoboSense Challenge: Sense Anything, Navigate Anywhere, Adapt Across Platforms

Autonomous systems are increasingly deployed in open and dynamic environments -- from city streets to aerial and indoor spaces -- where perception models must remain reliable under sensor noise, environmental variation, and platform shifts. However, even state-of-the-art methods often degrade under unseen conditions, highlighting the need for robust and generalizable robot sensing. The RoboSense 2025 Challenge is designed to advance robustness and adaptability in robot perception across diverse sensing scenarios. It unifies five complementary research tracks spanning language-grounded decision making, socially compliant navigation, sensor configuration generalization, cross-view and cross-modal correspondence, and cross-platform 3D perception. Together, these tasks form a comprehensive benchmark for evaluating real-world sensing reliability under domain shifts, sensor failures, and platform discrepancies. RoboSense 2025 provides standardized datasets, baseline models, and unified evaluation protocols, enabling large-scale and reproducible comparison of robust perception methods. The challenge attracted 143 teams from 85 institutions across 16 countries, reflecting broad community engagement. By consolidating insights from 23 winning solutions, this report highlights emerging methodological trends, shared design principles, and open challenges across all tracks, marking a step toward building robots that can sense reliably, act robustly, and adapt across platforms in real-world environments.

preprint2026arXiv

Thinking in Text and Images: Interleaved Vision--Language Reasoning Traces for Long-Horizon Robot Manipulation

Long-horizon robotic manipulation requires plans that are both logically coherent and geometrically grounded. Existing Vision-Language-Action policies usually hide planning in latent states or expose only one modality: text-only chain-of-thought encodes causal order but misses spatial constraints, while visual prediction provides geometric cues but often remains local and semantically underconstrained. We introduce Interleaved Vision--Language Reasoning (IVLR), a policy framework built around \trace{}, an explicit intermediate representation that alternates textual subgoals with visual keyframes over the full task horizon. At test time, a single native multimodal transformer self-generates this global semantic-geometric trace from the initial observation and instruction, caches it, and conditions a closed-loop action decoder on the trace, original instruction, and current observation. Because standard robot datasets lack such traces, we construct pseudo-supervision by temporally segmenting demonstrations and captioning each stage with a vision-language model. Across simulated benchmarks for long-horizon manipulation and visual distribution shift, \method{} reaches 95.5\% average success on LIBERO, including 92.4\% on LIBERO-Long, and 59.4\% overall success on SimplerEnv-WidowX. Ablations show that both modalities are necessary: without traces, LIBERO-Long success drops to 37.7\%; text-only and vision-only traces reach 62.0\% and 68.4\%, while the full interleaved trace reaches 92.4\%. Stress tests with execution perturbations and masked trace content show moderate degradation, suggesting that the trace can tolerate local corruption and moderate execution drift, but remains limited under stale or incorrect global plans.

preprint2026arXiv

Total Gluon Helicity Contribution to the Proton Spin from Lattice QCD

We report a state-of-the-art lattice QCD calculation of the total gluon helicity contribution to the proton spin, $ΔG$. The calculation is done on ensembles with three different lattice spacings $a=\{0.08, 0.09, 0.11\}$ fm. By employing distillation and momentum smearing for proton external states, we extract the bare matrix elements of the topological current $K^μ$ using 5-HYP smeared Coulomb gauge fixing configurations. Furthermore, we apply a non-perturbative $\mathrm{RI/MOM}$ renormalization scheme augmented by the Cluster Decomposition Error Reduction (CDER) technique to determine the renormalization constants of $K^μ$. The results obtained from different components $K^{t,i}$ (with $i$ being the direction of proton momentum or polarization) are consistent with Lorentz covariance within uncertainties. After extrapolating to the continuum limit, $ΔG$ is found to be $ΔG = 0.231(17)^{\mathrm{sta.}}(44)^{\mathrm{sym.}}$ at the $\overline{\mathrm{MS}}$ scale $μ^2=10\ \mathrm{GeV}^2$, which constitutes approximately $46(9)\%$ of the proton spin.

preprint2026arXiv

Transient Large-Scale Anisotropy in TeV Cosmic Rays due to an Interplanetary Coronal Mass Ejection

Large- or medium-scale cosmic ray anisotropy at TeV energies has not previously been confirmed to vary with time. Transient anisotropy changes have been observed below 150 GeV, especially near the passage of an interplanetary shock and coronal mass ejection containing a magnetic flux rope ejected by a solar storm, which can trigger a geomagnetic storm with practical consequences. In such events, cosmic rays provide remote sensing of the magnetic field properties. Here we report the observation of transient large-scale anisotropy in TeV cosmic ray ions using data from the Large High Altitude Air Shower Observatory (LHAASO). We analyze hourly skymaps of the transient cosmic ray intensity excess or deficit, the gradient of which indicates the direction and magnitude of transient large-scale anisotropy across the field of view. We observe enhanced anisotropy above typical hourly fluctuations with $>$5$σ$ significance during some hours of November 4, 2021, in separate data sets for four primary cosmic ray energy ranges of median energy from $E$=0.7 to 3.1 TeV. The gradient varies with energy as $E^γ$, where $γ\approx-0.5$. At a median energy $\leq$1.0 TeV, this gradient corresponds to a dipole anisotropy of at least 1\%, or possibly a weaker anisotropy of higher order. This new type of observation opens the opportunity to study interplanetary magnetic structures using air shower arrays around the world, complementing existing in situ and remote measurements of plasma properties.

preprint2026arXiv

V2P: Visual Attention Calibration for GUI Grounding via Background Suppression and Center Peaking

Precise localization of GUI elements is crucial for the development of GUI agents. Traditional methods rely on bounding box or center-point regression, neglecting spatial interaction uncertainty and visual-semantic hierarchies. Recent methods incorporate attention mechanisms but still face two key issues: (1) ignoring processing background regions causes attention drift from the desired area, and (2) uniform modeling the target UI element fails to distinguish between its center and edges, leading to click imprecision. Inspired by how humans visually process and interact with GUI elements, we propose the Valley-to-Peak (V2P) method to address these issues. To mitigate background distractions, V2P introduces a suppression attention mechanism that minimizes the model's focus on irrelevant regions to highlight the intended region. For the issue of center-edge distinction, V2P applies a Fitts' Law-inspired approach by modeling GUI interactions as 2D Gaussian heatmaps where the weight gradually decreases from the center towards the edges. The weight distribution follows a Gaussian function, with the variance determined by the target's size. Consequently, V2P effectively isolates the target area and teaches the model to concentrate on the most essential point of the UI element. The model trained by V2P achieves the performance with 92.4\% and 52.5\% on two benchmarks ScreenSpot-v2 and ScreenSpot-Pro (see Fig.~\ref{fig:main_results_charts}). Ablations further confirm each component's contribution, underscoring V2P's generalizability in precise GUI grounding tasks and its potential for real-world deployment in future GUI agents.

preprint2026arXiv

VILTA: A VLM-in-the-Loop Adversary for Enhancing Driving Policy Robustness

The safe deployment of autonomous driving (AD) systems is fundamentally hindered by the long-tail problem, where rare yet critical driving scenarios are severely underrepresented in real-world data. Existing solutions including safety-critical scenario generation and closed-loop learning often rely on rule-based heuristics, resampling methods and generative models learned from offline datasets, limiting their ability to produce diverse and novel challenges. While recent works leverage Vision Language Models (VLMs) to produce scene descriptions that guide a separate, downstream model in generating hazardous trajectories for agents, such two-stage framework constrains the generative potential of VLMs, as the diversity of the final trajectories is ultimately limited by the generalization ceiling of the downstream algorithm. To overcome these limitations, we introduce VILTA (VLM-In-the-Loop Trajectory Adversary), a novel framework that integrates a VLM into the closed-loop training of AD agents. Unlike prior works, VILTA actively participates in the training loop by comprehending the dynamic driving environment and strategically generating challenging scenarios through direct, fine-grained editing of surrounding agents' future trajectories. This direct-editing approach fully leverages the VLM's powerful generalization capabilities to create a diverse curriculum of plausible yet challenging scenarios that extend beyond the scope of traditional methods. We demonstrate that our approach substantially enhances the safety and robustness of the resulting AD policy, particularly in its ability to navigate critical long-tail events.

preprint2026arXiv

What Is The Best 3D Scene Representation for Robotics? From Geometric to Foundation Models

In this paper, we provide a comprehensive overview of existing scene representation methods for robotics, covering traditional representations such as point clouds, voxels, signed distance functions (SDF), and scene graphs, as well as more recent neural representations like Neural Radiance Fields (NeRF), 3D Gaussian Splatting (3DGS), and the emerging Foundation Models. While current SLAM and localization systems predominantly rely on sparse representations like point clouds and voxels, dense scene representations are expected to play a critical role in downstream tasks such as navigation and obstacle avoidance. Moreover, neural representations such as NeRF, 3DGS, and foundation models are well-suited for integrating high-level semantic features and language-based priors, enabling more comprehensive 3D scene understanding and embodied intelligence. In this paper, we categorized the core modules of robotics into five parts (Perception, Mapping, Localization, Navigation, Manipulation). We start by presenting the standard formulation of different scene representation methods and comparing the advantages and disadvantages of scene representation across different modules. This survey is centered around the question: What is the best 3D scene representation for robotics? We then discuss the future development trends of 3D scene representations, with a particular focus on how the 3D Foundation Model could replace current methods as the unified solution for future robotic applications. The remaining challenges in fully realizing this model are also explored. We aim to offer a valuable resource for both newcomers and experienced researchers to explore the future of 3D scene representations and their application in robotics. We have published an open-source project on GitHub and will continue to add new works and technologies to this project.

preprint2026arXiv

Xiaomi EV World Model: A Joint World Model Integrating Reconstruction and Generation for Autonomous Driving

This report presents a unified technical system addressing the two core capabilities of world models for autonomous driving: world representation and world generation. For world representation, we propose WorldRec, a feed-forward reconstruction architecture driven by sparse scene queries. WorldRec initializes structured queries in 3D space, leveraging them to aggregate cross-view, cross-temporal features, thereby naturally enforcing spatial consistency across frames and yielding compact yet high-fidelity 3D Gaussian scene representations. For world generation, we propose WorldGen, a two-stage training framework of bidirectional pretraining followed by causal fine-tuning through three progressive stages (Teacher Forcing, ODE distillation, and DMD), enabling high-quality online causal video generation in as few as 4 denoising steps. Building on both modules, we further introduce the JWM, which deeply integrates WorldRec and WorldGen to achieve synergistic gains in generation stability, cross-frame consistency, and visual fidelity, providing a solid foundation for closed-loop simulation, data synthesis, and end-to-end training in autonomous driving.

preprint2025arXiv

$gg \to ZH$ : updated predictions at NLO QCD

We present state-of-the-art predictions for the inclusive cross section of gluon-initiated $ZH$ production, following the recommendations of the LHC Higgs Working Group. In particular, we include NLO QCD corrections, where the virtual corrections are obtained from the combination of a forward expansion and a high-energy expansion, and the real corrections are exact. The expanded results for the virtual corrections are compared in detail to full numerical results. The updated predictions show a reduction of the scale uncertainties to the level of 15%, and they include an estimate of the top-mass-scheme uncertainty.

preprint2025arXiv

End-to-End Detector Optimization with Diffusion models: A Case Study in Sampling Calorimeters

Recent advances in machine learning have opened new avenues for optimizing detector designs in high-energy physics, where the complex interplay of geometry, materials, and physics processes has traditionally posed a significant challenge. In this work, we introduce the $\textit{end-to-end}$ AI Detector Optimization framework (AIDO) that leverages a diffusion model as a surrogate for the full simulation and reconstruction chain, enabling gradient-based design exploration in both continuous and discrete parameter spaces. Although this framework is applicable to a broad range of detectors, we illustrate its power using the specific example of a sampling calorimeter, focusing on charged pions and photons as representative incident particles. Our results demonstrate that the diffusion model effectively captures critical performance metrics for calorimeter design, guiding the automatic search for layer arrangement and material composition that aligns with known calorimeter principles. The success of this proof-of-concept study provides a foundation for future applications of end-to-end optimization to more complex detector systems, offering a promising path toward systematically exploring the vast design space in next-generation experiments.

preprint2025arXiv

Observation of the $γ$-ray Emission from W43 with LHAASO

In this paper, we report the detection of the very-high-energy (VHE, $ 100{\rm\ GeV} < E < 100{\rm\ TeV} $) and ultra-high-energy (UHE, $E > 100\rm\ TeV$) $γ$-ray emissions from the direction of the young star-forming region W43, observed by the Large High Altitude Air Shower Observation (LHAASO). The extended $γ$-ray source was detected with a significance of ${\sim}16\,σ$ by KM2A and ${\sim}17\,σ$ by WCDA, respectively. The angular extension of this $γ$-ray source is about 0.5 degrees, corresponding to a physical size of about 50 pc. We discuss the origin of the $γ$-ray emission and possible cosmic ray acceleration in the W43 region using multi-wavelength data. Our findings suggest that W43 is likely another young star cluster capable of accelerating cosmic rays (CRs) to at least several hundred TeV.

preprint2025arXiv

Study of Ultra-High-Energy Gamma-Ray Source 1LHAASO J0056+6346u and Its Possible Origins

We report a dedicated study of the newly discovered extended UHE $γ$-ray source 1LHAASO J0056+6346u. Analyzing 979 days of LHAASO-WCDA data and 1389 days of LHAASO-KM2A data, we observed a significant excess of $γ$-ray events with both WCDA and KM2A. Assuming a point power-law source with a fixed spectral index, the significance maps reveal excesses of ${\sim}12.65\,σ$, ${\sim}22.18\,σ$, and ${\sim}10.24\,σ$ in the energy ranges of 1--25 TeV, 25--100 TeV, and $> 100$ TeV, respectively. We use a 3D likelihood algorithm to derive the morphological and spectral parameters, and the source is detected with significances of $12.65\,σ$ by WCDA and $25.27\,σ$ by KM2A. The best-fit positions derived from WCDA and KM2A data are (R.A. = $13.96^\circ\pm0.09^\circ$, Decl. = $63.92^\circ\pm0.05^\circ$) and (R.A. = $14.00^\circ\pm0.05^\circ$, Decl. = $63.79^\circ\pm0.02^\circ$), respectively. The angular size ($r_{39}$) of 1LHAASO J0056+6346u is $0.34^\circ\pm0.04^\circ$ at 1--25 TeV and $0.24^\circ\pm0.02^\circ$ at $> 25$ TeV. The differential flux of this UHE $γ$-ray source can be described by an exponential cutoff power-law function: $(2.67\pm0.25) \times 10^{-15} (E/20\,\text{TeV})^{-1.97\pm0.10} e^{-E/(55.1\pm7.2)\,\text{TeV}} \,\text{TeV}^{-1}\,\text{cm}^{-2}\,\text{s}^{-1}$. To explore potential sources of $γ$-ray emission, we investigated the gas distribution around 1LHAASO J0056+6346u. 1LHAASO J0056+6346u is likely to be a TeV PWN powered by an unknown pulsar, which would naturally explain both its spatial and spectral properties. Another explanation is that this UHE $γ$-ray source might be associated with gas content illuminated by a nearby CR accelerator, possibly the SNR candidate G124.0+1.4.

preprint2025arXiv

Ultrahigh-Energy Gamma-ray Emission Associated with Black Hole-Jet Systems

Black holes (BH), one of the most intriguing objects in the universe, can manifest themselves through electromagnetic radiation initiated by the accretion flow. Some stellar-mass BHs drive relativistic jets when accreting matter from their companion stars, forming microquasars. Non-thermal emission from the radio to tera-electronvolt (TeV) gamma-ray band has been observed from microquasars, indicating the acceleration of relativistic particles. Here we report detection of four microquasars (SS 433, V4641 Sgr, GRS 1915+105, MAXI J1820+070) of spectrum extending to the ultrahigh-energy (UHE; photon energy $E>100$ TeV) band and one microquasar (Cygnus X-1) of spectrum approaching 100 TeV, using the Large High Altitude Air Shower Observatory (LHAASO). Notably, the total emission associated with SS 433 cannot be interpreted with a single leptonic component. In the UHE band, its emission is in spatial coincidence with a giant atomic cloud, which is consistent with a hadronic origin. An elongated source is discovered from V4641 Sgr with the spectrum continuing up to 800 TeV. The detection of UHE gamma rays demonstrates that accreting BHs and their environments can operate as extremely efficient accelerators of particles out of 1 peta-electronvolt (PeV), suggesting microquasars to be important contributors to Galactic cosmic rays especially around the `knee' region.

preprint2023arXiv

Physical properties, electronic structure, and strain-tuned monolayer of the weak topological insulator RbTi3Bi5 with Kagome lattice

Kagome metals AV3Sb5 (A = K, Rb, and Cs) with a V-Kagome lattice acting as a fertile platform to investigate geometric frustration, electron correlation, superconductivity, and nontrivial band topology, have attracted tremendous attention. Here we reported the structure and properties of ATi3Bi5 (A = Rb, Cs) family with a Ti-Kagome lattice, specifically focusing on the electronic structure and nontrivial band topology of RbTi3Bi5. ATi3Bi5 (A = Rb, Cs) is found to be non-superconducting metal with strong quasi-two-dimensional feature, moderate electron correlation, and small Pauli paramagnetism. Based on first principles calculations, RbTi3Bi5 is determined to be a weak topological insulator with gapless surface states along (100) plane, and the electronic band structure along (001) plane is in great agreement with experimentally observed one. In particular, the electronic properties of the RbTi3Bi5 monolayer can be efficiently tuned by a biaxial strain according to calculation, with its lower saddle points coming from Kagome lattice approaching the Fermi level. These results highlight ATi3Bi5 (A = Rb, Cs) with Ti-Kagome lattice is a new Kagome metal to explore nontrivial band topology and exotic phases.

preprint2023arXiv

VL-NMS: Breaking Proposal Bottlenecks in Two-Stage Visual-Language Matching

The prevailing framework for matching multimodal inputs is based on a two-stage process: 1) detecting proposals with an object detector and 2) matching text queries with proposals. Existing two-stage solutions mostly focus on the matching step. In this paper, we argue that these methods overlook an obvious \emph{mismatch} between the roles of proposals in the two stages: they generate proposals solely based on the detection confidence (i.e., query-agnostic), hoping that the proposals contain all instances mentioned in the text query (i.e., query-aware). Due to this mismatch, chances are that proposals relevant to the text query are suppressed during the filtering process, which in turn bounds the matching performance. To this end, we propose VL-NMS, which is the first method to yield query-aware proposals at the first stage. VL-NMS regards all mentioned instances as critical objects, and introduces a lightweight module to predict a score for aligning each proposal with a critical object. These scores can guide the NMS operation to filter out proposals irrelevant to the text query, increasing the recall of critical objects, resulting in a significantly improved matching performance. Since VL-NMS is agnostic to the matching step, it can be easily integrated into any state-of-the-art two-stage matching methods. We validate the effectiveness of VL-NMS on two multimodal matching tasks, namely referring expression grounding and image-text matching. Extensive ablation studies on several baselines and benchmarks consistently demonstrate the superiority of VL-NMS.

preprint2022arXiv

A Closer Look at Debiased Temporal Sentence Grounding in Videos: Dataset, Metric, and Approach

Temporal Sentence Grounding in Videos (TSGV), which aims to ground a natural language sentence in an untrimmed video, has drawn widespread attention over the past few years. However, recent studies have found that current benchmark datasets may have obvious moment annotation biases, enabling several simple baselines even without training to achieve SOTA performance. In this paper, we take a closer look at existing evaluation protocols, and find both the prevailing dataset and evaluation metrics are the devils that lead to untrustworthy benchmarking. Therefore, we propose to re-organize the two widely-used datasets, making the ground-truth moment distributions different in the training and test splits, i.e., out-of-distribution (OOD) test. Meanwhile, we introduce a new evaluation metric "dR@n,IoU@m" that discounts the basic recall scores to alleviate the inflating evaluation caused by biased datasets. New benchmarking results indicate that our proposed evaluation protocols can better monitor the research progress. Furthermore, we propose a novel causality-based Multi-branch Deconfounding Debiasing (MDD) framework for unbiased moment prediction. Specifically, we design a multi-branch deconfounder to eliminate the effects caused by multiple confounders with causal intervention. In order to help the model better align the semantics between sentence queries and video moments, we enhance the representations during feature encoding. Specifically, for textual information, the query is parsed into several verb-centered phrases to obtain a more fine-grained textual feature. For visual information, the positional information has been decomposed from moment features to enhance representations of moments with diverse locations. Extensive experiments demonstrate that our proposed approach can achieve competitive results among existing SOTA approaches and outperform the base model with great gains.

preprint2022arXiv

A family of immersed finite element spaces and applications to three dimensional $\mathbf{H}(\text{curl})$ interface problems

Maxwell interface problems are of great importance in many electromagnetic applications. Unfitted mesh methods are especially attractive in 3D computation as they can circumvent generating complex 3D interface-fitted meshes. However, many unfitted mesh methods rely on non-conforming approximation spaces, which may cause a loss of accuracy for solving Maxwell equations, and the widely-used penalty techniques in the literature may not help in recovering the optimal convergence. In this article, we provide a remedy by developing Nédélec-type immersed finite element spaces with a Petrov-Galerkin scheme that is able to produce optimal-convergent solutions. To establish a systematic framework, we analyze all the $H^1$, $\mathbf{H}(\text{curl})$ and $\mathbf{H}(\text{div})$ IFE spaces and form a discrete de Rham complex. Based on these fundamental results, we further develop a fast solver using a modified Hiptmair-Xu preconditioner which works for both the GMRES and CG methods.

preprint2022arXiv

A new quasi-one-dimensional superconductor parent compound NaMn$_6$Bi$_5$ with lower antiferromagnetic transition temperatures

Mn-based superconductor is rare and recently reported in quasi-one-dimensional KMn$_6$Bi$_5$ with [Mn$_6$Bi$_5$]-columns under high pressure. Here we report the synthesis, magnetic properties, electrical resistivity, and specific heat capacity of the newly-discovered quasi-one-dimensional NaMn$_6$Bi$_5$ single crystal. Compared with other AMn$_6$Bi$_5$ (A = K, Rb, and Cs), NaMn$_6$Bi$_5$ has larger intra-column Bi-Bi bond length, which may result in the two decoupled antiferromagnetic transitions at 47.3 K and 52.3 K. The relatively lower antiferromagnetic transition temperatures make NaMn$_6$Bi$_5$ a more suitable platform to explore Mn-based superconductors. Anisotropic resistivity and non-Fermi liquid behavior at low temperature are observed. Heat capacity measurement reveals that NaMn$_6$Bi$_5$ has similar Debye temperature with those of AMn$_6$Bi$_5$ (A = K and Rb), whereas the Sommerfeld coefficient is unusually large. Using first-principles calculations, the quite different density of states and an unusual enhancement near the Fermi level are observed for NaMn$_6$Bi$_5$, when compared with those of other AMn$_6$Bi$_5$ (A = K, Rb, and Cs) compounds.

preprint2022arXiv

A Virtual Finite Element Method for Two Dimensional Maxwell Interface Problems with a Background Unfitted Mesh

A virtual element method (VEM) with the first order optimal convergence order is developed for solving two-dimensional Maxwell interface problems on a special class of polygonal meshes that are cut by the interface from a background unfitted mesh. A novel virtual space is introduced on a virtual triangulation of the polygonal mesh satisfying a maximum angle condition, which shares exactly the same degrees of freedom as the usual H(curl)-conforming virtual space. This new virtual space serves as the key to prove that the optimal error bounds of the VEM are independent of high aspect ratio of the possible anisotropic polygonal mesh near the interface.

preprint2022arXiv

Balancing the trade-off between cost and reliability for wireless sensor networks: a multi-objective optimized deployment method

The deployment of the sensor nodes (SNs) always plays a decisive role in the system performance of wireless sensor networks (WSNs). In this work, we propose an optimal deployment method for practical heterogeneous WSNs which gives a deep insight into the trade-off between the reliability and deployment cost. Specifically, this work aims to provide the optimal deployment of SNs to maximize the coverage degree and connection degree, and meanwhile minimize the overall deployment cost. In addition, this work fully considers the heterogeneity of SNs (i.e. differentiated sensing range and deployment cost) and three-dimensional (3-D) deployment scenarios. This is a multi-objective optimization problem, non-convex, multimodal and NP-hard. To solve it, we develop a novel swarm-based multi-objective optimization algorithm, known as the competitive multi-objective marine predators algorithm (CMOMPA) whose performance is verified by comprehensive comparative experiments with ten other stateof-the-art multi-objective optimization algorithms. The computational results demonstrate that CMOMPA is superior to others in terms of convergence and accuracy and shows excellent performance on multimodal multiobjective optimization problems. Sufficient simulations are also conducted to evaluate the effectiveness of the CMOMPA based optimal SNs deployment method. The results show that the optimized deployment can balance the trade-off among deployment cost, sensing reliability and network reliability. The source code is available on https://github.com/iNet-WZU/CMOMPA.

preprint2022arXiv

Classification-Then-Grounding: Reformulating Video Scene Graphs as Temporal Bipartite Graphs

Today's VidSGG models are all proposal-based methods, i.e., they first generate numerous paired subject-object snippets as proposals, and then conduct predicate classification for each proposal. In this paper, we argue that this prevalent proposal-based framework has three inherent drawbacks: 1) The ground-truth predicate labels for proposals are partially correct. 2) They break the high-order relations among different predicate instances of a same subject-object pair. 3) VidSGG performance is upper-bounded by the quality of the proposals. To this end, we propose a new classification-then-grounding framework for VidSGG, which can avoid all the three overlooked drawbacks. Meanwhile, under this framework, we reformulate the video scene graphs as temporal bipartite graphs, where the entities and predicates are two types of nodes with time slots, and the edges denote different semantic roles between these nodes. This formulation takes full advantage of our new framework. Accordingly, we further propose a novel BIpartite Graph based SGG model: BIG. It consists of a classification stage and a grounding stage, where the former aims to classify the categories of all the nodes and the edges, and the latter tries to localize the temporal location of each relation instance. Extensive ablations on two VidSGG datasets have attested to the effectiveness of our framework and BIG. Code is available at https://github.com/Dawn-LX/VidSGG-BIG.

preprint2022arXiv

Correspondence Matters for Video Referring Expression Comprehension

We investigate the problem of video Referring Expression Comprehension (REC), which aims to localize the referent objects described in the sentence to visual regions in the video frames. Despite the recent progress, existing methods suffer from two problems: 1) inconsistent localization results across video frames; 2) confusion between the referent and contextual objects. To this end, we propose a novel Dual Correspondence Network (dubbed as DCNet) which explicitly enhances the dense associations in both the inter-frame and cross-modal manners. Firstly, we aim to build the inter-frame correlations for all existing instances within the frames. Specifically, we compute the inter-frame patch-wise cosine similarity to estimate the dense alignment and then perform the inter-frame contrastive learning to map them close in feature space. Secondly, we propose to build the fine-grained patch-word alignment to associate each patch with certain words. Due to the lack of this kind of detailed annotations, we also predict the patch-word correspondence through the cosine similarity. Extensive experiments demonstrate that our DCNet achieves state-of-the-art performance on both video and image REC benchmarks. Furthermore, we conduct comprehensive ablation studies and thorough analyses to explore the optimal model designs. Notably, our inter-frame and cross-modal contrastive losses are plug-and-play functions and are applicable to any video REC architectures. For example, by building on top of Co-grounding, we boost the performance by 1.48% absolute improvement on Accu.@0.5 for VID-Sentence dataset.

preprint2022arXiv

Cost-sensitive Boosting Pruning Trees for depression detection on Twitter

Depression is one of the most common mental health disorders, and a large number of depressed people commit suicide each year. Potential depression sufferers usually do not consult psychological doctors because they feel ashamed or are unaware of any depression, which may result in severe delay of diagnosis and treatment. In the meantime, evidence shows that social media data provides valuable clues about physical and mental health conditions. In this paper, we argue that it is feasible to identify depression at an early stage by mining online social behaviours. Our approach, which is innovative to the practice of depression detection, does not rely on the extraction of numerous or complicated features to achieve accurate depression detection. Instead, we propose a novel classifier, namely, Cost-sensitive Boosting Pruning Trees (CBPT), which demonstrates a strong classification ability on two publicly accessible Twitter depression detection datasets. To comprehensively evaluate the classification capability of the CBPT, we use additional three datasets from the UCI machine learning repository and the CBPT obtains appealing classification results against several state of the arts boosting algorithms. Finally, we comprehensively explore the influence factors of model prediction, and the results manifest that our proposed framework is promising for identifying Twitter users with depression.

preprint2022arXiv

Deep Dynamic Boosted Forest

Random forest is widely exploited as an ensemble learning method. In many practical applications, however, there is still a significant challenge to learn from imbalanced data. To alleviate this limitation, we propose a deep dynamic boosted forest (DDBF), a novel ensemble algorithm that incorporates the notion of hard example mining into random forest. Specically, we propose to measure the quality of each leaf node of every decision tree in the random forest to determine hard examples. By iteratively training and then removing easy examples from training data, we evolve the random forest to focus on hard examples dynamically so as to balance the proportion of samples and learn decision boundaries better. Data can be cascaded through these random forests learned in each iteration in sequence to generate more accurate predictions. Our DDBF outperforms random forest on 5 UCI datasets, MNIST and SATIMAGE, and achieved state-of-the-art results compared to other deep models. Moreover, we show that DDBF is also a new way of sampling and can be very useful and efficient when learning from imbalanced data.

preprint2022arXiv

Deep Motion Prior for Weakly-Supervised Temporal Action Localization

Weakly-Supervised Temporal Action Localization (WSTAL) aims to localize actions in untrimmed videos with only video-level labels. Currently, most state-of-the-art WSTAL methods follow a Multi-Instance Learning (MIL) pipeline: producing snippet-level predictions first and then aggregating to the video-level prediction. However, we argue that existing methods have overlooked two important drawbacks: 1) inadequate use of motion information and 2) the incompatibility of prevailing cross-entropy training loss. In this paper, we analyze that the motion cues behind the optical flow features are complementary informative. Inspired by this, we propose to build a context-dependent motion prior, termed as motionness. Specifically, a motion graph is introduced to model motionness based on the local motion carrier (e.g., optical flow). In addition, to highlight more informative video snippets, a motion-guided loss is proposed to modulate the network training conditioned on motionness scores. Extensive ablation studies confirm that motionness efficaciously models action-of-interest, and the motion-guided loss leads to more accurate results. Besides, our motion-guided loss is a plug-and-play loss function and is applicable with existing WSTAL methods. Without loss of generality, based on the standard MIL pipeline, our method achieves new state-of-the-art performance on three challenging benchmarks, including THUMOS'14, ActivityNet v1.2 and v1.3.

preprint2022arXiv

Detection and Tracking of Multiple Mice Using Part Proposal Networks

The study of mouse social behaviours has been increasingly undertaken in neuroscience research. However, automated quantification of mouse behaviours from the videos of interacting mice is still a challenging problem, where object tracking plays a key role in locating mice in their living spaces. Artificial markers are often applied for multiple mice tracking, which are intrusive and consequently interfere with the movements of mice in a dynamic environment. In this paper, we propose a novel method to continuously track several mice and individual parts without requiring any specific tagging. Firstly, we propose an efficient and robust deep learning based mouse part detection scheme to generate part candidates. Subsequently, we propose a novel Bayesian Integer Linear Programming Model that jointly assigns the part candidates to individual targets with necessary geometric constraints whilst establishing pair-wise association between the detected parts. There is no publicly available dataset in the research community that provides a quantitative test-bed for the part detection and tracking of multiple mice, and we here introduce a new challenging Multi-Mice PartsTrack dataset that is made of complex behaviours and actions. Finally, we evaluate our proposed approach against several baselines on our new datasets, where the results show that our method outperforms the other state-of-the-art approaches in terms of accuracy.

preprint2022arXiv

Embedded Point Iteration Based Recursive Algorithm for Online Identification of Nonlinear Regression Models

This paper presents a novel online identification algorithm for nonlinear regression models. The online identification problem is challenging due to the presence of nonlinear structure in the models. Previous works usually ignore the special structure of nonlinear regression models, in which the parameters can be partitioned into a linear part and a nonlinear part. In this paper, we develop an efficient recursive algorithm for nonlinear regression models based on analyzing the equivalent form of variable projection (VP) algorithm. By introducing the embedded point iteration (EPI) step, the proposed recursive algorithm can properly exploit the coupling relationship of linear parameters and nonlinear parameters. In addition, we theoretically prove that the proposed algorithm is mean-square bounded. Numerical experiments on synthetic data and real-world time series verify the high efficiency and robustness of the proposed algorithm.

preprint2022arXiv

Explicit Image Caption Editing

Given an image and a reference caption, the image caption editing task aims to correct the misalignment errors and generate a refined caption. However, all existing caption editing works are implicit models, ie, they directly produce the refined captions without explicit connections to the reference captions. In this paper, we introduce a new task: Explicit Caption Editing (ECE). ECE models explicitly generate a sequence of edit operations, and this edit operation sequence can translate the reference caption into a refined one. Compared to the implicit editing, ECE has multiple advantages: 1) Explainable: it can trace the whole editing path. 2) Editing Efficient: it only needs to modify a few words. 3) Human-like: it resembles the way that humans perform caption editing, and tries to keep original sentence structures. To solve this new task, we propose the first ECE model: TIger. TIger is a non-autoregressive transformer-based model, consisting of three modules: Tagger_del, Tagger_add, and Inserter. Specifically, Tagger_del decides whether each word should be preserved or not, Tagger_add decides where to add new words, and Inserter predicts the specific word for adding. To further facilitate ECE research, we propose two new ECE benchmarks by re-organizing two existing datasets, dubbed COCO-EE and Flickr30K-EE, respectively. Extensive ablations on both two benchmarks have demonstrated the effectiveness of TIger.

preprint2022arXiv

Finite Element de Rham and Stokes Complexes in Three Dimensions

Finite element de Rham complexes and finite element Stokes complexes with various smoothness in three dimensions are systematically constructed. First smooth scalar finite elements in three dimensions are derived through a non-overlapping decomposition of the simplicial lattice. Based on the smooth scalar finite elements, both H(div)-conforming finite elements and H(curl)-conforming finite elements with various smoothness are devised, which induce the finite element de Rham complexes with various smoothness and the associated commutative diagrams. The div stability is established for the H(div)-conforming finite elements, and the exactness of these finite element complexes.

preprint2022arXiv

Finite elements for div and divdiv conforming symmetric tensors in arbitrary dimension

Several div-conforming and divdiv-conforming finite elements for symmetric tensors on simplexes in arbitrary dimension are constructed in this work. The shape function space is first split as the trace space and the bubble space. The later is further decomposed into the null space of the differential operator and its orthogonal complement. Instead of characterization of these subspaces of the shape function space, characterization of the dual spaces are provided. Vector div-conforming finite elements are firstly constructed as an introductory example. Then new symmetric div-conforming finite elements are constructed. The dual subspaces are then used as build blocks to construct divdiv conforming finite elements.

preprint2022arXiv

Flipping of antiferromagnetic to superconducting states in pressurized quasi-one-dimensional manganese-based compounds

One of the universal features of unconventional superconductors is that the superconducting (SC) state is developed in the proximity of an antiferromagnetic (AFM) state. Understanding the interplay between these two states is one of the key issues to uncover the underlying physics of unconventional SC mechanism. Here, we report a pressure-induced flipping of the AFM state to SC state in the quasi-one-dimensional AMn6Bi5 (A = K, Rb, and Cs) compounds. We find that at a critical pressure the AFM state suddenly disappears at a finite temperature and a SC state simultaneously emerges at a lower temperature without detectable structural changes. Intriguingly, all members of the family present the AFM-SC transition at almost the same critical pressures (Pc), though their ambient-pressure unit-cell volumes vary substantially. Our theoretical calculations indicate that the increasing weight of dxz orbital electrons near Fermi energy under the pressure may be the origin of the flipping. These results reveal a diversity of competing nature between the AFM and SC states among the 3d-transition-metal compounds.

preprint2022arXiv

From differential equation solvers to accelerated first-order methods for convex optimization

Convergence analysis of accelerated first-order methods for convex optimization problems are presented from the point of view of ordinary differential equation solvers. A new dynamical system, called Nesterov accelerated gradient flow, has been derived from the connection between acceleration mechanism and $A$-stability of ODE solvers, and the exponential decay of a tailored Lyapunov function along with the solution trajectory is proved. Numerical discretizations are then considered and convergence rates are established via a unified discrete Lyapunov function. The proposed differential equation solver approach can not only cover existing accelerated methods, such as FISTA, Güler's proximal algorithm and Nesterov's accelerated gradient method, but also produce new algorithms for composite convex optimization that possess accelerated convergence rates.

preprint2022arXiv

Immersed Virtual Element Methods for Elliptic Interface Problems in Two Dimensions

This article presents an immersed virtual element method for solving a class of interface problems that combines the advantages of both body-fitted mesh methods and unfitted mesh methods. A background body-fitted mesh is generated initially. On those interface elements, virtual element spaces are constructed as solution spaces to local interface problems, and exact sequences can be established for these new spaces involving discontinuous coefficients. The discontinuous coefficients of interface problems are recast as Hodge star operators that are the key to project immersed virtual functions to classic immersed finite element (IFE) functions for computing numerical solutions. An a priori convergence analysis is established robust with respect to the interface location. The proposed method is capable of handling more complicated interface element configuration and provides better performance than the conventional penalty-type IFE method for the H(curl)-interface problem arising from Maxwell equations. It also brings a connection between various methods such as body-fitted methods, IFE methods, virtual element methods, etc.

preprint2022arXiv

Integrating Object-aware and Interaction-aware Knowledge for Weakly Supervised Scene Graph Generation

Recently, increasing efforts have been focused on Weakly Supervised Scene Graph Generation (WSSGG). The mainstream solution for WSSGG typically follows the same pipeline: they first align text entities in the weak image-level supervisions (e.g., unlocalized relation triplets or captions) with image regions, and then train SGG models in a fully-supervised manner with aligned instance-level "pseudo" labels. However, we argue that most existing WSSGG works only focus on object-consistency, which means the grounded regions should have the same object category label as text entities. While they neglect another basic requirement for an ideal alignment: interaction-consistency, which means the grounded region pairs should have the same interactions (i.e., visual relations) as text entity pairs. Hence, in this paper, we propose to enhance a simple grounding module with both object-aware and interaction-aware knowledge to acquire more reliable pseudo labels. To better leverage these two types of knowledge, we regard them as two teachers and fuse their generated targets to guide the training process of our grounding module. Specifically, we design two different strategies to adaptively assign weights to different teachers by assessing their reliability on each training sample. Extensive experiments have demonstrated that our method consistently improves WSSGG performance on various kinds of weak supervision.

preprint2022arXiv

Label Semantic Knowledge Distillation for Unbiased Scene Graph Generation

The Scene Graph Generation (SGG) task aims to detect all the objects and their pairwise visual relationships in a given image. Although SGG has achieved remarkable progress over the last few years, almost all existing SGG models follow the same training paradigm: they treat both object and predicate classification in SGG as a single-label classification problem, and the ground-truths are one-hot target labels. However, this prevalent training paradigm has overlooked two characteristics of current SGG datasets: 1) For positive samples, some specific subject-object instances may have multiple reasonable predicates. 2) For negative samples, there are numerous missing annotations. Regardless of the two characteristics, SGG models are easy to be confused and make wrong predictions. To this end, we propose a novel model-agnostic Label Semantic Knowledge Distillation (LS-KD) for unbiased SGG. Specifically, LS-KD dynamically generates a soft label for each subject-object instance by fusing a predicted Label Semantic Distribution (LSD) with its original one-hot target label. LSD reflects the correlations between this instance and multiple predicate categories. Meanwhile, we propose two different strategies to predict LSD: iterative self-KD and synchronous self-KD. Extensive ablations and results on three SGG tasks have attested to the superiority and generality of our proposed LS-KD, which can consistently achieve decent trade-off performance between different predicate categories.

preprint2022arXiv

Learning 3D Semantics from Pose-Noisy 2D Images with Hierarchical Full Attention Network

We propose a novel framework to learn 3D point cloud semantics from 2D multi-view image observations containing pose error. On the one hand, directly learning from the massive, unstructured and unordered 3D point cloud is computationally and algorithmically more difficult than learning from compactly-organized and context-rich 2D RGB images. On the other hand, both LiDAR point cloud and RGB images are captured in standard automated-driving datasets. This motivates us to conduct a "task transfer" paradigm so that 3D semantic segmentation benefits from aggregating 2D semantic cues, albeit pose noises are contained in 2D image observations. Among all difficulties, pose noise and erroneous prediction from 2D semantic segmentation approaches are the main challenges for the task transfer. To alleviate the influence of those factor, we perceive each 3D point using multi-view images and for each single image a patch observation is associated. Moreover, the semantic labels of a block of neighboring 3D points are predicted simultaneously, enabling us to exploit the point structure prior to further improve the performance. A hierarchical full attention network~(HiFANet) is designed to sequentially aggregates patch, bag-of-frames and inter-point semantic cues, with hierarchical attention mechanism tailored for different level of semantic cues. Also, each preceding attention block largely reduces the feature size before feeding to the next attention block, making our framework slim. Experiment results on Semantic-KITTI show that the proposed framework outperforms existing 3D point cloud based methods significantly, it requires much less training data and exhibits tolerance to pose noise. The code is available at https://github.com/yuhanghe01/HiFANet.

preprint2022arXiv

On Pursuit of Designing Multi-modal Transformer for Video Grounding

Video grounding aims to localize the temporal segment corresponding to a sentence query from an untrimmed video. Almost all existing video grounding methods fall into two frameworks: 1) Top-down model: It predefines a set of segment candidates and then conducts segment classification and regression. 2) Bottom-up model: It directly predicts frame-wise probabilities of the referential segment boundaries. However, all these methods are not end-to-end, i.e., they always rely on some time-consuming post-processing steps to refine predictions. To this end, we reformulate video grounding as a set prediction task and propose a novel end-to-end multi-modal Transformer model, dubbed as GTR. Specifically, GTR has two encoders for video and language encoding, and a cross-modal decoder for grounding prediction. To facilitate the end-to-end training, we use a Cubic Embedding layer to transform the raw videos into a set of visual tokens. To better fuse these two modalities in the decoder, we design a new Multi-head Cross-Modal Attention. The whole GTR is optimized via a Many-to-One matching loss. Furthermore, we conduct comprehensive studies to investigate different model design choices. Extensive results on three benchmarks have validated the superiority of GTR. All three typical GTR variants achieve record-breaking performance on all datasets and metrics, with several times faster inference speed.

preprint2022arXiv

Proximal Implicit ODE Solvers for Accelerating Learning Neural ODEs

Learning neural ODEs often requires solving very stiff ODE systems, primarily using explicit adaptive step size ODE solvers. These solvers are computationally expensive, requiring the use of tiny step sizes for numerical stability and accuracy guarantees. This paper considers learning neural ODEs using implicit ODE solvers of different orders leveraging proximal operators. The proximal implicit solver consists of inner-outer iterations: the inner iterations approximate each implicit update step using a fast optimization algorithm, and the outer iterations solve the ODE system over time. The proximal implicit ODE solver guarantees superiority over explicit solvers in numerical stability and computational efficiency. We validate the advantages of proximal implicit solvers over existing popular neural ODE solvers on various challenging benchmark tasks, including learning continuous-depth graph neural networks and continuous normalizing flows.

preprint2022arXiv

Renormalization of the axial current operator in dimensional regularization at four-loop in QCD

We provide the renormalization constants of the axial current operators, both singlet and non-singlet, in dimensional regularization up to four-loop order in QCD, determined using the off-shell Ward-Takahashi identity for an axial current with a non-anticommuting $γ_5$. A possible application of the result for the singlet axial current operator is the extraction of the non-decoupling mass logarithms in the axial quark form factors.

preprint2022arXiv

Rethinking Data Augmentation for Robust Visual Question Answering

Data Augmentation (DA) -- generating extra training samples beyond original training set -- has been widely-used in today's unbiased VQA models to mitigate the language biases. Current mainstream DA strategies are synthetic-based methods, which synthesize new samples by either editing some visual regions/words, or re-generating them from scratch. However, these synthetic samples are always unnatural and error-prone. To avoid this issue, a recent DA work composes new augmented samples by randomly pairing pristine images and other human-written questions. Unfortunately, to guarantee augmented samples have reasonable ground-truth answers, they manually design a set of heuristic rules for several question types, which extremely limits its generalization abilities. To this end, we propose a new Knowledge Distillation based Data Augmentation for VQA, dubbed KDDAug. Specifically, we first relax the requirements of reasonable image-question pairs, which can be easily applied to any question types. Then, we design a knowledge distillation (KD) based answer assignment to generate pseudo answers for all composed image-question pairs, which are robust to both in-domain and out-of-distribution settings. Since KDDAug is a model-agnostic DA strategy, it can be seamlessly incorporated into any VQA architectures. Extensive ablation studies on multiple backbones and benchmarks have demonstrated the effectiveness and generalization abilities of KDDAug.

preprint2022arXiv

SATr: Slice Attention with Transformer for Universal Lesion Detection

Universal Lesion Detection (ULD) in computed tomography plays an essential role in computer-aided diagnosis. Promising ULD results have been reported by multi-slice-input detection approaches which model 3D context from multiple adjacent CT slices, but such methods still experience difficulty in obtaining a global representation among different slices and within each individual slice since they only use convolution-based fusion operations. In this paper, we propose a novel Slice Attention Transformer (SATr) block which can be easily plugged into convolution-based ULD backbones to form hybrid network structures. Such newly formed hybrid backbones can better model long-distance feature dependency via the cascaded self-attention modules in the Transformer block while still holding a strong power of modeling local features with the convolutional operations in the original backbone. Experiments with five state-of-the-art methods show that the proposed SATr block can provide an almost free boost to lesion detection accuracy without extra hyperparameters or special network designs.

preprint2022arXiv

Shapley Counterfactual Credits for Multi-Agent Reinforcement Learning

Centralized Training with Decentralized Execution (CTDE) has been a popular paradigm in cooperative Multi-Agent Reinforcement Learning (MARL) settings and is widely used in many real applications. One of the major challenges in the training process is credit assignment, which aims to deduce the contributions of each agent according to the global rewards. Existing credit assignment methods focus on either decomposing the joint value function into individual value functions or measuring the impact of local observations and actions on the global value function. These approaches lack a thorough consideration of the complicated interactions among multiple agents, leading to an unsuitable assignment of credit and subsequently mediocre results on MARL. We propose Shapley Counterfactual Credit Assignment, a novel method for explicit credit assignment which accounts for the coalition of agents. Specifically, Shapley Value and its desired properties are leveraged in deep MARL to credit any combinations of agents, which grants us the capability to estimate the individual credit for each agent. Despite this capability, the main technical difficulty lies in the computational complexity of Shapley Value who grows factorially as the number of agents. We instead utilize an approximation method via Monte Carlo sampling, which reduces the sample complexity while maintaining its effectiveness. We evaluate our method on StarCraft II benchmarks across different scenarios. Our method outperforms existing cooperative MARL algorithms significantly and achieves the state-of-the-art, with especially large margins on tasks with more severe difficulties.

preprint2022arXiv

SWIPENET: Object detection in noisy underwater images

In recent years, deep learning based object detection methods have achieved promising performance in controlled environments. However, these methods lack sufficient capabilities to handle underwater object detection due to these challenges: (1) images in the underwater datasets and real applications are blurry whilst accompanying severe noise that confuses the detectors and (2) objects in real applications are usually small. In this paper, we propose a novel Sample-WeIghted hyPEr Network (SWIPENET), and a robust training paradigm named Curriculum Multi-Class Adaboost (CMA), to address these two problems at the same time. Firstly, the backbone of SWIPENET produces multiple high resolution and semantic-rich Hyper Feature Maps, which significantly improve small object detection. Secondly, a novel sample-weighted detection loss function is designed for SWIPENET, which focuses on learning high weight samples and ignore learning low weight samples. Moreover, inspired by the human education process that drives the learning from easy to hard concepts, we here propose the CMA training paradigm that first trains a clean detector which is free from the influence of noisy data. Then, based on the clean detector, multiple detectors focusing on learning diverse noisy data are trained and incorporated into a unified deep ensemble of strong noise immunity. Experiments on two underwater robot picking contest datasets (URPC2017 and URPC2018) show that the proposed SWIPENET+CMA framework achieves better accuracy in object detection against several state-of-the-art approaches.

preprint2022arXiv

The $\bar{\mathrm{MS}}$ renormalization constant of the singlet axial current operator at $\mathcal{O}(α_s^5)$ in QCD

We provide the $\bar{\mathrm{MS}}$ factor of the renormalization constant of the singlet axial-current operator in dimensional regularization at $\mathcal{O}(α_s^5)$ in perturbative Quantum Chromodynamics (QCD). The result is obtained from a formula derived using the Adler-Bell-Jackiw equation in terms of renormalized operators. The required input consists of the complete four-loop results for operator renormalization constants obtained by explicit diagrammatic computation in a previous publication.

preprint2022arXiv

The Devil is in the Labels: Noisy Label Correction for Robust Scene Graph Generation

Unbiased SGG has achieved significant progress over recent years. However, almost all existing SGG models have overlooked the ground-truth annotation qualities of prevailing SGG datasets, i.e., they always assume: 1) all the manually annotated positive samples are equally correct; 2) all the un-annotated negative samples are absolutely background. In this paper, we argue that both assumptions are inapplicable to SGG: there are numerous "noisy" groundtruth predicate labels that break these two assumptions, and these noisy samples actually harm the training of unbiased SGG models. To this end, we propose a novel model-agnostic NoIsy label CorrEction strategy for SGG: NICE. NICE can not only detect noisy samples but also reassign more high-quality predicate labels to them. After the NICE training, we can obtain a cleaner version of SGG dataset for model training. Specifically, NICE consists of three components: negative Noisy Sample Detection (Neg-NSD), positive NSD (Pos-NSD), and Noisy Sample Correction (NSC). Firstly, in Neg-NSD, we formulate this task as an out-of-distribution detection problem, and assign pseudo labels to all detected noisy negative samples. Then, in Pos-NSD, we use a clustering-based algorithm to divide all positive samples into multiple sets, and treat the samples in the noisiest set as noisy positive samples. Lastly, in NSC, we use a simple but effective weighted KNN to reassign new predicate labels to noisy positive samples. Extensive results on different backbones and tasks have attested to the effectiveness and generalization abilities of each component of NICE.

preprint2022arXiv

The scope for AI-augmented interpretation of building blueprints in commercial and industrial property insurance

This report, commissioned by the WTW research network, investigates the use of AI in property risk assessment. It (i) reviews existing work on risk assessment in commercial and industrial properties and automated information extraction from building blueprints; and (ii) presents an exploratory 'proof-of concept-solution' exploring the feasibility of using machine learning for the automated extraction of information from building blueprints to support insurance risk assessment.

preprint2022arXiv

Unified Group Fairness on Federated Learning

Federated learning (FL) has emerged as an important machine learning paradigm where a global model is trained based on the private data from distributed clients. However, most of existing FL algorithms cannot guarantee the performance fairness towards different groups because of data distribution shift over groups. In this paper, we formulate the problem of unified group fairness on FL, where the groups can be formed by clients (including existing clients and newly added clients) and sensitive attribute(s). To solve this problem, we first propose a general fair federated framework. Then we construct a unified group fairness risk from the view of federated uncertainty set with theoretical analyses to guarantee unified group fairness on FL. We also develop an efficient federated optimization algorithm named Federated Mirror Descent Ascent with Momentum Acceleration (FMDA-M) with convergence guarantee. We validate the advantages of the FMDA-M algorithm with various kinds of distribution shift settings in experiments, and the results show that FMDA-M algorithm outperforms the existing fair FL algorithms on unified group fairness.

preprint2022arXiv

ZH production in gluon fusion at NLO in QCD

We present fully differential next-to-leading order results for Higgs production in association with a $Z$ boson in gluon fusion. Our two-loop virtual contributions are evaluated numerically using sector decomposition, including full top-quark mass effects, and supplemented at high $p_T$ by an analytic high-energy expansion to order ($m_Z^4, m_H^4, m_t^{32}$). Using the expanded results we also present a study of the top-quark mass scheme uncertainty at large $p_T$.

preprint2021arXiv

Class balanced underwater object detection dataset generated by class-wise style augmentation

Underwater object detection technique is of great significance for various applications in underwater the scenes. However, class imbalance issue is still an unsolved bottleneck for current underwater object detection algorithms. It leads to large precision discrepancies among different classes that the dominant classes with more training data achieve higher detection precisions while the minority classes with fewer training data achieves much lower detection precisions. In this paper, we propose a novel class-wise style augmentation (CWSA) algorithm to generate a class-balanced underwater dataset Balance18 from the public contest underwater dataset URPC2018. CWSA is a new kind of data augmentation technique which augments the training data for the minority classes by generating various colors, textures and contrasts for the minority classes. Compare with previous data augmentation algorithms such flipping, cropping and rotations, CWSA is able to generate a class balanced underwater dataset with diverse color distortions and haze-effects.

preprint2021arXiv

Finite elements for divdiv-conforming symmetric tensors

Two types of finite element spaces on triangles are constructed for div-div conforming symmetric tensors. Besides the normal-normal continuity, the stress tensor is continuous at vertices and another trace involving combination of derivatives of stress is identified. Polynomial complex, finite element complex, and Hilbert complex are presented and a commuting diagram between them is given. The constructed div-div conforming elements are exploited to discretize the mixed formulation of the biharmonic equation. Optimal order and superconvergence error analysis is provided. By rotation, finite elements for rot-rot conforming symmetric strain are also obtained.

preprint2021arXiv

Finite elements for divdiv-conforming symmetric tensors in three dimensions

Two types of finite element spaces on a tetrahedron are constructed for divdiv conforming symmetric tensors in three dimensions. The key tools of the construction are the decomposition of polynomial tensor spaces and the characterization of the trace operators. First, the divdiv Hilbert complex and its corresponding polynomial complexes are presented. Several decompositions of polynomial vector and tensors spaces are derived from the polynomial complexes. Then, traces for div-div operator are characterized through a Green's identity. Besides the normal-normal component, another trace involving combination of first order derivatives of the tensor is continuous across the face. Due to the smoothness of polynomials, the symmetric tensor element is also continuous at vertices, and on the plane orthogonal to each edge. Third, a finite element for sym curl-conforming trace-free tensors is constructed following the same approach. Finally, a finite element divdiv complex, as well as the bubble functions complex, in three dimensions are established.

preprint2020arXiv

A Benchmark dataset for both underwater image enhancement and underwater object detection

Underwater image enhancement is such an important vision task due to its significance in marine engineering and aquatic robot. It is usually work as a pre-processing step to improve the performance of high level vision tasks such as underwater object detection. Even though many previous works show the underwater image enhancement algorithms can boost the detection accuracy of the detectors, no work specially focus on investigating the relationship between these two tasks. This is mainly because existing underwater datasets lack either bounding box annotations or high quality reference images, based on which detection accuracy or image quality assessment metrics are calculated. To investigate how the underwater image enhancement methods influence the following underwater object detection tasks, in this paper, we provide a large-scale underwater object detection dataset with both bounding box annotations and high quality reference images, namely OUC dataset. The OUC dataset provides a platform for researchers to comprehensive study the influence of underwater image enhancement algorithms on the underwater object detection task.

preprint2020arXiv

A CNN Framenwork Based on Line Annotations for Detecting Nematodes in Microscopic Images

Plant parasitic nematodes cause damage to crop plants on a global scale. Robust detection on image data is a prerequisite for monitoring such nematodes, as well as for many biological studies involving the nematode C. elegans, a common model organism. Here, we propose a framework for detecting worm-shaped objects in microscopic images that is based on convolutional neural networks (CNNs). We annotate nematodes with curved lines along the body, which is more suitable for worm-shaped objects than bounding boxes. The trained model predicts worm skeletons and body endpoints. The endpoints serve to untangle the skeletons from which segmentation masks are reconstructed by estimating the body width at each location along the skeleton. With light-weight backbone networks, we achieve 75.85 % precision, 73.02 % recall on a potato cyst nematode data set and 84.20 % precision, 85.63 % recall on a public C. elegans data set.

preprint2020arXiv

A gradient descent akin method for inequality constrained optimization

We propose a first-order method for solving inequality constrained optimization problems. The method is derived from our previous work [12], a modified search direction method (MSDM) that applies the singular-value decomposition of normalized gradients. In this work, we simplify its computational framework to a "gradient descent akin" method, i.e., the search direction is computed using a linear combination of the negative and normalized objective and constraint gradient. The main focus of this work is to provide a mathematical aspect to the method. We analyze the global behavior and convergence of the method using a dynamical systems approach. We then prove that the resulting trajectories find local solutions by asymptotically converging to the central path(s) for the logarithmic barrier interior-point method under the so-called relative convex condition. Numerical examples are reported, which include both common test examples and applications in shape optimization.

preprint2020arXiv

AIM 2020 Challenge on Efficient Super-Resolution: Methods and Results

This paper reviews the AIM 2020 challenge on efficient single image super-resolution with focus on the proposed solutions and results. The challenge task was to super-resolve an input image with a magnification factor x4 based on a set of prior examples of low and corresponding high resolution images. The goal is to devise a network that reduces one or several aspects such as runtime, parameter count, FLOPs, activations, and memory consumption while at least maintaining PSNR of MSRResNet. The track had 150 registered participants, and 25 teams submitted the final results. They gauge the state-of-the-art in efficient single image super-resolution.

preprint2020arXiv

Comparison of Different Methods for Time Sequence Prediction in Autonomous Vehicles

As a combination of various kinds of technologies, autonomous vehicles could complete a series of driving tasks by itself, such as perception, decision-making, planning, and control. Since there is no human driver to handle the emergency situation, future transportation information is significant for automated vehicles. This paper proposes different methods to forecast the time series for autonomous vehicles, which are the nearest neighborhood (NN), fuzzy coding (FC), and long short term memory (LSTM). First, the formulation and operational process for these three approaches are introduced. Then, the vehicle velocity is regarded as a case study and the real-world dataset is utilized to predict future information via these techniques. Finally, the performance, merits, and drawbacks of the presented methods are analyzed and discussed.

preprint2020arXiv

Counterfactual Samples Synthesizing for Robust Visual Question Answering

Despite Visual Question Answering (VQA) has realized impressive progress over the last few years, today's VQA models tend to capture superficial linguistic correlations in the train set and fail to generalize to the test set with different QA distributions. To reduce the language biases, several recent works introduce an auxiliary question-only model to regularize the training of targeted VQA model, and achieve dominating performance on VQA-CP. However, since the complexity of design, current methods are unable to equip the ensemble-based models with two indispensable characteristics of an ideal VQA model: 1) visual-explainable: the model should rely on the right visual regions when making decisions. 2) question-sensitive: the model should be sensitive to the linguistic variations in question. To this end, we propose a model-agnostic Counterfactual Samples Synthesizing (CSS) training scheme. The CSS generates numerous counterfactual training samples by masking critical objects in images or words in questions, and assigning different ground-truth answers. After training with the complementary samples (ie, the original and generated samples), the VQA models are forced to focus on all critical objects and words, which significantly improves both visual-explainable and question-sensitive abilities. In return, the performance of these models is further boosted. Extensive ablations have shown the effectiveness of CSS. Particularly, by building on top of the model LMH, we achieve a record-breaking performance of 58.95% on VQA-CP v2, with 6.5% gains.

preprint2020arXiv

Defining Digital Quadruplets in the Cyber-Physical-Social Space for Parallel Driving

Parallel driving is a novel framework to synthesize vehicle intelligence and transport automation. This article aims to define digital quadruplets in parallel driving. In the cyber-physical-social systems (CPSS), based on the ACP method, the names of the digital quadruplets are first given, which are descriptive, predictive, prescriptive and real vehicles. The objectives of the three virtual digital vehicles are interacting, guiding, simulating and improving with the real vehicles. Then, the three virtual components of the digital quadruplets are introduced in detail and their applications are also illustrated. Finally, the real vehicles in the parallel driving system and the research process of the digital quadruplets are depicted. The presented digital quadruplets in parallel driving are expected to make the future connected automated driving safety, efficiently and synergistically.

preprint2020arXiv

Digital Quadruplets for Cyber-Physical-Social Systems based Parallel Driving: From Concept to Applications

Digital quadruplets aiming to improve road safety, traffic efficiency, and driving cooperation for future connected automated vehicles are proposed with the enlightenment of ACP based parallel driving. The ACP method denotes Artificial societies, Computational experiments, and Parallel execution modules for cyber-physical-social systems. Four agents are designed in the framework of digital quadruplets: descriptive vehicles, predictive vehicles, prescriptive vehicles, and real vehicles. The three virtual vehicles (descriptive, predictive, and prescriptive) dynamically interact with the real one in order to enhance the safety and performance of the real vehicle. The details of the three virtual vehicles in the digital quadruplets are described. Then, the interactions between the virtual and real vehicles are presented. The experimental results of the digital quadruplets demonstrate the effectiveness of the proposed framework.

preprint2020arXiv

Distinguish Confusing Law Articles for Legal Judgment Prediction

Legal Judgment Prediction (LJP) is the task of automatically predicting a law case's judgment results given a text describing its facts, which has excellent prospects in judicial assistance systems and convenient services for the public. In practice, confusing charges are frequent, because law cases applicable to similar law articles are easily misjudged. For addressing this issue, the existing method relies heavily on domain experts, which hinders its application in different law systems. In this paper, we present an end-to-end model, LADAN, to solve the task of LJP. To distinguish confusing charges, we propose a novel graph neural network to automatically learn subtle differences between confusing law articles and design a novel attention mechanism that fully exploits the learned differences to extract compelling discriminative features from fact descriptions attentively. Experiments conducted on real-world datasets demonstrate the superiority of our LADAN.

preprint2020arXiv

Hierarchical Fashion Graph Network for Personalized Outfit Recommendation

Fashion outfit recommendation has attracted increasing attentions from online shopping services and fashion communities.Distinct from other scenarios (e.g., social networking or content sharing) which recommend a single item (e.g., a friend or picture) to a user, outfit recommendation predicts user preference on a set of well-matched fashion items.Hence, performing high-quality personalized outfit recommendation should satisfy two requirements -- 1) the nice compatibility of fashion items and 2) the consistence with user preference. However, present works focus mainly on one of the requirements and only consider either user-outfit or outfit-item relationships, thereby easily leading to suboptimal representations and limiting the performance. In this work, we unify two tasks, fashion compatibility modeling and personalized outfit recommendation. Towards this end, we develop a new framework, Hierarchical Fashion Graph Network(HFGN), to model relationships among users, items, and outfits simultaneously. In particular, we construct a hierarchical structure upon user-outfit interactions and outfit-item mappings. We then get inspirations from recent graph neural networks, and employ the embedding propagation on such hierarchical graph, so as to aggregate item information into an outfit representation, and then refine a user's representation via his/her historical outfits. Furthermore, we jointly train these two tasks to optimize these representations. To demonstrate the effectiveness of HFGN, we conduct extensive experiments on a benchmark dataset, and HFGN achieves significant improvements over the state-of-the-art compatibility matching models like NGNN and outfit recommenders like FHN.

preprint2020arXiv

In the Eyes of the Beholder: Analyzing Social Media Use of Neutral and Controversial Terms for COVID-19

During the COVID-19 pandemic, "Chinese Virus" emerged as a controversial term for coronavirus. To some, it may seem like a neutral term referring to the physical origin of the virus. To many others, however, the term is in fact attaching ethnicity to the virus. While both arguments appear reasonable, quantitative analysis of the term's real-world usage is lacking to shed light on the issues behind the controversy. In this paper, we attempt to fill this gap. To model the substantive difference of tweets with controversial terms and those with non-controversial terms, we apply topic modeling and LIWC-based sentiment analysis. To test whether "Chinese Virus" and "COVID-19" are interchangeable, we formulate it as a classification task, mask out these terms, and classify them using the state-of-the-art transformer models. Our experiments consistently show that the term "Chinese Virus" is associated with different substantive topics and sentiment compared with "COVID-19" and that the two terms are easily distinguishable by looking at their context.

preprint2020arXiv

Instance Segmentation of Biomedical Images with an Object-aware Embedding Learned with Local Constraints

Automatic instance segmentation is a problem that occurs in many biomedical applications. State-of-the-art approaches either perform semantic segmentation or refine object bounding boxes obtained from detection methods. Both suffer from crowded objects to varying degrees, merging adjacent objects or suppressing a valid object. In this work, we assign an embedding vector to each pixel through a deep neural network. The network is trained to output embedding vectors of similar directions for pixels from the same object, while adjacent objects are orthogonal in the embedding space, which effectively avoids the fusion of objects in a crowd. Our method yields state-of-the-art results even with a light-weighted backbone network on a cell segmentation (BBBC006 + DSB2018) and a leaf segmentation data set (CVPPP2017). The code and model weights are public available.

preprint2020arXiv

Mercury-related health benefits from retrofitting coal-fired power plants in China

China has implemented retrofitting measures in coal-fired power plants (CFPPs) to reduce air pollution through small unit shutdown (SUS), the installation of air pollution control devices (APCDs) and power generation efficiency (PGE) improvement. The reductions in highly toxic Hg emissions and their related health impacts by these measures have not been well studied. To refine mitigation options, we evaluated the health benefits of reduced Hg emissions via retrofitting measures during China's 12th Five-Year Plan by combining plant-level Hg emission inventories with the China Hg Risk Source-Tracking Model. We found that the measures reduced Hg emissions by 23.5 tons (approximately 1/5 of that from CFPPs in 2010), preventing 0.0021 points of per-foetus intelligence quotient (IQ) decrements and 114 deaths from fatal heart attacks. These benefits were dominated by CFPP shutdowns and APCD installations. Provincial health benefits were largely attributable to Hg reductions in other regions. We also demonstrated the necessity of considering human health impacts, rather than just Hg emission reductions, in selecting Hg control devices. This study also suggests that Hg control strategies should consider various factors, such as CFPP locations, population densities and trade-offs between reductions of total Hg (THg) and Hg2+.

preprint2020arXiv

MixNet: Multi-modality Mix Network for Brain Segmentation

Automated brain structure segmentation is important to many clinical quantitative analysis and diagnoses. In this work, we introduce MixNet, a 2D semantic-wise deep convolutional neural network to segment brain structure in multi-modality MRI images. The network is composed of our modified deep residual learning units. In the unit, we replace the traditional convolution layer with the dilated convolutional layer, which avoids the use of pooling layers and deconvolutional layers, reducing the number of network parameters. Final predictions are made by aggregating information from multiple scales and modalities. A pyramid pooling module is used to capture spatial information of the anatomical structures at the output end. In addition, we test three architectures (MixNetv1, MixNetv2 and MixNetv3) which fuse the modalities differently to see the effect on the results. Our network achieves the state-of-the-art performance. MixNetv2 was submitted to the MRBrainS challenge at MICCAI 2018 and won the 3rd place in the 3-label task. On the MRBrainS2018 dataset, which includes subjects with a variety of pathologies, the overall DSC (Dice Coefficient) of 84.7% (gray matter), 87.3% (white matter) and 83.4% (cerebrospinal fluid) were obtained with only 7 subjects as training data.

preprint2020arXiv

Multi-Task Learning via Co-Attentive Sharing for Pedestrian Attribute Recognition

Learning to predict multiple attributes of a pedestrian is a multi-task learning problem. To share feature representation between two individual task networks, conventional methods like Cross-Stitch and Sluice network learn a linear combination of features or feature subspaces. However, linear combination rules out the complex interdependency between channels. Moreover, spatial information exchanging is less-considered. In this paper, we propose a novel Co-Attentive Sharing (CAS) module which extracts discriminative channels and spatial regions for more effective feature sharing in multi-task learning. The module consists of three branches, which leverage different channels for between-task feature fusing, attention generation and task-specific feature enhancing, respectively. Experiments on two pedestrian attribute recognition datasets show that our module outperforms the conventional sharing units and achieves superior results compared to the state-of-the-art approaches using many metrics.

preprint2020arXiv

On Connections between Regularizations for Improving DNN Robustness

This paper analyzes regularization terms proposed recently for improving the adversarial robustness of deep neural networks (DNNs), from a theoretical point of view. Specifically, we study possible connections between several effective methods, including input-gradient regularization, Jacobian regularization, curvature regularization, and a cross-Lipschitz functional. We investigate them on DNNs with general rectified linear activations, which constitute one of the most prevalent families of models for image classification and a host of other machine learning applications. We shed light on essential ingredients of these regularizations and re-interpret their functionality. Through the lens of our study, more principled and efficient regularizations can possibly be invented in the near future.

preprint2020arXiv

Polarised Amplitudes and Soft-Virtual Cross Sections for $b\bar b \rightarrow ZH$ at NNLO in QCD

Production of the Higgs boson, $H$ in association with a massive vector boson, $V$, i.e., the $VH$ process, plays an important role in the explorations of Higgs physics at the Large Hadron Collider, both for a precise study of Higgs' Standard Model couplings and for probing New Physics. In this publication we present the two-loop corrections in massless quantum chromodynamics (QCD) to the amplitude of the Higgs production associated with a $Z$ boson via the bottom quark-antiquark annihilation channel with a non-vanishing bottom-quark Yukawa coupling, which is a necessary ingredient of the full next-to-next-to-leading-order QCD corrections to the $VH$ process in the five-flavour scheme. The computation is performed by projecting the D-dimensional scattering amplitude directly onto an appropriate set of Lorentz structures related to the linear polarisation states of the $Z$ boson. We provide analytic expressions of the complete set of renormalised polarised amplitudes in terms of polylogarithms of maximum weight four. To give an estimation of the size of contributions from amplitudes considered in this work, we compute numerically the resulting cross sections under the soft-virtual approximation. We also take the opportunity to make a dedicated discussion regarding an interesting subtlety appearing in the conventional form factor decomposition of amplitudes involving axial currents regularised in D dimensions.

preprint2020arXiv

Polarized $q \bar{q} \rightarrow Z +$Higgs amplitudes at two loops in QCD: the interplay between vector and axial vector form factors and a pitfall in applying a non-anticommuting $γ_5$

We consider QCD corrections to two loops for the polarized amplitudes of $q{\bar q}\to Z +$ Higgs boson. First we show how the polarized amplitudes of $b \bar{b} \rightarrow Z h$ associated with a non-vanishing $b$-quark Yukawa coupling and a scalar or pseudoscalar Higgs boson $h$ can be built up solely from vector form factors (FF) of properly grouped classes of diagrams, bypassing completely the need of explicitly manipulating $γ_5$ in dimensional regularization (up to a few "anomalous", i.e., triangle diagrams). We determine the contributions of the triangle diagrams in the heavy top limit. We present the analytic results of the vector FF and the triangle-diagram contributions to the axial vector FF, which are sufficient for deriving the two-loop QCD amplitudes for $b \bar{b} \rightarrow Z h$ with a CP-even and CP-odd Higgs boson $h$. We derive the respective Ward identity for these amplitudes, which are subsequently verified to two-loop order in QCD using these FF. In addition, the FF of a class of corrections to $q \bar{q} \rightarrow ZH$ proportional to the top-Yukawa coupling are obtained analytically to two-loop order in QCD in the heavy-top limit using the Higgs-gluon effective Lagrangian where the top quark is integrated out. We address a pitfall that occurs when applying the non-anticommutating $γ_5$ prescription to this class of contributions that has been overlooked so far in the literature. We attribute this issue to the fact that the absence of certain heavy-mass expanded diagrams in the infinite-mass limit of a scattering amplitude with an axial vector current depends on the particular $γ_5$ prescription in use.

preprint2020arXiv

Randomized Fast Subspace Descent Methods

Randomized Fast Subspace Descent (RFASD) Methods are developed and analyzed for smooth and non-constraint convex optimization problems. The efficiency of the method relies on a space decomposition which is stable in $A$-norm, and meanwhile, the condition number $κ_A$ measured in $A$-norm is small. At each iteration, the subspace is chosen randomly either uniformly or by a probability proportional to the local Lipschitz constants. Then in each chosen subspace, a preconditioned gradient descent method is applied. RFASD converges sublinearly for convex functions and linearly for strongly convex functions. Comparing with the randomized block coordinate descent methods, the convergence of RFASD is faster provided $κ_A$ is small and the subspace decomposition is $A$-stable. This improvement is supported by considering a multilevel space decomposition for Nesterov's `worst' problem.

preprint2020arXiv

Revisiting the Bottom Quark Forward-Backward Asymmetry $A_{\rm {FB}}$ in Electron-Positron Collisions

The bottom quark forward-backward asymmetry $A_{\rm{FB}}$ is a key observable in electron-positron collisions at the $Z^{0}$ peak. In this paper, we employ the Principle of Maximum Conformality (PMC) to fix the $α_s$-running behavior of the next-to-next-to-leading order QCD corrections to $A_{\rm{FB}}$. The resulting PMC scale for this $A_{\rm{FB}}$ is an order of magnitude smaller than the conventional choice $μ_r=M_Z$. This scale has the physically reasonable behavior and reflects the virtuality of its QCD dynamics, which is independent to the choice of renormalization scale. Our analyses show that the effective momentum flow for the bottom quark forward-backward asymmetry should be $μ_r\ll M_Z$ other than the conventionally suggested $μ_r=M_Z$. Moreover, the convergence of perturbative QCD series for $A_{\rm{FB}}$ is greatly improved using the PMC. Our prediction for the bare bottom quark forward-backward asymmetry is refined to be $A^{0,b}_{\rm FB}=0.1004\pm0.0016$, which diminishes the well known tension between the experimental determination for this (pseudo) observable and the respective Standard Model fit to $2.1σ$.

preprint2020arXiv

Robust Lane Detection from Continuous Driving Scenes Using Deep Neural Networks

Lane detection in driving scenes is an important module for autonomous vehicles and advanced driver assistance systems. In recent years, many sophisticated lane detection methods have been proposed. However, most methods focus on detecting the lane from one single image, and often lead to unsatisfactory performance in handling some extremely-bad situations such as heavy shadow, severe mark degradation, serious vehicle occlusion, and so on. In fact, lanes are continuous line structures on the road. Consequently, the lane that cannot be accurately detected in one current frame may potentially be inferred out by incorporating information of previous frames. To this end, we investigate lane detection by using multiple frames of a continuous driving scene, and propose a hybrid deep architecture by combining the convolutional neural network (CNN) and the recurrent neural network (RNN). Specifically, information of each frame is abstracted by a CNN block, and the CNN features of multiple continuous frames, holding the property of time-series, are then fed into the RNN block for feature learning and lane prediction. Extensive experiments on two large-scale datasets demonstrate that, the proposed method outperforms the competing methods in lane detection, especially in handling difficult situations.

preprint2020arXiv

The Adaptability and Challenges of Autonomous Vehicles to Pedestrians in Urban China

China is the world's largest automotive market and is ambitious for autonomous vehicles (AVs) development. As one of the key goals of AVs, pedestrian safety is an important issue in China. Despite the rapid development of driverless technologies in recent years, there is a lack of researches on the adaptability of AVs to pedestrians. To fill the gap, this study would discuss the adaptability of current driverless technologies to China urban pedestrians by reviewing the latest researches. The paper firstly analyzed typical Chinese pedestrian behaviors and summarized the safety demands of pedestrians for AVs through articles and open database data, which are worked as the evaluation criteria. Then, corresponding driverless technologies are carefully reviewed. Finally, the adaptability would be given combining the above analyses. Our review found that autonomous vehicles have trouble in the occluded pedestrian environment and Chinese pedestrians do not accept AVs well. And more explorations should be conducted on standard human-machine interaction, interaction information overload avoidance, occluded pedestrians detection and nation-based receptivity research. The conclusions are very useful for motor corporations and driverless car researchers to place more attention on the complexity of the Chinese pedestrian environment, for transportation experts to protect pedestrian safety in the context of AVs, and for governors to think about making new pedestrians policies to welcome the upcoming driverless cars.

preprint2020arXiv

Underwater object detection using Invert Multi-Class Adaboost with deep learning

In recent years, deep learning based methods have achieved promising performance in standard object detection. However, these methods lack sufficient capabilities to handle underwater object detection due to these challenges: (1) Objects in real applications are usually small and their images are blurry, and (2) images in the underwater datasets and real applications accompany heterogeneous noise. To address these two problems, we first propose a novel neural network architecture, namely Sample-WeIghted hyPEr Network (SWIPENet), for small object detection. SWIPENet consists of high resolution and semantic rich Hyper Feature Maps which can significantly improve small object detection accuracy. In addition, we propose a novel sample-weighted loss function which can model sample weights for SWIPENet, which uses a novel sample re-weighting algorithm, namely Invert Multi-Class Adaboost (IMA), to reduce the influence of noise on the proposed SWIPENet. Experiments on two underwater robot picking contest datasets URPC2017 and URPC2018 show that the proposed SWIPENet+IMA framework achieves better performance in detection accuracy against several state-of-the-art object detection approaches.

preprint2019arXiv

MR-GNN: Multi-Resolution and Dual Graph Neural Network for Predicting Structured Entity Interactions

Predicting interactions between structured entities lies at the core of numerous tasks such as drug regimen and new material design. In recent years, graph neural networks have become attractive. They represent structured entities as graphs and then extract features from each individual graph using graph convolution operations. However, these methods have some limitations: i) their networks only extract features from a fix-sized subgraph structure (i.e., a fix-sized receptive field) of each node, and ignore features in substructures of different sizes, and ii) features are extracted by considering each entity independently, which may not effectively reflect the interaction between two entities. To resolve these problems, we present MR-GNN, an end-to-end graph neural network with the following features: i) it uses a multi-resolution based architecture to extract node features from different neighborhoods of each node, and, ii) it uses dual graph-state long short-term memory networks (L-STMs) to summarize local features of each graph and extracts the interaction features between pairwise graphs. Experiments conducted on real-world datasets show that MR-GNN improves the prediction of state-of-the-art methods.

preprint2019arXiv

The nature of mean-field generation in three classes of optimal dynamos

In recent years, several optimal dynamos have been discovered. They minimize the magnetic energy dissipation or, equivalently, maximize the growth rate at a fixed magnetic Reynolds number. In the optimal dynamo of Willis (2012, Phys. Rev. Lett. 109, 251101), we find mean-field dynamo action for planar averages. One component of the magnetic field grows exponentially while the other decays in an oscillatory fashion near onset. This behavior is different from that of an alpha^2 dynamo, where the two non-vanishing components of the planar averages are coupled and have the same growth rate. For the Willis dynamo, we find that the mean field is excited by a negative turbulent magnetic diffusivity, which has a non-uniform spatial profile near onset. The temporal oscillations in the decaying component are caused by the corresponding component of the diffusivity tensor being complex when the mean field is decaying and, in this way, time-dependent. The growing mean field can be modeled by a negative magnetic diffusivity combined with a positive magnetic hyperdiffusivity. In two other classes of optimal dynamos of Chen et al. (2015, J. Fluid Mech. 783, 23), we find, to some extent, similar mean-field dynamo actions. When the magnetic boundary conditions are mixed, the two components of the planar averaged field grow at different rates when the dynamo is 15% supercritical. When the mean magnetic field satisfies homogeneous boundary conditions (where the magnetic field is tangential to the boundary), mean-field dynamo action is found for one-dimensional averages, but not for planar averages. Despite having different spatial profiles, both dynamos show negative turbulent magnetic diffusivities. Our finding suggests negative turbulent magnetic diffusivities may support a broader class of dynamos than previously thought, including these three optimal dynamos.

preprint2018arXiv

Real-time Multiple People Tracking with Deeply Learned Candidate Selection and Person Re-Identification

Online multi-object tracking is a fundamental problem in time-critical video analysis applications. A major challenge in the popular tracking-by-detection framework is how to associate unreliable detection results with existing tracks. In this paper, we propose to handle unreliable detection by collecting candidates from outputs of both detection and tracking. The intuition behind generating redundant candidates is that detection and tracks can complement each other in different scenarios. Detection results of high confidence prevent tracking drifts in the long term, and predictions of tracks can handle noisy detection caused by occlusion. In order to apply optimal selection from a considerable amount of candidates in real-time, we present a novel scoring function based on a fully convolutional neural network, that shares most computations on the entire image. Moreover, we adopt a deeply learned appearance representation, which is trained on large-scale person re-identification datasets, to improve the identification ability of our tracker. Extensive experiments show that our tracker achieves real-time and state-of-the-art performance on a widely used people tracking benchmark.

Institution

Affiliation not imported yet

This author record came from a source that does not expose affiliation metadata. Once the author claims the profile or we enrich the record from another provider, this section will link to the concrete institution.

Source provenance

Where this author record came from

arxivconfidence 95%

external id: arxiv:2512.23537:author:6:long-chen

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2408.09905:author:22:long-chen

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2410.08988:author:21:long-chen

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2504.00601:author:22:long-chen

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2605.05054:author:9:long-chen

Imported May 20, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2605.08142:author:9:long-chen

Imported May 20, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2605.12878:author:2:long-chen

Imported May 20, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2604.27620:author:8:long-chen