arXiv subjects

Bo Wang

Publications and source records attributed to Bo Wang.

At least 487 records · Page 27Linked to original sources

arXiv2023

Evolution of double oxygen-neon white dwarf merger remnant

Double white dwarf (WD) merger process and their post-merger evolution are important in many fields of astronomy, such as supernovae, gamma-ray bursts, gravitational waves, etc. The evolutionary outcomes of double ultra-massive WD merger remnants are still a subject of debate, though the general consensus is that the merger remnant will collapse to form a neutron star. In this work, we investigate the evolution of a 2.20Msun merger remnant stemmed from the coalescence of double 1.10Msun ONe WDs. We find that the remnant ignites off-centre neon burning at the position near the surface of primary WD soon after the merger, resulting in the stable inwardly propagating oxygen/neon (O/Ne) flame. The final outcomes of the merger remnant are sensitive to the effect of convective boundary mixing. If the mixing cannot stall the O/Ne flame, the flame will reach the centre within 20 years, leading to the formation of super Chandrasekhar mass silicon core, and its final fate probably be neutron star (NS) through iron-core-collapse supernova. In contrast, if the convective mixing is effective enough to prevent the O/Ne flame from reaching the centre, the merger remnant will undergo electron capture supernova to form an ONeFe WD. Meanwhile, we find that the wind mass loss process may hardly alter the final fate of the remnant due to its fast evolution. Our results imply that the coalescence of double ONe WDs can form short lived giant like object, but the final outcomes (NS or ONeFe WD) are influenced by the uncertain convective mixing in O/Ne flame.

astro-ph.SR↗

arXiv2023

Clinical Camel: An Open Expert-Level Medical Language Model with Dialogue-Based Knowledge Encoding

We present Clinical Camel, an open large language model (LLM) explicitly tailored for clinical research. Fine-tuned from LLaMA-2 using QLoRA, Clinical Camel achieves state-of-the-art performance across medical benchmarks among openly available medical LLMs. Leveraging efficient single-GPU training, Clinical Camel surpasses GPT-3.5 in five-shot evaluations on all assessed benchmarks, including 64.3% on the USMLE Sample Exam (compared to 58.5% for GPT-3.5), 77.9% on PubMedQA (compared to 60.2%), 60.7% on MedQA (compared to 53.6%), and 54.2% on MedMCQA (compared to 51.0%). In addition to these benchmarks, Clinical Camel demonstrates its broader capabilities, such as synthesizing plausible clinical notes. This work introduces dialogue-based knowledge encoding, a novel method to synthesize conversational data from dense medical texts. While benchmark results are encouraging, extensive and rigorous human evaluation across diverse clinical scenarios is imperative to ascertain safety before implementation. By openly sharing Clinical Camel, we hope to foster transparent and collaborative research, working towards the safe integration of LLMs within the healthcare domain. Significant challenges concerning reliability, bias, and the potential for outdated knowledge persist. Nonetheless, the transparency provided by an open approach reinforces the scientific rigor essential for future clinical applications.

cs.CL↗

arXiv2023

Unleashing the Strengths of Unlabeled Data in Pan-cancer Abdominal Organ Quantification: the FLARE22 Challenge

Quantitative organ assessment is an essential step in automated abdominal disease diagnosis and treatment planning. Artificial intelligence (AI) has shown great potential to automatize this process. However, most existing AI algorithms rely on many expert annotations and lack a comprehensive evaluation of accuracy and efficiency in real-world multinational settings. To overcome these limitations, we organized the FLARE 2022 Challenge, the largest abdominal organ analysis challenge to date, to benchmark fast, low-resource, accurate, annotation-efficient, and generalized AI algorithms. We constructed an intercontinental and multinational dataset from more than 50 medical groups, including Computed Tomography (CT) scans with different races, diseases, phases, and manufacturers. We independently validated that a set of AI algorithms achieved a median Dice Similarity Coefficient (DSC) of 90.0\% by using 50 labeled scans and 2000 unlabeled scans, which can significantly reduce annotation requirements. The best-performing algorithms successfully generalized to holdout external validation sets, achieving a median DSC of 89.5\%, 90.9\%, and 88.3\% on North American, European, and Asian cohorts, respectively. They also enabled automatic extraction of key organ biology features, which was labor-intensive with traditional manual measurements. This opens the potential to use unlabeled data to boost performance and alleviate annotation shortages for modern AI models.

