Searcharxiv⌕ Search

arXiv subjects

Yijie Wang

Publications and source records attributed to Yijie Wang.

At least 73 records · Page 4Linked to original sources

Building explainable graph neural network by sparse learning for the drug-protein binding prediction

Explainable Graph Neural Networks (GNNs) have been developed and applied to drug-protein binding prediction to identify the key chemical structures in a drug that have active interactions with the target proteins. However, the key structures identified by the current explainable GNN models are typically chemically invalid. Furthermore, a threshold needs to be manually selected to pinpoint the key structures from the rest. To overcome the limitations of the current explainable GNN models, we propose our SLGNN, which stands for using Sparse Learning to Graph Neural Networks. Our SLGNN relies on using a chemical-substructure-based graph (where nodes are chemical substructures) to represent a drug molecule. Furthermore, SLGNN incorporates generalized fussed lasso with message-passing algorithms to identify connected subgraphs that are critical for the drug-protein binding prediction. Due to the use of the chemical-substructure-based graph, it is guaranteed that any subgraphs in a drug identified by our SLGNN are chemically valid structures. These structures can be further interpreted as the key chemical structures for the drug to bind to the target protein. We demonstrate the explanatory power of our SLGNN by first showing all the key structures identified by our SLGNN are chemically valid. In addition, we illustrate that the key structures identified by our SLGNN have more predictive power than the key structures identified by the competing methods. At last, we use known drug-protein binding data to show the key structures identified by our SLGNN contain most of the binding sites.

q-bio.BM↗

RoSAS: Deep Semi-Supervised Anomaly Detection with Contamination-Resilient Continuous Supervision

Semi-supervised anomaly detection methods leverage a few anomaly examples to yield drastically improved performance compared to unsupervised models. However, they still suffer from two limitations: 1) unlabeled anomalies (i.e., anomaly contamination) may mislead the learning process when all the unlabeled data are employed as inliers for model training; 2) only discrete supervision information (such as binary or ordinal data labels) is exploited, which leads to suboptimal learning of anomaly scores that essentially take on a continuous distribution. Therefore, this paper proposes a novel semi-supervised anomaly detection method, which devises \textit{contamination-resilient continuous supervisory signals}. Specifically, we propose a mass interpolation method to diffuse the abnormality of labeled anomalies, thereby creating new data samples labeled with continuous abnormal degrees. Meanwhile, the contaminated area can be covered by new data samples generated via combinations of data with correct labels. A feature learning-based objective is added to serve as an optimization constraint to regularize the network and further enhance the robustness w.r.t. anomaly contamination. Extensive experiments on 11 real-world datasets show that our approach significantly outperforms state-of-the-art competitors by 20%-30% in AUC-PR and obtains more robust and superior performance in settings with different anomaly contamination levels and varying numbers of labeled anomalies. The source code is available at https://github.com/xuhongzuo/rosas/.

cs.LG↗

Probing high-momentum component in nucleon momentum distribution by neutron-proton bremsstrahlung γ-rays in heavy ion reactions

The high momentum tail (HMT) of nucleons, as a signature of the short-range correlations in nuclei, has been investigated by the high-energy bremsstrahlung $γ$ rays produced in $^{86}$Kr + $^{124}$Sn at 25 MeV/u. The energetic photons are measured by a CsI(Tl) hodoscope mounted on the spectrometer CSHINE. The energy spectrum above 30 MeV can be reproduced by the IBUU model calculations incorporating the photon production channel from $np$ process in which the HMTs of nucleons is considered. A non-zero HMT ratio of about $15\%$ is favored by the data. The effect of the capture channel $np \to dγ$ is demonstrated.

nucl-ex↗

Deep Isolation Forest for Anomaly Detection

Isolation forest (iForest) has been emerging as arguably the most popular anomaly detector in recent years due to its general effectiveness across different benchmarks and strong scalability. Nevertheless, its linear axis-parallel isolation method often leads to (i) failure in detecting hard anomalies that are difficult to isolate in high-dimensional/non-linear-separable data space, and (ii) notorious algorithmic bias that assigns unexpectedly lower anomaly scores to artefact regions. These issues contribute to high false negative errors. Several iForest extensions are introduced, but they essentially still employ shallow, linear data partition, restricting their power in isolating true anomalies. Therefore, this paper proposes deep isolation forest. We introduce a new representation scheme that utilises casually initialised neural networks to map original data into random representation ensembles, where random axis-parallel cuts are subsequently applied to perform the data partition. This representation scheme facilitates high freedom of the partition in the original data space (equivalent to non-linear partition on subspaces of varying sizes), encouraging a unique synergy between random representations and random partition-based isolation. Extensive experiments show that our model achieves significant improvement over state-of-the-art isolation-based methods and deep detectors on tabular, graph and time series datasets; our model also inherits desired scalability from iForest.

