arXiv subjects

Yi Yu

Publications and source records attributed to Yi Yu.

At least 289 records · Page 16Linked to original sources

arXiv2018

Ultra high temperature superfluidity in ultracold atomic Fermi gases with mixed dimensionality

Achieving a higher superfluid transition $T_c$ has been a goal for the fields of superconductivity and atomic Fermi gases. Here we propose that, by using mixed dimensionality, one may achieve ultra high temperature superfluids in two component atomic Fermi gases, where one component feels a regular three-dimensional (3D) continuum space, while the other is subject to a 1D optic lattice potential. Via tuning the lattice spacing and trap depth, one can effectively raise the Fermi level dramatically upon pairing so that superfluidity may occur at an ultra high temperature (in units of Fermi energy) even beyond the quantum degeneracy regime, well surpassing that in an ordinary 3D Fermi gas and all other known superfluids and superconductors.

cond-mat.quant-gas↗

arXiv2018

Deep Learning of Human Perception in Audio Event Classification

In this paper, we introduce our recent studies on human perception in audio event classification by different deep learning models. In particular, the pre-trained model VGGish is used as feature extractor to process audio data, and DenseNet is trained by and used as feature extractor for our electroencephalography (EEG) data. The correlation between audio stimuli and EEG is learned in a shared space. In the experiments, we record brain activities (EEG signals) of several subjects while they are listening to music events of 8 audio categories selected from Google AudioSet, using a 16-channel EEG headset with active electrodes. Our experimental results demonstrate that i) audio event classification can be improved by exploiting the power of human perception, and ii) the correlation between audio stimuli and EEG can be learned to complement audio event understanding.

cs.SD↗

arXiv2018

Optimal Covariance Change Point Localization in High Dimension

We study the problem of change point detection for covariance matrices in high dimensions. We assume that we observe a sequence {X_i}_{i=1,...,n} of independent and centered p-dimensional sub-Gaussian random vectors whose covariance matrices are piecewise constant. Our task is to recover with high accuracy the number and locations of the change points, which are assumed unknown. Our generic model setting allows for all the model parameters to change with n, including the dimension p, the minimal spacing between consecutive change points, the magnitude of smallest change size and the maximal Orlicz- 2 norm of the covariance matrices of the sample points. Without assuming any additional structural assumption, such as low rank matrices or having sparse principle components, we set up a general framework and a benchmark result for the covariance change point detection problem. We introduce two procedures, one based on the binary segmentation algorithm (e.g. Vostrikova, 1981) and the other on its extension known as wild binary segmentation of Fryzlewicz (2014), and demonstrate that, under suitable conditions, both procedures are able to consistently es- timate the number and locations of change points. Our second algorithm, called Wild Binary Segmentation through Independent Projection (WBSIP), is shown to be optimal in the sense of allowing for the minimax scaling in all the relevant parameters. Our minimax analysis reveals a phase transition effect based on the problem of change point localization. To the best of our knowledge, this type of results has not been established elsewhere in the high-dimensional change point detection literature.

math.ST↗

arXiv2018

Deep CNN Denoiser and Multi-layer Neighbor Component Embedding for Face Hallucination

Most of the current face hallucination methods, whether they are shallow learning-based or deep learning-based, all try to learn a relationship model between Low-Resolution (LR) and High-Resolution (HR) spaces with the help of a training set. They mainly focus on modeling image prior through either model-based optimization or discriminative inference learning. However, when the input LR face is tiny, the learned prior knowledge is no longer effective and their performance will drop sharply. To solve this problem, in this paper we propose a general face hallucination method that can integrate model-based optimization and discriminative inference. In particular, to exploit the model based prior, the Deep Convolutional Neural Networks (CNN) denoiser prior is plugged into the super-resolution optimization model with the aid of image-adaptive Laplacian regularization. Additionally, we further develop a high-frequency details compensation method by dividing the face image to facial components and performing face hallucination in a multi-layer neighbor embedding manner. Experiments demonstrate that the proposed method can achieve promising super-resolution results for tiny input LR faces.

