Searcharxiv⌕ Search

arXiv subjects

Hong Wang

Publications and source records attributed to Hong Wang.

At least 271 records · Page 15Linked to original sources

Deep Reinforcement Learning for UAV Navigation Through Massive MIMO Technique

Unmanned aerial vehicles (UAVs) technique has been recognized as a promising solution in future wireless connectivity from the sky, and UAV navigation is one of the most significant open research problems, which has attracted wide interest in the research community. However, the current UAV navigation schemes are unable to capture the UAV motion and select the best UAV-ground links in real time, and these weaknesses overwhelm the UAV navigation performance. To tackle these fundamental limitations, in this paper, we merge the state-of-theart deep reinforcement learning with the UAV navigation through massive multiple-input-multiple-output (MIMO) technique. To be specific, we carefully design a deep Q-network (DQN) for optimizing the UAV navigation by selecting the optimal policy, and then we propose a learning mechanism for processing the DQN. The DQN is trained so that the agent is capable of making decisions based on the received signal strengths for navigating theUAVs with the aid of the powerful Q-learning. Simulation results are provided to corroborate the superiority of the proposed schemes in terms of the coverage and convergence compared with those of the other schemes.

eess.SP↗

Simple yet Effective Bridge Reasoning for Open-Domain Multi-Hop Question Answering

A key challenge of multi-hop question answering (QA) in the open-domain setting is to accurately retrieve the supporting passages from a large corpus. Existing work on open-domain QA typically relies on off-the-shelf information retrieval (IR) techniques to retrieve \textbf{answer passages}, i.e., the passages containing the groundtruth answers. However, IR-based approaches are insufficient for multi-hop questions, as the topic of the second or further hops is not explicitly covered by the question. To resolve this issue, we introduce a new sub-problem of open-domain multi-hop QA, which aims to recognize the bridge (\emph{i.e.}, the anchor that links to the answer passage) from the context of a set of start passages with a reading comprehension model. This model, the \textbf{bridge reasoner}, is trained with a weakly supervised signal and produces the candidate answer passages for the \textbf{passage reader} to extract the answer. On the full-wiki HotpotQA benchmark, we significantly improve the baseline method by 14 point F1. Without using any memory-inefficient contextual embeddings, our result is also competitive with the state-of-the-art that applies BERT in multiple modules.

cs.CL↗

Optimal Analysis of Subset-Selection Based L_p Low Rank Approximation

We study the low rank approximation problem of any given matrix $A$ over $\mathbb{R}^{n\times m}$ and $\mathbb{C}^{n\times m}$ in entry-wise $\ell_p$ loss, that is, finding a rank-$k$ matrix $X$ such that $\|A-X\|_p$ is minimized. Unlike the traditional $\ell_2$ setting, this particular variant is NP-Hard. We show that the algorithm of column subset selection, which was an algorithmic foundation of many existing algorithms, enjoys approximation ratio $(k+1)^{1/p}$ for $1\le p\le 2$ and $(k+1)^{1-1/p}$ for $p\ge 2$. This improves upon the previous $O(k+1)$ bound for $p\ge 1$ \cite{chierichetti2017algorithms}. We complement our analysis with lower bounds; these bounds match our upper bounds up to constant $1$ when $p\geq 2$. At the core of our techniques is an application of \emph{Riesz-Thorin interpolation theorem} from harmonic analysis, which might be of independent interest to other algorithmic designs and analysis more broadly. As a consequence of our analysis, we provide better approximation guarantees for several other algorithms with various time complexity. For example, to make the algorithm of column subset selection computationally efficient, we analyze a polynomial time bi-criteria algorithm which selects $O(k\log m)$ columns. We show that this algorithm has an approximation ratio of $O((k+1)^{1/p})$ for $1\le p\le 2$ and $O((k+1)^{1-1/p})$ for $p\ge 2$. This improves over the best-known bound with an $O(k+1)$ approximation ratio. Our bi-criteria algorithm also implies an exact-rank method in polynomial time with a slightly larger approximation ratio.

cs.LG↗

A Survey on Rain Removal from Video and Single Image

