Searcharxiv⌕ Search

arXiv subjects

Liang Zhang

Publications and source records attributed to Liang Zhang.

At least 415 records · Page 23Linked to original sources
arXiv2018

Observation of Mollow triplet with metastability exchange collisions in 3He atoms

We study the dressed states of 3He atoms and experimentally observe the Mollow triplet (MT) induced with an ultra-low-frequency (ULF) oscillating magnetic field as low as 4 Hz. The ULF MT signatures from the ground states of 3He atoms are transferred to the metastable states by metastability-exchange collisions (MECs) and measured optically, which demonstrates 2 s coherence time in the dressed ground states. The result shows the possibility of ULF magnetic field amplitude measurement and a new scheme for optical frequency modulation.

quant-ph↗
arXiv2018

17,000 %/W Second Harmonic Conversion Efficiency in Single Crystalline Aluminum Nitride Microresonators

High quality factor optical microcavities have been employed in a variety of material systems to enhance nonlinear optical interactions. While single-crystalline aluminum nitride microresonators have recently emerged as a low loss platform for integrated nonlinear optics such as four wave mixing and Raman lasing, few studies have investigated this material for second-harmonic generation. In this Letter, we demonstrate an optimized fabrication of dually-resonant phase-matched ring resonators from epitaxial aluminum nitride thin films. An unprecendented second-harmonic generation efficiency of 17,000%/W is obtained in the low power regime and pump depletion is observed at a relatively low input power of 3.5 mW. This poses epitaxial aluminum nitride as the highest efficiency second-harmonic generator among current integrated platforms.

physics.optics↗
arXiv2018

Doubly Robust Sure Screening for Elliptical Copula Regression Model

Regression analysis has always been a hot research topic in statistics. We propose a very flexible semi-parametric regression model called Elliptical Copula Regression (ECR) model, which covers a large class of linear and nonlinear regression models such as additive regression model,single index model. Besides, ECR model can capture the heavy-tail characteristic and tail dependence between variables, thus it could be widely applied in many areas such as econometrics and finance. In this paper we mainly focus on the feature screening problem for ECR model in ultra-high dimensional setting. We propose a doubly robust sure screening procedure for ECR model, in which two types of correlation coefficient are involved: Kendall tau correlation and Canonical correlation. Theoretical analysis shows that the procedure enjoys sure screening property, i.e., with probability tending to 1, the screening procedure selects out all important variables and substantially reduces the dimensionality to a moderate size against the sample size. Thorough numerical studies are conducted to illustrate its advantage over existing sure independence screening methods and thus it can be used as a safe replacement of the existing procedures in practice. At last, the proposed procedure is applied on a gene-expression real data set to show its empirical usefulness.

stat.ME↗
arXiv2018

Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learning

Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services. The vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy. In this paper, we propose a novel recommender system with the capability of continuously improving its strategies during the interactions with users. We model the sequential interactions between users and a recommender system as a Markov Decision Process (MDP) and leverage Reinforcement Learning (RL) to automatically learn the optimal strategies via recommending trial-and-error items and receiving reinforcements of these items from users' feedback. Users' feedback can be positive and negative and both types of feedback have great potentials to boost recommendations. However, the number of negative feedback is much larger than that of positive one; thus incorporating them simultaneously is challenging since positive feedback could be buried by negative one. In this paper, we develop a novel approach to incorporate them into the proposed deep recommender system (DEERS) framework. The experimental results based on real-world e-commerce data demonstrate the effectiveness of the proposed framework. Further experiments have been conducted to understand the importance of both positive and negative feedback in recommendations.

cs.IR↗
arXiv2018

Deep Reinforcement Learning for Page-wise Recommendations

Recommender systems can mitigate the information overload problem by suggesting users' personalized items. In real-world recommendations such as e-commerce, a typical interaction between the system and its users is -- users are recommended a page of items and provide feedback; and then the system recommends a new page of items. To effectively capture such interaction for recommendations, we need to solve two key problems -- (1) how to update recommending strategy according to user's \textit{real-time feedback}, and 2) how to generate a page of items with proper display, which pose tremendous challenges to traditional recommender systems. In this paper, we study the problem of page-wise recommendations aiming to address aforementioned two challenges simultaneously. In particular, we propose a principled approach to jointly generate a set of complementary items and the corresponding strategy to display them in a 2-D page; and propose a novel page-wise recommendation framework based on deep reinforcement learning, DeepPage, which can optimize a page of items with proper display based on real-time feedback from users. The experimental results based on a real-world e-commerce dataset demonstrate the effectiveness of the proposed framework.

