Searcharxiv⌕ Search

arXiv subjects

Hao Wu

Publications and source records attributed to Hao Wu.

At least 667 records · Page 37Linked to original sources

Monte Carlo PINNs: deep learning approach for forward and inverse problems involving high dimensional fractional partial differential equations

We introduce a sampling based machine learning approach, Monte Carlo physics informed neural networks (MC-PINNs), for solving forward and inverse fractional partial differential equations (FPDEs). As a generalization of physics informed neural networks (PINNs), our method relies on deep neural network surrogates in addition to a stochastic approximation strategy for computing the fractional derivatives of the DNN outputs. A key ingredient in our MC-PINNs is to construct an unbiased estimation of the physical soft constraints in the loss function. Our directly sampling approach can yield less overall computational cost compared to fPINNs proposed in \cite{pang2019fpinns} and thus provide an opportunity for solving high dimensional fractional PDEs. We validate the performance of MC-PINNs method via several examples that include high dimensional integral fractional Laplacian equations, parametric identification of time-space fractional PDEs, and fractional diffusion equation with random inputs. The results show that MC-PINNs is flexible and promising to tackle high-dimensional FPDEs.

cs.LG↗

Quantum simulation of a general anti-PT-symmetric Hamiltonian with a trapped ion qubit

Non-Hermitian systems satisfying parity-time (PT) symmetry have aroused considerable interest owing to their exotic features. Anti-PT symmetry is an important counterpart of the PT symmetry, and has been studied in various classical systems. Although a Hamiltonian with anti-PT symmetry only differs from its PT-symmetric counterpart in a global $\pm$ i phase, the ways they change information and energy with the enivronment are completely different, suggesting an essential different dynamics in anti-PT-symmetric systems from their PT -symmetric variants. Moreover, theortical works have shown that qubits with anti-PT-symmetric Hamiltonians (anti-PT-symmetric qubits) have superior decoherence properties over Hermitian qubits, as well as PT-symmetric ones. So far, the observation of anti-PT symmetry in individual quantum systems remains elusive. Here, we implement an anti-PT -symmetric Hamiltonian of a single qubit in a single trapped ion by a designed microwave and optical control-pulse sequence. We characterize the anti-PT phase transition by mapping out the eigenvalues at different dissipation rates. The full inforamtion of the quantum state is also obtained by quantum state tomography. Our work allows quantum simulation of genuine open-system feature of an anti-PT-symmetric system, which paves the way for utilizing non-Hermitian properties for quantum information processing.

quant-ph↗

Beyond the Limitation of Pulse Width in Optical Time-domain Reflectometry

Optical time-domain reflectometry (OTDR) is the basis for distributed time-domain optical fiber sensing techniques. By injecting pulse light into an optical fiber, the distance information of an event can be obtained based on the time of light flight. The minimum distinguishable event separation along the fiber length is called the spatial resolution, which is determined by the optical pulse width. By reducing the pulse width, the spatial resolution can be improved. However, at the same time, the signal-to-noise ratio of the system is degraded, and higher speed equipment is required. To solve this problem, data processing methods such as iterative subdivision, deconvolution, and neural networks have been proposed. However, they all have some shortcomings and thus have not been widely applied. Here, we propose and experimentally demonstrate an OTDR deconvolution neural network based on deep convolutional neural networks. A simplified OTDR model is built to generate a large amount of training data. By optimizing the network structure and training data, an effective OTDR deconvolution is achieved. The simulation and experimental results show that the proposed neural network can achieve more accurate deconvolution than the conventional deconvolution algorithm with a higher signal-to-noise ratio.

eess.SP↗

Compilable Neural Code Generation with Compiler Feedback

