Searcharxiv⌕ Search

arXiv subjects

Zhaoyang Liu

Publications and source records attributed to Zhaoyang Liu.

82 records · Page 5Linked to original sources

CausCF: Causal Collaborative Filtering for RecommendationEffect Estimation

To improve user experience and profits of corporations, modern industrial recommender systems usually aim to select the items that are most likely to be interacted with (e.g., clicks and purchases). However, they overlook the fact that users may purchase the items even without recommendations. To select these effective items, it is essential to estimate the causal effect of recommendations. The real effective items are the ones which can contribute to purchase probability uplift. Nevertheless, it is difficult to obtain the real causal effect since we can only recommend or not recommend an item to a user at one time. Furthermore, previous works usually rely on the randomized controlled trial~(RCT) experiment to evaluate their performance. However, it is usually not practicable in the recommendation scenario due to its unavailable time consuming. To tackle these problems, in this paper, we propose a causal collaborative filtering~(CausCF) method inspired by the widely adopted collaborative filtering~(CF) technique. It is based on the idea that similar users not only have a similar taste on items, but also have similar treatment effect under recommendations. CausCF extends the classical matrix factorization to the tensor factorization with three dimensions -- user, item, and treatment. Furthermore, we also employs regression discontinuity design (RDD) to evaluate the precision of the estimated causal effects from different models. With the testable assumptions, RDD analysis can provide an unbiased causal conclusion without RCT experiments. Through dedicated experiments on both the public datasets and the industrial application, we demonstrate the effectiveness of our proposed CausCF on the causal effect estimation and ranking performance improvement.

cs.IR↗

Contrastive Learning for Sequential Recommendation

Sequential recommendation methods play a crucial role in modern recommender systems because of their ability to capture a user's dynamic interest from her/his historical interactions. Despite their success, we argue that these approaches usually rely on the sequential prediction task to optimize the huge amounts of parameters. They usually suffer from the data sparsity problem, which makes it difficult for them to learn high-quality user representations. To tackle that, inspired by recent advances of contrastive learning techniques in the computer version, we propose a novel multi-task model called \textbf{C}ontrastive \textbf{L}earning for \textbf{S}equential \textbf{Rec}ommendation~(\textbf{CL4SRec}). CL4SRec not only takes advantage of the traditional next item prediction task but also utilizes the contrastive learning framework to derive self-supervision signals from the original user behavior sequences. Therefore, it can extract more meaningful user patterns and further encode the user representation effectively. In addition, we propose three data augmentation approaches to construct self-supervision signals. Extensive experiments on four public datasets demonstrate that CL4SRec achieves state-of-the-art performance over existing baselines by inferring better user representations.

cs.IR↗

DeeperForensics Challenge 2020 on Real-World Face Forgery Detection: Methods and Results

This paper reports methods and results in the DeeperForensics Challenge 2020 on real-world face forgery detection. The challenge employs the DeeperForensics-1.0 dataset, one of the most extensive publicly available real-world face forgery detection datasets, with 60,000 videos constituted by a total of 17.6 million frames. The model evaluation is conducted online on a high-quality hidden test set with multiple sources and diverse distortions. A total of 115 participants registered for the competition, and 25 teams made valid submissions. We will summarize the winning solutions and present some discussions on potential research directions.

cs.CV↗

Dividend Barrier Strategies in a Renewal Risk Model With Phase-Type Distributed Interclaim Times

In this paper, we consider the optimal dividend problem of the renewal risk model with phase-type distributed interclaim times and exponentially distributed claim sizes. Assume that the phases of the interclaim times can be observed. We study the optimal dividend under the 2--order and the $n$--order ($n\ge 3$)separately. In the case of 2--order phase-type distributed interclaim times, we show that the optimal dividend policy is the optimal phase-wise barrier strategy. As a byproduct, we find that in this case, the phase with higher barrier is the phase with the higher intensity to the next claim. In the case of n-order ($n\ge3$) phase-type distributed interclaim times, an iteration algorithm is presented to show that the optimal phase-wise barrier strategy is optimal among all dividend policies. We also find a similar conclusion like in the case of 2--order, the phase with the highest barrier is the phase with the highest intensity to the next claim.

math.OC↗

The theoretical study on intermittency and propagation of geodesic acoustic mode in L- mode discharge near tokamak edge

Through a systematically developed theory, we demonstrate that the motion of instanton identified in [Y. Z. Zhang, Z. Y. Liu, T. Xie, S. M. Mahajan, and J. Liu, Physics of Plasmas 24, 122304 (2017)] is highly correlated to the intermittent excitation and propagation of geodesic acoustic mode (GAM) that are observed in tokamaks. While many numerical simulations have observed the phenomena, it is the first theory that reveals the physical mechanism behind GAM intermittent excitation and propagation. The preceding work is based on the micro-turbulence associated with toroidal ion temperature gradient (ITG) mode, and slab-based phenomenological model of zonal flow. When full toroidal effect are introduced into the system, two branches of zonal flow emerge: the torus-modified low frequency zonal flow (TLFZF), and GAM, necessitating a unified exploration of GAM and TLFZF. Indeed, we observe that the transition (decay) from the caviton to instanton is triggered by a rapid zero-crossing of radial group velocity of drift wave and is found to be strongly correlated with the GAM onset. Many features peculiar to intermittent GAMs, observed in real machines, are thus identified in the numerical experiment. The results will be displayed in figures and in a movie; first for single central rational surface, and then with coupled multiple central rational surfaces. The periodic bursting first shown disappears as being replaced by irregular one, more similar to the intermittent characteristics observed in GAM experiments.

