arXiv subjects

Yue Wu

Publications and source records attributed to Yue Wu.

At least 307 records · Page 17Linked to original sources

arXiv2022

DoF of a Cooperative X-Channel with an Application to Distributed Computing

We consider a cooperative X-channel with $\sf K$ transmitters (TXs) and $\sf K$ receivers (Rxs) where Txs and Rxs are gathered into groups of size $\sf r$ respectively. Txs belonging to the same group cooperate to jointly transmit a message to each of the $\sf K- \sf r$ Rxs in all other groups, and each Rx individually decodes all its intended messages. By introducing a new interference alignment (IA) scheme, we prove that when $\sf K/\sf r$ is an integer the sum Degrees of Freedom (SDoF) of this channel is lower bounded by $2\sf r$ if $\sf K/\sf r \in \{2,3\}$ and by $\frac{\sf K(\sf K-\sf r)-\sf r^2}{2\sf K-3\sf r}$ if $\sf K/\sf r \geq 4$. We also prove that the SDoF is upper bounded by $\frac{\sf K(\sf K-\sf r)}{2\sf K-3\sf r}$. The proposed IA scheme finds application in a wireless distributed MapReduce framework, where it improves the normalized data delivery time (NDT) compared to the state of the art.

cs.IT↗

arXiv2022

A direct imaging method for the exterior and interior inverse scattering problems

This paper is concerned with the inverse acoustic scattering problems by an obstacle or a cavity with a sound-soft or a sound-hard boundary. A direct imaging method relying on the boundary conditions is proposed for reconstructing the shape of the obstacle or cavity. First, the scattered fields are approximated by the Fourier-Bessel functions with the measurements on a closed curve. Then, the indicator functions are established by the superpositions of the total fields or their derivatives to the incident point sources. We prove that the indicator functions vanish only on the boundary of the obstacle or cavity. Numerical examples are also included to demonstrate the effectiveness of the method.

math.NA↗

arXiv2022

The China Trade Shock and the ESG Performances of US firms

How does import competition from China affect engagement on ESG initiatives by US corporates? On the one hand, reduced profitability due to import competition and lagging ESG performance of Chinese exporters can disincentivize US firms to put more resources to ESG initiatives. On the other hand, the shift from labor-intensive production to capital/technology-intensive production along with offshoring may improve the US company's ESG performance. Moreover, US companies have incentives to actively pursue more ESG engagement to differentiate from Chinese imports. Exploiting a trade policy in which US congress granted China the Permanent Normal Trade Relations and the resulting change in expected tariff rates on Chinese imports, we find that greater import competition from China leads to an increase in the US company's ESG performance. The improvement primarily stems from "doing more positives" and from more involvement on environmental initiatives. Indirect and direct evidence shows that the improvement is not driven by the change in production process or offshoring, but is consistent with product differentiation. Our results suggest that the trade shock from China has significant impact on the US company's ESG performance.

q-fin.GN↗

arXiv2022

Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays

Executing quantum algorithms on error-corrected logical qubits is a critical step for scalable quantum computing, but the requisite numbers of qubits and physical error rates are demanding for current experimental hardware. Recently, the development of error correcting codes tailored to particular physical noise models has helped relax these requirements. In this work, we propose a qubit encoding and gate protocol for ${}^{171}$Yb neutral atom qubits that converts the dominant physical errors into erasures, that is, errors in known locations. The key idea is to encode qubits in a metastable electronic level, such that gate errors predominantly result in transitions to disjoint subspaces whose populations can be continuously monitored via fluorescence. We estimate that 98% of errors can be converted into erasures. We quantify the benefit of this approach via circuit-level simulations of the surface code, finding a threshold increase from 0.937% to 4.15%. We also observe a larger code distance near the threshold, leading to a faster decrease in the logical error rate for the same number of physical qubits, which is important for near-term implementations. Erasure conversion should benefit any error correcting code, and may also be applied to design new gates and encodings in other qubit platforms.

quant-ph↗

arXiv2021

Spatially Constrained GAN for Face and Fashion Synthesis

