Searcharxiv⌕ Search

arXiv subjects

Hao Wu

Publications and source records attributed to Hao Wu.

At least 577 records · Page 32Linked to original sources

Parameterized Wasserstein Hamiltonian Flow

In this work, we propose a numerical method to compute the Wasserstein Hamiltonian flow (WHF), which is a Hamiltonian system on the probability density manifold. Many well-known PDE systems can be reformulated as WHFs. We use parameterized function as push-forward map to characterize the solution of WHF, and convert the PDE to a finite-dimensional ODE system, which is a Hamiltonian system in the phase space of the parameter manifold. We establish error analysis results for the continuous time approximation scheme in Wasserstein metric. For the numerical implementation, we use neural networks as push-forward maps. We apply an effective symplectic scheme to solve the derived Hamiltonian ODE system so that the method preserves some important quantities such as total energy. The computation is done by fully deterministic symplectic integrator without any neural network training. Thus, our method does not involve direct optimization over network parameters and hence can avoid the error introduced by stochastic gradient descent (SGD) methods, which is usually hard to quantify and measure. The proposed algorithm is a sampling-based approach that scales well to higher dimensional problems. In addition, the method also provides an alternative connection between the Lagrangian and Eulerian perspectives of the original WHF through the parameterized ODE dynamics.

math.NA↗

Uneven illumination surface defects inspection based on convolutional neural network

Surface defect inspection based on machine vision is often affected by uneven illumination. In order to improve the inspection rate of surface defects inspection under uneven illumination condition, this paper proposes a method for detecting surface image defects based on convolutional neural network, which is based on the adjustment of convolutional neural networks, training parameters, changing the structure of the network, to achieve the purpose of accurately identifying various defects. Experimental on defect inspection of copper strip and steel images shows that the convolutional neural network can automatically learn features without preprocessing the image, and correct identification of various types of image defects affected by uneven illumination, thus overcoming the drawbacks of traditional machine vision inspection methods under uneven illumination.

cs.CV↗

Kramers' degenerate magnetism and superconductivity

Motivated by the recent discovery of odd-parity multipolar antiferromagnetic order in CeRh$_2$As$_2$, we examine the coexistence of such translation invariant Kramers' degenerate magnetic states and superconductivity. We show that the presence of such magnetic states generically suppresses superconductivity, whether it be spin-singlet or spin-triplet, unless the magnetic state drives a symmetry-required pair density wave (PDW) superconducting order. We apply our results to CeRh$_2$As$_2$, where no pair density wave order appears; and to the loop current order in the cuprates, where such pair density wave superconductivity must appear together with Bogoliubov Fermi surfaces. In the former case, we explain why superconductivity is not suppressed.

cond-mat.supr-con↗

Large deviation for slow-fast McKean-Vlasov stochastic differential equations driven by fractional Brownian motions and Brownian motions

In this article, we consider slow-fast McKean-Vlasov stochastic differential equations driven by Brownian motions and fractional Brownian motions. We give a definition of the large deviation principle (LDP) on the product space related to Brownian motion and fractional Brownian motion, which is different from the traditional definition for LDP. Under some proper assumptions on coefficients, LDP is investigated for this type of equations by using the weak convergence method.

math.PR↗

Pupil-driven quantitative differential phase contrast imaging

In this research, we reveal the inborn but hitherto ignored properties of quantitative differential phase contrast (qDPC) imaging: the phase transfer function being an edge detection filter. Inspired by this, we highlighted the duality of qDPC between optics and pattern recognition, and propose a simple and effective qDPC reconstruction algorithm, termed Pupil-Driven qDPC (pd-qDPC), to facilitate the phase reconstruction quality for the family of qDPC-based phase reconstruction algorithms. We formed a new cost function in which modified L0-norm was used to represent the pupil-driven edge sparsity, and the qDPC convolution operator is duplicated in the data fidelity term to achieve automatic background removal. Further, we developed the iterative reweighted soft-threshold algorithms based on split Bregman method to solve this modified L0-norm problem. We tested pd-qDPC on both simulated and experimental data and compare against state-of-the-art (SOTA) methods including L2-norm, total variation regularization (TV-qDPC), isotropic-qDPC, and Retinex qDPC algorithms. Results show that our proposed model is superior in terms of phase reconstruction quality and implementation efficiency, in which it significantly increases the experimental robustness while maintaining the data fidelity. In general, the pd-qDPC enables the high-quality qDPC reconstruction without any modification of the optical system. It simplifies the system complexity and benefits the qDPC community and beyond including but not limited to cell segmentation and PTF learning based on the edge filtering property.

