arXiv subjects

Yu-Ting Chang

Publications and source records attributed to Yu-Ting Chang.

6 recordsLinked to original sources

arXiv2026

The NANOGrav 15 yr Data Set: Impacts of Customized Chromatic Noise Models on Gravitational Wave Analyses

We report updated nHz gravitational wave (GW) significance, characterization, and interpretations using the customized chromatic-noise models (CNMs) developed in Larsen, Baier et al. (2026). for the NANOGrav 15-year data set. We find increased evidence for the Hellings-Downs (HD) correlation signature of the stochastic gravitational wave background (GWB), with a Bayes factor of $1571\pm14$ for HD-correlations over a common uncorrelated red-noise process using a power-law model with $14$ Fourier modes. We find this $\sim8\times$ increase in Bayes factor from Agazie et al. (2023a) is a result of improved noise mitigation. Assuming an analytic null distribution for the frequentist interpulsar correlation statistic, this corresponds to a slightly more significant measurement from $3.16\sigma$ to $3.32\sigma$ against the no-correlation scenario. Spectral inference with CNMs brings the power-law GWB amplitude down to $A_{\rm GWB} = 2.1^{+0.6}_{-0.5}\times10^{-15}$ at fixed $\gamma_{\rm GWB} = 13/3$. In a varied-$\gamma$ analysis, the spectral index increases to $\gamma_{\rm GWB}=3.5^{+0.7}_{-0.6}$. We report updates on an all-sky continuous gravitational wave (CW) search as well as select targeted searches and calculate a $3.2\times$ larger detection volume for the NANOGrav detector. With CNMs, we find reduced evidence for a non-Einsteinian, scalar-transverse mode of gravity. Finally, we reinterpret the GWB first with the assumption of an astrophysical background sourced by SMBHBs and then assuming the more exotic origins of cosmic inflation, a first-order cosmological phase transition, and stable cosmic strings. Under both the SMBHB hypothesis and the cosmological hypotheses, we see only marginal shifts in model parameter posteriors which are consistent with the slightly quieter and steeper power-law GWB spectrum.

astro-ph.CO↗

arXiv2026

The NANOGrav 15 yr Data Set: Customized Chromatic Noise Models

Pulsar timing arrays conduct low-frequency gravitational wave searches, which require comprehensive accounting of various noise sources to achieve robust results. Interstellar propagation effects (e.g., dispersion and scattering) are especially complex noise sources, introducing chromatic delays that can reduce sensitivity to gravitational waves and bias their inference if left unmodeled. These delays also strongly depend on the line of sight properties to each individual pulsar. To address this, we present customized chromatic noise models for 67 pulsars in the NANOGrav 15 yr dataset. These models are selected from an expanded suite of Gaussian processes to simultaneously characterize multiple types of chromatic delays and are tailored to each pulsar's dataset. Alongside probing the interstellar medium, we use these models to infer the solar wind electron density over the course of $\sim 1.5$ solar cycles. We also find evidence for non-dispersive chromatic delays in 21 out of 67 NANOGrav pulsars. After applying our chromatic models, we observe significant impacts on the inference of achromatic noise in 19 out of 67 pulsars, finding in several cases that a previously significant achromatic noise process can be partially or entirely described as chromatic. These results demonstrate that refined noise modeling is essential to enhance the sensitivity and accuracy of low-frequency gravitational wave searches with pulsar timing arrays.

astro-ph.HE↗

arXiv2025

The NANOGrav 15 yr Data Set: Targeted Searches for Supermassive Black Hole Binaries

We present the first targeted searches for continuous gravitational waves (CWs) from 114 active galactic nuclei (AGN) that may host supermassive black hole binaries, using the NANOGrav 15 yr data set. By incorporating electromagnetic priors on sky location, distance, redshift, and CW frequency, our strain and chirp mass upper limits are typically improved by a factor of $\sim 2$ (median 2.2) relative to all-sky limits at the same frequency. Bayesian comparisons against a model including only a Hellings-Downs correlated background disfavors a CW signal for all targets, with a mean Bayes factor of $0.73 \pm 0.32$. Two targets have Bayes factors slightly above unity, but coherence tests, random targeting experiments, and a conservative accounting of the 114-target trials factor all indicate that they are consistent with noise. We use these two candidates as worked examples to illustrate an end-to-end targeted CW search analysis and a suite of follow up tests that future promising candidates would need to pass. We find that the electromagnetic interpretations of both candidates are ambiguous, and we update the constraints on a putative binary in 3C 66B, ruling out part of its previously allowed parameter space. Ultimately, our results demonstrate the current sensitivity of targeted pulsar timing array searches for CWs and define a roadmap for future multimessenger CW detections.

astro-ph.HE↗

arXiv2020

Learning to Caricature via Semantic Shape Transform

Caricature is an artistic drawing created to abstract or exaggerate facial features of a person. Rendering visually pleasing caricatures is a difficult task that requires professional skills, and thus it is of great interest to design a method to automatically generate such drawings. To deal with large shape changes, we propose an algorithm based on a semantic shape transform to produce diverse and plausible shape exaggerations. Specifically, we predict pixel-wise semantic correspondences and perform image warping on the input photo to achieve dense shape transformation. We show that the proposed framework is able to render visually pleasing shape exaggerations while maintaining their facial structures. In addition, our model allows users to manipulate the shape via the semantic map. We demonstrate the effectiveness of our approach on a large photograph-caricature benchmark dataset with comparisons to the state-of-the-art methods.

cs.CV↗

arXiv2020

Weakly-Supervised Semantic Segmentation via Sub-category Exploration

Existing weakly-supervised semantic segmentation methods using image-level annotations typically rely on initial responses to locate object regions. However, such response maps generated by the classification network usually focus on discriminative object parts, due to the fact that the network does not need the entire object for optimizing the objective function. To enforce the network to pay attention to other parts of an object, we propose a simple yet effective approach that introduces a self-supervised task by exploiting the sub-category information. Specifically, we perform clustering on image features to generate pseudo sub-categories labels within each annotated parent class, and construct a sub-category objective to assign the network to a more challenging task. By iteratively clustering image features, the training process does not limit itself to the most discriminative object parts, hence improving the quality of the response maps. We conduct extensive analysis to validate the proposed method and show that our approach performs favorably against the state-of-the-art approaches.

cs.CV↗

arXiv2020

Mixup-CAM: Weakly-supervised Semantic Segmentation via Uncertainty Regularization

Obtaining object response maps is one important step to achieve weakly-supervised semantic segmentation using image-level labels. However, existing methods rely on the classification task, which could result in a response map only attending on discriminative object regions as the network does not need to see the entire object for optimizing the classification loss. To tackle this issue, we propose a principled and end-to-end train-able framework to allow the network to pay attention to other parts of the object, while producing a more complete and uniform response map. Specifically, we introduce the mixup data augmentation scheme into the classification network and design two uncertainty regularization terms to better interact with the mixup strategy. In experiments, we conduct extensive analysis to demonstrate the proposed method and show favorable performance against state-of-the-art approaches.

cs.CV↗