SearcharxivSearch

arXiv subjects

Baichuan Mo

Publications and source records attributed to Baichuan Mo.

At least 19 recordsLinked to original sources

When Do Corrective Features Help? An Agent for Corrective Feature Discovery on Black-Box Forecasters

Frozen pretrained forecasters often fail in structured, recurring ways that are costly to repair through fine-tuning. We study corrective feature discovery: mining interpretable features of a frozen forecaster's residual to drive a lightweight post-hoc corrector. Prior automated feature engineering models the data-generating process; corrective features instead model the model-failure process. We present CRAFTER (Corrective Residual Agent with Feature-based Temporal Exploration and Reasoning), which keeps the backbone frozen and mines its residual with two complementary generators: a compositional search over the raw input channels, and a large language model (LLM) that proposes named feature combinations, binary flags, and short executable code. A single validation-grounded gate accepts or rejects every candidate regardless of its origin, and a validation-selected corrector applies the accepted features or leaves the forecast unchanged. This source-agnostic pipeline also allows prior feature-engineering systems to be evaluated under identical conditions, making CRAFTER an instrument for attributing forecast improvements to the feature source alone. Across six public datasets and six frozen backbones, CRAFTER surpasses every dedicated feature-engineering system at every feature budget, roughly doubling the improvement achieved by the corrector alone and reducing the error of the weakest backbones by up to 27%. These gains are robust across different LLM backends and persist even when applied on top of fine-tuned backbones.

cs.LG

TorchDCM: A Unified PyTorch-Native Package for Discrete Choice Modeling

Estimating large and simulation-intensive discrete choice models (DCMs) requires repeated evaluation of utilities, probabilities, derivatives, and simulated likelihoods over many observations, alternatives, and draws. Existing DCM software provides mature econometric workflows, while recent GPU-oriented tools accelerate selected models, leaving a gap between econometric coverage and scalable differentiable computation. We introduce TorchDCM, an open Python package for discrete choice modeling that compiles choice data and model specifications into a unified PyTorch-native likelihood engine for estimation, inference, prediction, and structured reporting on CPU or CUDA devices. The package covers the principal econometric functionality available across Biogeme and Apollo, including multinomial, nested, mixed, ordered, latent-variable, and panel likelihoods. It also supports ragged choice sets, constrained parameters, covariance estimation, willingness-to-pay analysis, elasticities, and extensible likelihood components. We evaluate TorchDCM against seven other estimation packages in aligned synthetic and real-data full-estimation experiments. TorchDCM completes all 45 synthetic cases, runs fastest in every comparable synthetic case, and satisfies the prespecified final-log-likelihood tolerance in every comparison with at least two comparable solutions. More precisely, it reduces median runtime by 89.1%-99.7% relative to Biogeme and Apollo across model-data settings. CUDA provides an additional 12.0-71.0x speedup over single-core TorchDCM. These results establish a scalable and reproducible foundation for econometric estimation and differentiable choice-model development. The open-source package and executed examples are available at https://github.com/mbc96325/torchdcm.

stat.ML

Learned Pairwise Deep Dual-Optimal Inequalities for Stabilizing Column Generation

Column generation (CG) is central to many large-scale optimization algorithms, including branch-price-and-cut methods for vehicle routing problems, but unstable dual solutions can substantially slow its convergence. Existing deep dual-optimal inequalities can reduce this instability by restricting the dual space. Their construction, however, typically relies on problem-specific exchange arguments that are difficult to establish for routing problems with capacity limits, time windows, and other resource constraints. We introduce learned pairwise deep dual-optimal inequalities (L-PDDOIs), a learning framework that predicts pairwise orderings between dual variables and incorporates their primal counterparts directly into the master problem. To construct training labels, the framework samples optimal dual solutions and selects pairwise order relations that hold simultaneously on a sufficiently large common subset of the samples. A classifier then assigns a score to each candidate relation. Because conflicts and redundancies among the predicted relations can impair performance, graph-based postprocessing filters and compresses the candidate set before deployment. We further introduce a recovery procedure that selectively relaxes learned inequalities and provides a certificate when the baseline CG bound has been restored. On the main test sets for the capacitated vehicle routing problem and the vehicle routing problem with time windows, direct deployment of L-PDDOIs reduces the geometric mean root CG time by 89.7% and 93.9%, respectively, while incurring mean bound losses of only 1.3% and 0.5%. The recovery procedure retains corresponding time reductions of 54.8% and 83.1%, respectively, while guaranteeing no loss in the CG bound.