Rain streaks might severely degenerate the performance of video/image processing tasks. The investigations on rain removal from video or a single image has thus been attracting much research attention in the field of computer vision and pattern recognition, and various methods have been proposed against this task in the recent years. However, there is still not a comprehensive survey paper to summarize current rain removal methods and fairly compare their generalization performance, and especially, still not a off-the-shelf toolkit to accumulate recent representative methods for easy performance comparison and capability evaluation. Aiming at this meaningful task, in this study we present a comprehensive review for current rain removal methods for video and a single image. Specifically, these methods are categorized into model-driven and data-driven approaches, and more elaborate branches of each approach are further introduced. Intrinsic capabilities, especially generalization, of representative state-of-the-art methods of each approach have been evaluated and analyzed by experiments implemented on synthetic and real data both visually and quantitatively. Furthermore, we release a comprehensive repository, including direct links to 74 rain removal papers, source codes of 9 methods for video rain removal and 20 ones for single image rain removal, 19 related project pages, 6 synthetic datasets and 4 real ones, and 4 commonly used image quality metrics, to facilitate reproduction and performance comparison of current existing methods for general users. Some limitations and research issues worthy to be further investigated have also been discussed for future research of this direction.

eess.IV↗

Fine-tune Bert for DocRED with Two-step Process

Modelling relations between multiple entities has attracted increasing attention recently, and a new dataset called DocRED has been collected in order to accelerate the research on the document-level relation extraction. Current baselines for this task uses BiLSTM to encode the whole document and are trained from scratch. We argue that such simple baselines are not strong enough to model to complex interaction between entities. In this paper, we further apply a pre-trained language model (BERT) to provide a stronger baseline for this task. We also find that solving this task in phases can further improve the performance. The first step is to predict whether or not two entities have a relation, the second step is to predict the specific relation.

cs.CL↗

Manipulating Coherent Light Matter Interaction: Continuous Transition between Strong Coupling and Weak Coupling in MoS2 Monolayer Coupled with Plasmonic Nanocavities

Strong interactions between surface plasmons in ultra-compact nanocavities and excitons in two dimensional materials have attracted wide interests for its prospective realization of polariton devices at room temperature. Here, we propose a continuous transition from weak coupling to strong coupling between excitons in MoS2 monolayer and highly localized plasmons in ultra-compact nanoantenna. The nanoantenna is assembled by a silver nanocube positioned over a gold film and separated by a dielectric spacer layer. We observed a 1570-fold enhancement in the photoluminescence at weak coupling regime in hybrid nanocavities with thick spacer layers. The interaction between excitons and plasmons is then directly prompted to strong coupling regime by shrinking down the thickness of spacer layer. Room temperature formation of polaritons with Rabi splitting up to 190 meV was observed, which is the largest plasmon-exciton Rabi splitting reported in two dimensional materials. Numerical calculations quantified the relation between coupling strength, local density of states and spacer thickness, and revealed the transition between weak coupling and strong coupling in nanocavities. The findings in this work offer a guideline for feasible designs of plasmon-exciton interaction systems with gap plasmonic cavities.

cond-mat.mes-hall↗

Inverse Structural Design of Graphene/Boron Nitride Hybrids by Regressional GAN

Inverse design of materials with desired properties is currently laborious and heavily relies on intuition of researchers through a trial-and-error process. The massive combinational spaces due to the constituent elements and their structural configurations are too overwhelming to be all searched even by high-throughput computations. Herein, we demonstrated a novel regressional generative adversarial network (RGAN) for inverse design of representative two-dimensional materials, graphene and boron-nitride (BN) hybrids. A significant novelty of the proposed RGAN is that it combines the supervised and regressional convolutional neural network (CNN) with the traditional unsupervised GAN, thus overcoming the common technical barrier in the traditional GANs, which cannot generate data associated with given continuous quantitative labels. The proposed RGAN enables to autonomously generate graphene/BN hybrids with any given bandgaps. Moreover, the generated structures exhibit high fidelity, yielding bandgaps within ~ 10% MAEF of the desired bandgaps as cross-validated by density functional theory (DFT) calculations. Further analysis by principle component analysis (PCA) and modified locally linear embedding (MLLE) methods on the latent features encoded by the regressor reveals that the generator has successfully generated structures that followed the statistical distribution of the real structures. It implies the possibility of the RGAN in recognizing physical rules hidden in the high-dimensional data. This new inverse design methodology would speed up the discovery and development of other 2D materials and beyond.

