arXiv subjects

Dong Wang

Publications and source records attributed to Dong Wang.

At least 649 records · Page 36Linked to original sources

arXiv2019

An Online Reinforcement Learning Approach to Quality-Cost-Aware Task Allocation for Multi-Attribute Social Sensing

Social sensing has emerged as a new sensing paradigm where humans (or devices on their behalf) collectively report measurements about the physical world. This paper focuses on a quality-cost-aware task allocation problem in multi-attribute social sensing applications. The goal is to identify a task allocation strategy (i.e., decide when and where to collect sensing data) to achieve an optimized tradeoff between the data quality and the sensing cost. While recent progress has been made to tackle similar problems, three important challenges have not been well addressed: (i) "online task allocation": the task allocation schemes need to respond quickly to the potentially large dynamics of the measured variables in social sensing; (ii) "multi-attribute constrained optimization": minimizing the overall sensing error given the dependencies and constraints of multiple attributes of the measured variables is a non-trivial problem to solve; (iii) "nonuniform task allocation cost": the task allocation cost in social sensing often has a nonuniform distribution which adds additional complexity to the optimized task allocation problem. This paper develops a Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme to address the above challenges using a principled online reinforcement learning framework. We evaluate the QCO-TA scheme through a real-world social sensing application and the results show that our scheme significantly outperforms the state-of-the-art baselines in terms of both sensing accuracy and cost.

cs.LG↗

arXiv2019

Poster Abstract: A Dynamic Data-Driven Prediction Model for Sparse Collaborative Sensing Applications

A fundamental problem in collaborative sensing lies in providing an accurate prediction of critical events (e.g., hazardous environmental condition, urban abnormalities, economic trends). However, due to the resource constraints, collaborative sensing applications normally only collect measurements from a subset of physical locations and predict the measurements for the rest of locations. This problem is referred to as sparse collaborative sensing prediction. In this poster, we present a novel closed-loop prediction model by leveraging topic modeling and online learning techniques. We evaluate our scheme using a real-world collaborative sensing dataset. The initial results show that our proposed scheme outperforms the state-of-the-art baselines.

eess.SP↗

arXiv2019

'Skimming-Perusal' Tracking: A Framework for Real-Time and Robust Long-term Tracking

Compared with traditional short-term tracking, long-term tracking poses more challenges and is much closer to realistic applications. However, few works have been done and their performance have also been limited. In this work, we present a novel robust and real-time long-term tracking framework based on the proposed skimming and perusal modules. The perusal module consists of an effective bounding box regressor to generate a series of candidate proposals and a robust target verifier to infer the optimal candidate with its confidence score. Based on this score, our tracker determines whether the tracked object being present or absent, and then chooses the tracking strategies of local search or global search respectively in the next frame. To speed up the image-wide global search, a novel skimming module is designed to efficiently choose the most possible regions from a large number of sliding windows. Numerous experimental results on the VOT-2018 long-term and OxUvA long-term benchmarks demonstrate that the proposed method achieves the best performance and runs in real-time. The source codes are available at https://github.com/iiau-tracker/SPLT.

cs.CV↗

arXiv2019

AP19-OLR Challenge: Three Tasks and Their Baselines

This paper introduces the fourth oriental language recognition (OLR) challenge AP19-OLR, including the data profile, the tasks and the evaluation principles. The OLR challenge has been held successfully for three consecutive years, along with APSIPA Annual Summit and Conference (APSIPA ASC). The challenge this year still focuses on practical and challenging tasks, precisely (1) short-utterance LID, (2) cross-channel LID and (3) zero-resource LID. The event this year includes more languages and more real-life data provided by SpeechOcean and the NSFC M2ASR project. All the data is free for participants. Recipes for x-vector system and back-end evaluation are also conducted as baselines for the three tasks. The participants can refer to these online-published recipes to deploy LID systems for convenience. We report the baseline results on the three tasks and demonstrate that the three tasks are worth some efforts to achieve better performance.

eess.AS↗

arXiv2019

Inequality relation between entanglement and Bell nonlocality for arbitrary two-qubit states

