Asymptotic Behavior of Adversarial Training Estimator under ℓ ∞ -Perturbation
ℓ∞ 扰动下对抗训练估计量的渐近行为AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论一般广义线性模型的对抗训练与稀疏恢复,未指定因果、面板、宏观或金融等给定细分方向。
ℓ∞ 扰动下对抗训练估计量的渐近行为AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Adversarial training has been proposed to protect machine learning models against adversarial attacks. This paper focuses on adversarial training under 𝓁∞-perturbation, which has recently attracted much research attention. The asymptotic behavior of the adversarial training estimator is investigated in the generalized linear model. The results imply that the asymptotic distribution of the adversarial training estimator under 𝓁∞-perturbation could put a positive probability mass at 0 when the true parameter is 0, providing a theoretical guarantee of the associated sparsity-recovery ability. Alternatively, a two-step procedure is proposed—adaptive adversarial training, which could further improve the performance of adversarial training under 𝓁∞-perturbation. Specifically, the proposed procedure could achieve asymptotic variable-selection consistency and unbiasedness. Numerical experiments are conducted to show the sparsity-recovery ability of adversarial training under 𝓁∞-perturbation and to compare the empirical performance between classic adversarial training and adaptive adversarial training.