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

12243547 · Jun 202019922001200920172026
48 results for taxi drop-off location

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 ↗

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 ↗

Modern vehicle fleets, e.g., for ridesharing platforms and taxi companies, can reduce passengers' waiting times by proactively dispatching vehicles to locations where pickup requests are anticipated in the future. Yet it is unclear how to best do this: optimal dispatching requires optimizing over several sources of unc…

2018-04-13abs ↗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.

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.

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.

ST-SAN predicts flow with spatial-temporal dependencies using self-attention.

problem Challenges in predicting flow due to spatial-temporal dependencies.
method Spatial-Temporal Self-Attention Network (ST-SAN) that addresses temporal and spatial dependencies.
result Significant improvement in flow prediction accuracy (9% in inflow, 4% in outflow) compared to state-of-the-art methods.

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).

New relation found between ADM mass and generalized Komar energy for dynamical spacetimes.

problem Finding equality between ADM mass and Komar energy in dynamical spacetimes.
method Constructing a generalized Komar energy from the normal evolution vector and proving equality under specific conditions.
result Equality between ADM mass and generalized Komar energy for dynamical asymptotically-flat spacetimes.

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.

Machine learning approaches to multi-label document classification have to date largely relied on discriminative modeling techniques such as support vector machines. A drawback of these approaches is that performance rapidly drops off as the total number of labels and the number of labels per document increase. This pr…

2011-07-13abs ↗pdf ↗

Concerns about interpretability, computational resources, and principled inductive priors have motivated efforts to engineer sparse neural models for NLP tasks. If sparsity is important for NLP, might well-trained neural models naturally become roughly sparse? Using the Taxi-Euclidean norm to measure sparsity, we find …

2019-07-22abs ↗pdf ↗

Optimal scheduling of hydrogen production in dynamic pricing power market can maximize the profit of hydrogen producer; however, it highly depends on the accurate forecast of hydrogen consumption. In this paper, we propose a deep leaning based forecasting approach for predicting hydrogen consumption of fuel cell vehicl…

2018-06-27abs ↗pdf ↗

A new GCN model learns higher-order neighbors without explicit adjacency matrix computation.

problem GCN's performance drops for deeper structures due to limited neighborhood information.
method Assumes higher-order neighbors are similar to first-order neighbors, learns weights through Lasso to minimize feature loss.
result HWGCN achieves state-of-the-art results on various datasets.

This paper describes the data collection effort that is part of the project Sprekend Nederland (The Netherlands Talking), and discusses its potential use in Automatic Accent Location. We define Automatic Accent Location as the task to describe the accent of a speaker in terms of the location of the speaker and its hist…

2016-02-08abs ↗pdf ↗

This study predicts parking availability using multi-source data and a self-supervised learning enhanced transformer.

problem Accurate parking availability prediction to support urban planning and management.
method Proposes SST-iTransformer, a self-supervised learning enhanced spatio-temporal inverted transformer, integrating multi-source data.
result SST-iTransformer achieves state-of-the-art performance in parking availability prediction.

Service system dynamics occur at the interplay between customer behaviour and a service provider's response. This kind of dynamics can effectively be modeled within the framework of queuing theory where customers' arrivals are described by point process models. However, these approaches are limited by parametric assump…

2019-06-24abs ↗pdf ↗

Exact 1-Wasserstein distance between location-scale distributions derived, with privacy effects studied.

problem Calculating the 1-Wasserstein distance between location-scale distributions and its impact on differential privacy.
method Exact expressions and special functions for 1-Wasserstein distance, new upper bounds, and asymptotic analysis.
result New linear upper bound and detailed asymptotic bounds for Gaussian case, effect of differential privacy studied.

This paper optimizes driver repositioning using MARL and reward design for better service and traffic management.

problem Unserved passenger requests due to drivers' cruising behavior during passenger seeking.
method Mean field multi-agent reinforcement learning (MARL) with a reward design scheme and Bayesian optimization (BO) to solve bilevel optimization problems.
result Optimal toll charges and service charges can improve platform and city planner objectives by significant margins, leading to better traffic conditions.

Study shows one-dimensional location-scale-shape models are flat in Wasserstein geometry.

problem Investigating curvature in location-scale-shape models under Wasserstein metric.
method Introduced location-scale-shape model and investigated its geometry.
result Location-scale-shape model is intrinsically flat but extrinsically curved in Wasserstein geometry.