physics.comp-ph↗

Meta Reasoning over Knowledge Graphs

The ability to reason over learned knowledge is an innate ability for humans and humans can easily master new reasoning rules with only a few demonstrations. While most existing studies on knowledge graph (KG) reasoning assume enough training examples, we study the challenging and practical problem of few-shot knowledge graph reasoning under the paradigm of meta-learning. We propose a new meta learning framework that effectively utilizes the task-specific meta information such as local graph neighbors and reasoning paths in KGs. Specifically, we design a meta-encoder that encodes the meta information into task-specific initialization parameters for different tasks. This allows our reasoning module to have diverse starting points when learning to reason over different relations, which is expected to better fit the target task. On two few-shot knowledge base completion benchmarks, we show that the augmented task-specific meta-encoder yields much better initial point than MAML and outperforms several few-shot learning baselines.

cs.CL↗

Confinement Admits Chiral Symmetry Breaking via Bag

In this paper, it is pointed out for the first time that the linear effective potential between quarks is intrinsically relating to the bag model while concerning the asymptotically-free nature of colours. Based on the relationship we employ the symmetry method to analyze the quark-anti-quark system. For the tight bound system, one of the quark and anti-quark becomes the bag itself. By imposing the Poincare invariance on the quark-anti-quark bound-state, and translating the chiral transformation to its spatial manifestation, we can infer why the chiral symmetry breaking happens. Applying this knowledge to deep inelastic scattering we reach the conclusion that the measured proton spin in scattering experiments should be uncertain quantity.

physics.gen-ph↗

Partition of a Subset into Two Directed Cycles with Partial Degrees

Let $D=(V,A)$ be a directed graph of order $n\geq 6$. Let $W$ be a subset of $V$ with $|W|\geq 6$. Suppose that every vertex of $W$ has degree at least $(3n-3)/2$ in $D$. Then for any integer partition $|W|=n_1+n_2$ with $n_1\geq 3$ and $n_2\geq 3$, $D$ contains two disjoint directed cycles $C_1$ and $C_2$ such that $|V(C_1)\cap W|=n_1$ and $|V(C_2)\cap W|=n_2$. We conjecture that for any integer partition $|W|=n_1+n_2+\cdots +n_k$ with $k\geq 3$ and $n_i\geq 3(1\leq i\leq k)$, $D$ contains $k$ disjoint directed cycles $C_1,C_2,\ldots , C_k$ such that $|V(C_i)\cap W|=n_i$ for all $1\leq i\leq k$. The degree condition is sharp in general.

math.CO↗

Direct observations of chiral spin textures in van der Waals magnet Fe3GeTe2 nanolayers

In two-dimensional van der Waals (vdW) magnets, the presence of magnetic orders, strong spin-orbit coupling and asymmetry at interfaces is the key ingredient for hosting chiral spin textures. However, experimental evidences for chiral magnetism in vdW magnets remain elusive. Here we demonstrate unambiguously the formation of chiral spin textures in thin Fe3GeTe2 nanoflakes using advanced magnetic electron microscopy and first-principles calculations. Specifically, electron holography analyses reveal the spin configurations of Néel-type, zero-field-stabilized skyrmions in 20-nm-thick Fe3GeTe2 nanoflakes at cryogenic temperature. In situ Lorentz transmission electron microscopy measurements further provide detailed magnetic phase diagrams of chiral spin textures including spirals and skyrmions in Fe3GeTe2 as a function of temperature, applied magnetic field and specimen thickness. First-principles calculations unveil a finite interfacial Dzyaloshinskii-Moriya interaction in the Te/Fe3Ge/Te slabs that induces the spin chirality in Fe3GeTe2. Our discovery of spin chirality in the prototypical vdW Fe3GeTe2 opens up new opportunities for studying chiral magnetism in two-dimensional vdW magnets from both fundamental and applied perspectives.

cond-mat.mtrl-sci↗

TWEETQA: A Social Media Focused Question Answering Dataset

