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,742 papers · 148 categories

Trend · papers per month

0.5%1.0%1.5%1.9% · Oct 202119922001200920172026
48 results for taxi GPS

We consider the problem of learning to behave optimally in a Markov Decision Process when a reward function is not specified, but instead we have access to a set of demonstrators of varying performance. We assume the demonstrators are classified into one of k ranks, and use ideas from ordinal regression to find a rewar…

2019-07-31abs ↗pdf ↗

Network metrics form a fundamental part of the network analysis toolbox. Used to quantitatively measure different aspects of the network, these metrics can give insights into the underlying network structure and function. In this work, we connect network metrics to modern probabilistic machine learning. We focus on the…

2014-09-15abs ↗pdf ↗

Taxi demand prediction is an important building block to enabling intelligent transportation systems in a smart city. An accurate prediction model can help the city pre-allocate resources to meet travel demand and to reduce empty taxis on streets which waste energy and worsen the traffic congestion. With the increasing…

2018-02-23abs ↗pdf ↗

VerifAI toolkit improves neural network-based aircraft taxiing system safety.

problem Improving safety of autonomous aircraft taxiing systems using neural networks.
method Unified approach to formal analysis and retraining of AI systems, including falsification, debugging, and retraining.
result Improved neural network performance and reduced failure cases in aircraft taxiing system.

Conditional Density Estimation (CDE) models deal with estimating conditional distributions. The conditions imposed on the distribution are the inputs of the model. CDE is a challenging task as there is a fundamental trade-off between model complexity, representational capacity and overfitting. In this work, we propose …

2018-10-30abs ↗pdf ↗

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 ↗

Ridesourcing platforms like Uber and Didi are getting more and more popular around the world. However, unauthorized ridesourcing activities taking advantages of the sharing economy can greatly impair the healthy development of this emerging industry. As the first step to regulate on-demand ride services and eliminate b…

2017-05-23abs ↗pdf ↗

Model predicts passenger origin-destination for online taxi-hailing systems.

problem Predicting passenger origin-destination for efficient transportation planning.
method K-means clustering, non-negative matrix factorization, stacked recurrent neural network.
result Proposed model reduces MAPE by 5-7% for 1-hour windows and 14% for 30-minute windows.

A new approach switches between simple and complex models to handle concept drifts in regression tasks.

problem Handling concept drifts in regression models to maintain accurate predictions over time.
method Error Intersection Approach: switches between simple and complex models based on drift detection.
result The Error Intersection Approach significantly outperforms baselines in handling concept drifts in a real-world taxi demand dataset.

Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are respo…

2018-03-27abs ↗pdf ↗

Simultaneously estimates travel times and route choice model parameters.

problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.

Generative models unify heterogeneous data for multimodal fusion.

problem Learning effective representations of mixed numerical and categorical data.
method Bayesian approach with exponential family distributions and Laplace-Bernstein approximation.
result Generative models enable fusion of multimodal data for various machine learning tasks.

The paper predicts travel times using tree-based ensembles.

problem Predicting travel times between urban points over short and long horizons.
method Tree-based ensemble methods trained on taxi trip records with additional features from weather and routing data.
result Adding routing data improves model performance and short-term predictions require less data.

The paper evaluates different graph input representations for urban network analysis.

problem Challenges in analyzing urban networks due to their size and complexity.
method Design and evaluation of six graph input representations considering topological and temporal characteristics.
result Temporal information in graph input representations significantly improves model accuracy (RMSE of 1.42).

We introduce a framework for analyzing transductive combination of Gaussian process (GP) experts, where independently trained GP experts are combined in a way that depends on test point location, in order to scale GPs to big data. The framework provides some theoretical justification for the generalized product of GP e…

2015-11-24abs ↗pdf ↗

Efficiently optimize GPs by reusing candidate solutions multiple times.

problem High computational cost of Gaussian process optimization due to unique historical points.
method Sticking to a candidate solution for multiple evaluation steps and limiting switches.
result Improved efficiency and practicality of Gaussian process optimization algorithms.

The paper introduces a method to control false splits in tree-based data aggregation.

problem Identifying the correct subgroups to treat as a single entity in tree-based data.
method Introduces the 'false split rate' and proposes a multiple hypothesis testing algorithm for tree-based aggregation.
result The proposed algorithm controls the false split rate, demonstrating its effectiveness on stock volatility and taxi fare data.

HIP-GP improves GP inference for inter-domain observations with millions of inducing points.

problem Inference for Gaussian Processes across different domains.
method Hierarchical inducing point Gaussian process with grid structure and stationary kernel assumption.
result Improved approximation accuracy through increased number of inducing points.

This paper improves GP for learning complex data distributions.

problem Vanilla Gaussian processes struggle with complex data distributions.
method Introduces scalable GP paradigms with latent variables and variational inference.
result Scalable modulated GPs, especially latent GPs, learn diverse data distributions better.

Develops SGP-VAE for efficient sparse GP inference in multi-dimensional datasets.

problem Sparse GP approximations and missing data in multi-dimensional spatio-temporal datasets.
method Leverages partial inference networks for sparse GP approximations and amortized variational inference.
result Outperforms multi-output GPs and structured VAEs in various experiments.

Framework for applying GPs to real-world data with scalability guidelines.

problem Deployment of Gaussian Processes (GPs) is hindered by computational costs and lack of guidelines.
method Proposed a framework for identifying GP suitability and setting up robust models, formalizing decisions of experienced practitioners.
result More accurate results at test time for glacier elevation change case study.

It has long been known that a single-layer fully-connected neural network with an i.i.d. prior over its parameters is equivalent to a Gaussian process (GP), in the limit of infinite network width. This correspondence enables exact Bayesian inference for infinite width neural networks on regression tasks by means of eva…

2017-11-01abs ↗pdf ↗

We propose a multiresolution Gaussian process to capture long-range, non-Markovian dependencies while allowing for abrupt changes. The multiresolution GP hierarchically couples a collection of smooth GPs, each defined over an element of a random nested partition. Long-range dependencies are captured by the top-level GP…

2012-09-05abs ↗pdf ↗