Search arXiv⌕ Search

arXiv subjects

Yu Wang

Publications and source records attributed to Yu Wang.

At least 973 records · Page 54Linked to original sources

DiffusionSeg: Adapting Diffusion Towards Unsupervised Object Discovery

Learning from a large corpus of data, pre-trained models have achieved impressive progress nowadays. As popular generative pre-training, diffusion models capture both low-level visual knowledge and high-level semantic relations. In this paper, we propose to exploit such knowledgeable diffusion models for mainstream discriminative tasks, i.e., unsupervised object discovery: saliency segmentation and object localization. However, the challenges exist as there is one structural difference between generative and discriminative models, which limits the direct use. Besides, the lack of explicitly labeled data significantly limits performance in unsupervised settings. To tackle these issues, we introduce DiffusionSeg, one novel synthesis-exploitation framework containing two-stage strategies. To alleviate data insufficiency, we synthesize abundant images, and propose a novel training-free AttentionCut to obtain masks in the first synthesis stage. In the second exploitation stage, to bridge the structural gap, we use the inversion technique, to map the given image back to diffusion features. These features can be directly used by downstream architectures. Extensive experiments and ablation studies demonstrate the superiority of adapting diffusion for unsupervised object discovery.

cs.CV↗

Floquet nonadiabatic dynamics in open quantum systems

The Born-Oppenheimer (BO) approximation has shaped our understanding on molecular dynamics microscopically in many physical and chemical systems. However, there are many cases that we must go beyond the BO approximation, particularly when strong light-matter interactions are considered. Floquet theory offers a powerful tool to treat time-periodic quantum systems. In this overview, we briefly review recent developments on Floquet nonadiabatic dynamics, with a special focus on open quantum systems. We first present the general Floquet Liouville von-Neumann (LvN) equation. We then show how to connect Floquet operators to real time observables. We proceed to outline the derivation of the Floquet quantum master equation in treating the dynamics under periodic driving in open quantum systems. We further present the Floquet mixed quantum classical Liouville equation (QCLE) to deal with coupled electron-nuclear dynamics. Finally, we embed FQCLE into a classical master equation (CME) to deal with Floquet nonadiabatic dynamics in open quantum systems. The formulations are general platforms for developing trajectory based dynamical approaches. As an example, we show how Floquet QCLE and Floquet CME can be implemented into a Langevin dynamics with Lorentz force and surface hopping algorithms.

quant-ph↗

Knowledge-aware Bayesian Co-attention for Multimodal Emotion Recognition

Multimodal emotion recognition is a challenging research area that aims to fuse different modalities to predict human emotion. However, most existing models that are based on attention mechanisms have difficulty in learning emotionally relevant parts on their own. To solve this problem, we propose to incorporate external emotion-related knowledge in the co-attention based fusion of pre-trained models. To effectively incorporate this knowledge, we enhance the co-attention model with a Bayesian attention module (BAM) where a prior distribution is estimated using the emotion-related knowledge. Experimental results on the IEMOCAP dataset show that the proposed approach can outperform several state-of-the-art approaches by at least 0.7% unweighted accuracy (UA).

cs.CL↗

Generation of large-scale continuous-variable cluster states multiplexed both in time and frequency domains

Large-scale continuous variable (CV) cluster state is necessary in quantum information processing based on measurement-based quantum computing (MBQC). Specially, generating large-scale CV cluster state multiplexed in time domain is easier to implement and has strong scalability in experiment. Here one-dimensional (1D) large-scale dual-rail CV cluster states multiplexed both in time and frequency domains are parallelly generated, which can be further extended to three-dimensional (3D) CV cluster state by combining two time-delay NOPA systems with beamsplitters. It is shown that the number of parallel arrays depends on the corresponding frequency comb lines and the partite number of each array can be very large (million), and scale of the 3D cluster state can be ultra-large. This scheme provides some special-structured CV cluster states, which will be valuable for quantum computing of hybrid domains.

quant-ph↗

Demystifying What Code Summarization Models Learned