math.OC↗

Cardiac CT perfusion imaging of pericoronary adipose tissue (PCAT) highlights potential confounds in coronary CTA

Features of pericoronary adipose tissue (PCAT) assessed from coronary computed tomography angiography (CCTA) are associated with inflammation and cardiovascular risk. As PCAT is vascularly connected with coronary vasculature, the presence of iodine is a potential confounding factor on PCAT HU and textures that has not been adequately investigated. Use dynamic cardiac CT perfusion (CCTP) to inform contrast determinants of PCAT assessment. From CCTP, we analyzed HU dynamics of territory-specific PCAT, myocardium, and other adipose depots in patients with coronary artery disease. HU, blood flow, and radiomics were assessed over time. Changes from peak aorta time, Pa, chosen to model the time of CCTA, were obtained. HU in PCAT increased more than in other adipose depots. The estimated blood flow in PCAT was ~23% of that in the contiguous myocardium. Comparing PCAT distal and proximal to a significant stenosis, we found less enhancement and longer time-to-peak distally. Two-second offsets [before, after] Pa resulted in [ 4-HU, 3-HU] differences in PCAT. Due to changes in HU, the apparent PCAT volume reduced ~15% from the first scan (P1) to Pa using a conventional fat window. Comparing radiomic features over time, 78% of features changed >10% relative to P1. CCTP elucidates blood flow in PCAT and enables analysis of PCAT features over time. PCAT assessments (HU, apparent volume, and radiomics) are sensitive to acquisition timing and the presence of obstructive stenosis, which may confound the interpretation of PCAT in CCTA images. Data normalization may be in order.

cs.CV↗

Comparison on the criticality parameters for two supercritical branching processes in random environments

Let $\{Z_{1,n} , n\geq 0\}$ and $\{Z_{2,n}, n\geq 0\}$ be two supercritical branching processes in different random environments, with criticality parameters $μ_1$ and $μ_2$ respectively. It is known that $\frac{1}{n} \ln Z_{1,n} \rightarrow μ_1$ and $\frac{1}{m} \ln Z_{2,m} \rightarrow μ_2$ in probability as $m, n \rightarrow \infty.$ In this paper, we are interested in the comparison on the two criticality parameters. To this end, we prove a non-uniform Berry-Esseen's bound and Cramér's moderate deviations for $\frac{1}{n} \ln Z_{1,n} - \frac{1}{m} \ln Z_{2,m}$ as $m, n \rightarrow \infty.$ An application is also given for constructing confidence interval for $μ_1-μ_2$.

math.PR↗

A Closer Look at Few-shot Classification Again

Few-shot classification consists of a training phase where a model is learned on a relatively large dataset and an adaptation phase where the learned model is adapted to previously-unseen tasks with limited labeled samples. In this paper, we empirically prove that the training algorithm and the adaptation algorithm can be completely disentangled, which allows algorithm analysis and design to be done individually for each phase. Our meta-analysis for each phase reveals several interesting insights that may help better understand key aspects of few-shot classification and connections with other fields such as visual representation learning and transfer learning. We hope the insights and research challenges revealed in this paper can inspire future work in related directions. Code and pre-trained models (in PyTorch) are available at https://github.com/Frankluox/CloserLookAgainFewShot.

cs.LG↗

Multi-qubit State Tomography with Few Pauli Measurements