eess.IV↗

arXiv2023

Underwater Object Tracker: UOSTrack for Marine Organism Grasping of Underwater Vehicles

A visual single-object tracker is an indispensable component of underwater vehicles (UVs) in marine organism grasping tasks. Its accuracy and stability are imperative to guide the UVs to perform grasping behavior. Although single-object trackers show competitive performance in the challenge of underwater image degradation, there are still issues with sample imbalance and exclusion of similar objects that need to be addressed for application in marine organism grasping. This paper proposes Underwater OSTrack (UOSTrack), which consists of underwater image and open-air sequence hybrid training (UOHT), and motion-based post-processing (MBPP). The UOHT training paradigm is designed to train the sample-imbalanced underwater tracker so that the tracker is exposed to a great number of underwater domain training samples and learns the feature expressions. The MBPP paradigm is proposed to exclude similar objects. It uses the estimation box predicted with a Kalman filter and the candidate boxes in the response map to relocate the lost tracked object in the candidate area. UOSTrack achieves an average performance improvement of 4.41% and 7.98% maximum compared to state-of-the-art methods on various benchmarks, respectively. Field experiments have verified the accuracy and stability of our proposed UOSTrack for UVs in marine organism grasping tasks. More details can be found at https://github.com/LiYunfengLYF/UOSTrack.

cs.CV↗

arXiv2023

Facilitating Multi-turn Emotional Support Conversation with Positive Emotion Elicitation: A Reinforcement Learning Approach

Emotional support conversation (ESC) aims to provide emotional support (ES) to improve one's mental state. Existing works stay at fitting grounded responses and responding strategies (e.g., question), which ignore the effect on ES and lack explicit goals to guide emotional positive transition. To this end, we introduce a new paradigm to formalize multi-turn ESC as a process of positive emotion elicitation. Addressing this task requires finely adjusting the elicitation intensity in ES as the conversation progresses while maintaining conversational goals like coherence. In this paper, we propose Supporter, a mixture-of-expert-based reinforcement learning model, and well design ES and dialogue coherence rewards to guide policy's learning for responding. Experiments verify the superiority of Supporter in achieving positive emotion elicitation during responding while maintaining conversational goals including coherence.

cs.CL↗

arXiv2023

Magnetic Field-Based Reward Shaping for Goal-Conditioned Reinforcement Learning

Goal-conditioned reinforcement learning (RL) is an interesting extension of the traditional RL framework, where the dynamic environment and reward sparsity can cause conventional learning algorithms to fail. Reward shaping is a practical approach to improving sample efficiency by embedding human domain knowledge into the learning process. Existing reward shaping methods for goal-conditioned RL are typically built on distance metrics with a linear and isotropic distribution, which may fail to provide sufficient information about the ever-changing environment with high complexity. This paper proposes a novel magnetic field-based reward shaping (MFRS) method for goal-conditioned RL tasks with dynamic target and obstacles. Inspired by the physical properties of magnets, we consider the target and obstacles as permanent magnets and establish the reward function according to the intensity values of the magnetic field generated by these magnets. The nonlinear and anisotropic distribution of the magnetic field intensity can provide more accessible and conducive information about the optimization landscape, thus introducing a more sophisticated magnetic reward compared to the distance-based setting. Further, we transform our magnetic reward to the form of potential-based reward shaping by learning a secondary potential function concurrently to ensure the optimal policy invariance of our method. Experiments results in both simulated and real-world robotic manipulation tasks demonstrate that MFRS outperforms relevant existing methods and effectively improves the sample efficiency of RL algorithms in goal-conditioned tasks with various dynamics of the target and obstacles.