Automatically generating compilable programs with (or without) natural language descriptions has always been a touchstone problem for computational linguistics and automated software engineering. Existing deep-learning approaches model code generation as text generation, either constrained by grammar structures in decoder, or driven by pre-trained language models on large-scale code corpus (e.g., CodeGPT, PLBART, and CodeT5). However, few of them account for compilability of the generated programs. To improve compilability of the generated programs, this paper proposes COMPCODER, a three-stage pipeline utilizing compiler feedback for compilable code generation, including language model fine-tuning, compilability reinforcement, and compilability discrimination. Comprehensive experiments on two code generation tasks demonstrate the effectiveness of our proposed approach, improving the success rate of compilation from 44.18 to 89.18 in code completion on average and from 70.3 to 96.2 in text-to-code generation, respectively, when comparing with the state-of-the-art CodeGPT.

cs.CL↗

Cavity Quantum Electrodynamics Effects of Optically Cooled Nitrogen-Vacancy Centers Coupled to a High Frequency Microwave Resonator

Recent experiments demonstrated the cooling of a microwave mode of a high-quality dielectric resonator coupled to optically cooled nitrogen-vacancy (NV) spins in diamond. Our recent theoretical study [arXiv:2110.10950] pointed out the cooled NV spins can be used to realize cavity quantum electrodynamics effects (C-QED) at room temperature. In this article, we propose to modify the setup used in a recent diamond maser experiment [Nature 55, 493-496 (2018)], which features a higher spin transition frequency, a lower spin-dephasing rate and a stronger NV spins-resonator coupling, to realize better microwave mode cooling and the room-temperature CQED effects. To describe more precisely the optical spin cooling and the collective spin-resonator coupling, we extend the standard Jaynes-Cumming model to account for the rich electronic and spin levels of the NV centers. Our calculations show that for the proposed setup it is possible to cool the microwave mode from $293$ K (room temperature) to $116$ K, which is about $72$ K lower than the previous records, and to study the intriguing dynamics of the CQED effects under the weak-to-strong coupling transition by varying the laser power. With simple modifications, our model can be applied to, e.g., other solid-state spins or triplet spins of pentacene molecules, and to investigate other effects, such as the operations of pulsed and continuous-wave masing.

quant-ph↗

Quasi-Continuous Cooling of a Microwave Mode on a Benchtop using Hyperpolarized NV$^-$ Diamond

We demonstrate the cooling of a microwave mode at 2872 MHz through its interaction with optically spin-polarized NV$^-$ centers in diamond at zero applied magnetic field, removing thermal photons from the mode. By photo-exciting (pumping) a brilliant-cut red diamond jewel with a continuous-wave 532-nm laser, outputting 2 W, the microwave mode is cooled down to a noise temperature of 188 K. This noise temperature can be preserved continuously for as long as the diamond is optically excited and kept cool. The latter requirement restricted operation out to 10 ms in our preliminary setup. The mode-cooling performance of NV$^-$ diamond is directly compared against that of pentacene-doped para-terphenyl, where we find that the former affords the advantages of cooling immediately upon light excitation without needing to mase beforehand (or at all) and being able to cool continuously at substantially lower optical pump power.

quant-ph↗

CGN: A Capacity-Guaranteed Network Architecture for Future Ultra-Dense Wireless Systems

The sixth generation (6G) era is envisioned to be a fully intelligent and autonomous era, with physical and digital lifestyles merged together. Future wireless network architectures should provide a solid support for such new lifestyles. A key problem thus arises that what kind of network architectures are suitable for 6G. In this paper, we propose a capacity-guaranteed network (CGN) architecture, which provides high capacity for wireless devices densely distributed everywhere, and ensures a superior scalability with low signaling overhead and computation complexity simultaneously. Our theorem proves that the essence of a CGN architecture is to decompose the whole network into non-overlapping clusters with equal cluster sum capacity. Simulation results reveal that in terms of the minimum cluster sum capacity, the proposed CGN can achieve at least 30% performance gain compared with existing base station clustering (BS-clustering) architectures. In addition, our theorem is sufficiently general and can be applied for networks with different distributions of BSs and users.

cs.IT↗

A single-atom level mechano-optical transducer for ultrasensitive force sensing

