arXiv subjects

Yihong Wu

Publications and source records attributed to Yihong Wu.

At least 109 records · Page 6Linked to original sources

arXiv2020

Semi-Global Shape-aware Network

Non-local operations are usually used to capture long-range dependencies via aggregating global context to each position recently. However, most of the methods cannot preserve object shapes since they only focus on feature similarity but ignore proximity between central and other positions for capturing long-range dependencies, while shape-awareness is beneficial to many computer vision tasks. In this paper, we propose a Semi-Global Shape-aware Network (SGSNet) considering both feature similarity and proximity for preserving object shapes when modeling long-range dependencies. A hierarchical way is taken to aggregate global context. In the first level, each position in the whole feature map only aggregates contextual information in vertical and horizontal directions according to both similarity and proximity. And then the result is input into the second level to do the same operations. By this hierarchical way, each central position gains supports from all other positions, and the combination of similarity and proximity makes each position gain supports mostly from the same semantic object. Moreover, we also propose a linear time algorithm for the aggregation of contextual information, where each of rows and columns in the feature map is treated as a binary tree to reduce similarity computation cost. Experiments on semantic segmentation and image retrieval show that adding SGSNet to existing networks gains solid improvements on both accuracy and efficiency.

cs.CV↗

arXiv2020

Spin torque gate magnetic field sensor

Spin-orbit torque provides an efficient pathway to manipulate the magnetic state and magnetization dynamics of magnetic materials, which is crucial for energy-efficient operation of a variety of spintronic devices such as magnetic memory, logic, oscillator, and neuromorphic computing. Here, we describe and experimentally demonstrate a strategy for the realization of a spin torque gate magnetic field sensor with extremely simple structure by exploiting the longitudinal field dependence of the spin torque driven magnetization switching. Unlike most magnetoresistance sensors which require a delicate magnetic bias to achieve a linear response to the external field, the spin torque gate sensor can achieve the same without any magnetic bias, which greatly simplifies the sensor structure. Furthermore, by driving the sensor using an ac current, the dc offset is automatically suppressed, which eliminates the need for a bridge or compensation circuit. We verify the concept using the newly developed WTe2/Ti/CoFeB trilayer and demonstrate that the sensor can work linearly in the range of 3-10 Oe with negligible dc offset.

cond-mat.mes-hall↗

arXiv2020

Leveraging Local and Global Descriptors in Parallel to Search Correspondences for Visual Localization

Visual localization to compute 6DoF camera pose from a given image has wide applications such as in robotics, virtual reality, augmented reality, etc. Two kinds of descriptors are important for the visual localization. One is global descriptors that extract the whole feature from each image. The other is local descriptors that extract the local feature from each image patch usually enclosing a key point. More and more methods of the visual localization have two stages: at first to perform image retrieval by global descriptors and then from the retrieval feedback to make 2D-3D point correspondences by local descriptors. The two stages are in serial for most of the methods. This simple combination has not achieved superiority of fusing local and global descriptors. The 3D points obtained from the retrieval feedback are as the nearest neighbor candidates of the 2D image points only by global descriptors. Each of the 2D image points is also called a query local feature when performing the 2D-3D point correspondences. In this paper, we propose a novel parallel search framework, which leverages advantages of both local and global descriptors to get nearest neighbor candidates of a query local feature. Specifically, besides using deep learning based global descriptors, we also utilize local descriptors to construct random tree structures for obtaining nearest neighbor candidates of the query local feature. We propose a new probabilistic model and a new deep learning based local descriptor when constructing the random trees. A weighted Hamming regularization term to keep discriminativeness after binarization is given in the loss function for the proposed local descriptor. The loss function co-trains both real and binary descriptors of which the results are integrated into the random trees.

cs.CV↗

arXiv2020

Self-regularizing Property of Nonparametric Maximum Likelihood Estimator in Mixture Models

