Searcharxiv⌕ Search

arXiv subjects

Kai Wang

Publications and source records attributed to Kai Wang.

At least 487 records · Page 27Linked to original sources

Can We Evaluate Domain Adaptation Models Without Target-Domain Labels?

Unsupervised domain adaptation (UDA) involves adapting a model trained on a label-rich source domain to an unlabeled target domain. However, in real-world scenarios, the absence of target-domain labels makes it challenging to evaluate the performance of UDA models. Furthermore, prevailing UDA methods relying on adversarial training and self-training could lead to model degeneration and negative transfer, further exacerbating the evaluation problem. In this paper, we propose a novel metric called the \textit{Transfer Score} to address these issues. The proposed metric enables the unsupervised evaluation of UDA models by assessing the spatial uniformity of the classifier via model parameters, as well as the transferability and discriminability of deep representations. Based on the metric, we achieve three novel objectives without target-domain labels: (1) selecting the best UDA method from a range of available options, (2) optimizing hyperparameters of UDA models to prevent model degeneration, and (3) identifying which checkpoint of UDA model performs optimally. Our work bridges the gap between data-level UDA research and practical UDA scenarios, enabling a realistic assessment of UDA model performance. We validate the effectiveness of our metric through extensive empirical studies on UDA datasets of different scales and imbalanced distributions. The results demonstrate that our metric robustly achieves the aforementioned goals.

cs.CV↗

Black-Hole-to-Halo Mass Relation From UNIONS Weak Lensing

This letter presents, for the first time, direct constraints on the black-hole-to-halo-mass relation using weak gravitational lensing measurements. We construct type I and type II Active Galactic Nuclei (AGNs) samples from the Sloan Digital Sky Survey (SDSS), with a mean redshift of 0.4 0.1 for type I (type II) AGNs. This sample is cross-correlated with weak lensing shear from the Ultraviolet Near Infrared Northern Survey (UNIONS). We compute the excess surface mass density of the halos associated with $36,181$ AGNs from $94,308,561$ lensed galaxies and fit the halo mass in bins of black-hole mass. We find that more massive AGNs reside in more massive halos. We see no evidence of dependence on AGN type or redshift in the black-hole-to-halo-mass relationship when systematic errors in the measured black-hole masses are included. Our results are consistent with previous measurements for non-AGN galaxies. At a fixed black-hole mass, our weak-lensing halo masses are consistent with galaxy rotation curves, but significantly lower than galaxy clustering measurements. Finally, our results are broadly consistent with state-of-the-art hydro-dynamical cosmological simulations, providing a new constraint for black-hole masses in simulations.

astro-ph.GA↗

AI-Generated Content Enhanced Computer-Aided Diagnosis Model for Thyroid Nodules: A ChatGPT-Style Assistant

An artificial intelligence-generated content-enhanced computer-aided diagnosis (AIGC-CAD) model, designated as ThyGPT, has been developed. This model, inspired by the architecture of ChatGPT, could assist radiologists in assessing the risk of thyroid nodules through semantic-level human-machine interaction. A dataset comprising 19,165 thyroid nodule ultrasound cases from Zhejiang Cancer Hospital was assembled to facilitate the training and validation of the model. After training, ThyGPT could automatically evaluate thyroid nodule and engage in effective communication with physicians through human-computer interaction. The performance of ThyGPT was rigorously quantified using established metrics such as the receiver operating characteristic (ROC) curve, area under the curve (AUC), sensitivity, and specificity. The empirical findings revealed that radiologists, when supplemented with ThyGPT, markedly surpassed the diagnostic acumen of their peers utilizing traditional methods as well as the performance of the model in isolation. These findings suggest that AIGC-CAD systems, exemplified by ThyGPT, hold the promise to fundamentally transform the diagnostic workflows of radiologists in forthcoming years.

cs.CV↗

Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness

