Searcharxiv⌕ Search

arXiv subjects

Jing Liu

Publications and source records attributed to Jing Liu.

At least 577 records · Page 32Linked to original sources

Generative Low-bitwidth Data Free Quantization

Neural network quantization is an effective way to compress deep models and improve their execution latency and energy efficiency, so that they can be deployed on mobile or embedded devices. Existing quantization methods require original data for calibration or fine-tuning to get better performance. However, in many real-world scenarios, the data may not be available due to confidential or private issues, thereby making existing quantization methods not applicable. Moreover, due to the absence of original data, the recently developed generative adversarial networks (GANs) cannot be applied to generate data. Although the full-precision model may contain rich data information, such information alone is hard to exploit for recovering the original data or generating new meaningful data. In this paper, we investigate a simple-yet-effective method called Generative Low-bitwidth Data Free Quantization (GDFQ) to remove the data dependence burden. Specifically, we propose a knowledge matching generator to produce meaningful fake data by exploiting classification boundary knowledge and distribution information in the pre-trained model. With the help of generated data, we can quantize a model by learning knowledge from the pre-trained model. Extensive experiments on three data sets demonstrate the effectiveness of our method. More critically, our method achieves much higher accuracy on 4-bit quantization than the existing data free quantization method. Code is available at https://github.com/xushoukai/GDFQ.

cs.CV↗

Prospect of undoped inorganic scintillators at 77 Kelvin for the detection of non-standard neutrino interactions at the Spallation Neutron Source

Investigated in this work are sensitivities to non-standard neutrino interactions (NSI) of a prototype detector placed about 20 meters away from the Spallation Neutron Source at the Oak Ridge National Laboratory in two years of data taking. The presumed prototype consists of 10 kg undoped CsI scintillation crystals directly coupled with SiPM arrays operated at 77 K. Compared to the COHERENT CsI(Na) detector, a much higher light yield is assumed for the prototype. An experiment with a cylindrical undoped CsI crystal coupled directly to a photomultiplier tube at about 77 K was conducted to verify the light yield assumption. A yield of $33.5 \pm 0.7$ photoelectrons per keV electron-equivalent (PE/keVee) was achieved in [13, 60] keVee, which is much closer to the relevant energy region for the NSI search than some of the early studies.

physics.ins-det↗

Electronic Evolution from the Parent Mott Insulator to a Superconductor in Lightly Hole-Doped Bi2Sr2CaCu2O8+delta

High temperature superconductivity in cuprates is realized by doping the Mott insulator with charge carriers. A central issue is how such an insulating state can evolve into a conducting or superconducting state when charge carriers are introduced. Here, by in situ vacuum annealing and Rb deposition on the Bi2Sr2Ca0.6Dy0.4Cu2O8+delta (Bi2212) sample surface to push its doping level continuously from deeply underdoped (Tc=25 K, doping level p-0.066) to the near zero doping parent Mott insulator, angle-resolved photoemission spectroscopy measurements are carried out to observe the detailed electronic structure evolution in lightly hole-doped region for the first time. Our results indicate that the chemical potential lies at about 1 eV above the charge transfer band for the parent state at zero doping which is quite close to the upper Hubbard band. With increasing hole doping, the chemical potential moves continuously towards the charge transfer band and the band structure evolution exhibits a rigid band shift-like behavior. When the chemical potential approaches the charge transfer band at a doping level of -0.05, the nodal spectral weight near the Fermi level increases, followed by the emergence of the coherent quasiparticle peak and the insulator-superconductor transition. Our observations provide key insights in understanding the insulator-superconductor transition in doping the parent cuprate compound and for establishing related theories.

cond-mat.supr-con↗

Not only Look, but also Listen: Learning Multimodal Violence Detection under Weak Supervision

Violence detection has been studied in computer vision for years. However, previous work are either superficial, e.g., classification of short-clips, and the single scenario, or undersupplied, e.g., the single modality, and hand-crafted features based multimodality. To address this problem, in this work we first release a large-scale and multi-scene dataset named XD-Violence with a total duration of 217 hours, containing 4754 untrimmed videos with audio signals and weak labels. Then we propose a neural network containing three parallel branches to capture different relations among video snippets and integrate features, where holistic branch captures long-range dependencies using similarity prior, localized branch captures local positional relation using proximity prior, and score branch dynamically captures the closeness of predicted score. Besides, our method also includes an approximator to meet the needs of online detection. Our method outperforms other state-of-the-art methods on our released dataset and other existing benchmark. Moreover, extensive experimental results also show the positive effect of multimodal (audio-visual) input and modeling relationships. The code and dataset will be released in https://roc-ng.github.io/XD-Violence/.