Introduced by Kiefer and Wolfowitz \cite{KW56}, the nonparametric maximum likelihood estimator (NPMLE) is a widely used methodology for learning mixture odels and empirical Bayes estimation. Sidestepping the non-convexity in mixture likelihood, the NPMLE estimates the mixing distribution by maximizing the total likelihood over the space of probability measures, which can be viewed as an extreme form of overparameterization. In this paper we discover a surprising property of the NPMLE solution. Consider, for example, a Gaussian mixture model on the real line with a subgaussian mixing distribution. Leveraging complex-analytic techniques, we show that with high probability the NPMLE based on a sample of size $n$ has $O(\log n)$ atoms (mass points), significantly improving the deterministic upper bound of $n$ due to Lindsay \cite{lindsay1983geometry1}. Notably, any such Gaussian mixture is statistically indistinguishable from a finite one with $O(\log n)$ components (and this is tight for certain mixtures). Thus, absent any explicit form of model selection, NPMLE automatically chooses the right model complexity, a property we term \emph{self-regularization}. Extensions to other exponential families are given. As a statistical application, we show that this structural property can be harnessed to bootstrap existing Hellinger risk bound of the (parametric) MLE for finite Gaussian mixtures to the NPMLE for general Gaussian mixtures, recovering a result of Zhang \cite{zhang2009generalized}.

math.ST↗

arXiv2020

Note on approximating the Laplace transform of a Gaussian on a complex disk

In this short note we study how well a Gaussian distribution can be approximated by distributions supported on $[-a,a]$. Perhaps, the natural conjecture is that for large $a$ the almost optimal choice is given by truncating the Gaussian to $[-a,a]$. Indeed, such approximation achieves the optimal rate of $e^{-Θ(a^2)}$ in terms of the $L_\infty$-distance between characteristic functions. However, if we consider the $L_\infty$-distance between Laplace transforms on a complex disk, the optimal rate is $e^{-Θ(a^2 \log a)}$, while truncation still only attains $e^{-Θ(a^2)}$. The optimal rate can be attained by the Gauss-Hermite quadrature. As corollary, we also construct a ``super-flat'' Gaussian mixture of $Θ(a^2)$ components with means in $[-a,a]$ and whose density has all derivatives bounded by $e^{-Ω(a^2 \log(a))}$ in the $O(1)$-neighborhood of the origin.

math.ST↗

arXiv2020

Efficient random graph matching via degree profiles

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erdős-Rényi graphs $G(n,\frac{d}{n})$. This can be viewed as an average-case and noisy version of the graph isomorphism problem. Under this model, the maximum likelihood estimator is equivalent to solving the intractable quadratic assignment problem. This work develops an $\tilde{O}(n d^2+n^2)$-time algorithm which perfectly recovers the true vertex correspondence with high probability, provided that the average degree is at least $d = Ω(\log^2 n)$ and the two graphs differ by at most $δ= O( \log^{-2}(n) )$ fraction of edges. For dense graphs and sparse graphs, this can be improved to $δ= O( \log^{-2/3}(n) )$ and $δ= O( \log^{-2}(d) )$ respectively, both in polynomial time. The methodology is based on appropriately chosen distance statistics of the degree profiles (empirical distribution of the degrees of neighbors). Before this work, the best known result achieves $δ=O(1)$ and $n^{o(1)} \leq d \leq n^c$ for some constant $c$ with an $n^{O(\log n)}$-time algorithm \cite{barak2018nearly} and $δ=\tilde O((d/n)^4)$ and $d = \tildeΩ(n^{4/5})$ with a polynomial-time algorithm \cite{dai2018performance}.

stat.ML↗

arXiv2020

Application of information-percolation method to reconstruction problems on graphs

In this paper we propose a method of proving impossibility results based on applying strong data-processing inequalities to estimate mutual information between sets of variables forming certain Markov random fields. The end result is that mutual information between two "far away" (as measured by the graph distance) variables is bounded by the probability of the existence of an open path in a bond-percolation problem on the same graph. Furthermore, stronger bounds can be obtained by establishing mutual information comparison results with an erasure model on the same graph, with erasure probabilities given by the contraction coefficients. As applications, we show that our method gives sharp threshold for partially recovering a rank-one perturbation of a random Gaussian matrix (spiked Wigner model), yields the best known upper bound on the noise level for group synchronization (obtained concurrently by Abbe and Boix), and establishes new impossibility result for community detection on the stochastic block model with $k$ communities.

cs.IT↗

arXiv2020

Extrapolating the profile of a finite population

