Search for: All records

Many real-world situations allow for the acquisition of additional relevant information when making decisions with limited or uncertain data. However, traditional RL approaches either require all features to be acquired beforehand (e.g. in a MDP) or regard part of them as missing data that cannot be acquired (e.g. in a POMDP). In this work, we consider RL models that may actively acquire features from the environment to improve the decision quality and certainty, while automatically balancing the cost of feature acquisition process and the reward of task decision process. We propose the Active-Acquisition POMDP and identify two types of the acquisition process for different application domains. In order to assist the agent in the actively-acquired partially-observed environment and alleviate the exploration-exploitation dilemma, we develop a model-based approach, where a deep generative model is utilized to capture the dependencies of the features and impute the unobserved features. The imputations essentially represent the beliefs of the agent. Equipped with the dynamics model, we develop hierarchical RL algorithms to resolve both types of the AA-POMDPs. Empirical results demonstrate that our approach achieves considerably better performance than existing POMDP-RL solutions 

Recent studies and industry advancements indicate that modular vehicles (MVs) have the potential to enhance transportation systems through their ability to dock and split during a trip. Although various applications of MVs have been explored across different domains, their application in logistics remains underexplored. This study examines the use of MVs in cargo delivery to reduce total delivery costs. We model the delivery problem for MVs as a variant of the Vehicle Routing Problem, referred to as the Modular Vehicle Routing Problem (MVRP). In the MVRP, MVs can either serve customers independently or dock with other MVs to form a platoon, thereby reducing the average cost per unit. In this study, we mainly focus on two fundamental types of MVRPs, namely the capacitated MVRP (CMVRP) and the MVRP with time windows (MVRPTW). To address these problems, we first developed mixed-integer linear programming (MILP) models, which can be solved using commercial optimization solvers. Given the NP-hardness of this problem, we also designed a Tabu Search (TS) algorithm with a solution representation based on Gantt charts and a neighborhood structure tailored for the MVRP. Multi-start and shaking strategies were incorporated into the TS algorithm to escape local optima. Additionally, we explored other potential applications in logistics and discussed problem settings for three MVRP variants. Results from numerical experiments indicate that the proposed algorithm successfully identifies nearly all optimal solutions found by the MILP model in small-size benchmark instances, while also demonstrating good convergence speed in large-size benchmark instances. Comparative experiments show that the MVRP approach can reduce costs by approximately 5.6% compared to traditional delivery methods. Sensitivity analyses reveal that improving the cost-saving capability of MV platooning can enhance overall benefits. 

Abstract To ensure privacy protection and alleviate computational burden, we propose a fast subsmaling procedure for the Cox model with massive survival datasets from multi-centered, decentralized sources. The proposed estimator is computed based on optimal subsampling probabilities that we derived and enables transmission of subsample-based summary level statistics between different storage sites with only one round of communication. For inference, the asymptotic properties of the proposed estimator were rigorously established. An extensive simulation study demonstrated that the proposed approach is effective. The methodology was applied to analyze a large dataset from the U.S. airlines. 

Summary Cancer is molecularly heterogeneous, with seemingly similar patients having different molecular landscapes and accordingly different clinical behaviors. In recent studies, gene expression networks have been shown as more effective/informative for cancer heterogeneity analysis than some simpler measures. Gene interconnections can be classified as “direct” and “indirect,” where the latter can be caused by shared genomic regulators (such as transcription factors, microRNAs, and other regulatory molecules) and other mechanisms. It has been suggested that incorporating the regulators of gene expressions in network analysis and focusing on the direct interconnections can lead to a deeper understanding of the more essential gene interconnections. Such analysis can be seriously challenged by the large number of parameters (jointly caused by network analysis, incorporation of regulators, and heterogeneity) and often weak signals. To effectively tackle this problem, we propose incorporating prior information contained in the published literature. A key challenge is that such prior information can be partial or even wrong. We develop a two-step procedure that can flexibly accommodate different levels of prior information quality. Simulation demonstrates the effectiveness of the proposed approach and its superiority over relevant competitors. In the analysis of a breast cancer dataset, findings different from the alternatives are made, and the identified sample subgroups have important clinical differences. 

Abstract This work introduces a theoretical formulation and develops numerical methods for finite element implementation of the formulation so as to extend the concurrent atomistic-continuum (CAC) method for modeling and simulation of finite-temperature materials processes. With significantly reduced degrees of freedom, the CAC simulations are shown to reproduce the results of atomically resolved molecular dynamics simulations for phonon density of states, velocity distributions, equilibrium temperature field of the underlying atomistic model, and also the density, type, and structure of dislocations formed during the kinetic processes of heteroepitaxy. This work also demonstrates the need of a mesoscale tool for simulations of heteroepitaxy, as well as the unique advantage of the CAC method in simulation of the defect formation processes during heteroepitaxy.