The paper introduces a production‑grade large language model (LLM) pricing system for the tourism industry that separates structured extraction and policy selection from deterministic numeric pricing. Policies are compiled into interpretable condition trees, allowing new clauses and evolving rules to be added without code changes while maintaining auditability. Deployed across 12 business categories and 1,500 operators, the system handled 3,960 orders in six months, cutting the order‑management team from 15‑20 to 3 and reducing per‑order handling time from 10 minutes to under 2 minutes.
By Ziqiang Zhang, Jing Ma, Zilong Wang, Jiayuan Chen, Yi Qiao, Yu He, Wei Zhang, Dai Cheng, Xiaoyu Shen
arXiv:2607. 01610v1 Announce Type: new Abstract: Counterfactual explanation (CE) is widely used to enhance the interpretability of machine learning models and support data-driven decision-making based on model predictions.
By Keita Kinjo, Takeshi Ebina
arXiv:2608. 09335v1 Announce Type: new Abstract: Multistage stochastic model predictive control (MPC) handles uncertainty by optimizing over a scenario tree, a finite branching approximation of future outcomes constructed from sampled forecasts.
By Fabio Pavirani, Bert Claessens, Pierre Pinson, Chris Develder
arXiv:2608. 08743v1 Announce Type: cross Abstract: Reinforcement learning (RL) seeks to optimize sequential decisions to maximize population-level benefits over time.
By Jianhan Zhang, Jitao Wang, John D. Piette, Donglin Zeng, Chengchun Shi, Zhenke Wu
Counterfactual explanation (CE) is widely used to enhance the interpretability of machine learning models and support data-driven decision-making based on model predictions. However, existing CE methods typically require two exogenously specified inputs: a desired output value (target) and a distance function that quantifies changes in explanatory variables.
The paper addresses the failure of online conformal prediction when predictions influence actions that determine which outcomes are used for calibration. It introduces Propensity-Weighted Online Conformal Prediction (PW‑OCP), an inverse‑propensity‑weighted recursion that debiases calibration, and a doubly robust variant (DR‑OCP) that further reduces bias. Experiments on synthetic decision tasks, open bandit data, and financial rebalancing demonstrate that PW‑OCP and DR‑OCP improve counterfactual coverage and downstream regret while preserving prediction‑set sharpness.
By Xinyu Qiao, Yichen Lin, Kaihong Ji, Xue Wang, Tao Yao