Searcharxiv⌕ Search

arXiv subjects

Yuan Gao

Publications and source records attributed to Yuan Gao.

At least 343 records · Page 19Linked to original sources
arXiv2023

Globular Clusters Contribute to the Nuclear Star Cluster and Galaxy Center Gamma-Ray Excess, Moderated by Galaxy Assembly History

Two unresolved questions at galaxy centers, namely the formation of the nuclear star cluster (NSC) and the origin of the gamma-ray excess in the Milky Way (MW) and Andromeda (M31), are both related to the formation and evolution of globular clusters (GCs). They migrate towards the galaxy center due to dynamical friction, and get tidally disrupted to release the stellar mass content including millisecond pulsars (MSPs), which contribute to the NSC and gamma-ray excess. In this study, we propose a semi-analytical model of GC formation and evolution that utilizes the Illustris cosmological simulation to accurately capture the formation epochs of GCs and simulate their subsequent evolution. Our analysis confirms that our GC properties at z=0 are consistent with observations, and our model naturally explains the formation of a massive NSC in a galaxy similar to the MW and M31. We also find a remarkable similarity in our model prediction with the gamma-ray excess signal in the MW. However, our predictions fall short by approximately an order of magnitude in M31, indicating distinct origins for the two gamma-ray excesses. Meanwhile, we utilize the catalog of Illustris halos to investigate the influence of galaxy assembly history. We find that the earlier a galaxy is assembled, the heavier and spatially more concentrated its GC system behaves at z=0. This results in a larger NSC mass and brighter gamma-ray emission from deposited MSPs

astro-ph.GA↗
arXiv2023

Inferring Hybrid Neural Fluid Fields from Videos

We study recovering fluid density and velocity from sparse multiview videos. Existing neural dynamic reconstruction methods predominantly rely on optical flows; therefore, they cannot accurately estimate the density and uncover the underlying velocity due to the inherent visual ambiguities of fluid velocity, as fluids are often shapeless and lack stable visual features. The challenge is further pronounced by the turbulent nature of fluid flows, which calls for properly designed fluid velocity representations. To address these challenges, we propose hybrid neural fluid fields (HyFluid), a neural approach to jointly infer fluid density and velocity fields. Specifically, to deal with visual ambiguities of fluid velocity, we introduce a set of physics-based losses that enforce inferring a physically plausible velocity field, which is divergence-free and drives the transport of density. To deal with the turbulent nature of fluid velocity, we design a hybrid neural velocity representation that includes a base neural velocity field that captures most irrotational energy and a vortex particle-based velocity that models residual turbulent velocity. We show that our method enables recovering vortical flow details. Our approach opens up possibilities for various learning and reconstruction applications centered around 3D incompressible flow, including fluid re-simulation and editing, future prediction, and neural dynamic scene composition. Project website: https://kovenyu.com/HyFluid/

cs.CV↗
arXiv2023

Finite-Temperature Simulations of Quantum Lattice Models with Stochastic Matrix Product States

In this work, we develop a stochastic matrix product state (stoMPS) approach that combines the MPS technique and Monte Carlo samplings and can be applied to simulate quantum lattice models down to low temperature. In particular, we exploit a procedure to unbiasedly sample the local tensors in the matrix product states, which has one physical index of dimension $d$ and two geometric indices of dimension $D$, and find the results can be continuously improved by enlarging $D$. We benchmark the methods on small system sizes and then compare the results to those obtained with minimally entangled typical thermal states, finding that stoMPS has overall better performance with finite $D$. We further exploit the MPS sampling to simulate long spin chains, as well as the triangular and square lattices with cylinder circumference $W$ up to 4. Our results showcase the accuracy and effectiveness of stochastic tensor networks in finite-temperature simulations.

cond-mat.str-el↗
arXiv2023

Versatile manipulation of light- and dark- seeking particles on demand

We propose a novel approach to enable the agile manipulation of light- and dark-seeking particles. Our approach involves introducing a two-curvilinear perfect optical vortex beam (TC-POVB) generated by superimposing a pair of curved beams. The TC-POVB exhibits the property of a perfect optical vortex, which means that its size remains constant regardless of its topological charge. Additionally, each curve of the TC-POVB can support a distinct orbital flow density (OFD). This enables the application of torques to produce a dark channel that satisfies the requirements for particle size and drives the revolution or rotation motion of the confined dark-seeking particles. To demonstrate the effectiveness of our approach, we manipulate light- and dark-seeking particles experimentally, making them perform various curvilinear trajectories simultaneously, including moving, revolving, and rotating.

physics.optics↗
arXiv2023