cs.IR↗
arXiv2018

Swift Observations of the bright uncatalogued X-ray transient MAXI J1535-571

The black hole candidate MAXI J1535-571 is a recently discovered X-ray transient. We report on the monitoring observations of Swift Gamma-Ray Burst Mission during outburst. The source transits from the hard state to the intermediate state, and reaches the soft state; near the end of the outburst, it returns to the hard state passing through the low intermediate state, following a typical Q-shaped loop in the hardness-intensity diagram. During the high intermediate state, detailed spectral analyses using a multi-temperature disk model reveal that the disk luminosity is flatter than the inner disk temperature to the fourth power, and the disk temperature profile varies as the disk radius raised to the power of -0.5, consistent with the behavior of a slim disk, implying that the disk structure has been modified due to the high luminosity of ~ 10^{39} erg/s. Meanwhile, the column density increases with the Eddington ratio, suggesting that the outflow matters are driven by radiation pressure due to the high accretion rate.

astro-ph.HE↗
arXiv2018

Time-delay signature concealed broadband gain-coupled chaotic laser with fiber random grating induced distributed feedback

A broadband chaotic laser with a flat power spectrum extending up to 8.5GHz is achieved by injecting continuous wave laser light into a chaotic diode laser perturbed by fiber random grating induced distributed feedback, which forms a gain-coupled chaotic laser system. More than triple bandwidth enhancement is realized with appropriate frequency detuning between the master and slave lasers. Unlike normal chaotic lasers, the output from such a broadband chaotic laser is free from time-delay signature, which can be applied for practical real-time random number generations and will find useful applications in the fields of information security and computation systems.

physics.optics↗
arXiv2018

Ultra-high-Q UV microring resonators based on single-crystalline AlN platform

Development of low-loss photonic components in the ultraviolet (UV) band will open new prospects for classical and quantum optics. Compared with other integrated platforms, aluminum nitride (AlN) is particularly attractive as it features an enormous bandgap of ~6.2 eV and intrinsic chi(2) and chi(3) susceptibilities. In this work, we demonstrate a record quality factor of 2.1 x 105 (optical loss ~ 8 dB/cm) at 390 nm based on single-crystalline AlN microrings. The low-loss AlN UV waveguide represents a significant milestone toward UV photonic integrated circuits as it features full compatibility for future incorporation of AlGaN-based UV emitters and receivers. On-chip UV spectroscopy, nonlinear optics and quantum information processing can also be envisioned.

physics.app-ph↗
arXiv2018

Fringe pattern analysis using deep learning

In many optical metrology techniques, fringe pattern analysis is the central algorithm for recovering the underlying phase distribution from the recorded fringe patterns. Despite extensive research efforts for decades, how to extract the desired phase information, with the highest possible accuracy, from the minimum number of fringe patterns remains one of the most challenging open problems. Inspired by recent successes of deep learning techniques for computer vision and other applications, here, we demonstrate for the first time, to our knowledge, that the deep neural networks can be trained to perform fringe analysis, which substantially enhances the accuracy of phase demodulation from a single fringe pattern. The effectiveness of the proposed method is experimentally verified using carrier fringe patterns under the scenario of fringe projection profilometry. Experimental results demonstrate its superior performance in terms of high accuracy and edge-preserving over two representative single-frame techniques: Fourier transform profilometry and Windowed Fourier profilometry.

eess.IV↗
arXiv2018

How LinkedIn Economic Graph Bonds Information and Product: Applications in LinkedIn Salary

The LinkedIn Salary product was launched in late 2016 with the goal of providing insights on compensation distribution to job seekers, so that they can make more informed decisions when discovering and assessing career opportunities. The compensation insights are provided based on data collected from LinkedIn members and aggregated in a privacy-preserving manner. Given the simultaneous desire for computing robust, reliable insights and for having insights to satisfy as many job seekers as possible, a key challenge is to reliably infer the insights at the company level when there is limited or no data at all. We propose a two-step framework that utilizes a novel, semantic representation of companies (Company2vec) and a Bayesian statistical model to address this problem. Our approach makes use of the rich information present in the LinkedIn Economic Graph, and in particular, uses the intuition that two companies are likely to be similar if employees are very likely to transition from one company to the other and vice versa. We compute embeddings for companies by analyzing the LinkedIn members' company transition data using machine learning algorithms, then compute pairwise similarities between companies based on these embeddings, and finally incorporate company similarities in the form of peer company groups as part of the proposed Bayesian statistical model to predict insights at the company level. We perform extensive validation using several different evaluation techniques, and show that we can significantly increase the coverage of insights while, in fact, even improving the quality of the obtained insights. For example, we were able to compute salary insights for 35 times as many title-region-company combinations in the U.S. as compared to previous work, corresponding to 4.9 times as many monthly active users. Finally, we highlight the lessons learned from deployment of our system.