math.OC

Online Linear Programming with Replenishment

We study an online linear programming (OLP) model in which inventory is not provided upfront but instead arrives gradually through an exogenous stochastic replenishment process. This replenishment-based formulation captures operational settings, such as e-commerce fulfillment, perishable supply chains, and renewable-powered systems, where resources are accumulated gradually and initial inventories are small or zero. The introduction of dispersed, uncertain replenishment fundamentally alters the structure of classical OLPs, creating persistent stockout risk and eliminating advance knowledge of the total budget. We develop new algorithms and regret analyses for three major distributional regimes studied in the OLP literature: bounded distributions, finite-support distributions, and continuous-support distributions with a non-degeneracy condition. For bounded distributions, we design an algorithm that achieves $\widetilde{\mathcal{O}}(\sqrt{T})$ regret. For finite-support distributions with a non-degenerate induced LP, we obtain $\mathcal{O}(\log T)$ regret, and we establish an $\Omega(\sqrt{T})$ lower bound for degenerate instances, demonstrating a sharp separation from the classical setting where $\mathcal{O}(1)$ regret is achievable. For continuous-support, non-degenerate distributions, we develop a two-stage accumulate-then-convert algorithm that achieves $\mathcal{O}(\log^2 T)$ regret, comparable to the $\mathcal{O}(\log T)$ regret in classical OLPs. Together, these results provide a near-complete characterization of the optimal regret achievable in OLP with replenishment. Finally, we empirically evaluate our algorithms and demonstrate their advantages over natural adaptations of classical OLP methods in the replenishment setting.

math.OC

TimeMixer++: A General Time Series Pattern Machine for Universal Predictive Analysis

Time series analysis plays a critical role in numerous applications, supporting tasks such as forecasting, classification, anomaly detection, and imputation. In this work, we present the time series pattern machine (TSPM), a model designed to excel in a broad range of time series tasks through powerful representation and pattern extraction capabilities. Traditional time series models often struggle to capture universal patterns, limiting their effectiveness across diverse tasks. To address this, we define multiple scales in the time domain and various resolutions in the frequency domain, employing various mixing strategies to extract intricate, task-adaptive time series patterns. Specifically, we introduce a general-purpose TSPM that processes multi-scale time series using (1) multi-resolution time imaging (MRTI), (2) time image decomposition (TID), (3) multi-scale mixing (MCM), and (4) multi-resolution mixing (MRM) to extract comprehensive temporal patterns. MRTI transforms multi-scale time series into multi-resolution time images, capturing patterns across both temporal and frequency domains. TID leverages dual-axis attention to extract seasonal and trend patterns, while MCM hierarchically aggregates these patterns across scales. MRM adaptively integrates all representations across resolutions. This method achieves state-of-the-art performance across 8 time series analytical tasks, consistently surpassing both general-purpose and task-specific models. Our work marks a promising step toward the next generation of TSPMs, paving the way for further advancements in time series analysis.

cs.LG

Robust Binary and Multinomial Logit Models for Classification with Data Uncertainties

Binary logit (BNL) and multinomial logit (MNL) models are the two most widely used discrete choice models for travel behavior modeling and prediction. However, in many scenarios, the collected data for those models are subject to measurement errors. Previous studies on measurement errors mostly focus on "better estimating model parameters" with training data. In this study, we focus on using BNL and MNL for classification problems, that is, to ``better predict the behavior of new samples'' when measurement errors occur in testing data. To this end, we propose a robust BNL and MNL framework that is able to account for data uncertainties in both features and labels. The models are based on robust optimization theory that minimizes the worst-case loss over a set of uncertainty data scenarios. Specifically, for feature uncertainties, we assume that the l_p-norm of the measurement errors in features is smaller than a pre-established threshold. We model label uncertainties by limiting the number of mislabeled choices to at most Gamma. Based on these assumptions, we derive a tractable robust counterpart. The derived robust-feature BNL and the robust-label MNL models are exact. However, the formulation for the robust-feature MNL model is an approximation of the exact robust optimization problem. An upper bound of the approximation gap is provided. We prove that the robust estimators are inconsistent but with a higher trace of the Fisher information matrix. They are preferred when out-of-sample data has errors due to the shrunk scale of the estimated parameters. The proposed models are validated in a binary choice data set and a multinomial choice data set, respectively. Results show that the robust models (both features and labels) can outperform the conventional BNL and MNL models in prediction accuracy and log-likelihood.

