DSETA: A Dual-Stage Continual Learning Framework for Travel Time Prediction in Dynamic Traffic Environments
The paper proposes DSETA, a dual-stage continual learning framework that integrates intra-day real-time adaptation and inter-day historical consolidation to effectively address dynamic traffic patterns and prevent catastrophic forgetting, achieving significant accuracy improvements in DiDi's production ETA prediction system across multiple major cities.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine you are trying to guess how long it will take to get from your house to a friend's party. In a perfect world, traffic would be like a metronome: steady, predictable, and the same every day. But in the real world, traffic is more like a chaotic dance party. Sometimes a surprise accident blocks the road, sometimes a holiday brings a flood of extra cars, and sometimes a new road opens up, changing the whole rhythm of the city. This is the world of ETA (Estimated Time of Arrival) prediction, a super-important job for ride-hailing apps like DiDi or Uber. If the app guesses wrong, you might be late, or the driver might get stuck in a traffic jam they didn't expect.
For a long time, computers tried to solve this by looking at history. They'd say, "Last Tuesday at 5 PM, it took 20 minutes, so it will take 20 minutes today." But this approach is like trying to navigate a stormy ocean with a map from last year; it works fine when the weather is calm, but it fails miserably when a sudden storm hits. This is where Continual Learning comes in. Think of this as a brain that doesn't just memorize facts but keeps learning new things every day without forgetting the old ones. The big challenge is balancing two things: remembering the usual patterns (like rush hour every morning) while also instantly reacting to weird, one-time events (like a parade or a crash). If the computer learns too much about the parade, it might forget that rush hour usually happens at 5 PM. If it learns too much about the usual routine, it won't know the parade is happening right now.
This is exactly the puzzle the researchers at Beijing Jiaotong University and DiDi set out to solve with a new framework called DSETA. They realized that traffic has two different "speeds" of change: fast changes that happen within a single day, and slow changes that happen over weeks or months. To handle this, they built a two-stage learning system that acts like a driver with two different sets of eyes.
First, there's the Intra-day stage (the "Day-Of" eye). This part of the system is hyper-alert to what's happening right now. It looks at real-time data, minute by minute, to catch sudden surprises. If a car crashes or a holiday traffic surge starts, this stage instantly tweaks the prediction. It's like a driver who sees a red light ahead and immediately slows down, even if the map said the road was clear five minutes ago. To make sure this quick reaction doesn't make the driver forget how to drive normally, they use a clever trick called Parameter Isolation. Imagine the driver's brain has two parts: a "Steady Hand" that knows the basic rules of the road (like how long a specific street usually takes) and a "Quick Reflex" that handles sudden swerves. The system freezes the "Steady Hand" so it doesn't get confused by the chaos, while only letting the "Quick Reflex" learn from the new, messy data.
Second, there's the Inter-day stage (the "Long-Term" eye). This part wakes up once a day to look at the bigger picture. It asks, "How has the city changed over the last few weeks?" Maybe a new road opened, or the seasons are changing, shifting when people usually go to work. This stage uses a method called Weekly Information Replay, which is like reviewing a highlight reel of the past few weeks. It makes sure the system remembers that Tuesdays are usually busy, even if today was a weird, quiet Tuesday. It also uses Knowledge Distillation, a fancy way of saying it checks its new guesses against its old, reliable knowledge to make sure it doesn't accidentally unlearn the basics.
The researchers tested this system on real data from DiDi, covering millions of trips in cities like Beijing, Wuhan, and Xi'an. They didn't just run simulations; they actually put DSETA into the real app and let it predict trips for real users. The results were impressive. In Beijing, the system reduced the average prediction error by 6.62%. In Wuhan, it cut the error by 0.73%, and in Xi'an, by 2.40%. More importantly, it made the app much more reliable during the chaotic times. The "bad case" rate—where the prediction was wildly wrong—dropped significantly, meaning fewer drivers getting stuck in unexpected jams and fewer passengers waiting longer than expected.
What's really cool is that this system is robust. Even if the computer gets busy and misses a few quick updates during the day, the system doesn't crash or give terrible advice. It has a safety net that keeps using the last good prediction until the new one is ready. The researchers found that this dual-stage approach works better than older methods that tried to learn everything at once. By separating the "fast" learning from the "slow" learning, DSETA manages to be both flexible and stable.
In the end, DSETA shows that the best way to predict the future in a chaotic world isn't to try to memorize every single detail, but to have a system that knows when to pay attention to the now and when to remember the past. It's a bit like a seasoned taxi driver who knows the city's usual rhythm but also knows how to react instantly when a parade blocks the street. Thanks to this framework, ride-hailing apps can now give you a time estimate that is not just a guess based on history, but a smart, living prediction that adapts to the city as it breathes and changes.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.