Graph Neural Networks (GNNs) excel in various graph learning tasks but face computational challenges when applied to large-scale graphs. A promising solution is to remove non-essential edges to reduce the computational overheads in GNN. Previous literature generally falls into two categories: topology-guided and semantic-guided. The former maintains certain graph topological properties yet often underperforms on GNNs due to low integration with neural network training. The latter performs well at lower sparsity on GNNs but faces performance collapse at higher sparsity levels. With this in mind, we take the first step to propose a new research line and concept termed Graph Sparse Training (GST), which dynamically manipulates sparsity at the data level. Specifically, GST initially constructs a topology & semantic anchor at a low training cost, followed by performing dynamic sparse training to align the sparse graph with the anchor. We introduce the Equilibria Sparsification Principle to guide this process, effectively balancing the preservation of both topological and semantic information. Ultimately, GST produces a sparse graph with maximum topological integrity and no performance degradation. Extensive experiments on 6 datasets and 5 backbones showcase that GST (I) identifies subgraphs at higher graph sparsity levels (1.67%~15.85% $\uparrow$) than state-of-the-art sparsification methods, (II) preserves more key spectral properties, (III) achieves 1.27-3.42$\times$ speedup in GNN inference and (IV) successfully helps graph adversarial defense and graph lottery tickets.

cs.LG↗

Measuring galaxy abundance and clustering at high redshift from incomplete spectroscopic data: Tests on mock catalogs

The number density and correlation function of galaxies are two key quantities to characterize the distribution of the observed galaxy population. High-$z$ spectroscopic surveys, which usually involve complex target selection and are incomplete in redshift sampling, present both opportunities and challenges to measure these quantities reliably in the high-$z$ Universe. Using realistic mock catalogs we show that target selection and redshift incompleteness can lead to significantly biased results, especially due to the flux limit selection criteria. We develop a new method to correct the flux limit effect, using information provided by the parent photometric data from which the spectroscopic sample is constructed. Our tests using realistic mock samples show that the method is able to reproduce the true stellar mass function and correlation function reliably. Mock catalogs are constructed for the existing zCOSMOS and VIPERS surveys, as well as for the forthcoming PFS galaxy evolution survey. The same set of mock samples are used to quantify the total variance expected for different sample sizes. We find that the total variance decreases very slowly when the survey area reaches about 4 deg$^2$ for the abundance and about 8 deg$^2$ for the clustering, indicating that the cosmic variance is no longer the dominant source of error for PFS-like surveys. We also quantify improvements expected in the PFS-like galaxy survey relative to zCOSMOS and VIPERS surveys.

astro-ph.GA↗

Experimental simulation of quantum superchannels

Simulating quantum physical processes has been one of the major motivations for quantum information science. Quantum channels, which are completely positive and trace preserving processes, are the standard mathematical language to describe quantum evolution, while in recent years quantum superchannels have emerged as the substantial extension. Superchannels capture effects of quantum memory and non-Markovianality more precisely, and have found broad applications in universal models, algorithm, metrology, discrimination tasks, as examples. Here, we report an experimental simulation of qubit superchannels in a nuclear magnetic resonance (NMR) system with high accuracy, based on a recently developed quantum algorithm for superchannel simulation. Our algorithm applies to arbitrary target superchannels, and our experiment shows the high quality of NMR simulators for near-term usage. Our approach can also be adapted to other experimental systems and demonstrates prospects for more applications of superchannels.

quant-ph↗

Machine learning for industrial sensing and control: A survey and practical perspective

With the rise of deep learning, there has been renewed interest within the process industries to utilize data on large-scale nonlinear sensing and control problems. We identify key statistical and machine learning techniques that have seen practical success in the process industries. To do so, we start with hybrid modeling to provide a methodological framework underlying core application areas: soft sensing, process optimization, and control. Soft sensing contains a wealth of industrial applications of statistical and machine learning methods. We quantitatively identify research trends, allowing insight into the most successful techniques in practice. We consider two distinct flavors for data-driven optimization and control: hybrid modeling in conjunction with mathematical programming techniques and reinforcement learning. Throughout these application areas, we discuss their respective industrial requirements and challenges. A common challenge is the interpretability and efficiency of purely data-driven methods. This suggests a need to carefully balance deep learning techniques with domain knowledge. As a result, we highlight ways prior knowledge may be integrated into industrial machine learning applications. The treatment of methods, problems, and applications presented here is poised to inform and inspire practitioners and researchers to develop impactful data-driven sensing, optimization, and control solutions in the process industries.

eess.SY↗

Must: Maximizing Latent Capacity of Spatial Transcriptomics Data

