Reconstructed holograms and explanation-aware evaluation for low-cost computational pollen analysis in veterinary cytology
研究使用重建全息图和解释感知评估方法,提高了低成本计算花粉分析的准确性,并通过AHIR协议验证了模型在模态变化下的可靠性。
研究使用重建全息图和解释感知评估方法,提高了低成本计算花粉分析的准确性,并通过AHIR协议验证了模型在模态变化下的可靠性。
研究通过随机优先级边界路由方法解决在信任节点网络中路径多样化问题,以抵御c个节点组成的卡特尔攻击。
本文解决了证书复杂度与近似度之间关系的问题,通过构造特定布尔函数族证明了证书复杂度可以比近似度大四次方,改进了之前的结果。
本文提出了一种超富集俱乐部分析方法,通过超边编码高阶交互作用来检测复杂网络中的结构,适用于广义有向超图。
This work addresses the challenges of high inference cost, deployment difficulty, and opaque decision-making in deep reinforcement learning for power grid topology control. The authors propose a stress-focused data collection strategy to train a Proximal Policy Optimization (PPO) teacher model and, for the first time, distill it into interpretable, lightweight agents—specifically decision trees and random forests—targeting high-load critical states. The distilled models not only surpass the original PPO policy in average reward and survival duration while significantly reducing inference overhead, but also maintain highly consistent action outputs, enabling human auditability. Furthermore, the study reveals fundamental differences in feature dependencies between neural policies and tree-based models, achieving a balanced trade-off among performance, real-time responsiveness, and interpretability.
研究使用重建全息图和解释感知评估方法,提高了低成本计算花粉分析的准确性,并通过AHIR协议验证了模型在模态变化下的可靠性。
研究通过随机优先级边界路由方法解决在信任节点网络中路径多样化问题,以抵御c个节点组成的卡特尔攻击。
本文解决了证书复杂度与近似度之间关系的问题,通过构造特定布尔函数族证明了证书复杂度可以比近似度大四次方,改进了之前的结果。
本文提出了一种超富集俱乐部分析方法,通过超边编码高阶交互作用来检测复杂网络中的结构,适用于广义有向超图。
This work addresses the challenges of high inference cost, deployment difficulty, and opaque decision-making in deep reinforcement learning for power grid topology control. The authors propose a stress-focused data collection strategy to train a Proximal Policy Optimization (PPO) teacher model and, for the first time, distill it into interpretable, lightweight agents—specifically decision trees and random forests—targeting high-load critical states. The distilled models not only surpass the original PPO policy in average reward and survival duration while significantly reducing inference overhead, but also maintain highly consistent action outputs, enabling human auditability. Furthermore, the study reveals fundamental differences in feature dependencies between neural policies and tree-based models, achieving a balanced trade-off among performance, real-time responsiveness, and interpretability.