Dynamic Dense Graph Convolutional Network for Skeleton-based Human Motion Prediction

Graph Convolutional Networks (GCN) which typically follows a neural message passing framework to model dependencies among skeletal joints has achieved high success in skeleton-based human motion prediction task. Nevertheless, how to construct a graph from a skeleton sequence and how to perform message passing on the graph are still open problems, which severely affect the performance of GCN. To solve both problems, this paper presents a Dynamic Dense Graph Convolutional Network (DD-GCN), which constructs a dense graph and implements an integrated dynamic message passing. More specifically, we construct a dense graph with 4D adjacency modeling as a comprehensive representation of motion sequence at different levels of abstraction. Based on the dense graph, we propose a dynamic message passing framework that learns dynamically from data to generate distinctive messages reflecting sample-specific relevance among nodes in the graph. Extensive experiments on benchmark Human 3.6M and CMU Mocap datasets verify the effectiveness of our DD-GCN which obviously outperforms state-of-the-art GCN-based methods, especially when using long-term and our proposed extremely long-term protocol.

cs.CV↗
arXiv2023

Distributed Estimation and Inference for Spatial Autoregression Model with Large Scale Networks

The rapid growth of online network platforms generates large-scale network data and it poses great challenges for statistical analysis using the spatial autoregression (SAR) model. In this work, we develop a novel distributed estimation and statistical inference framework for the SAR model on a distributed system. We first propose a distributed network least squares approximation (DNLSA) method. This enables us to obtain a one-step estimator by taking a weighted average of local estimators on each worker. Afterwards, a refined two-step estimation is designed to further reduce the estimation bias. For statistical inference, we utilize a random projection method to reduce the expensive communication cost. Theoretically, we show the consistency and asymptotic normality of both the one-step and two-step estimators. In addition, we provide theoretical guarantee of the distributed statistical inference procedure. The theoretical findings and computational advantages are validated by several numerical simulations implemented on the Spark system. Lastly, an experiment on the Yelp dataset further illustrates the usefulness of the proposed methodology.

stat.CO↗
arXiv2023

FedCPC: An Effective Federated Contrastive Learning Method for Privacy Preserving Early-Stage Alzheimer's Speech Detection

The early-stage Alzheimer's disease (AD) detection has been considered an important field of medical studies. Like traditional machine learning methods, speech-based automatic detection also suffers from data privacy risks because the data of specific patients are exclusive to each medical institution. A common practice is to use federated learning to protect the patients' data privacy. However, its distributed learning process also causes performance reduction. To alleviate this problem while protecting user privacy, we propose a federated contrastive pre-training (FedCPC) performed before federated training for AD speech detection, which can learn a better representation from raw data and enables different clients to share data in the pre-training and training stages. Experimental results demonstrate that the proposed methods can achieve satisfactory performance while preserving data privacy.

eess.AS↗
arXiv2023

H2 suboptimal containment control of homogeneous and heterogeneous multi-agent systems

This paper deals with the H2 suboptimal state containment control problem for homogeneous linear multi-agent systems and the H2 suboptimal output containment control problem for heterogeneous linear multi-agent systems. For both problems, given multiple autonomous leaders and a number of followers, we introduce suitable performance outputs and an associated H2 cost functional, respectively. The aim is to design a distributed protocol by dynamic output feedback that achieves state/output containment control while the associated H2 cost is smaller than an a priori given upper bound. To this end, we first show that the H2 suboptimal state/output containment control problem can be equivalently transformed into H2 suboptimal control problems for a set of independent systems. Based on this, design methods are then provided to compute such distributed dynamic output feedback protocols. Simulation examples are provided to illustrate the performance of our proposed protocols.

eess.SY↗
arXiv2023

Non-degeneracy of double-tower solutions for nonlinear Schrödinger equation and applications

This paper is concerned with the following nonlinear Schrödinger equation \begin{equation} \label{eq} - Δu + V(|y|)u=u^{p},\quad u>0 \ \ \mbox{in} \ \mathbb {R}^N, \ \ \ u \in H^1(\mathbb {R}^N), \end{equation} where $V(|y|)$ is a positive function, $1<p <\frac{N+2}{N-2}$. Based on the local Pohozaev identities and blow-up analysis, we first prove a non-degeneracy result for double-tower solutions constructed in [18] in a suitable symmetric space. As an application, we obtain the existence of new type solutions for (0.1).

math.AP↗
arXiv2023

Mixture Conditional Regression with Ultrahigh Dimensional Text Data for Estimating Extralegal Factor Effects

