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

149299448597 · Jun 202019922001200920172026
48 results for travel time tomography

Paper addresses travel time tomography stability and statistical inversion.

problem Determining conformal factors of metrics from geodesic lengths.
method Established forward and inverse stability estimates; applied to Bayesian statistical inversion.
result Consistency of statistical inversion technique for travel time tomography.

Study travel time tomography for transversely isotropic media using modified pseudodifferential calculus.

problem Travel time tomography problem for transversely isotropic media.
method Modified scattering pseudodifferential calculus to solve the tomography problem.
result Construction and use of modified pseudodifferential calculus to solve the tomography problem.

We develop a 2D travel time tomography method which regularizes the inversion by modeling groups of slowness pixels from discrete slowness maps, called patches, as sparse linear combinations of atoms from a dictionary. We propose to use dictionary learning during the inversion to adapt dictionaries to specific slowness…

2017-12-16abs ↗pdf ↗

We survey some results on travel time tomography. The question is whether we can determine the anisotropic index of refraction of a medium by measuring the travel times of waves going through the medium. This can be recast as geometry problems, the boundary rigidity problem and the lens rigidity problem. The boundary r…

2016-04-03abs ↗pdf ↗

Injectivity of geodesic ray transform on specific Finsler manifolds proven.

problem Injectivity of geodesic ray transform on spherically symmetric reversible Finsler manifolds.
method Reduction to invertibility of generalized Abel transforms using angular Fourier series and Taylor expansions of geodesics.
result Injectivity of geodesic ray transform proven on specified Finsler manifolds.

Bayesian framework predicts post-disruption travel times in metro networks.

problem Uncertainty in post-disruption travel times in metro networks.
method Bayesian spatiotemporal modeling framework capturing train interactions and non-Gaussian distributional characteristics.
result The proposed models consistently outperform baseline specifications in point prediction and uncertainty quantification.

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.

STAD improves travel time estimation by learning from real traffic data.

problem Travel time estimation using GPS traces is inaccurate and requires offline optimization.
method STAD uses machine learning and real-time trip data to adjust travel time estimates.
result STAD reduces median absolute errors by 14% in Doha and New York City, and 29% in Porto.

Boosting algorithms improve delivery time prediction in postal services.

problem Challenges in long-term travel time prediction for postal services.
method Investigated linear regression models, tree-based ensembles (random forest, bagging, boosting), and compared their performance.
result Boosting algorithms, especially light gradient boosting and catboost, outperform other methods in accuracy and runtime efficiency.

Model predicts travel time under rare conditions using a vector-space model.

problem Predicting travel time under rare temporal conditions (e.g., holidays, school vacations) is challenging due to limited historical data and other temporal changes.
method Presented a vector-space model for encoding rare temporal conditions, allowing coherent representation learning across different conditions.
result Increased performance for travel time prediction over different baselines when using the vector-space encoding for representing the temporal setting.

Two novel models predict bus travel times with uncertainty, improving connection assurance.

problem Improving bus connection assurance by handling travel time uncertainty.
method Two novel approaches: Deep Quantile Regression (DQR) and Bayesian Recurrent Neural Networks (BRNN).
result DQR model performs best for 80%, 90%, and 95% prediction intervals, with small underestimation.

Enhanced travel time prediction using deep neural networks and road network information.

problem Improving travel time estimation using deep learning models.
method Proposes incorporating road network information into deep learning models for travel time prediction.
result Improved travel time prediction, especially with limited training data.

Dynamic linear models improve travel time prediction for congested freeways.

problem Accurate travel time prediction for congested freeways.
method Dynamic linear models (DLMs) with time-varying parameters.
result Significant improvements in travel time prediction accuracy, especially for short-term predictions.

We address two shortcomings in online travel time estimation methods for congested urban traffic. The first shortcoming is related to the determination of the number of mixture modes, which can change dynamically, within day and from day to day. The second shortcoming is the wide-spread use of Gaussian probability dens…

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

Paper reconstructs compact Riemannian manifolds from travel time data.

problem Reconstructing compact Riemannian manifolds from partial travel time data.
method Embedding in function space, studying distance function regularity.
result Reconstruction of compact Riemannian manifolds from travel time data.

The paper deals with some problems related to recovering information about an obstacle in an Euclidean space from certain measurements of lengths of generalized geodesics in the exterior of the obstacle. The main result is that if two obstacles satisfy some generic regularity conditions and have (almost) the same trave…

2014-04-16abs ↗pdf ↗

Bayesian model identifies three types of travelers adapting to feedback.

problem Capturing adaptive, feedback-driven travel behavior in heterogeneous individuals.
method Latent Class Reinforcement Learning (LCRL) model with Variational Bayes estimation.
result Three distinct traveler classes identified: context-dependent, persistent exploitative, and exploratory.

RL improves market making with historical data time travel.

problem Limited ability to simulate and fully appraise the impact of actions in competitive systems.
method Introduces 'consistent data time travel' to adjust historical data time index.
result Significant improvement in agent's gain with data time travel.

Rigidity of travel times for convex obstacles in Riemannian manifolds is proven.

problem Rigidity of travel times for strictly convex obstacles in Riemannian manifolds.
method Analysis of billiard trajectories and comparison of travel times.
result If travel times are equal, then obstacles are identical in dimensions greater than or equal to 3.

Researchers recover Riemannian manifolds and lower order terms from travel time data.

problem Recovering Riemannian manifolds and lower order terms from travel time data.
method Adaptation of the Boundary Control method to recover lower order terms.
result Complete Riemannian manifolds and lower order terms can be uniquely recovered from a local source to solution map.

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.