Image generation has raised tremendous attention in both academic and industrial areas, especially for the conditional and target-oriented image generation, such as criminal portrait and fashion design. Although the current studies have achieved preliminary results along this direction, they always focus on class labels as the condition where spatial contents are randomly generated from latent vectors. Edge details are usually blurred since spatial information is difficult to preserve. In light of this, we propose a novel Spatially Constrained Generative Adversarial Network (SCGAN), which decouples the spatial constraints from the latent vector and makes these constraints feasible as additional controllable signals. To enhance the spatial controllability, a generator network is specially designed to take a semantic segmentation, a latent vector and an attribute-level label as inputs step by step. Besides, a segmentor network is constructed to impose spatial constraints on the generator. Experimentally, we provide both visual and quantitative results on CelebA and DeepFashion datasets, and demonstrate that the proposed SCGAN is very effective in controlling the spatial contents as well as generating high-quality images.

cs.CV↗

arXiv2021

Unsupervised cross domain learning with applications to 7 layer segmentation of OCTs

Unsupervised cross domain adaptation for OCT 7 layer segmentation and other medical applications where labeled training data is only available in a source domain and unavailable in the target domain. Our proposed method helps generalize of deep learning to many areas in the medical field where labeled training data are expensive and time consuming to acquire or where target domains are too novel to have had labelling.

eess.IV↗

arXiv2021

Signal Encryption Strategy based on Domain change of the Fractional Fourier Transform

This paper provides a double encryption algorithm that uses the lack of invertibility of the fractional Fourier transform (FRFT) on $L^{1}$. One encryption key is a function, which maps a ``good" $L^{2}$-signal to a ``bad" $L^{1}$-signal. The FRFT parameter which describes the rotation associated with this operator on the time-frequency plane provides the other encryption key. With the help of approximate identities, such as of the Abel and Gauss means of the FRFT established in \cite{CFGW}, we recover the encrypted signal on the FRFT domain. This design of an encryption algorithm seems new even when using the classical Fourier transform. Finally, the feasibility of the new strategy is verified by simulation and audio examples.

cs.IT↗

arXiv2021

ADDS: Adaptive Differentiable Sampling for Robust Multi-Party Learning

Distributed multi-party learning provides an effective approach for training a joint model with scattered data under legal and practical constraints. However, due to the quagmire of a skewed distribution of data labels across participants and the computation bottleneck of local devices, how to build smaller customized models for clients in various scenarios while providing updates appliable to the central model remains a challenge. In this paper, we propose a novel adaptive differentiable sampling framework (ADDS) for robust and communication-efficient multi-party learning. Inspired by the idea of dropout in neural networks, we introduce a network sampling strategy in the multi-party setting, which distributes different subnets of the central model to clients for updating, and the differentiable sampling rates allow each client to extract optimal local architecture from the supernet according to its private data distribution. The approach requires minimal modifications to the existing multi-party learning structure, and it is capable of integrating local updates of all subnets into the supernet, improving the robustness of the central model. The proposed framework significantly reduces local computation and communication costs while speeding up the central model convergence, as we demonstrated through experiments on real-world datasets.

cs.LG↗

arXiv2021

Towards fast weak adversarial training to solve high dimensional parabolic partial differential equations using XNODE-WAN

Due to the curse of dimensionality, solving high dimensional parabolic partial differential equations (PDEs) has been a challenging problem for decades. Recently, a weak adversarial network (WAN) proposed in (Y.Zang et al., 2020) offered a flexible and computationally efficient approach to tackle this problem defined on arbitrary domains by leveraging the weak solution. WAN reformulates the PDE problem as a generative adversarial network, where the weak solution (primal network) and the test function (adversarial network) are parameterized by the multi-layer deep neural networks (DNNs). However, it is not yet clear whether DNNs are the most effective model for the parabolic PDE solutions as they do not take into account the fundamentally different roles played by time and spatial variables in the solution. To reinforce the difference, we design a novel so-called XNODE model for the primal network, which is built on the neural ODE (NODE) model with additional spatial dependency to incorporate the a priori information of the PDEs and serve as a universal and effective approximation to the solution. The proposed hybrid method (XNODE-WAN), by integrating the XNODE model within the WAN framework, leads to significant improvement in the performance and efficiency of training. Numerical results show that our method can reduce the training time to a fraction of that of the WAN model.

