arXiv subjects

Fei Wang

Publications and source records attributed to Fei Wang.

At least 451 records · Page 25Linked to original sources

arXiv2023

Watch out Venomous Snake Species: A Solution to SnakeCLEF2023

The SnakeCLEF2023 competition aims to the development of advanced algorithms for snake species identification through the analysis of images and accompanying metadata. This paper presents a method leveraging utilization of both images and metadata. Modern CNN models and strong data augmentation are utilized to learn better representation of images. To relieve the challenge of long-tailed distribution, seesaw loss is utilized in our method. We also design a light model to calculate prior probabilities using metadata features extracted from CLIP in post processing stage. Besides, we attach more importance to venomous species by assigning venomous species labels to some examples that model is uncertain about. Our method achieves 91.31% score of the final metric combined of F1 and other metrics on private leaderboard, which is the 1st place among the participators. The code is available at https://github.com/xiaoxsparraw/CLEF2023.

cs.CV↗

arXiv2023

Did the nHZ Gravitational Waves Signatures Observed By NANOGrav Indicate Multiple Sector SUSY Breaking?

Discrete R symmetries always play an important role in low energy SUSY. The spontaneously broken of such discrete R symmetries, for example, by gaugino condensation, can lead to domain walls, which need to be either inflated away or collapse to avoid cosmic difficulties. We propose that explicitly R symmetry violation needed for collapse of domain walls can be the consequence of multiple sector SUSY breaking. The consistency constraints for the generation of non-problematic domain walls from gaugino condensation are discussed. We also study the emitted gravitational waves related to the collapse of domain walls. We find that, for SUSY breaking scale of order ${\cal O}(1)$ ${\rm GeV}$ in one of the sequestered sector (and also a low reheating temperature of order ${\rm MeV}$ if the reheating is not completed when the domain walls collapse), the peak frequency of gravitational waves emitted can lie at nHz. Such a low SUSY breaking scale can be consistency and natural in multiple sector SUSY breaking scenario. The GWs signal by NANOGrav could be a signal of such multiple sector SUSY breaking scenario and it may also indicate the existences of light goldstini at ${\rm eV}$ mass scale.

hep-ph↗

arXiv2023

Strange molecular partners of $P_c$ states in $γp\toϕp$ reaction

Based on the high statistical data of the CLAS Collaboration on $γp \to ϕp$ reaction in the center-of-mass energy range of 2.2 GeV to 2.8 GeV, we investigate the possible existence of strange molecular partners of $P_c$ states, i.e., $N^*(2080)$ and $N^*(2270)$ as $K^*Σ$ and $K^*Σ^*$ molecular states. In addition to the t-channel Pomeron exchange, t-channel meson exchange including pseudo-scalar meson $(π,η)$, scalar meson $(σ, a_0(980), f_0(980))$, axial-vector meson $f_1(1285)$, tensor meson $f_2(1270)$, as well as s- and u-channel proton exchange, including s-channel $N^*(2080)$ and $N^*(2270)$ states can fit the data very well. The fitted coupling constants of these $N^*$ molecular states to $pϕ$ and $γp$ are consistent with the results directly calculated from the relevant hadronic triangle diagrams of the molecular picture.

hep-ph↗

arXiv2023

An empirical study of using radiology reports and images to improve ICU mortality prediction

Background: The predictive Intensive Care Unit (ICU) scoring system plays an important role in ICU management because it predicts important outcomes, especially mortality. Many scoring systems have been developed and used in the ICU. These scoring systems are primarily based on the structured clinical data in the electronic health record (EHR), which may suffer the loss of important clinical information in the narratives and images. Methods: In this work, we build a deep learning based survival prediction model with multi-modality data to predict ICU mortality. Four sets of features are investigated: (1) physiological measurements of Simplified Acute Physiology Score (SAPS) II, (2) common thorax diseases pre-defined by radiologists, (3) BERT-based text representations, and (4) chest X-ray image features. We use the Medical Information Mart for Intensive Care IV (MIMIC-IV) dataset to evaluate the proposed model. Results: Our model achieves the average C-index of 0.7829 (95% confidence interval, 0.7620-0.8038), which substantially exceeds that of the baseline with SAPS-II features (0.7470 (0.7263-0.7676)). Ablation studies further demonstrate the contributions of pre-defined labels (2.00%), text features (2.44%), and image features (2.82%).

