arXiv subjects

Cheng Yang

Publications and source records attributed to Cheng Yang.

At least 235 records · Page 13Linked to original sources

arXiv2020

Phonon heat transport in cavity-mediated optomechanical nanoresonators

The understanding of heat transport in nonequilibrium thermodynamics is an important research frontier, which is crucial for implementing novel thermodynamic devices, such as heat engines and refrigerators. The convection, conduction, and radiation are the well-known basic ways to transfer thermal energy. Here we demonstrate a new mechanism of phonon heat transport between two spatially separated nanomechanical resonators coupled by the cavity-enhanced long-range interactions. The single trajectory for thermalization and non-equilibrium dynamics is monitored in real-time. We find that, in the strong coupling regime, instant heat flux counterintuitively oscillates back and forth in nonequilibrium steady states, which occurs spontaneously above the critical point during the thermal energy transfer process. The universal bound on the precision of nonequilibrium steady-state heat flux, i.e. the thermodynamic uncertainty relation, is verified in such a temperature gradient driven far-off equilibrium system. Our results reveal a previously unobserved phenomenon for heat transfer with mechanical oscillators, and provide a playground for testing fundamental theories in non-equilibrium thermodynamics.

physics.optics↗

arXiv2020

Few-shot Knowledge Transfer for Fine-grained Cartoon Face Generation

In this paper, we are interested in generating fine-grained cartoon faces for various groups. We assume that one of these groups consists of sufficient training data while the others only contain few samples. Although the cartoon faces of these groups share similar style, the appearances in various groups could still have some specific characteristics, which makes them differ from each other. A major challenge of this task is how to transfer knowledge among groups and learn group-specific characteristics with only few samples. In order to solve this problem, we propose a two-stage training process. First, a basic translation model for the basic group (which consists of sufficient data) is trained. Then, given new samples of other groups, we extend the basic model by creating group-specific branches for each new group. Group-specific branches are updated directly to capture specific appearances for each group while the remaining group-shared parameters are updated indirectly to maintain the distribution of intermediate feature space. In this manner, our approach is capable to generate high-quality cartoon faces for various groups.

cs.CV↗

arXiv2020

Diode-like Selective Enhancement of Carrier Transport through Metal-Semiconductor Interface Decorated by Monolayer Boron Nitride

Two-dimensional (2D) semiconductors are promising material candidates for next-generation nanoelectronics. However, there are fundamental challenges related to their metal-semiconductor (MS) contacts which limit the performance potential for practical device applications. In this work, we exploit 2D monolayer hexagonal boron nitride (h-BN) as an ultrathin decorating layer to form a metal-insulator-semiconductor (MIS) contact, and demonstrate a novel diode-like selective enhancement of the carrier transport through it. Compared to the conventional MS contact, the MIS contact dominated by both thermionic emission and quantum tunneling can significantly reduce the contact resistance and boost the electron transport from the semiconductor to the metal, but has negligible effects on the electron transport oppositely. We also investigate the negative barrier height with the concept of carrier collection barrier, and show its critical role at the drain end for determining the overall transistor performance.

physics.app-ph↗

arXiv2020

Adaptive Graph Encoder for Attributed Graph Embedding

Attributed graph embedding, which learns vector representations from graph topology and node features, is a challenging task for graph analysis. Recently, methods based on graph convolutional networks (GCNs) have made great progress on this task. However,existing GCN-based methods have three major drawbacks. Firstly,our experiments indicate that the entanglement of graph convolutional filters and weight matrices will harm both the performance and robustness. Secondly, we show that graph convolutional filters in these methods reveal to be special cases of generalized Laplacian smoothing filters, but they do not preserve optimal low-pass characteristics. Finally, the training objectives of existing algorithms are usually recovering the adjacency matrix or feature matrix, which are not always consistent with real-world applications. To address these issues, we propose Adaptive Graph Encoder (AGE), a novel attributed graph embedding framework. AGE consists of two modules: (1) To better alleviate the high-frequency noises in the node features, AGE first applies a carefully-designed Laplacian smoothing filter. (2) AGE employs an adaptive encoder that iteratively strengthens the filtered features for better node embeddings. We conduct experiments using four public benchmark datasets to validate AGE on node clustering and link prediction tasks. Experimental results show that AGE consistently outperforms state-of-the-art graph embedding methods considerably on these tasks.

cs.LG↗

arXiv2020

Joint Demosaicking / Rectification of Fisheye Camera Images using Multi-color Graph Laplacian Regularization