math.NA↗

arXiv2021

Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons

In heterogeneous rank aggregation problems, users often exhibit various accuracy levels when comparing pairs of items. Thus a uniform querying strategy over users may not be optimal. To address this issue, we propose an elimination-based active sampling strategy, which estimates the ranking of items via noisy pairwise comparisons from users and improves the users' average accuracy by maintaining an active set of users. We prove that our algorithm can return the true ranking of items with high probability. We also provide a sample complexity bound for the proposed algorithm which is better than that of non-active strategies in the literature. Experiments are provided to show the empirical advantage of the proposed methods over the state-of-the-art baselines.

cs.LG↗

arXiv2021

Feature Flow Regularization: Improving Structured Sparsity in Deep Neural Networks

Pruning is a model compression method that removes redundant parameters in deep neural networks (DNNs) while maintaining accuracy. Most available filter pruning methods require complex treatments such as iterative pruning, features statistics/ranking, or additional optimization designs in the training process. In this paper, we propose a simple and effective regularization strategy from a new perspective of evolution of features, which we call feature flow regularization (FFR), for improving structured sparsity and filter pruning in DNNs. Specifically, FFR imposes controls on the gradient and curvature of feature flow along the neural network, which implicitly increases the sparsity of the parameters. The principle behind FFR is that coherent and smooth evolution of features will lead to an efficient network that avoids redundant parameters. The high structured sparsity obtained from FFR enables us to prune filters effectively. Experiments with VGGNets, ResNets on CIFAR-10/100, and Tiny ImageNet datasets demonstrate that FFR can significantly improve both unstructured and structured sparsity. Our pruning results in terms of reduction of parameters and FLOPs are comparable to or even better than those of state-of-the-art pruning methods.

cs.CV↗

arXiv2021

Embedding Novel Views in a Single JPEG Image

We propose a novel approach for embedding novel views in a single JPEG image while preserving the perceptual fidelity of the modified JPEG image and the restored novel views. We adopt the popular novel view synthesis representation of multiplane images (MPIs). Our model first encodes 32 MPI layers (totally 128 channels) into a 3-channel JPEG image that can be decoded for MPIs to render novel views, with an embedding capacity of 1024 bits per pixel. We conducted experiments on public datasets with different novel view synthesis methods, and the results show that the proposed method can restore high-fidelity novel views from a slightly modified JPEG image. Furthermore, our method is robust to JPEG compression, color adjusting, and cropping. Our source code will be publicly available.

cs.CV↗

arXiv2021

Towards Photorealistic Colorization by Imagination

We present a novel approach to automatic image colorization by imitating the imagination process of human experts. Our imagination module is designed to generate color images that are context-correlated with black-and-white photos. Given a black-and-white image, our imagination module firstly extracts the context information, which is then used to synthesize colorful and diverse images using a conditional image synthesis network (e.g., semantic image synthesis model). We then design a colorization module to colorize the black-and-white images with the guidance of imagination for photorealistic colorization. Experimental results show that our work produces more colorful and diverse results than state-of-the-art image colorization methods. Our source codes will be publicly available.

cs.CV↗

arXiv2021

The random periodic solution of a stochastic differential equation with a monotone drift and its numerical approximation

In this paper we study the existence and uniqueness of the random periodic solution for a stochastic differential equation with a one-sided Lipschitz condition (also known as monotonicity condition) and the convergence of its numerical approximation via the backward Euler-Maruyama method. The existence of the random periodic solution is shown as the limits of the pull-back flows of the SDE and discretized SDE respectively. We establish a convergence rate of the strong error for the backward Euler-Maruyama method and obtain the weak convergence result for the approximation of the periodic measure.

math.PR↗

arXiv2021

