Name
Abstract | ||
|---|---|---|
This paper introduces a special setting of weakly supervised structured output learning, where the training data is a set of structured instances and supervision involves candidate labels for some local parts of the structure. We show that the learning problem with this weak supervision setting can be efficiently handled and then propose a large margin formulation. To solve the non-convex optimization problem, we propose a proper approximation of the objective to utilize the Constraint Concave Convex Procedure (CCCP). To accelerate each iteration of CCCP, a 2-slack cutting plane algorithm is proposed. Experiments on some sequence labeling tasks show the effectiveness of the proposed method. © 2013 Springer-Verlag. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-40991-2_22 | ECML/PKDD |
Keywords | Field | DocType |
candidate labels,local parts,structured output learning,weak supervision | Training set,Mathematical optimization,Sequence labeling,Cutting plane algorithm,Regular polygon,Optimization problem,Mathematics | Conference |
Volume | Issue | ISSN |
8189 LNAI | PART 2 | 16113349 |
Citations | PageRank | References |
1 | 0.37 | 38 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengtao Li | 1 | 75 | 7.85 |
| Jianwen Zhang | 2 | 319 | 14.74 |
| Zheng Chen | 3 | 5019 | 256.89 |