In quantum information transformation and quantum computation, the most critical issues are security and accuracy. These features, therefore, stimulate research on quantum state characterization. A characterization tool, Quantum state tomography, reconstructs the density matrix of an unknown quantum state. Theoretically, reconstructing an unknown state using this method can be arbitrarily accurate. However, this is less practical owing to the huge burden of measurements and data processing for large numbers of qubits. Even comprising an efficient estimator and a precise algorithm, an optimal tomographic framework can also be overburdened owing to the exponential growth of the measurements. Moreover, the consequential postprocessing of huge amounts of data challenges the capacity of computers. Thus, it is crucial to build an efficient framework that requires fewer measurements but yields an expected accuracy. To this end, we built a tomography schema by which only a few Pauli measurements enable an accurate tomographic reconstruction. Subsequently, this schema was verified as efficient and accurate through numerical simulations on the tomography of multi-qubit quantum states. Furthermore, this schema was proven to be robust through numerical simulations on a noisy superconducting qubit system. Therefore, the tomography schema paves an alternatively effective way to reconstruct the density matrix of a quantum state owing to its efficiency and accuracy, which are essential for quantum state tomography.

quant-ph↗

Tight Data Access Bounds for Private Top-$k$ Selection

We study the top-$k$ selection problem under the differential privacy model: $m$ items are rated according to votes of a set of clients. We consider a setting in which algorithms can retrieve data via a sequence of accesses, each either a random access or a sorted access; the goal is to minimize the total number of data accesses. Our algorithm requires only $O(\sqrt{mk})$ expected accesses: to our knowledge, this is the first sublinear data-access upper bound for this problem. Our analysis also shows that the well-known exponential mechanism requires only $O(\sqrt{m})$ expected accesses. Accompanying this, we develop the first lower bounds for the problem, in three settings: only random accesses; only sorted accesses; a sequence of accesses of either kind. We show that, to avoid $Ω(m)$ access cost, supporting *both* kinds of access is necessary, and that in this case our algorithm's access cost is optimal.

cs.CR↗

IB-UQ: Information bottleneck based uncertainty quantification for neural function regression and neural operator learning

We propose a novel framework for uncertainty quantification via information bottleneck (IB-UQ) for scientific machine learning tasks, including deep neural network (DNN) regression and neural operator learning (DeepONet). Specifically, we incorporate the bottleneck by a confidence-aware encoder, which encodes inputs into latent representations according to the confidence of the input data belonging to the region where training data is located, and utilize a Gaussian decoder to predict means and variances of outputs conditional on representation variables. Furthermore, we propose a data augmentation based information bottleneck objective which can enhance the quantification quality of the extrapolation uncertainty, and the encoder and decoder can be both trained by minimizing a tractable variational bound of the objective. In comparison to uncertainty quantification (UQ) methods for scientific learning tasks that rely on Bayesian neural networks with Hamiltonian Monte Carlo posterior estimators, the model we propose is computationally efficient, particularly when dealing with large-scale data sets. The effectiveness of the IB-UQ model has been demonstrated through several representative examples, such as regression for discontinuous functions, real-world data set regression, learning nonlinear operators for partial differential equations, and a large-scale climate model. The experimental results indicate that the IB-UQ model can handle noisy data, generate robust predictions, and provide confident uncertainty evaluation for out-of-distribution data.

math.NA↗

Towards Language-guided Interactive 3D Generation: LLMs as Layout Interpreter with Generative Feedback

