arXiv subjects

Borui Wang

Publications and source records attributed to Borui Wang.

14 recordsLinked to original sources

arXiv2026

Effects of Solar Wind Plasma Noise on Stochastic Gravitational Wave Background Searches with the LISA-Taiji Network

The LISA-Taiji dual detector network improves millihertz SGWB sensitivity through cross correlation measurements. Solar wind plasma, however, can generate plasma noise correlated between detectors and bias SGWB cross correlation estimates. We use high time resolution electron density data from Wind/SWE, estimate the solar wind electron density fluctuation spectrum with the Lomb-Scargle method, and propagate the resulting plasma noise to the TDI A/E channels of the LISA-Taiji network. By including finite arm propagation, Taylor frozen flow spatial correlations, and the network overlap reduction response, we compute the SGWB parameter bias induced by interdetector plasma noise. Although the single detector plasma residual is below the reference noise, the component correlated between detectors can enter the SGWB cross correlation estimator directly. Under dual detector scale coverage, the plasma induced parameter bias for a power law SGWB can reach 12.73% of the corresponding Fisher parameter uncertainty. For M2/M3 cosmic string spectra, the bias in ln Gmu can reach 19.26% of the corresponding Fisher parameter uncertainty for the network configurations, observing times, and frequency bands considered here. These results show that the impact of solar wind plasma noise cannot be assessed from the single detector residual noise level alone. In LISA-Taiji SGWB searches, the interdetector correlated component of this noise can directly affect parameter estimation.

astro-ph.CO↗

arXiv2026

Identifiability of $g$ mode Resonances in Eccentric Binary Neutron Stars with Multidetector Observations

$g$ mode resonances in eccentric binary neutron star systems are potential probes of internal stratification, superfluidity, composition gradients, and the equation of state. Although such weak dynamical tidal signatures are unlikely to be resolved with current detector sensitivities, third generation observations may make them accessible, in which case identifying the weak resonant phase shift would provide information beyond the bulk adiabatic tidal deformability. We build a four class dataset in an eccentric harmonic framework, containing point particle, adiabatic tide, resonant $g$ mode, and pure noise samples, and use Einstein Telescope (ET) and Cosmic Explorer (CE) detector data to test whether this weak resonant phase signature can be identified from noisy time domain strain. The ET, CE, and ET+CE deep learning models reach accuracies of $0.655$, $0.815$, and $0.897$, respectively. On the same simulated samples, the matched filtering method reaches lower accuracies of $0.514$, $0.677$, and $0.689$. This result arises from the fact that the resonant correction manifests as a weak phase morphology difference superimposed on the adiabatic tidal background, whereas matched filtering is sensitive only to the overall similarity. Hence, in the presence of weak phase differences, the neural classifier employed in deep learning is better able to learn these local phase and morphology features from the complete time domain strain segment. The results indicate that joint third generation observations improve the identifiability of weak internal mode phase information.

astro-ph.HE↗

arXiv2025

Detection of Multiband Lensed Gravitational Waves from Dark Matter Halos with Deep Learning

Lensed gravitational waves acquire amplitude and phase modulations when propagating through the gravitational potential of dark matter halos, producing interference structures in the observed waveform. However, these features are often difficult to identify in detector noise. In this work, we develop a deep learning framework for the automatic classification of lensed gravitational wave signals under multiband observations. We simulate binary neutron star signals observed by the space based detector DECIGO and the ground based Einstein Telescope, and construct five classes of data including pure noise, unlensed signals, and three lensed cases generated by the SIS, CIS, and NFW dark matter halo models. By comparing single detector and joint detector configurations, we evaluate the classification performance under different observational settings. The results show that multiband observations significantly improve the identification of lensed signals and reduce confusion among different lens models. This approach provides an efficient method for automated recognition of lensed gravitational waves in future multiband gravitational wave observations.

astro-ph.IM↗

arXiv2025

DYSTIL: Dynamic Strategy Induction with Large Language Models for Reinforcement Learning

Reinforcement learning from expert demonstrations has long remained a challenging research problem, and existing state-of-the-art methods using behavioral cloning plus further RL training often suffer from poor generalization, low sample efficiency, and poor model interpretability. Inspired by the strong reasoning abilities of large language models (LLMs), we propose a novel strategy-based reinforcement learning framework integrated with LLMs called DYnamic STrategy Induction with Llms for reinforcement learning (DYSTIL) to overcome these limitations. DYSTIL dynamically queries a strategy-generating LLM to induce textual strategies based on advantage estimations and expert demonstrations, and gradually internalizes induced strategies into the RL agent through policy optimization to improve its performance through boosting policy generalization and enhancing sample efficiency. It also provides a direct textual channel to observe and interpret the evolution of the policy's underlying strategies during training. We test DYSTIL over challenging RL environments from Minigrid and BabyAI, and empirically demonstrate that DYSTIL significantly outperforms state-of-the-art baseline methods by 17.75% in average success rate while also enjoying higher sample efficiency during the learning process.

cs.LG↗

arXiv2025

