arXiv subjects

Yi Yu

Publications and source records attributed to Yi Yu.

At least 271 records · Page 15Linked to original sources

arXiv2020

Unusual destruction and enhancement of superfluidity of atomic Fermi gases by population imbalance in a one-dimensional optical lattice

We study the superfluid behavior of a population imbalanced ultracold atomic Fermi gases with a short range attractive interaction in a one-dimensional (1D) optical lattice, using a pairing fluctuation theory. We show that, besides widespread pseudogap phenomena and intermediate temperature superfluidity, the superfluid phase is readily destroyed except in a limited region of the parameter space. We find a new mechanism for pair hopping, assisted by the excessive majority fermions, in the presence of continuum-lattice mixing, which leads to an unusual constant BEC asymptote for $T_c$ that is independent of pairing strength. In result, on the BEC side of unitarity, superfluidity, when it exists, may be strongly enhanced by population imbalance.

cond-mat.quant-gas↗

arXiv2020

Superfluidity and pairing phenomena in ultracold atomic Fermi gases in one-dimensional optical lattices, Part II: Effects of population imbalance

In this paper, we study the effect of population imbalance and its interplay with pairing strength and lattice effect in atomic Fermi gases in a one-dimensional optical lattice. We compute various phase diagrams as the system undergoes BCS-BEC crossover, using the same pairing fluctuation theory as in Part I. We find widespread pseudogap phenomena beyond the BCS regime and intermediate temperature superfluid states for relatively low population imbalances. The Fermi surface topology plays an important role in the behavior of $T_\text{c}$. For large $d$ and/or small $t$, which yield an open Fermi surface, superfluidity can be readily destroyed by a small amount of population imbalance $p$. The superfluid phase, especially in the BEC regime, can exist only for a highly restricted volume of the parameter space. Due to the continuum-lattice mixing, population imbalance gives rise to a new mechanism for pair hopping, as assisted by excessive majority fermions, which may lead to significant enhancement of $T_\text{c}$ on the BEC side of the Feshbach resonance, and also render $T_\text{c}$ approaching a constant asymptote in the BEC limit, when it exists. Furthermore, we find that not all minority fermions will be paired up in BEC limit, unlike the 3D continuum case. These predictions can be tested in future experiments.

cond-mat.quant-gas↗

arXiv2020

Superfluidity and pairing phenomena in ultracold atomic Fermi gases in one-dimensional optical lattices, Part I: Balanced case

The superfluidity and pairing phenomena in ultracold atomic Fermi gases have been of great interest in recent years, with multiple tunable parameters. Here we study the BCS-BEC crossover behavior of balanced two-component Fermi gases in a one-dimensional optical lattice, which is distinct from the simple three-dimensional (3D) continuum and a fully 3D lattice often found in a condensed matter system. We use a pairing fluctuation theory which includes self-consistent feedback effects at finite temperatures, and find widespread pseudogap phenomena beyond the BCS regime. As a consequence of the lattice periodicity, the superfluid transition temperature $T_c$ decreases with pairing strength in the BEC regime, where it approaches asymptotically $T_c = πan/2m$, with $a$ being the $s$-wave scattering length, and $n$ ($m$) the fermion density (mass). In addition, the quasi-two dimensionality leads to fast growing (absolute value of the) fermionic chemical potential $μ$ and pairing gap $Δ$, which depends exponentially on the ratio $d/a$. Importantly, $T_c$ at unitarity increases with the lattice constant $d$ and hopping integral $t$. The effect of the van Hove singularity on $T_c$ is identified. The superfluid density exhibits $T^{3/2}$ power laws at low $T$, away from the extreme BCS limit. These predictions can be tested in future experiments.

cond-mat.quant-gas↗

arXiv2019

Text2FaceGAN: Face Generation from Fine Grained Textual Descriptions

Powerful generative adversarial networks (GAN) have been developed to automatically synthesize realistic images from text. However, most existing tasks are limited to generating simple images such as flowers from captions. In this work, we extend this problem to the less addressed domain of face generation from fine-grained textual descriptions of face, e.g., "A person has curly hair, oval face, and mustache". We are motivated by the potential of automated face generation to impact and assist critical tasks such as criminal face reconstruction. Since current datasets for the task are either very small or do not contain captions, we generate captions for images in the CelebA dataset by creating an algorithm to automatically convert a list of attributes to a set of captions. We then model the highly multi-modal problem of text to face generation as learning the conditional distribution of faces (conditioned on text) in same latent space. We utilize the current state-of-the-art GAN (DC-GAN with GAN-CLS loss) for learning conditional multi-modality. The presence of more fine-grained details and variable length of the captions makes the problem easier for a user but more difficult to handle compared to the other text-to-image tasks. We flipped the labels for real and fake images and added noise in discriminator. Generated images for diverse textual descriptions show promising results. In the end, we show how the widely used inceptions score is not a good metric to evaluate the performance of generative models used for synthesizing faces from text.