Study patterns that models have learned has long been a focus of pattern recognition research. Explaining what patterns are discovered from training data, and how patterns are generalized to unseen data are instrumental to understanding and advancing the pattern recognition methods. Unfortunately, the vast majority of the application domains deal with continuous data (i.e. statistical in nature) out of which extracted patterns can not be formally defined. For example, in image classification, there does not exist a principle definition for a label of cat or dog. Even in natural language, the meaning of a word can vary with the context it is surrounded by. Unlike the aforementioned data format, programs are a unique data structure with a well-defined syntax and semantics, which creates a golden opportunity to formalize what models have learned from source code. This paper presents the first formal definition of patterns discovered by code summarization models (i.e. models that predict the name of a method given its body), and gives a sound algorithm to infer a context-free grammar (CFG) that formally describes the learned patterns. We realize our approach in PATIC which produces CFGs for summarizing the patterns discovered by code summarization models. In particular, we pick two prominent instances, code2vec and code2seq, to evaluate PATIC. PATIC shows that the patterns extracted by each model are heavily restricted to local, and syntactic code structures with little to none semantic implication. Based on these findings, we present two example uses of the formal definition of patterns: a new method for evaluating the robustness and a new technique for improving the accuracy of code summarization models. Our work opens up this exciting, new direction of studying what models have learned from source code.

cs.PL↗

Image of arbitrary polynomials on upper triangular matrix algebras

The goal of the paper is to give a complete description of the images of noncommutative polynomials with zero constant term on upper triangular matrix algebras over an algebraically closed field. This is a variation of the old and famous Lvov-Kaplansky conjecture.

math.RA↗

Nonadiabatic Dynamics Near Metal Surface With Periodic Drivings: A Floquet Surface Hopping Algorithm

We develop a Floquet surface hopping (FSH) approach to deal with nonadiabatic dynamics of molecules near metal surfaces subjected to time-periodic drivings from strong light-matter interactions. The method is based on a Floquet classical master equation (FCME) derived from a Floquet quantum master equation (FQME), followed by a Wigner transformation to treat nuclear motion classically. We then propose different trajectory surface hopping algorithms to solve the FCME. We find that a Floquet averaged surface hopping with electron density (FaSH-density) algorithm works the best as benchmarked with the FQME, capturing both the fast oscillations due to the driving as well as the correct steady state observables. This method will be very useful to study strong light-matter interactions with a manifold of electronic state.

quant-ph↗

Statistical Verification of Traffic Systems with Expected Differential Privacy

Traffic systems are multi-agent cyber-physical systems whose performance is closely related to human welfare. They work in open environments and are subject to uncertainties from various sources, making their performance hard to verify by traditional model-based approaches. Alternatively, statistical model checking (SMC) can verify their performance by sequentially drawing sample data until the correctness of a performance specification can be inferred with desired statistical accuracy. This work aims to verify traffic systems with privacy, motivated by the fact that the data used may include personal information (e.g., daily itinerary) and get leaked unintendedly by observing the execution of the SMC algorithm. To formally capture data privacy in SMC, we introduce the concept of expected differential privacy (EDP), which constrains how much the algorithm execution can change in the expectation sense when data change. Accordingly, we introduce an exponential randomization mechanism for the SMC algorithm to achieve the EDP. Our case study on traffic intersections by Vissim simulation shows the high accuracy of SMC in traffic model verification without significantly sacrificing computing efficiency. The case study also shows EDP successfully bounding the algorithm outputs to guarantee privacy.

cs.CR↗

A Targeted Accuracy Diagnostic for Variational Approximations

Variational Inference (VI) is an attractive alternative to Markov Chain Monte Carlo (MCMC) due to its computational efficiency in the case of large datasets and/or complex models with high-dimensional parameters. However, evaluating the accuracy of variational approximations remains a challenge. Existing methods characterize the quality of the whole variational distribution, which is almost always poor in realistic applications, even if specific posterior functionals such as the component-wise means or variances are accurate. Hence, these diagnostics are of practical value only in limited circumstances. To address this issue, we propose the TArgeted Diagnostic for Distribution Approximation Accuracy (TADDAA), which uses many short parallel MCMC chains to obtain lower bounds on the error of each posterior functional of interest. We also develop a reliability check for TADDAA to determine when the lower bounds should not be trusted. Numerical experiments validate the practical utility and computational efficiency of our approach on a range of synthetic distributions and real-data examples, including sparse logistic regression and Bayesian neural network models.