math.OC

Large Language Models for Travel Behavior Prediction

Travel behavior prediction is a core problem in transportation demand management and is traditionally addressed using numerical models calibrated on observed data. With recent advances in large language models (LLMs), new opportunities have emerged to model human decision-making through natural language reasoning. This study explores the use of LLMs for travel behavior prediction through two complementary frameworks. The first framework employs a zero-shot prompting strategy, where the prediction task, traveler attributes, and relevant domain knowledge are described in text, enabling the LLM to directly generate predictions without task-specific training data. The second framework uses LLM-generated text embeddings as high-level representations of travel scenarios, which are then combined with conventional supervised learning models to support prediction in small-sample settings. Empirical results show that both approaches achieve performance comparable to, and in some cases competitive with, classical models such as multinomial logit, random forest, and neural networks. These findings suggest that LLMs offer a flexible and data-efficient alternative for travel behavior prediction.

cs.LG

Amazon Last-Mile Delivery Trajectory Prediction Using Hierarchical TSP with Customized Cost Matrix

In response to the Amazon Last-Mile Routing Challenge, Team Permission Denied proposes a hierarchical Travelling Salesman Problem (TSP) optimization with a customized cost matrix. The higher level TSP solves for the zone sequence while the lower level TSP solves the intra-zonal stop sequence. The cost matrix is modified to account for routing patterns beyond the shortest travel time. Lastly, some post-processing is done to edit the sequence to match commonly observed routing patterns, such as when travel times are similar, drivers usually start with stops with more packages than those with fewer packages. The model is tested on 1223 routes that are randomly selected out of the training set and the score is 0.0381. On the 13 routes in the given model apply set, the score was 0.0375.

math.OC

Proof of Travel for Trust-Based Data Validation in V2I Communication

Previous work on misbehavior detection and trust management for Vehicle-to-Everything (V2X) communication security is effective in identifying falsified and malicious V2X data. Each vehicle in a given region can be a witness to report on the misbehavior of other nearby vehicles, which will then be added to a "blacklist." However, there may not exist enough witness vehicles that are willing to opt-in in the early stage of connected-vehicle deployment. In this paper, we propose a "whitelisting" approach to V2X security, titled Proof-of-Travel (POT), which leverages the support of roadside infrastructure. Our goal is to transform the power of cryptography techniques embedded within Vehicle-to-Infrastructure (V2I) protocols into game-theoretic mechanisms to incentivize connected-vehicle data sharing and validate data trustworthiness simultaneously. The key idea is to determine the reputation of and the contribution made by a vehicle based on its distance traveled and the information it shared through V2I channels. In particular, the total vehicle miles traveled for a vehicle must be testified by digital signatures signed by each infrastructure component along the path of its movement. While building a chain of proofs of spatial movement creates burdens for malicious vehicles, acquiring proofs does not result in extra costs for normal vehicles, which naturally want to move from the origin to the destination. The POT protocol is used to enhance the security of previous voting-based data validation algorithms for V2I crowdsensing applications. For the POT-enhanced voting, we prove that all vehicles choosing to cheat are not a pure Nash equilibrium using game-theoretic analysis. Simulation results suggest that the POT-enhanced voting is more robust to malicious data.

cs.CR

Passenger Path Choice Estimation Using Smart Card Data: A Latent Class Approach with Panel Effects Across Days

