PulseAugur
中
实时 18:50:16
English(EN) Robust OT-Guided Generative Residual Domain Adaptation for Bike-Sharing Demand Prediction under Temporal Domain Shift

新框架通过时间自适应改进共享单车需求预测

作者 PulseAugur 编辑部 · [2 个来源] ·

研究人员开发了一个名为Gen-ROTDA的新框架，以改进因不断变化的出行模式而随时间退化的共享单车需求预测模型。该方法利用最优传输来使模型适应新的时间域，用一小部分标记数据拟合目标域锚点并转移残差需求。实验表明，Gen-ROTDA在近期预测任务上实现了最低的平均绝对误差，并且即使在嘈杂、未标记的数据下也表现出稳定性，优于其他最优传输变体。 AI

影响 增强了预测模型在动态环境中的鲁棒性，这对于城市交通等现实世界应用至关重要。

排序理由 该集群包含一篇详细介绍用于特定预测任务的新机器学习框架的学术论文。

在 arXiv stat.ML 阅读 →

AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →

新框架通过时间自适应改进共享单车需求预测

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Research
该集群包含一篇详细介绍用于特定预测任务的新机器学习框架的学术论文。
Source corroboration
2 independent sources
Multiple independent publishers reporting the same story raises confidence that it's real and newsworthy.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
139 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [2]

  1. arXiv stat.ML TIER_1 English(EN) · Yiming Ma ·

    面向时间域偏移下共享单车需求预测的鲁棒OT引导生成残差域自适应

    arXiv:2605.23115v1 Announce Type: cross Abstract: Bike-sharing models trained on historical station-hour data may degrade when deployed in later years because travel patterns change over time. This paper studies March Citi Bike demand prediction from 2021 to 2026 as a temporal do…

  2. arXiv stat.ML TIER_1 English(EN) · Yiming Ma ·

    面向时间域偏移下共享单车需求预测的鲁棒OT引导生成残差域自适应

    Bike-sharing models trained on historical station-hour data may degrade when deployed in later years because travel patterns change over time. This paper studies March Citi Bike demand prediction from 2021 to 2026 as a temporal domain adaptation problem and proposes Gen-ROTDA, a …

相关实体

相关话题