Using light as a probe to detect a mechanical motion is one of the most successful experimental approaches in physics. The history of mechanical sensing based on the reflection, refraction and scattering of light dates back to the 16th century, where in the Cavendish experiment, the angle of rotation induced by the gravitational force is measured by the deflection of a light beam reflected from a mirror attached to the suspension. In modern science, mechano-optical transducers are such devices that could detect, measure and convert a force or displacement signal to an optical one, and are widely used for force detection. Especially, ultraweak force sensor with ultrahigh spatial resolution is highly demanded for detecting force anomaly in surface science, biomolecule imaging, and atomtronics. Here we show a novel scheme using a single trapped ion as a mechano-optical transduction. This method utilizes the force-induced micromotion, converting the micromotion to a time-resolved fluorescence signal, in which the ion's excess micromotion coupled to the Doppler shift of the scattered photons. We demonstrate the measurement sensitivity about 600 $\textrm{zN}/\sqrt{\textrm{Hz}}$ (1 $\textrm{zN} =10^{-21}$N). By alternating the detection laser beam in all three dimensions, the amplitude and the direction of a vector force can be precisely determined, constituting a 3D force sensor. This mechano-optical transducer provides high sensitivity with spatial resolution in single-atom level, enabling the applications in material industry and the search for possible exotic spin-dependent interactions that beyond the standard model.

physics.atom-ph↗

Frequency stabilization of a 739 nm laser to an $I_2$ spectrum for trapped Ytterbium ions

We report on the frequency stabilization of a 739 nm Ti:sapphire laser to a hyperfine component of the $^{127}I_{2}$ B(1)-X(11) P(70) transition using acousto-optic modulation transfer spectroscopy (MTS). A frequency stability of $3.83\times 10^{-11}$ around 13 s averaging time is achieved when the laser frequency is stabilized. The observed hyperfine transition of the molecular iodine is an ideal frequency reference for locking the lasers used in experiments with trapped ytterbium ions, since its second harmonic frequency is the $^{2}S_{\frac{1}{2}}-^{2}P_{\frac{1}{2}}$ transition of the ytterbium ion at 369.5 nm. By investigating the line broadening effects due to the iodine vapor pressure and laser power, the locking is optimized to the theoretical signal to noise ratio (TSNR) of this iodine transition.

physics.atom-ph↗

Joint Offloading Decision and Resource Allocation for Vehicular Fog-Edge Computing Networks: A Contract-Stackelberg Approach

With the popularity of mobile devices and development of computationally intensive applications, researchers are focusing on offloading computation to Mobile Edge Computing (MEC) server due to its high computational efficiency and low communication delay. As the computing resources of an MEC server are limited, vehicles in the urban area who have abundant idle resources should be fully utilized. However, offloading computing tasks to vehicles faces many challenging issues. In this paper, we introduce a vehicular fog-edge computing paradigm and formulate it as a multi-stage Stackelberg game to deal with these issues. Specifically, vehicles are not obligated to share resources, let alone disclose their private information (e.g., stay time and the amount of resources). Therefore, in the first stage, we design a contract-based incentive mechanism to motivate vehicles to contribute their idle resources. Next, due to the complicated interactions among vehicles, road-side unit (RSU), MEC server and mobile device users, it is challenging to coordinate the resources of all parties and design a transaction mechanism to make all entities benefit. In the second and third stages, based on Stackelberg game, we develop pricing strategies that maximize the utilities of all parties. The analytical forms of optimal strategies for each stage are given. Simulation results demonstrate the effectiveness of our proposed incentive mechanism, reveal the trends of energy consumption and offloading decisions of users with various parameters, and present the performance comparison between our framework and existing MEC offloading paradigm in vehicular networks.

cs.DC↗

Fast Sinkhorn I: An O(N) algorithm for the Wasserstein-1 metric