Understanding passengers' path choice behavior in urban rail systems is a prerequisite for effective operations and planning. This paper attempts bridging the gap by proposing a probabilistic approach to infer passengers' path choice behavior in urban rail systems using a large-scale smart card data. The model uses latent classes and panel effects to capture passengers' implicit behavior heterogeneity and longitudinal correlations, key research gaps in big data driven behavior studies. We formulate the probability of each individual's arrival time at a destination based on their path choice behavior, and estimate corresponding path choice model parameters as a maximum likelihood estimation problem. The original likelihood function is intractable due to the exponential computation complexity. We derive a tractable likelihood function and propose a numerical integral approach to efficiently estimate the model. Also, we propose a method to calculate the t-statistic of the estimated choice parameters based on the numerically estimated Hessian matrix and Cramer-Rao bound (the lower bound on the coefficient variance). Case studies using synthetic data validate the model performance and its robustness against parameter initialization and input errors, and highlight the importance of incorporating crowding impact in path choice estimation. Applications using actual data from the Mass Transit Railway, Hong Kong reveal two latent groups of passengers: time-sensitive (TS) and comfort-aware (CA). TS passengers are those who are more likely to choose paths with short travel times. Most of them are regular commuters with high travel frequency and less schedule flexibility. CA passengers care more about the travel comfort experience and choose paths with less walking and waiting times. The proposed approach is data-driven and general to accommodate other discrete choice structures.

stat.AP

Predicting Drivers' Route Trajectories in Last-Mile Delivery Using A Pair-wise Attention-based Pointer Neural Network

In last-mile delivery, drivers frequently deviate from planned delivery routes because of their tacit knowledge of the road and curbside infrastructure, customer availability, and other characteristics of the respective service areas. Hence, the actual stop sequences chosen by an experienced human driver may be potentially preferable to the theoretical shortest-distance routing under real-life operational conditions. Thus, being able to predict the actual stop sequence that a human driver would follow can help to improve route planning in last-mile delivery. This paper proposes a pair-wise attention-based pointer neural network for this prediction task using drivers' historical delivery trajectory data. In addition to the commonly used encoder-decoder architecture for sequence-to-sequence prediction, we propose a new attention mechanism based on an alternative specific neural network to capture the local pair-wise information for each pair of stops. To further capture the global efficiency of the route, we propose a new iterative sequence generation algorithm that is used after model training to identify the first stop of a route that yields the lowest operational cost. Results from an extensive case study on real operational data from Amazon's last-mile delivery operations in the US show that our proposed method can significantly outperform traditional optimization-based approaches and other machine learning methods (such as the Long Short-Term Memory encoder-decoder and the original pointer network) in finding stop sequences that are closer to high-quality routes executed by experienced drivers in the field. Compared to benchmark models, the proposed model can increase the average prediction accuracy of the first four stops from around 0.229 to 0.312, and reduce the disparity between the predicted route and the actual route by around 15%.

cs.LG

Modeling Virus Transmission Risks in Commuting with Emerging Mobility Services: A Case Study of COVID-19

Commuting is an important part of daily life. With the gradual recovery from COVID-19 and more people returning to work from the office, the transmission of COVID-19 during commuting becomes a concern. Recent emerging mobility services (such as ride-hailing and bike-sharing) further deteriorate the infection risks due to shared vehicles or spaces during travel. Hence, it is important to quantify the infection risks in commuting. This paper proposes a probabilistic framework to estimate the risk of infection during an individual's commute considering different travel modes, including public transit, ride-share, bike, and walking. The objective is to evaluate the probability of infection as well as the estimation errors (i.e., uncertainty quantification) given the origin-destination (OD), departure time, and travel mode. We first define a general trip planning function to generate trip trajectories and probabilities of choosing different paths according to the OD, departure time, and travel mode. Then, we consider two channels of infections: 1) infection by close contact and 2) infection by touching surfaces. The infection risks are calculated on a trip segment basis. Different sources of data (such as smart card data, travel surveys, and population data) are used to estimate the potential interactions between the individual and the infectious environment. The model is implemented in the MIT community as a case study. We evaluate the commute infection risks for employees and students. Results show that most of the individuals have an infection probability close to zero. The maximum infection probability is around 0.8%, implying that the probability of getting infected during the commuting process is low. Individuals with larger travel distances, traveling in transit, and traveling during peak hours are more likely to get infected.