Spatial transcriptomics (ST) technologies have revolutionized the study of gene expression patterns in tissues by providing multimodality data in transcriptomic, spatial, and morphological, offering opportunities for understanding tissue biology beyond transcriptomics. However, we identify the modality bias phenomenon in ST data species, i.e., the inconsistent contribution of different modalities to the labels leads to a tendency for the analysis methods to retain the information of the dominant modality. How to mitigate the adverse effects of modality bias to satisfy various downstream tasks remains a fundamental challenge. This paper introduces Multiple-modality Structure Transformation, named MuST, a novel methodology to tackle the challenge. MuST integrates the multi-modality information contained in the ST data effectively into a uniform latent space to provide a foundation for all the downstream tasks. It learns intrinsic local structures by topology discovery strategy and topology fusion loss function to solve the inconsistencies among different modalities. Thus, these topology-based and deep learning techniques provide a solid foundation for a variety of analytical tasks while coordinating different modalities. The effectiveness of MuST is assessed by performance metrics and biological significance. The results show that it outperforms existing state-of-the-art methods with clear advantages in the precision of identifying and preserving structures of tissues and biomarkers. MuST offers a versatile toolkit for the intricate analysis of complex biological systems.

cs.CE↗

Understanding YTHDF2-mediated mRNA Degradation By m6A-BERT-Deg

N6-methyladenosine (m6A) is the most abundant mRNA modification within mammalian cells, holding pivotal significance in the regulation of mRNA stability, translation, and splicing. Furthermore, it plays a critical role in the regulation of RNA degradation by primarily recruiting the YTHDF2 reader protein. However, the selective regulation of mRNA decay of the m6A-methylated mRNA through YTHDF2 binding is poorly understood. To improve our understanding, we developed m6A-BERT-Deg, a BERT model adapted for predicting YTHDF2-mediated degradation of m6A-methylated mRNAs. We meticulously assembled a high-quality training dataset by integrating multiple data sources for the HeLa cell line. To overcome the limitation of small training samples, we employed a pre-training-fine-tuning strategy by first performing a self-supervised pre-training of the model on 427,760 unlabeled m6A site sequences. The test results demonstrated the importance of this pre-training strategy in enabling m6A-BERT-Deg to outperform other benchmark models. We further conducted a comprehensive model interpretation and revealed a surprising finding that the presence of co-factors in proximity to m6A sites may disrupt YTHDF2-mediated mRNA degradation, subsequently enhancing mRNA stability. We also extended our analyses to the HEK293 cell line, shedding light on the context-dependent YTHDF2-mediated mRNA degradation.

q-bio.MN↗

Characterizing the assembly of dark matter halos with protohalo size histories: I. Redshift evolution, relation to descendant halos, and halo assembly bias

We propose a novel method to quantify the assembly histories of dark matter halos with the redshift evolution of the mass-weighted spatial variance of their progenitor halos, i.e. the protohalo size history. We find that the protohalo size history for each individual halo at z~0 can be described by a double power-law function. The amplitude of the fitting function strongly correlates to the central-to-total stellar mass ratios of descendant halos. The variation of the amplitude of the protohalo size history can induce a strong halo assembly bias effect for massive halos. This effect is detectable in observation using the central-to-total stellar mass ratio as a proxy of the protohalo size. The correlation to the descendant central-to-total stellar mass ratio and the halo assembly bias effect seen in the protohalo size are much stronger than that seen in the commonly adopted half-mass formation time derived from the mass accretion history. This indicates that the information loss caused by the compression of halo merger trees to mass accretion histories can be captured by the protohalo size history. Protohalo size thus provides a useful quantity to connect protoclusters across cosmic time and to link protoclusters with their descendant clusters in observations.

astro-ph.GA↗

Deep Lossy Plus Residual Coding for Lossless and Near-lossless Image Compression

Lossless and near-lossless image compression is of paramount importance to professional users in many technical fields, such as medicine, remote sensing, precision engineering and scientific research. But despite rapidly growing research interests in learning-based image compression, no published method offers both lossless and near-lossless modes. In this paper, we propose a unified and powerful deep lossy plus residual (DLPR) coding framework for both lossless and near-lossless image compression. In the lossless mode, the DLPR coding system first performs lossy compression and then lossless coding of residuals. We solve the joint lossy and residual compression problem in the approach of VAEs, and add autoregressive context modeling of the residuals to enhance lossless compression performance. In the near-lossless mode, we quantize the original residuals to satisfy a given $\ell_\infty$ error bound, and propose a scalable near-lossless compression scheme that works for variable $\ell_\infty$ bounds instead of training multiple networks. To expedite the DLPR coding, we increase the degree of algorithm parallelization by a novel design of coding context, and accelerate the entropy coding with adaptive residual interval. Experimental results demonstrate that the DLPR coding system achieves both the state-of-the-art lossless and near-lossless image compression performance with competitive coding speed.