The Wasserstein metric is broadly used in optimal transport for comparing two probabilistic distributions, with successful applications in various fields such as machine learning, signal processing, seismic inversion, etc. Nevertheless, the high computational complexity is an obstacle for its practical applications. The Sinkhorn algorithm, one of the main methods in computing the Wasserstein metric, solves an entropy regularized minimizing problem, which allows arbitrary approximations to the Wasserstein metric with O(N^2) computational cost. However, higher accuracy of its numerical approximation requires more Sinkhorn iterations with repeated matrix-vector multiplications, which is still unaffordable. In this work, we propose an efficient implementation of the Sinkhorn algorithm to calculate the Wasserstein-1 metric with O(N) computational cost, which achieves the optimal theoretical complexity. By utilizing the special structure of Sinkhorn's kernel, the repeated matrix-vector multiplications can be implemented with O(N) times multiplications and additions, using the Qin Jiushao or Horner's method for efficient polynomial evaluation, leading to an efficient algorithm without losing accuracy. In addition, the log-domain stabilization technique, used to stabilize the iterative procedure, can also be applied in this algorithm. Our numerical experiments show that the newly developed algorithm is one to three orders of magnitude faster than the original Sinkhorn algorithm.

math.OC↗

Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches

We present two new local differentially private algorithms for frequency estimation. One solves the fundamental frequency oracle problem; the other solves the well-known heavy hitters identification problem. Consistent with prior art, these are randomized algorithms. As a function of failure probability~$β$, the former achieves optimal worst-case estimation error for every~$β$, while the latter is optimal when~$β$ is at least inverse polynomial in~$n$, the number of users. In both algorithms, server running time is~$\tilde{O}(n)$ while user running time is~$\tilde{O}(1)$. Our frequency-oracle algorithm achieves lower estimation error than the prior works of Bassily et al. (NeurIPS 2017). On the other hand, our heavy hitters identification method is as easily implementable as as TreeHist (Bassily et al., 2017) and has superior worst-case error, by a factor of $Ω(\sqrt{\log n})$.

cs.DS↗

Free Component Analysis: Theory, Algorithms & Applications

We describe a method for unmixing mixtures of freely independent random variables in a manner analogous to the independent component analysis (ICA) based method for unmixing independent random variables from their additive mixtures. Random matrices play the role of free random variables in this context so the method we develop, which we call Free component analysis (FCA), unmixes matrices from additive mixtures of matrices. Thus, while the mixing model is standard, the novelty and difference in unmixing performance comes from the introduction of a new statistical criteria, derived from free probability theory, that quantify freeness analogous to how kurtosis and entropy quantify independence. We describe the theory, the various algorithms, and compare FCA to vanilla ICA which does not account for spatial or temporal structure. We highlight why the statistical criteria make FCA also vanilla despite its matricial underpinnings and show that FCA performs comparably to, and sometimes better than, (vanilla) ICA in every application, such as image and speech unmixing, where ICA has been known to succeed. Our computational experiments suggest that not-so-random matrices, such as images and short time fourier transform matrix of waveforms are (closer to being) freer "in the wild" than we might have theoretically expected.

cs.LG↗

FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labeling

The recently proposed FixMatch achieved state-of-the-art results on most semi-supervised learning (SSL) benchmarks. However, like other modern SSL algorithms, FixMatch uses a pre-defined constant threshold for all classes to select unlabeled data that contribute to the training, thus failing to consider different learning status and learning difficulties of different classes. To address this issue, we propose Curriculum Pseudo Labeling (CPL), a curriculum learning approach to leverage unlabeled data according to the model's learning status. The core of CPL is to flexibly adjust thresholds for different classes at each time step to let pass informative unlabeled data and their pseudo labels. CPL does not introduce additional parameters or computations (forward or backward propagation). We apply CPL to FixMatch and call our improved algorithm FlexMatch. FlexMatch achieves state-of-the-art performance on a variety of SSL benchmarks, with especially strong performances when the labeled data are extremely limited or when the task is challenging. For example, FlexMatch achieves 13.96% and 18.96% error rate reduction over FixMatch on CIFAR-100 and STL-10 datasets respectively, when there are only 4 labels per class. CPL also significantly boosts the convergence speed, e.g., FlexMatch can use only 1/5 training time of FixMatch to achieve even better performance. Furthermore, we show that CPL can be easily adapted to other SSL algorithms and remarkably improve their performances. We open-source our code at https://github.com/TorchSSL/TorchSSL.

cs.LG↗

Aspect-driven User Preference and News Representation Learning for News Recommendation