cs.LG↗

arXiv2023

The effective field theory approach to the strong coupling issue in $f(T)$ gravity

We investigate the scalar perturbations and the possible strong coupling issues of $f(T)$ around a cosmological background, applying the effective field theory (EFT) approach. We revisit the generalized EFT framework of modified teleparallel gravity and apply it by considering both linear and second-order perturbations for $f(T)$ theory. No new scalar mode is present in linear and second-order perturbations in $f(T)$ gravity, which suggests a strong coupling problem. However, based on the ratio of cubic to quadratic Lagrangians, we provide a simple estimation of the strong coupling scale, a result which shows that the strong coupling problem can be avoided at least for some modes. In conclusion, perturbation behaviors that at first appear problematic may not inevitably lead to a strong coupling problem, as long as the relevant scale is comparable with the cutoff scale $M$ of the applicability of the theory.

gr-qc↗

arXiv2023

Training Physics-Informed Neural Networks via Multi-Task Optimization for Traffic Density Prediction

Physics-informed neural networks (PINNs) are a newly emerging research frontier in machine learning, which incorporate certain physical laws that govern a given data set, e.g., those described by partial differential equations (PDEs), into the training of the neural network (NN) based on such a data set. In PINNs, the NN acts as the solution approximator for the PDE while the PDE acts as the prior knowledge to guide the NN training, leading to the desired generalization performance of the NN when facing the limited availability of training data. However, training PINNs is a non-trivial task largely due to the complexity of the loss composed of both NN and physical law parts. In this work, we propose a new PINN training framework based on the multi-task optimization (MTO) paradigm. Under this framework, multiple auxiliary tasks are created and solved together with the given (main) task, where the useful knowledge from solving one task is transferred in an adaptive mode to assist in solving some other tasks, aiming to uplift the performance of solving the main task. We implement the proposed framework and apply it to train the PINN for addressing the traffic density prediction problem. Experimental results demonstrate that our proposed training framework leads to significant performance improvement in comparison to the traditional way of training the PINN.

cs.NE↗

arXiv2023

FFPDG: Fast, Fair and Private Data Generation

Generative modeling has been used frequently in synthetic data generation. Fairness and privacy are two big concerns for synthetic data. Although Recent GAN [\cite{goodfellow2014generative}] based methods show good results in preserving privacy, the generated data may be more biased. At the same time, these methods require high computation resources. In this work, we design a fast, fair, flexible and private data generation method. We show the effectiveness of our method theoretically and empirically. We show that models trained on data generated by the proposed method can perform well (in inference stage) on real application scenarios.

cs.LG↗

arXiv2023

Gravitational wave sources for Pulsar Timing Arrays

Very recently, several pulsar timing array collaborations, including CPTA, EPTA, and NANOGrav, reported their results from searches for an isotropic stochastic gravitational wave background (SGWB), with each finding positive evidence for SGWB. In this work, we assessed the credibility of interpreting the Hellings-Downs correlated free-spectrum process of EPTA, PPTA, and NANOGrav as either the result of supermassive black hole binary mergers or various stochastic SGWB sources that originated in the early Universe, including first-order phase transitions, cosmic strings, domain walls, and large-amplitude curvature perturbations. Our observations show that the current new datasets do not display a strong preference for any specific SGWB source based on Bayesian analysis.

astro-ph.HE↗

arXiv2023

Model-Aware Contrastive Learning: Towards Escaping the Dilemmas

