Timezone: »

Tighter Bounds for Structured Estimation
Olivier Chapelle · Chuong B Do · Quoc V Le · Alexander Smola · Choon Hui Teo

Tue Dec 09 07:30 PM -- 12:00 AM (PST) @ None #None

Large-margin structured estimation methods work by minimizing a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are not tight and sacrifice the ability to accurately model the true loss. We present tighter non-convex bounds based on generalizing the notion of a ramp loss from binary classification to structured estimation. We show that a small modification of existing optimization algorithms suffices to solve this modified problem. On structured prediction tasks such as protein sequence alignment and web page ranking, our algorithm leads to improved accuracy.

Author Information

Olivier Chapelle (Google)
Chuong B Do (Stanford University)
Quoc V Le (Stanford)
Alex Smola (Amazon - We are hiring!)

**Amazon AWS Machine Learning** We are hiring!

Choon Hui Teo (Amazon)

More from the Same Authors