Demonstration-Guided Reinforcement Learning with Learned Skills

Demonstration-guided reinforcement learning (RL) is a promising approach for learning complex behaviors by leveraging both reward feedback and a set of target task demonstrations. Prior approaches for demonstration-guided RL treat every new task as an independent learning problem and attempt to follow the provided demonstrations step-by-step, akin to a human trying to imitate a completely unseen behavior by following the demonstrator's exact muscle movements. Naturally, such learning will be slow, but often new behaviors are not completely unseen: they share subtasks with behaviors we have previously learned. In this work, we aim to exploit this shared subtask structure to increase the efficiency of demonstration-guided RL. We first learn a set of reusable skills from large offline datasets of prior experience collected across many tasks. We then propose Skill-based Learning with Demonstrations (SkiLD), an algorithm for demonstration-guided RL that efficiently leverages the provided demonstrations by following the demonstrated skills instead of the primitive actions, resulting in substantial performance improvements over prior demonstration-guided RL approaches. We validate the effectiveness of our approach on long-horizon maze navigation and complex robot manipulation tasks.

cs.LG↗

arXiv2021

Bonding nature and optical contrast of $TiTe_2$/$Sb_2Te_3$ phase-change heterostructure

Chalcogenide phase-change materials (PCMs) are regarded as the leading candidate for storage-class non-volatile memory and neuro-inspired computing. Recently, using the $TiTe_2$/$Sb_2Te_3$ material combination, a new framework - phase-change heterostructure (PCH), has been developed and proved to effectively suppress the noise and drift in electrical resistance upon memory programming, largely reducing the inter-device variability. However, the atomic-scale structural and chemical nature of PCH remains to be fully understood. In this work, we carry out thorough ab initio simulations to assess the bonding characteristics of the PCH. We show that the $TiTe_2$ crystalline nanolayers do not chemically interact with the surrounding $Sb_2Te_3$, and are stabilized by strong covalent and electrostatic Ti-Te interactions, which create a prohibitively high barrier for atomic migrations along the pulsing direction. We also find significant contrast in computed dielectric functions in the PCH, suggesting possible optical applications of this class of devices. With the more confined space and therefore constrained phase transition compared to traditional PCM devices, the recently introduced class of PCH-based devices may lead to improvements in phase-change photonic and optoelectronic applications with much lower stochasticity during programming.

cond-mat.mtrl-sci↗

arXiv2021

Video Super-Resolution with Long-Term Self-Exemplars

Existing video super-resolution methods often utilize a few neighboring frames to generate a higher-resolution image for each frame. However, the redundant information between distant frames has not been fully exploited in these methods: corresponding patches of the same instance appear across distant frames at different scales. Based on this observation, we propose a video super-resolution method with long-term cross-scale aggregation that leverages similar patches (self-exemplars) across distant frames. Our model also consists of a multi-reference alignment module to fuse the features derived from similar patches: we fuse the features of distant references to perform high-quality super-resolution. We also propose a novel and practical training strategy for referenced-based super-resolution. To evaluate the performance of our proposed method, we conduct extensive experiments on our collected CarCam dataset and the Waymo Open dataset, and the results demonstrate our method outperforms state-of-the-art methods. Our source code will be publicly available.

cs.CV↗

arXiv2021

Learning to Detect Bipolar Disorder and Borderline Personality Disorder with Language and Speech in Non-Clinical Interviews

Bipolar disorder (BD) and borderline personality disorder (BPD) are both chronic psychiatric disorders. However, their overlapping symptoms and common comorbidity make it challenging for the clinicians to distinguish the two conditions on the basis of a clinical interview. In this work, we first present a new multi-modal dataset containing interviews involving individuals with BD or BPD being interviewed about a non-clinical topic . We investigate the automatic detection of the two conditions, and demonstrate a good linear classifier that can be learnt using a down-selected set of features from the different aspects of the interviews and a novel approach of summarising these features. Finally, we find that different sets of features characterise BD and BPD, thus providing insights into the difference between the automatic screening of the two conditions.

cs.LG↗