arXiv subjects

Feng Yu

Publications and source records attributed to Feng Yu.

At least 109 records · Page 6Linked to original sources

arXiv2020

TFNet: Multi-Semantic Feature Interaction for CTR Prediction

The CTR (Click-Through Rate) prediction plays a central role in the domain of computational advertising and recommender systems. There exists several kinds of methods proposed in this field, such as Logistic Regression (LR), Factorization Machines (FM) and deep learning based methods like Wide&Deep, Neural Factorization Machines (NFM) and DeepFM. However, such approaches generally use the vector-product of each pair of features, which have ignored the different semantic spaces of the feature interactions. In this paper, we propose a novel Tensor-based Feature interaction Network (TFNet) model, which introduces an operating tensor to elaborate feature interactions via multi-slice matrices in multiple semantic spaces. Extensive offline and online experiments show that TFNet: 1) outperforms the competitive compared methods on the typical Criteo and Avazu datasets; 2) achieves large improvement of revenue and click rate in online A/B tests in the largest Chinese App recommender system, Tencent MyApp.

cs.IR↗

arXiv2020

TAGNN: Target Attentive Graph Neural Networks for Session-based Recommendation

Session-based recommendation nowadays plays a vital role in many websites, which aims to predict users' actions based on anonymous sessions. There have emerged many studies that model a session as a sequence or a graph via investigating temporal transitions of items in a session. However, these methods compress a session into one fixed representation vector without considering the target items to be predicted. The fixed vector will restrict the representation ability of the recommender model, considering the diversity of target items and users' interests. In this paper, we propose a novel target attentive graph neural network (TAGNN) model for session-based recommendation. In TAGNN, target-aware attention adaptively activates different user interests with respect to varied target items. The learned interest representation vector varies with different target items, greatly improving the expressiveness of the model. Moreover, TAGNN harnesses the power of graph neural networks to capture rich item transitions in sessions. Comprehensive experiments conducted on real-world datasets demonstrate its superiority over state-of-the-art methods.

cs.IR↗

arXiv2019

An Algorithm for Graph-Fused Lasso Based on Graph Decomposition

This work proposes a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. The proposed method applies the alternating direction method of multipliers (ADMM) algorithm and is based on the decomposition of the objective function into two components. While ADMM has been widely used in this problem, existing works such as network lasso decompose the objective function into the loss function component and the total variation penalty component. In comparison, this work proposes to decompose the objective function into two components, where one component is the loss function plus part of the total variation penalty, and the other component is the remaining total variation penalty. Compared with the network lasso algorithm, this method has a smaller computational cost per iteration and converges faster in most simulations numerically.

math.OC↗

arXiv2019

Security analysis of a self-embedding fragile image watermark scheme

Recently, a self-embedding fragile watermark scheme based on reference-bits interleaving and adaptive selection of embedding mode was proposed. Reference bits are derived from the scrambled MSB bits of a cover image, and then are combined with authentication bits to form the watermark bits for LSB embedding. We find this algorithm has a feature of block independence of embedding watermark such that it is vulnerable to a collage attack. In addition, because the generation of authentication bits via hash function operations is not related to secret keys, we analyze this algorithm by a multiple stego-image attack. We find that the cost of obtaining all the permutation relations of $l\cdot b^2$ watermark bits of each block (i.e., equivalent permutation keys) is about $(l\cdot b^2)!$ for the embedding mode $(m, l)$, where $m$ MSB layers of a cover image are used for generating reference bits and $l$ LSB layers for embedding watermark, and $b\times b$ is the size of image block. The simulation results and the statistical results demonstrate our analysis is effective.

cs.CR↗

arXiv2019

Global well-posedness of advective Lotka-Volterra competition systems with nonlinear diffusion

