MétaCan
Menu
Back to cohort
Record W4407837134 · doi:10.1016/j.eswa.2025.127002

How effective are discrete-continuous multi-task learning compared to single-output models? Insights from travel mode and departure time analysis

2025· article· en· W4407837134 on OpenAlexafffund
Mohamad Ali Khalil, Mahmudur Rahman Fatmi

Bibliographic record

VenueExpert Systems with Applications · 2025
Typearticle
Languageen
FieldEngineering
TopicTraffic Prediction and Management Techniques
Canadian institutionsOkanagan University CollegeUniversity of British Columbia, Okanagan Campus
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceTask (project management)Mode (computer interface)Travel timeMulti-task learningArtificial intelligenceHuman–computer interactionEconomics

Abstract

fetched live from OpenAlex

In travel behaviour research, joint modelling exercises capturing the interdependencies among multiple decisions have predominantly relied on theory-driven econometric models. While data-driven techniques hold significant promise, existing studies predominantly focus on discrete-discrete output models, neglecting the complexity of mixed decision types inherent in travel behaviour. Many interdependent travel decisions involve mixed decision types; for example, travel mode choice is discrete, while departure time is continuous. Ignoring these inherent dynamics may lead to biased model estimations and flawed policy implications. This underscores the need for joint ML approaches that accommodate discrete–continuous decision scenarios. In this study, we develop artificial neural networks (ANNs) to jointly model travel mode as a discrete choice and departure time as a continuous variable. The jointness is achieved by using shared hidden layers in the neural network, allowing the model to learn common features that influence both travel mode choice and departure time. At first, we evaluate two ANN architectures: hard-parameter sharing (HP-MTL), which involves shared layers and task-specific layers within the ANN, and cross-stitch (CS-MTL), which introduces a more flexible sharing mechanism by learning weighted combinations of activations from task-specific layers. Both models are compared against single-output neural network (SO-NNx) and econometric models, with additional evaluation of prediction speed across synthetic datasets of varying sizes. The results show that the CS-MTL (i.e., more complex architecture) performed almost similarly to SO-NNx in most performance measures but did worse than the HP-MTL, likely due to negative learning , where increased complexity does not improve performance given the nature of the task interdependencies. For departure time prediction, HP-MTL improved the R 2 by 21.4 % and reduced the mean squared error (MSE) by 8.3 % compared to the SO-NNx and achieved 4.7-fold and 27 % improvements over the hazard model. In travel mode choice, HP-MTL delivered modest accuracy gains overall—with a particularly ∼10 % improvement for transit mode predictions. In contrast, more sophisticated MTL architectures adapted mainly from computer vision performed worse than the SO-NNx. In terms of speed, HP-MTL was 35–45 % faster than SO-NNx, while econometric models were about 2 times faster. The findings of this research add capacity to transportation modelling literature in exploring, using, and assessing the suitability of using ML to model joint discrete–continuous decisions.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.982
Threshold uncertainty score0.817

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.213
Teacher spread0.206 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueExpert Systems with ApplicationsSame topicTraffic Prediction and Management TechniquesFrench-language works237,207