cs.CV↗

Vatex Video Captioning Challenge 2020: Multi-View Features and Hybrid Reward Strategies for Video Captioning

This report describes our solution for the VATEX Captioning Challenge 2020, which requires generating descriptions for the videos in both English and Chinese languages. We identified three crucial factors that improve the performance, namely: multi-view features, hybrid reward, and diverse ensemble. Based on our method of VATEX 2019 challenge, we achieved significant improvements this year with more advanced model architectures, combination of appearance and motion features, and careful hyper-parameters tuning. Our method achieves very competitive results on both of the Chinese and English video captioning tracks.

cs.CV↗

NROWAN-DQN: A Stable Noisy Network with Noise Reduction and Online Weight Adjustment for Exploration

Deep reinforcement learning has been applied more and more widely nowadays, especially in various complex control tasks. Effective exploration for noisy networks is one of the most important issues in deep reinforcement learning. Noisy networks tend to produce stable outputs for agents. However, this tendency is not always enough to find a stable policy for an agent, which decreases efficiency and stability during the learning process. Based on NoisyNets, this paper proposes an algorithm called NROWAN-DQN, i.e., Noise Reduction and Online Weight Adjustment NoisyNet-DQN. Firstly, we develop a novel noise reduction method for NoisyNet-DQN to make the agent perform stable actions. Secondly, we design an online weight adjustment strategy for noise reduction, which improves stable performance and gets higher scores for the agent. Finally, we evaluate this algorithm in four standard domains and analyze properties of hyper-parameters. Our results show that NROWAN-DQN outperforms prior algorithms in all these domains. In addition, NROWAN-DQN also shows better stability. The variance of the NROWAN-DQN score is significantly reduced, especially in some action-sensitive environments. This means that in some environments where high stability is required, NROWAN-DQN will be more appropriate than NoisyNets-DQN.

cs.LG↗

NTIRE 2020 Challenge on Video Quality Mapping: Methods and Results

This paper reviews the NTIRE 2020 challenge on video quality mapping (VQM), which addresses the issues of quality mapping from source video domain to target video domain. The challenge includes both a supervised track (track 1) and a weakly-supervised track (track 2) for two benchmark datasets. In particular, track 1 offers a new Internet video benchmark, requiring algorithms to learn the map from more compressed videos to less compressed videos in a supervised training manner. In track 2, algorithms are required to learn the quality mapping from one device to another when their quality varies substantially and weakly-aligned video pairs are available. For track 1, in total 7 teams competed in the final test phase, demonstrating novel and effective solutions to the problem. For track 2, some existing methods are evaluated, showing promising solutions to the weakly-supervised video quality mapping problem.

eess.IV↗

Load-balanced Service Function Chaining in Edge Computing over FiWi Access Networks for Internet of Things

Service function chaining (SFC) is promising to implement flexible and scalable virtual network infrastructure for the Internet of Things (IoT). Edge computing is envisioned to be an effective solution to process huge amount of IoT application data. In order to uniformly provide services to IoT applications among the distributed edge computing nodes (ECNs), we present a unified SFC orchestration framework based on the coordination of SDN and NFV, which provides a synergic edge cloud platform by exploiting the connectivity of FiWi access networks. In addition, we study the VNF deployment problem under our synergic framework, and we formulate it as a mixed-integer nonlinear programming (MINLP) problem jointly considering the load balancing of networking and computing for chaining VNFs. We also propose two approximation optimal deployment algorithms named Greedy-Bisection Multi-Path (GBMP) and KSP MultiPath (KSMP) taking advantage of the multi-instance virtual network functions (VNFs) deployed in ECNs and the multipath capacity in FiWi access networks. Extensive simulations are conducted in two types of IoT application scenarios in the EC over FiWi access networks. The numerical results show that our proposed algorithms are superior to single path and ECMP based deployment algorithms in terms of load balancing, service acceptance ratio, and network utilization in both two typical scenarios.

