A Geometric Theory of Decision Boundaries in Structured Markov Decision Processes
本文通过开发结构化最优策略的几何理论,研究了马尔可夫决策过程中决策边界的几何形状对策略重建复杂性的影响。
本文通过开发结构化最优策略的几何理论,研究了马尔可夫决策过程中决策边界的几何形状对策略重建复杂性的影响。
研究通过分析265,363个Kaggle竞赛的Python笔记本,探讨了代码质量和机器学习性能之间的关系,使用Pylint和SonarQube评估代码质量。
研究通过构建CordisBench基准,评估语言模型在动态代理环境中处理组件生命周期的能力,采用控制性正式设定与程序执行相结合的方法。
本文针对反应网络在定量信息部分或完全未知时的模拟问题,提出了一种新的因果连续语义及微分符号语义方法。
Current image splicing detection models exhibit poor generalization against post-processing operations (e.g., JPEG compression, Gaussian filtering), severely undermining their reliability in real-world deployment. To address this, we propose a robust training paradigm grounded in latent-space decision boundary analysis: model robustness is quantified via boundary width, and models are jointly trained under multiple post-processing perturbations; the optimal checkpoint is selected on the validation set based on maximal boundary width. Crucially, this approach requires no architectural modifications or loss-function redesign—robustness is enhanced solely through refined training strategies and boundary-aware model selection, thereby improving discriminability in the feature space. Extensive experiments across multiple benchmark datasets demonstrate that our method significantly enhances resilience to common post-processing artifacts. Specifically, it yields average AUC improvements of 3.2–5.8 percentage points over state-of-the-art training strategies under JPEG compression and Gaussian blur.
本文通过开发结构化最优策略的几何理论,研究了马尔可夫决策过程中决策边界的几何形状对策略重建复杂性的影响。
研究通过分析265,363个Kaggle竞赛的Python笔记本,探讨了代码质量和机器学习性能之间的关系,使用Pylint和SonarQube评估代码质量。
研究通过构建CordisBench基准,评估语言模型在动态代理环境中处理组件生命周期的能力,采用控制性正式设定与程序执行相结合的方法。
本文针对反应网络在定量信息部分或完全未知时的模拟问题,提出了一种新的因果连续语义及微分符号语义方法。
Current image splicing detection models exhibit poor generalization against post-processing operations (e.g., JPEG compression, Gaussian filtering), severely undermining their reliability in real-world deployment. To address this, we propose a robust training paradigm grounded in latent-space decision boundary analysis: model robustness is quantified via boundary width, and models are jointly trained under multiple post-processing perturbations; the optimal checkpoint is selected on the validation set based on maximal boundary width. Crucially, this approach requires no architectural modifications or loss-function redesign—robustness is enhanced solely through refined training strategies and boundary-aware model selection, thereby improving discriminability in the feature space. Extensive experiments across multiple benchmark datasets demonstrate that our method significantly enhances resilience to common post-processing artifacts. Specifically, it yields average AUC improvements of 3.2–5.8 percentage points over state-of-the-art training strategies under JPEG compression and Gaussian blur.