IRAug 27, 2020
Time-based Sequence Model for Personalization and Recommendation SystemsTigran Ishkhanov, Maxim Naumov, Xianjie Chen et al.
In this paper we develop a novel recommendation model that explicitly incorporates time information. The model relies on an embedding layer and TSL attention-like mechanism with inner products in different vector spaces, that can be thought of as a modification of multi-headed attention. This mechanism allows the model to efficiently treat sequences of user behavior of different length. We study the properties of our state-of-the-art model on statistically designed data set. Also, we show that it outperforms more complex models with longer sequence length on the Taobao User Behavior dataset.
MLSep 15, 2019
Machine Discovery of Partial Differential Equations from Spatiotemporal DataYe Yuan, Junlin Li, Liang Li et al.
The study presents a general framework for discovering underlying Partial Differential Equations (PDEs) using measured spatiotemporal data. The method, called Sparse Spatiotemporal System Discovery ($\text{S}^3\text{d}$), decides which physical terms are necessary and which can be removed (because they are physically negligible in the sense that they do not affect the dynamics too much) from a pool of candidate functions. The method is built on the recent development of Sparse Bayesian Learning; which enforces the sparsity in the to-be-identified PDEs, and therefore can balance the model complexity and fitting error with theoretical guarantees. Without leveraging prior knowledge or assumptions in the discovery process, we use an automated approach to discover ten types of PDEs, including the famous Navier-Stokes and sine-Gordon equations, from simulation data alone. Moreover, we demonstrate our data-driven discovery process with the Complex Ginzburg-Landau Equation (CGLE) using data measured from a traveling-wave convection experiment. Our machine discovery approach presents solutions that has the potential to inspire, support and assist physicists for the establishment of physical laws from measured spatiotemporal data, especially in notorious fields that are often too complex to allow a straightforward establishment of physical law, such as biophysics, fluid dynamics, neuroscience or nonlinear optics.
CRAug 29, 2019
Cyber security insights into self-proclaimed virtual world hackersNicholas Patterson, Michael Hobbs, Frank Jiang et al.
Virtual worlds have become highly popular in recent years with reports of over a billion people accessing these environments and the virtual goods market growing to near 50 billion US dollars. An undesirable outcome to this popularity and market value is thriving criminal activity in these worlds. The most profitable cyber security problem in virtual worlds is named Virtual Property Theft. The aim of this study is to use an online survey to gain insight into how hackers (n=100) in these synthetic worlds conduct their criminal activity. This survey is the first to report an insight into the criminal mind of hackers (virtual thieves). Results showed a clear-cut profile of a virtual property thief, they appear to be mainly aged 20-24 years of age, live in the United States of America, while using virtual worlds for 5-7 hours a day. These and the other key results of this study will provide a pathway for designing an effective anti-theft framework capable of abolishing this cyber security issue.
LGNov 10, 2016
Using Neural Networks to Compute Approximate and Guaranteed Feasible Hamilton-Jacobi-Bellman PDE SolutionsFrank Jiang, Glen Chou, Mo Chen et al.
To sidestep the curse of dimensionality when computing solutions to Hamilton-Jacobi-Bellman partial differential equations (HJB PDE), we propose an algorithm that leverages a neural network to approximate the value function. We show that our final approximation of the value function generates near optimal controls which are guaranteed to successfully drive the system to a target state. Our framework is not dependent on state space discretization, leading to a significant reduction in computation time and space complexity in comparison with dynamic programming-based approaches. Using this grid-free approach also enables us to plan over longer time horizons with relatively little additional computation overhead. Unlike many previous neural network HJB PDE approximating formulations, our approximation is strictly conservative and hence any trajectories we generate will be strictly feasible. For demonstration, we specialize our new general framework to the Dubins car model and discuss how the framework can be applied to other models with higher-dimensional state spaces.