This paper investigates the global well-posedness of a class of reaction-advection-diffusion models with nonlinear diffusion and Lotka-Volterra dynamics. We prove the existence and uniform boundedness of the global-in-time solutions to the fully parabolic systems under certain growth conditions on the diffusion and sensitivity functions. Global existence and uniform boundedness of the corresponding parabolic-elliptic system are also obtained. Our results suggest that attraction (positive taxis) inhibits blowups in Lotka-Volterra competition systems.

math.AP↗

arXiv2019

Learning Longer-term Dependencies via Grouped Distributor Unit

Learning long-term dependencies still remains difficult for recurrent neural networks (RNNs) despite their success in sequence modeling recently. In this paper, we propose a novel gated RNN structure, which contains only one gate. Hidden states in the proposed grouped distributor unit (GDU) are partitioned into groups. For each group, the proportion of memory to be overwritten in each state transition is limited to a constant and is adaptively distributed to each group member. In other word, every separate group has a fixed overall update rate, yet all units are allowed to have different paces. Information is therefore forced to be latched in a flexible way, which helps the model to capture long-term dependencies in data. Besides having a simpler structure, GDU is demonstrated experimentally to outperform LSTM and GRU on tasks including both pathological problems and natural data set.

cs.NE↗

arXiv2018

Differential cryptanalysis of image cipher using block-based scrambling and image filtering

Recently, an image encryption algorithm using block-based scrambling and image filtering has been proposed by Hua et al. In this paper, we analyze the security problems of the encryption algorithm in detail and break the encryption by a codebook attack. We construct an linear relation between plain-images and cipher-images by differential cryptanalysis. With this linear relation, we build a codebook containing $(M \times N + 1)$ pairs of plain-images and cipher-images, where $M\times N$ is the size of images. The proposed codebook attack indicates that the encryption scheme is insecure. To resist the codebook attack, an improved algorithm is proposed. Experimental results show that the improved algorithm not only inherits the merits of the original scheme, but also has stronger security against the differential cryptanalysis.

cs.CR↗

arXiv2018

Complete long-term corrosion protection with chemical vapor deposited graphene

Despite the numerous reports on the topic, examples of chemical vapor deposited (CVD) graphene-based anticorrosive coatings able to provide long-term protection (i.e., several months) of metals are still unavailable. Here, we finally present a polymer-graphene hybrid coating, comprising two single layers of CVD graphene sandwiched by three layers of polyvinyl butyral, that provides complete corrosion protection to commercial aluminum alloys even after 120 days of exposure to simulated seawater. The essential role played by graphene in the hybrid coating is evident when we compare the results from a polymer-only coating of the same thickness, which fails in protecting the metal after barely 30 days. With the emergence of commercially available large-area CVD graphene, our work demonstrates a straightforward approach towards high-performance anticorrosive coatings, which can be extended to other two-dimensional materials and polymers, for long-term protection of various relevant metals and alloys.

cond-mat.mtrl-sci↗

arXiv2017

An efficient alternative to Ollivier-Ricci curvature based on the Jaccard metric

We study Ollivier-Ricci curvature, a discrete version of Ricci curvature, which has gained popularity over the past several years and has found applications in diverse fields. However, the Ollivier-Ricci curvature requires an optimal mass transport problem to be solved, which can be computationally expensive for large networks. In view of this, we propose two alternative measures of curvature to Ollivier-Ricci which are motivated by the Jaccard coefficient and are demonstrably less computationally intensive, a cheaper Jaccard (JC) and a more expensive generalized Jaccard (gJC) curvature metric. We show theoretically that the gJC closely matches the Ollivier-Ricci curvature for Erdos-Renyi graphs in the asymptotic regime of large networks. Furthermore, we study the goodness of approximation between the proposed curvature metrics and Ollivier-Ricci curvature for several network models and real networks. Our results suggest that in comparison to an alternative curvature metric for graphs, the Forman-Ricci curvature, the gJC exhibits a reasonably good fit to the Ollivier-Ricci curvature for a wide range of networks, while the JC is shown to be a good proxy only for certain scenarios.

cs.SI↗

arXiv2017