cs.CV↗

arXiv2018

Category-Based Deep CCA for Fine-Grained Venue Discovery from Multimodal Data

In this work, travel destination and business location are taken as venues. Discovering a venue by a photo is very important for context-aware applications. Unfortunately, few efforts paid attention to complicated real images such as venue photos generated by users. Our goal is fine-grained venue discovery from heterogeneous social multimodal data. To this end, we propose a novel deep learning model, Category-based Deep Canonical Correlation Analysis (C-DCCA). Given a photo as input, this model performs (i) exact venue search (find the venue where the photo was taken), and (ii) group venue search (find relevant venues with the same category as that of the photo), by the cross-modal correlation between the input photo and textual description of venues. In this model, data in different modalities are projected to a same space via deep networks. Pairwise correlation (between different modal data from the same venue) for exact venue search and category-based correlation (between different modal data from different venues with the same category) for group venue search are jointly optimized. Because a photo cannot fully reflect rich text description of a venue, the number of photos per venue in the training phase is increased to capture more aspects of a venue. We build a new venue-aware multimodal dataset by integrating Wikipedia featured articles and Foursquare venue photos. Experimental results on this dataset confirm the feasibility of the proposed method. Moreover, the evaluation over another publicly available dataset confirms that the proposed method outperforms state-of-the-arts for cross-modal retrieval between image and text.

cs.CV↗

arXiv2018

Link prediction for interdisciplinary collaboration via co-authorship network

We analyse the Publication and Research (PURE) data set of University of Bristol collected between $2008$ and $2013$. Using the existing co-authorship network and academic information thereof, we propose a new link prediction methodology, with the specific aim of identifying potential interdisciplinary collaboration in a university-wide collaboration network.

cs.DL↗

arXiv2018

Confidence intervals for high-dimensional Cox models

The purpose of this paper is to construct confidence intervals for the regression coefficients in high-dimensional Cox proportional hazards regression models where the number of covariates may be larger than the sample size. Our debiased estimator construction is similar to those in Zhang and Zhang (2014) and van de Geer et al. (2014), but the time-dependent covariates and censored risk sets introduce considerable additional challenges. Our theoretical results, which provide conditions under which our confidence intervals are asymptotically valid, are supported by extensive numerical experiments.

stat.ME↗

arXiv2018

The restricted consistency property of leave-$n_v$-out cross-validation for high-dimensional variable selection

Cross-validation (CV) methods are popular for selecting the tuning parameter in the high-dimensional variable selection problem. We show the mis-alignment of the CV is one possible reason of its over-selection behavior. To fix this issue, we propose a version of leave-$n_v$-out cross-validation (CV($n_v$)), for selecting the optimal model among the restricted candidate model set for high-dimensional generalized linear models. By using the same candidate model sequence and a proper order of construction sample size $n_c$ in each CV split, CV($n_v$) avoids the potential hurdles in developing theoretical properties. CV($n_v$) is shown to enjoy the restricted model selection consistency property under mild conditions. Extensive simulations and real data analysis support the theoretical results and demonstrate the performances of CV($n_v$) in terms of both model selection and prediction.

stat.ME↗

arXiv2017

Towards Deep Modeling of Music Semantics using EEG Regularizers

Modeling of music audio semantics has been previously tackled through learning of mappings from audio data to high-level tags or latent unsupervised spaces. The resulting semantic spaces are theoretically limited, either because the chosen high-level tags do not cover all of music semantics or because audio data itself is not enough to determine music semantics. In this paper, we propose a generic framework for semantics modeling that focuses on the perception of the listener, through EEG data, in addition to audio data. We implement this framework using a novel end-to-end 2-view Neural Network (NN) architecture and a Deep Canonical Correlation Analysis (DCCA) loss function that forces the semantic embedding spaces of both views to be maximally correlated. We also detail how the EEG dataset was collected and use it to train our proposed model. We evaluate the learned semantic space in a transfer learning context, by using it as an audio feature extractor in an independent dataset and proxy task: music audio-lyrics cross-modal retrieval. We show that our embedding model outperforms Spotify features and performs comparably to a state-of-the-art embedding model that was trained on 700 times more data. We further discuss improvements to the model that are likely to improve its performance.