To compose a 360 image from a rig with multiple fisheye cameras, a conventional processing pipeline first performs demosaicking on each fisheye camera's Bayer-patterned grid, then translates demosaicked pixels from the camera grid to a rectified image grid---thus performing two image interpolation steps in sequence. Hence interpolation errors can accumulate, and acquisition noise in the captured pixels can pollute neighbors in two consecutive processing stages. In this paper, we propose a joint processing framework that performs demosaicking and grid-to-grid mapping simultaneously---thus limiting noise pollution to one interpolation. Specifically, we first obtain a reverse mapping function from a regular on-grid location in the rectified image to an irregular off-grid location in the camera's Bayer-patterned image. For each pair of adjacent pixels in the rectified grid, we estimate its gradient using the pair's neighboring pixel gradients in three colors in the Bayer-patterned grid. We construct a similarity graph based on the estimated gradients, and interpolate pixels in the rectified grid directly via graph Laplacian regularization (GLR). Experiments show that our joint method outperforms several competing local methods that execute demosaicking and rectification in sequence, by up to 0.52 dB in PSNR and 0.086 in SSIM on the publicly available dataset, and by up to 5.53dB in PSNR and 0.411 in SSIM on the in-house constructed dataset.

eess.IV↗

arXiv2020

Self-organized synchronization of phonon lasers

Self-organized synchronization is a ubiquitous collective phenomenon, in which each unit adjusts their rhythms to achieve synchrony through mutual interactions. The optomechanical systems, due to their inherently engineerable nonlinearities, provide an ideal platform to study self-organized synchronization. Here, we demonstrate the self-organized synchronization of phonon lasers in a two-membrane-in-the-middle optomechanical system. The probe of individual membrane enables to monitor the real-time transient dynamics of synchronization, which reveal that the system enters into the synchronization regime via torus birth bifurcation line. The phase-locking phenomenon and the transition between in-phase and anti-phase regimes are directly observed. Moreover, such a system greatly facilitate the controllable synchronous states, and consequently a phononic memory is realized by tuning the system parameters. This result is an important step towards the future studies of many-body collective behaviors in multiresonator optomechanics with long distances, and might find potential applications in quantum information processing and complex networks.

physics.optics↗

arXiv2020

MixPoet: Diverse Poetry Generation via Learning Controllable Mixed Latent Space

As an essential step towards computer creativity, automatic poetry generation has gained increasing attention these years. Though recent neural models make prominent progress in some criteria of poetry quality, generated poems still suffer from the problem of poor diversity. Related literature researches show that different factors, such as life experience, historical background, etc., would influence composition styles of poets, which considerably contributes to the high diversity of human-authored poetry. Inspired by this, we propose MixPoet, a novel model that absorbs multiple factors to create various styles and promote diversity. Based on a semi-supervised variational autoencoder, our model disentangles the latent space into some subspaces, with each conditioned on one influence factor by adversarial training. In this way, the model learns a controllable latent variable to capture and mix generalized factor-related properties. Different factor mixtures lead to diverse styles and hence further differentiate generated poems from each other. Experiment results on Chinese poetry demonstrate that MixPoet improves both diversity and quality against three state-of-the-art models.

cs.CL↗

arXiv2020

The helicity uniqueness conjecture in 3D hydrodynamics

We prove that the helicity is the only regular Casimir function for the coadjoint action of the volume-preserving diffeomorphism group $\text{SDiff}(M)$ on smooth exact divergence-free vector fields on a closed three-dimensional manifold $M$. More precisely, any regular $C^1$ functional defined on the space of $C^\infty$ (more generally, $C^k$, $k\ge 4$) exact divergence-free vector fields and invariant under arbitrary volume-preserving diffeomorphisms can be expressed as a $C^1$ function of the helicity. This gives a complete description of Casimirs for adjoint and coadjoint actions of $\text{SDiff}(M)$ in 3D and completes the proof of Arnold-Khesin's 1998 conjecture for a manifold $M$ with trivial first homology group. Our proofs make use of different tools from the theory of dynamical systems, including normal forms for divergence-free vector fields, the Poincaré-Birkhoff theorem, and a division lemma for vector fields with hyperbolic zeros.

math.DG↗

arXiv2020

Graph Metric Learning via Gershgorin Disc Alignment