cs.LG↗

arXiv2019

Data-Free Point Cloud Network for 3D Face Recognition

Point clouds-based Networks have achieved great attention in 3D object classification, segmentation and indoor scene semantic parsing. In terms of face recognition, 3D face recognition method which directly consume point clouds as input is still under study. Two main factors account for this: One is how to get discriminative face representations from 3D point clouds using deep network; the other is the lack of large 3D training dataset. To address these problems, a data-free 3D face recognition method is proposed only using synthesized unreal data from statistical 3D Morphable Model to train a deep point cloud network. To ease the inconsistent distribution between model data and real faces, different point sampling methods are used in train and test phase. In this paper, we propose a curvature-aware point sampling(CPS) strategy replacing the original furthest point sampling(FPS) to hierarchically down-sample feature-sensitive points which are crucial to pass and aggregate features deeply. A PointNet++ like Network is used to extract face features directly from point clouds. The experimental results show that the network trained on generated data generalizes well for real 3D faces. Fine tuning on a small part of FRGCv2.0 and Bosphorus, which include real faces in different poses and expressions, further improves recognition accuracy.

cs.CV↗

arXiv2019

Suppression of coherence collapse in semiconductor Fano lasers

We show that semiconductor Fano lasers strongly suppress dynamic instabilities induced by external optical feedback. A comparison with conventional Fabry-Perot lasers shows orders of magnitude improvement in feedback stability, and in many cases even total suppression of coherence collapse, which is of major importance for applications in integrated photonics. The laser dynamics are analysed using a generalisation of the Lang-Kobayashi model for semiconductor lasers with external feedback, and an analytical expression for the critical feedback level is derived.

physics.optics↗

arXiv2019

Mean-Square Performance Analysis of Noise-Robust Normalized Subband Adaptive Filter Algorithm

This paper studies the statistical models of the noise-robust normalized subband adaptive filter (NR-NSAF) algorithm in the mean and mean square deviation senses involving transient-state and steady-state behavior by resorting to the method of the vectorization operation and the Kronecker product. The analysis method does not require the Gaussian input signal. Moreover, the proposed analysis removes the paraunitary assumption imposed on the analysis filter banks as in the existing analyses of subband adaptive algorithms. Simulation results in various conditions demonstrate the effectiveness of our theoretical analysis. For a special form of the algorithm, the proposed steady-state expression is also better accurate than the previous analysis.

eess.SP↗

arXiv2019

Personalized Music Recommendation with Triplet Network

Since many online music services emerged in recent years so that effective music recommendation systems are desirable. Some common problems in recommendation system like feature representations, distance measure and cold start problems are also challenges for music recommendation. In this paper, I proposed a triplet neural network, exploiting both positive and negative samples to learn the representation and distance measure between users and items, to solve the recommendation task.

cs.IR↗

arXiv2019

Audio-Visual Embedding for Cross-Modal MusicVideo Retrieval through Supervised Deep CCA

Deep learning has successfully shown excellent performance in learning joint representations between different data modalities. Unfortunately, little research focuses on cross-modal correlation learning where temporal structures of different data modalities, such as audio and video, should be taken into account. Music video retrieval by given musical audio is a natural way to search and interact with music contents. In this work, we study cross-modal music video retrieval in terms of emotion similarity. Particularly, audio of an arbitrary length is used to retrieve a longer or full-length music video. To this end, we propose a novel audio-visual embedding algorithm by Supervised Deep CanonicalCorrelation Analysis (S-DCCA) that projects audio and video into a shared space to bridge the semantic gap between audio and video. This also preserves the similarity between audio and visual contents from different videos with the same class label and the temporal structure. The contribution of our approach is mainly manifested in the two aspects: i) We propose to select top k audio chunks by attention-based Long Short-Term Memory (LSTM)model, which can represent good audio summarization with local properties. ii) We propose an end-to-end deep model for cross-modal audio-visual learning where S-DCCA is trained to learn the semantic correlation between audio and visual modalities. Due to the lack of music video dataset, we construct 10K music video dataset from YouTube 8M dataset. Some promising results such as MAP and precision-recall show that our proposed model can be applied to music video retrieval.

cs.MM↗

arXiv2019

Social Influence-based Attentive Mavens Mining and Aggregative Representation Learning for Group Recommendation