cs.IR↗

arXiv2017

Deep Cross-Modal Correlation Learning for Audio and Lyrics in Music Retrieval

Little research focuses on cross-modal correlation learning where temporal structures of different data modalities such as audio and lyrics are taken into account. Stemming from the characteristic of temporal structures of music in nature, we are motivated to learn the deep sequential correlation between audio and lyrics. In this work, we propose a deep cross-modal correlation learning architecture involving two-branch deep neural networks for audio modality and text modality (lyrics). Different modality data are converted to the same canonical space where inter modal canonical correlation analysis is utilized as an objective function to calculate the similarity of temporal structures. This is the first study on understanding the correlation between language and music audio through deep architectures for learning the paired temporal correlation of audio and lyrics. Pre-trained Doc2vec model followed by fully-connected layers (fully-connected deep neural network) is used to represent lyrics. Two significant contributions are made in the audio branch, as follows: i) pre-trained CNN followed by fully-connected layers is investigated for representing music audio. ii) We further suggest an end-to-end architecture that simultaneously trains convolutional layers and fully-connected layers to better learn temporal structures of music audio. Particularly, our end-to-end deep architecture contains two properties: simultaneously implementing feature learning and cross-modal correlation learning, and learning joint representation by considering temporal structures. Experimental results, using audio to retrieve lyrics or using lyrics to retrieve audio, verify the effectiveness of the proposed deep correlation learning architectures in cross-modal music retrieval.

cs.IR↗

arXiv2017

Set-membership improved normalized subband adaptive filter algorithms for acoustic echo cancellation

In order to improve the performances of recently-presented improved normalized subband adaptive filter (INSAF) and proportionate INSAF algorithms for highly noisy system, this paper proposes their set-membership versions by exploiting the theory of set-membership filtering. Apart from obtaining smaller steady-state error, the proposed algorithms significantly reduce the overall computational complexity. In addition, to further improve the steady-state performance for the algorithms, their smooth variants are developed by using the smoothed absolute subband output errors to update the step sizes. Simulation results in the context of acoustic echo cancellation have demonstrated the superiority of the proposed algorithms.

eess.SY↗

arXiv2017

Opinion diversity and community formation in adaptive networks

It is interesting and of significant importance to investigate how network structures co-evolve with opinions. The existing models of such co-evolution typically lead to the final states where network nodes either reach a global consensus or break into separated communities, each of which holding its own community consensus. Such results, however, can hardly explain the richness of real-life observations that opinions are always diversified with no global or even community consensus, and people seldom, if not never, totally cut off themselves from dissenters. In this article, we show that, a simple model integrating consensus formation, link rewiring and opinion change allows complex system dynamics to emerge, driving the system into a dynamic equilibrium with co-existence of diversified opinions. Specifically, similar opinion holders may form into communities yet with no strict community consensus; and rather than being separated into disconnected communities, different communities remain to be interconnected by non-trivial proportion of inter-community links. More importantly, we show that the complex dynamics may lead to different numbers of communities at steady state with a given tolerance between different opinion holders. We construct a framework for theoretically analyzing the co-evolution process. Theoretical analysis and extensive simulation results reveal some useful insights into the complex co-evolution process, including the formation of dynamic equilibrium, the phase transition between different steady states with different numbers of communities, and the dynamics between opinion distribution and network modularity, etc.

physics.soc-ph↗

arXiv2017

Influence of random opinion change in complex networks

Opinion formation in the population has attracted extensive research interest. Various models have been introduced and studied, including the ones with individuals' free will allowing them to change their opinions. Such models, however, have not taken into account the fact that individuals with different opinions may have different levels of loyalty, and consequently, different probabilities of changing their opinions. In this work, we study on how the non-uniform distribution of the opinion changing probability may affect the final state of opinion distribution. By simulating a few different cases with different symmetric and asymmetric non-uniform patterns of opinion changing probabilities, we demonstrate the significant effects that the different loyalty levels of different opinions have on the final state of the opinion distribution.

