Toward Equitable Low-Carbon Mobility: Fairness-Aware Demand Prediction for Expanding Bike-Sharing Systems
- URL: http://arxiv.org/abs/2608.26451v1
- Date: Wed, 26 Aug 2026 22:57:40 GMT
- Title: Toward Equitable Low-Carbon Mobility: Fairness-Aware Demand Prediction for Expanding Bike-Sharing Systems
- Abstract summary: We propose FairGIN, a fairness-aware graph neural network for demand prediction in expanding bike-sharing systems.<n>Experiments on NYC and Seattle demonstrate that FairGIN achieves state-of-the-art predictive accuracy across diverse expansion scenarios.
- Score: 2.877073407903913
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Bike-sharing systems are an important component of low-carbon urban mobility, but continued expansion creates challenges in both cold-start prediction and equitable resource allocation. Newly deployed stations lack historical ridership records, causing a mismatch between training and inference for graph-based models on evolving networks. Historical demand may also encode structural inequalities, as lower ridership in low-income neighborhoods can reflect limited infrastructure access rather than weak latent demand. Models trained directly on such data may therefore reinforce existing mobility disparities. We propose FairGIN, a fairness-aware graph neural network for demand prediction in expanding bike-sharing systems. FairGIN integrates three components. Expansion-Simulated Increment Training stochastically simulates network expansion during training to reduce the cold-start distribution gap. Attention-Based Knowledge Transfer combines station-adaptive temperature scaling with orthogonal embedding alignment to transfer representations from data-rich existing stations to data-sparse new stations. Fairness-Aware Optimization introduces income-stratified regularization and an equity-calibrated deployment score to support more inclusive station placement. Experiments on NYC and Seattle demonstrate that FairGIN achieves state-of-the-art predictive accuracy across diverse expansion scenarios while substantially reducing income-based disparities without compromising overall system efficiency.
Related papers
- Post-hoc Provider Fairness Adaptation via Hierarchical Exposure Alignment [54.58748721533078]
Post-hoc Fairness Adaptation (PFA) is a lightweight framework that equips a frozen recommender with a fairness adapter.<n>It learns personalized additive score adjustments from user-item embeddings to steer provider exposure toward fairness.<n>PFA achieves substantial fairness gains with negligible accuracy loss, consistently outperforming strong baselines.
arXiv Detail & Related papers (2026-05-02T16:32:52Z) - Transit for All: Mapping Equitable Bike2Subway Connection using Region Representation Learning [4.403122905236942]
Bike-sharing systems (BSS) can bridge equity gaps by providing affordable first- and last-mile connections.<n>We introduce Transit for All (TFA), a spatial computing framework designed to guide the equitable expansion of BSS.<n>Using NYC as a case study, we identify transit accessibility gaps that disproportionately impact low-income and minority communities.
arXiv Detail & Related papers (2025-06-18T03:31:07Z) - Predicting travel demand of a bike sharing system using graph convolutional neural networks [0.0]
This study focuses on predicting travel demand within a bike-sharing system.
A novel hybrid deep learning model called the gate graph convolutional neural network is introduced.
By integrating trajectory data, weather data, access data, and leveraging gate graph convolution networks, the accuracy of travel demand forecasting is significantly improved.
arXiv Detail & Related papers (2024-08-18T00:24:30Z) - Improved Bayes Risk Can Yield Reduced Social Welfare Under Competition [99.7047087527422]
In this work, we demonstrate that competition can fundamentally alter the behavior of machine learning scaling trends.
We find many settings where improving data representation quality decreases the overall predictive accuracy across users.
At a conceptual level, our work suggests that favorable scaling trends for individual model-providers need not translate to downstream improvements in social welfare.
arXiv Detail & Related papers (2023-06-26T13:06:34Z) - Deep trip generation with graph neural networks for bike sharing system
expansion [7.737133861503814]
We propose a graph neural network (GNN) approach to predicting the station-level demand based on multi-source urban built environment data.
The proposed approach can be regarded as a generalized spatial regression model, indicating the commonalities between spatial regression and GNNs.
arXiv Detail & Related papers (2023-03-20T16:43:41Z) - Predicting Citi Bike Demand Evolution Using Dynamic Graphs [81.12174591442479]
We apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
In this paper, we attempt to apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
arXiv Detail & Related papers (2022-12-18T21:43:27Z) - A Cluster-Based Trip Prediction Graph Neural Network Model for Bike
Sharing Systems [2.1423963702744597]
Bike Sharing Systems (BSSs) are emerging as an innovative transportation service.
Ensuring the proper functioning of a BSS is crucial given that these systems are committed to eradicating many of the current global concerns.
Good knowledge of users' transition patterns is a decisive contribution to the quality and operability of the service.
arXiv Detail & Related papers (2022-01-03T15:47:40Z) - Context-aware demand prediction in bike sharing systems: incorporating
spatial, meteorological and calendrical context [0.0]
Recent contributions from deep learning and distance-based predictors show limited success on forecasting bike sharing demand.
This work proposes a comprehensive set of new principles to incorporate both historical and prospective sources of spatial, meteorological, situational and calendrical context in predictive models of station demand.
arXiv Detail & Related papers (2021-05-03T18:53:58Z) - Center Prediction Loss for Re-identification [65.58923413172886]
We propose a new loss based on center predictivity, that is, a sample must be positioned in a location of the feature space such that from it we can roughly predict the location of the center of same-class samples.
We show that this new loss leads to a more flexible intra-class distribution constraint while ensuring the between-class samples are well-separated.
arXiv Detail & Related papers (2021-04-30T03:57:31Z) - Supercharging Imbalanced Data Learning With Energy-based Contrastive
Representation Transfer [72.5190560787569]
In computer vision, learning from long tailed datasets is a recurring theme, especially for natural image datasets.
Our proposal posits a meta-distributional scenario, where the data generating mechanism is invariant across the label-conditional feature distributions.
This allows us to leverage a causal data inflation procedure to enlarge the representation of minority classes.
arXiv Detail & Related papers (2020-11-25T00:13:11Z) - Exploiting Interpretable Patterns for Flow Prediction in Dockless Bike
Sharing Systems [45.45179250456602]
We propose an Interpretable Bike Flow Prediction (IBFP) framework, which can provide effective bike flow prediction with interpretable traffic patterns.
By dividing the urban area into regions according to flow density, we first model the bike flows between regions with graph regularized sparse representation.
Then, we extract traffic patterns from bike flows using subspace clustering with sparse representation to construct interpretable base matrices.
Finally, experimental results on real-world data show the advantages of the IBFP method for flow prediction in dockless bike sharing systems.
arXiv Detail & Related papers (2020-04-13T05:31:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.