stat.AP

Individual Path Recommendation Under Public Transit Service Disruptions Considering Behavior Uncertainty

Public transit passengers need guidance during service disruptions. This study proposes an individual-based path (IPR) recommendation model. The model decides which paths to recommend for each passenger with the objective of minimizing system travel time and respecting passengers' path choice preferences. We assume the recommendations could affect passengers' path choice probabilities, but their actual choices are uncertain. This behavior uncertainty makes the problem a stochastic optimization with decision-dependent distributions. We propose a single-point approximation method to eliminate the expectation operator by introducing two new concepts: epsilon-feasibility and Gamma-concentration, which control the mean and variance of path flows in the optimization problem. The approximation yields a tractable single-stage mixed integer linear formulation, which can be solved efficiently with Benders decomposition. The approximation gap is approved to be bounded from the above. Additional theoretical analysis shows that epsilon-feasibility and Gamma-concentration are strongly connected to expectation and chance constraints in a typical stochastic optimization formulation, respectively. The model is implemented in a real-world case study using data from an urban rail disruption in the Chicago Transit Authority system, and a synthetic case study with varied network sizes and incident locations. In the real-world case study, results show that the proposed IPR model reduces the average travel times in the system by 6.6% compared to the status quo and by 4.2% compared to a capacity-based benchmark model. In the synthetic case study, the proposed model shows 15.0% to 1.8% lower system travel time compared to the capacity-based benchmark, depending on the network sizes and demand situations.

math.OC

Bulk Service Queueing for Transit Resilience under Short Random Service Suspensions

Short service suspensions are common in public transit systems, but their operational impacts remain difficult to quantify. We develop an analytical framework for measuring the resilience of a transit line under short random service suspensions. Vehicle movement is represented by a two state process in which vehicles either travel normally or stop during a suspension, and the induced stochastic headways enter a bulk service queueing model with finite vehicle capacity and passenger carryover. The model yields two classes of resilience indicators. Stability conditions determine whether station queues remain bounded, while closed form expressions characterize the mean and variance of station level queue length and waiting time. We construct an independent renewal approximation for headways whose common marginal distribution is obtained by taking the positive part of a raw headway formed from the incident adjusted scheduled headway and the difference between two independent compound Poisson exponential variables. The renewal approximation preserves the marginal effects of short suspensions while omitting serial dependence and delay propagation across multiple vehicles. Combining the resulting passenger arrival distribution with a Markov representation of passenger loads across stations allows the resilience indicators to be computed sequentially along the route. Numerical experiments show that short suspensions disproportionately affect congested stations and that changes in incident duration and scheduled headway can dominate comparable changes in vehicle capacity. A recursive first in, first out simulation assesses the analytical approximations and clarifies the role of headway variability.

math.PR

Calibrating Path Choices and Train Capacities for Urban Rail Transit Simulation Models Using Smart Card and Train Movement Data

Transit network simulation models are often used for performance and retrospective analysis of urban rail systems, taking advantage of the availability of extensive automated fare collection (AFC) and automated vehicle location (AVL) data. Important inputs to such models, in addition to origin-destination flows, include passenger path choices and train capacity. Train capacity, which has often been overlooked in the literature, is an important input that exhibits a lot of variabilities. The paper proposes a simulation-based optimization (SBO) framework to simultaneously calibrate path choices and train capacity for urban rail systems using AFC and AVL data. The calibration is formulated as an optimization problem with a black-box objective function. Seven algorithms from four branches of SBO solving methods are evaluated. The algorithms are evaluated using an experimental design that includes five scenarios, representing different degrees of path choice randomness and crowding sensitivity. Data from the Hong Kong Mass Transit Railway (MTR) system is used as a case study. The data is used to generate synthetic observations used as "ground truth". The results show that the response surface methods (particularly Constrained Optimization using Response Surfaces) have consistently good performance under all scenarios. The proposed approach drives large-scale simulation applications for monitoring and planning.

cs.OH

