Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

134267401534 · Jun 202019922001200920172026
48 results for next destination prediction

Predicts destinations and routes from partial trajectory data.

problem Predicting destinations and routes from partial trajectory data for applications like parking suggestions and ride-sharing.
method Three-step procedure: k-d tree-based space discretization, recurrent neural network for destination prediction, and route calculation.
result Best models predict destinations with a mean error of 1.3 km and 1.43 km.

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…

2016-05-10abs ↗pdf ↗

In most agent-based simulators, pedestrians navigate from origins to destinations. Consequently, destinations are essential input parameters to the simulation. While many other relevant parameters as positions, speeds and densities can be obtained from sensors, like cameras, destinations cannot be observed directly. Ou…

2018-12-10abs ↗pdf ↗

OpFlow predicts robust OD flows by learning choice potentials conditioned on spatial exposures.

problem Deep models trained on raw counts are vulnerable to distribution shift.
method OpFlow learns row-centered choice potentials and reconstructs flows by combining them with a calibrated origin scale.
result OpFlow improves robustness under environment shifts, as shown by controlled synthetic shifts and a real-world experiment.

Predicts fine-grained OD matrices for ridesharing platforms to optimize supply-demand balance.

problem Accurately predicting spatial-temporal OD demands for ridesharing platforms.
method OD-CED model combining unsupervised space coarsening and encoder-decoder architecture.
result Significant improvement in prediction accuracy (45% RMSE reduction, 60% WAPE reduction).

Study uses neural networks to predict travel times for public transportation.

problem Inaccurate travel time predictions due to road traffic irregularities.
method Developed two neural network models (MLP and LSTM) using OD travel time matrix.
result Both models can make near-accurate predictions, but LSTM is more susceptible to noise.

Bayesian model predicts evolving guest origin markets in tourism.

problem Forecasting the changing composition of guest origin markets in tourism.
method Developed and applied Bayesian Dirichlet autoregressive moving average (BDARMA) models to Airbnb booking data.
result BDARMA models achieve lower forecast error and competitive performance in guest origin market shares.

We present here a general framework and a specific algorithm for predicting the destination, route, or more generally a pattern, of an ongoing journey, building on the recent work of [Y. Lassoued, J. Monteil, Y. Gu, G. Russo, R. Shorten, and M. Mevissen, "Hidden Markov model for route and destination prediction," in IE…

2018-08-31abs ↗pdf ↗

Bayesian models predict evolving guest origin markets in tourism.

problem Forecasting the changing composition of guest origin markets in tourism.
method Developed and applied Bayesian Dirichlet autoregressive moving average (BDARMA) models to Airbnb booking data.
result BDARMA models outperform standard benchmarks in forecasting guest origin market shares.

VisitHGNN predicts visit probabilities between neighborhoods and POIs using graph neural networks.

problem Estimating visit probabilities between neighborhoods and POIs for urban planning.
method Heterogeneous, relation-specific graph neural network (VisitHGNN) trained on mobility data.
result Strong predictive performance with high fidelity to observed travel behavior.

A new neural approach for generating origin-destination matrices in ABMs.

problem Challenges in generating origin-destination matrices for ABMs, including discretisation errors and inability to explore multimodal distributions.
method A computationally efficient framework that learns trip intensity through a neural differential equation, operating directly on the discrete combinatorial space.
result Outperforms prior art in terms of reconstruction error and ground truth matrix coverage, at a fraction of the computational cost.

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.

Local logarithmic export distributions show non-zero skewness that changes with exporter and destination characteristics.

problem Identifying the skewness in local logarithmic export distributions and its relationship with exporter and destination characteristics.
method Analyzing directed links weighted by the logarithm of export values, studying the skewness of local exports, and formulating quantitative relations.
result Non-zero skewness in local logarithmic export distributions changes with exporter and destination characteristics.

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…

2015-11-03abs ↗pdf ↗

The study introduces measures of collective mobility from aggregated OD data.

problem Understanding large-scale mobility patterns from aggregated data.
method Developed a framework using synthetic and real data to interpret network-level mobility.
result Aggregated mobility measures reveal network structure and flow constraints.

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.

In many real-world systems, information can be transmitted in two qualitatively different ways: by copying or by transformation. Copying occurs when messages are transmitted without modification, e.g., when an offspring receives an unaltered copy of a gene from its parent. Transformation occurs when messages are modifi…

2019-03-21abs ↗pdf ↗

Paper proposes a method to predict disk failures using multi-layer domain adaptive learning.

problem Traditional machine learning models struggle to predict disk failures due to limited data.
method Multi-layer domain adaptive learning with source and target domains.
result The proposed method improves failure prediction accuracy on disk data with few failure samples.

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.

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 ff for next-token prediction based on past and current observations.

In this paper, we consider signal detection algorithms in a multiple-input multiple-output (MIMO) decode-forward (DF) relay channel with one source, one relay, and one destination. The existing suboptimal near maximum likelihood (NML) detector and the NML with two-level pair-wise error probability (NMLw2PEP) detector a…

2018-07-12abs ↗pdf ↗

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.

Paper uses deep imitation learning to predict aircraft trajectories accurately.

problem Inefficient and costly Air Traffic Management system limits predictability.
method Generative Adversarial Imitation Learning framework with trajectory clustering and classification.
result Accurate predictions for entire trajectory stages, pre- and tactical.

One of the first things to do while planning a trip is to book a good place to stay. Booking a hotel online can be an overwhelming task with thousands of hotels to choose from, for every destination. Motivated by the importance of these situations, we decided to work on the task of recommending hotels to users. We used…

2019-08-20abs ↗pdf ↗

Proposes a new model to predict travel demand with zero-inflated and long-tail characteristics.

problem Sparse and long-tailed travel demand data with many zeros.
method Spatial-Temporal Tweedie Graph Neural Network (STTD) using Tweedie distribution.
result STTD provides accurate predictions and precise confidence intervals.

Accurately predicting the possible behaviors of traffic participants is an essential capability for future autonomous vehicles. The majority of current researches fix the number of driving intentions by considering only a specific scenario. However, distinct driving environments usually contain various possible driving…

2018-04-10abs ↗pdf ↗

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…

2016-12-07abs ↗pdf ↗

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…

2017-01-14abs ↗pdf ↗

This paper introduces a novel technique to track structures in time varying graphs. The method uses a maximum a posteriori approach for adjusting a three-dimensional co-clustering of the source vertices, the destination vertices and the time, to the data under study, in a way that does not require any hyper-parameter t…

2016-08-29abs ↗pdf ↗

Paper proposes a GAN-based method for better next event prediction in business processes.

problem Insufficient training data and sub-optimal network configuration limit deep learning approaches to next event prediction.
method Adversarial training framework using Generative Adversarial Networks (GANs) for sequential temporal data.
result The proposed approach achieves at least as good accuracy as non-adversarial methods and outperforms them in accuracy and prediction earliness.

This paper explores how Transformers predict next tokens in autoregressive tasks.

problem Understanding the success of Transformers in autoregressive learning.
method Trained a Transformer on a next-token prediction task, focusing on commuting orthogonal matrices.
result Trained Transformers can be seen as implementing gradient descent for a specific objective function.