每日简报

双侧最近邻：自适应且极小极大最优的矩阵补全方法AI 解读

Nearest neighbor (NN) algorithms have been extensively used for missing data problems in recommender systems and sequential decision-making systems. Prior theoretical analysis has established favorable guarantees for NN when the underlying data is sufficiently smooth and the missingness probabilities are lower bounded. Here we analyze NN with non-smooth non-linear functions with vast amounts of missingness. In particular, we consider matrix completion settings where the…

基于最大均值差异的时间序列估计AI 解读

We define two minimum distance estimators for dependent data by minimizing some approximated Maximum Mean Discrepancy distances between the true empirical distribution of observations and their assumed (parametric) model distribution. When the latter one is intractable, it is approximated by simulation, allowing to accommodate most dynamic processes with latent variables. We derive the non-asymptotic and the large sample properties of our estimators in the context of…

利用非二元工具变量估计平均处理效应AI 解读

Non-binary instrumental variables, especially continuous ones, are common in practice. A binary recoding induces a Wald ratio but may discard useful variation and reduce efficiency. Although fully nonparametric approaches can in principle use the entire instrument, they often require high-dimensional nuisance estimation which can be unstable with rich covariates. We address this problem by developing a generalized Wald estimand for binary treatments that uses the full…