Transit Frequency Setting Problem with Demand Uncertainty

Public transit systems are the backbone of urban mobility systems in the era of urbanization. The design of transit schedules is important for the efficient and sustainable operation of public transit. However, previous studies usually assume fixed demand patterns and ignore uncertainties in demand, which may generate transit schedules that are vulnerable to demand variations. To address demand uncertainty issues inherent in public transit systems, this paper adopts both stochastic programming (SP) and robust optimization (RO) techniques to generate robust transit schedules against demand uncertainty. A nominal (non-robust) optimization model for the transit frequency setting problem (TFSP) under a single transit line setting is first proposed. The model is then extended to SP-based and RO-based formulations to incorporate demand uncertainty. The large-scale origin-destination (OD) matrices for real-world transit problems make the optimization problems hard to solve. To efficiently generate robust transit schedules, a Transit Downsizing (TD) approach is proposed to reduce the dimensionality of the problem. We prove that the optimal objective function of the problem after TD is close to that of the original problem (i.e., the difference is bounded from above). The proposed models are tested with real-world transit lines and data from the Chicago Transit Authority (CTA). Compared to the current transit schedule implemented by CTA, the nominal TFSP model without considering demand uncertainty reduces passengers' wait times while increasing in-vehicle travel times. After incorporating demand uncertainty, both stochastic and robust TFSP models reduce passengers' wait times and in-vehicle travel times simultaneously. The robust TFSP model produces transit schedules with better in-vehicle travel times and worse wait times for passengers compared to the stochastic TFSP model.

math.OC

Robust Path Recommendations During Public Transit Disruptions Under Demand Uncertainty

When there are significant service disruptions in public transit systems, passengers usually need guidance to find alternative paths. This paper proposes a path recommendation model to mitigate congestion during public transit disruptions. Passengers with different origins, destinations, and departure times are recommended with different paths such that the system travel time is minimized. We model the path recommendation problem as an optimal flow problem with uncertain demand information. To tackle the lack of analytical formulation of travel times due to capacity constraints, we propose a simulation-based first-order approximation to transform the original problem into a linear program. Uncertainties in demand are modeled using robust optimization to protect the path recommendation strategies against inaccurate estimates. A real-world rail disruption scenario in the Chicago Transit Authority (CTA) system is used as a case study. Results show that even without considering uncertainty, the nominal model can reduce the system travel time by 9.1% (compared to the status quo), and outperforms the benchmark capacity-based path recommendation. The average travel time of passengers in the incident line (i.e., passengers receiving recommendations) is reduced more (-20.6% compared to the status quo). After incorporating the demand uncertainty, the robust model can further reduce system travel times. The best robust model can decrease the average travel time of incident-line passengers by 2.91% compared to the nominal model. The improvement of robust models is more prominent when the actual demand pattern is close to the worst-case demand.

math.OC

Impact of unplanned service disruptions on urban public transit systems

This paper proposes a general unplanned incident analysis framework for public transit systems from the supply and demand sides using automated fare collection (AFC) and automated vehicle location (AVL) data. Specifically, on the supply side, we propose an incident-based network redundancy index to analyze the network's ability to provide alternative services under a specific rail disruption. The impacts on operations are analyzed through the headway changes. On the demand side, the analysis takes place at two levels: aggregate flows and individual response. We calculate the demand changes of different rail lines, rail stations, bus routes, and bus stops to better understand the passenger flow redistribution under incidents. Individual behavior is analyzed using a binary logit model based on inferred passengers' mode choices and socio-demographics using AFC data. The public transit system of the Chicago Transit Authority is used as a case study. Two rail disruption cases are analyzed, one with high network redundancy around the impacted stations and the other with low. Results show that the service frequency of the incident line was largely reduced (by around 30% ~ 70%) during the incident time. Nearby rail lines with substitutional functions were also slightly affected. Passengers showed different behavioral responses in the two incident scenarios. In the low redundancy case, most of the passengers chose to use nearby buses to move, either to their destinations or to the nearby rail lines. In the high redundancy case, most of the passengers transferred directly to nearby lines. Corresponding policy implications and operating suggestions are discussed.

stat.AP