cs.LG↗

Fascinating Supervisory Signals and Where to Find Them: Deep Anomaly Detection with Scale Learning

Due to the unsupervised nature of anomaly detection, the key to fueling deep models is finding supervisory signals. Different from current reconstruction-guided generative models and transformation-based contrastive models, we devise novel data-driven supervision for tabular data by introducing a characteristic -- scale -- as data labels. By representing varied sub-vectors of data instances, we define scale as the relationship between the dimensionality of original sub-vectors and that of representations. Scales serve as labels attached to transformed representations, thus offering ample labeled data for neural network training. This paper further proposes a scale learning-based anomaly detection method. Supervised by the learning objective of scale distribution alignment, our approach learns the ranking of representations converted from varied subspaces of each data instance. Through this proxy task, our approach models inherent regularities and patterns within data, which well describes data "normality". Abnormal degrees of testing instances are obtained by measuring whether they fit these learned patterns. Extensive experiments show that our approach leads to significant improvement over state-of-the-art generative/contrastive anomaly detection methods.

cs.LG↗

A CsI hodoscope on CSHINE for Bremsstrahlung γ-rays in Heavy Ion Reactions

Bremsstrahlung $γ$ production in heavy ion reactions at Fermi energies carries important physical information including the nuclear symmetry energy at supra-saturation densities. In order to detect the high energy Bremsstrahlung $γ$ rays, a hodoscope consisting of 15 CsI(Tl) crystal read out by photo multiplier tubes has been built, tested and operated in experiment. The resolution, efficiency and linear response of the units to $γ$ rays have been studied using radioactive source and $({\rm p},γ)$ reactions. The inherent energy resolution of $1.6\%+2\%/E_γ^{1/2}$ is obtained. Reconstruction method has been established through Geant 4 simulations, reproducing the experimental results where comparison can be made. Using the reconstruction method developed, the whole efficiency of the hodoscope is about $2.6\times 10^{-4}$ against the $4π$ emissions at the target position, exhibiting insignificant dependence on the energy of incident $γ$ rays above 20 MeV. The hodoscope is operated in the experiment of $^{86}$Kr + $^{124}$Sn at 25 MeV/u, and a full $γ$ energy spectrum up to 80 MeV has been obtained.

physics.ins-det↗

Observing the Ping-pong Modality of Isospin Degree of Freedom in Cluster Emission from Heavy Ion Reactions

Two-body correlations of the isotope-resolved light and heavy clusters are measured in $^{86}$Kr+$^{\rm 208}$Pb reactions at 25 MeV/u. The yield and kinetic variables of the $A=3$ isobars, triton and $^3$He, are analyzed in coincidence with the heavy clusters of $7\le A \le 14$ emitted at the earlier chance. While the velocity spectra of both triton and $^3$He exhibit scaling behavior over the type of the heavy clusters, the yield ratios of ${\rm t/^3He}$ correlate reversely to the neutron-to-proton ratio $N/Z$ of the latter, showing the ping-pong modality of the $N/Z$ of emitted clusters. The commonality that the $N/Z$ of the residues keeps the initial system value is extended to the cluster emission in heavy ion reactions. The comparison of transport model calculations to the data is discussed.

nucl-ex↗

An FPGA-based Trigger System for CSHINE

A trigger system of general function is designed using the commercial module CAEN V2495 for heavy ion nuclear reaction experiment at Fermi energies. The system has been applied and verified on CSHINE (Compact Spectrometer for Heavy IoN Experiment). Based on the field programmable logic gate array (FPGA) technology of command register access and remote computer control operation, trigger functions can be flexibly configured according to the experimental physical goals. Using the trigger system on CSHINE, we carried out the beam experiment of 25 MeV/u $ ^{86}{\rm Kr}+ ^{124}{\rm Sn}$ on the Radioactive Ion Beam Line 1 in Lanzhou (RIBLL1), China. The online results demonstrate that the trigger system works normally and correctly. The system can be extended to other experiments.

physics.ins-det↗

CDNet: Contrastive Disentangled Network for Fine-Grained Image Categorization of Ocular B-Scan Ultrasound