Frequent group activities of human beings have become an indispensable part in their daily life. Group recommendation can recommend satisfactory activities to group members in the recommender systems, and the key issue is how to aggregate preferences in different group members. Most existing group recommendation employed the predefined static aggregation strategies to aggregate the preferences of different group members, but these static strategies cannot simulate the dynamic group decision-making. Meanwhile, most of these methods depend on intuitions or assumptions to analyze the influence of group members and lack of convincing theoretical support. We argue that the influence of group members plays a particularly important role in group decision-making and it can better assist group profile modeling and perform more accurate group recommendation. To tackle the issue of preference aggregation for group recommendation, we propose a novel attentive aggregation representation learning method based on sociological theory for group recommendation, namely SIAGR (short for "Social Influence-based Attentive Group Recommendation"), which takes attention mechanisms and the popular method (BERT) as the aggregation representation for group profile modeling. Specifically, we analyze the influence of group members based on social identity theory and two-step flow theory and exploit an attentive mavens mining method. In addition, we develop a BERT-based representation method to learn the interaction of group members. Lastly, we complete the group recommendation under the neural collaborative filtering framework and verify the effectiveness of the proposed method by experimenting.

cs.SI↗

arXiv2019

Radio Frequency Fingerprint Identification Based on Denoising Autoencoders

Radio Frequency Fingerprinting (RFF) is one of the promising passive authentication approaches for improving the security of the Internet of Things (IoT). However, with the proliferation of low-power IoT devices, it becomes imperative to improve the identification accuracy at low SNR scenarios. To address this problem, this paper proposes a general Denoising AutoEncoder (DAE)-based model for deep learning RFF techniques. Besides, a partially stacking method is designed to appropriately combine the semi-steady and steady-state RFFs of ZigBee devices. The proposed Partially Stacking-based Convolutional DAE (PSC-DAE) aims at reconstructing a high-SNR signal as well as device identification. Experimental results demonstrate that compared to Convolutional Neural Network (CNN), PSCDAE can improve the identification accuracy by 14% to 23.5% at low SNRs (from -10 dB to 5 dB) under Additive White Gaussian Noise (AWGN) corrupted channels. Even at SNR = 10 dB, the identification accuracy is as high as 97.5%.

eess.SP↗

arXiv2019

Univariate Mean Change Point Detection: Penalization, CUSUM and Optimality

The problem of univariate mean change point detection and localization based on a sequence of $n$ independent observations with piecewise constant means has been intensively studied for more than half century, and serves as a blueprint for change point problems in more complex settings. We provide a complete characterization of this classical problem in a general framework in which the upper bound $σ^2$ on the noise variance, the minimal spacing $Δ$ between two consecutive change points and the minimal magnitude $κ$ of the changes, are allowed to vary with $n$. We first show that consistent localization of the change points, when the signal-to-noise ratio $\frac{κ\sqrtΔ}σ < \sqrt{\log(n)}$, is impossible. In contrast, when $\frac{κ\sqrtΔ}σ$ diverges with $n$ at the rate of at least $\sqrt{\log(n)}$, we demonstrate that two computationally-efficient change point estimators, one based on the solution to an $\ell_0$-penalized least squares problem and the other on the popular wild binary segmentation algorithm, are both consistent and achieve a localization rate of the order $\frac{σ^2}{κ^2} \log(n)$. We further show that such rate is minimax optimal, up to a $\log(n)$ term.

math.ST↗

arXiv2019

Optimal nonparametric change point detection and localization

We study change point detection and localization for univariate data in fully nonparametric settings in which, at each time point, we acquire an i.i.d. sample from an unknown distribution. We quantify the magnitude of the distributional changes at the change points using the Kolmogorov--Smirnov distance. We allow all the relevant parameters -- the minimal spacing between two consecutive change points, the minimal magnitude of the changes in the Kolmogorov--Smirnov distance, and the number of sample points collected at each time point -- to change with the length of time series. We generalize the renowned binary segmentation (e.g. Scott and Knott, 1974) algorithm and its variant, the wild binary segmentation of Fryzlewicz (2014), both originally designed for univariate mean change point detection problems, to our nonparametric settings and exhibit rates of consistency for both of them. In particular, we prove that the procedure based on wild binary segmentation is nearly minimax rate-optimal. We further demonstrate a phase transition in the space of model parameters that separates parameter combinations for which consistent localization is possible from the ones for which this task is statistical unfeasible. Finally, we provide extensive numerical experiments to support our theory. R code is available at https://github.com/hernanmp/NWBS.

stat.ME↗

arXiv2019

Ensemble Super-Resolution with A Reference Dataset