Conditional Autoencoder for Generating Binary Neutron Star Waveforms with Tidal and Precession Effects

Gravitational waves from binary neutron star mergers provide critical insights into dense matter physics and strong-field gravity, yet accurate waveform modeling remains computationally intensive. We present a deep generative model for gravitational waveforms from binary neutron star mergers that captures the late inspiral, merger, and ringdown phases while incorporating spin precession and tidal effects. Using a conditional autoencoder architecture, the model efficiently produces high-fidelity waveforms across a broad parameter space, including component masses (m1, m2), spin components (S1x, S1y, S1z, S2x, S2y, S2z), and tidal deformabilities (Lambda1, Lambda2). Trained on 1*10^6 waveforms generated by the IMRPhenomXP_NRTidalv2 model, our network achieves a mean mismatch of 2.13*10^-3. The generation time for a single waveform is 0.12 s, compared to 0.66 s for IMRPhenomXP_NRTidalv2, representing a speedup of about fivefold. When generating 1000 waveforms, the model completes the task in 0.75 s, roughly ten times faster than the baseline. This significant acceleration facilitates rapid parameter estimation and real-time gravitational-wave searches. With improved precision and efficiency, the model can support low-latency detection and broader applications in multi-messenger astrophysics.

astro-ph.GA↗

arXiv2025

Identification of Stochastic Gravitational Wave Backgrounds from Cosmic String Using Machine Learning

Cosmic strings play a crucial role in enhancing our understanding of the fundamental structure and evolution of the universe, unifying our knowledge of cosmology, and potentially unveiling new physical laws and phenomena. The advent and operation of space-based detectors provide an important opportunity for detecting stochastic gravitational wave backgrounds (SGWB) generated by cosmic strings. However, the intricate nature of SGWB poses a formidable challenge in distinguishing its signal from the complex noise by some traditional methods. Therefore, we attempt to identify SGWB based on machine learning. Our findings show that the joint detection of LISA and Taiji significantly outperforms individual detectors, and even in the presence of numerous low signal-to-noise ratio(SNR) signals, the identification accuracy remains exceptionally high with 95%. Although our discussion is based solely on simulated data, the relevant methods can provide data-driven analytical capabilities for future observations of SGWB.

gr-qc↗

arXiv2022

STRUDEL: Structured Dialogue Summarization for Dialogue Comprehension

Abstractive dialogue summarization has long been viewed as an important standalone task in natural language processing, but no previous work has explored the possibility of whether abstractive dialogue summarization can also be used as a means to boost an NLP system's performance on other important dialogue comprehension tasks. In this paper, we propose a novel type of dialogue summarization task - STRUctured DiaLoguE Summarization - that can help pre-trained language models to better understand dialogues and improve their performance on important dialogue comprehension tasks. We further collect human annotations of STRUDEL summaries over 400 dialogues and introduce a new STRUDEL dialogue comprehension modeling framework that integrates STRUDEL into a graph-neural-network-based dialogue reasoning module over transformer encoder language models to improve their dialogue comprehension abilities. In our empirical experiments on two important downstream dialogue comprehension tasks - dialogue question answering and dialogue response prediction - we show that our STRUDEL dialogue comprehension model can significantly improve the dialogue comprehension performance of transformer encoder language models.

cs.CL↗

arXiv2022

Investigating Crowdsourcing Protocols for Evaluating the Factual Consistency of Summaries

Current pre-trained models applied to summarization are prone to factual inconsistencies which either misrepresent the source text or introduce extraneous information. Thus, comparing the factual consistency of summaries is necessary as we develop improved models. However, the optimal human evaluation setup for factual consistency has not been standardized. To address this issue, we crowdsourced evaluations for factual consistency using the rating-based Likert scale and ranking-based Best-Worst Scaling protocols, on 100 articles from each of the CNN-Daily Mail and XSum datasets over four state-of-the-art models, to determine the most reliable evaluation framework. We find that ranking-based protocols offer a more reliable measure of summary quality across datasets, while the reliability of Likert ratings depends on the target dataset and the evaluation design. Our crowdsourcing templates and summary evaluations will be publicly available to facilitate future research on factual consistency in summarization.

cs.CL↗

arXiv2022

CONFIT: Toward Faithful Dialogue Summarization with Linguistically-Informed Contrastive Fine-tuning

Factual inconsistencies in generated summaries severely limit the practical applications of abstractive dialogue summarization. Although significant progress has been achieved by using pre-trained models, substantial amounts of hallucinated content are found during the human evaluation. Pre-trained models are most commonly fine-tuned with cross-entropy loss for text summarization, which may not be an optimal strategy. In this work, we provide a typology of factual errors with annotation data to highlight the types of errors and move away from a binary understanding of factuality. We further propose a training strategy that improves the factual consistency and overall quality of summaries via a novel contrastive fine-tuning, called ConFiT. Based on our linguistically-informed typology of errors, we design different modular objectives that each target a specific type. Specifically, we utilize hard negative samples with errors to reduce the generation of factual inconsistency. In order to capture the key information between speakers, we also design a dialogue-specific loss. Using human evaluation and automatic faithfulness metrics, we show that our model significantly reduces all kinds of factual errors on the dialogue summarization, SAMSum corpus. Moreover, our model could be generalized to the meeting summarization, AMI corpus, and it produces significantly higher scores than most of the baselines on both datasets regarding word-overlap metrics.

