arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 1,279 records · Page 71Linked to original sources

arXiv2022

First Census of Gas-phase Metallicity Gradients of Star-forming Galaxies in Overdense Environments at Cosmic Noon

We report the first spatially resolved measurements of gas-phase metallicity radial gradients in star-forming galaxies in overdense environments at $z\gtrsim2$. The spectroscopic data are acquired by the \mg\ survey, a Hubble Space Telescope (HST) cycle-28 medium program. This program is obtaining 45 orbits of WFC3/IR grism spectroscopy in the density peak regions of three massive galaxy protoclusters (BOSS 1244, BOSS 1542 and BOSS 1441) at $z=2-3$. Our sample in the BOSS 1244 field consists of 20 galaxies with stellar-mass ranging from $10^{9.0}$ to $10^{10.3}$ \Msun\ , star formation rate (SFR) from 10 to 240 \Msun\,yr$^{-1}$, and global gas-phase metallicity (\oh) from 8.2 to 8.6. At $1σ$ confidence level, 2/20 galaxies in our sample show positive (inverted) gradients -- the relative abundance of oxygen increasing with galactocentric radius, opposite the usual trend. Furthermore, 1/20 shows negative gradients and 17/20 are consistent with flat gradients. This high fraction of flat/inverted gradients is uncommon in simulations and previous observations conducted in blank fields at similar redshifts. To understand this, we investigate the correlations among various observed properties of our sample galaxies. We find an anticorrelation between metallicity gradient and global metallicity of our galaxies residing in extreme overdensities, and a marked deficiency of metallicity in our massive galaxies as compared to their coeval field counterparts. We conclude that the cold-mode gas accretion plays an active role in shaping the chemical evolution of galaxies in the protocluster environments, diluting their central chemical abundance, and flattening/inverting their metallicity gradients.

astro-ph.GA↗

arXiv2022

VerSe: A Vertebrae Labelling and Segmentation Benchmark for Multi-detector CT Images

