Search arXiv⌕ Search

arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 1,099 records · Page 61Linked to original sources
arXiv2023

Spectroscopic Confirmation of CEERS NIRCam-selected Galaxies at $\boldsymbol{z \simeq 8-10}$

We present JWST/NIRSpec prism spectroscopy of seven galaxies selected from the Cosmic Evolution Early Release Science Survey (CEERS) NIRCam imaging with photometric redshifts z_phot>8. We measure emission line redshifts of z=7.65 and 8.64 for two galaxies, and z=9.77(+0.37,-0.29) and 10.01(+0.14,-0.19) for two others via the detection of continuum breaks consistent with Lyman-alpha opacity from a mostly neutral intergalactic medium. The presence (absense) of strong breaks (strong emission lines) give high confidence that these two galaxies are at z>9.6, but the break-derived redshifts have large uncertainties given the low spectral resolution and relatively low signal-to-noise of the CEERS NIRSpec prism data. The two z~10 sources are relatively luminous (M_UV<-20), with blue continua (-2.3 8 candidates with CEERS NIRSpec spectroscopy do not have secure redshifts, but the absence of emission lines in their spectra is consistent with redshifts z>9.6. We find that z>8 photometric redshifts are generally in agreement (within uncertainties) with the spectroscopic values. However, the photometric redshifts tend to be slightly overestimated (average Delta(z)=0.50+/-0.12), suggesting that current templates do not fully describe the spectra of very high-z sources. Overall, our results solidifies photometric evidence for a high space density of bright galaxies at z>8 compared to theoretical model predictions, and further disfavors an accelerated decline in the integrated UV luminosity density at z>8.

astro-ph.GA↗
arXiv2023

Universal control of superexchange in linear triple quantum dots with an empty mediator

Superexchange is one of the vital resources to realize long-range interaction between distant spins for large-scale quantum computing. Recent experiments have demonstrated coherent oscillations between logical states defined by remote spins whose coupling is given by the superexchange interaction mediated by central spins. Excavating the potential of superexchange requires a full understanding of the interaction in terms of control parameters, which is still lacking in literature. Here, using full configuration interaction calculations, we study a two-electron system in a linear triple-quantum-dot device in which the left and right dots are occupied by a single electron each, whose spin states are defined as qubits. The numerical nature of the full configuration interaction calculations allows access to the microscopic details of the quantum-dot confining potential and electronic wavefunctions, some of which are overlooked in the celebrated Hubbard model but turn out to be critical for the behavior of superexchange. We focus on the detuning regime where the charge ground state yields an empty middle dot. We have found that, when the detunings at the left and right dots are leveled, the superexchange can exhibit a non-monotonic behavior which ranges from positive to negative values as a function of the middle-dot detuning. We further show that a larger relative detuning between the left and right dots causes the magnitude of the superexchange to increase (decrease) for an originally positive (negative) superexchange. We then proceed to show the results for a much larger left-right dot detuning. Our results suggest that even a simple configuration of delocalized two-electron states in a linear triple-quantum-dot device exhibits superexchange energy with non-trivial behaviors, which could have important applications in spin-based quantum computing.

cond-mat.mes-hall↗
arXiv2023

Prompt Tuning Pushes Farther, Contrastive Learning Pulls Closer: A Two-Stage Approach to Mitigate Social Biases

As the representation capability of Pre-trained Language Models (PLMs) improve, there is growing concern that they will inherit social biases from unprocessed corpora. Most previous debiasing techniques used Counterfactual Data Augmentation (CDA) to balance the training corpus. However, CDA slightly modifies the original corpus, limiting the representation distance between different demographic groups to a narrow range. As a result, the debiasing model easily fits the differences between counterfactual pairs, which affects its debiasing performance with limited text resources. In this paper, we propose an adversarial training-inspired two-stage debiasing model using Contrastive learning with Continuous Prompt Augmentation (named CCPA) to mitigate social biases in PLMs' encoding. In the first stage, we propose a data augmentation method based on continuous prompt tuning to push farther the representation distance between sample pairs along different demographic groups. In the second stage, we utilize contrastive learning to pull closer the representation distance between the augmented sample pairs and then fine-tune PLMs' parameters to get debiased encoding. Our approach guides the model to achieve stronger debiasing performance by adding difficulty to the training process. Extensive experiments show that CCPA outperforms baselines in terms of debiasing performance. Meanwhile, experimental results on the GLUE benchmark show that CCPA retains the language modeling capability of PLMs.

cs.CL↗
arXiv2023

An Explainable Deep Framework: Towards Task-Specific Fusion for Multi-to-One MRI Synthesis

Multi-sequence MRI is valuable in clinical settings for reliable diagnosis and treatment prognosis, but some sequences may be unusable or missing for various reasons. To address this issue, MRI synthesis is a potential solution. Recent deep learning-based methods have achieved good performance in combining multiple available sequences for missing sequence synthesis. Despite their success, these methods lack the ability to quantify the contributions of different input sequences and estimate the quality of generated images, making it hard to be practical. Hence, we propose an explainable task-specific synthesis network, which adapts weights automatically for specific sequence generation tasks and provides interpretability and reliability from two sides: (1) visualize the contribution of each input sequence in the fusion stage by a trainable task-specific weighted average module; (2) highlight the area the network tried to refine during synthesizing by a task-specific attention module. We conduct experiments on the BraTS2021 dataset of 1251 subjects, and results on arbitrary sequence synthesis indicate that the proposed method achieves better performance than the state-of-the-art methods. Our code is available at \url{https://github.com/fiy2W/mri_seq2seq}.

eess.IV↗
arXiv2023

Synthesis of Contrast-Enhanced Breast MRI Using Multi-b-Value DWI-based Hierarchical Fusion Network with Attention Mechanism

Magnetic resonance imaging (MRI) is the most sensitive technique for breast cancer detection among current clinical imaging modalities. Contrast-enhanced MRI (CE-MRI) provides superior differentiation between tumors and invaded healthy tissue, and has become an indispensable technique in the detection and evaluation of cancer. However, the use of gadolinium-based contrast agents (GBCA) to obtain CE-MRI may be associated with nephrogenic systemic fibrosis and may lead to bioaccumulation in the brain, posing a potential risk to human health. Moreover, and likely more important, the use of gadolinium-based contrast agents requires the cannulation of a vein, and the injection of the contrast media which is cumbersome and places a burden on the patient. To reduce the use of contrast agents, diffusion-weighted imaging (DWI) is emerging as a key imaging technique, although currently usually complementing breast CE-MRI. In this study, we develop a multi-sequence fusion network to synthesize CE-MRI based on T1-weighted MRI and DWIs. DWIs with different b-values are fused to efficiently utilize the difference features of DWIs. Rather than proposing a pure data-driven approach, we invent a multi-sequence attention module to obtain refined feature maps, and leverage hierarchical representation information fused at different scales while utilizing the contributions from different sequences from a model-driven approach by introducing the weighted difference module. The results show that the multi-b-value DWI-based fusion model can potentially be used to synthesize CE-MRI, thus theoretically reducing or avoiding the use of GBCA, thereby minimizing the burden to patients. Our code is available at \url{https://github.com/Netherlands-Cancer-Institute/CE-MRI}.

eess.IV↗
arXiv2023

Over-The-Air Federated Learning: Status Quo, Open Challenges, and Future Directions

The development of applications based on artificial intelligence and implemented over wireless networks is increasingly rapidly and is expected to grow dramatically in the future. The resulting demand for the aggregation of large amounts of data has caused serious communication bottlenecks in wireless networks and particularly at the network edge. Over-the-air federated learning (OTA-FL), leveraging the superposition feature of multi-access channels (MACs), enables users at the network edge to share spectrum resources and achieves efficient and low-latency global model aggregation. This paper provides a holistic review of progress in OTA-FL and points to potential future research directions. Specifically, we classify OTA-FL from the perspective of system settings, including single-antenna OTA-FL, multi-antenna OTA-FL, and OTA-FL with the aid of the emerging reconfigurable intelligent surface (RIS) technology, and the contributions of existing works in these areas are summarized. Moreover, we discuss the trust, security and privacy aspects of OTA-FL, and highlight concerns arising from security and privacy. Finally, challenges and potential research directions are discussed to promote the future development of OTA-FL in terms of improving system performance, reliability, and trustworthiness. Specifical challenges to be addressed include model distortion under channel fading, the ineffective OTA aggregation of local models trained on substantially unbalanced data, and the limited accessibility and verifiability of individual local models.

eess.SP↗
arXiv2023

ASVspoof 2021: Towards Spoofed and Deepfake Speech Detection in the Wild

Benchmarking initiatives support the meaningful comparison of competing solutions to prominent problems in speech and language processing. Successive benchmarking evaluations typically reflect a progressive evolution from ideal lab conditions towards to those encountered in the wild. ASVspoof, the spoofing and deepfake detection initiative and challenge series, has followed the same trend. This article provides a summary of the ASVspoof 2021 challenge and the results of 54 participating teams that submitted to the evaluation phase. For the logical access (LA) task, results indicate that countermeasures are robust to newly introduced encoding and transmission effects. Results for the physical access (PA) task indicate the potential to detect replay attacks in real, as opposed to simulated physical spaces, but a lack of robustness to variations between simulated and real acoustic environments. The Deepfake (DF) task, new to the 2021 edition, targets solutions to the detection of manipulated, compressed speech data posted online. While detection solutions offer some resilience to compression effects, they lack generalization across different source datasets. In addition to a summary of the top-performing systems for each task, new analyses of influential data factors and results for hidden data subsets, the article includes a review of post-challenge results, an outline of the principal challenge limitations and a road-map for the future of ASVspoof.

cs.SD↗
arXiv2023

Investigating the Dominant Environmental Quenching Process in UVCANDELS/COSMOS Groups

We explore how the fraction of quenched galaxies changes in groups of galaxies with respect to the distance to the center of the group, redshift, and stellar mass to determine the dominant process of environmental quenching in $0.2 < z < 0.8$ groups. We use new UV data from the UVCANDELS project in addition to existing multiband photometry to derive new galaxy physical properties of the group galaxies from the zCOSMOS 20k Group Catalog. Limiting our analysis to a complete sample of log$(M_*/M_{\odot})>10.56$ group galaxies we find that the probability of being quenched increases slowly with decreasing redshift, diverging from the stagnant field galaxy population. A corresponding analysis on how the probability of being quenched increases with time within groups suggests that the dominant environmental quenching process is characterized by slow ($\sim$Gyr) timescales. We find a quenching time of approximately $4.91^{+0.91}_{-1.47} $Gyrs, consistent with the slow processes of strangulation (Larson et al. 1980) and delayed-then-rapid quenching (Wetzel et al. 2013 arXiv:1206.3571v2 [astro-ph.CO]), although more data are needed to confirm this result.

astro-ph.GA↗
arXiv2023

Efficient Coflow Scheduling in Hybrid-Switched Data Center Networks

To improve the application-level communication performance, scheduling of coflows, a collection of parallel flows sharing the same objective, is prevalent in modern data center networks (DCNs). Meanwhile, a hybrid-switched DCN design combining optical circuit switches (OPS) and electrical packet switches (EPS) for transmitting high-volume traffic and low-volume traffic separately has received considerable research attention recently. Efficient scheduling of coflows on hybrid network links is crucial for reducing the overall communication time. However, because of the reconfiguration delay in the circuit switch due to the ultra-high transmission rate and the limitation of bandwidth in the packet switch, coflow scheduling becomes increasingly challenging. The existing coflow scheduling algorithms in hybrid-switched DCNs are all heuristic and provide no performance guarantees. In this work, we propose an approximation algorithm with the worst-case performance guarantee of 2+ λ?, where λ? is a factor related to system parameters and demand characteristics, for single coflow scheduling in hybridswitched DCN to minimize the coflow completion time (CCT). Extensive simulations based on Facebook data traces show that our algorithm outperforms the state-of-the-art schemes Solstice by 1.14? and Reco-Sin by 1.42? in terms of minimizing CCT.

cs.NI↗
arXiv2023

A spatially resolved analysis of star-formation burstiness by comparing UV and H$α$ in galaxies at z$\sim$1 with UVCANDELS

The UltraViolet imaging of the Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey Fields (UVCANDELS) program provides HST/UVIS F275W imaging for four CANDELS fields. We combine this UV imaging with existing HST/near-IR grism spectroscopy from 3D-HST$+$AGHAST to directly compare the resolved rest-frame UV and H$α$ emission for a sample of 979 galaxies at $0.7 1.5$), suggesting that bursty star-formation is likely prevalent in the outskirts of even the most massive galaxies but is likely over-shadowed by their brighter cores. Furthermore, we present the UV-to-H$α$ ratio as a function of galaxy surface brightness, a proxy for stellar mass surface density, and find that regions below $\sim$10$^{7.5}$ M$_\odot$ kpc$^{-2}$ are consistent with bursty star-formation, regardless of their galaxy stellar mass, potentially suggesting that local star-formation is independent of global galaxy properties at the smallest scales. Lastly, we find galaxies at $z>1.1$ to have bursty star-formation regardless of radius or surface brightness.

astro-ph.GA↗
arXiv2023

Clustering of longitudinal curves via a penalized method and EM algorithm

In this article, a new method, called FWP, is proposed for clustering longitudinal curves. In the proposed method, clusters of mean functions are identified through a weighted concave pairwise fusion method. The EM algorithm and the alternating direction method of multiplier algorithm are combined to estimate the group structure, mean functions and the principal components simultaneously. The proposed method also allows to incorporate the prior neighborhood information to have more meaningful groups by adding pairwise weights in the pairwise penalties. In the simulation study, the performance of the proposed method is compared to some existing clustering methods in terms of the accuracy for estimating the number of subgroups and mean functions. The results suggest that ignoring covariance structure will have a great effect on the performance of estimating the number of groups and estimating accuracy. The effect of including pairwise weights is also explored in a spatial lattice setting to take consideration of the spatial information. The results show that incorporating spatial weights will improve the performance. A real example is used to illustrate the proposed method.

stat.ME↗
arXiv2023

The GLASS-JWST Early Release Science Program. II. Stage I release of NIRCam imaging and catalogs in the Abell 2744 region

We present images and a multi-wavelength photometric catalog based on all of the JWST NIRCam observations obtained to date in the region of the Abell 2744 galaxy cluster. These data come from three different programs, namely the GLASS-JWST Early Release Science Program, UNCOVER, and Director's Discretionary Time program 2756. The observed area in the NIRCam wide-band filters - covering the central and extended regions of the cluster, as well as new parallel fields - is 46.5 arcmin$^2$ in total. All images in eight bands (F090W, F115W, F150W, F200W, F277W, F356W, F410M, F444W) have been reduced adopting the latest calibration and reference files available. Data reduction has been performed using an augmented version of the official JWST pipeline, with improvements aimed at removing or mitigating defects in the raw images and improving the background subtraction and photometric accuracy. We obtain a F444W-detected multi-band catalog, including all NIRCam and available HST data, adopting forced aperture photometry on PSF-matched images. The catalog is intended to enable early scientific investigations and is optimized for the study of faint galaxies; it contains 24389 sources, with a 5$σ$ limiting magnitude in the F444W band ranging from 28.5 AB to 30.5 AB, as a result of the varying exposure times of the surveys that observed the field. We publicly release the reduced NIRCam images, associated multi-wavelength catalog and code adopted for $1/f$ noise removal with the aim of aiding users to familiarize themselves with JWST NIRCam data and identify suitable targets for follow-up observations.

astro-ph.GA↗
arXiv2023

Towards single integrated spoofing-aware speaker verification embeddings

This study aims to develop a single integrated spoofing-aware speaker verification (SASV) embeddings that satisfy two aspects. First, rejecting non-target speakers' input as well as target speakers' spoofed inputs should be addressed. Second, competitive performance should be demonstrated compared to the fusion of automatic speaker verification (ASV) and countermeasure (CM) embeddings, which outperformed single embedding solutions by a large margin in the SASV2022 challenge. We analyze that the inferior performance of single SASV embeddings comes from insufficient amount of training data and distinct nature of ASV and CM tasks. To this end, we propose a novel framework that includes multi-stage training and a combination of loss functions. Copy synthesis, combined with several vocoders, is also exploited to address the lack of spoofed data. Experimental results show dramatic improvements, achieving a SASV-EER of 1.06% on the evaluation protocol of the SASV2022 challenge.

eess.AS↗
arXiv2023

A Survey of Graph Prompting Methods: Techniques, Applications, and Challenges

The recent "pre-train, prompt, predict training" paradigm has gained popularity as a way to learn generalizable models with limited labeled data. The approach involves using a pre-trained model and a prompting function that applies a template to input samples, adding indicative context and reformulating target tasks as the pre-training task. However, the design of prompts could be a challenging and time-consuming process in complex tasks. The limitation can be addressed by using graph data, as graphs serve as structured knowledge repositories by explicitly modeling the interaction between entities. In this survey, we review prompting methods from the graph perspective, where prompting functions are augmented with graph knowledge. In particular, we introduce the basic concepts of graph prompt learning, organize the existing work of designing graph prompting functions, and describe their applications and future challenges. This survey will bridge the gap between graphs and prompt design to facilitate future methodology development.

cs.LG↗
arXiv2023

STSyn: Speeding Up Local SGD with Straggler-Tolerant Synchronization

Synchronous local stochastic gradient descent (local SGD) suffers from some workers being idle and random delays due to slow and straggling workers, as it waits for the workers to complete the same amount of local updates. In this paper, to mitigate stragglers and improve communication efficiency, a novel local SGD strategy, named STSyn, is developed. The key point is to wait for the $K$ fastest workers, while keeping all the workers computing continually at each synchronization round, and making full use of any effective (completed) local update of each worker regardless of stragglers. An analysis of the average wall-clock time, average number of local updates and average number of uploading workers per round is provided to gauge the performance of STSyn. The convergence of STSyn is also rigorously established even when the objective function is nonconvex. Experimental results show the superiority of the proposed STSyn against state-of-the-art schemes through utilization of the straggler-tolerant technique and additional effective local updates at each worker, and the influence of system parameters is studied. By waiting for faster workers and allowing heterogeneous synchronization with different numbers of local updates across workers, STSyn provides substantial improvements both in time and communication efficiency.

cs.LG↗
arXiv2023

Controllable Text-to-Image Generation with GPT-4

Current text-to-image generation models often struggle to follow textual instructions, especially the ones requiring spatial reasoning. On the other hand, Large Language Models (LLMs), such as GPT-4, have shown remarkable precision in generating code snippets for sketching out text inputs graphically, e.g., via TikZ. In this work, we introduce Control-GPT to guide the diffusion-based text-to-image pipelines with programmatic sketches generated by GPT-4, enhancing their abilities for instruction following. Control-GPT works by querying GPT-4 to write TikZ code, and the generated sketches are used as references alongside the text instructions for diffusion models (e.g., ControlNet) to generate photo-realistic images. One major challenge to training our pipeline is the lack of a dataset containing aligned text, images, and sketches. We address the issue by converting instance masks in existing datasets into polygons to mimic the sketches used at test time. As a result, Control-GPT greatly boosts the controllability of image generation. It establishes a new state-of-art on the spatial arrangement and object positioning generation and enhances users' control of object positions, sizes, etc., nearly doubling the accuracy of prior models. Our work, as a first attempt, shows the potential for employing LLMs to enhance the performance in computer vision tasks.

cs.CV↗
arXiv2023

Range-Based Equal Error Rate for Spoof Localization

Spoof localization, also called segment-level detection, is a crucial task that aims to locate spoofs in partially spoofed audio. The equal error rate (EER) is widely used to measure performance for such biometric scenarios. Although EER is the only threshold-free metric, it is usually calculated in a point-based way that uses scores and references with a pre-defined temporal resolution and counts the number of misclassified segments. Such point-based measurement overly relies on this resolution and may not accurately measure misclassified ranges. To properly measure misclassified ranges and better evaluate spoof localization performance, we upgrade point-based EER to range-based EER. Then, we adapt the binary search algorithm for calculating range-based EER and compare it with the classical point-based EER. Our analyses suggest utilizing either range-based EER, or point-based EER with a proper temporal resolution can fairly and properly evaluate the performance of spoof localization.

cs.SD↗
arXiv2023

Integrating Listwise Ranking into Pairwise-based Image-Text Retrieval

Image-Text Retrieval (ITR) is essentially a ranking problem. Given a query caption, the goal is to rank candidate images by relevance, from large to small. The current ITR datasets are constructed in a pairwise manner. Image-text pairs are annotated as positive or negative. Correspondingly, ITR models mainly use pairwise losses, such as triplet loss, to learn to rank. Pairwise-based ITR increases positive pair similarity while decreasing negative pair similarity indiscriminately. However, the relevance between dissimilar negative pairs is different. Pairwise annotations cannot reflect this difference in relevance. In the current datasets, pairwise annotations miss many correlations. There are many potential positive pairs among the pairs labeled as negative. Pairwise-based ITR can only rank positive samples before negative samples, but cannot rank negative samples by relevance. In this paper, we integrate listwise ranking into conventional pairwise-based ITR. Listwise ranking optimizes the entire ranking list based on relevance scores. Specifically, we first propose a Relevance Score Calculation (RSC) module to calculate the relevance score of the entire ranked list. Then we choose the ranking metric, Normalized Discounted Cumulative Gain (NDCG), as the optimization objective. We transform the non-differentiable NDCG into a differentiable listwise loss, named Smooth-NDCG (S-NDCG). Our listwise ranking approach can be plug-and-play integrated into current pairwise-based ITR models. Experiments on ITR benchmarks show that integrating listwise ranking can improve the performance of current ITR models and provide more user-friendly retrieval results. The code is available at https://github.com/AAA-Zheng/Listwise_ITR.

cs.CV↗