Contrastive learning (CL) continuously achieves significant breakthroughs across multiple domains. However, the most common InfoNCE-based methods suffer from some dilemmas, such as \textit{uniformity-tolerance dilemma} (UTD) and \textit{gradient reduction}, both of which are related to a $\mathcal{P}_{ij}$ term. It has been identified that UTD can lead to unexpected performance degradation. We argue that the fixity of temperature is to blame for UTD. To tackle this challenge, we enrich the CL loss family by presenting a Model-Aware Contrastive Learning (MACL) strategy, whose temperature is adaptive to the magnitude of alignment that reflects the basic confidence of the instance discrimination task, then enables CL loss to adjust the penalty strength for hard negatives adaptively. Regarding another dilemma, the gradient reduction issue, we derive the limits of an involved gradient scaling factor, which allows us to explain from a unified perspective why some recent approaches are effective with fewer negative samples, and summarily present a gradient reweighting to escape this dilemma. Extensive remarkable empirical results in vision, sentence, and graph modality validate our approach's general improvement for representation learning and downstream tasks.

cs.LG↗

arXiv2023

WangLab at MEDIQA-Chat 2023: Clinical Note Generation from Doctor-Patient Conversations using Large Language Models

This paper describes our submission to the MEDIQA-Chat 2023 shared task for automatic clinical note generation from doctor-patient conversations. We report results for two approaches: the first fine-tunes a pre-trained language model (PLM) on the shared task data, and the second uses few-shot in-context learning (ICL) with a large language model (LLM). Both achieve high performance as measured by automatic metrics (e.g. ROUGE, BERTScore) and ranked second and first, respectively, of all submissions to the shared task. Expert human scrutiny indicates that notes generated via the ICL-based approach with GPT-4 are preferred about as often as human-written notes, making it a promising path toward automated note generation from doctor-patient conversations.

cs.CL↗

arXiv2023

Gradient Domain Weighted Guided Image Filtering

Guided image filter is a well-known local filter in image processing. However, the presence of halo artifacts is a common issue associated with this type of filter. This paper proposes an algorithm that utilizes gradient information to accurately identify the edges of an image. Furthermore, the algorithm uses weighted information to distinguish flat areas from edge areas, resulting in sharper edges and reduced blur in flat areas. This approach mitigates the excessive blurring near edges that often leads to halo artifacts. Experimental results demonstrate that the proposed algorithm significantly suppresses halo artifacts at the edges, making it highly effective for both image denoising and detail enhancement.

cs.CV↗

arXiv2023

Interior derivative estimates and Bernstein theorem for Hessian quotient equations

In this paper, we obtain the interior derivative estimates of solutions for elliptic and parabolic Hessian quotient equations. Then we establish the Bernstein theorem for parabolic Hessian quotient equations, that is, any parabolically convex solution $u=u(x,t)\in C^{4,2}(\mathbb{R}^n\times (-\infty,0])$ for $-u_t\frac{S_n(D^2u)}{S_l(D^2u)}=1$ in $\mathbb{R}^n\times (-\infty,0]$ must be the form of $u=-mt+P(x)$ with $m>0$ being a constant and $P$ being a convex quadratic polynomial.

math.AP↗

arXiv2023

Decentralized Equalization for Massive MIMO Systems With Colored Noise Samples

Recently, the decentralized baseband processing (DBP) paradigm and relevant detection methods have been proposed to enable extremely large-scale massive multiple-input multiple-output technology. Under the DBP architecture, base station antennas are divided into several independent clusters, each connected to a local computing fabric. However, current detection methods tailored to DBP only consider ideal white Gaussian noise scenarios, while in practice, the noise is often colored due to interference from neighboring cells. Moreover, in the DBP architecture, linear minimum mean-square error (LMMSE) detection methods rely on the estimation of the noise covariance matrix through averaging distributedly stored noise samples. This presents a significant challenge for decentralized LMMSE-based equalizer design. To address this issue, this paper proposes decentralized LMMSE equalization methods under colored noise scenarios for both star and daisy chain DBP architectures. Specifically, we first propose two decentralized equalizers for the star DBP architecture based on dimensionality reduction techniques. Then, we derive an optimal decentralized equalizer using the block coordinate descent (BCD) method for the daisy chain DBP architecture with a bandwidth reduction enhancement scheme based on decentralized low-rank decomposition. Finally, simulation results demonstrate that our proposed methods can achieve excellent detection performance while requiring much less communication bandwidth.