With social media becoming increasingly pop-ular on which lots of news and real-time eventsare reported, developing automated questionanswering systems is critical to the effective-ness of many applications that rely on real-time knowledge. While previous datasets haveconcentrated on question answering (QA) forformal text like news and Wikipedia, wepresent the first large-scale dataset for QA oversocial media data. To ensure that the tweetswe collected are useful, we only gather tweetsused by journalists to write news articles. Wethen ask human annotators to write questionsand answers upon these tweets. Unlike otherQA datasets like SQuAD in which the answersare extractive, we allow the answers to be ab-stractive. We show that two recently proposedneural models that perform well on formaltexts are limited in their performance when ap-plied to our dataset. In addition, even the fine-tuned BERT model is still lagging behind hu-man performance with a large margin. Our re-sults thus point to the need of improved QAsystems targeting social media text.

cs.CL↗

A fast method for variable-order space-fractional diffusion equations

We develop a fast divided-and-conquer indirect collocation method for the homogeneous Dirichlet boundary value problem of variable-order space-fractional diffusion equations. Due to the impact of the space-dependent variable order, the resulting stiffness matrix of the numerical approximation does not have a Toeplitz-like structure. In this paper we derive a fast approximation of the coefficient matrix by the means of a sum of Toeplitz matrices multiplied by diagonal matrices. We show that the approximation is asymptotically consistent with the original problem, which requires $O(kN\log^2 N)$ memory and $O(k N\log^3 N)$ computational complexity with $N$ and $k$ being the numbers of unknowns and the approximants, respectively. Numerical experiments are presented to demonstrate the effectiveness and the efficiency of the proposed method.

math.NA↗

Improving Branch Prediction By Modeling Global History with Convolutional Neural Networks

CPU branch prediction has hit a wall--existing techniques achieve near-perfect accuracy on 99% of static branches, and yet the mispredictions that remain hide major performance gains. In a companion report, we show that a primary source of mispredictions is a handful of systematically hard-to-predict branches (H2Ps), e.g. just 10 static instructions per SimPoint phase in SPECint 2017. The lost opportunity posed by these mispredictions is significant to the CPU: 14.0% in instructions-per-cycle (IPC) on Intel SkyLake and 37.4% IPC when the pipeline is scaled four-fold, on par with gains from process technology. However, up to 80% of this upside is unreachable by the best known branch predictors, even when afforded exponentially more resources. New approaches are needed, and machine learning (ML) provides a palette of powerful predictors. A growing body of work has shown that ML models are deployable within the microarchitecture to optimize hardware at runtime, and are one way to customize CPUs post-silicon by training to customer applications. We develop this scenario for branch prediction using convolutional neural networks (CNNs) to boost accuracy for H2Ps. Step-by-step, we (1) map CNNs to the global history data used by existing branch predictors; (2) show how CNNs improve H2P prediction in SPEC 2017; (3) adapt 2-bit CNN inference to the constraints of current branch prediction units; and (4) establish that CNN helper predictors are reusable across application executions on different inputs, enabling us to amortize offline training and deploy ML pattern matching to improve IPC.

cs.DC↗

Self-Supervised Learning for Contextualized Extractive Summarization

Existing models for extractive summarization are usually trained from scratch with a cross-entropy loss, which does not explicitly capture the global context at the document level. In this paper, we aim to improve this task by introducing three auxiliary pre-training tasks that learn to capture the document-level context in a self-supervised fashion. Experiments on the widely-used CNN/DM dataset validate the effectiveness of the proposed auxiliary tasks. Furthermore, we show that after pre-training, a clean model with simple building blocks is able to outperform previous state-of-the-art that are carefully designed.

cs.CL↗

Uniqueness of determining the variable fractional order in variable-order time-fractional diffusion equations

We study an initial-boundary value problem of variable-order time-fractional diffusion equations in one space dimension. Based on the wellposedness of the proposed model and the smoothing properties of its solutions, which are shown to be determined by the behavior of the variable order at the initial time, a uniqueness result for an important inverse problem of determination of the variable order in the time-fractional derivative contained in the proposed model from observations of its solutions is obtained.

math.AP↗

Regularity and projective dimension of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs

In this paper we provide some precise formulas for regularity of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs. For the projective dimension of such an edge ideal, we give its exact formula. Meanwhile, we also give the upper and lower bounds of projective dimension of higher power of such edge ideals. Some examples show that these formulas are related to direction selection.

math.AC↗