Convolution without independence
无需独立性的卷积AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用卷积理论与测量误差,未明确给定列表中的具体应用方向,因此保留空分类。
无需独立性的卷积AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Widely used convolution and deconvolution techniques traditionally rely on independence assumptions, often criticized as being strong. We observe that the convolution theorem actually holds under a weaker assumption, known as subindependence. We show that this notion is arguably as weak as a conditional mean assumption. We report various simple characterizations of subindependence and devise constructive methods to generate subindependent random variables. We extend subindependence to multivariate settings and propose the new concepts of conditional and mean subindependence, relevant to measurement error problems. We finally introduce three tests of subindependence based on characteristic functions, generalized method of moments and randomization, respectively.