eess.IV↗

Versatile Diffusion: Text, Images and Variations All in One Diffusion Model

Recent advances in diffusion models have set an impressive milestone in many generation tasks, and trending works such as DALL-E2, Imagen, and Stable Diffusion have attracted great interest. Despite the rapid landscape changes, recent new approaches focus on extensions and performance rather than capacity, thus requiring separate models for separate tasks. In this work, we expand the existing single-flow diffusion pipeline into a multi-task multimodal network, dubbed Versatile Diffusion (VD), that handles multiple flows of text-to-image, image-to-text, and variations in one unified model. The pipeline design of VD instantiates a unified multi-flow diffusion framework, consisting of sharable and swappable layer modules that enable the crossmodal generality beyond images and text. Through extensive experiments, we demonstrate that VD successfully achieves the following: a) VD outperforms the baseline approaches and handles all its base tasks with competitive quality; b) VD enables novel extensions such as disentanglement of style and semantics, dual- and multi-context blending, etc.; c) The success of our multi-flow multimodal framework over images and text may inspire further diffusion-based universal AI research. Our code and models are open-sourced at https://github.com/SHI-Labs/Versatile-Diffusion.

cs.CV↗

Summarizing Stream Data for Memory-Constrained Online Continual Learning

Replay-based methods have proved their effectiveness on online continual learning by rehearsing past samples from an auxiliary memory. With many efforts made on improving training schemes based on the memory, however, the information carried by each sample in the memory remains under-investigated. Under circumstances with restricted storage space, the informativeness of the memory becomes critical for effective replay. Although some works design specific strategies to select representative samples, by only employing a small number of original images, the storage space is still not well utilized. To this end, we propose to Summarize the knowledge from the Stream Data (SSD) into more informative samples by distilling the training characteristics of real images. Through maintaining the consistency of training gradients and relationship to the past tasks, the summarized samples are more representative for the stream data compared to the original images. Extensive experiments are conducted on multiple online continual learning benchmarks to support that the proposed SSD method significantly enhances the replay effects. We demonstrate that with limited extra computational overhead, SSD provides more than 3% accuracy boost for sequential CIFAR-100 under extremely restricted memory buffer. Code in https://github.com/vimar-gu/SSD.

cs.CV↗

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs

Bipartite graphs characterize relationships between two different sets of entities, like actor-movie, user-item, and author-paper. The butterfly, a 4-vertices 4-edges (2,2)-biclique, is the simplest cohesive motif in a bipartite graph and is the fundamental component of higher-order substructures. Counting and enumerating the butterflies offer significant benefits across various applications, including fraud detection, graph embedding, and community search. While the corresponding motif, the triangle, in the unipartite graphs has been widely studied in both static and temporal settings, the extension of butterfly to temporal bipartite graphs remains unexplored. In this paper, we investigate the temporal butterfly counting and enumeration problem: count and enumerate the butterflies whose edges establish following a certain order within a given duration. Towards efficient computation, we devise a non-trivial baseline rooted in the state-of-the-art butterfly counting algorithm on static graphs, further, explore the intrinsic property of the temporal butterfly, and develop a new optimization framework with a compact data structure and effective priority strategy. The time complexity is proved to be significantly reduced without compromising on space efficiency. In addition, we generalize our algorithms to practical streaming settings and multi-core computing architectures. Our extensive experiments on 11 large-scale real-world datasets demonstrate the efficiency and scalability of our solutions.

cs.DS↗

Mutual Information as Intrinsic Reward of Reinforcement Learning Agents for On-demand Ride Pooling

The emergence of on-demand ride pooling services allows each vehicle to serve multiple passengers at a time, thus increasing drivers' income and enabling passengers to travel at lower prices than taxi/car on-demand services (only one passenger can be assigned to a car at a time like UberX and Lyft). Although on-demand ride pooling services can bring so many benefits, ride pooling services need a well-defined matching strategy to maximize the benefits for all parties (passengers, drivers, aggregation companies and environment), in which the regional dispatching of vehicles has a significant impact on the matching and revenue. Existing algorithms often only consider revenue maximization, which makes it difficult for requests with unusual distribution to get a ride. How to increase revenue while ensuring a reasonable assignment of requests brings a challenge to ride pooling service companies (aggregation companies). In this paper, we propose a framework for vehicle dispatching for ride pooling tasks, which splits the city into discrete dispatching regions and uses the reinforcement learning (RL) algorithm to dispatch vehicles in these regions. We also consider the mutual information (MI) between vehicle and order distribution as the intrinsic reward of the RL algorithm to improve the correlation between their distributions, thus ensuring the possibility of getting a ride for unusually distributed requests. In experimental results on a real-world taxi dataset, we demonstrate that our framework can significantly increase revenue up to an average of 3\% over the existing best on-demand ride pooling method.