cs.SI↗

arXiv2017

Preliminary Study on Bit-String Modelling of Opinion Formation in Complex Networks

Opinion formation has been gaining increasing research interests recently, and various models have been proposed. These models, however, have their limitations, among which noticeably include (i) it is generally assumed that adjacent nodes holding similar opinions will further reduce their difference in between, while adjacent nodes holding significantly different opinions would either do nothing, or cut the link in between them; (ii) opinion mutation, which describes "opinion changes not due to neighborhood influences" in real life, is typically random. While such models enjoy their simplicity and nevertheless help reveal lots of useful insights, they lack the capability of describing many complex behaviors which we may easily observe in real life. In this paper, we propose a new bit-string modeling approach. Preliminary study on the new model demonstrates its great potentials in revealing complex behaviors of social opinion evolution and formation.

physics.soc-ph↗

arXiv2016

A joint-optimization NSAF algorithm based on the first-order Markov model

Recently, the normalized subband adaptive filter (NSAF) algorithm has attracted much attention for handling the colored input signals. Based on the first-order Markov model of the optimal tap-weight vector, this paper provides a convergence analysis of the standard NSAF. Following the analysis, both the step size and the regularization parameter in the NSAF are jointly optimized in such a way that minimizes the mean square deviation. The resulting joint-optimization step size and regularization parameter (JOSR-NSAF) algorithm achieves a good tradeoff between fast convergence rate and low steady-state error. Simulation results in the context of acoustic echo cancellation demonstrate good features of the proposed algorithm.

eess.SY↗

arXiv2016

Estimating whole brain dynamics using spectral clustering

The estimation of time-varying networks for functional Magnetic Resonance Imaging (fMRI) data sets is of increasing importance and interest. In this work, we formulate the problem in a high-dimensional time series framework and introduce a data-driven method, namely Network Change Points Detection (NCPD), which detects change points in the network structure of a multivariate time series, with each component of the time series represented by a node in the network. NCPD is applied to various simulated data and a resting-state fMRI data set. This new methodology also allows us to identify common functional states within and across subjects. Finally, NCPD promises to offer a deep insight into the large-scale characterisations and dynamics of the brain

stat.AP↗

arXiv2016

A Band-independent Variable Step Size Proportionate Normalized Subband Adaptive Filter Algorithm

Proportionate-type normalized suband adaptive filter (PNSAF-type) algorithms are very attractive choices for echo cancellation. To further obtain both fast convergence rate and low steady-state error, in this paper, a variable step size (VSS) version of the presented improved PNSAF (IPNSAF) algorithm is proposed by minimizing the square of the noise-free a posterior subband error signals. A noniterative shrinkage method is used to recover the noise-free a priori subband error signals from the noisy subband error signals. Significantly, the proposed VSS strategy can be applied to any other PNSAF-type algorithm, since it is independent of the proportionate principles. Simulation results in the context of acoustic echo cancellation have demonstrated the effectiveness of the proposed method.

eess.SY↗

arXiv2016

Demonstration of a self-pulsing photonic crystal Fano laser

Semiconductor lasers in use today rely on mirrors based on the reflection at a cleaved facet or Bragg reflection from a periodic stack of layers. Here, we demonstrate an ultra-small laser with a mirror based on the Fano resonance between a continuum of waveguide modes and the discrete resonance of a nanocavity. The Fano resonance leads to unique laser characteristics. Since the Fano mirror is very narrow-band compared to conventional lasers, the laser is single-mode and in particular, it can be modulated via the mirror. We show, experimentally and theoretically, that nonlinearities in the mirror may even promote the generation of a self-sustained train of pulses at gigahertz frequencies, an effect that was previously only observed in macroscopic lasers. Such a source is of interest for a number of applications within integrated photonics.

physics.optics↗