Entanglement and Bell nonlocality are used to describe quantum inseparabilities. Bell-nonlocal states form a strict subset of entangled states. A natural question arises concerning how much territory Bell nonlocality occupies entanglement for a general two-qubit entangled state. In this work, we investigate the relation between entanglement and Bell nonlocality by using lots of randomly generated two-qubit states, and give out a constraint inequality relation between the two quantum resources. For studying the upper or lower boundary of the inequality relation, we discover maximally (minimally) nonlocal entangled states, which maximize (minimize) the value of the Bell nonlocality for a given value of the entanglement. Futhermore, we consider a special kind of mixed state transformed by performing an arbitrary unitary operation on werner state. It is found that the special mixed state's entanglement and Bell nonlocality are related to ones of a pure state transformed by the unitary operation performed on the Bell state.

quant-ph↗

arXiv2019

VAE-based Domain Adaptation for Speaker Verification

Deep speaker embedding has achieved satisfactory performance in speaker verification. By enforcing the neural model to discriminate the speakers in the training set, deep speaker embedding (called `x-vectors`) can be derived from the hidden layers. Despite its good performance, the present embedding model is highly domain sensitive, which means that it often works well in domains whose acoustic condition matches that of the training data (in-domain), but degrades in mismatched domains (out-of-domain). In this paper, we present a domain adaptation approach based on Variational Auto-Encoder (VAE). This model transforms x-vectors to a regularized latent space; within this latent space, a small amount of data from the target domain is sufficient to accomplish the adaptation. Our experiments demonstrated that by this VAE-adaptation approach, speaker embeddings can be easily transformed to the target domain, leading to noticeable performance improvement.

eess.AS↗

arXiv2019

Quantum-memory-assisted entropic uncertainty relations

Uncertainty relations take a crucial and fundamental part in the frame of quantum theory, and are bringing on many marvelous applications in the emerging field of quantum information sciences. Especially, as entropy is imposed into the uncertainty principle, entropy-based uncertainty relations lead to a number of applications including quantum key distribution, entanglement witness, quantum steering, quantum metrology, and quantum teleportation. Herein, the history of the development of the uncertainty relations is discussed, especially focusing on the recent progress with regard to quantum-memory-assisted entropic uncertainty relations and dynamical characteristics of the measured uncertainty in some explicit physical systems. The aims are to help deepen the understanding of entropic uncertainty relations and prompt further explorations for versatile applications of the relations on achieving practical quantum tasks.

quant-ph↗

arXiv2019

Noninvasive super-resolution imaging through scattering media

Super-resolution imaging with advanced optical systems has been revolutionizing technical analysis in various fields from biological to physical sciences. However, many objects are hidden by strongly scattering media such as rough wall corners or biological tissues that scramble light paths, create speckle patterns and hinder object's visualization, let alone super-resolution imaging. Here, we realize a method to do non-invasive super-resolution imaging through scattering media based on stochastic optical scattering localization imaging (SOSLI) technique. Simply by capturing multiple speckle patterns of photo-switchable emitters in our demonstration, the stochastic approach utilizes the speckle correlation properties of scattering media to retrieve an image with more than five-fold resolution enhancement compared to the diffraction limit, while posing no fundamental limit in achieving higher spatial resolution. More importantly, we demonstrate our SOSLI to do non-invasive super-resolution imaging through not only optical diffusers, i.e. static scattering media, but also biological tissues, i.e. dynamic scattering media with decorrelation of up to 80%. Our approach paves the way to non-invasively visualize various samples behind scattering media at unprecedented levels of detail.

physics.optics↗

arXiv2019

signADAM: Learning Confidences for Deep Neural Networks

In this paper, we propose a new first-order gradient-based algorithm to train deep neural networks. We first introduce the sign operation of stochastic gradients (as in sign-based methods, e.g., SIGN-SGD) into ADAM, which is called as signADAM. Moreover, in order to make the rate of fitting each feature closer, we define a confidence function to distinguish different components of gradients and apply it to our algorithm. It can generate more sparse gradients than existing algorithms do. We call this new algorithm signADAM++. In particular, both our algorithms are easy to implement and can speed up training of various deep neural networks. The motivation of signADAM++ is preferably learning features from the most different samples by updating large and useful gradients regardless of useless information in stochastic gradients. We also establish theoretical convergence guarantees for our algorithms. Empirical results on various datasets and models show that our algorithms yield much better performance than many state-of-the-art algorithms including SIGN-SGD, SIGNUM and ADAM. We also analyze the performance from multiple perspectives including the loss landscape and develop an adaptive method to further improve generalization. The source code is available at https://github.com/DongWanginxdu/signADAM-Learn-by-Confidence.

cs.CV↗

arXiv2019

Towards Reliable Online Clickbait Video Detection: A Content-Agnostic Approach