Precise and rapid categorization of images in the B-scan ultrasound modality is vital for diagnosing ocular diseases. Nevertheless, distinguishing various diseases in ultrasound still challenges experienced ophthalmologists. Thus a novel contrastive disentangled network (CDNet) is developed in this work, aiming to tackle the fine-grained image categorization (FGIC) challenges of ocular abnormalities in ultrasound images, including intraocular tumor (IOT), retinal detachment (RD), posterior scleral staphyloma (PSS), and vitreous hemorrhage (VH). Three essential components of CDNet are the weakly-supervised lesion localization module (WSLL), contrastive multi-zoom (CMZ) strategy, and hyperspherical contrastive disentangled loss (HCD-Loss), respectively. These components facilitate feature disentanglement for fine-grained recognition in both the input and output aspects. The proposed CDNet is validated on our ZJU Ocular Ultrasound Dataset (ZJUOUSD), consisting of 5213 samples. Furthermore, the generalization ability of CDNet is validated on two public and widely-used chest X-ray FGIC benchmarks. Quantitative and qualitative results demonstrate the efficacy of our proposed CDNet, which achieves state-of-the-art performance in the FGIC task. Code is available at: https://github.com/ZeroOneGame/CDNet-for-OUS-FGIC .

cs.CV↗

Distributionally Robust Observable Strategic Queues

This paper presents an extension of Naor's analysis on the join-or-balk problem in observable M/M/1 queues. While all other Markovian assumptions still hold, we explore this problem assuming uncertain arrival rates under the distributionally robust settings. We first study the problem with the classical moment ambiguity set, where the support, mean, and mean-absolute deviation of the underlying distribution are known. Next, we extend the model to the data-driven setting, where decision makers only have access to a finite set of samples. We develop three optimal joining threshold strategies from the perspective of an individual customer, a social optimizer, and a revenue maximizer, such that their respective worst-case expected benefit rates are maximized. Finally, we compare our findings with Naor's original results and the traditional sample average approximation scheme.

math.OC↗

RayMVSNet: Learning Ray-based 1D Implicit Fields for Accurate Multi-View Stereo

Learning-based multi-view stereo (MVS) has by far centered around 3D convolution on cost volumes. Due to the high computation and memory consumption of 3D CNN, the resolution of output depth is often considerably limited. Different from most existing works dedicated to adaptive refinement of cost volumes, we opt to directly optimize the depth value along each camera ray, mimicking the range (depth) finding of a laser scanner. This reduces the MVS problem to ray-based depth optimization which is much more light-weight than full cost volume optimization. In particular, we propose RayMVSNet which learns sequential prediction of a 1D implicit field along each camera ray with the zero-crossing point indicating scene depth. This sequential modeling, conducted based on transformer features, essentially learns the epipolar line search in traditional multi-view stereo. We also devise a multi-task learning for better optimization convergence and depth accuracy. Our method ranks top on both the DTU and the Tanks \& Temples datasets over all previous learning-based methods, achieving overall reconstruction score of 0.33mm on DTU and f-score of 59.48% on Tanks & Temples.

cs.CV↗

Provable Constrained Stochastic Convex Optimization with XOR-Projected Gradient Descent

Provably solving stochastic convex optimization problems with constraints is essential for various problems in science, business, and statistics. Recently proposed XOR-Stochastic Gradient Descent (XOR-SGD) provides a convergence rate guarantee solving the constraints-free version of the problem by leveraging XOR-Sampling. However, the task becomes more difficult when additional equality and inequality constraints are needed to be satisfied. Here we propose XOR-PGD, a novel algorithm based on Projected Gradient Descent (PGD) coupled with the XOR sampler, which is guaranteed to solve the constrained stochastic convex optimization problem still in linear convergence rate by choosing proper step size. We show on both synthetic stochastic inventory management and real-world road network design problems that the rate of constraints satisfaction of the solutions optimized by XOR-PGD is $10\%$ more than the competing approaches in a very large searching space. The improved XOR-PGD algorithm is demonstrated to be more accurate and efficient than both XOR-SGD and SGD coupled with MCMC based samplers. It is also shown to be more scalable with respect to the number of samples and processor cores via experiments with large dimensions.

math.OC↗

Track Recognition for the $ΔE-E$ Telescopes with Silicon Strip Detectors

For the high granularity and high energy resolution, Silicon Strip Detector (SSD) is widely applied in assembling telescopes to measure the charged particles in heavy ion reactions. In this paper, we present a novel method to achieve track recognition in the SSD telescopes of the Compact Spectrometer for Heavy Ion Experiment (CSHINE). Each telescope consists of a single-sided silicon strip detector (SSSSD) and a double-sided silicon strip detector (DSSSD) backed by $3 \times 3$ CsI(Tl) crystals. Detector calibration and track reconstruction are implemented. Special decoding algorithm is developed for the multi-track recognition procedure to deal with the multi-hit effect convoluted by charge sharing and the missing signals with certain probability. It is demonstrated that the track recognition efficiency of the method is approximately 90\% and 80\% for the DSSSD-CsI and SSSSD-DSSSD events, respectively.

physics.ins-det↗

Reconstruction of Fission Events in Heavy Ion Reactions with CSHINE