We study a prototypical problem in empirical Bayes. Namely, consider a population consisting of $k$ individuals each belonging to one of $k$ types (some types can be empty). Without any structural restrictions, it is impossible to learn the composition of the full population having observed only a small (random) subsample of size $m = o(k)$. Nevertheless, we show that in the sublinear regime of $m =ω(k/\log k)$, it is possible to consistently estimate in total variation the \emph{profile} of the population, defined as the empirical distribution of the sizes of each type, which determines many symmetric properties of the population. We also prove that in the linear regime of $m=c k$ for any constant $c$ the optimal rate is $Θ(1/\log k)$. Our estimator is based on Wolfowitz's minimum distance method, which entails solving a linear program (LP) of size $k$. We show that there is a single infinite-dimensional LP whose value simultaneously characterizes the risk of the minimum distance estimator and certifies its minimax optimality. The sharp convergence rate is obtained by evaluating this LP using complex-analytic techniques.

math.ST↗

arXiv2020

Eddy Current Testing of Metal Cracks Using Spin Hall Magnetoresistance Sensor and Machine Learning

Recently we have developed a spin Hall magnetoresistance (SMR) sensor which operates under AC bias and sense currents. Here we demonstrate both theoretically and experimentally that the SMR sensor is uniquely suited for eddy current testing applications because both the coil and sensor utilize AC current as the excitation source. The use of SMR sensor effectively eliminates the necessity of any demodulation or lock-in technique for detecting the eddy current, which greatly simplifies the detection system. Furthermore, we show that the combination of principal component analysis and decision tree model is effective in classifying the metal cracks. The relatively clean signals obtained by the SMR sensor greatly facilitates the subsequent signal analysis and ensures high accuracy in the classification of different types of crack features.

cond-mat.mtrl-sci↗

arXiv2020

Sample complexity of population recovery

The problem of population recovery refers to estimating a distribution based on incomplete or corrupted samples. Consider a random poll of sample size $n$ conducted on a population of individuals, where each pollee is asked to answer $d$ binary questions. We consider one of the two polling impediments: (a) in lossy population recovery, a pollee may skip each question with probability $ε$, (b) in noisy population recovery, a pollee may lie on each question with probability $ε$. Given $n$ lossy or noisy samples, the goal is to estimate the probabilities of all $2^d$ binary vectors simultaneously within accuracy $δ$ with high probability. This paper settles the sample complexity of population recovery. For lossy model, the optimal sample complexity is $\tildeΘ(δ^{-2\max\{\fracε{1-ε},1\}})$, improving the state of the art by Moitra and Saks in several ways: a lower bound is established, the upper bound is improved and the result depends at most on the logarithm of the dimension. Surprisingly, the sample complexity undergoes a phase transition from parametric to nonparametric rate when $ε$ exceeds $1/2$. For noisy population recovery, the sharp sample complexity turns out to be more sensitive to dimension and scales as $\exp(Θ(d^{1/3} \log^{2/3}(1/δ)))$ except for the trivial cases of $ε=0,1/2$ or $1$. For both models, our estimators simply compute the empirical mean of a certain function, which is found by pre-solving a linear program (LP). Curiously, the dual LP can be understood as Le Cam's method for lower-bounding the minimax risk, thus establishing the statistical optimality of the proposed estimators. The value of the LP is determined by complex-analytic methods.

math.ST↗

arXiv2020

Terahertz Emission From an Exchange-Coupled Synthetic Antiferromagnet

We report on terahertz emission from FeMnPt/Ru/FeMnPt and Pt/CoFeB/Ru/CoFeB/Pt synthetic antiferromagnet (SAF) structures upon irradiation by a femtosecond laser; the former is via the anomalous Hall effect, whereas the latter is through the inverse spin Hall effect. The antiparallel alignment of the two ferromagnetic layers leads to a terahertz emission peak amplitude that is almost double that for a corresponding single-layer or bilayer emitter with the same equivalent thickness. In addition, we demonstrate by both simulation and experiment that terahertz emission provides a powerful tool to probe the magnetization reversal processes of individual ferromagnetic layers in a SAF structure, as the terahertz signal is proportional to the vector difference of the magnetizations of the two ferromagnetic layers.

cond-mat.mtrl-sci↗

arXiv2020

Evidence for a Coronal Shock Wave Origin for Relativistic Protons Producing Solar Gamma-Rays and Observed by Neutron Monitors at Earth