stat.ML↗

Collaboration-Aware Graph Convolutional Network for Recommender Systems

Graph Neural Networks (GNNs) have been successfully adopted in recommender systems by virtue of the message-passing that implicitly captures collaborative effect. Nevertheless, most of the existing message-passing mechanisms for recommendation are directly inherited from GNNs without scrutinizing whether the captured collaborative effect would benefit the prediction of user preferences. In this paper, we first analyze how message-passing captures the collaborative effect and propose a recommendation-oriented topological metric, Common Interacted Ratio (CIR), which measures the level of interaction between a specific neighbor of a node with the rest of its neighbors. After demonstrating the benefits of leveraging collaborations from neighbors with higher CIR, we propose a recommendation-tailored GNN, Collaboration-Aware Graph Convolutional Network (CAGCN), that goes beyond 1-Weisfeiler-Lehman(1-WL) test in distinguishing non-bipartite-subgraph-isomorphic graphs. Experiments on six benchmark datasets show that the best CAGCN variant outperforms the most representative GNN-based recommendation model, LightGCN, by nearly 10% in Recall@20 and also achieves around 80% speedup. Our code is publicly available at https://github.com/YuWVandy/CAGCN.

cs.IR↗

Introduction of Machine Learning for Astronomy (Hands-on Workshop)

This article is based on the tutorial we gave at the hands-on workshop of the ICRANet-ISFAHAN Astronomy Meeting. We first introduce the basic theory of machine learning and sort out the whole process of training a neural network. We then demonstrate this process with an example of inferring redshifts from SDSS spectra. To emphasize that machine learning for astronomy is easy to get started, we demonstrate that the most basic CNN network can be used to obtain high accuracy, we also show that with simple modifications, the network can be converted for classification problems and also to processing gravitational wave data.

astro-ph.IM↗

A Cosmological Fireball with Sixteen-Percent Gamma-Ray Radiative Efficiency

Gamma-ray bursts (GRBs) are the most powerful explosions in the universe. How efficiently the jet converts its energy to radiation is a long-standing problem and it is poorly constrained. The standard model invokes a relativistic fireball with a bright photosphere emission component. A definitive diagnosis of GRB radiation components and measurement of GRB radiative efficiency require prompt emission and afterglow data with high-resolution and wide-band coverage in time and energy. Here we report a comprehensive temporal and spectral analysis of the TeV-emitting bright GRB 190114C. Its fluence is one of the highest of all GRBs detected so far, which allows us to perform a high-resolution study of the prompt emission spectral properties and their temporal evolution down to a timescale of about 0.1 s. We observe that each of the initial pulses has a thermal component contributing $\sim20\%$ of the total energy, the corresponding temperature and the inferred Lorentz factor of the photosphere evolve following broken power-law shapes. From the observation of the non-thermal spectra and the light curve, the onset of afterglow corresponding to the deceleration of the fireball is considered at $\sim 6$~s. By incorporating the thermal and the non-thermal observations, as well as the photosphere and the synchrotron radiative mechanisms, we can directly derive the fireball energy budget with little dependence on hypothetical parameters and to measure a $\sim 16\%$ radiative efficiency for this GRB. With the fireball energy budget derived, the afterglow microphysics parameters can also be constrained directly from the data.

astro-ph.HE↗

Differentially Private Normalizing Flows for Density Estimation, Data Synthesis, and Variational Inference with Application to Electronic Health Records