cs.AI↗

arXiv2023

Locate and Beamform: Two-dimensional Locating All-neural Beamformer for Multi-channel Speech Separation

Recently, stunning improvements on multi-channel speech separation have been achieved by neural beamformers when direction information is available. However, most of them neglect to utilize speaker's 2-dimensional (2D) location cues contained in mixture signal, which limits the performance when two sources come from close directions. In this paper, we propose an end-to-end beamforming network for 2D location guided speech separation merely given mixture signal. It first estimates discriminable direction and 2D location cues, which imply directions the sources come from in multi views of microphones and their 2D coordinates. These cues are then integrated into location-aware neural beamformer, thus allowing accurate reconstruction of two sources' speech signals. Experiments show that our proposed model not only achieves a comprehensive decent improvement compared to baseline systems, but avoids inferior performance on spatial overlapping cases.

eess.AS↗

arXiv2023

RHFedMTL: Resource-Aware Hierarchical Federated Multi-Task Learning

The rapid development of artificial intelligence (AI) over massive applications including Internet-of-things on cellular network raises the concern of technical challenges such as privacy, heterogeneity and resource efficiency. Federated learning is an effective way to enable AI over massive distributed nodes with security. However, conventional works mostly focus on learning a single global model for a unique task across the network, and are generally less competent to handle multi-task learning (MTL) scenarios with stragglers at the expense of acceptable computation and communication cost. Meanwhile, it is challenging to ensure the privacy while maintain a coupled multi-task learning across multiple base stations (BSs) and terminals. In this paper, inspired by the natural cloud-BS-terminal hierarchy of cellular works, we provide a viable resource-aware hierarchical federated MTL (RHFedMTL) solution to meet the heterogeneity of tasks, by solving different tasks within the BSs and aggregating the multi-task result in the cloud without compromising the privacy. Specifically, a primal-dual method has been leveraged to effectively transform the coupled MTL into some local optimization sub-problems within BSs. Furthermore, compared with existing methods to reduce resource cost by simply changing the aggregation frequency, we dive into the intricate relationship between resource consumption and learning accuracy, and develop a resource-aware learning strategy for local terminals and BSs to meet the resource budget. Extensive simulation results demonstrate the effectiveness and superiority of RHFedMTL in terms of improving the learning accuracy and boosting the convergence rate.

cs.NI↗

arXiv2023

HQDec: Self-Supervised Monocular Depth Estimation Based on a High-Quality Decoder