cs.NI↗

Topologically different spin disorder phases of the J1-J2 Heisenberg model on the honeycomb lattice

Searching for spin liquids on the honeycomb J1-J2 Heisenberg model has been attracting great attention in the past decade. In this Paper we investigate the topological properties of the J1-J2 Heisenberg model by introducing nearest-neighbour and next-nearest-neighbour bond parameters. We find that there exist two topologically different phases in the spin disordered regime 0.2 0.32, it is a pi-flux chiral spin liquid, which is topological nontrivial and gapped. These results suggest that there exist two topologically different spin disorder phases in honeycomb J1-J2 Heisenberg model.

cond-mat.str-el↗

Operational definition of a quantum speed limit

The quantum speed limit is a fundamental concept in quantum mechanics, which aims at finding the minimum time scale or the maximum dynamical speed for some fixed targets. In a large number of studies in this field, the construction of valid bounds for the evolution time is always the core mission, yet the physics behind it and some fundamental questions like which states can really fulfill the target, are ignored. Understanding the physics behind the bounds is at least as important as constructing attainable bounds. Here we provide an operational approach for the definition of the quantum speed limit, which utilizes the set of states that can fulfill the target to define the speed limit. Its performances in various scenarios have been investigated. For time-independent Hamiltonians, it is inverse-proportional to the difference between the highest and lowest energies. The fact that its attainability does not require a zero ground-state energy suggests it can be used as an indicator of quantum phase transitions. For time-dependent Hamiltonians, it is shown that contrary to the results given by existing bounds, the true speed limit should be independent of the time. Moreover, in the case of spontaneous emission, we find a counterintuitive phenomenon that a lousy purity can benefit the reduction of the quantum speed limit.

quant-ph↗

Primordial black holes and gravitational waves from parametric amplification of curvature perturbations

We investigate a new mechanism to create large curvature perturbations on small scales due to parameter resonance in a single-field inflationary model with a small periodic structure upon the potential. After reentering the horizon, the amplified curvature perturbations can lead to observable primordial black holes as well as stochastic gravitational waves. The mass of primordial black holes and frequency of the induced gravitational waves depend on the model parameters. The resulted primordial black hole could constitute all dark matter or a fraction of dark matter in the universe, and corresponding stochastic gravitational waves fall in the frequency band measurable for the pulsar timing array and the space-based gravitational wave detectors.

astro-ph.CO↗

Prospect of undoped inorganic crystals at 77 Kelvin for low-mass dark matter search at Spallation Neutron Source

Investigated in this work were sensitivities of a prototype detector for the detection of low-mass dark matter particles produced at the Spallation Neutron Source at the Oak Ridge National Laboratory in two years of data taking. The presumed prototype consisted of 10 kg undoped CsI or NaI scintillation crystals directly coupled with SiPM arrays operated at 77 K. Compared to the COHERENT CsI(Na) detector, a much higher light yield was assumed for the prototype. An experiment with a cylindrical 1~kg undoped CsI crystal coupled directly to two photomultiplier tubes at about 77~K was conducted as the first step to verify the idea. A light yield of $26.0 \pm 0.4$ photoelectrons per keV electron-equivalent was achieved. This eliminated the concern of self light absorption in large crystals raised in some of the early studies.

physics.ins-det↗

Non-Autoregressive Image Captioning with Counterfactuals-Critical Multi-Agent Learning

Most image captioning models are autoregressive, i.e. they generate each word by conditioning on previously generated words, which leads to heavy latency during inference. Recently, non-autoregressive decoding has been proposed in machine translation to speed up the inference time by generating all words in parallel. Typically, these models use the word-level cross-entropy loss to optimize each word independently. However, such a learning process fails to consider the sentence-level consistency, thus resulting in inferior generation quality of these non-autoregressive models. In this paper, we propose a Non-Autoregressive Image Captioning (NAIC) model with a novel training paradigm: Counterfactuals-critical Multi-Agent Learning (CMAL). CMAL formulates NAIC as a multi-agent reinforcement learning system where positions in the target sequence are viewed as agents that learn to cooperatively maximize a sentence-level reward. Besides, we propose to utilize massive unlabeled images to boost captioning performance. Extensive experiments on MSCOCO image captioning benchmark show that our NAIC model achieves a performance comparable to state-of-the-art autoregressive models, while brings 13.9x decoding speedup.