Electronic health records (EHR) often contain sensitive medical information about individual patients, posing significant limitations to sharing or releasing EHR data for downstream learning and inferential tasks. We use normalizing flows (NF), a family of deep generative models, to estimate the probability density of a dataset with differential privacy (DP) guarantees, from which privacy-preserving synthetic data are generated. We apply the technique to an EHR dataset containing patients with pulmonary hypertension. We assess the learning and inferential utility of the synthetic data by comparing the accuracy in the prediction of the hypertension status and variational posterior distribution of the parameters of a physics-based model. In addition, we use a simulated dataset from a nonlinear model to compare the results from variational inference (VI) based on privacy-preserving synthetic data, and privacy-preserving VI obtained from directly privatizing NFs for VI with DP guarantees given the original non-private dataset. The results suggest that synthetic data generated through differentially private density estimation with NF can yield good utility at a reasonable privacy cost. We also show that VI obtained from differentially private NF based on the free energy bound loss may produce variational approximations with significantly altered correlation structure, and loss formulations based on alternative dissimilarity metrics between two distributions might provide improved results.

stat.ML↗

Toward Extremely Lightweight Distracted Driver Recognition With Distillation-Based Neural Architecture Search and Knowledge Transfer

The number of traffic accidents has been continuously increasing in recent years worldwide. Many accidents are caused by distracted drivers, who take their attention away from driving. Motivated by the success of Convolutional Neural Networks (CNNs) in computer vision, many researchers developed CNN-based algorithms to recognize distracted driving from a dashcam and warn the driver against unsafe behaviors. However, current models have too many parameters, which is unfeasible for vehicle-mounted computing. This work proposes a novel knowledge-distillation-based framework to solve this problem. The proposed framework first constructs a high-performance teacher network by progressively strengthening the robustness to illumination changes from shallow to deep layers of a CNN. Then, the teacher network is used to guide the architecture searching process of a student network through knowledge distillation. After that, we use the teacher network again to transfer knowledge to the student network by knowledge distillation. Experimental results on the Statefarm Distracted Driver Detection Dataset and AUC Distracted Driver Dataset show that the proposed approach is highly effective for recognizing distracted driving behaviors from photos: (1) the teacher network's accuracy surpasses the previous best accuracy; (2) the student network achieves very high accuracy with only 0.42M parameters (around 55% of the previous most lightweight model). Furthermore, the student network architecture can be extended to a spatial-temporal 3D CNN for recognizing distracted driving from video clips. The 3D student network largely surpasses the previous best accuracy with only 2.03M parameters on the Drive&Act Dataset. The source code is available at https://github.com/Dichao-Liu/Lightweight_Distracted_Driver_Recognition_with_Distillation-Based_NAS_and_Knowledge_Transfer.

cs.CV↗

Learning Graph-Enhanced Commander-Executor for Multi-Agent Navigation

This paper investigates the multi-agent navigation problem, which requires multiple agents to reach the target goals in a limited time. Multi-agent reinforcement learning (MARL) has shown promising results for solving this issue. However, it is inefficient for MARL to directly explore the (nearly) optimal policy in the large search space, which is exacerbated as the agent number increases (e.g., 10+ agents) or the environment is more complex (e.g., 3D simulator). Goal-conditioned hierarchical reinforcement learning (HRL) provides a promising direction to tackle this challenge by introducing a hierarchical structure to decompose the search space, where the low-level policy predicts primitive actions in the guidance of the goals derived from the high-level policy. In this paper, we propose Multi-Agent Graph-Enhanced Commander-Executor (MAGE-X), a graph-based goal-conditioned hierarchical method for multi-agent navigation tasks. MAGE-X comprises a high-level Goal Commander and a low-level Action Executor. The Goal Commander predicts the probability distribution of goals and leverages them to assign each agent the most appropriate final target. The Action Executor utilizes graph neural networks (GNN) to construct a subgraph for each agent that only contains crucial partners to improve cooperation. Additionally, the Goal Encoder in the Action Executor captures the relationship between the agent and the designated goal to encourage the agent to reach the final target. The results show that MAGE-X outperforms the state-of-the-art MARL baselines with a 100% success rate with only 3 million training steps in multi-agent particle environments (MPE) with 50 agents, and at least a 12% higher success rate and 2x higher data efficiency in a more complicated quadrotor 3D navigation task.

