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

Trend · papers per month

24487296 · May 202619922001200920172026
48 results for Public Transport

Polestar optimizes public transportation routes for efficiency and user satisfaction.

problem Difficulty in finding optimal public transportation routes due to complex networks and dynamic situations.
method Developed a Public Transportation Graph (PTG) and a route search algorithm with station binding and ranking modules.
result Demonstrated superior efficiency and user satisfaction compared to existing systems.

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.

Increasing urban concentration raises operational challenges that can benefit from integrated monitoring and decision support. Such complex systems need to leverage the full stack of analytical methods, from state estimation using multi-sensor fusion for situational awareness, to prediction and computation of optimal r…

2019-05-14abs ↗pdf ↗

Study improves dynamic PT fleet optimization under noisy demand predictions.

problem Accurately predicting dynamic public transport demand for effective fleet management.
method Experimental case study in Copenhagen, using linear programming to optimize fleets.
result Optimized fleet performance is mainly affected by noise distribution skew and large errors.

This article presents results from the first statistically significant study of cost escalation in transportation infrastructure projects. Based on a sample of 258 transportation infrastructure projects worth US$90 billion and representing different project types, geographical regions, and historical periods, it is fou…

2013-03-06abs ↗pdf ↗

Within a broad class of generative adversarial networks, we show that discriminator optimization process increases a lower bound of the dual cost function for the Wasserstein distance between the target distribution pp and the generator distribution pGp_G. It implies that the trained discriminator can approximate opti…

2019-10-15abs ↗pdf ↗

CAST predicts distribution-valued time series by stabilizing and transporting simplex-supported successors.

problem Forecasting distribution-valued time series with structural failure modes.
method CAST (Causal Anchored Simplex Transport) uses successors retrieved from causal context, stabilized with a persistence anchor, and locally transported on ordered supports.
result CAST outperforms baselines on eleven public and simulated benchmarks, achieving best average rank on both one-step KL and autoregressive rollout JSD.

This paper surveys differential privacy methods for transportation spatiotemporal data.

problem Protecting user privacy in public release of spatiotemporal data.
method Review of differential privacy mechanisms and their application in transportation.
result Challenges in deploying and adopting differential privacy in transportation.

A sufficient knowledge of the demographics of a commuting public is essential in formulating and implementing more targeted transportation policies, as commuters exhibit different ways of traveling. With the advent of the Automated Fare Collection system (AFC), probing the travel patterns of commuters has become less i…

2015-08-25abs ↗pdf ↗

This article presents results from the first statistically significant study of causes of cost escalation in transport infrastructure projects. The study is based on a sample of 258 rail, bridge, tunnel and road projects worth US$90 billion. The focus is on the dependence of cost escalation on (1) length of project imp…

2013-04-16abs ↗pdf ↗

FairPOT balances fairness and AUC performance by selectively transforming risk scores.

problem Balancing fairness and AUC performance in high-stakes domains.
method FairPOT uses proportional optimal transport to selectively transform risk scores.
result FairPOT consistently improves fairness with minimal AUC degradation or even positive gains.

The preponderance of connected devices provides unprecedented opportunities for fine-grained monitoring of the public infrastructure. However while classical models expect high quality application-specific data streams, the promise of the Internet of Things (IoT) is that of an abundance of disparate and noisy datasets …

2019-03-04abs ↗pdf ↗

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.

Bus transit systems are the backbone of public transportation in the United States. An important indicator of the quality of service in such infrastructures is on-time performance at stops, with published transit schedules playing an integral role governing the level of success of the service. However there are relativ…

2019-11-30abs ↗pdf ↗

The objective of this work is to take advantage of deep neural networks in order to make next day crime count predictions in a fine-grain city partition. We make predictions using Chicago and Portland crime data, which is augmented with additional datasets covering weather, census data, and public transportation. The c…

2018-06-05abs ↗pdf ↗

We consider learning problems where the training set consists of two types of examples: private and public. The goal is to design a learning algorithm that satisfies differential privacy only with respect to the private examples. This setting interpolates between private learning (where all examples are private) and cl…

2019-10-25abs ↗pdf ↗

Study public-data assisted private stochastic optimization with labeled or unlabeled public data.

problem Limits and capability of public-data assisted differentially private (PA-DP) algorithms in stochastic convex optimization.
method Lower bounds for PA-DP mean estimation and novel methods for leveraging public data in private supervised learning.
result Achieved dimension independent rate for GLM with unlabeled public data, showing optimality.

Public pretraining improves private model training even in extreme distribution shift scenarios.

problem Improving private model training accuracy in settings with large distribution shift.
method Empirical evaluation and theoretical explanation of public representations improving private training accuracy.
result Public representations can improve private training accuracy by up to 67% over private training from scratch in settings with large distribution shift.

Algorithm selects public datasets for private machine learning.

problem Choosing the most suitable public dataset for private machine learning.
method Measures gradient subspace distance between public and private datasets.
result Excess risk scales with the subspace distance between gradients.

Private distribution learning with public data, leveraging sample compression schemes.

problem Private distribution learning with public and private samples under differential privacy constraints.
method Connection to sample compression schemes and list learning.
result At least d public samples are necessary for private learnability of Gaussians in R^d.

Study uses AI to predict changes in international public finances based on US markets.

problem Understanding correlations between US and international public finances.
method Artificial intelligence and neural networks to model and predict changes.
result Neural network model achieved MSE of 2.79, indicating significant correlation and impact of US market volatility on international markets.

New methods estimate transport-growth pairs in unbalanced optimal transport.

problem Statistical guarantees for Monge-type estimation in unbalanced optimal transport remain limited.
method Developed two estimators for transport-growth pairs under different setups.
result Achieved minimax optimal rate for estimation of transport-growth pairs.

Paper develops a method for valid inference using language model predictions from verbal autopsy narratives.

problem Valid inference from verbal autopsy narratives for public health decision-making.
method Develops multiPPI++ method for valid inference using NLP techniques for COD prediction.
result Demonstrates the effectiveness of multiPPI++ in handling transportability issues and recovering ground truth estimates.

Predicts node sequences in graphs using multi-order network models.

problem Predicting sequences of node traversals in graphs.
method Combines multiple higher-order network models into a multi-order model, fitting and selecting the optimal maximum order.
result Outperforms state-of-the-art algorithms for next-element and full sequence prediction.

Optimal DP model training with public data improves privacy and accuracy.

problem Ensuring privacy while training models with public data.
method Proves optimal error rates for DP model training with public data, develops novel algorithms.
result Optimal error rates can be achieved by using public data or optimal DP algorithms.

Study shows how optimal transport behaves in higher dimensions.

problem Characterizing optimal transport in higher dimensions with Euclidean distance.
method Investigates the small regularization limit of entropic optimal transport.
result The limiting transport plan is supported on transport rays and uniquely minimizes a relative entropy functional.