cs.AI↗

Determining the Origin of Very-high-energy Gamma Rays from Galactic Sources by Future Neutrino Observations

Recently, the Large High Altitude Air Shower Observatory (LHAASO) identified 12 $γ$-ray sources emitting gamma rays with energies above 100 TeV, making them potential PeV cosmic-ray accelerators (PeVatrons). Neutrino observations are crucial in determining whether the gamma-ray radiation process is of hadronic or leptonic origin. In this paper, we study three detected sources, LHAASO J1908+0621, LHAASO J2018+3651, and LHAASO J2032+4102, which are also the most promising galactic high-energy neutrino candidate sources with the lowest pre-trial p-value based on the stacking searches testing for excess neutrino emission by IceCube Neutrino Observatory. We study the lepto-hadronic scenario for the observed multiband spectra of these LHAASO sources considering the possible counterpart source of the LHAASO sources. The very-high-energy gamma rays are entirely attributed to the hadronic contribution, therefore the most optimistic neutrino flux can be derived. Then, we evaluate the statistical significance (p-value) as a function of the observation time of IceCube and the next-generation IceCube-Gen2 neutrino observatory respectively. Our results tend to disfavor that all gamma rays above $100\,\rm GeV$ from LHAASO J1908+0621 are of purely hadronic origin based on current IceCube observations, but the purely hadronic origin of gamma rays above $100\,\rm TeV$ is still possible. By IceCube-Gen2, the origin of gamma rays above $100\,\rm TeV$ from LHAASO J1908+0621 can be further determined at a $5σ$ significance level within a running time of $\sim 3$ years. For LHAASO J2018+3651 and LHAASO J2032+4102, the required running time of IceCube-Gen2 is $\sim 10$ years ($3σ$) and $\sim 10$ years ($5σ$), respectively. Future observations by the next-generation neutrino telescope will be crucial to understanding the particle acceleration and radiation processes inside the sources.

astro-ph.HE↗

An efficient and robust method to estimate halo concentration

We propose an efficient and robust method to estimate the halo concentration based on the first moment of the density distribution, which is $R_1\equiv \int_0^{r_{\rm vir}}4πr^3ρ(r)dr/M_{\rm vir}/r_{\rm vir}$. We find that $R_1$ has a monotonic relation with the concentration parameter of the NFW profile, and that a cubic polynomial function can fit the relation with an error $\lesssim 3\%$. Tests on ideal NFW halos show that the conventional NFW profile fitting method and the $V_{\rm max}/V_{\rm vir}$ method produce biased halo concentration estimation by $\approx 10\%$ and $\approx 30\%$, respectively, for halos with 100 particles. In contrast, the systematic error for our $R_1$ method is smaller than $0.5\%$ even for halos containing only 100 particles. Convergence tests on realistic halos in $N$-body simulations show that the NFW profile fitting method underestimates the concentration parameter for halos with $\lesssim 300$ particles by $\gtrsim 20\%$, while the error for the $R_1$ method is $\lesssim 8\%$. We also show other applications of $R_1$, including estimating $V_{\rm max}$ and the Einasto concentration $c_{\rm e}\equiv r_{\rm vir}/r_{-2}$. The calculation of $R_1$ is efficient and robust, and we recommend including it as one of the halo properties in halo catalogs of cosmological simulations.

astro-ph.CO↗

Koszul duality, minimal model and $L_\infty$-structure for differential algebras with weight

A differential algebra with weight is an abstraction of both the derivation (weight zero) and the forward and backward difference operators (weight $\pm 1$). In 2010 Loday established the Koszul duality for the operad of differential algebras of weight zero. He did not treat the case of nonzero weight, noting that new techniques are needed since the operad is no longer quadratic. This paper continues Loday's work and establishes the Koszul duality in the case of nonzero weight. In the process, the minimal model and the Koszul dual homotopy cooperad of the operad governing differential algebras with weight are determined. As a consequence, a notion of homotopy differential algebras with weight is obtained and the deformation complex as well as its $L_\infty$-algebra structure for differential algebras with weight are deduced.

math.RA↗