cs.RO↗

Learning Zero-Shot Cooperation with Humans, Assuming Humans Are Biased

There is a recent trend of applying multi-agent reinforcement learning (MARL) to train an agent that can cooperate with humans in a zero-shot fashion without using any human data. The typical workflow is to first repeatedly run self-play (SP) to build a policy pool and then train the final adaptive policy against this pool. A crucial limitation of this framework is that every policy in the pool is optimized w.r.t. the environment reward function, which implicitly assumes that the testing partners of the adaptive policy will be precisely optimizing the same reward function as well. However, human objectives are often substantially biased according to their own preferences, which can differ greatly from the environment reward. We propose a more general framework, Hidden-Utility Self-Play (HSP), which explicitly models human biases as hidden reward functions in the self-play objective. By approximating the reward space as linear functions, HSP adopts an effective technique to generate an augmented policy pool with biased policies. We evaluate HSP on the Overcooked benchmark. Empirical results show that our HSP method produces higher rewards than baselines when cooperating with learned human models, manually scripted policies, and real humans. The HSP policy is also rated as the most assistive policy based on human feedback.

cs.AI↗

Dynamic Ensemble of Low-fidelity Experts: Mitigating NAS "Cold-Start"

Predictor-based Neural Architecture Search (NAS) employs an architecture performance predictor to improve the sample efficiency. However, predictor-based NAS suffers from the severe ``cold-start'' problem, since a large amount of architecture-performance data is required to get a working predictor. In this paper, we focus on exploiting information in cheaper-to-obtain performance estimations (i.e., low-fidelity information) to mitigate the large data requirements of predictor training. Despite the intuitiveness of this idea, we observe that using inappropriate low-fidelity information even damages the prediction ability and different search spaces have different preferences for low-fidelity information types. To solve the problem and better fuse beneficial information provided by different types of low-fidelity information, we propose a novel dynamic ensemble predictor framework that comprises two steps. In the first step, we train different sub-predictors on different types of available low-fidelity information to extract beneficial knowledge as low-fidelity experts. In the second step, we learn a gating network to dynamically output a set of weighting coefficients conditioned on each input neural architecture, which will be used to combine the predictions of different low-fidelity experts in a weighted sum. The overall predictor is optimized on a small set of actual architecture-performance data to fuse the knowledge from different low-fidelity experts to make the final prediction. We conduct extensive experiments across five search spaces with different architecture encoders under various experimental settings. Our method can easily be incorporated into existing predictor-based NAS frameworks to discover better architectures.

cs.LG↗

GRB 171205A: Hypernova and Newborn Neutron Star

GRB 171205A is a low-luminosity, long-duration gamma-ray burst (GRB) associated with SN 2017iuk, a broad-line type Ic supernova (SN). It is consistent with being formed in the core-collapse of a widely separated binary, which we have called the binary-driven hypernova (BdHN) of type III. The core-collapse of the CO star forms a newborn NS ($ν$NS) and the SN explosion. Fallback accretion transfers mass and angular momentum to the $ν$NS, here assumed to be born non-rotating. The accretion energy injected into the expanding stellar layers powers the prompt emission. The multiwavelength power-law afterglow is explained by the synchrotron radiation of electrons in the SN ejecta, powered by energy injected by the spinning $ν$NS. We calculate the amount of mass and angular momentum gained by the $ν$NS, as well as the $ν$NS rotational evolution. The $ν$NS spins up to a period of $47$ ms, then releases its rotational energy powering the synchrotron emission of the afterglow. The paucity of the $ν$NS spin explains the low-luminosity characteristic and that the optical emission of the SN from the nickel radioactive decay outshines the optical emission from the synchrotron radiation. From the $ν$NS evolution, we infer that the SN explosion had to occur at most $7.36$ h before the GRB trigger. Therefore, for the first time, the analysis of the GRB data leads to the time of occurrence of the CO core-collapse leading to the SN explosion and the electromagnetic emission of the GRB event.

astro-ph.HE↗