Online video sharing platforms (e.g., YouTube, Vimeo) have become an increasingly popular paradigm for people to consume video contents. Clickbait video, whose content clearly deviates from its title/thumbnail, has emerged as a critical problem on online video sharing platforms. Current clickbait detection solutions that mainly focus on analyzing the text of the title, the image of the thumbnail, or the content of the video are shown to be suboptimal in detecting the online clickbait videos. In this paper, we develop a novel content-agnostic scheme, Online Video Clickbait Protector (OVCP), to effectively detect clickbait videos by exploring the comments from the audience who watched the video. Different from existing solutions, OVCP does not directly analyze the content of the video and its pre-click information (e.g., title and thumbnail). Therefore, it is robust against sophisticated content creators who often generate clickbait videos that can bypass the current clickbait detectors. We evaluate OVCP with a real-world dataset collected from YouTube. Experimental results demonstrate that OVCP is effective in identifying clickbait videos and significantly outperforms both state-of-the-art baseline models and human annotators.

cs.SI↗

arXiv2019

C^3 Framework: An Open-source PyTorch Code for Crowd Counting

This technical report attempts to provide efficient and solid kits addressed on the field of crowd counting, which is denoted as Crowd Counting Code Framework (C$^3$F). The contributions of C$^3$F are in three folds: 1) Some solid baseline networks are presented, which have achieved the state-of-the-arts. 2) Some flexible parameter setting strategies are provided to further promote the performance. 3) A powerful log system is developed to record the experiment process, which can enhance the reproducibility of each experiment. Our code is made publicly available at \url{https://github.com/gjy3035/C-3-Framework}. Furthermore, we also post a Chinese blog\footnote{\url{https://zhuanlan.zhihu.com/p/65650998}} to describe the details and insights of crowd counting.

cs.CV↗

arXiv2019

LMVP: Video Predictor with Leaked Motion Information

We propose a Leaked Motion Video Predictor (LMVP) to predict future frames by capturing the spatial and temporal dependencies from given inputs. The motion is modeled by a newly proposed component, motion guider, which plays the role of both learner and teacher. Specifically, it {\em learns} the temporal features from real data and {\em guides} the generator to predict future frames. The spatial consistency in video is modeled by an adaptive filtering network. To further ensure the spatio-temporal consistency of the prediction, a discriminator is also adopted to distinguish the real and generated frames. Further, the discriminator leaks information to the motion guider and the generator to help the learning of motion. The proposed LMVP can effectively learn the static and temporal features in videos without the need for human labeling. Experiments on synthetic and real data demonstrate that LMVP can yield state-of-the-art results.

cs.CV↗

arXiv2019

A One-step Pruning-recovery Framework for Acceleration of Convolutional Neural Networks

Acceleration of convolutional neural network has received increasing attention during the past several years. Among various acceleration techniques, filter pruning has its inherent merit by effectively reducing the number of convolution filters. However, most filter pruning methods resort to tedious and time-consuming layer-by-layer pruning-recovery strategy to avoid a significant drop of accuracy. In this paper, we present an efficient filter pruning framework to solve this problem. Our method accelerates the network in one-step pruning-recovery manner with a novel optimization objective function, which achieves higher accuracy with much less cost compared with existing pruning methods. Furthermore, our method allows network compression with global filter pruning. Given a global pruning rate, it can adaptively determine the pruning rate for each single convolutional layer, while these rates are often set as hyper-parameters in previous approaches. Evaluated on VGG-16 and ResNet-50 using ImageNet, our approach outperforms several state-of-the-art methods with less accuracy drop under the same and even much fewer floating-point operations (FLOPs).

cs.CV↗

arXiv2019

Interface dynamics for an Allen-Cahn-type equation governing a matrix-valued field

We consider the initial value problem for the generalized Allen-Cahn equation, \[\partial_t Φ= ΔΦ-\varepsilon^{-2} Φ(Φ^t Φ- I), \qquad x \in Ω, \ t\geq 0,\] where $Φ$ is an $n\times n$ real matrix-valued field, $Ω$ is a two-dimensional square with periodic boundary conditions, and $\varepsilon > 0$. This equation is the gradient flow for the energy, $E(Φ) := \int \frac{1}{2} \|\nabla Φ\|^2_F+\frac{1}{4 \varepsilon^2} \| Φ^t Φ- I \|^2_F$, where $\| \cdot \|_F$ denotes the Frobenius norm. The primary contribution of this paper is to use asymptotic methods to describe the solution of this initial value problem. If the initial condition has single-signed determinant, at each point of the domain, at a fast $O(\varepsilon^{-2} t)$ time scale, the solution evolves towards the closest orthogonal matrix. Then, at the $O(t)$ time scale, the solution evolves according to the $O_n$ diffusion equation. Stationary solutions to the $O_n$ diffusion equation are analyzed for $n=2$. If the initial condition has regions where the determinant is positive and negative, a free interface develops. Away from the interface, in each region, the matrix-valued field behaves as in the single-signed determinant case. At the $O(t)$ time scale, the interface evolves in the normal direction by curvature. At a slow $O(\varepsilon t)$ time scale, the interface is driven by curvature and the surface diffusion of the matrix-valued field. For $n=2$, the interface is driven by curvature and the jump in the squared tangental derivative of the phase across the interface. In particular, we emphasize that the interface when $n\geq 2$ is driven by surface diffusion, while for $n=1$, the original Allen--Cahn equation, the interface is only driven by mean curvature. A variety of numerical experiments are performed to verify, support, and illustrate our analytical results.

math.AP↗

arXiv2019

A Preliminary Study on Data Augmentation of Deep Learning for Image Classification

Deep learning models have a large number of freeparameters that need to be calculated by effective trainingof the models on a great deal of training data to improvetheir generalization performance. However, data obtaining andlabeling is expensive in practice. Data augmentation is one of themethods to alleviate this problem. In this paper, we conduct apreliminary study on how three variables (augmentation method,augmentation rate and size of basic dataset per label) can affectthe accuracy of deep learning for image classification. The studyprovides some guidelines: (1) it is better to use transformationsthat alter the geometry of the images rather than those justlighting and color. (2) 2-3 times augmentation rate is good enoughfor training. (3) the smaller amount of data, the more obviouscontributions could have.

cs.CV↗

arXiv2019

Exploiting Persona Information for Diverse Generation of Conversational Responses

In human conversations, due to their personalities in mind, people can easily carry out and maintain the conversations. Giving conversational context with persona information to a chatbot, how to exploit the information to generate diverse and sustainable conversations is still a non-trivial task. Previous work on persona-based conversational models successfully make use of predefined persona information and have shown great promise in delivering more realistic responses. And they all learn with the assumption that given a source input, there is only one target response. However, in human conversations, there are massive appropriate responses to a given input message. In this paper, we propose a memory-augmented architecture to exploit persona information from context and incorporate a conditional variational autoencoder model together to generate diverse and sustainable conversations. We evaluate the proposed model on a benchmark persona-chat dataset. Both automatic and human evaluations show that our model can deliver more diverse and more engaging persona-based responses than baseline approaches.

cs.AI↗

arXiv2019

When Social Sensing Meets Edge Computing: Vision and Challenges

This paper overviews the state of the art, research challenges, and future opportunities in an emerging research direction: Social Sensing based Edge Computing (SSEC). Social sensing has emerged as a new sensing application paradigm where measurements about the physical world are collected from humans or from devices on their behalf. The advent of edge computing pushes the frontier of computation, service, and data along the cloud-to-things continuum. The merging of these two technical trends generates a set of new research challenges that need to be addressed. In this paper, we first define the new SSEC paradigm that is motivated by a few underlying technology trends. We then present a few representative real-world case studies of SSEC applications and several key research challenges that exist in those applications. Finally, we envision a few exciting research directions in future SSEC. We hope this paper will stimulate discussions of this emerging research direction in the community.

cs.HC↗

arXiv2019

Experimental investigation of nonlocal advantage of quantum coherence

Nonlocal advantage of quantum coherence (NAQC) based on coherence complementarity relations is generally viewed as a stronger nonclassical correlation than Bell nonlocality. An arbitrary two-qubit state with NAQC must be an entangled state, which demonstrates that the criterion of NAQC can also be regarded as an entanglement witness. In this paper, we experimentally investigate the NAQC for Bell-diagonal states with high fidelity in an optics-based platform. We perform local measurements on a subsystem in three mutually unbiased bases and reconstruct the density matrices of the measured states by quantum state tomography process. By analyzing characteristic of the $l_1$ norm, relative entropy and skew information of coherence with parameters of quantum states, NAQC for the quantum states is accurately captured, and it shows that our experimental results are well compatible with the theoretical predictions. It is worth mentioning that quantum states with NAQC would have higher entanglement, and thus NAQC could be expected to be a kind of useful physical resource for quantum information processing.

quant-ph↗