cs.CL↗

arXiv2022

KAT: A Knowledge Augmented Transformer for Vision-and-Language

The primary focus of recent work with largescale transformers has been on optimizing the amount of information packed into the model's parameters. In this work, we ask a different question: Can multimodal transformers leverage explicit knowledge in their reasoning? Existing, primarily unimodal, methods have explored approaches under the paradigm of knowledge retrieval followed by answer prediction, but leave open questions about the quality and relevance of the retrieved knowledge used, and how the reasoning processes over implicit and explicit knowledge should be integrated. To address these challenges, we propose a novel model - Knowledge Augmented Transformer (KAT) - which achieves a strong state-of-the-art result (+6 points absolute) on the open-domain multimodal task of OK-VQA. Our approach integrates implicit and explicit knowledge in an end to end encoder-decoder architecture, while still jointly reasoning over both knowledge sources during answer generation. An additional benefit of explicit knowledge integration is seen in improved interpretability of model predictions in our analysis.

cs.CL↗

arXiv2021

ConvoSumm: Conversation Summarization Benchmark and Improved Abstractive Summarization with Argument Mining

While online conversations can cover a vast amount of information in many different formats, abstractive text summarization has primarily focused on modeling solely news articles. This research gap is due, in part, to the lack of standardized datasets for summarizing online discussions. To address this gap, we design annotation protocols motivated by an issues--viewpoints--assertions framework to crowdsource four new datasets on diverse online conversation forms of news comments, discussion forums, community question answering forums, and email threads. We benchmark state-of-the-art models on our datasets and analyze characteristics associated with the data. To create a comprehensive benchmark, we also evaluate these models on widely-used conversation summarization datasets to establish strong baselines in this domain. Furthermore, we incorporate argument mining through graph construction to directly model the issues, viewpoints, and assertions present in a conversation and filter noisy input, showing comparable or improved results according to automatic and human evaluations.

cs.CL↗

arXiv2019

Learning General Latent-Variable Graphical Models with Predictive Belief Propagation

Learning general latent-variable probabilistic graphical models is a key theoretical challenge in machine learning and artificial intelligence. All previous methods, including the EM algorithm and the spectral algorithms, face severe limitations that largely restrict their applicability and affect their performance. In order to overcome these limitations, in this paper we introduce a novel formulation of message-passing inference over junction trees named predictive belief propagation, and propose a new learning and inference algorithm for general latent-variable graphical models based on this formulation. Our proposed algorithm reduces the hard parameter learning problem into a sequence of supervised learning problems, and unifies the learning of different kinds of latent graphical models into a single learning framework, which is local-optima-free and statistically consistent. We then give a proof of the correctness of our algorithm and show in experiments on both synthetic and real datasets that our algorithm significantly outperforms both the EM algorithm and the spectral algorithm while also being orders of magnitude faster to compute.

cs.LG↗

arXiv2019

Imitation Learning for Human Pose Prediction

Modeling and prediction of human motion dynamics has long been a challenging problem in computer vision, and most existing methods rely on the end-to-end supervised training of various architectures of recurrent neural networks. Inspired by the recent success of deep reinforcement learning methods, in this paper we propose a new reinforcement learning formulation for the problem of human pose prediction, and develop an imitation learning algorithm for predicting future poses under this formulation through a combination of behavioral cloning and generative adversarial imitation learning. Our experiments show that our proposed method outperforms all existing state-of-the-art baseline models by large margins on the task of human pose prediction in both short-term predictions and long-term predictions, while also enjoying huge advantage in training speed.

cs.CV↗

arXiv2018

Action-Agnostic Human Pose Forecasting

Predicting and forecasting human dynamics is a very interesting but challenging task with several prospective applications in robotics, health-care, etc. Recently, several methods have been developed for human pose forecasting; however, they often introduce a number of limitations in their settings. For instance, previous work either focused only on short-term or long-term predictions, while sacrificing one or the other. Furthermore, they included the activity labels as part of the training process, and require them at testing time. These limitations confine the usage of pose forecasting models for real-world applications, as often there are no activity-related annotations for testing scenarios. In this paper, we propose a new action-agnostic method for short- and long-term human pose forecasting. To this end, we propose a new recurrent neural network for modeling the hierarchical and multi-scale characteristics of the human dynamics, denoted by triangular-prism RNN (TP-RNN). Our model captures the latent hierarchical structure embedded in temporal human pose sequences by encoding the temporal dependencies with different time-scales. For evaluation, we run an extensive set of experiments on Human 3.6M and Penn Action datasets and show that our method outperforms baseline and state-of-the-art methods quantitatively and qualitatively. Codes are available at https://github.com/eddyhkchiu/pose_forecast_wacv/

cs.CV↗