We report the reconstruction method of the fast fission events in 25 MeV/u $^{86}$Kr +$^{208}$Pb reactions at the Compact Spectrometer for Heavy IoN Experiment (CSHINE). The fission fragments are measured by three large-area parallel plate avalanche counters, which can deliver the position and the arrival timing information of the fragments. The start timing information is given by the radio frequency of the cyclotron. Using the velocities of the two fission fragments, the fission events are reconstructed. The broadening of both the velocity distribution and the azimuthal difference of the fission fragments decrease with the folding angle, in accordance with the picture that fast fission occurs. The anisotropic angular distribution of the fission axis also reveals consistently the dynamic feature the fission events.

nucl-ex↗

The Emission Order of Hydrogen Isotopes via Correlation Functions in 30 MeV/u Ar+Au Reactions

The intensity interferometry is applied as a chronometer of the particle emission of hydrogen isotopes from the intermediate velocity source formed in $^{40}$Ar+$^{197}$Au reactions at 30 MeV/u. The dynamic emission order of $τ_{\rm p}>τ_{\rm d}>τ_{\rm t}$ is evidenced via the correlation functions of nonidentical particle pairs. Assuming the similar source size, the same emission order is inferred from the correlation functions of identical particle pairs, where $τ_{\rm p} \approx 100 {\rm ~fm/c}$ is extracted by the fit of Koonin-Pratt equation to p-p correlation function. Transport model simulations demonstrate that the dynamic emission order of light charged particles depends on the stiffness of the nuclear symmetry energy.

nucl-ex↗

Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics

We consider the problem of projecting a vector onto the so-called k-capped simplex, which is a hyper-cube cut by a hyperplane. For an n-dimensional input vector with bounded elements, we found that a simple algorithm based on Newton's method is able to solve the projection problem to high precision with a complexity roughly about O(n), which has a much lower computational cost compared with the existing sorting-based methods proposed in the literature. We provide a theory for partial explanation and justification of the method. We demonstrate that the proposed algorithm can produce a solution of the projection problem with high precision on large scale datasets, and the algorithm is able to significantly outperform the state-of-the-art methods in terms of runtime (about 6-8 times faster than a commercial software with respect to CPU time for input vector with 1 million variables or more). We further illustrate the effectiveness of the proposed algorithm on solving sparse regression in a bioinformatics problem. Empirical results on the GWAS dataset (with 1,500,000 single-nucleotide polymorphisms) show that, when using the proposed method to accelerate the Projected Quasi-Newton (PQN) method, the accelerated PQN algorithm is able to handle huge-scale regression problem and it is more efficient (about 3-6 times faster) than the current state-of-the-art methods.

math.OC↗

On Data-Driven Prescriptive Analytics with Side Information: A Regularized Nadaraya-Watson Approach

We consider generic stochastic optimization problems in the presence of side information which enables a more insightful decision. The side information constitutes observable exogenous covariates that alter the conditional probability distribution of the random problem parameters. A decision maker who adapts her decisions according to the observed side information solves an optimization problem where the objective function is specified by the conditional expectation of the random cost. If the joint probability distribution is unknown, then the conditional expectation can be approximated in a data-driven manner using the Nadaraya-Watson (NW) kernel regression. While the emerging approximation scheme has found successful applications in diverse decision problems under uncertainty, it is largely unknown whether the scheme can provide any reasonable out-of-sample performance guarantees. In this paper, we establish guarantees for the generic problems by leveraging techniques from moderate deviations theory. Our analysis motivates the use of a variance-based regularization scheme which, in general, leads to a non-convex optimization problem. We adopt ideas from distributionally robust optimization to obtain tractable formulations. We present numerical experiments for newsvendor and wind energy commitment problems to highlight the effectiveness of our regularization scheme.

math.OC↗

Properties of the fast fission and the coincident emissions of light charged particles in $^{40}$Ar + $^{197}$Au reactions at 30 MeV/u

The experiment of Ar+Au reactions at 30 MeV/u have been performed using the Compact Spectrometer for Heavy IoN Experiments (CSHINE) in phase I. The light-charged particles are measured by the silicon stripe telescopes in coincidence with the fission fragments recorded by the parallel plate avalanche counters. The distribution properties of the azimuth difference $Δϕ$ and the time-of-flight difference $ΔTOF$ of the fission fragments are presented varying the folding angles which represents the linear momentum transfer from the projectile to the reaction system. The relative abundance of the light charged particles in the fission events to the inclusive events is compared as a function of the laboratory angle $θ_{\rm lab}$ ranging from $18^\circ$ to $60^\circ$ in various folding angle windows. The angular evolution of the yield ratios of p/d and t/d in coincidence with fission fragments is investigated. In a relative comparison, tritons are more abundantly emitted at small angles, while protons are more abundant at large angles. The angular evolution of the neutron richness of the light-charged particles is consistent with the results obtained in previous inclusive experiments.

nucl-ex↗