基于线性矩的间接监督估计
Estimation from Indirect Supervision with Linear Moments
摘要:
在结构化预测问题中,我们有间接监督的输出,最大边际似然面临两个计算障碍:非凸性的目标和棘手的,即使是一个单一的梯度计算。在本文中,我们绕过这两个障碍,我们称之为线性间接监督的问题。我们的方法很简单:我们求解一个线性系统来估计模型的充分统计量,然后通过凸优化来估计参数。我们分析了我们的方法的统计特性,并实证表明,它是有效的,在两种设置:学习与本地隐私的限制和学习低成本的计数为基础的注释。
英文摘要:
In structured prediction problems where we have indirect supervision of the output, maximum marginal likelihood faces two computational obstacles: non-convexity of the objective and intractability of even a single gradient computation. In this paper, we bypass both obstacles for a class of what we call linear indirectly-supervised problems. Our approach is simple: we solve a linear system to estimate sufficient statistics of the model, which we then use to estimate parameters via convex optimization. We analyze the statistical properties of our approach and show empirically that it is effective in two settings: learning with local privacy constraints and learning from low-cost count-based annotations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。