physics.plasm-ph↗

Dynamic Sampling Networks for Efficient Action Recognition in Videos

The existing action recognition methods are mainly based on clip-level classifiers such as two-stream CNNs or 3D CNNs, which are trained from the randomly selected clips and applied to densely sampled clips during testing. However, this standard setting might be suboptimal for training classifiers and also requires huge computational overhead when deployed in practice. To address these issues, we propose a new framework for action recognition in videos, called {\em Dynamic Sampling Networks} (DSN), by designing a dynamic sampling module to improve the discriminative power of learned clip-level classifiers and as well increase the inference efficiency during testing. Specifically, DSN is composed of a sampling module and a classification module, whose objective is to learn a sampling policy to on-the-fly select which clips to keep and train a clip-level classifier to perform action recognition based on these selected clips, respectively. In particular, given an input video, we train an observation network in an associative reinforcement learning setting to maximize the rewards of the selected clips with a correct prediction. We perform extensive experiments to study different aspects of the DSN framework on four action recognition datasets: UCF101, HMDB51, THUMOS14, and ActivityNet v1.3. The experimental results demonstrate that DSN is able to greatly improve the inference efficiency by only using less than half of the clips, which can still obtain a slightly better or comparable recognition accuracy to the state-of-the-art approaches.

cs.CV↗

Sequential Recommendation with Self-Attentive Multi-Adversarial Network

Recently, deep learning has made significant progress in the task of sequential recommendation. Existing neural sequential recommenders typically adopt a generative way trained with Maximum Likelihood Estimation (MLE). When context information (called factor) is involved, it is difficult to analyze when and how each individual factor would affect the final recommendation performance. For this purpose, we take a new perspective and introduce adversarial learning to sequential recommendation. In this paper, we present a Multi-Factor Generative Adversarial Network (MFGAN) for explicitly modeling the effect of context information on sequential recommendation. Specifically, our proposed MFGAN has two kinds of modules: a Transformer-based generator taking user behavior sequences as input to recommend the possible next items, and multiple factor-specific discriminators to evaluate the generated sub-sequence from the perspectives of different factors. To learn the parameters, we adopt the classic policy gradient method, and utilize the reward signal of discriminators for guiding the learning of the generator. Our framework is flexible to incorporate multiple kinds of factor information, and is able to trace how each factor contributes to the recommendation decision over time. Extensive experiments conducted on three real-world datasets demonstrate the superiority of our proposed model over the state-of-the-art methods, in terms of effectiveness and interpretability.

cs.IR↗

TEINet: Towards an Efficient Architecture for Video Recognition

Efficiency is an important issue in designing video architectures for action recognition. 3D CNNs have witnessed remarkable progress in action recognition from videos. However, compared with their 2D counterparts, 3D convolutions often introduce a large amount of parameters and cause high computational cost. To relieve this problem, we propose an efficient temporal module, termed as Temporal Enhancement-and-Interaction (TEI Module), which could be plugged into the existing 2D CNNs (denoted by TEINet). The TEI module presents a different paradigm to learn temporal features by decoupling the modeling of channel correlation and temporal interaction. First, it contains a Motion Enhanced Module (MEM) which is to enhance the motion-related features while suppress irrelevant information (e.g., background). Then, it introduces a Temporal Interaction Module (TIM) which supplements the temporal contextual information in a channel-wise manner. This two-stage modeling scheme is not only able to capture temporal structure flexibly and effectively, but also efficient for model inference. We conduct extensive experiments to verify the effectiveness of TEINet on several benchmarks (e.g., Something-Something V1&V2, Kinetics, UCF101 and HMDB51). Our proposed TEINet can achieve a good recognition accuracy on these datasets but still preserve a high efficiency.

cs.CV↗

Measure-Valued Generators of General Piecewise Deterministic Markov Processes

We consider a piecewise-deterministic Markov process (PDMP) with general conditional distribution of inter-occurrence time, which is called a general PDMP here. Our purpose is to establish the theory of measure-valued generator for general PDMPs. The additive functional of a semi-dynamic system (SDS) is introduced firstly, which presents us an analytic tool for the whole paper. The additive functionals of a general PDMP are represented in terms of additive functionals of the SDS. The necessary and sufficient conditions of being a local martingale or a special semimartingale for them are given. The measure-valued generator for a general PDMP is introduced, which takes value in the space of additive functionals of the SDS. And its domain is completely described by analytic conditions. The domain is extended to the locally (path-)finite variation functions. As an application of measure-valued generator, we study the expected cumulative discounted value of an additive functional of the general PDMP, and get a measure integro-differential equation satisfied by the expected cumulative discounted value function.

math.PR↗

Exponential Change of Measure for General Piecewise Deterministic Markov Processes

We consider a general piecewise deterministic Markov process (PDMP) $X=\{X_t\}_{t\geqslant 0}$ with measure-valued generator $\mathcal{A}$, for which the conditional distribution function of the inter-occurrence time is not necessarily absolutely continuous. A general form of the exponential martingales is presented as $$M^f_t=\frac{f(X_t)}{f(X_0)}\left[\mathrm{Sexp}\left(\int_{(0,t]}\frac{\mathrm{d}L(\mathcal{A}f)_s}{f(X_{s-})}\right)\right]^{-1}.$$ Using this exponential martingale as a likelihood ratio process, we define a new probability measure. It is shown that the original process remains a general PDMP under the new probability measure. And we find the new measure-valued generator and its domain.

math.PR↗