Mining Significant Microblogs for Misinformation Identification: An Attention-based Approach

With the rapid growth of social media, massive misinformation is also spreading widely on social media, such as microblog, and bring negative effects to human life. Nowadays, automatic misinformation identification has drawn attention from academic and industrial communities. For an event on social media usually consists of multiple microblogs, current methods are mainly based on global statistical features. However, information on social media is full of noisy and outliers, which should be alleviated. Moreover, most of microblogs about an event have little contribution to the identification of misinformation, where useful information can be easily overwhelmed by useless information. Thus, it is important to mine significant microblogs for a reliable misinformation identification method. In this paper, we propose an Attention-based approach for Identification of Misinformation (AIM). Based on the attention mechanism, AIM can select microblogs with largest attention values for misinformation identification. The attention mechanism in AIM contains two parts: content attention and dynamic attention. Content attention is calculated based textual features of each microblog. Dynamic attention is related to the time interval between the posting time of a microblog and the beginning of the event. To evaluate AIM, we conduct a series of experiments on the Weibo dataset and the Twitter dataset, and the experimental results show that the proposed AIM model outperforms the state-of-the-art methods.

cs.IR↗

arXiv2016

A Prudent-Precedence Concurrency Control Protocol for High Data Contention Database Enviornments

In this paper, we propose a concurrency control protocol, called the Prudent-Precedence Concurrency Control (PPCC) protocol, for high data contention database environments. PPCC is prudently more aggressive in permitting more serializable schedules than two-phase locking. It maintains a restricted precedence among conflicting transactions and commits the transactions according to the serialization order established in the executions. A detailed simulation model has been constructed and extensive experiments have been conducted to evaluate the performance of the proposed approach. The results demonstrate that the proposed algorithm outperforms the two-phase locking and optimistic concurrency control in all ranges of system workload.

cs.DB↗

arXiv2016

Stationary and time periodic patterns of two-predator and one-prey systems with prey-taxis

This paper concerns pattern formation in a class of reaction-advection-diffusion systems modeling the population dynamics of two predators and one prey. We consider the biological situation that both predators forage along the population density gradient of the preys which can defend themselves as a group. We prove the global existence and uniform boundedness of positive classical solutions for the fully parabolic system over a bounded domain with space dimension $N=1,2$ and for the parabolic- -parabolic-elliptic system over higher space dimensions. Linearized stability analysis shows that prey-taxis stabilizes the positive constant equilibrium if there is no group defense while it destabilizes the equilibrium otherwise. Then we obtain stationary and time-periodic nontrivial solutions of the system that bifurcate from the positive constant equilibrium. Moreover, the stability of these solutions is also analyzed in detail which provides a wave mode selection mechanism of nontrivial patterns for this strongly coupled system. Finally, we perform numerical simulations to illustrate and support our theoretical results.

math.AP↗

arXiv2016

ICE: Information Credibility Evaluation on Social Media via Representation Learning

With the rapid growth of social media, rumors are also spreading widely on social media and bring harm to people's daily life. Nowadays, information credibility evaluation has drawn attention from academic and industrial communities. Current methods mainly focus on feature engineering and achieve some success. However, feature engineering based methods require a lot of labor and cannot fully reveal the underlying relations among data. In our viewpoint, the key elements of user behaviors for evaluating credibility are concluded as "who", "what", "when", and "how". These existing methods cannot model the correlation among different key elements during the spreading of microblogs. In this paper, we propose a novel representation learning method, Information Credibility Evaluation (ICE), to learn representations of information credibility on social media. In ICE, latent representations are learnt for modeling user credibility, behavior types, temporal properties, and comment attitudes. The aggregation of these factors in the microblog spreading process yields the representation of a user's behavior, and the aggregation of these dynamic representations generates the credibility representation of an event spreading on social media. Moreover, a pairwise learning method is applied to maximize the credibility difference between rumors and non-rumors. To evaluate the performance of ICE, we conduct experiments on a Sina Weibo data set, and the experimental results show that our ICE model outperforms the state-of-the-art methods.