News recommender systems are essential for helping users to efficiently and effectively find out those interesting news from a large amount of news. Most of existing news recommender systems usually learn topic-level representations of users and news for recommendation, and neglect to learn more informative aspect-level features of users and news for more accurate recommendation. As a result, they achieve limited recommendation performance. Aiming at addressing this deficiency, we propose a novel Aspect-driven News Recommender System (ANRS) built on aspect-level user preference and news representation learning. Here, news aspect is fine-grained semantic information expressed by a set of related words, which indicates specific aspects described by the news. In ANRS, news aspect-level encoder and user aspect-level encoder are devised to learn the fine-grained aspect-level representations of user's preferences and news characteristics respectively, which are fed into click predictor to judge the probability of the user clicking the candidate news. Extensive experiments are done on the commonly used real-world dataset MIND, which demonstrate the superiority of our method compared with representative and state-of-the-art methods.

cs.IR↗

Berry-Esseen bounds with targets and Local Limit Theorems for products of random matrices

Let $μ$ be a probability measure on $\text{GL}_d(\mathbb R)$ and denote by $S_n:= g_n \cdots g_1$ the associated random matrix product, where $g_j$'s are i.i.d.'s with law $μ$. We study statistical properties of random variables of the form $$σ(S_n,x) + u(S_n x),$$ where $x \in \mathbb P^{d-1}$, $σ$ is the norm cocycle and $u$ belongs to a class of admissible functions on $\mathbb P^{d-1}$ with values in $\mathbb R \cup \{\pm \infty\}$. Assuming that $μ$ has a finite exponential moment and generates a proximal and strongly irreducible semigroup, we obtain optimal Berry-Esseen bounds and the Local Limit Theorem for such variables using a large class of observables on $\mathbb R$ and Hölder continuous target functions on $\mathbb P^{d-1}$. As particular cases, we obtain new limit theorems for $σ(S_n,x)$ and for the coefficients of $S_n$.

math.PR↗

The Quadratic Wasserstein Metric With Squaring Scaling For Seismic Velocity Inversion

The quadratic Wasserstein metric has shown its power in measuring the difference between probability densities, which benefits optimization objective function with better convexity and is insensitive to data noise. Nevertheless, it is always an important question to make the seismic signals suitable for comparison using the quadratic Wasserstein metric. The squaring scaling is worth exploring since it guarantees the convexity caused by data shift. However, as mentioned in [Commun. Inf. Syst., 2019, 19:95-145], the squaring scaling may lose uniqueness and result in more local minima to the misfit function. In our previous work [J. Comput. Phys., 2018, 373:188-209], the quadratic Wasserstein metric with squaring scaling was successfully applied to the earthquake location problem. But it only discussed the inverse problem with few degrees of freedom. In this work, we will present a more in-depth study on the combination of squaring scaling technique and the quadratic Wasserstein metric. By discarding some inapplicable data, picking seismic phases, and developing a new normalization method, we successfully invert the seismic velocity structure based on the squaring scaling technique and the quadratic Wasserstein metric. The numerical experiments suggest that this newly proposed method is an efficient approach to obtain more accurate inversion results.

math.NA↗

Experimental test of Tsirelson's bound with a single photonic qubit

For many protocols, quantum strategies have advantages compared with their classical counter-partners, and these advantages have attracted many interests and applications. One of the famous examples is the Clauser-Horne-Shimony-Holt (CHSH) game, which recasts Bell's theorem~\cite{2} into the framework of a game. In the CHSH game, two space-like separated players, Alice and Bob are each assigned a classical bit $a$ and $b$ respectively. Then they return bits $x$ and $y$ according to some pre-agreed strategies. They will win the game when $x\oplus y= a\cdot b$. In the game, if the players use the classical strategies, the optimal success probability $w(\text{CHSH})=0.75$.However, if they add some quantum resources, the success probability will increase and up to maximal value $cos^2(π/8)$, which is know as the Tsirelson's bound. Moreover, Popescu and Rohrlich noted that the perfect success probability $1$ can also be achieved in a more general theory without violating the no-signaling assumption

quant-ph↗