Generating and editing a 3D scene guided by natural language poses a challenge, primarily due to the complexity of specifying the positional relations and volumetric changes within the 3D space. Recent advancements in Large Language Models (LLMs) have demonstrated impressive reasoning, conversational, and zero-shot generation abilities across various domains. Surprisingly, these models also show great potential in realizing and interpreting the 3D space. In light of this, we propose a novel language-guided interactive 3D generation system, dubbed LI3D, that integrates LLMs as a 3D layout interpreter into the off-the-shelf layout-to-3D generative models, allowing users to flexibly and interactively generate visual content. Specifically, we design a versatile layout structure base on the bounding boxes and semantics to prompt the LLMs to model the spatial generation and reasoning from language. Our system also incorporates LLaVA, a large language and vision assistant, to provide generative feedback from the visual aspect for improving the visual quality of generated content. We validate the effectiveness of LI3D, primarily in 3D generation and editing through multi-round interactions, which can be flexibly extended to 2D generation and editing. Various experiments demonstrate the potential benefits of incorporating LLMs in generative AI for applications, e.g., metaverse. Moreover, we benchmark the layout reasoning performance of LLMs with neural visual artist tasks, revealing their emergent ability in the spatial layout domain.

cs.CV↗

Single-shot spatial instability and electric control of polariton condensates at room temperature

In planar microcavities, the transverse-electric and transverse-magnetic (TE-TM) mode splitting of cavity photons arises due to their different penetration into the Bragg mirrors and can result in optical spin-orbit coupling (SOC). In this work, we find that in a liquid crystal (LC) microcavity filled with perovskite microplates, the pronounced TE-TM splitting gives rise to a strong SOC that leads to the spatial instability of microcavity polariton condensates under single-shot excitation. Spatially varying hole burning and mode competition occurs between polarization components leading to different condensate profiles from shot to shot. The single-shot polariton condensates become stable when the SOC vanishes as the TE and TM modes are spectrally well separated from each other, which can be achieved by application of an electric field to our LC microcavity with electrically tunable anisotropy. Our findings are well reproduced and traced back to their physical origin by our detailed numerical simulations. With the electrical manipulation our work reveals how the shot-to-shot spatial instability of spatial polariton profiles can be engineered in anisotropic microcavities at room temperature, which will benefit the development of stable polariton-based optoeletronic and light-emitting devices.

physics.optics↗

Room-temperature van der Waals 2D ferromagnet switching by spin-orbit torques

Emerging wide varieties of the two-dimensional (2D) van der Waals (vdW) magnets with atomically thin and smooth interfaces holds great promise for next-generation spintronic devices. However, due to the lower Curie temperature of the vdW 2D ferromagnets than room temperature, electrically manipulating its magnetization at room temperature has not been realized. In this work, we demonstrate the perpendicular magnetization of 2D vdW ferromagnet Fe3GaTe2 can be effectively switched at room temperature in Fe3GaTe2/Pt bilayer by spin-orbit torques (SOTs) with a relatively low current density of 1.3 10^7A/cm2. Moreover, the high SOT efficiency of ξ_{DL}~0.22 is quantitatively determined by harmonic measurements, which is higher than those in Pt-based heavy metal/conventional ferromagnet devices. Our findings of room-temperature vdW 2D ferromagnet switching by SOTs provide a significant basis for the development of vdW-ferromagnet-based spintronic applications.

physics.app-ph↗

Room-temperature and tunable tunneling magnetoresistance in Fe3GaTe2-based all-2D van der Waals heterojunctions with high spin polarization

Magnetic tunnel junctions (MTJs) based on all-two dimensional (2D) van der Waals heterostructures with sharp and clean interfaces in atomic scale are essential for the application of next-generation spintronics. However, the lack of room-temperature intrinsic ferromagnetic crystals with perpendicular magnetic anisotropy has greatly hindered the development of vertical MTJs. The discovery of room-temperature intrinsic ferromagnetic 2D crystal Fe3GaTe2 has solved the problem and greatly facilitated the realization of practical spintronic devices. Here, we demonstrate a room-temperature MTJ based on Fe3GaTe2/WS2/Fe3GaTe2 heterostructure. The tunnelling magnetoresistance (TMR) ratio is up to 213% with high spin polarization of 72% at 10 K, the highest ever reported in Fe3GaTe2-based MTJs up to now. The tunnelling spin-valve signal robustly exists at room temperature (300 K) with bias current down to 10 nA. Moreover, the spin polarization can be modulated by bias current and the TMR shows a sign reversal at large bias current. Our work sheds light on the potential application for low-energy consumption all-2D vdW spintronics and offers alternative routes for the electronic control of spintronic devices.