cs.SI↗
arXiv2018

I Spy with My Little Eye: Analysis and Detection of Spying Browser Extensions

Several studies have been conducted on understanding third-party user tracking on the web. However, web trackers can only track users on sites where they are embedded by the publisher, thus obtaining a fragmented view of a user's online footprint. In this work, we investigate a different form of user tracking, where browser extensions are repurposed to capture the complete online activities of a user and communicate the collected sensitive information to a third-party domain. We conduct an empirical study of spying browser extensions on the Chrome Web Store. First, we present an in-depth analysis of the spying behavior of these extensions. We observe that these extensions steal a variety of sensitive user information, such as the complete browsing history (e.g., the sequence of web traversals), online social network (OSN) access tokens, IP address, and user geolocation. Second, we investigate the potential for automatically detecting spying extensions by applying machine learning schemes. We show that using a Recurrent Neural Network (RNN), the sequences of browser API calls can be a robust feature, outperforming hand-crafted features (used in prior work on malicious extensions) to detect spying extensions. Our RNN based detection scheme achieves a high precision (90.02%) and recall (93.31%) in detecting spying extensions.

cs.CR↗
arXiv2018

Deep Keyframe Detection in Human Action Videos

Detecting representative frames in videos based on human actions is quite challenging because of the combined factors of human pose in action and the background. This paper addresses this problem and formulates the key frame detection as one of finding the video frames that optimally maximally contribute to differentiating the underlying action category from all other categories. To this end, we introduce a deep two-stream ConvNet for key frame detection in videos that learns to directly predict the location of key frames. Our key idea is to automatically generate labeled data for the CNN learning using a supervised linear discriminant method. While the training data is generated taking many different human action videos into account, the trained CNN can predict the importance of frames from a single video. We specify a new ConvNet framework, consisting of a summarizer and discriminator. The summarizer is a two-stream ConvNet aimed at, first, capturing the appearance and motion features of video frames, and then encoding the obtained appearance and motion features for video representation. The discriminator is a fitting function aimed at distinguishing between the key frames and others in the video. We conduct experiments on a challenging human action dataset UCF101 and show that our method can detect key frames with high accuracy.

cs.CV↗
arXiv2018

Energy-Aware Virtual Machine Management in Inter-datacenter Networks over Elastic Optical Infrastructure

Datacenters (DCs), deployed in a large scale to support the ever increasing demand for data processing applications, consume tremendous energy. Powering DCs with renewable energy can effectively reduce the brown energy consumption. Owing to geographically distributed deployment of DCs, the renewable energy generation and the data processing demands usually vary in different DCs. Migrating virtual machines (VMs) among DCs according to the availability of renewable energy helps match the energy demands and the renewable energy generation in DCs, and thus maximizes the utilization of renewable energy. We first elicit the renewable energy-aware inter-datacenter (inter-DC) VM migration problem in an inter-DC network over the elastic optical infrastructure, present it as a many-manycast communications problem, and then formulate it as an integer linear programming problem. The objective is to minimize the total cost of the brown energy consumption of DCs in such inter-DC network via VM migration. We use CVX and Gurobi to solve this problem for small network configurations, and we propose a few heuristic algorithms that approximate the optimal solution for large network configurations. Through extensive simulations, we show that the proposed algorithms, by migrating VM among DCs, can reduce up to 19.7% cost of the brown energy consumption.

cs.NI↗
arXiv2018

Satellite-relayed intercontinental quantum network