By developing sophisticated image priors or designing deep(er) architectures, a variety of image Super-Resolution (SR) approaches have been proposed recently and achieved very promising performance. A natural question that arises is whether these methods can be reformulated into a unifying framework and whether this framework assists in SR reconstruction? In this paper, we present a simple but effective single image SR method based on ensemble learning, which can produce a better performance than that could be obtained from any of SR methods to be ensembled (or called component super-resolvers). Based on the assumption that better component super-resolver should have larger ensemble weight when performing SR reconstruction, we present a Maximum A Posteriori (MAP) estimation framework for the inference of optimal ensemble weights. Specially, we introduce a reference dataset, which is composed of High-Resolution (HR) and Low-Resolution (LR) image pairs, to measure the super-resolution abilities (prior knowledge) of different component super-resolvers. To obtain the optimal ensemble weights, we propose to incorporate the reconstruction constraint, which states that the degenerated HR image should be equal to the LR observation one, as well as the prior knowledge of ensemble weights into the MAP estimation framework. Moreover, the proposed optimization problem can be solved by an analytical solution. We study the performance of the proposed method by comparing with different competitive approaches, including four state-of-the-art non-deep learning based methods, four latest deep learning based methods and one ensemble learning based method, and prove its effectiveness and superiority on three public datasets.

cs.CV↗

arXiv2018

Maximizing the quality factor to mode volume ratio for ultra-small photonic crystal cavities

Small manufacturing-tolerant photonic crystal cavities are systematically designed using topology optimization to enhance the ratio between quality factor and mode volume, Q/V. For relaxed manufacturing tolerance, a cavity with bow-tie shape is obtained which confines light beyond the diffraction limit into a deep-subwavelength volume. Imposition of a small manufacturing tolerance still results in efficient designs, however, with diffraction-limited confinement. Inspired by numerical results, an elliptic ring grating cavity concept is extracted via geometric fitting. Numerical evaluations demonstrate that for small sizes, topology-optimized cavities enhance the Q/V-ratio by up to two orders of magnitude relative to standard L1 cavities and more than one order of magnitude relative to shape-optimized L1 cavities. An increase in cavity size can enhance the Q/V-ratio by an increase of the Q-factor without significant increase of V. Comparison between optimized and reference cavities illustrates that significant reduction of V requires big topological changes in the cavity.

physics.optics↗

arXiv2018

Spectral Analysis of High-dimensional Time Series

A useful approach for analysing multiple time series is via characterising their spectral density matrix as the frequency domain analog of the covariance matrix. When the dimension of the time series is large compared to their length, regularisation based methods can overcome the curse of dimensionality, but the existing ones lack theoretical justification. This paper develops the first non-asymptotic result for characterising the difference between the sample and population versions of the spectral density matrix, allowing one to justify a range of high-dimensional models for analysing time series. As a concrete example, we apply this result to establish the convergence of the smoothed periodogram estimators and sparse estimators of the inverse of spectral density matrices, namely precision matrices. These results, novel in the frequency domain time series analysis, are corroborated by simulations and an analysis of the Google Flu Trends data.

math.ST↗

arXiv2018

Event History Analysis of Dynamic Communication Networks

Statistical analysis on networks has received growing attention due to demand from various emerging applications. In dynamic networks, one of the key interests is to model the event history of time-stamped interactions amongst nodes. We propose to model dynamic directed communication networks via multivariate counting processes. A pseudo partial likelihood approach is exploited to capture the network dependence structure. Asymptotic results of the resulting estimation are established. Numerical results are performed to demonstrate effectiveness of our proposal.

stat.ME↗

arXiv2018

Context-Patch Face Hallucination Based on Thresholding Locality-constrained Representation and Reproducing Learning

Face hallucination is a technique that reconstruct high-resolution (HR) faces from low-resolution (LR) faces, by using the prior knowledge learned from HR/LR face pairs. Most state-of-the-arts leverage position-patch prior knowledge of human face to estimate the optimal representation coefficients for each image patch. However, they focus only the position information and usually ignore the context information of image patch. In addition, when they are confronted with misalignment or the Small Sample Size (SSS) problem, the hallucination performance is very poor. To this end, this study incorporates the contextual information of image patch and proposes a powerful and efficient context-patch based face hallucination approach, namely Thresholding Locality-constrained Representation and Reproducing learning (TLcR-RL). Under the context-patch based framework, we advance a thresholding based representation method to enhance the reconstruction accuracy and reduce the computational complexity. To further improve the performance of the proposed algorithm, we propose a promotion strategy called reproducing learning. By adding the estimated HR face to the training set, which can simulates the case that the HR version of the input LR face is present in the training set, thus iteratively enhancing the final hallucination result. Experiments demonstrate that the proposed TLcR-RL method achieves a substantial increase in the hallucinated results, both subjectively and objectively. Additionally, the proposed framework is more robust to face misalignment and the SSS problem, and its hallucinated HR face is still very good when the LR test face is from the real-world. The MATLAB source code is available at https://github.com/junjun-jiang/TLcR-RL

cs.CV↗