eess.SP↗

arXiv2023

Enhancing Personalized Dialogue Generation with Contrastive Latent Variables: Combining Sparse and Dense Persona

The personalized dialogue explores the consistent relationship between dialogue generation and personality. Existing personalized dialogue agents model persona profiles from three resources: sparse or dense persona descriptions and dialogue histories. However, sparse structured persona attributes are explicit but uninformative, dense persona texts contain rich persona descriptions with much noise, and dialogue history query is both noisy and uninformative for persona modeling. In this work, we combine the advantages of the three resources to obtain a richer and more accurate persona. We design a Contrastive Latent Variable-based model (CLV) that clusters the dense persona descriptions into sparse categories, which are combined with the history query to generate personalized responses. Experimental results on Chinese and English datasets demonstrate our model's superiority in personalization.

cs.CL↗

arXiv2023

DSFNet: Dual Space Fusion Network for Occlusion-Robust 3D Dense Face Alignment

Sensitivity to severe occlusion and large view angles limits the usage scenarios of the existing monocular 3D dense face alignment methods. The state-of-the-art 3DMM-based method, directly regresses the model's coefficients, underutilizing the low-level 2D spatial and semantic information, which can actually offer cues for face shape and orientation. In this work, we demonstrate how modeling 3D facial geometry in image and model space jointly can solve the occlusion and view angle problems. Instead of predicting the whole face directly, we regress image space features in the visible facial region by dense prediction first. Subsequently, we predict our model's coefficients based on the regressed feature of the visible regions, leveraging the prior knowledge of whole face geometry from the morphable models to complete the invisible regions. We further propose a fusion network that combines the advantages of both the image and model space predictions to achieve high robustness and accuracy in unconstrained scenarios. Thanks to the proposed fusion module, our method is robust not only to occlusion and large pitch and roll view angles, which is the benefit of our image space approach, but also to noise and large yaw angles, which is the benefit of our model space method. Comprehensive evaluations demonstrate the superior performance of our method compared with the state-of-the-art methods. On the 3D dense face alignment task, we achieve 3.80% NME on the AFLW2000-3D dataset, which outperforms the state-of-the-art method by 5.5%. Code is available at https://github.com/lhyfst/DSFNet.

cs.CV↗

arXiv2023

SN 2016ije: An SN 2002es-like Type Ia Supernova Exploded in a Metal-poor and Low-surface Brightness Galaxy

We have conducted photometric and spectroscopic observations of the peculiar Type Ia supernova (SN Ia) 2016ije that was discovered through the Tsinghua-NAOC Transient Survey. This peculiar object exploded in the outskirts of a metal-poor, low-surface brightness galaxy (i.e., $M_{g}$ = $-$14.5 mag). Our photometric analysis reveals that SN 2016ije is subluminous ($M_{B,\rm{max}}$ = $-$17.65$\pm$0.06 mag) but exhibits relatively broad light curves ($Δm_{15}(B)$ = 1.35$\pm$0.14 mag), similar to the behavior of SN 2002es. Our analysis of the bolometric light curve indicates that only 0.14$\pm$0.04 $M_{\odot}$ of $^{56}$Ni was synthesized in the explosion of SN 2016ije, which suggests a less energetic thermonuclear explosion when compared to normal SNe Ia, and this left a considerable amount of unburned materials in the ejecta. Spectroscopically, SN 2016ije resembles other SN 2002es-like SNe Ia, except that the ejecta velocity inferred from its carbon absorption line ($\sim$ 4500 km s$^{-1}$) is much lower than that from silicon lines ($\sim$ 8300 km s$^{-1}$) at around the maximum light. Additionally, most of the absorption lines are broader than other 02es-like SNe Ia. These peculiarities suggest the presence of significant unburned carbon in the inner region and a wide line-forming region along the line of sight. These characteristics suggest that SN 2016ije might originate from the violent merger of a white dwarf binary system, when viewed near an orientation along the iron-group-element cavity caused by the companion star.

astro-ph.HE↗