We study the solar eruptive event on 2017 September 10 that produced long-lasting $>$100 MeV $γ$-ray emission and a ground level enhancement (GLE72). The origin of the high-energy ions producing late-phase gamma-ray emission (LPGRE) is still an open question, but a possible explanation is proton acceleration at coronal shocks produced by coronal mass ejections. We examine a common shock acceleration origin for both the LPGRE and GLE72. The $γ$-ray emission observed by the Fermi-Large Area Telescope exhibits a weak impulsive phase, consistent with that observed in hard X-and $γ$-ray line flare emissions, and what appear to be two distinct stages of LPGRE. From a detailed modeling of the shock wave, we derive the 3D distribution and temporal evolution of the shock parameters, and we examine the shock wave magnetic connection with the visible solar disk. The evolution of shock parameters on field lines returning to the visible disk, mirrors the two stages of LPGRE. We find good agreement between the time history of $>$100 MeV $γ$-rays and one produced by a basic shock acceleration model. The time history of shock parameters magnetically mapped to Earth agrees with the rates observed by the Fort Smith neutron monitor during the first hour of the GLE72 if we include a 30% contribution of flare-accelerated protons during the first 10 minutes, having a release time following the time history of nuclear $γ$-rays. Our analysis provides compelling evidence for a common shock origin for protons producing the LPGRE and most of the particles observed in GLE72.

astro-ph.SR↗

arXiv2020

Relating streamer flows to density and magnetic structures at the Parker Solar Probe

The physical mechanisms that produce the slow solar wind are still highly debated. Parker Solar Probe's (PSP's) second solar encounter provided a new opportunity to relate in situ measurements of the nascent slow solar wind with white-light images of streamer flows. We exploit data taken by the Solar and Heliospheric Observatory (SOHO), the Solar TErrestrial RElations Observatory (STEREO) and the Wide Imager on Solar Probe to reveal for the first time a close link between imaged streamer flows and the high-density plasma measured by the Solar Wind Electrons Alphas and Protons (SWEAP) experiment. We identify different types of slow winds measured by PSP that we relate to the spacecraft's magnetic connectivity (or not) to streamer flows. SWEAP measured high-density and highly variable plasma when PSP was well connected to streamers but more tenuous wind with much weaker density variations when it exited streamer flows. STEREO imaging of the release and propagation of small transients from the Sun to PSP reveals that the spacecraft was continually impacted by the southern edge of streamer transients. The impact of specific density structures is marked by a higher occurrence of magnetic field reversals measured by the FIELDS magnetometers. Magnetic reversals originating from the streamers are associated with larger density variations compared with reversals originating outside streamers. We tentatively interpret these findings in terms of magnetic reconnection between open magnetic fields and coronal loops with different properties, providing support for the formation of a subset of the slow wind by magnetic reconnection.

astro-ph.SR↗

arXiv2019

Consistent recovery threshold of hidden nearest neighbor graphs

Motivated by applications such as discovering strong ties in social networks and assembling genome subsequences in biology, we study the problem of recovering a hidden $2k$-nearest neighbor (NN) graph in an $n$-vertex complete graph, whose edge weights are independent and distributed according to $P_n$ for edges in the hidden $2k$-NN graph and $Q_n$ otherwise. The special case of Bernoulli distributions corresponds to a variant of the Watts-Strogatz small-world graph. We focus on two types of asymptotic recovery guarantees as $n\to \infty$: (1) exact recovery: all edges are classified correctly with probability tending to one; (2) almost exact recovery: the expected number of misclassified edges is $o(nk)$. We show that the maximum likelihood estimator achieves (1) exact recovery for $2 \le k \le n^{o(1)}$ if $ \liminf \frac{2α_n}{\log n}>1$; (2) almost exact recovery for $ 1 \le k \le o\left( \frac{\log n}{\log \log n} \right)$ if $\liminf \frac{kD(P_n||Q_n)}{\log n}>1$, where $α_n \triangleq -2 \log \int \sqrt{d P_n d Q_n}$ is the Rényi divergence of order $\frac{1}{2}$ and $D(P_n||Q_n)$ is the Kullback-Leibler divergence. Under mild distributional assumptions, these conditions are shown to be information-theoretically necessary for any algorithm to succeed. A key challenge in the analysis is the enumeration of $2k$-NN graphs that differ from the hidden one by a given number of edges.