We propose a fast general projection-free metric learning framework, where the minimization objective $\min_{\textbf{M} \in \mathcal{S}} Q(\textbf{M})$ is a convex differentiable function of the metric matrix $\textbf{M}$, and $\textbf{M}$ resides in the set $\mathcal{S}$ of generalized graph Laplacian matrices for connected graphs with positive edge weights and node degrees. Unlike low-rank metric matrices common in the literature, $\mathcal{S}$ includes the important positive-diagonal-only matrices as a special case in the limit. The key idea for fast optimization is to rewrite the positive definite cone constraint in $\mathcal{S}$ as signal-adaptive linear constraints via Gershgorin disc alignment, so that the alternating optimization of the diagonal and off-diagonal terms in $\textbf{M}$ can be solved efficiently as linear programs via Frank-Wolfe iterations. We prove that the Gershgorin discs can be aligned perfectly using the first eigenvector $\textbf{v}$ of $\textbf{M}$, which we update iteratively using Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) with warm start as diagonal / off-diagonal terms are optimized. Experiments show that our efficiently computed graph metric matrices outperform metrics learned using competing methods in terms of classification tasks.

cs.LG↗

arXiv2019

Averaging, symplectic reduction, and central extensions

We show that the averaged equation for a one-frequency fast-oscillating Hamiltonian system is the result of symplectic reduction of a certain natural system on the corresponding $S^1$-bundle with respect to the circle action. Furthermore, if the reduced configuration space happens to be a group, then under natural assumptions the averaged system turns out to be the Euler equation on a central extension of that group. This gives a new explanation of the drift, common in averaged system, as a similar shift is typically present in symplectic reductions and central extensions.

math-ph↗

arXiv2019

Graph Neural News Recommendation with Long-term and Short-term Interest Modeling

With the information explosion of news articles, personalized news recommendation has become important for users to quickly find news that they are interested in. Existing methods on news recommendation mainly include collaborative filtering methods which rely on direct user-item interactions and content based methods which characterize the content of user reading history. Although these methods have achieved good performances, they still suffer from data sparse problem, since most of them fail to extensively exploit high-order structure information (similar users tend to read similar news articles) in news recommendation systems. In this paper, we propose to build a heterogeneous graph to explicitly model the interactions among users, news and latent topics. The incorporated topic information would help indicate a user's interest and alleviate the sparsity of user-item interactions. Then we take advantage of graph neural networks to learn user and news representations that encode high-order structure information by propagating embeddings over the graph. The learned user embeddings with complete historic user clicks capture the users' long-term interests. We also consider a user's short-term interest using the recent reading history with an attention based LSTM model. Experimental results on real-world datasets show that our proposed model significantly outperforms state-of-the-art methods on news recommendation.

cs.IR↗

arXiv2019

Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift

Matrix completion algorithms fill missing entries in a large matrix given a subset of observed samples. However, how to best pre-select informative matrix entries given a sampling budget is largely unaddressed. In this paper, we propose a fast sample selection strategy for matrix completion from a graph signal processing perspective. Specifically, we first regularize the matrix reconstruction objective using a dual graph signal smoothness prior, resulting in a system of linear equations for solution. We then select appropriate samples to maximize the smallest eigenvalue $λ_{\min}$ of the coefficient matrix, thus maximizing the stability of the linear system. To efficiently solve this combinatorial problem, we derive a greedy sampling strategy, leveraging on Gershgorin circle theorem, that iteratively selects one sample (equivalent to shifting one Gershgorin disc) at a time corresponding to the largest magnitude entry in the first eigenvector of a modified graph Laplacian matrix. Our algorithm benefits computationally from warm start as the first eigenvectors of incremented Laplacian matrices are computed recurrently for more samples. To achieve computation scalability when sampling large matrices, we further rewrite the coefficient matrix as a sum of two separate components, each of which exhibits block-diagonal structure that we exploit for alternating block-wise sampling. Extensive experiments on both synthetic and real-world datasets show that our graph sampling algorithm substantially outperforms existing sampling schemes for matrix completion and reduces the completion error, when combined with a range of modern matrix completion algorithms.

eess.SP↗

arXiv2019

Higher-dimensional Euler fluids and Hasimoto transform: counterexamples and generalizations

The binormal (or vortex filament) equation provides the localized induction approximation of the 3D incompressible Euler equation. We present explicit solutions of the binormal equation in higher-dimensions that collapse in finite time. The local nature of this phenomenon suggests the appearance of singularity in nearby vortex blob solutions of the Euler equation in 5D and higher. Furthermore, the Hasimoto transform takes the binormal equation to the NLS and barotropic fluid equations. We show that in higher dimensions the existence of such a transform would imply the conservation of the Willmore energy in skew-mean-curvature flows and present counterexamples for vortex membranes based on products of spheres. These (counter)examples imply that there is no straightforward generalization to higher dimensions of the 1D Hasimoto transform. We derive its replacement, the evolution equations for the mean curvature and torsion form for membranes, thus generalizing the barotropic fluid and Da Rios equations.

math-ph↗