cs.SI↗

arXiv2013

Conditioning the logistic branching process on non-extinction

We consider a birth and death process in which death is due to both `natural death' and to competition between individuals, modelled as a quadratic function of population size. The resulting `logistic branching process' has been proposed as a model for numbers of individuals in populations competing for some resource, or for numbers of species. However, because of the quadratic death rate, even if the intrinsic growth rate is positive, the population will, with probability one, die out in finite time. There is considerable interest in understanding the process conditioned on non-extinction. In this paper, we exploit a connection with the ancestral selection graph of population genetics to find expressions for the transition rates in the logistic branching process conditioned on survival until some fixed time $T$, in terms of the distribution of a certain one-dimensional diffusion process at time $T$. We also find the probability generating function of the Yaglom distribution of the process and rather explicit expressions for the transition rates for the so-called Q-process, that is the logistic branching process conditioned to stay alive into the indefinite future. For this process, one can write down the joint generator of the (time-reversed) total population size and what in population genetics would be called the `genealogy' and in phylogenetics would be called the `reconstructed tree' of a sample from the population. We explore some ramifications of these calculations numerically.

math.PR↗

arXiv2013

Computing Traversal Times on Dynamic Markovian Paths

In source routing, a complete path is chosen for a packet to travel from source to destination. While computing the time to traverse such a path may be straightforward in a fixed, static graph, doing so becomes much more challenging in dynamic graphs, in which the state of an edge in one time slot (i.e., its presence or absence) is random, and may depend on its state in the previous time step. The traversal time is due to both time spent waiting for edges to appear and time spent crossing them once they become available. We compute the expected traversal time (ETT) for a dynamic path in a number of special cases of stochastic edge dynamics models, and for three edge failure models, culminating in a surprisingly challenging yet realistic setting in which the initial configuration of edge states for the entire path is known. We show that the ETT for this "initial configuration" setting can be computed in quadratic time, by an algorithm based on probability generating functions. We also give several linear-time upper and lower bounds on the ETT.

cs.NI↗

arXiv2010

Asymptotic behavior of the rate of adaptation

We consider the accumulation of beneficial and deleterious mutations in large asexual populations. The rate of adaptation is affected by the total mutation rate, proportion of beneficial mutations and population size $N$. We show that regardless of mutation rates, as long as the proportion of beneficial mutations is strictly positive, the adaptation rate is at least $\mathcal{O}(\log^{1-δ}N)$ where $δ$ can be any small positive number, if the population size is sufficiently large. This shows that if the genome is modeled as continuous, there is no limit to natural selection, that is, the rate of adaptation grows in $N$ without bound.

math.PR↗

arXiv2008

Fixation Probability for Competing Selective Sweeps

We consider a biological population in which a beneficial mutation is undergoing a selective sweep when a second beneficial mutation arises at a linked locus and we investigate the probability that both mutations will eventually fix in the population. Previous work has dealt with the case where the second mutation to arise confers a smaller benefit than the first. In that case population size plays almost no role. Here we consider the opposite case and observe that, by contrast, the probability of both mutations fixing can be heavily dependent on population size. Indeed the key parameter is $ρN$, the product of the population size and the recombination rate between the two selected loci. If $ρN$ is small, the probability that both mutations fix can be reduced through interference to almost zero while for large $ρN$ the mutations barely influence one another. The main rigorous result is a method for calculating the fixation probability of a double mutant in the large population limit.

math.PR↗

arXiv2007

Stationary distribution for dioecious branching particle systems with rapid stirring

We study dioecious (i.e., two-sex) branching particle system models, where there are two types of particles, modeling the male and female populations, and where birth of new particles requires the presence of both male and female particles. We show that stationary distributions of various dioecious branching particle models are nontrivial under certain conditions, for example, when there is sufficiently fast stirring.

math.PR↗