Proposes using frequent sequences to improve sequential recommendation models.
problem Combining user history and recent actions for personalized recommendations.
method Uses frequent sequences to identify relevant parts of user history, embedding items based on preferences and dynamics in a unified metric model.
result Outperforms state-of-the-art methods, especially on sparse datasets.
Attention forcing improves sequence-to-sequence model training stability.
problem Training auto-regressive sequence-to-sequence models with attention mechanism is challenging.
method Attention forcing guides the model with generated output history and reference attention.
result Attention forcing trains models to recover from mistakes without requiring a schedule or classifier.
Machine-assisted treatment recommendations hold a promise to reduce physician time and decision errors. We formulate the task as a sequence-to-sequence prediction model that takes the entire time-ordered medical history as input, and predicts a sequence of future clinical procedures and medications. It is built on the …
Memory-Augmented Recurrent Networks improve dialogue coherence by expanding conversation history storage.
problem Fixed-size vectors limit dialogue coherence; attention mechanisms are computationally expensive.
method Introduce Neural Turing Machines (NTMs) to provide flexible and permanent storage for dialogue history.
result Improved perplexity performance compared to existing baselines.
Users form information trails as they browse the web, checkin with a geolocation, rate items, or consume media. A common problem is to predict what a user might do next for the purposes of guidance, recommendation, or prefetching. First-order and higher-order Markov chains have been widely used methods to study such se…
Improved Transformer language models using dynamic evaluation.
problem Language model perplexity and accuracy improvements.
method Combining Transformers with dynamic evaluation techniques.
result Significant improvement in language model performance (e.g., 0.99 to 0.94 bits/char).
CRN model estimates treatment effects over time using adversarial balancing.
problem Estimating treatment effects over time in medical settings.
method Adversarial domain balancing to remove time-varying confounders.
result CRN achieves lower error in estimating counterfactuals and treatment timing.
Study examines Bitcoin's price history and identifies recurring events.
problem Understanding Bitcoin's price fluctuations and recurring events.
method Analyzed BTC price time-series (2010-2021), identified recurring events, and approximated price evolution using a Fibonacci sequence.
result BTC price history shows recurring events with similar duration and can be approximated using a Fibonacci sequence.
Variational autoencoders were proven successful in domains such as computer vision and speech processing. Their adoption for modeling user preferences is still unexplored, although recently it is starting to gain attention in the current literature. In this work, we propose a model which extends variational autoencoder…
DR-FRL learns functional states from irregular histories for causal inference.
problem Causal inference with irregularly sampled longitudinal data.
method DR-FRL workflow combining functional and temporal encoders, nuisance heads, and EIF-targeted validation.
result DR-FRL can improve causal inference when pseudo-outcomes are heavy-tailed or measurement is informative.
This thesis investigates unsupervised time series representation learning for sequence prediction problems, i.e. generating nice-looking input samples given a previous history, for high dimensional input sequences by decoupling the static input representation from the recurrent sequence representation. We introduce thr…
The α-Alternator adapts to varying noise levels in sequences, improving robustness and performance.
problem Current models assume uniform noise levels, limiting performance on noisy temporal data.
method Introduces α-Alternator using Vendi Score to dynamically adjust noise sensitivity. result Outperforms Alternators and state-of-the-art models in trajectory prediction, imputation, and forecasting.
Click through rate (CTR) prediction is very important for Native advertisement but also hard as there is no direct query intent. In this paper we propose a large-scale event embedding scheme to encode the each user browsing event by training a Siamese network with weak supervision on the users' consecutive events. The …
BLOB combines organic and bandit signals for better user interest estimation.
problem Combining organic and bandit signals for improved user interest estimation.
method Bayesian Latent Organic Bandit (BLOB) model using variational auto-encoders and local re-parametrization.
result BLOB outperforms organic and bandit-based methods in both organic and bandit-rich environments.
We consider the problem of estimating the evolutionary history of a set of species (phylogeny or species tree) from several genes. It is known that the evolutionary history of individual genes (gene trees) might be topologically distinct from each other and from the underlying species tree, possibly confounding phyloge…
This paper reviews deep time-series forecasting focusing on autocorrelation modeling.
problem Modeling autocorrelation in history and label sequences for time-series forecasting.
method Proposes a novel taxonomy for model architectures and learning objectives.
result Provides a comprehensive review and analysis of deep time-series forecasting.
Interleaved RNNs detect fraud without costly features.
problem Real-time fraud detection in payment cards.
method Use interleaved sequence RNNs for fraud detection.
result Interleaved RNNs outperform state-of-the-art models in fraud detection.
A new method detects and removes false trailing balances in credit data.
problem False trailing balances in credit data corrupt risk event timing.
method TruEnd-procedure defines and removes false trailing balances.
result Improved accuracy in predicting risk events and reducing credit losses.
We briefly recall the history of the Nijenhuis torsion of (1,1)-tensors on manifolds and of the lesser-known Haantjes torsion. We then show how the Haantjes manifolds of Magri and the symplectic-Haantjes structures of Tempesta and Tondo generalize the classical approach to integrable systems in the bi-hamiltonian and s…
IAE extracts innovations sequences for non-Gaussian processes.
problem Extracting innovations sequences for non-Gaussian processes.
method Causal convolutional neural network.
result IAE effectively detects anomalies in non-Gaussian data.
Data of practical interest - such as personal records, transaction logs, and medical histories - are sequential collections of events relevant to a particular source entity. Recent studies have attempted to link sequences that represent a common entity across data sets to allow more comprehensive statistical analyses a…
Many-to-one RNN predicts user hotel clicks from browsing history.
problem Predicting user hotel clicks from browsing history.
method Combines rule-based algorithm with Gated RNN to sort accommodations.
result Promising results but computationally demanding.
Event sequence, asynchronously generated with random timestamp, is ubiquitous among applications. The precise and arbitrary timestamp can carry important clues about the underlying dynamics, and has lent the event data fundamentally different from the time-series whereby series is indexed with fixed and equal time inte…
HCRNN uses hierarchical contexts to improve recommendation models.
problem Challenges in modeling user interest transitions and drifts in recommendation systems.
method Introduces HCRNN with three hierarchical contexts (global, local, temporary) and a hierarchical context-based gate structure.
result HCRNN outperformed other models in sequential recommendation tasks.
Recurrent networks learn beliefs from history in partially observable environments.
problem Learning optimal policies in partially observable environments.
method Trained recurrent neural networks to approximate value functions, measuring mutual information between hidden states and beliefs.
result Recurrent networks' hidden states correlate with beliefs of relevant state variables, improving expected return.
Paper clusters event sequences using a reinforcement learning approach with policy mixture model.
problem Clustering event sequences with varying temporal patterns.
method Reinforcement learning with a policy mixture model, decomposing sequences into states and actions.
result Effective clustering of event sequences into underlying policies, outperforming existing methods.
Predicting highrisk vascular diseases is a significant issue in the medical domain. Most predicting methods predict the prognosis of patients from pathological and radiological measurements, which are expensive and require much time to be analyzed. Here we propose deep attention models that predict the onset of the hig…
Bayesian inference over admissible histories leads to irreversible kinetics.
problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.
A new perspective on self-attention models using MLPs.
problem Improving sequence modeling with self-attention mechanisms.
method Introducing HyperMLP and HyperGLU, which use dynamic two-layer MLPs with reverse-offset layout.
result HyperMLP/HyperGLU consistently outperform softmax-attention baselines.
HS-FNO models non-Markovian PDEs by learning history and future states.
problem Non-Markovian dynamics where future states depend on past history.
method History-Space Fourier Neural Operator (HS-FNO) for delay and memory-driven PDEs.
result HS-FNO achieves lowest aggregate errors across various PDE families.
Overview of affine surface area and its history.
problem None explicitly stated; focuses on overview.
method None explicitly stated; focuses on overview.
result None explicitly stated; focuses on overview.
We analyze a model of learning and belief formation in networks in which agents follow Bayes rule yet they do not recall their history of past observations and cannot reason about how other agents' beliefs are formed. They do so by making rational inferences about their observations which include a sequence of independ…
Inferring user characteristics such as demographic attributes is of the utmost importance in many user-centric applications. Demographic data is an enabler of personalization, identity security, and other applications. Despite that, this data is sensitive and often hard to obtain. Previous work has shown that purchase …
High-throughput sequencing allows the detection and quantification of frequencies of somatic single nucleotide variants (SNV) in heterogeneous tumor cell populations. In some cases, the evolutionary history and population frequency of the subclonal lineages of tumor cells present in the sample can be reconstructed from…
Survey of Baum-Connes conjecture history and methods.
problem Baum-Connes conjecture in mathematics.
method History and methods of the conjecture.
result Current status of the conjecture.
Survey on DDVV-type inequalities, their history, and recent developments.
problem None explicitly stated; focuses on surveying existing work.
method None explicitly stated; focuses on surveying existing work.
result Survey of DDVV-type inequalities and their history and recent developments.
Predicts cryptocurrency pump probability using sequence-based neural networks.
problem Detecting pump-and-dump schemes in cryptocurrency markets.
method Developed a sequence-based neural network (SNN) that encodes historical P&D events into sequences for prediction.
result SNN improves prediction accuracy by leveraging positional attention to extract useful information.
PhyloGFN uses GFlowNets to infer phylogenetic trees from sequence data.
problem Challenging phylogenetic tree inference from sequence data due to high complexity.
method Adopting GFlowNets for parsimony-based and Bayesian phylogenetic inference.
result PhyloGFN produces diverse and high-quality evolutionary hypotheses.
Survey of TPPs from Bayesian, neural, and LLM perspectives.
problem Modeling event sequences in continuous time.
method Bayesian, neural, and LLM approaches.
result Advances in LLMs offer new possibilities for TPP modeling.
A new sampling method using log-concave Markov chains.
problem Sampling from unnormalized densities efficiently.
method Decomposes sampling into log-concave Markov chains with noisy measurements.
result Shows remarkable capacity to 'tunnel' between modes of a distribution.
SRMC framework reduces Monte Carlo variance by history-based sampling in high-dimensional spaces.
problem Efficient sampling in high-dimensional discrete or continuous state spaces.
method Score-Repellent Monte Carlo (SRMC) framework that summarizes history through running average of score evaluations.
result Improves estimator variance and mode coverage with constant memory usage.
Paper analyzes history-based RL methods for MDPs, introduces a theoretical framework and practical algorithm.
problem Improving RL performance in MDPs using history-based features.
method Theoretical framework for history-based RL, practical algorithm design.
result Practical RL algorithm shows effectiveness on continuous control tasks.
GTEA learns node representations in temporal interaction graphs.
problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.
Method learns optimal treatment sequences from observational data.
problem Optimal dynamic treatment regimes for public policies and medical interventions.
method Doubly robust classification-based approach via backward induction.
result Achieves optimal convergence rate of n^(-1/2) for welfare regret.
Two methods generate parallel data for GEC, improving neural models' performance.
problem Lack of parallel data for GEC.
method Two approaches to generate large parallel datasets from Wikipedia data.
result Neural GEC models trained on generated corpora perform similarly and surpass state-of-the-art.
Neural networks improve cancer risk prediction from family history data.
problem Improving cancer risk prediction from family history data using machine learning.
method Developed and trained neural network models on large pedigrees to predict hereditary cancers.
result Neural networks can achieve nearly optimal prediction performance and outperform traditional models in misreported data.
Model predicts OTC dealers' trading behavior using historical data.
problem Predicting the trading decisions of OTC dealers for US corporate bonds.
method Applied machine learning methods, including neural networks and clustering.
result PPRZ Transformer model outperforms other models in predicting dealer behavior.
The paper explains why estimating a history-dependent policy can reduce MSE in reinforcement learning.
problem Understanding why history-dependent policies can improve MSE in off-policy evaluation.
method The paper derives a bias-variance decomposition of MSE for various OPE estimators, showing how history-dependent policies can decrease variance and increase bias.
result History-dependent policies can decrease the variance of importance sampling estimators, leading to lower MSE.