Testing judicial impartiality is a problem of fundamental importance in empirical legal studies, for which standard regression methods have been popularly used to estimate the extralegal factor effects. However, those methods cannot handle control variables with ultrahigh dimensionality, such as found in judgment documents recorded in text format. To solve this problem, we develop a novel mixture conditional regression (MCR) approach, assuming that the whole sample can be classified into a number of latent classes. Within each latent class, a standard linear regression model can be used to model the relationship between the response and a key feature vector, which is assumed to be of a fixed dimension. Meanwhile, ultrahigh dimensional control variables are then used to determine the latent class membership, where a Naïve Bayes type model is used to describe the relationship. Hence, the dimension of control variables is allowed to be arbitrarily high. A novel expectation-maximization algorithm is developed for model estimation. Therefore, we are able to estimate the interested key parameters as efficiently as if the true class membership were known in advance. Simulation studies are presented to demonstrate the proposed MCR method. A real dataset of Chinese burglary offenses is analyzed for illustration purpose.

stat.ME↗
arXiv2023

Composable Text Controls in Latent Space with ODEs

Real-world text applications often involve composing a wide range of text control operations, such as editing the text w.r.t. an attribute, manipulating keywords and structure, and generating new text of desired properties. Prior work typically learns/finetunes a language model (LM) to perform individual or specific subsets of operations. Recent research has studied combining operations in a plug-and-play manner, often with costly search or optimization in the complex sequence space. This paper proposes a new efficient approach for composable text operations in the compact latent space of text. The low-dimensionality and differentiability of the text latent vector allow us to develop an efficient sampler based on ordinary differential equations (ODEs) given arbitrary plug-in operators (e.g., attribute classifiers). By connecting pretrained LMs (e.g., GPT2) to the latent space through efficient adaption, we then decode the sampled vectors into desired text sequences. The flexible approach permits diverse control operators (sentiment, tense, formality, keywords, etc.) acquired using any relevant data from different domains. Experiments show that composing those operators within our approach manages to generate or edit high-quality text, substantially improving over previous methods in terms of generation quality and efficiency.

cs.CL↗
arXiv2023

EControl: Fast Distributed Optimization with Compression and Error Control

Modern distributed training relies heavily on communication compression to reduce the communication overhead. In this work, we study algorithms employing a popular class of contractive compressors in order to reduce communication overhead. However, the naive implementation often leads to unstable convergence or even exponential divergence due to the compression bias. Error Compensation (EC) is an extremely popular mechanism to mitigate the aforementioned issues during the training of models enhanced by contractive compression operators. Compared to the effectiveness of EC in the data homogeneous regime, the understanding of the practicality and theoretical foundations of EC in the data heterogeneous regime is limited. Existing convergence analyses typically rely on strong assumptions such as bounded gradients, bounded data heterogeneity, or large batch accesses, which are often infeasible in modern machine learning applications. We resolve the majority of current issues by proposing EControl, a novel mechanism that can regulate error compensation by controlling the strength of the feedback signal. We prove fast convergence for EControl in standard strongly convex, general convex, and nonconvex settings without any additional assumptions on the problem or data heterogeneity. We conduct extensive numerical evaluations to illustrate the efficacy of our method and support our theoretical findings.

math.OC↗
arXiv2023

E3 TTS: Easy End-to-End Diffusion-based Text to Speech

We propose Easy End-to-End Diffusion-based Text to Speech, a simple and efficient end-to-end text-to-speech model based on diffusion. E3 TTS directly takes plain text as input and generates an audio waveform through an iterative refinement process. Unlike many prior work, E3 TTS does not rely on any intermediate representations like spectrogram features or alignment information. Instead, E3 TTS models the temporal structure of the waveform through the diffusion process. Without relying on additional conditioning information, E3 TTS could support flexible latent structure within the given audio. This enables E3 TTS to be easily adapted for zero-shot tasks such as editing without any additional training. Experiments show that E3 TTS can generate high-fidelity audio, approaching the performance of a state-of-the-art neural TTS system. Audio samples are available at https://e3tts.github.io.

cs.SD↗
arXiv2023

Liver Tumor Screening and Diagnosis in CT with Pixel-Lesion-Patient Network

Liver tumor segmentation and classification are important tasks in computer aided diagnosis. We aim to address three problems: liver tumor screening and preliminary diagnosis in non-contrast computed tomography (CT), and differential diagnosis in dynamic contrast-enhanced CT. A novel framework named Pixel-Lesion-pAtient Network (PLAN) is proposed. It uses a mask transformer to jointly segment and classify each lesion with improved anchor queries and a foreground-enhanced sampling loss. It also has an image-wise classifier to effectively aggregate global information and predict patient-level diagnosis. A large-scale multi-phase dataset is collected containing 939 tumor patients and 810 normal subjects. 4010 tumor instances of eight types are extensively annotated. On the non-contrast tumor screening task, PLAN achieves 95% and 96% in patient-level sensitivity and specificity. On contrast-enhanced CT, our lesion-level detection precision, recall, and classification accuracy are 92%, 89%, and 86%, outperforming widely used CNN and transformers for lesion segmentation. We also conduct a reader study on a holdout set of 250 cases. PLAN is on par with a senior human radiologist, showing the clinical significance of our results.

