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

1223 · Apr 202019922001200920172026
40 results for dock-less bikes

ALCNN predicts bike demand patterns in new cities using multi-source geographic data.

problem Inferring fine-grained bike demands in new cities with limited data.
method Extract features from POI, road networks, and nighttime light; use coPCA for adaptation; apply DWT for daily patterns; use attention-based local CNN (ALCNN).
result ALCNN outperforms other methods in predicting bike demand patterns.

Dockless bike sharing systems need effective bike flow prediction models.

problem Imbalanced and dynamic use of bikes leads to mandatory rebalancing operations.
method Divide urban area into regions, model spatio-temporal bike flows, extract traffic patterns, and predict bike flows.
result Interpretable bike flow prediction model provides valuable insights into bike flow analysis.

This study analyzes how weather impacts bike sharing usage in Washington D.C.

problem Understanding how weather affects bike sharing usage patterns.
method Gathered bike usage and weather data, used k-means clustering algorithm to identify clusters.
result Weather significantly impacts bike usage, with temperature and precipitation being the most influential factors.

One fundamental issue in managing bike sharing systems is the bike flow prediction. Due to the hardness of predicting the flow for a single station, recent research works often predict the bike flow at cluster-level. While such studies gain satisfactory prediction accuracy, they cannot directly guide some fine-grained …

2018-07-28abs ↗pdf ↗

Proposes AtCoR for predicting bike station usage, improving station network reconfiguration.

problem Challenges in predicting new bike stations due to lack of historical data.
method AtCoR algorithm that predicts both existing and new bike stations using station-centered heatmaps and historical correlations.
result AtCoR outperforms existing models in predicting bike station usage.

Paper improves bike-sharing demand prediction by adapting to changing patterns.

problem Improving bike-sharing demand prediction under temporal domain shifts.
method Gen-ROTDA, a robust optimal transport-guided residual domain adaptation framework.
result Gen-ROTDA achieves the lowest MAE and is the best OT-family method on average.

Dataset of 4500 bicycle designs aids in design analysis and synthesis.

problem Identify gaps in bicycle market and design space, classify bicycles, synthesize new designs.
method Processed dataset, unsupervised dimensionality reduction, supervised classification, machine learning synthesis.
result Identified design parameters and factors influencing bicycle classification.

MCD automates counterfactual design searches for multi-modal tasks.

problem Designing for multi-objective goals and complex constraints.
method Model-agnostic counterfactual search method for multi-modal design modifications.
result MCD streamlines and automates counterfactual search, recommending effective design modifications.

Proposes a new model for more accurate demand forecasting considering dynamic contextual information.

problem Traditional methods fail to capture spatio-temporal and dynamic contextual dependencies in demand forecasting.
method Integrates temporal, relational, spatial, and dynamic contextual dependencies using a Context Integrated Graph Neural Network (CIGNN).
result CIGNN outperforms state-of-the-art baselines in multi-step ahead demand forecasting.

We utilize Wi-Fi communications from smartphones to predict their mobility mode, i.e. walking, biking and driving. Wi-Fi sensors were deployed at four strategic locations in a closed loop on streets in downtown Toronto. Deep neural network (Multilayer Perceptron) along with three decision tree based classifiers (Decisi…

2018-09-16abs ↗pdf ↗

The paper optimizes sensor selection for network time series data.

problem Optimizing sensor selection for network time series data with minimal error.
method Data-driven strategies to turn off sensors or select a sampling set of nodes.
result Proposes and compares various data-driven strategies for sensor selection.

Estimator improves prediction with missing data in multi-environment settings.

problem Handling missing data in multi-environment settings for robust prediction.
method Derive an estimator from invariance objective under missing outcomes.
result The estimator achieves lower prediction error despite using a biased imputation model.

This master thesis focuses on practical application of Convolutional Neural Network models on the task of road labeling with bike attractivity score. We start with an abstraction of real world locations into nodes and scored edges in partially annotated dataset. We enhance information available about each edge with pho…

2018-06-27abs ↗pdf ↗

A new algorithm learns from failures to optimize under constraints efficiently.

problem Optimizing under unknown constraints with limited failure tolerance.
method Excursion search controls risk as a function of a failure budget.
result The algorithm achieves lower regret and uses failures budget more efficiently.

Proposes a dynamic model for urban traffic volume prediction.

problem Urban traffic volume prediction for better traffic management and driver planning.
method Combines bidirectional LSTM, attention mechanism, and external features.
result Improves prediction precision by 3-7 percent on NYC-Taxi and NYC-Bike datasets.

In urban environments, supply resources have to be constantly matched to the "right" locations (where customer demand is present) so as to improve quality of life. For instance, ambulances have to be matched to base stations regularly so as to reduce response time for emergency incidents in EMS (Emergency Management Sy…

2018-12-03abs ↗pdf ↗

The paper proposes a new auto-regressive model for multivariate distributional time series.

problem Statistical analysis of multivariate time series of probability measures.
method Wasserstein space, auto-regressive model, iterated random function systems.
result Consistent estimator for auto-regressive coefficients with sparse structure.

Deep Learning detects cyclists' orientation for safer roads.

problem Ensuring safety for cyclists in intelligent transportation systems.
method Transfer Learning with pre-trained models, multi-class detection, new dataset creation.
result Faster R-CNN with ResNet50 proved precise but slower; SSD with InceptionV2 provided good trade-off.

CONTINA provides adaptive confidence intervals for traffic demand prediction.

problem Uncertainty in future traffic demand predictions and the need for valid confidence intervals.
method Adaptive confidence interval method that adjusts based on deployment errors.
result Valid confidence intervals with shorter lengths and theoretical coverage guarantee.

Paper tackles learning win-win solutions in aggregation systems.

problem Learning approximate equilibrium solutions in aggregation systems to keep suppliers.
method Multi-Agent Reinforcement Learning (MARL) with variance reduction mechanism.
result Approach reduces value variance and moves joint solution closer to Nash Equilibrium.

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 ↗

We study a simple model of bicycle motion: a segment of fixed length in multi-dimensional Euclidean space, moving so that the velocity of the rear end is always aligned with the segment. If the front track is prescribed, the trajectory of the rear wheel is uniquely determined via a certain first order differential equa…

2017-05-17abs ↗pdf ↗

A new model clusters network nodes based on relative edge weights.

problem Clustering networks ignores node capacities, leading to biased results.
method Proposes a Dirichlet stochastic block model for composition-weighted networks.
result Validated on simulated and real-world networks, showing improved clustering accuracy.