Predicts user next location using CDR data.
problem Predicting user's next location using CDR data.
method Data processing framework with deep neural network model.
result Error of prediction decreased from 74% to 55%.
MPE models traffic trajectory data to predict next locations.
problem Predicting next locations from traffic trajectory data.
method Mobility pattern embedding model MPE.
result MPE significantly outperforms state-of-the-art methods in next location prediction.
Which song will Smith listen to next? Which restaurant will Alice go to tomorrow? Which product will John click next? These applications have in common the prediction of user trajectories that are in a constant state of flux over a hidden network (e.g. website links, geographic location). What users are doing now may b…
TraLFM models human mobility patterns from traffic trajectories.
problem Understanding human mobility patterns from traffic data.
method Latent factor modeling of sequential, personal, and temporal factors.
result TraLFM significantly outperforms state-of-the-art methods in latent factor analysis and next location prediction.
ε-shotgun optimizes expensive function evaluations in parallel.
problem Optimizing expensive black-box functions efficiently.
method ε-greedy batch Bayesian optimisation.
result ε-shotgun outperforms state-of-the-art batch methods.
Paper proposes a GAN-based approach for RTLMP prediction.
problem Predicting real-time locational marginal prices (RTLMPs) in power markets.
method GAN-based video prediction model for spatio-temporal correlations.
result Proposed method accurately predicts RTLMPs without confidential information.
This paper presents a novel framework for predicting shot location and type in tennis. Inspired by recent neuroscience discoveries we incorporate neural memory modules to model the episodic and semantic memory components of a tennis player. We propose a Semi Supervised Generative Adversarial Network architecture that c…
Study develops a new model for predicting individual mobility based on activity patterns.
problem Existing mobility prediction methods overlook underlying activity patterns.
method Activity-based hidden Markov model (IOHMM) using transit smart card data.
result Proposed model achieves similar prediction performance to LSTM but also provides behavioral insights.
Predicts next actions in soccer possessions using path signatures.
problem Predicting next actions in soccer possessions with high accuracy.
method Leveraging path signatures to encode spatio-temporal structure of recent possessions, avoiding manual feature engineering.
result Our approach outperforms transformer-based benchmarks across various loss metrics and reduces computational cost.
GPR models epidemic spread on logarithmic scale.
problem Modeling and predicting epidemic spread for policy decisions.
method Gaussian process regression (GPR) on logarithmic scale of infected cases.
result GPR predictions have high probability of being within 95% confidence interval for 94.29% of data.
Optimizes black-box functions with varying costs across multiple sources.
problem Optimizing black-box functions with varying costs across multiple sources.
method Uses Augmented Gaussian Process and Gaussian Process to model fidelity and location-dependent costs, respectively. Uses Confidence Bound acquisition function to select sources and locations.
result The approach significantly outperforms existing methods on Hyperparameters Optimization tasks.
We consider the problem of locating a point-source heart arrhythmia using data from a standard diagnostic procedure, where a reference catheter is placed in the heart, and arrival times from a second diagnostic catheter are recorded as the diagnostic catheter moves around within the heart. We model this situation as a …
SHMM models human mobility from GPS and text data, overcoming text sparsity.
problem Modeling human mobility from semantic trace data, especially addressing text sparsity.
method SHMM is a multi-modal spherical hidden Markov model that jointly models location, time, and text embeddings on a unit sphere using vMF distribution.
result SHMM outperforms state-of-the-art models in next location prediction and has lower training cost.
Study on sequential prediction with log-loss, focusing on well-specified and misspecified cases.
problem Sequential prediction with log-loss under different specification conditions.
method Analysis of cumulative regret in well-specified and misspecified cases for a Gaussian location hypothesis class.
result Cumulative regrets in well-specified and misspecified cases asymptotically coincide for the d-dimensional Gaussian location hypothesis class. RNA-binding proteins (RBPs) play crucial roles in many biological processes, e.g. gene regulation. Computational identification of RBP binding sites on RNAs are urgently needed. In particular, RBPs bind to RNAs by recognizing sequence motifs. Thus, fast locating those motifs on RNA sequences is crucial and time-efficie…
Study predicts climate data at distant locations using machine learning.
problem Predict climate variables at distant locations where comprehensive data collection is not feasible.
method Uses reservoir computing and vector autoregression models for prediction.
result Machine learning improves prediction accuracy for highly correlated data.
Despite the progress within the last decades, weather forecasting is still a challenging and computationally expensive task. Current satellite-based approaches to predict thunderstorms are usually based on the analysis of the observed brightness temperatures in different spectral channels and emit a warning if a critic…
Proving that next-token prediction makes language models generate coherent long documents.
problem Understanding why language models generate coherent documents despite focusing on next-token prediction.
method Proving the power of next-token prediction in learning longer-range structure using Recurrent Neural Networks (RNN).
result Optimizing next-token prediction in RNNs yields a model that closely approximates the training distribution, even for long-range coherence.
TIMeSynC combines financial service interactions for intent prediction.
problem Aligning and learning from multi-domain, multi-resolution sequences for accurate intent prediction.
method An encoder-decoder transformer model addressing sequence alignment, temporal dynamics, and dynamic/static sequence combination.
result Significant improvement in intent prediction over existing methods.
Multi-fidelity Gaussian process is a common approach to address the extensive computationally demanding algorithms such as optimization, calibration and uncertainty quantification. Adaptive sampling for multi-fidelity Gaussian process is a changing task due to the fact that not only we seek to estimate the next samplin…
We present a novel human-aware navigation approach, where the robot learns to mimic humans to navigate safely in crowds. The presented model, referred to as DeepMoTIon, is trained with pedestrian surveillance data to predict human velocity in the environment. The robot processes LiDAR scans via the trained network to n…
Reinforcement learning after next-token prediction aids in learning from diverse sequence lengths.
problem Learning from sequences of varying lengths and complexity.
method Introducing a framework to study reinforcement learning with autoregressive transformers, focusing on next-token prediction and mixture distributions of short and long sequences.
result Reinforcement learning after next-token prediction enables autoregressive transformers to generalize from long sequences, even when they are rare.
Computational identification of promoters is notoriously difficult as human genes often have unique promoter sequences that provide regulation of transcription and interaction with transcription initiation complex. While there are many attempts to develop computational promoter identification methods, we have no reliab…
Inference of latent feature models in the Bayesian nonparametric setting is generally difficult, especially in high dimensional settings, because it usually requires proposing features from some prior distribution. In special cases, where the integration is tractable, we can sample new feature assignments according to …
Paper proposes a graph neural network for accurate long-term ILI prediction.
problem Limited long-term prediction performance and spatio-temporal dependency in existing models.
method Cross-location attention based graph neural network (Cola-GNN) for time series embeddings and location aware attentions.
result Proposed method shows strong predictive performance and interpretable results for long-term epidemic predictions.
A new approach predicts next observations without explicit decoding for better control.
problem High-dimensional observations and unknown dynamics in real-world control tasks.
method Proposes a novel information-theoretic LCE approach using predictive coding to develop a decoder-free model.
result The model reliably learns a controllable latent space leading to superior performance.
This study tackles mutual fund portfolio prediction, focusing on novel items.
problem Predicting novel items in mutual fund portfolios is challenging and less explored.
method Created a comprehensive benchmark dataset and evaluated various recommender system models.
result Autoencoder-based approaches outperform state-of-the-art models in predicting novel items.
New method infers centromere locations in yeast using Hi-C data.
problem Difficulty in inferring centromere locations in yeast.
method Simulation-based inference using Hi-C data and simulated contact maps.
result Infers stochastic locations of all centromeres in budding yeast.
Proposes a feature transformation for spatio-temporal traffic models to improve performance and transferability.
problem Limited transferability of deep learning models for traffic flow prediction across different locations.
method Integrates Newell's traffic flow estimators to capture broader dynamics and incorporates spatial dependencies.
result Improves model performance in predicting traffic flows over different horizons.
Law explains how LLMs learn to predict next tokens.
problem Understanding how LLMs process input data internally.
method Introduced a precise law governing token embeddings in LLMs.
result Each layer equally contributes to next-token prediction accuracy.
An extreme wind speed estimation method that considers wind hazard climate types is critical for design wind load calculation for building structures affected by mixed climates. However, it is very difficult to obtain wind hazard climate types from meteorological data records, because they restrict the application of e…
Patch ranking improves CNN performance by focusing on object content, not location.
problem CNNs lack rotation and translation invariance, limiting model capacity.
method Patch ranking before convolution and pooling to encode invariance.
result Patch ranking module improves CNN performance on various tasks.
The study explores how Transformers predict the next token in a sequence.
problem Understanding the mechanism behind Transformers' autoregressive learning ability.
method Exploring the approximation ability of Transformers for next-token prediction through specific instances and a causal kernel descent method.
result Transformer models can learn context-dependent functions f for next-token prediction based on past and current observations. This paper examines how different decoding algorithms for LLMs align with various goals.
problem Consistency of decoding algorithms with different goals in LLMs.
method Analysis of greedy, lookahead, random sampling, and temperature-scaled random sampling algorithms.
result Random sampling is consistent with the true probability distribution, but other goals require optimal algorithms for specific probability distributions.
CMDRNN predicts user location using WiFi fingerprints with deep learning.
problem Predicting user activity with WiFi fingerprints is challenging due to high dimensionality.
method Combines CNN, RNN, and MDN to model high-dimensional time-series data.
result CMDRNN effectively predicts user location using WiFi fingerprints.
Model predicts next destination for users based on past trips and features.
problem Predicting the next destination in multi-destination trips.
method Used Cleora for city graph embedding and EMDE for prediction.
result Achieved 2nd place in Booking Data Challenge.
Satellite images improve real-estate price predictions.
problem Improving accuracy of real-estate price predictions.
method Used convolutional neural networks (CNN) to incorporate satellite image data.
result CNN model trained on satellite images and structured data performs 7% better in MAE.
Social networks are getting closer to our real physical world. People share the exact location and time of their check-ins and are influenced by their friends. Modeling the spatio-temporal behavior of users in social networks is of great importance for predicting the future behavior of users, controlling the users' mov…
Bayesian method improves star location and flux estimation from coadded images.
problem Statistical analysis of coadded astronomical images is complicated by pixel dependence.
method Bayesian approach that implicitly marginalizes single-exposure pixel intensities.
result Method outperforms single-exposure image training for star parameter estimation.
The paper improves prediction and testing for signals from a linear combination of translated features with Gaussian noise.
problem Predicting and testing signals from a linear combination of translated features with varying scale parameter and Gaussian noise.
method Extends previous off-the-grid prediction results, improves minimal distance between features, proposes a goodness-of-fit test with upper bounds.
result Upper bounds on the minimax separation rate match those for the high-dimensional linear model, matching the lower bound.
Predictive business process monitoring methods exploit logs of completed cases of a process in order to make predictions about running cases thereof. Existing methods in this space are tailor-made for specific prediction tasks. Moreover, their relative accuracy is highly sensitive to the dataset at hand, thus requiring…
Neural network predicts turbulence from wall shear stress.
problem Predicting wall-bounded turbulence from wall quantities.
method Fully-convolutional neural network trained on DNS data.
result Improved prediction of turbulence fields and statistics.
We are now witnessing the increasing availability of event stream data, i.e., a sequence of events with each event typically being denoted by the time it occurs and its mark information (e.g., event type). A fundamental problem is to model and predict such kind of marked temporal dynamics, i.e., when the next event wil…
Market forecasts converge to true values if some agents are correct.
problem Convergence of market forecasts in dynamic prediction markets.
method Dynamic model of prediction market with agents making forecasts.
result Aggregated market forecasts converge to conditional expectations.
The tremendous growth of positioning technologies and GPS enabled devices has produced huge volumes of tracking data during the recent years. This source of information constitutes a rich input for data analytics processes, either offline (e.g. cluster analysis, hot motion discovery) or online (e.g. short-term forecast…
In this paper we propose a new method to predict the final destination of vehicle trips based on their initial partial trajectories. We first review how we obtained clustering of trajectories that describes user behaviour. Then, we explain how we model main traffic flow patterns by a mixture of 2d Gaussian distribution…
Assessing the predictive accuracy of black box classifiers is challenging in the absence of labeled test datasets. In these scenarios we may need to rely on a human oracle to evaluate individual predictions; presenting the challenge to create query algorithms to guide the search for points that provide the most informa…
Many expensive black-box optimisation problems are sensitive to their inputs. In these problems it makes more sense to locate a region of good designs, than a single-possibly fragile-optimal design. Expensive black-box functions can be optimised effectively with Bayesian optimisation, where a Gaussian process is a popu…