cs.DS↗

arXiv2019

Optimal rates of entropy estimation over Lipschitz balls

We consider the problem of minimax estimation of the entropy of a density over Lipschitz balls. Dropping the usual assumption that the density is bounded away from zero, we obtain the minimax rates $(n\ln n)^{-s/(s+d)} + n^{-1/2}$ for $0<s\leq 2$ for densities supported on $[0,1]^d$, where $s$ is the smoothness parameter and $n$ is the number of independent samples. We generalize the results to densities with unbounded support: given an Orlicz functions $Ψ$ of rapid growth (such as the sub-exponential and sub-Gaussian classes), the minimax rates for densities with bounded $Ψ$-Orlicz norm increase to $(n\ln n)^{-s/(s+d)} (Ψ^{-1}(n))^{d(1-d/p(s+d))} + n^{-1/2}$, where $p$ is the norm parameter in the Lipschitz ball. We also show that the integral-form plug-in estimators with kernel density estimates fail to achieve the minimax rates, and characterize their worst case performances over the Lipschitz ball. One of the key steps in analyzing the bias relies on a novel application of the Hardy-Littlewood maximal inequality, which also leads to a new inequality on the Fisher information that may be of independent interest.

math.ST↗

arXiv2019

Terahertz emission from anomalous Hall effect in a single-layer ferromagnet

We report on terahertz emission from a single layer ferromagnet which involves the generation of backflow nonthermal charge current from the ferromagnet/dielectric interface by femtosecond laser excitation and subsequent conversion of the charge current to a transverse transient charge current via the anomalous Hall effect, thereby generating the THz radiation. The THz emission can be either enhanced or suppressed, or even the polarity can be reversed, by introducing a magnetization gradient in the thickness direction of the ferromagnet. Unlike spintronic THz emitters reported previously, it does not require additional non-magnetic layer or Rashba interface.

physics.app-ph↗

arXiv2019

Intrinsic skyrmions in monolayer Janus magnets

Skyrmions are localized solitonic spin textures with protected topology, which are promising as information carriers in ultra-dense and energy-efficient logic and memory devices. Recently, magnetic skyrmions have been observed in magnetic thin films, and are stabilized by the extrinsic interfacial Dzyaloshinskii-Moriya interaction (DMI) and/or external magnetic fields. The specific effects in magnetic monolayer materials have not been thoroughly studied. Here, we investigate the intrinsic magnetic skyrmions in a family of monolayer Janus van der Waals magnets, MnSTe, MnSeTe, VSeTe, and MnSSe, by the first-principles calculations combined with the micromagnetic simulations. The monolayer Janus MnSTe, MnSeTe, and VSeTe with out-of-plane geometric asymmetry and strong spin-orbit coupling (SOC) have a large intrinsic DMI, which could stabilize a sub-50 nm intrinsic skyrmions in monolayer MnSTe and MnSeTe at zero magnetic field. While monolayer VSeTe with in-plane easy axis forms magnetic domain rather than skyrmions. Moreover, the size and shape of skyrmions can be tuned by an external magnetic field. Therefore, our work motivates a new vista for seeking intrinsic skyrmions in atomic-scale magnets.

cond-mat.mes-hall↗

arXiv2019

Spin Hall magnetoresistance sensor using Au$_x$Pt$_{1-x}$ as the spin-orbit torque biasing layer

We report on investigation of spin Hall magnetoresistance sensor based on NiFe/AuxPt1-x bilayers. Compared to NiFe/Pt, the NiFe/AuxPt1-x sensor exhibits a much lower power consumption (reduced by about 57%), due to 80% enhancement of spin-orbit torque efficiency of AuxPt1-x at an optimum composition of x = 0.19 as compared to pure Pt. The enhanced spin-orbit torque efficiency allows to increase the thickness of NiFe from 1.8 nm to 2.5 nm without significantly increasing the power consumption. We show that, by increasing the NiFe thickness, we were able to improve the working field range (0.86 Oe), operation temperature range (150 degree C) and detectivity (0.71 nT/sqrt(Hz) at 1 Hz) of the sensor, which is important for practical applications.

physics.app-ph↗