Decoders play significant roles in recovering scene depths. However, the decoders used in previous works ignore the propagation of multilevel lossless fine-grained information, cannot adaptively capture local and global information in parallel, and cannot perform sufficient global statistical analyses on the final output disparities. In addition, the process of mapping from a low-resolution feature space to a high-resolution feature space is a one-to-many problem that may have multiple solutions. Therefore, the quality of the recovered depth map is low. To this end, we propose a high-quality decoder (HQDec), with which multilevel near-lossless fine-grained information, obtained by the proposed adaptive axial-normalized position-embedded channel attention sampling module (AdaAxialNPCAS), can be adaptively incorporated into a low-resolution feature map with high-level semantics utilizing the proposed adaptive information exchange scheme. In the HQDec, we leverage the proposed adaptive refinement module (AdaRM) to model the local and global dependencies between pixels in parallel and utilize the proposed disparity attention module to model the distribution characteristics of disparity values from a global perspective. To recover fine-grained high-resolution features with maximal accuracy, we adaptively fuse the high-frequency information obtained by constraining the upsampled solution space utilizing the local and global dependencies between pixels into the high-resolution feature map generated from the nonlearning method. Extensive experiments demonstrate that each proposed component improves the quality of the depth estimation results over the baseline results, and the developed approach achieves state-of-the-art results on the KITTI and DDAD datasets. The code and models will be publicly available at \href{https://github.com/fwucas/HQDec}{HQDec}.

cs.CV↗

arXiv2023

Robust Natural Language Understanding with Residual Attention Debiasing

Natural language understanding (NLU) models often suffer from unintended dataset biases. Among bias mitigation methods, ensemble-based debiasing methods, especially product-of-experts (PoE), have stood out for their impressive empirical success. However, previous ensemble-based debiasing methods typically apply debiasing on top-level logits without directly addressing biased attention patterns. Attention serves as the main media of feature interaction and aggregation in PLMs and plays a crucial role in providing robust prediction. In this paper, we propose REsidual Attention Debiasing (READ), an end-to-end debiasing method that mitigates unintended biases from attention. Experiments on three NLU tasks show that READ significantly improves the performance of BERT-based models on OOD data with shortcuts removed, including +12.9% accuracy on HANS, +11.0% accuracy on FEVER-Symmetric, and +2.7% F1 on PAWS. Detailed analyses demonstrate the crucial role of unbiased attention in robust NLU models and that READ effectively mitigates biases in attention. Code is available at https://github.com/luka-group/READ.

cs.CL↗

arXiv2023

Automated Data Denoising for Recommendation

In real-world scenarios, most platforms collect both large-scale, naturally noisy implicit feedback and small-scale yet highly relevant explicit feedback. Due to the issue of data sparsity, implicit feedback is often the default choice for training recommender systems (RS), however, such data could be very noisy due to the randomness and diversity of user behaviors. For instance, a large portion of clicks may not reflect true user preferences and many purchases may result in negative reviews or returns. Fortunately, by utilizing the strengths of both types of feedback to compensate for the weaknesses of the other, we can mitigate the above issue at almost no cost. In this work, we propose an Automated Data Denoising framework, \textbf{\textit{AutoDenoise}}, for recommendation, which uses a small number of explicit data as validation set to guide the recommender training. Inspired by the generalized definition of curriculum learning (CL), AutoDenoise learns to automatically and dynamically assign the most appropriate (discrete or continuous) weights to each implicit data sample along the training process under the guidance of the validation performance. Specifically, we use a delicately designed controller network to generate the weights, combine the weights with the loss of each input data to train the recommender system, and optimize the controller with reinforcement learning to maximize the expected accuracy of the trained RS on the noise-free validation set. Thorough experiments indicate that AutoDenoise is able to boost the performance of the state-of-the-art recommendation algorithms on several public benchmark datasets.

cs.IR↗

arXiv2023

Local Randomized Neural Networks with Discontinuous Galerkin Methods for Diffusive-Viscous Wave Equation

The diffusive-viscous wave equation is an advancement in wave equation theory, as it accounts for both diffusion and viscosity effects. This has a wide range of applications in geophysics, such as the attenuation of seismic waves in fluid-saturated solids and frequency-dependent phenomena in porous media. Therefore, the development of an efficient numerical method for the equation is of both theoretical and practical importance. Recently, local randomized neural networks with discontinuous Galerkin (LRNN-DG) methods have been introduced in \cite{Sun2022lrnndg} to solve elliptic and parabolic equations. Numerical examples suggest that LRNN-DG can achieve high accuracy, and can handle time-dependent problems naturally and efficiently by using a space-time framework. In this paper, we develop LRNN-DG methods for solving the diffusive-viscous wave equation and present numerical experiments with several cases. The numerical results show that the proposed methods can solve the diffusive-viscous wave equation more accurately with less computing costs than traditional methods.

math.NA↗

arXiv2023

Improving Factuality of Abstractive Summarization without Sacrificing Summary Quality

Improving factual consistency of abstractive summarization has been a widely studied topic. However, most of the prior works on training factuality-aware models have ignored the negative effect it has on summary quality. We propose EFACTSUM (i.e., Effective Factual Summarization), a candidate summary generation and ranking technique to improve summary factuality without sacrificing summary quality. We show that using a contrastive learning framework with our refined candidate summaries leads to significant gains on both factuality and similarity-based metrics. Specifically, we propose a ranking strategy in which we effectively combine two metrics, thereby preventing any conflict during training. Models trained using our approach show up to 6 points of absolute improvement over the base model with respect to FactCC on XSUM and 11 points on CNN/DM, without negatively affecting either similarity-based metrics or absractiveness.

cs.CL↗

arXiv2023

Patchwork Learning: A Paradigm Towards Integrative Analysis across Diverse Biomedical Data Sources

Machine learning (ML) in healthcare presents numerous opportunities for enhancing patient care, population health, and healthcare providers' workflows. However, the real-world clinical and cost benefits remain limited due to challenges in data privacy, heterogeneous data sources, and the inability to fully leverage multiple data modalities. In this perspective paper, we introduce "patchwork learning" (PL), a novel paradigm that addresses these limitations by integrating information from disparate datasets composed of different data modalities (e.g., clinical free-text, medical images, omics) and distributed across separate and secure sites. PL allows the simultaneous utilization of complementary data sources while preserving data privacy, enabling the development of more holistic and generalizable ML models. We present the concept of patchwork learning and its current implementations in healthcare, exploring the potential opportunities and applicable data sources for addressing various healthcare challenges. PL leverages bridging modalities or overlapping feature spaces across sites to facilitate information sharing and impute missing data, thereby addressing related prediction tasks. We discuss the challenges associated with PL, many of which are shared by federated and multimodal learning, and provide recommendations for future research in this field. By offering a more comprehensive approach to healthcare data integration, patchwork learning has the potential to revolutionize the clinical applicability of ML models. This paradigm promises to strike a balance between personalization and generalizability, ultimately enhancing patient experiences, improving population health, and optimizing healthcare providers' workflows.

cs.LG↗

arXiv2023

Global Existence of Weak Solutions for Compresssible Navier--Stokes--Fourier Equations with the Truncated Virial Pressure Law

This paper concerns the existence of global weak solutions {\it à la Leray} for compressible Navier--Stokes--Fourier systems with periodic boundary conditions and the truncated virial pressure law which is assumed to be thermodynamically unstable. More precisely, the main novelty is that the pressure law is not assumed to be monotone with respect to the density. This provides the first global weak solutions result for the compressible Navier-Stokes-Fourier system with such kind of pressure law which is strongly used as a generalization of the perfect gas law. The paper is based on a new construction of approximate solutions through an iterative scheme and fixed point procedure which could be very helpful to design efficient numerical schemes. Note that our method involves the recent paper by the authors published in Nonlinearity (2021) for the compactness of the density when the temperature is given.

math.AP↗

arXiv2023

Survival Modeling of Suicide Risk with Rare and Uncertain Diagnoses

Motivated by the pressing need for suicide prevention through improving behavioral healthcare, we use medical claims data to study the risk of subsequent suicide attempts for patients who were hospitalized due to suicide attempts and later discharged. Understanding the risk behaviors of such patients at elevated suicide risk is an important step toward the goal of "Zero Suicide." An immediate and unconventional challenge is that the identification of suicide attempts from medical claims contains substantial uncertainty: almost 20% of "suspected" suicide attempts are identified from diagnosis codes indicating external causes of injury and poisoning with undermined intent. It is thus of great interest to learn which of these undetermined events are more likely actual suicide attempts and how to properly utilize them in survival analysis with severe censoring. To tackle these interrelated problems, we develop an integrative Cox cure model with regularization to perform survival regression with uncertain events and a latent cure fraction. We apply the proposed approach to study the risk of subsequent suicide attempts after suicide-related hospitalization for the adolescent and young adult population, using medical claims data from Connecticut. The identified risk factors are highly interpretable; more intriguingly, our method distinguishes the risk factors that are most helpful in assessing either susceptibility or timing of subsequent attempts. The predicted statuses of the uncertain attempts are further investigated, leading to several new insights on suicide event identification.

stat.AP↗

arXiv2023

Explaining the Muon g-2 Anomaly in Deflected AMSB for NMSSM

We propose to embed the General NMSSM (Next-to-Minimal Supersymmetric Standard Model) into the deflected AMSB (Anomaly Mediated Supersymmetry Breaking) mechanism with Yukawa/gauge deflection contributions. After integrating out the heavy messenger fields, the analytical expressions of the relevant soft SUSY breaking spectrum for General NMSSM at the messenger scale can be calculated. We find that successful EWSB (Electroweak Symmetry Breaking) and realistic low energy NMSSM spectrum can be obtained in some parameter regions. In addition, we find that the muon $g-2$ anomaly and electron $g-2$ anomaly (for positive central value electron $g-2$ experimental data) can be jointly explained to $1σ$ and $2σ$ range, respectively. The $Z_3$ invariant NMSSM, which corresponds to $ξ_F=0$ in our case, can also jointly explain the muon and electron anomaly to $1σ$ and $2σ$ range, respectively.

hep-ph↗

arXiv2023

Towards clinical AI fairness: A translational perspective

Artificial intelligence (AI) has demonstrated the ability to extract insights from data, but the issue of fairness remains a concern in high-stakes fields such as healthcare. Despite extensive discussion and efforts in algorithm development, AI fairness and clinical concerns have not been adequately addressed. In this paper, we discuss the misalignment between technical and clinical perspectives of AI fairness, highlight the barriers to AI fairness' translation to healthcare, advocate multidisciplinary collaboration to bridge the knowledge gap, and provide possible solutions to address the clinical concerns pertaining to AI fairness.

cs.CY↗

arXiv2023

Context-aware Domain Adaptation for Time Series Anomaly Detection

Time series anomaly detection is a challenging task with a wide range of real-world applications. Due to label sparsity, training a deep anomaly detector often relies on unsupervised approaches. Recent efforts have been devoted to time series domain adaptation to leverage knowledge from similar domains. However, existing solutions may suffer from negative knowledge transfer on anomalies due to their diversity and sparsity. Motivated by the empirical study of context alignment between two domains, we aim to transfer knowledge between two domains via adaptively sampling context information for two domains. This is challenging because it requires simultaneously modeling the complex in-domain temporal dependencies and cross-domain correlations while exploiting label information from the source domain. To this end, we propose a framework that combines context sampling and anomaly detection into a joint learning procedure. We formulate context sampling into the Markov decision process and exploit deep reinforcement learning to optimize the time series domain adaptation process via context sampling and design a tailored reward function to generate domain-invariant features that better align two domains for anomaly detection. Experiments on three public datasets show promise for knowledge transfer between two similar domains and two entirely different domains.

cs.LG↗

arXiv2023

Incoherent mode division multiplexing for high-security information encryption

In the age of information explosion, the conventional optical communication protocols are rapidly reaching the limits of their capacity, as almost all available degrees of freedom (e.g., wavelength, polarization) for division multiplexing have been explored to date. Recent advances in coherent mode division multiplexing have greatly facilitated high-speed optical communications and secure, high-capacity information storage and transfer. However, coherent mode division multiplexing is quite vulnerable to even minute environmental disturbances which can cause significant information loss. Here, we propose and experimentally demonstrate a paradigm shift to incoherent mode division multiplexing for high-security optical information encryption by harnessing the degree of coherence of structured random light beams. In contrast to the conventional techniques, our approach does not require mode orthogonality to circumnavigate unwanted mode crosstalk. In addition, our protocol has, in principle, no upper bound on its capacity. Thanks to the extreme robustness of structured random light to external perturbations, we are able to achieve highly accurate information encryption and decryption in the adverse environment. The proposed protocol opens new horizons in an array of fields, such as optical communications and cryptography, and it can be relevant for information processing with acoustical, matter as well as other types of waves.

physics.optics↗