Vertebral labelling and segmentation are two fundamental tasks in an automated spine processing pipeline. Reliable and accurate processing of spine images is expected to benefit clinical decision-support systems for diagnosis, surgery planning, and population-based analysis on spine and bone health. However, designing automated algorithms for spine processing is challenging predominantly due to considerable variations in anatomy and acquisition protocols and due to a severe shortage of publicly available data. Addressing these limitations, the Large Scale Vertebrae Segmentation Challenge (VerSe) was organised in conjunction with the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) in 2019 and 2020, with a call for algorithms towards labelling and segmentation of vertebrae. Two datasets containing a total of 374 multi-detector CT scans from 355 patients were prepared and 4505 vertebrae have individually been annotated at voxel-level by a human-machine hybrid algorithm (https://osf.io/nqjyw/, https://osf.io/t98fz/). A total of 25 algorithms were benchmarked on these datasets. In this work, we present the the results of this evaluation and further investigate the performance-variation at vertebra-level, scan-level, and at different fields-of-view. We also evaluate the generalisability of the approaches to an implicit domain shift in data by evaluating the top performing algorithms of one challenge iteration on data from the other iteration. The principal takeaway from VerSe: the performance of an algorithm in labelling and segmenting a spine scan hinges on its ability to correctly identify vertebrae in cases of rare anatomical variations. The content and code concerning VerSe can be accessed at: https://github.com/anjany/verse.

cs.CV↗

arXiv2022

Sum of Ranked Range Loss for Supervised Learning

In forming learning objectives, one oftentimes needs to aggregate a set of individual values to a single output. Such cases occur in the aggregate loss, which combines individual losses of a learning model over each training sample, and in the individual loss for multi-label learning, which combines prediction scores over all class labels. In this work, we introduce the sum of ranked range (SoRR) as a general approach to form learning objectives. A ranked range is a consecutive sequence of sorted values of a set of real numbers. The minimization of SoRR is solved with the difference of convex algorithm (DCA). We explore two applications in machine learning of the minimization of the SoRR framework, namely the AoRR aggregate loss for binary/multi-class classification at the sample level and the TKML individual loss for multi-label/multi-class classification at the label level. A combination loss of AoRR and TKML is proposed as a new learning objective for improving the robustness of multi-label learning in the face of outliers in sample and labels alike. Our empirical results highlight the effectiveness of the proposed optimization frameworks and demonstrate the applicability of proposed losses using synthetic and real data sets.

cs.LG↗

arXiv2022

Nonadiabatic geometric quantum computation with cat qubits via invariant-based reverse engineering

We propose a protocol to realize nonadiabatic geometric quantum computation of small-amplitude Schrödinger cat qubits via invariant-based reverse engineering. We consider a system with a two-photon driven Kerr nonlinearity, which provides a pair of dressed even and odd coherent states, i.e., Schrödinger cat states for fault-tolerant quantum computations. An additional coherent field is applied to linearly drive a cavity mode, to induce oscillations between dressed cat states. By designing this linear drive with invariant-based reverse engineering, nonadiabatic geometric quantum computation with cat qubits can be implemented. The performance of the protocol is estimated by taking into account the influence of systematic errors, additive white Gaussian noise, and decoherence including photon loss and dephasing. Numerical results demonstrate that our protocol is robust against these negative factors. Therefore, this protocol may provide a feasible method for nonadiabatic geometric quantum computation in bosonic systems.

quant-ph↗

arXiv2022

Theory on electron-phonon spin dehphasing in GaAs multi-electron double quantum dots

Recent studies reveal that a double-quantum-dot system hosting more than two electrons may be superior in certain aspects as compared to the traditional case in which only two electrons are confined (a singlet-triplet qubit). We study the electron-phonon dephasing occurring in a GaAs multi-electron double-quantum-dot system, in a biased case in which the singlet state is hybridized, as well as in an unbiased case in which the hybridization is absent. We have found that while the electron-phonon dephasing rate increases with the number of electrons confined in the unbiased case, this does not hold in the biased case. We define a merit figure as a ratio between the exchange energy and the dephasing rate, and have shown that in experimentally relevant range of the exchange energy, the merit figure actually increases with the number of electrons in the biased case. Our results show that the multi-electron quantum-dot system has another advantage in mitigating the effect of electron-phonon dephasing, which is previously under-appreciated in the literature.

cond-mat.mes-hall↗

arXiv2022

Cosmological constraints from the density gradient weighted correlation function

The mark weighted correlation function (MCF) $W(s,μ)$ is a computationally efficient statistical measure which can probe clustering information beyond that of the conventional 2-point statistics. In this work, we extend the traditional mark weighted statistics by using powers of the density field gradient $|\nabla ρ/ρ|^α$ as the weight, and use the angular dependence of the scale-averaged MCFs to constrain cosmological parameters. The analysis shows that the gradient based weighting scheme is statistically more powerful than the density based weighting scheme, while combining the two schemes together is more powerful than separately using either of them. Utilising the density weighted or the gradient weighted MCFs with $α=0.5,\ 1$, we can strengthen the constraint on $Ω_m$ by factors of 2 or 4, respectively, compared with the standard 2-point correlation function, while simultaneously using the MCFs of the two weighting schemes together can be $1.25$ times more statistically powerful than using the gradient weighting scheme alone. The mark weighted statistics may play an important role in cosmological analysis of future large-scale surveys. Many issues, including the possibility of using other types of weights, the influence of the bias on this statistics, as well as the usage of MCFs in the tomographic Alcock-Paczynski method, are worth further investigations.

astro-ph.CO↗

arXiv2022

Analyzing Language-Independent Speaker Anonymization Framework under Unseen Conditions

In our previous work, we proposed a language-independent speaker anonymization system based on self-supervised learning models. Although the system can anonymize speech data of any language, the anonymization was imperfect, and the speech content of the anonymized speech was distorted. This limitation is more severe when the input speech is from a domain unseen in the training data. This study analyzed the bottleneck of the anonymization system under unseen conditions. It was found that the domain (e.g., language and channel) mismatch between the training and test data affected the neural waveform vocoder and anonymized speaker vectors, which limited the performance of the whole system. Increasing the training data diversity for the vocoder was found to be helpful to reduce its implicit language and channel dependency. Furthermore, a simple correlation-alignment-based domain adaption strategy was found to be significantly effective to alleviate the mismatch on the anonymized speaker vectors. Audio samples and source code are available online.

cs.SD↗

arXiv2022

Energy-Efficient UAV-Mounted RIS Assisted Mobile Edge Computing

Unmanned aerial vehicle (UAV) and reconfigurable intelligent surface (RIS) have been recently applied in the field of mobile edge computing (MEC) to improve the data exchange environment by proactively changing the wireless channels through maneuverable location deployment and intelligent signals reflection, respectively. Nevertheless, they may suffer from inherent limitations in practical scenarios. UAV-mounted RIS (U-RIS), as a promising integrated approach, can combine the advantages of UAV and RIS to break the limit. Inspired by this, we consider a novel U-RIS assisted MEC system, where a U-RIS is deployed to assist the communication between the ground users and an MEC server. The joint UAV trajectory, RIS passive beamforming and MEC resource allocation design is developed to maximize the energy efficiency (EE) of the system. To tackle the intractable non-convex problem, we divide it into two subproblems and solve them iteratively based on successive convex approximation (SCA) and the Dinkelbach method. Finally we obtain a high-performance suboptimal solution. Simulation results show that the proposed algorithm significantly improves the energy efficiency of the MEC system.

eess.SP↗

arXiv2022

Nonreciprocal waveguide-QED for spinning cavities with multiple coupling points

We investigate chiral emission and the single-photon scattering of spinning cavities coupled to a meandering waveguide at multiple coupling points. It is shown that nonreciprocal photon transmissions occur in the cavities-waveguide system, which stems from interference effects among different coupling points, and frequency shifts induced by the Sagnac effect. The nonlocal interference is akin to the mechanism in giant atoms. In the single-cavity setup, by optimizing the spinning velocity and number of coupling points, the chiral factor can approach 1, and the chiral direction can be freely switched. Moreover, destructive interference gives rise to the complete photon transmission in one direction over the whole optical frequency band, with no analogy in other quantum setups. In the multiple-cavity system, we also investigate the photon transport properties. The results indicate a directional information flow between different nodes. Our proposal provides a novel way to achieve quantum nonreciprocal devices, which can be applied in large-scale quantum chiral networks with optical waveguides.

quant-ph↗

arXiv2022

Submillimetre galaxies in two massive protoclusters at z = 2.24: witnessing the enrichment of extreme starbursts in the outskirts of HAE density peaks

Submillimetre galaxies represent a rapid growth phase of both star formation and massive galaxies. Mapping SMGs in galaxy protoclusters provides key insights into where and how these extreme starbursts take place in connections with the assembly of the large-scale structure in the early Universe. We search for SMGs at 850$\,μm$ using JCMT/SCUBA-2 in two massive protoclusters at $z=2.24$, BOSS1244 and BOSS1542, and detect 43 and 54 sources with $S_{850}>4\,$mJy at the $4σ$ level within an effective area of 264$\,$arcmin$^2$, respectively. We construct the intrinsic number counts and find that the abundance of SMGs is $2.0\pm0.3$ and $2.1\pm0.2$ times that of the general fields, confirming that BOSS1244 and BOSS1542 contain a higher fraction of dusty galaxies with strongly enhanced star formation. The volume densities of the SMGs are estimated to be $\sim15-$30 times the average, significantly higher than the overdensity factor ($\sim 6$) traced by H$α$ emission-line galaxies (HAEs). More importantly, we discover a prominent offset between the spatial distributions of the two populations in these two protoclusters -- SMGs are mostly located around the high-density regions of HAEs, and few are seen inside these regions. This finding may have revealed for the first time the occurrence of violent star formation enhancement in the outskirts of the HAE density peaks, likely driven by the boosting of gas supplies and/or starburst triggering events. Meanwhile, the lack of SMGs inside the most overdense regions at $z\sim2$ implies a transition to the environment disfavouring extreme starbursts.

astro-ph.GA↗

arXiv2022

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.

cs.CV↗

arXiv2022

Compilable Neural Code Generation with Compiler Feedback

Automatically generating compilable programs with (or without) natural language descriptions has always been a touchstone problem for computational linguistics and automated software engineering. Existing deep-learning approaches model code generation as text generation, either constrained by grammar structures in decoder, or driven by pre-trained language models on large-scale code corpus (e.g., CodeGPT, PLBART, and CodeT5). However, few of them account for compilability of the generated programs. To improve compilability of the generated programs, this paper proposes COMPCODER, a three-stage pipeline utilizing compiler feedback for compilable code generation, including language model fine-tuning, compilability reinforcement, and compilability discrimination. Comprehensive experiments on two code generation tasks demonstrate the effectiveness of our proposed approach, improving the success rate of compilation from 44.18 to 89.18 in code completion on average and from 70.3 to 96.2 in text-to-code generation, respectively, when comparing with the state-of-the-art CodeGPT.

cs.CL↗

arXiv2022

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.

cs.CV↗

arXiv2022

Unknown-Aware Object Detection: Learning What You Don't Know from Videos in the Wild

Building reliable object detectors that can detect out-of-distribution (OOD) objects is critical yet underexplored. One of the key challenges is that models lack supervision signals from unknown data, producing overconfident predictions on OOD objects. We propose a new unknown-aware object detection framework through Spatial-Temporal Unknown Distillation (STUD), which distills unknown objects from videos in the wild and meaningfully regularizes the model's decision boundary. STUD first identifies the unknown candidate object proposals in the spatial dimension, and then aggregates the candidates across multiple video frames to form a diverse set of unknown objects near the decision boundary. Alongside, we employ an energy-based uncertainty regularization loss, which contrastively shapes the uncertainty space between the in-distribution and distilled unknown objects. STUD establishes the state-of-the-art performance on OOD detection tasks for object detection, reducing the FPR95 score by over 10% compared to the previous best method. Code is available at https://github.com/deeplearning-wisc/stud.

cs.CV↗

arXiv2022

Sensitivity tests of cosmic velocity fields to massive neutrinos

We investigate impacts of massive neutrinos on the cosmic velocity fields, employing high-resolution cosmological $N$-body simulations provided by the information-optimized CUBE code, where cosmic neutrinos are evolved using collisionless hydrodynamics and their perturbations can be accurately resolved. In this study we focus, for the first time, on the analysis of massive-neutrino induced suppression effects in various cosmic velocity field components of velocity magnitude, divergence, vorticity and dispersion. By varying the neutrino mass sum $M_ν$ from 0 -- 0.4 eV, the simulations show that, the power spectra of vorticity -- exclusively sourced by non-linear structure formation that is affected by massive neutrinos significantly -- is very sensitive to the mass sum, which potentially provide novel signatures in detecting massive neutrinos. Furthermore, using the chi-square statistic, we quantitatively test the sensitivity of the density and velocity power spectra to the neutrino mass sum. Indeed, we find that, the vorticity spectrum has the highest sensitivity, and the null hypothesis of massless neutrinos is incompatible with both vorticity and divergence spectra from $M_ν=0.1$ eV at high significance ($p$-value $= 0.03$ and $0.07$, respectively). These results demonstrate clearly the importance of peculiar velocity field measurements, in particular of vorticity and divergence components, in determination of neutrino mass and mass hierarchy.

astro-ph.CO↗

arXiv2022

Quantum algorithms for estimating quantum entropies

The von Neumann and quantum Rényi entropies characterize fundamental properties of quantum systems and lead to theoretical and practical applications in many fields. Quantum algorithms for estimating quantum entropies, using a quantum query model that prepares the purification of the input state, have been established in the literature. {However, constructing such a model is almost as hard as state tomography.} In this paper, we propose quantum algorithms to estimate the von Neumann and quantum $α$-Rényi entropies of an $n$-qubit quantum state $ρ$ using independent copies of the input state. We also show how to efficiently construct the quantum circuits for {quantum entropy estimation} using primitive single/two-qubit gates. We prove that the number of required copies scales polynomially in $1/ε$ and $1/Λ$, where $ε$ denotes the additive precision and $Λ$ denotes the lower bound on all non-zero eigenvalues. Notably, our method outperforms previous methods in the aspect of practicality since it does not require any quantum query oracles, which are usually necessary for previous methods. Furthermore, we conduct experiments to show the efficacy of our algorithms to single-qubit states and study the noise robustness. We also discuss the applications to some quantum states of practical interest as well as some meaningful tasks such as quantum Gibbs state preparation and entanglement estimation.

quant-ph↗

arXiv2022

Hydrodynamic Relaxation in a Strongly Interacting Fermi Gas

We measure the free decay of a spatially periodic density profile in a normal fluid strongly interacting Fermi gas, which is confined in a box potential. This spatial profile is initially created in thermal equilibrium by a perturbing potential. After the perturbation is abruptly extinguished, the dominant spatial Fourier component exhibits an exponentially decaying (thermally diffusive) mode and a decaying oscillatory (first sound) mode, enabling independent measurement of the thermal conductivity and the shear viscosity directly from the time-dependent evolution.

cond-mat.quant-gas↗

arXiv2022

Adversarial Attack Framework on Graph Embedding Models with Limited Knowledge

With the success of the graph embedding model in both academic and industry areas, the robustness of graph embedding against adversarial attack inevitably becomes a crucial problem in graph learning. Existing works usually perform the attack in a white-box fashion: they need to access the predictions/labels to construct their adversarial loss. However, the inaccessibility of predictions/labels makes the white-box attack impractical to a real graph learning system. This paper promotes current frameworks in a more general and flexible sense -- we demand to attack various kinds of graph embedding models with black-box driven. We investigate the theoretical connections between graph signal processing and graph embedding models and formulate the graph embedding model as a general graph signal process with a corresponding graph filter. Therefore, we design a generalized adversarial attacker: GF-Attack. Without accessing any labels and model predictions, GF-Attack can perform the attack directly on the graph filter in a black-box fashion. We further prove that GF-Attack can perform an effective attack without knowing the number of layers of graph embedding models. To validate the generalization of GF-Attack, we construct the attacker on four popular graph embedding models. Extensive experiments validate the effectiveness of GF-Attack on several benchmark datasets.

cs.LG↗