We perform decoy-state quantum key distribution between a low-Earth-orbit satellite and multiple ground stations located in Xinglong, Nanshan, and Graz, which establish satellite-to-ground secure keys with ~kHz rate per passage of the satellite Micius over a ground station. The satellite thus establishes a secure key between itself and, say, Xinglong, and another key between itself and, say, Graz. Then, upon request from the ground command, Micius acts as a trusted relay. It performs bitwise exclusive OR operations between the two keys and relays the result to one of the ground stations. That way, a secret key is created between China and Europe at locations separated by 7600 km on Earth. These keys are then used for intercontinental quantum-secured communication. This was on the one hand the transmission of images in a one-time pad configuration from China to Austria as well as from Austria to China. Also, a videoconference was performed between the Austrian Academy of Sciences and the Chinese Academy of Sciences, which also included a 280 km optical ground connection between Xinglong and Beijing. Our work points towards an efficient solution for an ultralong-distance global quantum network, laying the groundwork for a future quantum internet.

quant-ph↗
arXiv2017

Compressive Phase Retrieval via Reweighted Amplitude Flow

The problem of reconstructing a sparse signal vector from magnitude-only measurements (a.k.a., compressive phase retrieval), emerges naturally in diverse applications, but it is NP-hard in general. Building on recent advances in nonconvex optimization, this paper puts forth a new algorithm that is termed compressive reweighted amplitude flow and abbreviated as CRAF, for compressive phase retrieval. Specifically, CRAF operates in two stages. The first stage seeks a sparse initial guess via a new spectral procedure. In the second stage, CRAF implements a few hard thresholding based iterations using reweighted gradients. When there are sufficient measurements, CRAF provably recovers the underlying signal vector exactly with high probability under suitable conditions. Moreover, its sample complexity coincides with that of the state-of-the-art procedures. Finally, substantial simulated tests showcase remarkable performance of the new spectral initialization, as well as improved exact recovery relative to competing alternatives.

cs.IT↗
arXiv2017

Progressive Bit-Flipping Decoding of Polar Codes Over Layered Critical Sets

In successive cancellation (SC) polar decoding, an incorrect estimate of any prior unfrozen bit may bring about severe error propagation in the following decoding, thus it is desirable to find out and correct an error as early as possible. In this paper, we first construct a critical set $S$ of unfrozen bits, which with high probability (typically $>99\%$) includes the bit where the first error happens. Then we develop a progressive multi-level bit-flipping decoding algorithm to correct multiple errors over the multiple-layer critical sets each of which is constructed using the remaining undecoded subtree associated with the previous layer. The \emph{level} in fact indicates the number of \emph{independent} errors that could be corrected. We show that as the level increases, the block error rate (BLER) performance of the proposed progressive bit flipping decoder competes with the corresponding cyclic redundancy check (CRC) aided successive cancellation list (CA-SCL) decoder, e.g., a level 4 progressive bit-flipping decoder is comparable to the CA-SCL decoder with a list size of $L=32$. Furthermore, the average complexity of the proposed algorithm is much lower than that of a SCL decoder (and is similar to that of SC decoding) at medium to high signal to noise ratio (SNR).

cs.IT↗
arXiv2017

Sparse Phase Retrieval via Truncated Amplitude Flow

This paper develops a novel algorithm, termed \emph{SPARse Truncated Amplitude flow} (SPARTA), to reconstruct a sparse signal from a small number of magnitude-only measurements. It deals with what is also known as sparse phase retrieval (PR), which is \emph{NP-hard} in general and emerges in many science and engineering applications. Upon formulating sparse PR as an amplitude-based nonconvex optimization task, SPARTA works iteratively in two stages: In stage one, the support of the underlying sparse signal is recovered using an analytically well-justified rule, and subsequently, a sparse orthogonality-promoting initialization is obtained via power iterations restricted on the support; and, in the second stage, the initialization is successively refined by means of hard thresholding based gradient-type iterations. SPARTA is a simple yet effective, scalable, and fast sparse PR solver. On the theoretical side, for any $n$-dimensional $k$-sparse ($k\ll n$) signal $\bm{x}$ with minimum (in modulus) nonzero entries on the order of $(1/\sqrt{k})\|\bm{x}\|_2$, SPARTA recovers the signal exactly (up to a global unimodular constant) from about $k^2\log n$ random Gaussian measurements with high probability. Furthermore, SPARTA incurs computational complexity on the order of $k^2n\log n$ with total runtime proportional to the time required to read the data, which improves upon the state-of-the-art by at least a factor of $k$. Finally, SPARTA is robust against additive noise of bounded support. Extensive numerical tests corroborate markedly improved recovery performance and speedups of SPARTA relative to existing alternatives.

cs.IT↗