We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1608.03100")
get_code_for_paper("1608.03100")
have("1608.03100")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1608.03100.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1608.03100)
Connect an agent — have() is free.