arXiv2019

GEAR: Graph-based Evidence Aggregating and Reasoning for Fact Verification

Fact verification (FV) is a challenging task which requires to retrieve relevant evidence from plain text and use the evidence to verify given claims. Many claims require to simultaneously integrate and reason over several pieces of evidence for verification. However, previous work employs simple models to extract information from evidence without letting evidence communicate with each other, e.g., merely concatenate the evidence for processing. Therefore, these methods are unable to grasp sufficient relational and logical information among the evidence. To alleviate this issue, we propose a graph-based evidence aggregating and reasoning (GEAR) framework which enables information to transfer on a fully-connected evidence graph and then utilizes different aggregators to collect multi-evidence information. We further employ BERT, an effective pre-trained language representation model, to improve the performance. Experimental results on a large-scale benchmark dataset FEVER have demonstrated that GEAR could leverage multi-evidence information for FV and thus achieves the promising result with a test FEVER score of 67.10%. Our code is available at https://github.com/thunlp/GEAR.

cs.CL↗

arXiv2019

A Unified Framework for Marketing Budget Allocation

While marketing budget allocation has been studied for decades in traditional business, nowadays online business brings much more challenges due to the dynamic environment and complex decision-making process. In this paper, we present a novel unified framework for marketing budget allocation. By leveraging abundant data, the proposed data-driven approach can help us to overcome the challenges and make more informed decisions. In our approach, a semi-black-box model is built to forecast the dynamic market response and an efficient optimization method is proposed to solve the complex allocation task. First, the response in each market-segment is forecasted by exploring historical data through a semi-black-box model, where the capability of logit demand curve is enhanced by neural networks. The response model reveals relationship between sales and marketing cost. Based on the learned model, budget allocation is then formulated as an optimization problem, and we design efficient algorithms to solve it in both continuous and discrete settings. Several kinds of business constraints are supported in one unified optimization paradigm, including cost upper bound, profit lower bound, or ROI lower bound. The proposed framework is easy to implement and readily to handle large-scale problems. It has been successfully applied to many scenarios in Alibaba Group. The results of both offline experiments and online A/B testing demonstrate its effectiveness.

cs.DS↗

arXiv2019

3D Point Cloud Denoising using Graph Laplacian Regularization of a Low Dimensional Manifold Model

3D point cloud - a new signal representation of volumetric objects - is a discrete collection of triples marking exterior object surface locations in 3D space. Conventional imperfect acquisition processes of 3D point cloud - e.g., stereo-matching from multiple viewpoint images or depth data acquired directly from active light sensors - imply non-negligible noise in the data. In this paper, we adopt a previously proposed low-dimensional manifold model for the surface patches in the point cloud and seek self-similar patches to denoise them simultaneously using the patch manifold prior. Due to discrete observations of the patches on the manifold, we approximate the manifold dimension computation defined in the continuous domain with a patch-based graph Laplacian regularizer and propose a new discrete patch distance measure to quantify the similarity between two same-sized surface patches for graph construction that is robust to noise. We show that our graph Laplacian regularizer has a natural graph spectral interpretation, and has desirable numerical stability properties via eigenanalysis. Extensive simulation results show that our proposed denoising scheme can outperform state-of-the-art methods in objective metrics and can better preserve visually salient structural features like edges.

cs.CV↗

arXiv2019

Adaptive Recurrent Neural Network Based on Mixture Layer

Although Recurrent Neural Network (RNN) has been a powerful tool for modeling sequential data, its performance is inadequate when processing sequences with multiple patterns. In this paper, we address this challenge by introducing a novel mixture layer and constructing an adaptive RNN. The mixture layer augmented RNN (termed as M-RNN) partitions patterns in training sequences into several clusters and stores the principle patterns as prototype vectors of components in a mixture model. By leveraging the mixture layer, the proposed method can adaptively update states according to the similarities between encoded inputs and prototype vectors, leading to a stronger capacity in assimilating sequences with multiple patterns. Moreover, our approach can be further extended by taking advantage of prior knowledge about data. Experiments on both synthetic and real datasets demonstrate the effectiveness of the proposed method.

cs.LG↗

arXiv2019

A basis of Casimirs in 3D magnetohydrodynamics

We prove that any regular Casimir in 3D magnetohydrodynamics is a function of the magnetic helicity and cross-helicity. In other words, these two helicities are the only independent regular integral invariants of the coadjoint action of the MHD group $\text{SDiff}(M)\ltimes\mathfrak X^*(M)$, which is the semidirect product of the group of volume-preserving diffeomorphisms and the dual space of its Lie algebra.

math-ph↗