cs.CL↗

NTIRE 2020 Challenge on NonHomogeneous Dehazing

This paper reviews the NTIRE 2020 Challenge on NonHomogeneous Dehazing of images (restoration of rich details in hazy image). We focus on the proposed solutions and their results evaluated on NH-Haze, a novel dataset consisting of 55 pairs of real haze free and nonhomogeneous hazy images recorded outdoor. NH-Haze is the first realistic nonhomogeneous haze dataset that provides ground truth images. The nonhomogeneous haze has been produced using a professional haze generator that imitates the real conditions of haze scenes. 168 participants registered in the challenge and 27 teams competed in the final testing phase. The proposed solutions gauge the state-of-the-art in image dehazing.

cs.CV↗

NTIRE 2020 Challenge on Perceptual Extreme Super-Resolution: Methods and Results

This paper reviews the NTIRE 2020 challenge on perceptual extreme super-resolution with focus on proposed solutions and results. The challenge task was to super-resolve an input image with a magnification factor 16 based on a set of prior examples of low and corresponding high resolution images. The goal is to obtain a network design capable to produce high resolution results with the best perceptual quality and similar to the ground truth. The track had 280 registered participants, and 19 teams submitted the final results. They gauge the state-of-the-art in single image super-resolution.

eess.IV↗

Reconciling the X(2240) with the Y(2175)

In the present work, we reanalyzed the cross sections for $e^+ e^- \to K^+K^-$, where a new structure $X(2240)$ was reported by BES III Collaboration. By including the interference between the direct coupling and vector meson intermediate processes, we find the mass and width of $X(2240)$ are $2197.4\pm 4.4$ MeV and $75.6\pm 7.2 $ MeV, respectively, which are well consistent with the PDG average values of the resonance parameters for $Y(2175)$, thus, we conclude that the $X(2240)$ should be the same state as the $Y(2175)$.

hep-ph↗

Gumbel-softmax-based Optimization: A Simple General Framework for Optimization Problems on Graphs

In computer science, there exist a large number of optimization problems defined on graphs, that is to find a best node state configuration or a network structure such that the designed objective function is optimized under some constraints. However, these problems are notorious for their hardness to solve because most of them are NP-hard or NP-complete. Although traditional general methods such as simulated annealing (SA), genetic algorithms (GA) and so forth have been devised to these hard problems, their accuracy and time consumption are not satisfying in practice. In this work, we proposed a simple, fast, and general algorithm framework based on advanced automatic differentiation technique empowered by deep learning frameworks. By introducing Gumbel-softmax technique, we can optimize the objective function directly by gradient descent algorithm regardless of the discrete nature of variables. We also introduce evolution strategy to parallel version of our algorithm. We test our algorithm on three representative optimization problems on graph including modularity optimization from network science, Sherrington-Kirkpatrick (SK) model from statistical physics, maximum independent set (MIS) and minimum vertex cover (MVC) problem from combinatorial optimization on graph. High-quality solutions can be obtained with much less time consuming compared to traditional approaches.

cs.LG↗

CoKE: Contextualized Knowledge Graph Embedding

Knowledge graph embedding, which projects symbolic entities and relations into continuous vector spaces, is gaining increasing attention. Previous methods allow a single static embedding for each entity or relation, ignoring their intrinsic contextual nature, i.e., entities and relations may appear in different graph contexts, and accordingly, exhibit different properties. This work presents Contextualized Knowledge Graph Embedding (CoKE), a novel paradigm that takes into account such contextual nature, and learns dynamic, flexible, and fully contextualized entity and relation embeddings. Two types of graph contexts are studied: edges and paths, both formulated as sequences of entities and relations. CoKE takes a sequence as input and uses a Transformer encoder to obtain contextualized representations. These representations are hence naturally adaptive to the input, capturing contextual meanings of entities and relations therein. Evaluation on a wide variety of public benchmarks verifies the superiority of CoKE in link prediction and path query answering. It performs consistently better than, or at least equally well as current state-of-the-art in almost every case, in particular offering an absolute improvement of 21.0% in H@10 on path query answering. Our code is available at \url{https://github.com/PaddlePaddle/Research/tree/master/KG/CoKE}.

cs.AI↗