cond-mat.mes-hall↗

Sn/InAs Josephson junctions on selective area grown nanowires with in-situ shadowed superconductor evaporation

Superconductor-semiconductor nanowire hybrid structures are useful in fabricating devices for quantum information processing. While selective area growth (SAG) offers the flexibility to grow semiconductor nanowires in arbitrary geometries, in-situ evaporation of superconductors ensures pristine superconductor-semiconductor interfaces, resulting in strong induced superconductivity in the semiconducting nanowire. In this work, we evaporated islands of superconductor tin on InAs SAG nanowires, by using in-situ shadowing with high aspect-ratio pre-fabricated SiOx dielectric walls. Our technique allows complete customization of each physical parameter of such hybrid nanostructures, while performing the nanowire and superconductor growths without breaking vacuum. Using this technique, we grew super(S)-normal(N)-super(S) (SNS), NS and SNSNS junctions. We performed cryogenic electron transport measurements revealing the presence of gate and field tunable supercurrents in shadow junctions fabricated on in-plane SAG nanowires. We further measured the superconducting gap and critical fields in the hybrid nanostructures and the crossover from 2e to 1e periodicity in the SNSNS junctions, as a proof of the usability of these hybrid nanostructures.

cond-mat.mes-hall↗

Immune Defense: A Novel Adversarial Defense Mechanism for Preventing the Generation of Adversarial Examples

The vulnerability of Deep Neural Networks (DNNs) to adversarial examples has been confirmed. Existing adversarial defenses primarily aim at preventing adversarial examples from attacking DNNs successfully, rather than preventing their generation. If the generation of adversarial examples is unregulated, images within reach are no longer secure and pose a threat to non-robust DNNs. Although gradient obfuscation attempts to address this issue, it has been shown to be circumventable. Therefore, we propose a novel adversarial defense mechanism, which is referred to as immune defense and is the example-based pre-defense. This mechanism applies carefully designed quasi-imperceptible perturbations to the raw images to prevent the generation of adversarial examples for the raw images, and thereby protecting both images and DNNs. These perturbed images are referred to as Immune Examples (IEs). In the white-box immune defense, we provide a gradient-based and an optimization-based approach, respectively. Additionally, the more complex black-box immune defense is taken into consideration. We propose Masked Gradient Sign Descent (MGSD) to reduce approximation error and stabilize the update to improve the transferability of IEs and thereby ensure their effectiveness against black-box adversarial attacks. The experimental results demonstrate that the optimization-based approach has superior performance and better visual quality in white-box immune defense. In contrast, the gradient-based approach has stronger transferability and the proposed MGSD significantly improve the transferability of baselines.

cs.CV↗

Joint Optimization of Relay Selection and Transmission Scheduling for UAV-Aided mmWave Vehicular Networks

To deal with the explosive growth of mobile traffic, millimeter-wave (mmWave) communications with abundant bandwidth resources have been applied to vehicular networks. As mmWave signal is sensitive to blockage, we introduce the unmanned aerial vehicle (UAV)-aided two-way relaying system for vehicular connection enhancement and coverage expansion. How to improve transmission efficiency and to reduce latency time in such a dynamic scenario is a challenging problem. In this paper, we formulate the joint optimization problem of relay selection and transmission scheduling, aiming to reduce transmission time while meeting the throughput requirements. To solve this problem, two schemes are proposed. The first one is the random relay selection with concurrent scheduling (RCS), a low-complexity algorithm implemented in two steps. The second one is the joint relay selection with dynamic scheduling (JRDS), which fully avoids relay contentions and exploits potential concurrent ability, to obtain further performance enhancement over RCS. Through extensive simulations under different environments with various flow numbers and vehicle speeds, we demonstrate that both RCS and JRDS schemes outperform the existing schemes significantly in terms of transmission time and network throughput. We also analyze the impact of threshold selection on achievable performance.

cs.IT↗