eess.IV↗
arXiv2023

Structure preserving schemes for Fokker-Planck equations of irreversible processes

In this paper, we introduce second order and fourth order space discretization via finite difference implementation of the finite element method for solving Fokker-Planck equations associated with irreversible processes. The proposed schemes are first order in time and second order and fourth order in space. Under mild mesh conditions and time step constraints for smooth solutions, the schemes are proved to be monotone, thus are positivity-preserving and energy dissipative. In particular, our scheme is suitable for capturing steady state solutions in large final time simulations.

math.NA↗
arXiv2023

A selection principle for weak KAM solutions via Freidlin-Wentzell large deviation principle of invariant measures

This paper reinterprets Freidlin-Wentzell's variational construction of the rate function in the large deviation principle for invariant measures from the weak KAM perspective. Through a one-dimensional irreversible diffusion process on a torus, we explicitly characterize essential concepts in the weak KAM theory, such as the Peierls barrier and the projected Mather/Aubry/Mañé sets. The weak KAM representation of Freidlin-Wentzell's variational construction of the rate function is discussed based on the global adjustment for the boundary data on the Aubry set and the local trimming from the lifted Peierls barriers. This rate function gives the maximal Lipschitz continuous viscosity solution to the corresponding stationary Hamilton-Jacobi equation (HJE), satisfying Freidlin-Wentzell's variational formula for the boundary data. Choosing meaningful self-consistent boundary data at each local attractor are essential to select a unique weak KAM solution to stationary HJE. This selected viscosity solution also serves as the global energy landscape of the original stochastic process. This selection for stationary HJEs can be described by first taking the long time limit and then taking the zero noise limit, which also provides a special construction of vanishing viscosity approximation.

math.AP↗
arXiv2023

Master equations for finite state mean field games with nonlinear activations

We formulate a class of mean field games on a finite state space with variational principles resembling those in continuous-state mean field games. We construct a controlled continuity equation featuring a nonlinear activation function on graphs induced by finite-state reversible continuous time Markov chains. In these graphs, each edge is weighted by the transition probability and invariant measure of the original process. Using these controlled dynamics on the graph and the dynamic programming principle for the value function, we derive several key components: the mean field game systems, the functional Hamilton-Jacobi equations, and the master equations on a finite probability space for potential mean field games. The existence and uniqueness of solutions to the potential mean field game system are ensured through a convex optimization reformulation in terms of the density-flux pair. We also derive variational principles for the master equations of both non-potential games and mixed games on a continuous state space. Finally, we offer several concrete examples of discrete mean field game dynamics on a two-point space, complete with closed-formula solutions. These examples include discrete Wasserstein distances, mean field planning, and potential mean field games.

math.OC↗
arXiv2023

Double Domain Guided Real-Time Low-Light Image Enhancement for Ultra-High-Definition Transportation Surveillance

Real-time transportation surveillance is an essential part of the intelligent transportation system (ITS). However, images captured under low-light conditions often suffer the poor visibility with types of degradation, such as noise interference and vague edge features, etc. With the development of imaging devices, the quality of the visual surveillance data is continually increasing, like 2K and 4K, which has more strict requirements on the efficiency of image processing. To satisfy the requirements on both enhancement quality and computational speed, this paper proposes a double domain guided real-time low-light image enhancement network (DDNet) for ultra-high-definition (UHD) transportation surveillance. Specifically, we design an encoder-decoder structure as the main architecture of the learning network. In particular, the enhancement processing is divided into two subtasks (i.e., color enhancement and gradient enhancement) via the proposed coarse enhancement module (CEM) and LoG-based gradient enhancement module (GEM), which are embedded in the encoder-decoder structure. It enables the network to enhance the color and edge features simultaneously. Through the decomposition and reconstruction on both color and gradient domains, our DDNet can restore the detailed feature information concealed by the darkness with better visual quality and efficiency. The evaluation experiments on standard and transportation-related datasets demonstrate that our DDNet provides superior enhancement quality and efficiency compared with the state-of-the-art methods. Besides, the object detection and scene segmentation experiments indicate the practical benefits for higher-level image analysis under low-light environments in ITS.

cs.CV↗