This action might not be possible to undo. Are you sure you want to continue?
:
A LARGE MARGIN APPROACH
A DISSERTATION
SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE
AND THE COMMITTEE ON GRADUATE STUDIES
OF STANFORD UNIVERSITY
IN PARTIAL FULFILLMENT OF THE REQUIREMENTS
FOR THE DEGREE OF
DOCTOR OF PHILOSOPHY
Ben Taskar
December 2004
c _Copyright by Ben Taskar 2005
All Rights Reserved
ii
I certify that I have read this dissertation and that, in my opin
ion, it is fully adequate in scope and quality as a dissertation
for the degree of Doctor of Philosophy.
Daphne Koller
Computer Science Department
Stanford University
(Principal Advisor)
I certify that I have read this dissertation and that, in my opin
ion, it is fully adequate in scope and quality as a dissertation
for the degree of Doctor of Philosophy.
Andrew Y. Ng
Computer Science Department
Stanford University
I certify that I have read this dissertation and that, in my opin
ion, it is fully adequate in scope and quality as a dissertation
for the degree of Doctor of Philosophy.
Fernando Pereira
Computer Science Department
University of Pennsylvania
Approved for the University Committee on Graduate Stud
ies:
iii
iv
To my parents, Mark and Tsilya, and my love, Anat.
Abstract
Most questions require more than just truefalse or multiplechoice answers. Yet super
vised learning, like standardized testing, has placed the heaviest emphasis on complex
questions with simple answers. The acquired expertise must now be used to address tasks
that demand answers as complex as the questions. Such complex answers may consist of
multiple interrelated decisions that must be weighed against each other to arrive at a glob
ally satisfactory and consistent solution to the question. In natural language processing, we
often need to construct a global, coherent analysis of a sentence, such as its corresponding
partofspeech sequence, parse tree, or translation into another language. In computational
biology, we analyze genetic sequences to predict 3D structure of proteins, ﬁnd global align
ment of related DNA strings, and recognize functional portions of a genome. In computer
vision, we segment complex objects in cluttered scenes, reconstruct 3D shapes from stereo
and video, and track motion of articulated bodies.
We typically handle the exponential explosion of possible answers by building mod
els that compactly capture the structural properties of the problem: sequential, grammat
ical, chemical, temporal, spatial constraints and correlations. Such structured models in
clude graphical models such as Markov networks (Markov random ﬁelds), recursive lan
guage models such as context free grammars, combinatorial optimization problems such as
weighted matchings and graphcuts. This thesis presents a discriminative estimation frame
work for structured models based on the large margin principle underlying support vector
machines. Intuitively, the largemargin criterion provides an alternative to probabilistic,
likelihoodbased estimation methods by concentrating directly on the robustness of the de
cision boundary of a model. Our framework deﬁnes a suite of efﬁcient learning algorithms
that rely on the expressive power of convex optimization to compactly capture inference or
vii
solution optimality in structured models. For some of these models, alternative estimation
methods are intractable.
The largest portion of the thesis is devoted to Markov networks, which are undirected
probabilistic graphical models widely used to efﬁciently represent and reason about joint
multivariate distributions. We use graph decomposition to derive an exact, compact, con
vex formulation for largemargin estimation of Markov networks with sequence and other
lowtreewidth structure. Seamless integration of kernels with graphical models allows ef
ﬁcient, accurate prediction in realworld tasks. We analyze the theoretical generalization
properties of maxmargin estimation in Markov networks and derive a novel type of bound
on structured error. Using an efﬁcient onlinestyle algorithm that exploits inference in the
model and analytic updates, we solve very large estimation problems.
We deﬁne an important subclass of Markov networks, associative Markov networks
(AMNs), which captures positive correlations between variables and permits exact infer
ence which scales up to tens of millions of nodes and edges. While likelihoodbased meth
ods are believed to be intractable for AMNs over binary variables, our framework allows
exact estimation of such networks of arbitrary connectivity and topology. We also intro
duce relational Markov networks (RMNs), which compactly deﬁne templates for Markov
networks for domains with relational structure: objects, attributes, relations.
In addition to graphical models, our framework applies to a wide range of other models:
We exploit context free grammar structure to derive a compact maxmargin formulation that
allows highaccuracy parsing in cubic time by using novel kinds of lexical information. We
use combinatorial properties of weighted matchings to develop an exact, efﬁcient formu
lation for learning to match and apply it to prediction of disulﬁde connectivity in proteins.
Finally, we derive a maxmargin formulation for learning the scoring metric for clustering
from clustered training data, which tightly integrates metric learning with the clustering
algorithm, tuning one to the other in a joint optimization.
We describe experimental applications to a diverse range of tasks, including handwrit
ing recognition, 3D terrain classiﬁcation, disulﬁde connectivity prediction in proteins, hy
pertext categorization, natural language parsing, email organization and image segmen
tation. These empirical evaluations show signiﬁcant improvements over stateoftheart
methods and promise wide practical use for our framework.
viii
Acknowledgements
I am profoundly grateful to my advisor, Daphne Koller. Her tireless pursuit of excellence in
research, teaching, advising, and every other aspect of her academic work is truly inspira
tional. I am indebted to Daphne for priceless and copious advice about selecting interesting
problems, making progress on difﬁcult ones, pushing ideas to their full development, writ
ing and presenting results in an engaging manner.
I would like to thank my thesis committee, Andrew Ng and Fernando Pereira, as well
as my defense committee members, Stephen Boyd and Sebastian Thrun, for their excellent
suggestions and thoughtprovoking questions. I have learned a great deal from their work
and their inﬂuence on this thesis is immense. In particular, Fernando’s work on Markov
networks has inspired my focus on this subject. Andrew’s research on clustering and clas
siﬁcation has informed many of the practical problems addressed in the thesis. Sebastian
introduced me to the fascinating problems in 3D vision and robotics. Finally, Stephen’s
book on convex optimization is the primary source of many of the insights and derivations
in this thesis.
Daphne’s research group is an institution in itself. I am very lucky to have been a part
of it and shared the company, the ideas, the questions and the expertise of Pieter Abbeel,
Drago Anguelov, Alexis Battle, Luke Biewald, Xavier Boyen, Vassil Chatalbashev, Gal
Chechik, Lise Getoor, Carlos Guestrin, Uri Lerner, Uri Nodelman, Dirk Ormoneit, Ron
Parr, Eran Segal, Christian Shelton, Simon Tong, David Vickrey, Haidong Wang and Ming
Fai Wong.
JeanClaude Latombe was my ﬁrst research advisor when I was still an undergraduate
at Stanford. His thoughtful guidance and quick wit were a great welcome and inspiration
to continue my studies. When I started my research in machine learning with Daphne, I
ix
had the privilege and pleasure to work with Nir Friedman, Lise Getoor and Eran Segal.
They have taught me to remain steadfast when elegant theories meet the ragged edge of
real problems. Lise has been a great friend and my other big sister throughout my graduate
life. I could not wish for more caring advice and encouragement than she has given me all
these years.
I was lucky to meet Michael Collins, Michael Littman and David McAllester all in
one place, while I was a summer intern at AT&T. Collins’ work on learning largemargin
tagging and parsing models motivated me to look at such methods for other structured
models. I am very glad I had the chance to work with him on the maxmargin parsing
project. Michael Littman, with his endearing combination of humor and warmth, lightness
and depth, has been a constant source of encouragement and inspiration. David’s wide
ranging research on probability and logic, languages and generalization bounds, to mention
a few, enlightened much of my work.
(Almost) everything I know about natural language processing I learned from Chris
Manning and Dan Klein. Chris’ healthy scepticism and emphasis on the practical has kept
me from going down many deadend paths. Dan has an incredible gift of making ideas
work, and better yet, explaining why other ideas do not work.
I would like to express my appreciation and gratitude to all my collaborators for their
excellent ideas, hard work and dedication: Pieter Abbeel, Drago Anguelov, Peter Bartlett,
Luke Biewald, Vassil Chatalbashev, Michael Collins, Nir Friedman, Audrey Gasch, Lise
Getoor, Carlos Guestrin, Geremy Heitz, Dan Klein, Daphne Koller, Chris Manning, David
McAllester, Eran Segal, David Vickrey and Ming Fai Wong.
Merci beaucoup to Pieter Abbeel, my sounding board for many ideas in convex opti
mization and learning, for numerous enlightening discussions that we have had anytime,
anywhere: gym, tennis court, biking to EV, over cheap Thai food. Ogromnoye spasibo to
my ofﬁcemate, sportsmate, always late, everready to checkmate, Drago Anguelov, who
is always willing to share with me everything from research problems to music and back
packing treks to Russian books and Belgian beer. Blagodarya vi mnogo for another great
Bulgarian I have the good luck to know, Vasco Chatalbashev, for his company and ideas,
good cheer and the great knack for always coming through. Muchas gracias to Carlos
Guestrin, my personal climbing instructor, fellow photography fanatic, avid grillmaster
x
and exploiterofstructure extraordinaire, for opening his ear and heart to me when it mat
ters most. Mhgoisaai to Ming Fai Wong, for his sense of humor, kind heart and excellent
work.
Many thanks to my friends who have had nothing to do with work in this thesis, but
worked hard to keep my relative sanity throughout. I will not list all of you here, but my
gratitude to you is immense.
My parents, Mark and Tsilya, have given me unbending support and constant encour
agement. I thank them for all the sacriﬁces they have made to ensure that their children
would have freedom and opportunities they never had in Soviet Union. To my sister, Anna,
my brotherinlaw, Ilya, and my sweet niece, Talia, I am grateful for bringing me so much
joy and love. To my tireless partner in work and play, tears and laughter, hardship and love,
Anat Caspi, thank you for making me happy next to you.
xi
xii
Contents
Abstract vii
Acknowledgements ix
1 Introduction 1
1.1 Supervised learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Complex prediction problems . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3 Structured models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.4 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
1.5 Thesis outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
1.6 Previously published work . . . . . . . . . . . . . . . . . . . . . . . . . . 13
I Models and methods 15
2 Supervised learning 16
2.1 Classiﬁcation with generalized linear models . . . . . . . . . . . . . . . . 19
2.2 Logistic regression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
2.3 Logistic dual and maximum entropy . . . . . . . . . . . . . . . . . . . . . 21
2.4 Support vector machines . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
2.5 SVM dual and kernels . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
3 Structured models 24
3.1 Probabilistic models: generative and conditional . . . . . . . . . . . . . . . 25
xiii
3.2 Prediction models: normalized and unnormalized . . . . . . . . . . . . . . 27
3.3 Markov networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
3.3.1 Representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.3.2 Inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
3.3.3 Linear programming MAP inference . . . . . . . . . . . . . . . . . 34
3.4 Context free grammars . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
3.5 Combinatorial problems . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
4 Structured maximum margin estimation 42
4.1 Maxmargin estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
4.1.1 Minmax formulation . . . . . . . . . . . . . . . . . . . . . . . . . 43
4.1.2 Certiﬁcate formulation . . . . . . . . . . . . . . . . . . . . . . . . 48
4.2 Approximations: upper and lower bounds . . . . . . . . . . . . . . . . . . 50
4.2.1 Constraint generation . . . . . . . . . . . . . . . . . . . . . . . . . 50
4.2.2 Constraint strengthening . . . . . . . . . . . . . . . . . . . . . . . 52
4.3 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
4.4 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
II Markov networks 57
5 Markov networks 58
5.1 Maximum likelihood estimation . . . . . . . . . . . . . . . . . . . . . . . 59
5.2 Maximum margin estimation . . . . . . . . . . . . . . . . . . . . . . . . . 61
5.3 M
3
N dual and kernels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
5.4 Untriangulated models . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
5.5 Generalization bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
5.6 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
5.7 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
6 M
3
N algorithms and experiments 75
6.1 Solving the M
3
N QP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
6.1.1 SMO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
xiv
6.1.2 Selecting SMO pairs . . . . . . . . . . . . . . . . . . . . . . . . . 79
6.1.3 Structured SMO . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
6.2 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
6.3 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
6.4 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
7 Associative Markov networks 89
7.1 Associative networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
7.2 LP Inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
7.3 Mincut inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
7.3.1 Graph construction . . . . . . . . . . . . . . . . . . . . . . . . . . 93
7.3.2 Multiclass case . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
7.4 Maxmargin estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
7.5 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
7.6 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
7.7 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
8 Relational Markov networks 109
8.1 Relational classiﬁcation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
8.2 Relational Markov networks . . . . . . . . . . . . . . . . . . . . . . . . . 113
8.3 Approximate inference and learning . . . . . . . . . . . . . . . . . . . . . 116
8.4 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
8.4.1 Flat models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
8.4.2 Link model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
8.4.3 Cocite model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
8.5 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
8.6 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124
III Broader applications: parsing, matching, clustering 127
9 Context free grammars 128
9.1 Context free grammar model . . . . . . . . . . . . . . . . . . . . . . . . . 128
xv
9.2 Context free parsing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132
9.3 Discriminative parsing models . . . . . . . . . . . . . . . . . . . . . . . . 133
9.3.1 Maximum likelihood estimation . . . . . . . . . . . . . . . . . . . 134
9.3.2 Maximum margin estimation . . . . . . . . . . . . . . . . . . . . . 135
9.4 Structured SMO for CFGs . . . . . . . . . . . . . . . . . . . . . . . . . . 138
9.5 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
9.6 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142
9.7 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
10 Matchings 144
10.1 Disulﬁde connectivity prediction . . . . . . . . . . . . . . . . . . . . . . . 145
10.2 Learning to match . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
10.3 Minmax formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148
10.4 Certiﬁcate formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 150
10.5 Kernels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
10.6 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
10.7 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157
10.8 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159
11 Correlation clustering 160
11.1 Clustering formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
11.1.1 Linear programming relaxation . . . . . . . . . . . . . . . . . . . 162
11.1.2 Semideﬁnite programming relaxation . . . . . . . . . . . . . . . . 163
11.2 Learning formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164
11.3 Dual formulation and kernels . . . . . . . . . . . . . . . . . . . . . . . . . 167
11.4 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 168
11.4.1 Irrelevant features . . . . . . . . . . . . . . . . . . . . . . . . . . 168
11.4.2 Email clustering . . . . . . . . . . . . . . . . . . . . . . . . . . . 168
11.4.3 Image segmentation . . . . . . . . . . . . . . . . . . . . . . . . . 170
11.5 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172
11.6 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
xvi
IV Conclusions and future directions 175
12 Conclusions and future directions 176
12.1 Summary of contributions . . . . . . . . . . . . . . . . . . . . . . . . . . 176
12.1.1 Structured maximum margin estimation . . . . . . . . . . . . . . . 177
12.1.2 Markov networks: maxmargin, associative, relational . . . . . . . 180
12.1.3 Broader applications: parsing, matching, clustering . . . . . . . . . 182
12.2 Extensions and open problems . . . . . . . . . . . . . . . . . . . . . . . . 183
12.2.1 Theoretical analysis and optimization algorithms . . . . . . . . . . 183
12.2.2 Novel prediction tasks . . . . . . . . . . . . . . . . . . . . . . . . 184
12.2.3 More general learning settings . . . . . . . . . . . . . . . . . . . . 185
12.3 Future . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
A Proofs and derivations 188
A.1 Proof of Theorem 5.5.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188
A.1.1 Binary classiﬁcation . . . . . . . . . . . . . . . . . . . . . . . . . 189
A.1.2 Structured classiﬁcation . . . . . . . . . . . . . . . . . . . . . . . 190
A.2 AMN proofs and derivations . . . . . . . . . . . . . . . . . . . . . . . . . 195
A.2.1 Binary AMNs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195
A.2.2 Multiclass AMNs . . . . . . . . . . . . . . . . . . . . . . . . . . 197
A.2.3 Derivation of the factored primal and dual maxmargin QP . . . . . 199
Bibliography 202
xvii
List of Tables
9.1 Parsing results on development set . . . . . . . . . . . . . . . . . . . . . . 140
9.2 Parsing results on test set . . . . . . . . . . . . . . . . . . . . . . . . . . . 140
10.1 Bond connectivity prediction results . . . . . . . . . . . . . . . . . . . . . 156
xviii
List of Figures
1.1 Supervised learning setting . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2 Examples of complex prediction problems . . . . . . . . . . . . . . . . . . 4
2.1 Handwritten character recognition . . . . . . . . . . . . . . . . . . . . . . 19
2.2 Classiﬁcation loss and upper bounds . . . . . . . . . . . . . . . . . . . . . 20
3.1 Handwritten word recognition . . . . . . . . . . . . . . . . . . . . . . . . 25
3.2 Chain Markov network . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
3.3 Diamond Markov network . . . . . . . . . . . . . . . . . . . . . . . . . . 32
3.4 Diamond network junction tree . . . . . . . . . . . . . . . . . . . . . . . . 34
3.5 Marginal agreement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
3.6 Example parse tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
4.1 Exact and approximate constraints for maxmargin estimation . . . . . . . 51
4.2 A constraint generation algorithm. . . . . . . . . . . . . . . . . . . . . . . 52
5.1 Chain M
3
N example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
5.2 Diamond Markov network . . . . . . . . . . . . . . . . . . . . . . . . . . 69
6.1 Blockcoordinate ascent . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
6.2 SMO subproblem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
6.3 SMO pair selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
6.4 Structured SMO diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
6.5 Structured SMO pair selection . . . . . . . . . . . . . . . . . . . . . . . . 85
6.6 OCR results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
xix
7.1 Mincut graph construction . . . . . . . . . . . . . . . . . . . . . . . . . . 94
7.2 αexpansion algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
7.3 Segbot: roving robot equipped with SICK2 laser sensors. . . . . . . . . . . 100
7.4 3D laser scan range map of the Stanford Quad. . . . . . . . . . . . . . . . 101
7.5 Comparison of terrain classiﬁcation models (detail) . . . . . . . . . . . . . 102
7.6 Mincut inference running times . . . . . . . . . . . . . . . . . . . . . . . 103
7.7 Comparison of terrain classiﬁcation models (zoomedout) . . . . . . . . . . 106
7.8 Labeled portion of the test terrain dataset (Ground truth and SVMpredictions)107
7.9 Labeled portion of the test terrain dataset (VotedSVM and AMN predictions)108
8.1 Link model for document classiﬁcation . . . . . . . . . . . . . . . . . . . 113
8.2 WebKB results: ﬂat models . . . . . . . . . . . . . . . . . . . . . . . . . . 120
8.3 WebKB results: link model . . . . . . . . . . . . . . . . . . . . . . . . . . 121
8.4 WebKB results: cocite model . . . . . . . . . . . . . . . . . . . . . . . . . 122
9.1 Two representations of a binary parse tree . . . . . . . . . . . . . . . . . . 130
10.1 PDB protein 1ANS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147
10.2 Number of constraints vs. number of bonds . . . . . . . . . . . . . . . . . 150
10.3 Learning curve for bond connectivity prediction . . . . . . . . . . . . . . . 157
11.1 Learning to cluster with irrelevant features . . . . . . . . . . . . . . . . . . 169
11.2 Learning to organize email . . . . . . . . . . . . . . . . . . . . . . . . . . 170
11.3 Two segmentations by different users . . . . . . . . . . . . . . . . . . . . . 171
11.4 Two segmentations by different models . . . . . . . . . . . . . . . . . . . 172
xx
Chapter 1
Introduction
The breadth of tasks addressed by machine learning is rapidly expanding. Major appli
cations include medical diagnosis, scientiﬁc discovery, ﬁnancial analysis, fraud detection,
DNA sequence analysis, speech and handwriting recognition, game playing, image analy
sis, robot locomotion and many more. Of course, the list of things we would like a computer
to learn to do is much, much longer. As we work our way down that list, we encounter the
need for very sophisticated decision making from our programs.
Some tasks, for example, handwriting recognition, are performed almost effortlessly
by a person, but remain difﬁcult and errorprone for computers. The complex synthesis
of many levels of signal processing a person executes when confronted by a line of hand
written text is daunting. The reconstruction of an entire sentence from the photons hitting
the retina off of each tiny patch of an image undoubtedly requires an elaborate interplay of
recognition and representation of the penstrokes, the individual letters, whole words and
constituent phrases.
Computer scientists, as opposed to, say, neuroscientists, are primarily concerned with
achieving acceptable speed and accuracy of recognition rather than modeling this compli
cated process with any biological verity. Computational models for handwriting recogni
tion aim to capture the salient properties of the problem: typical shapes of the letters, likely
letter combinations that make up words, common ways to combine words into phrases, fre
quent grammatical constructions of the phrases, etc. Machine learning offers an alternative
to encoding all the intricate details of such a model from scratch. One of its primary goals
1
2 CHAPTER 1. INTRODUCTION
is to devise efﬁcient algorithms for training computers to automatically acquire effective
and accurate models from experience.
In this thesis, we present a discriminative learning framework and a novel family of efﬁ
cient models and algorithms for complex recognition tasks in several disciplines, including
natural language processing, computer vision and computational biology. We develop the
oretical foundations for our approach and show a wide range of experimental applications,
including handwriting recognition, 3dimensional terrain classiﬁcation, disulﬁde connec
tivity in protein structure prediction, hypertext categorization, natural language parsing,
email organization and image segmentation.
1.1 Supervised learning
The most basic supervised learning task is classiﬁcation. Suppose we wish to learn to
recognize a handwritten character from a scanned image. This is a classiﬁcation task,
because we must assigns a class (an English letter from ‘a’ through ‘z’) to an observation of
an object (an image). Essentially, a classiﬁer is a function that maps an input (an image) to
an output (a letter). In the supervised learning setting, we construct a classiﬁer by observing
labeled training examples, in our case, sample images paired with appropriate letters. The
main problem addressed by supervised learning is generalization. The learning program is
allowed to observe only a small sample of labeled images to produce an accurate classiﬁer
on unseen images of letters.
More formally, let x denote an input. For example, a blackandwhite image x can be
represented as a vector of pixel intensities. We use A to denote the space of all possible
inputs. Let y denote the output, and ¸ be the discrete space of possible outcomes (e.g.,
26 letters ‘a’‘z’). A classiﬁer (or hypothesis) h is a function from A to ¸, h : A → ¸.
We denote the set of all classiﬁers that our learning program can produce as H (hypothesis
class). Then given a set of labeled examples ¦x
(i)
, y
(i)
¦, i = 1, . . . , m, a learning program
seeks to produce a classiﬁer h ∈ H that will work well on unseen examples x, usually by
ﬁnding h that accurately classiﬁes training data. The diagram in Fig. 1.1 summarizes the
supervised learning setting.
1.1. SUPERVISED LEARNING 3
Labeled data
Learning
Prediction
Hypotheses
New data
Figure 1.1: Supervised learning setting
The problem of classiﬁcation has a long history and highly developed theory and prac
tice (see for example, Mitchell [1997]; Vapnik [1995]; Duda et al. [2000]; Hastie et al.
[2001]). The two most important dimensions of variation of classiﬁcation algorithms is the
hypothesis class Hand the criterion for selection of a hypothesis h from Hgiven the train
ing data. In this thesis, we build upon the generalized linear model family, which underlies
standard classiﬁers such as logistic regression and support vector machines. Through the
use of kernels to implicitly deﬁne highdimensional and even inﬁnitedimensional input
representations, generalized linear models can approximate arbitrarily complex decision
boundaries.
The task of selecting a hypothesis h reduces to estimating model parameters. Broadly
speaking, probabilistic estimation methods associate a joint distribution p(x, y) or condi
tional distribution p(y [ x) with h and select a model based on the likelihood of the data
[Hastie et al., 2001]. Joint distribution models are often called generative, while condi
tional models are called discriminative. Large margin methods, by contrast, select a model
based on a more direct measure of conﬁdence of its predictions on the training data called
the margin [Vapnik, 1995]. The difference between these two methods is one of the key
4 CHAPTER 1. INTRODUCTION
Thescreenwas
aseaofred
RSCCPCYWGGCPW
GQNCYPEGCSGPKV
brace
(a) (b) (c) (d)
Figure 1.2: Examples of complex prediction problems (inputstop, outputsbottom):
(a) handwriting recognition [image →word];
(b) natural language parsing [sentence →parse tree];
(c) disulﬁde bond prediction in proteins [aminoacid sequence →bond structure (shown in yellow)];
(d) terrain segmentation [3D image →segmented objects (trees, bushes, buildings, ground)]
themes in this thesis.
Most of the research has focused on the analysis and classiﬁcation algorithms for the
case of binary outcomes [¸[ = 2, or a small number of classes. In this work, we focus
on prediction tasks that involve not a single decision with a small set of outcomes, but a
complex, interrelated collection of decisions.
1.2 Complex prediction problems
Consider once more the problem of character recognition. In fact, a more natural and useful
task is recognizing words and entire sentences. Fig. 1.2(a) shows an example handwritten
word “brace.” Distinguishing between the second letter and fourth letter (‘r’ and ‘c’) in iso
lation is actually far from trivial, but in the context of the surrounding letters that together
form a word, this task is much less errorprone for humans and should be for computers
as well. It is also more complicated, as different decisions must be weighed against each
other to arrive at the globally satisfactory prediction. The space of all possible outcomes
1.2. COMPLEX PREDICTION PROBLEMS 5
¸ is immense, usually exponential in the number of individual decisions, for example, the
number of 5 letter sequences (26
5
). However, most of these outcomes are unlikely given
the observed input. By capturing the most salient structure of the problem, for example the
strong local correlations between consecutive letters, we will construct compact models
that efﬁciently deal with this complexity. Below we list several examples from different
ﬁelds.
• Natural language processing
Vast amounts of electronically available text have spurred a tremendous amount of
research into automatic analysis and processing of natural language. We mention
some of the lowerlevel tasks that have received a lot of recent attention [Charniak,
1993; Manning & Sch¨ utze, 1999]. Partofspeech tagging involves assigning each
word in a sentence a partofspeech tag, such as noun, verb, pronoun, etc. As with
handwriting recognition, capturing sequential structure of correlations between con
secutive tags is key. In parsing, the goal is to recognize the recursive phrase structure
of a sentence, such as verbal, noun and prepositional phrases and their nesting in
relation to each other. Fig. 1.2(b) shows a parse tree corresponding to the sentence:
“The screen was a sea of red” (more on this in Ch. 9). Many other problems, such as
namedentity and relation extraction, text summarization, translation, involve com
plex global decision making.
• Computational biology
The last two decades have yielded a wealth of highthroughput experimental data,
including complete sequencing of many genomes, precise measurements of protein
3D structure, genomewide assays of mRNA levels and proteinprotein interactions.
Major research has been devoted to geneﬁnding, alignment of sequences, protein
structure prediction, molecular pathway discovery [Gusﬁeld, 1997; Durbin et al.,
1998]. Fig. 1.2(c) shows disulﬁde bond structure (shown in yellow) we would like to
predict from the aminoacid sequence of the protein (more on this in Ch. 10).
• Computer vision
As digital cameras and optical scanners become commonplace accessories, medical
imaging technology produces detailed physiological measurements, laser scanners
6 CHAPTER 1. INTRODUCTION
capture 3D environments, satellites and telescopes bring pictures of Earth and distant
stars, we are ﬂooded with images we would like our computer to analyze. Example
tasks include object detection and segmentation, motion tracking, 3D reconstruction
from stereo and video, and much more [Forsyth & Ponce, 2002]. Fig. 1.2(d) shows a
3D laser range data image of the Stanford campus collected by a roving robot which
we would like to segment into objects such as trees, bushes, buildings, ground, etc.
(more on this in Ch. 7).
1.3 Structured models
This wide range of problems have been tackled using various models and methods. We
focus on the models that compactly capture correlation and constraint structure inherent to
many tasks. Abstractly, a model assigns a score (or likelihood in probabilistic models) to
each possible input/output pair (x, y), typically through a compact, parameterized scoring
function. Inference in these models refers to computing the highest scoring output given
the input and usually involves dynamic programming or combinatorial optimization.
• Markov networks
Markov networks (a.k.a. Markov random ﬁelds) are extensively used to model com
plex sequential, spatial, and relational interactions in prediction problems arising in
many ﬁelds. These problems involve labeling a set of related objects that exhibit
local consistency. Markov networks compactly represent complex joint distributions
of the label variables by modeling their local interactions. Such models are encoded
by a graph, whose nodes represent the different object labels, and whose edges rep
resent and quantify direct dependencies between them. The graphical structure of
the models encodes the qualitative aspects of the distribution: direct dependencies as
well as conditional independencies. The quantitative aspect of the model is deﬁned
by the potentials that are associated with nodes and cliques of the graph. The graph
ical structure of the network (more precisely, the treewidth of the graph, which we
formally deﬁne in Ch. 3) is critical to efﬁcient inference and learning in the model.
• Context free grammars
1.3. STRUCTURED MODELS 7
Contextfree grammars are one of the primary formalisms for capturing the recur
sive structure of syntactic constructions [Manning & Sch¨ utze, 1999]. For example,
in Fig. 1.2, the nonterminal symbols (labels of internal nodes) correspond to syntac
tic categories such as noun phrase (NP), verbal phrase (VP) or prepositional phrase
(PP) and partofspeech tags like nouns (NN), verbs (VBD), determiners (DT) and
prepositions (IN). The terminal symbols (leaves) are the words of the sentence. A
CFG consists of recursive productions (e.g. V P → V P PP, DT → The) that
can be applied to derive a sentence of the language. The productions deﬁne the set
of syntactically allowed phrase structures (derivations). By compactly deﬁning a
probability distribution over individual productions, probabilistic CFGs construct a
distribution over parse trees and sentences, and the prediction task reduces to ﬁnding
the most likely tree given the sentence. The context free restriction allows efﬁcient
inference and learning in such models.
• Combinatorial structures
Many important computational tasks are formulated as combinatorial optimization
problems such as the maximum weight bipartite and perfect matching, spanning
tree, graphcut, edgecover, and many others [Lawler, 1976; Papadimitriou & Stei
glitz, 1982; Cormen et al., 2001]. Although the term ‘model’ is often reserved for
probabilistic models, we use the term model very broadly, to include any scheme
that assigns scores to the output space ¸ and has a procedure for ﬁnding the opti
mal scoring y. For example, the disulﬁde connectivity prediction in Fig. 1.2(c) can
be modeled by maximum weight perfect matchings, where the weights deﬁne po
tential bond strength based on the local aminoacid sequence properties. The other
combinatorial structures we consider and apply in this thesis include graph cuts and
partitions, bipartite matchings, and spanning trees.
The standard methods of estimation for Markov networks and context free grammars
are based on maximum likelihood, both joint and conditional. However, maximum like
lihood estimation of scoring function parameters for combinatorial structures is often in
tractable because of the problem of deﬁning a normalized distribution over an exponential
set of combinatorial structures.
8 CHAPTER 1. INTRODUCTION
1.4 Contributions
This thesis addresses the problemof efﬁcient learning of highaccuracy models for complex
prediction problems. We consider a very large class of structured models, from Markov
networks to context free grammars to combinatorial graph structures such as matchings
and cuts. We focus on those models where exact inference is tractable, or can be efﬁciently
approximated.
◦ Learning framework for structured models
We propose a general framework for efﬁcient estimation of models for structured
prediction. An alternative to likelihoodbased methods, this framework builds upon
the large margin estimation principle. Intuitively, we ﬁnd parameters such that in
ference in the model (dynamic programming, combinatorial optimization) predicts
the correct answers on the training data with maximum conﬁdence. We develop gen
eral conditions under which exact large margin estimation is tractable and present
two formulations for structured maxmargin estimation that deﬁne compact convex
optimization problems, taking advantage of prediction task structure. The ﬁrst for
mulation relies on the ability to express inference in the model as a compact convex
optimization problem. The second one only requires compactly expressing optimal
ity of a given assignment according to the model and applies to a broader range of
combinatorial problems. These two formulations form the foundation which the rest
of the thesis develops.
◦ Markov networks
The largest portion of the thesis is devoted to novel estimation algorithms, represen
tational extensions, generalization analysis and experimental validation for Markov
networks, a model class of choice in many structured prediction tasks in language,
vision and biology.
Lowtreewidth Markov networks
We use graph decomposition to derive an exact, compact, convex learning for
mulation for Markov networks with sequence and other lowtreewidth structure.
The seamless integration of kernels with graphical models allows us to create
1.4. CONTRIBUTIONS 9
very rich models that leverage the immense amount of research in kernel de
sign and graphical model decompositions for efﬁcient, accurate prediction in
realworld tasks. We also use approximate graph decomposition to derive a
compact approximate formulation for Markov networks in which inference is
intractable.
Scalable online algorithm
We present an efﬁcient algorithm for solving the estimation problem called
Structured SMO. Our onlinestyle algorithm uses inference in the model and
analytic updates to solve extremely large estimation problems.
Generalization analysis
We analyze the theoretical generalization properties of maxmargin estimation
in Markov networks and derive a novel marginbased bound for structured pre
diction. This bound is the ﬁrst to address structured error (e.g. proportion
of mislabeled pixels in an image) and uses a proof that exploits the graphical
model structure.
Learning associative Markov networks (AMNs)
We deﬁne an important subclass of Markov networks that captures positive cor
relations present in many domains. We show that for AMNs over binary vari
ables, our framework allows exact estimation of networks of arbitrary connec
tivity and topology, for which likelihood methods are believed to be intractable.
For the nonbinary case, we provide an approximation that works well in prac
tice. We present an AMNbased method for object segmentation from 3D range
data. By constraining the class of Markov networks to AMNs, our models are
learned efﬁciently and, at runtime, scale up to tens of millions of nodes and
edges.
Representation and learning of relational Markov networks
We introduce relational Markov networks (RMNs), which compactly deﬁne
templates for Markov networks for domains with relational structure objects,
10 CHAPTER 1. INTRODUCTION
attributes, relations. The graphical structure of an RMN is based on the rela
tional structure of the domain, and can easily model complex interaction pat
terns over related entities. We use approximate inference in these complex mod
els, in which exact inference is intractable, to derive an approximate learning
formulation. We apply this class of models to classiﬁcation of hypertext using
hyperlink structure to deﬁne relations between webpages.
◦ Broader applications: parsing, matching, clustering
The other large portion the thesis addresses a range of prediction tasks with very di
verse models: context free grammars for natural language parsing, perfect matchings
for disulﬁde connectivity in protein structure prediction, graph partitions for cluster
ing documents and segmenting images.
Learning to parse
We exploit context free grammar structure to derive a compact maxmargin
formulation and show highaccuracy parsing in cubic time by exploiting novel
kinds of lexical information. We show experimental evidence of the model’s
improved performance over several baseline models.
Learning to match
We use combinatorial properties of weighted matchings to develop an exact,
efﬁcient algorithm for learning to match. We apply our framework to predic
tion of disulﬁde connectivity in proteins using perfect nonbipartite matchings.
The algorithm we propose uses kernels, which makes it possible to efﬁciently
embed the features in very highdimensional spaces and achieve stateoftheart
accuracy.
Learning to cluster
We derive a maxmargin formulation for learning the afﬁnity metric for clus
tering from clustered training data. In contrast to algorithms that learn a metric
independently of the algorithm that will be used to cluster the data, we describe
a formulation that tightly integrates metric learning with the clustering algo
rithm, tuning one to the other in a joint optimization. Experiments on synthetic
and realworld data show the ability of the algorithm to learn an appropriate
1.5. THESIS OUTLINE 11
clustering metric for a variety of desired clusterings, including email folder or
ganization and image segmentation.
1.5 Thesis outline
Below is a summary of the rest of the chapters in the thesis:
Chapter 2. Supervised learning: We review basic deﬁnitions and statistical framework
for classiﬁcation. We deﬁne hypothesis classes, loss functions, risk. We consider
generalized linear models, including logistic regression and support vector machines,
and review estimation methods based on maximizing likelihood, conditional likeli
hood and margin. We describe the relationship between the dual estimation problems
and kernels.
Chapter 3. Structured models: In this chapter, we deﬁne the abstract class of structured
prediction problems and models addressed by the thesis. We compare probabilistic
models, generative and discriminative and unnormalized models. We describe repre
sentation and inference for Markov networks, including dynamic and linear program
ming inference. We also brieﬂy describe context free grammars and combinatorial
structures as models.
Chapter 4. Structured maximum margin estimation: This chapter outlines the main prin
ciples of maximum margin estimation for structured models. We address the expo
nential blowup of the naive problem formulation by deriving two general equivalent
convex formulation. These formulations, minmax and certiﬁcate, allow us to ex
ploit decomposition and combinatorial structure of the prediction task. They lead
to polynomial size programs for estimation of models where the prediction problem
is tractable. We also discuss approximations, in particular using upper and lower
bounds, for solving intractable or very large problems.
Chapter 5. Markov networks: We review maximum conditional likelihood estimation
and present maximum margin estimation for Markov networks. We use graphical
model decomposition to derive a convex, compact formulation that seamlessly in
tegrates kernels with graphical models. We analyze the theoretical generalization
12 CHAPTER 1. INTRODUCTION
properties of maxmargin estimation and derive a novel marginbased bound for
structured classiﬁcation.
Chapter 6. M
3
N algorithms and experiments: We present an efﬁcient algorithmfor solv
ing the estimation problem in graphical models, called Structured SMO. Our online
style algorithm uses inference in the model and analytic updates to solve extremely
large quadratic problems. We present experiments with handwriting recognition,
where our models signiﬁcantly outperform other approaches by effectively capturing
correlation between adjacent letters and incorporating highdimensional input repre
sentation via kernels.
Chapter 7. Associative Markov networks: We deﬁne an important subclass of Markov
networks, associative Markov networks (AMNs), that captures positive interactions
present in many domains. We show that for associative Markov networks of over bi
nary variables, maxmargin estimation allows exact training of networks of arbitrary
connectivity and topology, for which maximum likelihood methods are believed to
be intractable. For the nonbinary case, we provide an approximation that works
well in practice. We present an AMNbased method for object segmentation from
3D range data that scales to very large prediction tasks involving tens of millions of
points.
Chapter 8. Relational Markov networks: We introduce the framework of relational Mar
kov networks (RMNs), which compactly deﬁnes templates for Markov networks in
domains with rich structure modeled by objects, attributes and relations. The graph
ical structure of an RMN is based on the relational structure of the domain, and can
easily model complex patterns over related entities. As we show, the use of an undi
rected, discriminative graphical model avoids the difﬁculties of deﬁning a coherent
generative model for graph structures in directed models and allows us tremendous
ﬂexibility in representing complex patterns. We provide experimental results on a
webpage classiﬁcation task, showing that accuracy can be signiﬁcantly improved by
modeling relational dependencies.
Chapter 9. Context free grammars: We present maxmargin estimation for natural lan
guage parsing on the decomposition properties of context free grammars. We show
1.6. PREVIOUSLY PUBLISHED WORK 13
that this framework allows highaccuracy parsing in cubic time by exploiting novel
kinds of lexical information. We show experimental evidence of the model’s im
proved performance over several baseline models.
Chapter 10. Perfect matchings: We apply our framework to learning to predict disulﬁde
connectivity in proteins using perfect matchings. We use combinatorial properties of
weighted matchings to develop an exact, efﬁcient algorithm for learning the param
eters of the model. The algorithm we propose uses kernels, which makes it possible
to efﬁciently embed the features in very highdimensional spaces and achieve state
oftheart accuracy.
Chapter 11. Correlation clustering: In this chapter, we derive a maxmargin formula
tion for learning afﬁnity scores for correlation clustering from clustered training data.
We formulate the approximate learning problem as a compact convex program with
quadratic objective and linear or positivesemideﬁnite constraints. Experiments on
synthetic and realworld data show the ability of the algorithm to learn an appro
priate clustering metric for a variety of desired clusterings, including email folder
organization and image segmentation.
Chapter 12. Conclusions and future directions: We reviewthe main contributions of the
thesis and summarize their signiﬁcance, applicability and limitations. We discuss ex
tensions and future research directions not addressed in the thesis.
1.6 Previously published work
Some of the work described in this thesis has been published in conference proceedings.
The minmax and certiﬁcate formulations for structured maxmargin estimation have not
been published in their general form outlined in Ch. 4, although they underly several pa
pers mentioned below. The polynomial formulation of maximum margin Markov networks
presented in Ch. 5 was published for a less general case, using a dual decomposition tech
nique [Taskar et al., 2003a]. Work on associative Markov networks (Ch. 7) was published
with experiments on hypertext and newswire classiﬁcation [Taskar et al., 2004a]. A paper
14 CHAPTER 1. INTRODUCTION
on 3D object segmentation using AMNs, which presents a experiments on terrain classiﬁ
cation and other tasks, is currently under review (joint work with Drago Anguelov, Vassil
Chatalbashev, Dinkar Gupta, Geremy Heitz, Daphne Koller and Andrew Ng). Taskar et al.
[2002] and Taskar et al. [2003b] deﬁned and applied the Relational Markov networks
(Ch. 8), using maximum (conditional) likelihood estimation. Natural language parsing
in Ch. 9 was published in Taskar et al. [2004b]. Disulﬁde connectivity prediction using
perfect matchings in Ch. 10 (joint work with Vassil Chatalbashev and Daphne Koller) is
currently under review. Finally, work on correlation clustering in Ch. 11, done jointly with
Pieter Abbeel and Andrew Ng, has not been published.
Part I
Models and methods
15
Chapter 2
Supervised learning
In supervised learning, we seek a function h : A → ¸ that maps inputs x ∈ A to outputs
y ∈ ¸. The input space A is an arbitrary set (often A = IR
n
), while the output space ¸
we consider in this chapter discrete. A supervised learning problem with discrete outputs,
¸ = ¦y
1
, . . . , y
k
¦, where k is the number of classes, is called classiﬁcation. In handwritten
character recognition, for example, A is the set of images of letters and ¸ is the alphabet
(see Fig. 2.1).
The input to an algorithm is training data, a set of m i.i.d. (independent and identically
distributed) samples S = ¦(x
(i)
, y
(i)
)¦
m
i=1
drawn from a ﬁxed but unknown distribution D
over A ¸. The goal of a learning algorithm is to output a hypothesis h such that h(x)
will approximate y on new samples from the distribution (x, y) ∼ D.
Learning algorithms can be distinguished among several dimensions, chief among them
is the hypothesis class H of functions h the algorithm outputs. Numerous classes of func
tions have been well studied, including decision trees, neural networks, nearestneighbors,
generalized loglinear models and kernel methods (see Quinlan [2001]; Bishop [1995];
Hastie et al. [2001]; Duda et al. [2000], for indepth discussion of these and many other
models). We will concentrate on the last two classes, for several reasons we discuss be
low, including accuracy, efﬁciency, and extensibility to more complex structured prediction
tasks will consider in the next chapter.
The second crucial dimension of a learning algorithm is the criterion for selection of h
fromH. We arrive at such a criterion by quantifying what it means for h(x) to approximate
16
17
y. The risk functional 1
D
[(h)] measures the expected error of the approximation:
1
D
[h] = E
(x,y)∼D
[(x, y, h(x))], (2.1)
where the loss function : A ¸ ¸ → IR
+
measures the penalty for predicting h(x)
on the sample (x, y). In general, we assume that (x, y, ˆ y) = 0 if y = ˆ y.
A common loss function for classiﬁcation is 0/1 loss
0/1
(x, y, h(x)) ≡ 1I(y ,= h(x)),
where 1I() denotes the indicator function, that is, 1I(true) = 1 and 1I(false) = 0.
Since we do not generally know the distribution D, we estimate the risk of h using its
empirical risk 1
S
, computed on the training sample S:
1
S
[h] =
1
m
m
i=1
(x
(i)
, y
(i)
, h(x
(i)
)) =
1
m
m
i=1
i
(h(x
(i)
)), (2.2)
where we abbreviate (x
(i)
, y
(i)
, h(x
(i)
)) =
i
(h(x
(i)
)). For 0/1 loss, 1
S
[h] is simply the
proportion of training examples that h misclassiﬁes. 1
S
[h] is often called the training
error or training loss.
If our set of hypotheses, H, is large enough, we will be able to ﬁnd h that has zero or
very small empirical risk. However, simply selecting a hypothesis with lowest risk
h
∗
= arg min
h∈1
1
S
[h],
is generally not a good idea. For example, if A = IR, ¸ = IR and Hincludes all polynomi
als of degree m−1, we can always ﬁnd a polynomial h that passes through all the sample
points (x
(i)
, y
(i)
), i = (1, ..., m) assuming that all the x
(i)
are unique. This polynomial is
very likely to overﬁt the training data, that is, it will have zero empirical risk, but high ac
tual risk. The key to selecting a good hypothesis is to tradeoff complexity of class H (e.g.
the degree of the polynomial) with the error on the training data as measured by empirical
risk 1
S
. For a vast majority of supervised learning algorithms, this fundamental balance is
18 CHAPTER 2. SUPERVISED LEARNING
achieved by minimizing the weighted combination of the two criteria:
h
∗
= arg min
h∈1
_
T[h] + C1
S
[h]
_
, (2.3)
where T[h] measures the inherent dimension or complexity of h, and C ≥ 0 is a trade
off parameter. We will not go into derivation of various complexity measures T[h] here,
but simply adopt the standard measures as needed and refer the reader to Vapnik [1995];
Devroye et al. [1996]; Hastie et al. [2001] for details. The term T[h] is often called
regularization.
Depending on the complexity of the class H, the search for the optimal h
∗
in (2.3)
may be a daunting task
1
. For many classes, for example decision trees and multilayer
neural networks, it is intractable [Bishop, 1995; Quinlan, 2001], and we must resort to
approximate, greedy optimization methods. For these intractable classes, the search pro
cedure used by the learning algorithm is crucial. Below however, we will concentrate on
models where the optimal h
∗
can be found efﬁciently using convex optimization in poly
nomial time. Hence, the learning algorithms we consider are completely characterized by
the hypothesis class H, the loss function , and the regularization T[h].
In general, we consider hypothesis classes of the following parametric form:
h
w
(x) = arg max
y∈¸
f(w, x, y), (2.4)
where f(w, x, y) is a function f : ¼A ¸ → IR, where w ∈ ¼ is a set of parameters,
usually with ¼ ⊆ IR
n
. We assume that ties in the arg max are broken using some arbitrary
but ﬁxed rule. As we discuss below, this class of hypotheses is very rich and includes
many standard models. The formulation in (2.4) of the hypothesis class in terms of an
optimization procedure will become crucial to extending supervised learning techniques to
cases where the output space ¸ is more complex.
1
For classiﬁcation, minimizing the objective with the usual 0/1 training error is generally a very difﬁcult
problem with multiple maxima for most realistic H. See discussion in the next section about approaches to
dealing with 0/1 loss.
2.1. CLASSIFICATION WITH GENERALIZED LINEAR MODELS 19
a b c d e
Figure 2.1: Handwritten character recognition: sample letters from Kassel [1995] data set.
2.1 Classiﬁcation with generalized linear models
For classiﬁcation, we consider the generalized linear family of hypotheses H. Given n
realvalued basis functions f
j
: A ¸ → IR, a hypothesis h
w
∈ H is deﬁned by a set of n
coefﬁcients w
j
∈ IR such that:
h
w
(x) = arg max
y∈¸
n
i=1
w
j
f
j
(x, y) = arg max
y∈¸
w
¯
f (x, y). (2.5)
Consider the character recognition example in Fig. 2.1. Our input x is a vector of
pixel values of the image and y is the alphabet ¦a, . . . , z¦. We might have a basis function
f
j
(x, y) = 1I(x
row,col
= on ∧ y = char) for each possible (row, col) and char ∈ ¸,
where x
row,col
denotes the value of pixel (row, col). Since different letters tend to have
different pixels turned on, this very simple model captures enough information to perform
reasonably well.
The most common loss for classiﬁcation is 0/1 loss. Minimizing the 0/1 risk is generally
a very difﬁcult problem with multiple maxima for any large class H. The standard solution
is minimizing an upper bound on the 0/1 loss, (x, y, h(x)) ≥ (x, y, h(x)). (In addition
to computational advantages of this approach, there are statistical beneﬁts of minimizing a
convex upper bound [Bartlett et al., 2003]). Two of the primary classiﬁcation methods we
consider, logistic regression and support vector machines, differ primarily in their choice of
the upper bound on the training 0/1 loss. The regularization T[h
w
] for the linear family is
typically the norm of the parameters [[w[[
p
for p = 1, 2. Intuitively, a zero, or small weight
w
j
implies that the hypothesis h
w
does not depend on the value of f
j
(x, y) and hence is
simpler than a h
w
with a large weight w
j
.
20 CHAPTER 2. SUPERVISED LEARNING
−2 −1.5 −1 −0.5 0 0.5 1 1.5 2
0
0.5
1
1.5
2
2.5
3
3.5
log−loss
hinge−loss
0/1−loss
Figure 2.2: 0/1loss upper bounded by logloss and hingeloss. Horizontal axis shows
w
¯
f (x, y) −max
y
,=y
w
¯
f (x, y
t
), where y is the correct label for x, while the vertical axis
show the value of the associated loss. The logloss is shown up to an additive constant for
illustration purposes.
2.2 Logistic regression
In logistic regression, we assign a probabilistic interpretation to the hypothesis h
w
as deﬁn
ing a conditional distribution:
P
w
(y [ x) =
1
Z
w
(x)
exp¦w
¯
f (x, y)¦, (2.6)
where Z
w
(x) =
y∈¸
exp¦w
¯
f (x, y)¦. The optimal weights are selected by maximiz
ing the conditional likelihood of the data (minimizing the logloss) with some regulariza
tion. This approach is called the (regularized) maximum likelihood estimation. Common
choices for regularization are 1 or 2norm regularization on the weights; we use 2norm
below:
min
1
2
[[w[[
2
+ C
i
log Z
w
(x
(i)
) −w
¯
f (x
(i)
, y
(i)
), (2.7)
where C is a userspeciﬁed constant the determines the tradeoff between regularization
and likelihood of the data. The logloss log Z
w
(x) −w
¯
f (x, y) is an upper bound (up to a
constant) on the 0/1 loss
0/1
(see Fig. 2.2).
2.3. LOGISTIC DUAL AND MAXIMUM ENTROPY 21
2.3 Logistic dual and maximum entropy
The objective function is convex in the parameters w, so we have an unconstrained (differ
entiable) convex optimization problem. The gradient with respect to w is given by:
w+ C
i
E
i,w
[f
i
(x
(i)
, y)] −f
i
(x
(i)
, y
(i)
) = w−C
i
E
i,w
[∆f
i
(y)],
where E
i,w
[f(y)] =
y
f(y)P
w
(y [ x
(i)
) is the expectation under the conditional distribu
tion P
w
(y [ x
(i)
) and ∆f
i
(y) = f (x
(i)
, y
(i)
) − f (x
(i)
, y). Ignoring the regularization term,
the gradient is zero when the basis function expectations are equal to the basis functions
evaluated on the labels y
(i)
. It can be shown [Cover & Thomas, 1991] that the dual of the
maximum likelihood problem (without regularization) is the maximum entropy problem:
max −
i,y
P
w
(y [ x
(i)
) log P
w
(y [ x
(i)
) (2.8)
s.t. E
i,w
[∆f
i
(y)] = 0, ∀i.
We can interpret logistic regression as trying to match the empirical basis function expec
tations while maintaining a high entropy conditional distribution P
w
(y [ x).
2.4 Support vector machines
Support vector machines [Vapnik, 1995] select the weights based on the “margin” of con
ﬁdence of h
w
. In the multiclass SVM formulation [Weston & Watkins, 1998; Crammer &
Singer, 2001], the margin on example i quantiﬁes by how much the true label “wins” over
the wrong ones:
γ
i
=
1
[[w[[
min
y,=y
(i)
w
¯
f (x
(i)
, y
(i)
) −w
¯
f (x
(i)
, y) =
1
[[w[[
min
y,=y
(i)
w
¯
∆f
i
(y),
22 CHAPTER 2. SUPERVISED LEARNING
where ∆f
i
(y) = f (x
(i)
, y
(i)
) −f (x
(i)
, y). Maximizing the smallest such margin (and allow
ing for negative margins) is equivalent to solving the following quadratic program:
min
1
2
[[w[[
2
+ C
i
ξ
i
(2.9)
s.t. w
¯
∆f
i
(y) ≥
0/1
(y) −ξ
i
, ∀i, ∀y ∈ ¸.
Note that the slack variable ξ
i
is constrained to be positive in the above program since
w
¯
∆f
i
(y
(i)
) = 0 and
0/1
(y
(i)
) = 0. We can also express ξ
i
as max
y
0/1
i
(y) −w
¯
∆f
i
(y),
and the optimization problem Eq. (2.9) in a form similar to Eq. (2.7):
min
1
2
[[w[[
2
+ C
i
max
y
[
0/1
i
(y) −w
¯
∆f
i
(y)]. (2.10)
The hingeloss max
y
[
0/1
i
(y) − w
¯
∆f
i
(y)] is also an upper bound on the 0/1 loss
0/1
(see Fig. 2.2).
2.5 SVM dual and kernels
The form of the dual of Eq. (2.9) is crucial to efﬁcient solution of SVM and the ability to
use a high or even inﬁnite dimensional set of basis functions via kernels.
max
i,y
α
i
(y)
0/1
i
(y) −
1
2
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,y
α
i
(y)∆f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(2.11)
s.t.
y
α
i
(y) = C, ∀i; α
i
(y) ≥ 0, ∀i, y.
In the dual, the α
i
(y) variables correspond to the w
¯
∆f
i
(y) ≥
0/1
(y)−ξ
i
constraints in the
primal Eq. (2.9). The solution to the dual α
∗
gives the solution to the primal as a weighted
combination of basis functions of examples:
w
∗
=
i,y
α
∗
i
(y)∆f
i
(y).
2.5. SVM DUAL AND KERNELS 23
The pairings of examples and incorrect labels, (i, y), that have nonzero α
∗
i
(y), are called
support vectors.
An important feature of the dual formulation is that the basis functions f appear only as
dot products. Expanding the quadratic term, we have:
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,y
α
i
(y)∆f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
=
i,y
j,¯ y
α
i
(y)α
j
(¯ y)∆f
i
(y)
¯
∆f
j
(¯ y).
Hence, as long as the dot product f (x, y)
¯
f (¯ x, ¯ y) can be computed efﬁciently, we can
solve Eq. (2.11) independently of the actual dimension of f . Note that at classiﬁcation
time, we also do not need to worry about the dimension of f since:
w
¯
f (x, ¯ y) =
i,y
α
i
(y)∆f
i
(y)
¯
f (x, ¯ y) =
i,y
α
i
(y)[f (x
(i)
, y
(i)
)
¯
f (x, ¯ y)−f (x
(i)
, y)
¯
f (x, ¯ y)].
For example, we might have basis functions that are polynomial of degree d in terms of
image pixels, f
j
(x, y) = 1I(x
row
1
,col
1
= on ∧ . . . ∧ x
row
d
,col
d
= on ∧ y = char) for each
possible (row
1
, col
1
) . . . (row
d
, col
d
) and char ∈ ¸. Computing this polynomial kernel
can be done independently of the dimension d, even though the number of basis functions
grows exponentially with d [Vapnik, 1995].
In fact, logistic regression can also be kernelized. However, the hinge loss formulation
usually produces sparse solutions in terms of the number of support vectors, while solutions
to the corresponding kernelized logloss problem are generally nonsparse (all examples
are support vectors) and require approximations for even relatively small datasets [Wahba
et al., 1993; Zhu & Hastie, 2001].
Chapter 3
Structured models
Consider once more the problem of character recognition. In fact, a more natural and useful
task is recognizing words and entire sentences. Fig. 3.1 shows an example handwritten
word “brace.” Distinguishing between the second letter and fourth letter (‘r’ and ‘c’) in
isolation is far from trivial, but in the context of the surrounding letters that together form
a word, this task is much less errorprone for humans and should be for computers as well.
In this chapter, we consider prediction problems in which the output is not a single
discrete value y, but a set of values y = (y
1
, . . . , y
L
), for example an entire sequence
of L characters. For concreteness, let the number of variables L be ﬁxed. The output
space ¸ ⊆ ¸
1
. . . ¸
L
we consider is a subset of product of output spaces of single
variables. In word recognition, each ¸
j
is the alphabet, while ¸ is the dictionary. This
joint output space is often a proper subset of the product of singleton output spaces, ¸ ⊂
¸
1
. . .¸
L
. In word recognition, we might restrict that the letter ‘q’ never follows by ‘z’ in
English. In addition to “hard” constraints, the output variables are often highly correlated,
e.g. consecutive letters in a word. We refer to joint spaces with constraints and correlations
as structured. We call problems with discrete output spaces structured classiﬁcation or
structured prediction. Structured models we consider in this chapter (and thesis) predict
the outputs jointly, respecting the constraints and exploiting the correlations in the output
space.
The range of prediction problems these broad deﬁnitions encompass is immense, aris
ing in ﬁelds as diverse as natural language analysis, machine vision, and computational
24
3.1. PROBABILISTIC MODELS: GENERATIVE AND CONDITIONAL 25
b r a c e
Figure 3.1: Handwritten word recognition: sample from Kassel [1995] data set.
biology, to name a few. The class of structured models H we consider is essentially of the
same form as in previous chapter, except that y has been replaced by y:
h
w
(x) = arg max
y : g(x,y)≤0
w
¯
f (x, y), (3.1)
where as before f (x, y) is a vector of functions f : A ¸ → IR
n
. The output space
¸ = ¦y : g(x, y) ≤ 0¦ is deﬁned using a vector of functions g(x, y) that deﬁne the
constraints, where g : A ¸ → IR
k
. This formulation is very general. Clearly, for
many f , g pairs, ﬁnding the optimal y is intractable. For the most part, we will restrict our
attention to models where this optimization problemcan be solved in polynomial time. This
includes, for example, probabilistic models like Markov networks (in certain cases) and
contextfree grammars, combinatorial optimization problems like mincut and matching,
convex optimization such as linear, quadratic and semideﬁnite programming. In other
cases, like intractable Markov networks (Ch. 8) and correlation clustering (Ch. 11), we use
an approximate polynomial time optimization procedure.
3.1 Probabilistic models: generative and conditional
The term model is often reserved for probabilistic models, which can be subdivided into
generative and conditional with respect to the prediction task. A generative model assigns
a normalized joint density p(x, y) to the input and output space A ¸ with
p(x, y) ≥ 0,
y∈¸
_
x∈.
p(x, y) = 1.
26 CHAPTER 3. STRUCTURED MODELS
A conditional model assigns a normalized density p(y [ x) only over the output space ¸
with
p(y [ x) ≥ 0,
y∈¸
p(y [ x) = 1 ∀x ∈ A.
Probabilistic interpretation of the model offers wellunderstood semantics and an im
mense toolbox of methods for inference and learning. It also provides an intuitive measure
of conﬁdence in the predictions of a model in terms of conditional probabilities. In addi
tion, generative models are typically structured to allow very efﬁcient maximum likelihood
learning. A very common class of generative models is the exponential family:
p(x, y) ∝ exp¦w
¯
f (x, y)¦.
For exponential families, the maximum likelihood parameters w with respect to the joint
distribution can be computed in closed form using the empirical basis function expectations
E
S
[f (x, y)] [DeGroot, 1970; Hastie et al., 2001].
Of course, this efﬁciency comes at a price. Any model is an approximation to the true
distribution underlying the data. A generative model must make simplifying assumptions
(more precisely, independence assumptions) about the entire p(x, y), while a conditional
model makes many fewer assumption by focusing on p(y [ y). Because of this, by opti
mizing the model to ﬁt the joint distribution p(x, y), we may be tuning the approximation
away from optimal conditional distribution p(y [ x), which we use to make the predictions.
Given sufﬁcient data, the conditional model will learn the best approximation to p(y [ x)
possible using w, while the generative model p(x, y) will not necessarily do so. Typically,
however, generative models actually need fewer samples to converge to a good estimate of
the joint distribution than conditional models need to accurately represent the conditional
distribution. In a regime with very few training samples (relative to the number of param
eters w), generative models may actually outperform conditional models [Ng & Jordan,
2001].
3.2. PREDICTION MODELS: NORMALIZED AND UNNORMALIZED 27
3.2 Prediction models: normalized and unnormalized
Probabilistic semantics are certainly not necessary for a good predictive model if we are
simply interested in the optimal prediction (the arg max in Eq. (3.1)). As we discussed
in the previous chapter, support vector machines, which do not represent a conditional
distribution, typically perform as well or better than logistic regression [Vapnik, 1995;
Cristianini & ShaweTaylor, 2000].
In general, we can often achieve higher accuracy models when we do not learn a nor
malized distribution over the outputs, but concentrate on the margin or decision boundary,
the difference between the optimal y and the rest. Even more importantly, in many cases
we discuss below, normalizing the model (summing over the entire ¸) is intractable, while
the optimal y can be found in polynomial time. This fact makes standard maximum like
lihood estimation infeasible. The learning methods we advocate in this thesis circumvent
this problem by requiring only the maximization problem to be tractable. We still heav
ily rely on the representation and inference tools familiar from probabilistic models for
the construction of and prediction in unnormalized models, but largely dispense with the
probabilistic interpretation when needed. Essentially, we use the term model very broadly,
to include any scheme that assigns scores to the output space ¸ and has a procedure for
ﬁnding the optimal scoring y.
In this chapter, we review basic concepts in probabilistic graphical models called Mar
kov networks or Markov randomﬁelds. We also brieﬂy touch upon examples of contextfree
grammars and combinatorial problems that will be explained in greater detail in Part III to
illustrate the range of prediction problems we address.
3.3 Markov networks
Markov networks provide a framework for a rich family of models for both discrete and
continuous prediction [Pearl, 1988; Cowell et al., 1999]. The models treat the inputs and
outputs as random variables X with domain A and Y with domain ¸ and compactly de
ﬁne a conditional density p(Y [ X) or distribution P(Y [ X) (we concentrate here on the
28 CHAPTER 3. STRUCTURED MODELS
conditional Markov networks or CRFs [Lafferty et al., 2001]). The advantage of a graphi
cal framework is that it can exploit sparseness in the correlations between outputs Y . The
graphical structure of the models encodes the qualitative aspects of the distribution: direct
dependencies as well as conditional independencies. The quantitative aspect of the model
is deﬁned by the potentials that are associated with nodes and cliques of the graph. Before
a formal deﬁnition, consider a ﬁrstorder Markov chain a model for the word recognition
task. In Fig. 3.2, the nodes are associated with output variables Y
i
and the edges correspond
to direct dependencies or correlations. We do not explicitly represent the inputs X in the
ﬁgure. For example, the model encodes that Y
j
is conditionally independent of the rest of
the variables given Y
j−1
, Y
j+1
. Intuitively, adjacent letters in a word are highly correlated,
but the ﬁrstorder model is making the assertion (which is certainly an approximation) that
once the value of a letter Y
j
is known, the correlation between a letter Y
b
before j and a
letter Y
a
after j is negligible. More precisely, we use a model where
P(Y
b
[ Y
j
, Y
a
, x) = P(Y
b
[ Y
j
, x), P(Y
a
[ Y
j
, Y
b
, x) = P(Y
a
[ Y
j
, x), b < j < a.
For the purposes of ﬁnding the most likely y, this conditional independence property means
that the optimization problem is decomposable: given that Y
j
= y
j
, it sufﬁces to separately
ﬁnd the optimal subsequence from 1 to j ending with y
j
, and the optimal subsequence
starting with y
j
from j to L.
3.3.1 Representation
The structure of a Markov network is deﬁned by an undirected graph ( = (1, c), where
the nodes are associated with variables 1 = ¦Y
1
, . . . , Y
L
¦. A clique is a set of nodes c ⊆ 1
that form a fully connected subgraph (every two nodes are connected by an edge). Note that
each subclique of a clique is also a clique, and we consider each node a singleton clique.
In the chain network in Fig. 3.2, the cliques are simply the nodes and the edges: ((() =
¦¦Y
1
¦, . . . , ¦Y
5
¦, ¦Y
1
, Y
2
¦, . . . , ¦Y
4
, Y
5
¦¦. We denote the set of variables in a clique c as
Y
c
, an assignment of variables in the clique as y
c
and the space of all assignments to
the clique as ¸
c
. We focus on discrete output spaces ¸ below, but many of the same
representation and inference concepts translate to continuous domains. No assumption is
3.3. MARKOV NETWORKS 29
Figure 3.2: Firstorder Markov chain: φ
i
(Y
i
) are node potentials, φ
i,i+1
(Y
i
, Y
i+1
) are edge
potentials (dependence on x is not shown).
made about A.
Deﬁnition 3.3.1 A Markov network is deﬁned by an undirected graph ( = (1, c) and a
set of potentials Φ = ¦φ
c
¦. The nodes are associated with variables 1 = ¦Y
1
, . . . , Y
L
¦.
Each clique c ∈ ((() is associated with a potential φ
c
(x, y
c
) with φ
c
: A ¸
c
→ IR
+
,
which speciﬁes a nonnegative value for each assignment y
c
to variables in Y
c
and any
input x. The Markov network ((, Φ) deﬁnes a conditional distribution:
P(y [ x) =
1
Z(x)
c∈((Ç)
φ
c
(x, y
c
),
where ((() is the set of all the cliques of the graph and Z(x) is the partition function
given by Z(x) =
y∈¸
c∈((Ç)
φ
c
(x, y
c
).
In our example Fig. 3.2, we have node and edge potentials. Intuitively, the node poten
tials quantify the correlation between the input x and the value of the node, while the edge
potentials quantify the correlation between the pair of adjacent output variables as well as
the input x. Potentials do not have a local probabilistic interpretation, but can be thought
of as deﬁning an unnormalized score for each assignment in the clique. Conditioned on
the image input, appropriate node potentials in our network should give high scores to the
correct letters (‘b’,‘r’,‘a’,‘c’,‘e’), though perhaps there would be some ambiguity with the
second and fourth letter. For simplicity, assume that the edge potentials would not depend
30 CHAPTER 3. STRUCTURED MODELS
on the images, but simply should give high scores to pairs of letters that tend to appear often
consecutively. Multiplied together, these scores should favor the correct output “brace”.
In fact, a Markov network is a generalized loglinear model, since the potentials φ
c
(x
c
, y
c
)
could be represented (in logspace) as a sum of basis functions over x, y
c
:
φ
c
(x
c
, y
c
) = exp
_
n
c
k=1
w
c,k
f
c,k
(x, y
c
)
_
= exp
_
w
¯
c
f
c
(x, y
c
)
¸
where n
c
is the number of basis functions for the clique c. Hence the log of the conditional
probability is given by:
log P(y [ x) =
c∈((Ç)
w
¯
c
f
c
(x, y
c
) −log Z
w
(x).
In case of node potentials for word recognition, we could use the same basis functions as
for individual character recognition: f
j,k
(x, y
j
) = 1I(x
j,row,col
= on ∧ y
j
= char) for each
possible (row, col) in x
j
, the window of the image that corresponds to letter j and each
char ∈ ¸
j
(we assume the input has been segmented into images x
j
that correspond to
letters). In general, we condition a clique only on a portion of the input x, which we denote
as x
c
. For the edge potentials, we can deﬁne basis functions for each combination of letters
(assume for simplicity no dependence on x) : f
j,j+1,k
(x, y
j
, y
j+1
) = 1I(y
j
= char
1
∧y
j+1
=
char
2
) for each char
1
∈ ¸
j
and char
2
∈ ¸
j+1
. In this problem (as well as many others),
we are likely to “tie” or “share” the parameters of the model w
c
across cliques. Usually, all
single node potentials would share the same weights and basis functions (albeit the relevant
portion of the input x
c
is different) and similarly for the pairwise cliques, no matter in what
position they appear in the sequence.
1
With slight abuse of notation, we stack all basis functions into one vector f . For the
sequence model, f has node functions and edge functions, so when c is a node, the edge
functions in f (x
c
, y
c
) are deﬁned to evaluate to zero. Similarly, when c is an edge, the node
1
Sometimes we might actually want some dependence on the position in the sequence, which can be
accomplished by adding more basis functions that condition on the position of the clique.
3.3. MARKOV NETWORKS 31
functions in f (x
c
, y
c
) are also deﬁned to evaluate to zero. Now we can write:
f (x, y) =
c∈((Ç)
f (x
c
, y
c
).
We stack the weights in the corresponding manner, so the most likely assignment according
to the model is given by:
arg max
y∈¸
log P
w
(y [ x) = arg max
y∈¸
w
¯
f (x, y),
in the same form as Eq. (3.1).
3.3.2 Inference
There are several important questions that can be answered by probabilistic models. The
task of ﬁnding the most likely assignment, known as maximum aposteriori (MAP) or most
likely explanation (MPE), is just one of such questions, but most relevant to our discussion.
The Viterbi dynamic programming algorithm solves this problem for chain networks in
O(L) time. Let the highest score of any subsequence from 1 to k > 1 ending with value y
k
be deﬁned as
φ
∗
k
(y
k
) = max
y
1..k−1
j
φ
j
(x, y
j
)φ
j
(x, y
j−1
, y
j
).
The algorithm computes the highest scores recursively:
φ
∗
1
(y
1
) = φ
1
(x, y
1
), ∀y
1
∈ ¸
1
;
φ
∗
k
(y
k
) = max
y
k−1
∈¸
k−1
φ
∗
k−1
(y
k−1
)φ
j
(x, y
k
)φ
j
(x, y
k−1
, y
k
), 1 < k ≤ L, ∀y
k
∈ ¸
k
.
The highest scoring sequence has score max
y
L
φ
∗
L
(y
L
). Using the arg max’s of the max’s in
the computation of φ
∗
, we can backtrace the highest scoring sequence itself. We assume
that score ties are broken in a predetermined way, say according to some lexicographic
order of the symbols.
32 CHAPTER 3. STRUCTURED MODELS
Figure 3.3: Diamond Markov network (added triangulation edge is dashed).
In general Markov networks, MAP inference is NPhard [Cowell et al., 1999]. How
ever, there are several important subclasses of networks that allow polynomial time infer
ence. The most important of these is the class of networks with low treewidth. We need the
concept of triangulation (or chordality) to formally deﬁne treewidth. Recall that a cycle
of length l in an undirected graph ( is a sequence of nodes (v
0
, v
1
, . . . , v
l
), distinct except
that v
0
= v
l
, which are connected by edges (v
i
, v
i+1
) ∈ (. A chord of this cycle is an edge
(v
i
, v
j
) ∈ ( between nonconsecutive nodes.
Deﬁnition 3.3.2 (Triangulated graph) An undirected graph ( is triangulated if every one
of its cycles of length ≥ 4 possesses a chord.
Singlyconnected graphs, like chains and trees, are triangulated since they contain no cy
cles. The simplest untriangulated network is the diamond in Fig. 3.3. To triangulate it,
we can add the edge (Y
1
, Y
3
) or (Y
2
, Y
4
). In general, there are many possible sets of edges
that can be added to triangulate a graph. The inference procedure creates a tree of cliques
using the graph augmented by triangulation. The critical property of a triangulation for the
inference procedure is the size of the largest clique.
Deﬁnition 3.3.3 (Treewidth of a graph) The treewidth of a triangulated graph ( is the
size of its largest clique minus 1. The treewidth of an untriangulated graph ( is the
minimum treewidth of all triangulations of (.
3.3. MARKOV NETWORKS 33
The treewidth of a chain or a tree is 1 and the treewidth of Fig. 3.3 is 2. Finding the mini
mum treewidth triangulation of a general graph is NPhard, but good heuristic algorithms
exist [Cowell et al., 1999].
The inference procedure is based on a data structure called junction tree that can be
constructed for a triangulated graph. The junction tree is an alternative representation of
the same distribution that allows simple dynamic programming inference similar to the
Viterbi algorithm for chains.
Deﬁnition 3.3.4 (Junction tree) A junction tree T = (1, c) for a triangulated graph ( is
a tree in which the nodes are a subset of the cliques of the graph, 1 ⊆ ((() and the edges
c satisfy the running intersection property: for any two cliques c and c
t
, the variables in
the intersection c ∩ c
t
are contained in the clique of every node of the tree on the (unique)
path between c and c
t
.
Fig. 3.4 shows a junction tree for the diamond network. Each of the original clique poten
tials must associated with exactly one node in the junction tree. For example, the potentials
for the ¦Y
1
, Y
3
, Y
4
¦ and ¦Y
1
, Y
3
, Y
4
¦ nodes are the product of the associated clique poten
tials:
φ
134
(Y
1
, Y
3
, Y
4
) = φ
1
(Y
1
)φ
4
(Y
4
)φ
14
(Y
1
, Y
4
)φ
34
(Y
3
, Y
4
),
φ
123
(Y
1
, Y
2
, Y
3
) = φ
2
(Y
2
)φ
3
(Y
3
)φ
12
(Y
1
, Y
2
)φ
23
(Y
2
, Y
3
).
Algorithms for constructing junction trees from triangulated graphs are described in detail
in Cowell et al. [1999].
The Viterbi algorithm for junction trees picks an arbitrary root r for the tree T and
proceeds recursively from the leaves to compute the highest scoring subtree at a node by
combining the subtrees with highest score from its children. We denote the leaves of the
tree as Lv(T ) and the children of node c (relative to the root r) as Ch
r
(c):
φ
∗
l
(y
l
) = φ
l
(x, y
l
), ∀l ∈ Lv(T ), ∀y
l
∈ ¸
l
;
φ
∗
c
(y
c
) = φ
c
(x, y
c
)
c
∈Ch
r
(c)
max
y
c
∼y
c
φ
∗
c
(y
c
), ∀c ∈ 1(T ) ¸ Lv(T ), ∀y
c
∈ ¸
c
,
34 CHAPTER 3. STRUCTURED MODELS
Figure 3.4: Diamond network junction tree. Each of the original potentials is associated
with a node in the tree.
where y
c
∼ y
c
denotes whether the partial assignment y
c
is consistent with the partial
assignment y
c
on the variables in the intersection of c and c
t
. The highest score is given by
max
y
r
φ
∗
r
(y
r
). Using the arg max’s of the max’s in the computation of φ
∗
, we can back
trace the highest scoring assignment itself. Note that this algorithm is exponential in the
treewidth, the size of the largest clique. Similar type of computations using the junction
tree can be used to compute the partition function Z
w
(x) (by simply replacing max by
)
as well as marginal probabilities P(y
c
[x) for the cliques of the graph [Cowell et al., 1999].
3.3.3 Linear programming MAP inference
In this section, we present an alternative inference method based on linear programming.
Although solving the MAP inference using a general LP solver is less efﬁcient than the
dynamic programming algorithms above, this formulation is crucial in viewing Markov
networks in a uniﬁed framework of the structured models we consider and to our develop
ment of common estimation methods in later chapters. Let us begin with a linear integer
program to compute the optimal assignment y. We represent an assignment as a set binary
variables µ
c
(y
c
), one for each clique c and each value of the clique y
c
, that denotes whether
the assignment has that value, such that:
log
c
φ
c
(x, y
c
) =
c,y
c
µ
c
(y
c
) log φ
c
(x, y
c
).
3.3. MARKOV NETWORKS 35
0 0 0 0
0 0 1 0
0 0 0 0
0 0 0 0
0 0 0 0
0 0 1 0
0 0 0 0
0 0 0 0
0
1
0
0
0
1
0
0
0 0 1 0 0 0 1 0
Figure 3.5: Example of marginal agreement: row sums of µ
12
(y
1
, y
2
) agree with µ
1
(y
1
),
column sums agree with µ
2
(y
2
).
We call these variables marginals, as they correspond to the marginals of a distribution that
has all of its mass centered on the MAP instantiation (assuming it is unique). There are
several elementary constraints that such marginals satisfy. First, they must sum to one for
each clique. Second, the marginals for cliques that share variables are consistent. For any
clique c ∈ ( and a subclique s ⊂ c, the assignment of the subclique, µ
s
(y
s
), must be
consistent with the assignment of the clique, µ
c
(y
c
). Together, these constraints deﬁne a
linear integer program:
max
c,y
c
µ
c
(y
c
) log φ
c
(x, y
c
) (3.2)
s.t.
y
c
µ
c
(y
c
) = 1, ∀c ∈ (; µ
c
(y
c
) ∈ ¦0, 1¦, ∀c ∈ (, ∀y
c
;
µ
s
(y
s
) =
y
c
∼y
s
µ
c
(y
t
c
), ∀s, c ∈ (, s ⊂ c, ∀y
s
.
For example, in case the network is a chain or a tree, we will have node and edge marginals
that sum to 1 and agree with each other as in Fig. 3.5.
Clearly, for any assignment y
t
, we can deﬁne µ
c
(y
c
) variables that satisfy the above
constraints by setting µ
c
(y
c
) = 1I(y
t
c
= y
c
). We can also show that converse is true: any
valid setting of µ
c
(y
c
) corresponds to a valid assignment y. In fact,
36 CHAPTER 3. STRUCTURED MODELS
Lemma 3.3.5 For a triangulated network with unique MAP assignment, the integrality
constraint in the integer program in Eq. (3.2) can be relaxed and the resulting LP is guar
anteed to have integer solutions.
A proof of this lemma appears in Wainwright et al. [2002]. Intuitively, the constraints force
the marginals µ
c
(y
c
) to correspond to some valid joint distribution over the assignments.
The optimal distribution with the respect to the objective puts all its mass on the MAP
assignment. If the MAP assignment is not unique, the value of the LP is the same as
the value of the integer program, and any linear combination of the MAP assignments
maximizes the LP.
In case the network is not triangulated, the set of marginals is not guaranteed to rep
resent a valid distribution. Consider, for example, the diamond network in Fig. 3.3 with
binary variables, with the following edge marginals that are consistent with the constraints:
µ
12
(0, 0) = µ
12
(1, 1) = 0.5, µ
12
(1, 0) = µ
12
(0, 1) = 0;
µ
23
(0, 0) = µ
23
(1, 1) = 0.5, µ
23
(1, 0) = µ
23
(0, 1) = 0;
µ
34
(0, 0) = µ
34
(1, 1) = 0.5, µ
34
(1, 0) = µ
34
(0, 1) = 0;
µ
14
(0, 0) = µ
34
(1, 1) = 0, µ
14
(1, 0) = µ
14
(0, 1) = 0.5.
The corresponding node marginals must all be set to 0.5. Note that the edge marginals for
(1, 2), (2, 3), (3, 4) disallow any assignment other than 0000 or 1111, but the edge marginal
for (1, 4) disallows any assignment that has Y
1
= Y
4
. Hence this set of marginals dis
allows all assignments. If we triangulate the graph and add the cliques ¦Y
1
, Y
2
, Y
3
¦ and
¦Y
1
, Y
3
, Y
4
¦ with their corresponding constraints, the above marginals will be disallowed.
In graphs where triangulation produces very large cliques, exact inference is intractable.
We can resort to the above LP without triangulation as an approximate inference procedure
(augmented with some procedure for rounding possibly fractional solutions). In Ch. 7, we
discuss another subclass of networks where MAP inference using LPs is tractable for any
network topology, but with a restricted type of potentials.
3.4. CONTEXT FREE GRAMMARS 37
Figure 3.6: Example parse tree from Penn Treebank [Marcus et al., 1993].
3.4 Context free grammars
Contextfree grammars are one of the primary formalisms for capturing the recursive struc
ture of syntactic constructions [Manning & Sch¨ utze, 1999]. For example, Fig. 3.6 shows
a parse tree for the sentence The screen was a sea of red. This tree is from the Penn Tree
bank [Marcus et al., 1993], a primary linguistic resource for expertannotated English text.
The nonterminal symbols (labels of internal nodes) correspond to syntactic categories such
as noun phrase (NP), verbal phrase (VP) or prepositional phrase (PP) and partofspeech
tags like nouns (NN), verbs (VBD), determiners (DT) and prepositions (IN). The terminal
symbols (leaves) are the words of the sentence.
For clarity of presentation, we restrict our grammars to be in Chomsky normal form
2
(CNF),
where all rules in the grammar are of the form: A →B C and A →D, where A, B and C
are nonterminal symbols, and D is a terminal symbol.
Deﬁnition 3.4.1 (CFG) A CFG ( consists of:
◦ A set of nonterminal symbols, ^
◦ A designated set of start symbols, ^
S
⊆ ^
2
Any CFG can be represented by another CFG in CNF that generates the same set of sentences.
38 CHAPTER 3. STRUCTURED MODELS
◦ A set of terminal symbols, T
◦ A set of productions, T = ¦T
B
, T
U
¦, divided into
Binary productions, T
B
= ¦A →B C : A, B, C ∈ ^¦ and
Unary productions, T
U
= ¦A →D : A ∈ ^, D ∈ T ¦.
Consider a very simple grammar:
◦ ^ = ¦S, NP, VP, PP, NN, VBD, DT, IN¦
◦ ^
S
= ¦S¦
◦ T = ¦The, the, cat, dog, tree, saw, from¦
◦ T
B
= ¦S → NP VP, NP → DT NN, NP → NP PP, VP → VBD NP,
VP →VP PP, PP →IN NP¦.
◦ T
U
= ¦DT → The, DT → the, NN → cat, NN → dog, NN → tree, VBD → saw,
IN → from¦
A grammar generates a sentence by starting with a symbol in ^
S
and applying the
productions in T to rewrite nonterminal symbols. For example, we can generate The cat
saw the dog by starting with S → NP VP, rewriting the NP as NP → DT NN with DT →
The and NN → cat, then rewriting the VP as VP → VBD NP with VBD → saw, again
using NP → DT NN, but now with DT → the and NN → dog. We can represent such
derivations using trees like in Fig. 3.6 or (more compactly) using bracketed expressions
like the one below:
[[The
DT
cat
NN
]
NP
[saw
VBD
[the
DT
dog
NN
]
NP
]
VP
]
S
.
The simple grammar above can generate sentences of arbitrary length, since it has sev
eral recursive productions. It can also generate the same sentence several ways. In general,
there are exponentially many parse trees that produce a sentence of length l. Consider the
sentence The cat saw the dog from the tree. The likely analysis of the sentence is that
the cat, sitting in the tree, saw the dog. An unlikely but possible alternative is that the cat
3.4. CONTEXT FREE GRAMMARS 39
actually saw the dog who lived near the tree or was tied to it in the past. Our grammar
allows both interpretations, with the difference being in the analysis of the toplevel VP:
[saw
VBD
[the
DT
dog
NN
]
NP
]
VP
[[from
IN
[the
DT
tree
NN
]
NP
]
PP
,
saw
VBD
[[the
DT
dog
NN
]
NP
[from
IN
[the
DT
tree
NN
]
NP
]
PP
]
NP
.
This kind of ambiguity, called prepositional attachment, is very common in many re
alistic grammars. A standard approach to resolving ambiguity is to use a PCFG to deﬁne
a joint probability distribution over the space of parse trees ¸ and sentences A. Standard
PCFG parsers use a Viterbistyle algorithm to compute arg max
y
P(x, y) as the most likely
parse tree for a sentence x. The distribution P(x, y) is deﬁned by assigning a probability
to each production and making sure that the sum of probabilities of all productions starting
with a each symbol is 1:
B,C:A→B C∈1
B
P(A →B C) = 1,
D:A→D∈1
U
P(A → D ) = 1, ∀A ∈ ^.
We also need to assign a probability to the different starting symbols P(A) ∈ ^
S
such that
A∈A
S
P(A) = 1. The probability of a tree is simply the product of probabilities of the
productions used in the tree (times the probability of the starting symbol). Hence the log
probability of a tree is a sum of the logprobabilities of its productions. By letting our basis
functions f (x, y) consist of the counts of the productions and w be their logprobabilities,
we can cast PCFG as a structured linear model (in log space). In Ch. 9, we will show how
to represent a parse tree as an assignment of variables Y with appropriate constraints to
express PCFGS (and more generally weighted CFGs) in the form of Eq. (3.1) as
h
w
(x) = arg max
y : g(x,y)≤0
w
¯
f (x, y),
and describe the associated algorithm to compute the highest scoring parse tree y given a
sentence x.
40 CHAPTER 3. STRUCTURED MODELS
3.5 Combinatorial problems
Many important computational tasks are formulated as combinatorial optimization prob
lems such as the maximum weight bipartite and perfect matching, spanning tree, graphcut,
edgecover, binpacking, and many others [Lawler, 1976; Papadimitriou & Steiglitz, 1982;
Cormen et al., 2001]. These problems arise in applications such as resource allocation,
job assignment, routing, scheduling, network design and many more. In some domains,
the weights of the objective function in the optimization problem are simple and natural
to deﬁne (for example, Euclidian distance or temporal latency), but in many others, con
structing the weights is an important and laborintensive design task. Treated abstractly, a
combinatorial space of structures, such as matchings or graphcuts or trees), together with
a scoring scheme that assigns weights to candidate outputs is a kind of a model.
As a particularly simple and relevant example, consider modeling the task of assigning
reviewers to papers as a maximum weight bipartite matching problem, where the weights
represent the “expertise” of each reviewer for each paper. More speciﬁcally, suppose we
would like to have R reviewers per paper, and that each reviewer be assigned at most P pa
pers. For each paper and reviewer, we have an a weight q
jk
indicating the qualiﬁcation level
of reviewer j for evaluating paper k. Our objective is to ﬁnd an assignment for reviewers
to papers that maximizes the total weight. We represent a matching with a set of binary
variables y
jk
that take the value 1 if reviewer j is assigned to paper k, and 0 otherwise. The
bipartite matching problem can be solved using a combinatorial algorithm or the following
linear program:
max
j,k
µ
jk
q
jk
(3.3)
s.t.
j
µ
jk
= R,
k
µ
jk
≤ P, 0 ≤ µ
jk
≤ 1.
This LP is guaranteed to produce integer solutions (as long as P and R are integers) for
any weights q(y) [Nemhauser & Wolsey, 1999].
The quality of the solution found depends critically on the choice of weights that de
ﬁne the objective. A simple scheme could measure the “expertise” as the percent of word
3.5. COMBINATORIAL PROBLEMS 41
overlap in the reviewer’s home page and the paper’s abstract. However, we would want to
weight certain words much more (words that are relevant to the subject and infrequent).
Constructing and tuning the weights for a problem is a difﬁcult and timeconsuming pro
cess, just as it is for Markov networks for handwriting recognition.
As usual, we will represent the objective q(y) as a weighted combination of a set of
basis functions w
¯
f (x, y). Let x
jk
denote the intersection of the set of words occurring in
webpage(j)∩abstract(k), the web page of a reviewer j and the abstract of the paper k. We
can deﬁne f
d
(x, y) =
jk
y
jk
1I(word
d
∈ x
jk
), the number of times word d was in both
the web page of a reviewer and the abstract of the paper that were matched in y. Then the
score q
jk
is simply q
jk
=
d
w
d
1I(word
d
∈ x
jk
), a weighted combination of overlapping
words. In the next chapter we will show how to learn the parameters w in much the same
way we learn the parameters w of a Markov network.
The space of bipartite matchings illustrates an important property of many structured
spaces: the maximization problem arg max
y∈¸
w
¯
f (x, y) is easier than the normalization
problem
y∈¸
exp¦w
¯
f (x, y)¦. The maximum weight bipartite matching can be found
in polynomial (cubic) time in the number of nodes in the graph using a combinatorial algo
rithm. However, even simply counting the number of matchings is #Pcomplete [Valiant,
1979; Garey & Johnson, 1979]. Note that counting is easier than normalization, which is
essentially weighted counting. This fact makes a probabilistic interpretation of the model as
a distribution over matchings intractable to compute. Similarly, exact maximum likelihood
estimation is intractable, since it requires computing the normalization.
Chapter 4
Structured maximum margin estimation
In the previous chapter, we described several important types of structured models of the
form:
h
w
(x) = arg max
y: g(x,y)≤0
w
¯
f (x, y), (4.1)
where we assume that the optimization problem max
y : g(x,y)≤0
w
¯
f (x, y) can be solved
or approximated by a compact convex optimization problem for some convex subset of
parameters w ∈ ¼. A compact problem formulation is polynomial in the description
length of the objective and the constraints.
Given a sample S = ¦(x
(i)
, y
(i)
)¦
m
i=1
, we develop methods for ﬁnding parameters w
such that:
arg max
y∈¸
(i)
w
¯
f (x
(i)
, y) ≈ y
(i)
, ∀i,
where ¸
(i)
= ¦y : g(x
(i)
, y) ≤ 0¦. In this chapter, we describe at an abstract level two
general approaches to structured estimation that we apply in the rest of the thesis. Both of
these approaches deﬁne a convex optimization problem for ﬁnding such parameters w.
There are several reasons to derive compact convex formulations. First and foremost,
we can ﬁnd globally optimal parameters (with ﬁxed precision) in polynomial time. Sec
ond, we can use standard optimization software to solve the problem. Although special
purpose algorithms that exploit the structure of a particular problem are often much faster
42
4.1. MAXMARGIN ESTIMATION 43
(see Ch. 6), the availability of offtheshelf software is very important for quick develop
ment and testing of such models. Third, we can analyze the generalization performance of
the framework without worrying about the actual algorithms used to carry out the optimiza
tion and the associated woes of intractable optimization problems: local minima, greedy
and heuristic methods, etc.
Our framework applies not only to the standard models typically estimated by prob
abilistic methods, such as Markov networks and contextfree grammars, but also to a
wide range of “unconventional” predictive models. Such models include graph cuts and
weighted matchings, where maximum likelihood estimation is intractable. We provide ex
act maximum margin solutions for several of these problems (Ch. 7 and Ch. 10).
In prediction problems where the maximization in Eq. (4.1) is intractable, we consider
convex programs that provide only an upper or lower bound on the true solution. We
discuss how to use these approximate solutions for approximate learning of parameters.
4.1 Maxmargin estimation
As in the univariate prediction, we measure the error of approximation using a loss func
tion . In structured problems, where we are jointly predicting multiple variables, the loss
is often not just the simple 01 loss or squared error. For structured classiﬁcation, a natural
loss function is a kind of Hamming distance between y
(i)
and h(x
(i)
): the number of vari
ables predicted incorrectly. We will explore these and more general loss functions in the
following chapters.
4.1.1 Minmax formulation
Throughout, we will adopt the hinge upper bound
i
(h(x
(i)
)) on the loss function for struc
tured classiﬁcation inspired by maxmargin criterion:
i
(h(x
(i)
)) = max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)] −w
¯
f
i
(y
(i)
) ≥
i
(h(x
(i)
)),
44 CHAPTER 4. STRUCTURED MAXIMUM MARGIN ESTIMATION
where as before,
i
(h(x
(i)
)) = (x
(i)
, y
(i)
, h(x
(i)
)),
i
(h(x
(i)
)) = (x
(i)
, y
(i)
, h(x
(i)
)), and
f
i
(y) = f (x
(i)
, y). With this upper bound, the minmax formulation for structured classiﬁ
cation problem is analogous to multiclass SVM formulation in Eq. (2.9) and Eq. (2.10):
min
1
2
[[w[[
2
+ C
i
ξ
i
(4.2)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)], ∀i.
The above formulation is a convex quadratic program in w, since max
y∈¸
(i) [w
¯
f
i
(y) +
i
(y)] is convex in w (maximum of afﬁne functions is a convex function). For brevity, we
did not explicitly include the constraint that the parameters are in some legal convex set
(w ∈ ¼, most often IR
n
), but assume this throughout this chapter.
The problem with Eq. (4.2) is that the constraints have a very unwieldy form. An
other way to express this problem is using
i
[¸
(i)
[ linear constraints, which is generally
exponential in L
i
, the number of variables in y
i
.
min
1
2
[[w[[
2
+ C
i
ξ
i
(4.3)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ w
¯
f
i
(y) +
i
(y), ∀i, ∀y ∈ ¸
(i)
.
This form reveals the “maximum margin” nature of the formulation. We can interpret
1
[[w[[
w
¯
[f
i
(y
(i)
) − f
i
(y)] as the margin of y
(i)
over another y ∈ ¸
(i)
. Assuming ξ
i
are all
zero (say because C is very large), the constraints enforce
w
¯
f
i
(y
(i)
) −w
¯
f
i
(y) ≥
i
(y),
so minimizing [[w[[ maximizes the smallest such margin, scaled by the loss
i
(y). The
slack variables ξ
i
allow for violations of the constraints at a cost Cξ
i
. If the loss function is
not uniform over all the mistakes y ,= y
(i)
, then the constraints make costly mistakes (those
with high
i
(y)) less likely. In Ch. 5 we analyze the effect of nonuniform loss function
(Hamming distance type loss) on generalization, and show a strong connection between the
lossscaled margin and expected risk of the learned model.
The formulation in Eq. (4.3) is a standard QP with linear constraints, but its exponential
4.1. MAXMARGIN ESTIMATION 45
size is in general prohibitive. We now return to Eq. (4.2) and transform it to a a more man
ageable problem. The key to solving Eq. (4.2) efﬁciently is the lossaugmented inference
max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)]. (4.4)
Even if max
y∈¸
(i) w
¯
f
i
(y) can be solved in polynomial time using convex optimization, the
form of the loss term
i
(y) is crucial for the lossaugmented inference to remain tractable.
The range of tractable losses will depend strongly on the problem itself (f and ¸). Even
within the range of tractable losses, some are more efﬁciently computable than others. A
large part of the development of structured estimation methods in the following chapters
is identifying appropriate loss functions for the application and designing convex formula
tions for the lossaugmented inference.
Assume that we ﬁnd such a formulation in terms of a set of variables µ
i
, with a concave
(in µ
i
) objective
¯
f
i
(w, µ
i
) and subject to convex constraints ¯ g
i
(µ
i
):
max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)] = max
µ
i
: g
i
(µ
i
)≤0
¯
f
i
(w, µ
i
). (4.5)
We call such formulation compact if the number of variables µ
i
and constraints ¯ g
i
(µ
i
) is
polynomial in L
i
, the number of variables in y
(i)
.
Note that max
µ
i
: g
i
(µ
i
)≤0
¯
f
i
(w, µ
i
) must be convex in w, since Eq. (4.4) is. Likewise,
we can assume that it is feasible and bounded if Eq. (4.4) is. In the next section, we de
velop a maxmargin formulation that uses Lagrangian duality (see [Boyd & Vandenberghe,
2004] for an excellent review) to deﬁne a joint, compact convex problem for estimating the
parameters w.
To make the symbols concrete, consider the example of the reviewerassignment prob
lem we discussed in the previous chapter: we would like a bipartite matching with R re
viewers per paper and at most P papers per reviewer. Each training sample i consists of a
matching of N
(i)
p
papers and N
(i)
r
reviewers from some previous year. Let x
jk
denote the
intersection of the set of words occurring in the web page of a reviewer j and the abstract of
the paper k. Let y
jk
indicate whether reviewer j is matched to the paper k. We can deﬁne
a basis function f
d
(x
jk
, y
jk
) = y
jk
1I(word
d
∈ x
jk
), which indicates whether the word d is
46 CHAPTER 4. STRUCTURED MAXIMUM MARGIN ESTIMATION
in both the web page of a reviewer and the abstract of the paper that are matched in y. We
abbreviate the vector of all the basis functions for each edge jk as y
jk
f
(i)
jk
= f (x
(i)
jk
, y
jk
).
We assume that the loss function decomposes over the variables y
ij
. For example, the
Hamming loss simply counts the number of different edges in the matchings y and y
(i)
:
H
i
(y) =
jk
0/1
i,jk
(y
jk
) =
jk
1I(y
jk
,= y
(i)
jk
) = RN
(i)
p
−
jk
y
jk
y
(i)
jk
.
The last equality follows from the fact that any valid matching for example i has R review
ers for N
(i)
p
papers, hence RN
(i)
p
−
jk
y
jk
y
(i)
jk
represents exactly the number of edges that
are different between y and y
(i)
. Combining the two pieces, we have
w
¯
f (x
(i)
, y) =
jk
[w
¯
f (x
jk
, y
jk
) +
0/1
i,jk
(y
jk
)] = RN
(i)
p
+
jk
y
jk
[w
¯
f
jk
−y
(i)
jk
].
The lossaugmented inference problem can be then written as an LP in µ
i
similar
to Eq. (3.3) (without the constant term RN
(i)
p
):
max
jk
µ
i,jk
[w
¯
f
jk
−y
(i)
jk
]
s.t.
j
µ
i,jk
= R,
k
µ
i,jk
≤ P, 0 ≤ µ
i,jk
≤ 1.
In terms of Eq. (4.5),
¯
f
i
and ¯ g
i
are afﬁne in µ
i
:
¯
f
i
(w, µ
i
) = RN
(i)
p
+
i,j
µ
i,jk
[w
¯
f
jk
−y
(i)
jk
]
and ¯ g
i
(µ
i
) ≤ 0 ⇔
j
µ
i,jk
= R,
k
µ
i,jk
≤ P, 0 ≤ µ
i,jk
≤ 1.
In general, when we can express max
y∈¸
(i) w
¯
f (x
(i)
, y) as an LP and we use a loss
function this is linear in the number of mistakes, we have a linear program of this form for
the lossaugmented inference:
d
i
+ max (F
i
w+c
i
)
¯
µ
i
s.t. A
i
µ
i
≤ b
i
, µ
i
≥ 0, (4.6)
for appropriately deﬁned d
i
, F
i
, c
i
, A
i
, b
i
, which depend only on x
(i)
, y
(i)
, f (x, y) and
g(x, y). Note that the dependence on w is linear and only in the objective of the LP. If
this LP is compact (the number of variables and constraints is polynomial in the number of
4.1. MAXMARGIN ESTIMATION 47
label variables), then we can use it to solve the maxmargin estimation problem efﬁciently
by using convex duality.
The Lagrangian associated with Eq. (4.4) is given by
L
i,w
(µ
i
, λ
i
) =
¯
f
i
(w, µ
i
) −λ
¯
i
¯ g
i
(µ
i
), (4.7)
where λ
i
≥ 0 is a vector of Lagrange multipliers, one for each constraint function in
¯ g
i
(µ
i
). Since we assume that
¯
f
i
(w, µ
i
) is concave in µ
i
and bounded on the nonempty set
µ
i
: ¯ g
i
(µ
i
) ≤ 0, we have strong duality:
max
µ
i
: g
i
(µ
i
)≤0
¯
f
i
(w, µ
i
) = min
λ
i
≥0
max
µ
i
L
i,w
(µ
i
, λ
i
).
For many forms of
¯
f and ¯ g, we can write the Lagrangian dual min
λ
i
≥0
max
µ
i
L
i,w
(µ
i
, λ
i
)
explicitly as:
min h
i
(w, λ
i
) (4.8)
s.t. q
i
(w, λ
i
) ≤ 0,
where h
i
(w, λ
i
) and q
i
(w, λ
i
) are convex in both w and λ
i
. (We folded λ
i
≥ 0 into
q
i
(w, λ
i
) for brevity.) Since the original problem had polynomial size, the dual is polyno
mial size as well. For example, the dual of the LP in Eq. (4.6) is
d
i
+ min b
¯
i
λ
i
s.t. A
¯
i
λ
i
≥ F
i
w+c
i
, λ
i
≥ 0, (4.9)
where h
i
(w, λ
i
) = d
i
+b
¯
i
λ
i
and q
i
(w, λ
i
) ≤ 0 is ¦F
i
w+c
i
−A
¯
i
λ
i
≤ 0, −λ
i
≤ 0¦.
Plugging Eq. (4.8) into Eq. (4.2), we get
min
1
2
[[w[[
2
+ C
i
ξ
i
(4.10)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ min
q
i
(w,λ
i
)≤0
h
i
(w, λ
i
), ∀i.
Moreover, we can combine the minimization over λ with minimization over ¦w, ξ¦. The
48 CHAPTER 4. STRUCTURED MAXIMUM MARGIN ESTIMATION
reason for this is that if the right hand side is not at the minimum, the constraint is tighter
than necessary, leading to a suboptimal solution w. Optimizing jointly over λ as well will
produce a solution to ¦w, ξ¦ that is optimal.
min
1
2
[[w[[
2
+ C
i
ξ
i
(4.11)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ h
i
(w, λ
i
), ∀i;
q
i
(w, λ
i
) ≤ 0, ∀i.
Hence we have a joint and compact convex optimization program for estimating w.
The exact form of this program depends strongly on
¯
f and ¯ g. For our LPbased example,
we have a QP with linear constraints:
min
1
2
[[w[[
2
+ C
i
ξ
i
(4.12)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ d
i
+b
¯
i
λ
i
, ∀i;
A
¯
i
λ
i
≥ F
i
w+c
i
, ∀i;
λ
i
≥ 0, ∀i.
4.1.2 Certiﬁcate formulation
In the previous section, we assumed a compact convex formulation of the lossaugmented
max in Eq. (4.4). There are several important combinatorial problems which allow poly
nomial time solution yet do not have a compact convex optimization formulation. For
example, maximum weight perfect (nonbipartite) matching and spanning tree problems
can be expressed as linear programs with exponentially many constraints, but no polyno
mial formulation is known [Bertsimas & Tsitsiklis, 1997; Schrijver, 2003]. Both of these
problems, however, can be solved in polynomial time using combinatorial algorithms. In
some cases, though, we can ﬁnd a compact certiﬁcate of optimality that guarantees that
y
(i)
= arg max
y
[w
¯
f
i
(y) +
i
(y)] without expressing lossaugmented inference as a com
pact convex program. Intuitively, just verifying that a given assignment is optimal is some
times easier than actually ﬁnding it.
4.1. MAXMARGIN ESTIMATION 49
Consider the maximum weight spanning tree problem. A basic property of a span
ning tree is that cutting any edge (j, k) in the tree creates two disconnected sets of nodes
(1
j
[jk], 1
k
[jk]), where j ∈ 1
j
[jk] and k ∈ 1
k
[jk]. A spanning tree is optimal with respect
to a set of edge weights if and only if for every edge (j, k) in the tree connecting 1
j
[jk] and
1
k
[jk], the weight of (j, k) is larger than (or equal to) the weight of any other edge (j
t
, k
t
)
in the graph with j
t
∈ 1
j
[jk], k
t
∈ 1
k
[jk] [Cormen et al., 2001]. We discuss the conditions
for optimality of perfect matchings in Ch. 10. Suppose that we can ﬁnd a compact convex
formulation of these conditions via a polynomial (in L
i
) set of functions q
i
(w, ν
i
), jointly
convex in w and auxiliary variables ν
i
:
∃ν
i
s.t. q
i
(w, ν
i
) ≤ 0 ⇔ w
¯
f
i
(y
(i)
) ≥ w
¯
f
i
(y) +
i
(y), ∀y ∈ ¸
(i)
.
Then the following joint convex program in wand ν computes the maxmargin parameters:
min
1
2
[[w[[
2
(4.13)
s.t. q
i
(w, ν
i
) ≤ 0, ∀i.
Expressing the spanning tree optimality does not require additional variables ν
i
, but in
other problems, such as in perfect matching optimality in Ch. 10, such auxiliary variables
are needed. In the spanning tree problem, suppose y
jk
encodes whether edge (j, k) is in
the tree and the score of the edge is given by w
¯
f
i,jk
for some basis functions f (x
(i)
jk
, y
jk
).
We also assume that the loss function decomposes into a sum of losses over the edges, with
loss for each wrong edge given by
i,jk
. Then the optimality conditions are:
w
¯
f
i,jk
≥ w
¯
f
i,j
k
+
i,j
k
, ∀jk, j
t
k
t
s.t. y
(i)
jk
= 1, j
t
∈ 1
j
[jk], k
t
∈ 1
k
[jk].
For a full graph, we have
_
[1
(i)
[
3
) constraints for each example i, where [1
(i)
[ is the number
of nodes in the graph for example i.
Note that this formulation does not allow for violations of the margin constraints (it has
no slack variables ξ
i
). If the basis functions are not sufﬁciently rich to ensure that each y
(i)
is optimal, then Eq. (4.1.2) may be infeasible. Essentially, this formulation requires that
the upper bound on the empirical risk be zero, 1
S
[h
w
] = 0, and minimizes the complexity
50 CHAPTER 4. STRUCTURED MAXIMUM MARGIN ESTIMATION
of the hypothesis h
w
as measured by the norm of the weights.
If the problem is infeasible, the designer could add more basis functions f (x, y) that
take into account additional information about x. One could also add slack variables for
each example and each constraint that would allow violations of optimality conditions with
some penalty. However, these slack variables would not represent upper bounds on the loss
as they are in the minmax formulation, and therefore are less justiﬁed.
4.2 Approximations: upper and lower bounds
There are structured prediction tasks for which we might not be able to solve the estimation
problem exactly. Often, we cannot compute max
y∈¸
(i) [w
¯
f
i
(y) +
i
(y)] exactly or explic
itly, but can only upper or lower bound it. Fig. 4.1 shows schematically how approximating
of the max subproblem reduces or extends the feasible space of w and ξ and leads to ap
proximate solutions. The nature of these lower and upper bounds depends on the problem,
but we consider two general cases below.
4.2.1 Constraint generation
When neither compact maximization or optimality formulation is possible, but the max
imization problem can be solved or approximated by a combinatorial algorithm, we can
resort to constraint generation or cutting plane methods. Consider Eq. (4.3), where we
have an exponential number of linear constraints, one for each i and y ∈ ¸
(i)
. Only a sub
set of those constraints will be active at the optimal solution w. In fact, not more than the
number of parameters n plus the number of examples m can be active in general, since that
is the number of variables. If we can identify a small number of constraints that are critical
to the solution, we do not have to include all of them. Of course, identifying these con
straints is in general as difﬁcult as solving the problem, but a greedy approach of adding the
most violated constraints often achieves good approximate solutions after adding a small
(polynomial) number of constraints. If we continue adding constraints until there are no
more violated ones, the resulting solution is optimal.
We assume that we have an algorithm that produces y = arg max
y∈¸
(i) [w
¯
f
i
(y) +
4.2. APPROXIMATIONS: UPPER AND LOWER BOUNDS 51
Upperbound
Exact
Lowerbound
×
+
Figure 4.1: Exact and approximate constraints on the maxmargin quadratic program. The
solid red line represents the constraints imposed by the assignments y ∈ Y
(i)
, whereas the
dashed and dotted lines represent approximate constraints. The approximate constraints
may coincide with the exact constraints in some cases, and be more stringent or relaxed in
others. The parabolic contours represent the value of the objective function and ‘+’, ‘x’ and
‘o’ mark the different optima.
i
(y)]. The algorithm is described in Fig. 4.2. We maintain, for each example i, a small
but growing set of assignments
¯
¸
(i)
⊂ ¸
(i)
. At each iteration, we solve the problem with a
subset of constraints:
min
1
2
[[w[[
2
+ C
i
ξ
i
(4.14)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ w
¯
f
i
(y) +
i
(y), ∀i, ∀y ∈
¯
¸
(i)
.
The only difference between Eq. (4.3) and Eq. (4.14) is that ¸
(i)
has been replaced by
¯
¸
(i)
.
We then compute y = arg max
y∈¸
(i) [w
¯
f
i
(y) +
i
(y)] for each i and check whether the
constraint w
¯
f
i
(y
(i)
) + ξ
i
+ ≥ w
¯
f
i
(y) +
i
(y), is violated, where is a user deﬁned
precision parameter. If it is violated, we set
¯
¸
(i)
=
¯
¸
(i)
∪ y. The algorithm terminates
when no constraints are violated. In Fig. 4.1, the lowerbound on the constraints provided
by
¯
¸
(i)
∪y keeps tightening with each iteration, terminating when the desired precision is
reached. We note that if the algorithm that produces y = arg max
y∈¸
(i) [w
¯
f
i
(y)+
i
(y)] is
52 CHAPTER 4. STRUCTURED MAXIMUM MARGIN ESTIMATION
Input: precision parameter .
1. Initialize:
¯
¸
(i)
= ¦¦, ∀ i.
2. Set violation = 0 and solve for w and ξ by optimizing
min
1
2
[[w[[
2
+ C
i
ξ
i
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ w
¯
f
i
(y) +
i
(y), ∀i, ∀y ∈
¯
¸
(i)
.
3. For each i,
Compute y = arg max
y∈¸
(i) [w
¯
f
i
(y) +
i
(y)],
if w
¯
f
i
(y
(i)
) + ξ
i
+ ≤ w
¯
f
i
(y) +
i
(y),
then set
¯
¸
(i)
=
¯
¸
(i)
∪ y and violation = 1
4. if violation = 1 goto 2.
Return w.
Figure 4.2: A constraint generation algorithm.
suboptimal, the approximation error of the solution we achieve might be much greater than
. The number of constraints that must be added before the algorithm terminates depends
on the precision and problem speciﬁc characteristics. See [Bertsimas & Tsitsiklis, 1997;
Boyd & Vandenberghe, 2004] for a more indepth discussion of cutting planes methods.
This approach may also be computationally faster in providing a very good approximation
in practice if the explicit convex programming formulation is polynomial in size, but very
large, while the maximization algorithm is comparatively fast.
4.2.2 Constraint strengthening
In many problems, the maximization problem we are interested in may be very expensive
or intractable. For example, we consider MAP inference in large treewidth Markov net
works in Ch. 8, multiway cut in Ch. 7, graphpartitioning in Ch. 11. Many such problems
can be written as integer programs. Relaxations of such integer programs into LPs, QPs
or SDPs often provide excellent approximation algorithms [Hochbaum, 1997; Nemhauser
& Wolsey, 1999]. The relaxation usually deﬁnes a larger feasible space
¯
¸
(i)
⊃ ¸
(i)
over
4.3. RELATED WORK 53
which the maximization is done, where y ∈
¯
¸
(i)
may correspond to a “fractional” assign
ment. For example, a solution to the MAP LP in Eq. (3.2) for an untriangulated network
may not correspond to any valid assignment. In such a case, the approximation is an over
estimate of the constraints:
max
y∈
¸
(i)
[w
¯
f
i
(y) +
i
(y)] ≥ max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)].
Hence the constraint set is tightened with such invalid assignments. Fig. 4.1 shows how the
overestimate reduces the feasible space of w and ξ.
Note that for every setting of the weights w that produces fractional solutions for the
relaxation, the approximate constraints are tightened because of the additional invalid as
signments. In this case, the approximate MAP solution has higher value than any integer
solution, including the true assignment y
(i)
, thereby driving up the corresponding slack ξ
i
.
By contrast, for weights wfor which the MAP approximation is integervalued, the margin
has the standard interpretation as the difference between the score of y
(i)
and the MAP y
(according to w). As the objective includes a penalty for the slack variable, intuitively,
minimizing the objective tends to drive the weights w away from the regions where the so
lutions to the approximation are fractional. In essence, the estimation algorithm is ﬁnding
weights that are not necessarily optimal for an exact maximization algorithm, but (close to)
optimal for the particular approximate maximization algorithm used. In practice, we will
show experimentally that such approximations often work very well.
4.3 Related work
Our maxmargin formulation is related to a body of work called inverse combinatorial and
convex optimization [Burton & Toint, 1992; Zhang & Ma, 1996; Ahuja & Orlin, 2001;
Heuberger, 2004]. An inverse optimization problem is deﬁned by an instance of an opti
mization problem max
y∈¸
w
¯
f (y), a set of nominal weights w
0
, and a target solution y
t
.
The goal is to ﬁnd the weights w closest to the nominal w
0
in some norm, which make the
54 CHAPTER 4. STRUCTURED MAXIMUM MARGIN ESTIMATION
target solution optimal:
min [[w−w
0
[[
p
s.t. w
¯
f (y
t
) ≥ w
¯
f (y), ∀y ∈ ¸.
Most of the attention has been on L
1
and L
∞
norms, but L
2
norm is also used.
The study of inverse problems began with geophysical scientists (see [Tarantola, 1987]
for indepth discussion of a wide range of applications). Modeling a complex physical
system often involves a large number of parameters which scientists ﬁnd hard or impossible
to set correctly. Provided educated guesses for the parameters w
0
and the behavior of the
system as a target, the inverse optimization problem attempts to match the behavior while
not perturbing the “guesstimate” too much.
Although there is a strong connection between inverse optimization problems and our
formulations, the goals are very different than ours. In our framework, we are learning
a parameterized objective function that depends on the input x and will generalize well
in prediction on new instances. Moreover, we do not assume as given a nominal set of
weights. Note that if we set w
0
= 0, then w = 0 is trivially the optimal solution. The
solution w depends critically on the choice of nominal weights, which is not appropriate in
the learning setting.
The inverse reinforcement learning problem [Ng & Russell, 2000; Abbeel & Ng, 2004]
is much closer to our setting. The goal is to learn a reward function that will cause a rational
agent to act similar to the observed behavior of an expert. A full description of the problem
is beyond our scope, but we brieﬂy describe the Markov decision process (MDP) model
commonly used for sequential decision making problems where an agent interacts with its
environment. The environment is modeled as a system that can be in one of a set of discrete
states. At every time step, the agent chooses an action from a discrete set of actions and the
system transitions to a next state with a probability that depends on the current state and
the action taken. The agent collects a reward at each step, which generally depends on the
on the current and the next state and the action taken. A rational agent executes a policy
(essentially, a state to action mapping) that maximizes its expected reward. To map this
problem (approximately) to our setting, note that a policy roughly corresponds to the labels
4.4. CONCLUSION 55
y, the state sequence correspond to the input x and the reward for a state/action sequence is
assumed to be w
¯
f (x, y) for some basis functions w
¯
f (x, y). The goal is to learn wfroma
set of state/action sequences (x
(i)
, y
(i)
) of the expert such that the maximizing the expected
reward according to the system model makes the agent imitate the expert. This and related
problems are formulated as a convex program in Ng and Russell [2000] and Abbeel and
Ng [2004].
4.4 Conclusion
In this chapter, we presented two formulations of structured maxmargin estimation that
deﬁne a compact convex optimization problem. The ﬁrst formulation, minmax, relies on
the ability to express inference in the model as a compact convex optimization problem.
The second one, certiﬁcate, only requires expressing optimality of a given assignment ac
cording to the model. Our framework applies to a wide range of prediction problems that
we explore in the rest of the thesis, including Markov networks, context free grammars, and
many combinatorial structures such as matchings and graphcuts. The estimation problem
is tractable and exact whenever the prediction problem can be formulated as a compact
convex optimization problem or a polynomial time combinatorial algorithm with compact
convex optimality conditions. When the prediction problem is intractable or very expen
sive to solve exactly, we resort to approximations that only provide upper/lower bounds
on the predictions. The estimated parameters are then approximate, but produce accurate
approximate prediction models in practice.
Because our approach only relies using the maximum in the model for prediction, and
does not require a normalized distribution P(y [ x) over all outputs, maximum margin
estimation can be tractable when maximum likelihood is not. For example, to learn a prob
abilistic model P(y [ x) over bipartite matchings using maximum likelihood requires com
puting the normalizing partition function, which is #Pcomplete [Valiant, 1979; Garey &
Johnson, 1979]. By contrast, maximum margin estimation can be formulated as a compact
QP with linear constraints. Similar results hold for nonbipartite matchings and mincuts.
In models that are tractable for both maximum likelihood and maximum margin, (such
as lowtreewidth Markov networks, context free grammars, many other problems in which
56 CHAPTER 4. STRUCTURED MAXIMUM MARGIN ESTIMATION
inference is solvable by dynamic programming), our approach has an additional advantage.
Because of the hingeloss, the solutions to the estimation are relatively sparse in the dual
space (as in SVMs), which makes the use of kernels much more efﬁcient. Maximum like
lihood estimation with kernels results in models that are generally nonsparse and require
pruning or greedy support vector selection methods [Lafferty et al., 2004; Altun et al.,
2004].
The forthcoming formulations in the thesis follow the principles laid out in this chapter.
The range of applications of these principles is very broad and leads to estimation prob
lems with very interesting structure in each particular problem, from Markov networks and
contextfree grammars to graph cuts and perfect matchings.
Part II
Markov networks
57
Chapter 5
Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational
interactions in prediction problems arising in many ﬁelds. These problems involve labeling
a set of related objects that exhibit local consistency. In sequential labeling problems (such
as handwriting recognition), the labels (letters) of adjacent inputs (images) are highly corre
lated. Sequential prediction problems arise in natural language processing (partofspeech
tagging, speech recognition, information extraction [Manning & Sch¨ utze, 1999]), compu
tational biology (gene ﬁnding, protein structure prediction, sequence alignment [Durbin
et al., 1998]), and many other ﬁelds. In image processing, neighboring pixels exhibit spa
tial label coherence in denoising, segmentation and stereo correspondence [Besag, 1986;
Boykov et al., 1999a]. In hypertext or bibliographic classiﬁcation, labels of linked and
cocited documents tend to be similar [Chakrabarti et al., 1998; Taskar et al., 2002]. In
proteomic analysis, location and function of proteins that interact are often highly corre
lated [Vazquez et al., 2003]. Markov networks compactly represent complex joint distribu
tions of the label variables by modeling their local interactions. Such models are encoded
by a graph, whose nodes represent the different object labels, and whose edges represent
and quantify direct dependencies between them. For example, a Markov network for the
hypertext domain would include a node for each webpage, encoding its label, and an edge
between any pair of webpages whose labels are directly correlated (e.g., because one links
to the other).
We address the problem of maxmargin estimation the parameters of Markov networks
58
5.1. MAXIMUM LIKELIHOOD ESTIMATION 59
for such structured classiﬁcation problems. We show a compact convex formulation that
seamlessly integrates kernels with graphical models. We analyze the theoretical general
ization properties of maxmargin estimation and derive a novel marginbased bound for
structured classiﬁcation.
We are given a labeled training sample S = ¦(x
(i)
, y
(i)
)¦
m
i=1
, drawn from a ﬁxed dis
tribution D over A ¸. We assume the structure of the network is given: we have a
mapping from an input x to the corresponding Markov network graph ((x) = ¦1, c¦
where the nodes 1 map to the variables in y. We abbreviate ((x
(i)
) as (
(i)
below. In hand
writing recognition, this mapping depends on the segmentation algorithm that determines
how many letters the sample image contains and splits the image into individual images
for each letter. It also depends on the basis functions we use to model the dependencies of
the problem, for example, ﬁrstorder Markov chain or a higherorder models. Note that the
topology and size of the graph (
(i)
, might be different for each example i. For instance, the
training sequences might have different lengths.
We focus on conditional Markov networks (or CRFs [Lafferty et al., 2001]), which
represent P(y [ x) instead of generative models P(x, y). The loglinear representation we
have described in Sec. 3.3.1 is deﬁned via a vector of n basis functions f (x, y):
log P
w
(y [ x) = w
¯
f (x, y) −log Z
w
(x),
where Z
w
(x) =
y
exp¦w
¯
f (x, y)¦ and w ∈ IR
n
. Before we present the maximum
margin estimation, we review the standard maximum likelihood method.
5.1 Maximum likelihood estimation
The regularized maximum likelihood approach of learning the weights w of a Markov net
work is similar to logistic regression we described in Sec. 2.2. The objective is to minimize
the training logloss with an additional regularization term, usually the squarednorm of the
weights w [Lafferty et al., 2001]:
1
2
[[w[[
2
−C
i
log P
w
(y
(i)
[ x
(i)
) =
1
2
[[w[[
2
+ C
i
log Z
w
(x
(i)
) −w
¯
f
i
(y
(i)
),
60 CHAPTER 5. MARKOV NETWORKS
where f
i
(y) = f (x
(i)
, y).
This objective function is convex in the parameters w, so we have an unconstrained
convex optimization problem. The gradient with respect to w is given by:
w+ C
i
_
E
i,w
[f
i
(y)] −f
i
(y
(i)
)
¸
= w−C
i
E
i,w
[∆f
i
(y)],
where E
i,w
[f
i
(y)] =
y∈¸
f
i
(y)P
w
(y [ x
(i)
) is the expectation under the conditional dis
tribution P
w
(y [ x
(i)
) and ∆f
i
(y) = f (x
(i)
, y
(i)
) −f (x
(i)
, y), as before. To compute the ex
pectations, we can use inference in the Markov network to calculate marginals P
w
(y
c
[ x
(i)
)
for each clique c in the network Sec. 3.3.2. Since the basis functions decompose over the
cliques of the network, the expectation decomposes as well:
E
i,w
[f
i
(y)] =
c∈(
(i)
y
c
∈¸
(i)
c
f
i,c
(y
c
)P
w
(y
c
[ x
(i)
).
Second order methods for solving unconstrained convex optimization problems, such
as Newton’s method, require the second derivatives as well as the gradient. Let δf
i
(y) =
f
i
(y) − E
i,w
[f
i
(y)]. The Hessian of the objective depends on the covariances of the basis
functions:
I + C
i
E
i,w
_
δf
i
(y)δf
i
(y)
¯
¸
,
where I is a n n identity matrix. Computing the Hessian is more expensive than the
gradient, since we need to calculate joint marginals of every pair of cliques c and c
t
,
P
w
(y
c∪c
[ x
i
) as well as covariances of all basis functions, which is quadratic in the num
ber of cliques and the number of functions. A standard approach is to use an approximate
second order method that does not need to compute the Hessian, but uses only the gradient
information [Nocedal & Wright, 1999; Boyd & Vandenberghe, 2004]. Conjugate Gradients
or LBFGS methods have been shown to work very well on large estimation problems [Sha
& Pereira, 2003; Pinto et al., 2003], even with millions of parameters w.
5.2. MAXIMUM MARGIN ESTIMATION 61
5.2 Maximum margin estimation
For maximummargin estimation, we begin with the minmax formulation from Sec. 4.1:
min
1
2
[[w[[
2
+ C
i
ξ
i
(5.1)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ max
y
[w
¯
f
i
(y) +
i
(y)], ∀i.
We know from Sec. 3.3.3 how to express max
y
w
¯
f
i
(y) as an LP, but the important differ
ence is the loss function
i
. The simplest loss is the 0/1 loss
i
(y) ≡ 1I(y
(i)
,= y). In fact
this loss for sequence models was used by Collins [2001] and Altun et al. [2003]. However,
in structured problems, where we are predicting multiple labels, the loss is often not just
the simple 0/1 loss, but may depend on the number of labels and type of labels predicted
incorrectly or perhaps the number of cliques of labels predicted incorrectly. In general, we
assume that the loss, like the basis functions, decomposes over the cliques of labels.
Assumption 5.2.1 The loss function
i
(y) is decomposable:
i
(y) =
c∈((Ç
(i)
)
(x
(i)
c
, y
(i)
c
, y
c
) =
c∈((Ç
(i)
)
i,c
(y
c
).
We will focus on decomposable loss functions below. A natural choice that we use in our
experiments is the Hamming distance:
H
(x
(i)
, y
(i)
, y) =
v∈1
(i)
1I(y
(i)
v
,= y
v
).
With this assumption, we can express this inference problem for a triangulated graph
as a linear program for each example i as in Sec. 3.3.3:
max
c,y
c
µ
i,c
(y
c
)[w
¯
f
i,c
(y
c
) +
i,c
(y
c
)] (5.2)
s.t.
y
c
µ
i,c
(y
c
) = 1, ∀i, ∀c ∈ (
(i)
; µ
i,c
(y
c
) ≥ 0, ∀c ∈ (
(i)
, ∀y
c
;
µ
i,s
(y
s
) =
y
c
∼y
s
µ
i,c
(y
t
c
), ∀s, c ∈ (
(i)
, s ⊂ c, ∀y
s
,
62 CHAPTER 5. MARKOV NETWORKS
where (
(i)
= (((
(i)
) are the cliques of the Markov network for example i.
As we showed before, the constraints ensure that the µ
i
’s form a proper distribution. If
the most likely assignment is unique, then the distribution that maximizes the objective puts
all its weight on that assignment. (If the arg max is not unique, any convex combination of
the assignments is a valid solution). The dual of Eq. (5.2) is given by:
min
c
λ
i,c
(5.3)
s.t. λ
i,c
+
s⊃c
m
i,s,c
(y
c
) −
s⊂c, y
s
∼y
c
m
i,c,s
(y
t
s
) ≥ w
¯
f
i,c
(y
c
) +
i,c
(y
c
), ∀c ∈ (
(i)
, ∀y
c
.
In this dual, the λ
i,c
variables correspond to the normalization constraints, while m
i,c,s
(y
c
)
variables correspond to the agreement constraints in the primal in Eq. (5.2).
Plugging the dual into Eq. (5.1) for each example i and maximizing jointly over all the
variables (w, ξ, λ and m), we have:
min
1
2
[[w[[
2
+ C
i
ξ
i
(5.4)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥
i,c
λ
i,c
, ∀i;
λ
i,c
+
s⊃c
m
i,s,c
(y
c
) −
s⊂c, y
s
∼y
c
m
i,c,s
(y
t
s
) ≥ w
¯
f
i,c
(y
c
) +
i,c
(y
c
), ∀c ∈ (
(i)
, ∀y
c
.
In order to gain some intuition about this formulation, we make a change of variables from
λ
i,c
to ξ
i,c
:
λ
i,c
= w
¯
f
i,c
(y
(i)
c
) + ξ
i,c
, ∀i, ∀c ∈ (
(i)
.
The reason for naming the newvariables using the letter ξ will be clear in the following. For
readability, we also introduce variables that capture the effect of all the agreement variables
m:
M
i,c
(y
c
) =
s⊂c, y
s
∼y
c
m
i,c,s
(y
t
s
) −
s⊃c
m
i,s,c
(y
c
), ∀i, ∀c ∈ (
(i)
, ∀y
c
.
5.2. MAXIMUM MARGIN ESTIMATION 63
With these new variables, we have:
min
1
2
[[w[[
2
+ C
i
ξ
i
(5.5)
s.t. ξ
i
≥
c
ξ
i,c
, ∀i;
w
¯
f
i,c
(y
(i)
c
) + ξ
i,c
≥ w
¯
f
i,c
(y
c
) +
i,c
(y
c
) + M
i,c
(y
c
), ∀i, ∀c ∈ (
(i)
, ∀y
c
;
M
i,c
(y
c
) =
s⊂c, y
s
∼y
c
m
i,c,s
(y
t
s
) −
s⊃c
m
i,s,c
(y
c
), ∀i, ∀c ∈ (
(i)
, ∀y
c
.
Note that ξ
i
=
c
ξ
i,c
at the optimum, since the slack variable ξ
i
only appears only in the
constraint ξ
i
≥
c
ξ
i,c
and the objective minimizes Cξ
i
. Hence we can simply eliminate
this set of variables:
min
1
2
[[w[[
2
+ C
i,c
ξ
i,c
(5.6)
s.t. w
¯
f
i,c
(y
(i)
c
) + ξ
i,c
≥ w
¯
f
i,c
(y
c
) +
i,c
(y
c
) + M
i,c
(y
c
), ∀i, ∀c ∈ (
(i)
, ∀y
c
;
M
i,c
(y
c
) =
s⊂c, y
s
∼y
c
m
i,c,s
(y
t
s
) −
s⊃c
m
i,s,c
(y
c
), ∀i, ∀c ∈ (
(i)
, ∀y
c
.
Finally, we can write this in a form that resembles our original formulation Eq. (5.1), but
deﬁned at a local level, for each clique:
min
1
2
[[w[[
2
+ C
i,c
ξ
i,c
(5.7)
s.t. w
¯
f
i,c
(y
(i)
c
) + ξ
i,c
≥ max
y
c
[w
¯
f
i,c
(y
c
) +
i,c
(y
c
) + M
i,c
(y
c
)], ∀i, ∀c ∈ (
(i)
;
M
i,c
(y
c
) =
s⊂c, y
s
∼y
c
m
i,c,s
(y
t
s
) −
s⊃c
m
i,s,c
(y
c
), ∀i, ∀c ∈ (
(i)
, ∀y
c
.
Note that without M
i,c
and m
i,c,s
variables, we essentially treat each clique as an indepen
dent classiﬁcation problem: for each clique we have a hinge upperbound on the local loss,
or a margin requirement. The m
i,c,s
(y
s
) variables correspond to a certain kind of messages
between cliques that distribute “credit” to cliques to fulﬁll this margin requirement from
other cliques which have sufﬁcient margin.
64 CHAPTER 5. MARKOV NETWORKS
Figure 5.1: Firstorder chain shown as a set of cliques (nodes and edges). Also shown are
the corresponding local slack variables ξ for each clique and messages m between cliques.
As an example, consider the ﬁrstorder Markov chain in Fig. 5.1. The set of cliques
consists of the ﬁve nodes and the four edges. Suppose for the sake of this example that
our training data consists of only one training sample. The ﬁgure shows the local slack
variables ξ and messages m between cliques for this sample. For brevity of notion in this
example, we drop the dependence on the sample index i in the indexing of the variables
(we also used y
(∗)
j
instead of y
(i)
j
below). For concreteness, below we use the Hamming
loss
H
, which decomposes into local terms
j
(y
j
) = 1I(y
j
,= y
(∗)
j
) for each node and is
zero for the edges.
The constraints associated with the node cliques in this sequence are:
w
¯
f
1
(y
(∗)
1
) + ξ
1
≥ w
¯
f
1
(y
1
) + 1I(y
1
,= y
(∗)
1
) −m
1,12
(y
1
), ∀y
1
;
w
¯
f
2
(y
(∗)
2
) + ξ
2
≥ w
¯
f
2
(y
2
) + 1I(y
2
,= y
(∗)
2
) −m
2,12
(y
2
) −m
2,23
(y
2
), ∀y
2
;
w
¯
f
3
(y
(∗)
3
) + ξ
3
≥ w
¯
f
3
(y
3
) + 1I(y
3
,= y
(∗)
3
) −m
3,23
(y
3
) −m
3,34
(y
3
), ∀y
3
;
w
¯
f
4
(y
(∗)
4
) + ξ
4
≥ w
¯
f
4
(y
4
) + 1I(y
4
,= y
(∗)
4
) −m
4,34
(y
4
) −m
4,45
(y
4
), ∀y
4
;
w
¯
f
5
(y
(∗)
5
) + ξ
5
≥ w
¯
f
5
(y
5
) + 1I(y
5
,= y
(∗)
5
) −m
5,45
(y
5
), ∀y
5
.
5.3. M
3
N DUAL AND KERNELS 65
The edge constraints are:
w
¯
f
12
(y
(∗)
1
, y
(∗)
2
) + ξ
12
≥ w
¯
f
12
(y
1
, y
2
) + m
1,12
(y
1
) + m
2,12
(y
2
), ∀y
1
, y
2
;
w
¯
f
23
(y
(∗)
2
, y
(∗)
3
) + ξ
23
≥ w
¯
f
23
(y
2
, y
3
) + m
2,23
(y
2
) + m
3,23
(y
3
), ∀y
2
, y
3
;
w
¯
f
34
(y
(∗)
3
, y
(∗)
4
) + ξ
34
≥ w
¯
f
34
(y
3
, y
4
) + m
3,34
(y
3
) + m
4,34
(y
4
), ∀y
3
, y
4
;
w
¯
f
45
(y
(∗)
4
, y
(∗)
5
) + ξ
45
≥ w
¯
f
45
(y
4
, y
5
) + m
4,45
(y
4
) + m
5,45
(y
5
), ∀y
4
, y
5
.
5.3 M
3
N dual and kernels
In the previous section, we showed a derivation of a compact formulation based on LP
inference. In this section, we develop an alternative dual derivation that provides a very
interesting interpretation of the problem and is a departure for specialpurpose algorithms
we develop. We begin with the formulation as in Eq. (4.3):
min
1
2
[[w[[
2
+ C
i
ξ
i
(5.8)
s.t. w
¯
∆f
i
(y) ≥
i
(y) −ξ
i
, ∀i, y,
where ∆f
i
(y) ≡ f (x
(i)
, y
(i)
) −f (x
(i)
, y). The dual is given by:
max
i,y
α
i
(y)
i
(y) −
1
2
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,y
α
i
(y)∆f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(5.9)
s.t.
y
α
i
(y) = C, ∀i; α
i
(y) ≥ 0, ∀i, y.
In the dual, the exponential number of α
i
(y) variables correspond to the exponential num
ber of constraints in the primal. We make two small transformations to the dual that do not
change the problem: we normalize α’s by C (by letting α
i
(y) = Cα
t
i
(y)), so that they sum
66 CHAPTER 5. MARKOV NETWORKS
to 1 and divide the objective by C. The resulting dual is given by:
max
i,y
α
i
(y)
i
(y) −
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,y
α
i
(y)∆f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(5.10)
s.t.
y
α
i
(y) = 1, ∀i; α
i
(y) ≥ 0, ∀i, y.
As in multiclass SVMs, the solution to the dual α gives the solution to the primal as a
weighted combination: w
∗
= C
i,y
α
∗
i
(y)∆f
i
(y).
Our main insight is that the variables α
i
(y) in the dual formulation Eq. (5.10) can be
interpreted as a kind of distribution over y, since they lie in the simplex
y
α
i
(y) = 1; α
i
(y) ≥ 0, ∀y.
This dual distribution does not represent the probability that the model assigns to an instan
tiation, but the importance of the constraint associated with the instantiation to the solution.
The dual objective is a function of expectations of
i
(y) and ∆f
i
(y) with respect to α
i
(y).
Since
i
(y) =
c
i,c
(y
c
) and ∆f
i
(y) =
c
∆f
i,c
(y
c
) decompose over the cliques of the
Markov network, we only need clique marginals of the distribution α
i
(y) to compute their
expectations. We deﬁne the marginal dual variables as follows:
µ
i,c
(y
c
) =
y
∼y
c
α
i
(y
t
), ∀i, ∀c ∈ (
(i)
, ∀y
c
, (5.11)
where y
t
∼ y
c
denotes whether the partial assignment y
c
is consistent with the full assign
ment y
t
. Note that the number of µ
i,c
(y
c
) variables is small (polynomial) compared to the
number of α
i
(y) variables (exponential) if the size of the largest clique is constant with
respect to the size of the network.
Now we can reformulate our entire QP (5.10) in terms of these marginal dual variables.
Consider, for example, the ﬁrst term in the objective function (ﬁxing a particular i):
y
α
i
(y)
i
(y) =
y
α
i
(y)
c
i,c
(y
c
) =
c,y
c
i,c
(y
c
)
y
∼y
c
α
i
(y
t
) =
c,y
c
µ
i,c
(y
c
)
i,c
(y
c
).
5.3. M
3
N DUAL AND KERNELS 67
The decomposition of the second term in the objective is analogous.
y
α
i
(y)∆f
i
(y) =
c,y
c
∆f
i,c
(y
c
)
y
∼y
c
α
i
(y
t
) =
c,y
c
µ
i,c
(y
c
)∆f
i,c
(y
c
).
Let us denote the the objective of Eq. (5.10) as Q(α). Note that it only depends on
α
i
(y) through its marginals µ
i,c
(y
c
), that is, Q(α) = Q
t
(/(α)), where / denotes the
marginalization operator deﬁned by Eq. (5.11) . The domain of this operator, T[/], is
the product of simplices for all the m examples. What is its range, 1[/], the set of legal
marginals? Characterizing this set (also known as marginal polytope) compactly will allow
us to work in the space of µ’s:
max
α∈T[/]
Q(α) ⇔ max
µ∈1[/]
Q
t
(µ).
Hence we must ensure that µ
i
corresponds to some distribution α
i
, which is exactly
what the constraints in the LP for MAP inference enforce (see discussion of Lemma 3.3.5).
Therefore, when all (
(i)
are triangulated, the following structured dual QP has the same
primal solution (w
∗
) as the original exponential dual QP in Eq. (5.10):
max
i,c,y
c
µ
i,c
(y
c
)
i,c
(y
c
) −
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,c,y
c
µ
i,c
(y
c
)∆f
i,c
(y
c
)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(5.12)
s.t.
y
c
µ
i,c
(y
c
) = 1, ∀i, ∀c ∈ (
(i)
; µ
i,c
(y
c
) ≥ 0, ∀i, ∀c ∈ (
(i)
, ∀y
c
;
µ
i,s
(y
s
) =
y
c
∼y
s
µ
i,c
(y
t
c
), ∀i, ∀s, c ∈ (
(i)
, s ⊂ c, ∀y
s
.
The solution to the structured dual µ
∗
gives us the primal solution:
w
∗
= C
i,c,y
c
µ
∗
i,c
(y
c
)∆f
i,c
(y
c
).
In this structured dual, we only enforce that there exists an α
i
consistent with µ
i
, but do
not make a commitment about what it is. In general, the α distribution is not unique, but
there is a continuum of distributions consistent with a set of marginals. The objective of
68 CHAPTER 5. MARKOV NETWORKS
the QP Eq. (5.10) does not distinguish between these distributions, since it only depends on
their marginals. The maximumentropy distribution α
i
consistent with a set of marginals
µ
i
, however, is unique for a triangulated model and can be computed using the junction tree
T
(i)
for the network [Cowell et al., 1999].
Speciﬁcally, associated with each edge (c, c
t
) in the tree T
(i)
is a set of variables called
the separator s = c ∩ c
t
. Note that each separator s and complement of a separator c ¸ s is
also a clique of the original graph, since it is a subclique of a larger clique. We denote the
set of separators as o
(i)
. Now we can deﬁne the maximumentropy distribution α
i
(y) as
follows:
α
i
(y) =
c∈T
(i)
µ
i,c
(y
c
)
s∈S
(i)
µ
i,s
(y
s
)
. (5.13)
Again, by convention 0/0 ≡ 0.
Kernels
Note that the solution is a weighted combination of local basis functions and the objective
of Eq. (5.12) can be expressed in terms of dot products between local basis functions
∆f
i,c
(y
c
)
¯
∆f
j,¯ c
(y
¯ c
) = [f (x
(i)
c
, y
(i)
c
) −f (x
(i)
c
, y
c
)]
¯
[f (x
(j)
¯ c
, y
(j)
¯ c
) −f (x
(j)
¯ c
, y
¯ c
)].
Hence, we can locally kernelize our models and solve Eq. (5.12) efﬁciently. Kernels are
typically deﬁned on the input, e.g. k(x
(i)
c
, x
(j)
¯ c
). In our handwriting example, we use a
polynomial kernel on the pixel values for the node cliques. We usually extend the kernel
over the input space to the joint input and output space by simply deﬁning
f (x
c
, y
c
)
¯
f (x
¯ c
, y
¯ c
) ≡ 1I(y
c
= y
¯ c
)k(x
c
, x
¯ c
).
Of course, other deﬁnitions are possible and may be useful when the assignments in each
clique y
c
have interesting structure. In Sec. 6.2 we experiment with several kernels for
the handwriting example. As in SVMs, the solutions to the maxmargin QP are typically
sparse in the µ variables. Hence, each logpotential in the network “remembers” only a
small proportion of the relevant training data inputs.
5.4. UNTRIANGULATED MODELS 69
Figure 5.2: Diamond Markov network (added triangulation edge is dashed and threenode
marginals are in dashed rectangles).
5.4 Untriangulated models
If the underlying Markov net is not chordal, we must address the problem by triangulating
the graph, that is, adding ﬁllin edges to ensure triangulation. For example, if our graph is
a 4cycle Y
1
—Y
2
—Y
3
—Y
4
—Y
1
as in Fig. 5.2, we can triangulate the graph by adding an
arc Y
1
—Y
3
. This will introduce new cliques Y
1
, Y
2
, Y
3
and Y
1
, Y
3
, Y
4
and the corresponding
marginals, µ
123
(y
1
, y
2
, y
3
) and µ
134
(y
1
, y
3
, y
4
). We can then use this new graph to produce
the constraints on the marginals:
y
1
µ
123
(y
1
, y
2
, y
3
) = µ
23
(y
2
, y
3
), ∀y
2
, y
3
;
y
3
µ
123
(y
1
, y
2
, y
3
) = µ
12
(y
1
, y
2
), ∀y
1
, y
2
;
y
1
µ
134
(y
1
, y
3
, y
4
) = µ
34
(y
3
, y
4
), ∀y
3
, y
4
;
y
3
µ
134
(y
1
, y
3
, y
4
) = µ
13
(y
1
, y
3
), ∀y
1
, y
3
.
The new marginal variables appear only in the constraints; they do not add any new basis
functions nor change the objective function.
70 CHAPTER 5. MARKOV NETWORKS
In general, the number of constraints introduced is exponential in the number of vari
ables in the new cliques — the treewidth of the graph. Unfortunately, even sparsely con
nected networks, for example 2D grids often used in image analysis, have large treewidth.
However, we can still solve the QP in the structured primal Eq. (5.6) or the structured
dual Eq. (5.12) deﬁned by an untriangulated graph. Such a formulation, which enforces
only local consistency of marginals, optimizes our objective only over a relaxation of the
marginal polytope. However, the learned parameters produce very accurate approximate
models in practice, as experiments in Ch. 8 demonstrate.
Note that we could also strengthen the untriangulated relaxation without introducing
an exponential number of constraints. For example, we can add positive semideﬁnite con
straints on the marginals µ used by Wainwright and Jordan [2003], which tend to improve
the approximation of the marginal polytope. Although this and other more complex relax
ations are a very interesting area of future development, they are often much more expen
sive.
The approximate QP does not guarantee that the learned model using exact inference
minimizes the true objective: (upperbound on) empirical risk plus regularization. But do
we really need these optimal parameters if we cannot perform exact inference? A more
useful goal is to make sure that training error is minimized using the approximate infer
ence procedure via the untriangulated LP. We conjecture that the parameters learned by
the approximate QP in fact do that to some degree. For instance, consider the separable
case, where 100% accuracy is achievable on the training data by some parameter setting w
such that approximate inference (using the untriangulated LP) produces integral solutions.
Solving the problem as C → ∞ will ﬁnd this solution even though it may not be optimal
(in terms of the norm of the w) using exact inference. For C in intermediate range, the
formulation trades off fractionality of the untriangulated LP solutions with complexity of
the weights [[w[[
2
.
5.5 Generalization bound
In this section, we show a generalization bound for the task of structured classiﬁcation that
allows us to relate the error rate on the training set to the generalization error. To the best
5.5. GENERALIZATION BOUND 71
of our knowledge, this bound is the ﬁrst to deal with structured error, such as the Hamming
distance. Our analysis of Hamming loss allows to prove a signiﬁcantly stronger result than
previous bounds for the 0/1 loss, as we detail below.
Our goal in structured classiﬁcation is often to minimize the number of misclassiﬁed
labels, or the Hamming distance between y and h(x). An appropriate error function is the
average perlabel loss
L(w, x, y) =
1
L
H
(y, arg max
y
w
¯
f (x, y
t
)),
where Lis the number of label variables in y. As in other generalization bounds for margin
based classiﬁers, we relate the generalization error to the margin of the classiﬁer. Consider
an upper bound on the above loss:
L(w, x, y) ≤ L(w, x, y) = max
y
: w
f (y)≤w
f (y
)
1
L
H
(y, y
t
).
This upper bound is tight if y = arg max
y
w
¯
f (x, y
t
), Otherwise, it is adversarial: it
picks from all y
t
which are better (w
¯
f (y) ≤ w
¯
f (y
t
)), one that maximizes the Hamming
distance from y. We can now deﬁne a γmargin perlabel loss:
L(w, x, y) ≤ L(w, x, y) ≤ L
γ
(w, x, y) = max
y
: w
f (y)≤w
f (y
)+γ
H
(y,y
)
1
L
H
(y, y
t
).
This upper bound is even more adversarial: it is tight if y = arg max
y
[w
¯
f (x, y
t
) +
H
(y, y
t
)], otherwise, it picks from all y
t
which are better when helped by γ
H
(y, y
t
), one
that maximizes the Hamming distance from y. Note that the loss we minimize in the max
margin formulation is very closely related (although not identical to) this upper bound.
We can now prove that the generalization accuracy of any hypothesis w is bounded by
its empirical γmargin perlabel loss, plus a term that grows inversely with the margin.To
state the bound, we need to deﬁne several other factors it depends upon. Let N
c
be the
maximum number of cliques in ((x), V
c
be the maximum number of values in a clique
[Y
c
[, q be the maximum number of cliques that have a variable in common, and R
c
be
an upperbound on the 2norm of clique basis functions. Consider a ﬁrstorder sequence
72 CHAPTER 5. MARKOV NETWORKS
model as an example, with L as the maximumlength, and V the number of values a variable
takes. Then N
c
= 2L − 1 since we have L node cliques and L − 1 edge cliques; V
c
= V
2
because of the edge cliques; and q = 3 since nodes in the middle of the sequence participate
in 3 cliques: previouscurrent edge clique, node clique, and currentnext edge clique.
Theorem 5.5.1 For the family of hypotheses parameterized by w, and any δ > 0, there
exists a constant K such that for any γ > 0 perlabel margin, and m > 1 samples, the
expected perlabel loss is bounded by:
E
D
[L(w, x, y)] ≤ E
S
[L
γ
(w, x, y)] +
¸
K
m
_
R
2
c
[[w[[
2
q
2
γ
2
[ln m + ln N
c
+ ln V
c
] + ln
1
δ
_
,
with probability at least 1 −δ.
Proof: See Appendix A.1 for the proof details and the exact value of the constant K.
The ﬁrst term upper bounds the training error of w. Low loss E
S
[L
γ
(w, x, y)] at high
margin γ quantiﬁes the conﬁdence of the prediction model. The second term depends on
[[w[[/γ, which corresponds to the complexity of the classiﬁer (normalized by the margin
level). Thus, the result provides a bound to the generalization error that trades off the
effective complexity of the hypothesis space with the training error.
The proof uses a covering number argument analogous to previous results in SVMs [Zhang,
2002]. However we propose a novel method for covering the space of structured prediction
models by using a cover of the individual clique basis function differences ∆f
i,c
(y
c
). This
new type of cover is polynomial in the number of cliques, yielding signiﬁcant improve
ments in the bound. Speciﬁcally, our bound has a logarithmic dependence on the number
of cliques (ln N
c
) and depends only on the 2norm of the basis functions perclique (R
c
).
This is a signiﬁcant gain over the previous result of Collins [2001] for 0/1 loss, which has
linear dependence (inside the square root) on the number of nodes (L), and depends on
the joint 2norm of all of the basis functions for an example (which is ∼ N
c
R
c
). Such a
result was, until now, an open problem for marginbased sequence classiﬁcation [Collins,
2001]. Finally, for sequences, note that if
L
m
= O(1) (for example, in OCR, if the number
of instances is at least a constant times the length of a word), then our bound is independent
of the number of labels L.
5.6. RELATED WORK 73
5.6 Related work
The application of marginbased estimation methods to parsing and sequence modeling was
pioneered by Collins [2001] using the VotedPerceptron algorithm [Freund & Schapire,
1998]. He provides generalization guarantees (for 0/1 loss) that hold for separable case and
depend on the number of mistakes the perceptron makes before convergence. Remarkably,
the bound does not explicitly depend on the length of the sequence, although undoubtedly
the number of mistakes does.
Collins [2004] also suggested an SVMlike formulation (with exponentially many con
straints) and a constraint generation method for solving it. His generalization bound (for
0/1 loss) based on the SVMlike margin, however, has linear dependence (inside the square
root) on the number of nodes (L). It also depends on the joint 2norm of all of the basis
functions for an example (which is ∼ N
c
R
c
). By considering the more natural Hamming
loss, we achieve a much tighter analysis.
Altun et al. [2003] have applied the exponentialsize formulation with constraint gen
eration we described in Sec. 4.2.1 to problems natural language processing. In a followup
paper, Tsochantaridis et al. [2004] show that only a polynomial number of constraints are
needed to be generated to guarantee a ﬁxed level of precision of the solution. However,
the number of constraints in many important cases is several orders higher (in L) than in
the the approach we present. In addition, the corresponding problem needs to be resolved
(or at least approximately resolved) after each additional constraint is added, which is pro
hibitively expensive for large number of examples and label variables.
The work of Guestrin et al. [2003] presents LP decompositions based on graphical
model structure for the value function approximation problem in factored MDPs (Markov
decision processes with structure). Describing the exact setting is beyond our scope, but it
sufﬁces to say that our original decomposition of the maxmargin QP was inspired by the
proposed technique to transform an exponential set of constraints into a polynomial one
using a triangulated graph.
There has been a recent explosion of work in maximum conditional likelihood estima
tion of Markov networks. The work of Lafferty et al. [2001] has inspired many applications
in natural language, computational biology, computer vision and relational modeling [Sha
74 CHAPTER 5. MARKOV NETWORKS
& Pereira, 2003; Pinto et al., 2003; Kumar & Hebert, 2003; Sutton et al., 2004; Taskar
et al., 2002; Taskar et al., 2003b]. As in the case of logistic regression, maximum condi
tional likelihood estimation for Markov networks can also be kernelized [Altun et al., 2004;
Lafferty et al., 2004]. However, the solutions are nonsparse and the proposed algorithms
are forced to use greedy selection of support vectors or heuristic pruning methods.
5.7 Conclusion
We use graph decomposition to derive an exact, compact, convex maxmargin formulation
for Markov networks with sequence and other lowtreewidth structure. Our formulation
avoids the exponential blowup in the number of constraints in the maxmargin QP that
plagued previous approaches. The seamless integration of kernels with graphical models
allows us to create very rich models that leverage the immense amount of research in kernel
design and graphical model decompositions. We also use approximate graph decomposi
tion to derive a compact approximate formulation for Markov networks in which inference
is intractable.
We provide theoretical guarantees on the average perlabel generalization error of our
models in terms of the training set margin. Our generalization bound signiﬁcantly tightens
previous results of Collins [Collins, 2001] and suggests possibilities for analyzing perlabel
generalization properties of graphical models.
In the next chapter, we present an efﬁcient algorithm that exploits graphical model
inference and show experiments on a large handwriting recognition task that utilize the
powerful representational capability of kernels.
Chapter 6
M
3
N algorithms and experiments
Although the number of variables and constraints in the structured dual in Eq. (5.12) is
polynomial in the size of the data, unfortunately, for standard QP solvers, the problem is
often too large even for small training sets. Instead, we use a coordinate dual ascent method
analogous to the sequential minimal optimization (SMO) used for SVMs [Platt, 1999].
We apply our M
3
N framework and structured SMO algorithm to a handwriting recogni
tion task. We show that our models signiﬁcantly outperform other approaches by incorpo
rating highdimensional decision boundaries of polynomial kernels over character images
while capturing correlations between consecutive characters.
6.1 Solving the M
3
N QP
Let us begin by considering the primal and dual QPs for multiclass SVMs:
min
1
2
[[w[[
2
+ C
i
ξ
i
max
i,y
α
i
(y)
i
(y) −
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,y
α
i
(y)∆f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
s.t. w
∆f
i
(y) ≥ (y) −ξ
i
, ∀i, y. s.t.
y
α
i
(y) = 1, ∀i; α
i
(y) ≥ 0, ∀i, y.
The KKT conditions [Bertsekas, 1999; Boyd & Vandenberghe, 2004] provide sufﬁcient
and necessary criteria for optimality of a dual solution α. As we describe below, these
conditions have certain locality with respect to each example i, which allows us to perform
75
76 CHAPTER 6. M
3
N ALGORITHMS AND EXPERIMENTS
the search for optimal α by repeatedly considering one example at a time.
A feasible dual solution α and a primal solution deﬁned by:
w = C
i,y
α
i
(y)∆f
i
(y) (6.1)
ξ
i
= max
y
[
i
(y) −w∆f
i
(y)] = max
y
[
i
(y) +w
¯
f
i
(y)] −w
¯
f
i
(y
(i)
),
are optimal if they satisfy the following two types of constraints:
α
i
(y) = 0 ⇒ w
¯
∆f
i
(y) >
i
(y) −ξ
i
; (KKT1)
α
i
(y) > 0 ⇒ w
¯
∆f
i
(y) =
i
(y) −ξ
i
. (KKT2),
We can express these conditions as
α
i
(y) = 0 ⇒ w
¯
f
i
(y) +
i
(y) < max
y
[w
¯
f
i
(y
t
) +
i
(y
t
)]; (KKT1)
α
i
(y) > 0 ⇒ w
¯
f
i
(y) +
i
(y) = max
y
[w
¯
f
i
(y
t
) +
i
(y
t
)]. (KKT2)
To simplify the notation, we deﬁne
v
i
(y) = w
¯
f
i
(y) +
i
(y); v
i
(y) = max
y
,=y
[w
¯
f
i
(y
t
) +
i
(y
t
)].
With these deﬁnitions, we have
α
i
(y) = 0 ⇒v
i
(y) < v
i
(y); (KKT1) α
i
(y) > 0 ⇒v
i
(y) ≥ v
i
(y); (KKT2).
In practice, however, we will enforce KKT conditions up to a given tolerance 0 < ¸1.
α
i
(y) = 0 ⇒v
i
(y) ≤ v
i
(y) + ; α
i
(y) > 0 ⇒v
i
(y) ≥ v
i
(y) −. (6.2)
Essentially, α
i
(y) can be zero only if v
i
(y) is at most larger than the all others. Con
versely, α
i
(y) can be nonzero only if v
i
(y) is at most smaller than the all others.
Note that the normalization constraints on the dual variables α are local to each exam
ple i. This allows us to perform dual blockcoordinate ascent where a block corresponds to
6.1. SOLVING THE M
3
N QP 77
1. Initialize: α
i
(y) = 1I(y = y
(i)
), ∀ i, y.
2. Set violation = 0,
3. For each i,
4. If α
i
violates (KKT1) or (KKT2),
5. Set violation = 1,
6. Find feasible α
t
i
such that Q(α
t
i
, α
−i
) > Q(α
i
, α
−i
) and set α
i
= α
t
i
.
7. If violation = 1 goto 2.
Figure 6.1: Blockcoordinate dual ascent.
the vector of dual variables α
i
for a single example i. The general form of blockcoordinate
ascent algorithm as shown in Fig. 6.1 is essentially coordinate ascent on blocks α
i
, main
taining the feasibility of the dual. When optimizing with respect to a single block i, the
objective function can be split into two terms:
Q(α) = Q(α
−i
) +Q(α
i
, α
−i
),
where α
−i
denotes all dual α
k
variables for k other than i. Only the second part of the
objective Q(α
i
, α
−i
) matters for optimizing with respect to α
i
. The algorithm starts with
a feasible dual solution α and improves the objective blockwise until all KKT condi
tions are satisﬁed. Checking the constraints requires computing w and ξ from α according
to Eq. (6.1).
As long as the local ascent step over α
i
is guaranteed to improve the objective when
KKT conditions are violated, the algorithm will converge to the global maximum in a ﬁnite
number of steps (within the precision). This allows us to focus on efﬁcient updates to a
single block of α
i
at a time.
Let α
t
i
(y) = α
i
(y) + λ(y). Note that
y
λ(y) = 0 and α
i
(y) + λ(y) ≥ 0 so that α
t
i
is
feasible. We can write the objective Q(α
−i
) +Q(α
t
i
, α
−i
) in terms of λ and α:
j,y
α
j
(y)
j
(y) +
y
λ(y)
i
(y) −
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
y
λ(y)∆f
i
(y) +
j,y
α
j
(y)∆f
j
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
.
78 CHAPTER 6. M
3
N ALGORITHMS AND EXPERIMENTS
By dropping all terms that do not involve λ, and making the substitution
w = C
j,y
α
j
(y)∆f
j
(y), we get:
y
λ(y)
i
(y) −w
¯
_
y
λ(y)∆f
i
(y)
_
−
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
y
λ(y)∆f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
.
Since
y
λ(y) = 0,
y
λ(y)∆f
i
(y) =
y
λ(y)f
i
(y
(i)
) −
y
λ(y)f
i
(y) = −
y
λ(y)f
i
(y).
Below we also make the substitution v
i
(y) = w
¯
f
i
(y) +
i
(y) to get the optimization
problem for λ:
max
y
λ(y)v
i
(y) −
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
y
λ(y)f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
s.t.
y
λ(y) = 0; α
i
(y) + λ(y) ≥ 0, ∀y.
6.1.1 SMO
We do not need to solve the optimization subproblem above at each pass through the data.
All that is required is an ascent step, not a full optimization. Sequential Minimal Opti
mization (SMO) approach takes an ascent step that modiﬁes the least number of variables.
In our case, we have the simplex constraint, so we must change at least two variables in
order to respect the normalization constraint (by moving weight from one dual variable to
another). We address a strategy for selecting the two variables in the next section, but for
now assume we have picked λ(y
t
) and λ(y
tt
). Then we have δ = λ(y
t
) = −λ(y
tt
) in order
to sum to 1. The optimization problem becomes a single variable quadratic program in δ:
max [v
i
(y
t
) −v
i
(y
tt
)]δ −
1
2
C[[f
i
(y
t
) −f
i
(y
tt
)[[
2
δ
2
(6.3)
s.t. α
i
(y
t
) + δ ≥ 0; α
i
(y
tt
) −δ ≥ 0.
6.1. SOLVING THE M
3
N QP 79
−0.5 −0.4 −0.3 −0.2 −0.1 0 0.1 0.2 0.3 0.4 0.5
−2
−1.5
−1
−0.5
0
0.5
Figure 6.2: Representative examples of the SMO subproblem. Horizonal axis represents δ
with two vertical lines depicting the upper and lower bounds c and d. Vertical axis repre
sents the objective. Optimum either occurs at the maximum of the parabola if it is feasible
or the upper or lower bound otherwise.
With a = v
i
(y
t
) −v
i
(y
tt
), b = C[[f
i
(y
t
) −f
i
(y
tt
)[[
2
, c = −α
i
(y
t
), d = α
i
(y
tt
), we have:
max [aδ −
b
2
δ
2
] s.t. c ≤ δ ≤ d, (6.4)
where the optimum is achieved at the maximum of the parabola a/b if c ≤ a/b ≤ d or at
the boundary c or d (see Fig. 6.1.1). Hence the solution is given by simply clipping a/b:
δ
∗
= max(c, min(d, a/b)).
The key advantage of SMO is the simplicity of this update. Computing the coefﬁcients
involves dot products (or kernel evaluations) to compute w
¯
f
i
(y
t
) and w
¯
f
i
(y
tt
) as well as
(f
i
(y
t
) −f
i
(y
tt
))
¯
(f
i
(y
t
) −f
i
(y
tt
)).
6.1.2 Selecting SMO pairs
How do we actually select such a pair to guarantee that we make progress in optimizing
the objective? Note that at least one of the assignments y must violate (KKT1) or (KKT2),
80 CHAPTER 6. M
3
N ALGORITHMS AND EXPERIMENTS
1. Set violation = 0.
2. For each y,
3. KKT1: If α
i
(y) = 0 and v
i
(y) > v
i
(y) + ,
4. Set y
t
= y and violation = 1 and goto 7.
5. KKT2: If α
i
(y) > 0 and v
i
(y) < v
i
(y) −,
6. Set y
t
= y and violation = 2 and goto 7.
7. If violation > 0,
8. For each y ,= y
t
,
9. If violation = 1 and α
i
(y) > 0,
10. Set y
tt
= y and goto 13.
11. If violation = 2 and v
i
(y) > v
i
(y
t
),
12. Set y
tt
= y and goto 13.
13. Return y
t
and y
tt
.
Figure 6.3: SMO pair selection.
because otherwise α
i
is optimal with respect to the current α
−i
. The selection algorithm is
outlined in Fig. 6.3.
The ﬁrst variable in the pair, y
t
, corresponds to a violated condition, while the second
variable, y
tt
, is chosen to guarantee that solving Eq. (6.3) will result in improving the ob
jective. There are two cases, corresponding to violation of KKT1 and violation of KKT2.
Case KKT1. α
i
(y
t
) = 0 but v
i
(y
t
) > v
i
(y
t
) + . This is the case where i, y
t
is a not
support vector but should be. We would like to increase α
i
(y
t
), so we need α
i
(y
tt
) > 0
to borrow from. There will always be a such a y
tt
since
y
α
i
(y) = 1 and α
i
(y
t
) = 0.
Since v
i
(y
t
) > v
i
(y
t
) + , v
i
(y
t
) > v
i
(y
tt
) + , so the linear coefﬁcient in Eq. (6.4) is
a = v
i
(y
t
) −v
i
(y
tt
) > . Hence the unconstrained maximum is positive a/b > 0. Since the
upperbound d = α
i
(y
tt
) > 0, we have enough freedom to improve the objective.
Case KKT2. α
i
(y
t
) > 0 but v
i
(y
t
) < v
i
(y
t
) −. This is the case where i, y
t
is a support
vector but should not be. We would like to decrease α
i
(y
t
), so we need v
i
(y
tt
) > v
i
(y
t
)
so that a/b < 0. There will always be a such a y
tt
since v
i
(y
t
) < v
i
(y
t
) − . Since the
6.1. SOLVING THE M
3
N QP 81
lowerbound c = −α
i
(y
t
) < 0, again we have enough freedom to improve the objective.
Since at each iteration we are guaranteed to improve the objective if the KKT conditions
are violated and the objective is bounded, we can use the SMO in the blockcoordinate
ascent algorithm to converge in a ﬁnite number of steps. To the best of our knowledge,
there are no upper bounds on the speed of convergence of SMO, but experimental evidence
has shown it a very effective algorithm for SVMs [Platt, 1999]. Of course, we can improve
the speed of convergence by adding heuristics in the selection of the pair, as long as we
guarantee that improvement is possible when KKT conditions are violated.
6.1.3 Structured SMO
Clearly, we cannot perform the above SMO updates in the space of α directly for the
structured problems, since the number of α variables is exponential. The constraints on µ
variables are much more complicated, since each µ participates not only in nonnegativity
and normalization constraints, but also cliqueagreement constraints. We cannot limit our
ascent steps to changing only two µ variables at a time, because in order to make a change
in one clique and stay feasible, we need to modify variables in overlapping cliques. For
tunately, we can perform SMO updates on α variables implicitly in terms of the marginal
dual variables µ.
The diagram in Fig. 6.1.3 shows the abstract outline of the algorithm. The key steps in
the SMO algorithm are checking for violations of the KKT conditions, selecting the pair y
t
and y
tt
, computing the corresponding coefﬁcients a, b, c, d and updating the dual. We will
show how to do these operations by doing all the hard work in terms of the polynomially
many marginal µ
i
variables and auxiliary “maxmarginals” variables.
Structured KKT conditions
As before, we deﬁne v
i
(y) = w
¯
f
i
(y) +
i
(y). The KKT conditions are, for all y:
α
i
(y) = 0 ⇒ v
i
(y) ≤ v
i
(y); α
i
(y) > 0 ⇒ v
i
(y) ≥ v
i
(y). (6.5)
82 CHAPTER 6. M
3
N ALGORITHMS AND EXPERIMENTS
select
& lift
SMO
update
project
Figure 6.4: Structured SMO diagram. We use marginals µ to select an appropriate pair of
instantiations y
t
and y
tt
and reconstruct their α values. We then perform the simple SMO
update and project the result back onto the marginals.
Of course, we cannot check these explicitly. Instead, we deﬁne maxmarginals for each
clique in the junction tree c ∈ T
(i)
and its values y
c
, as:
´ v
i,c
(y
c
) = max
y∼y
c
[w
¯
f
i
(y) +
i
(y)], ´ α
i,c
(y
c
) = max
y∼y
c
α
i
(y).
We also deﬁne ´ v
i,c
(y
c
) = max
y
c
,=y
c
´ v
i,c
(y
t
c
) = max
y,∼y
c
[w
¯
f
i
(y) +
i
(y)]. Note that we
do not explicitly represent α
i
(y), but we can reconstruct the maximumentropy one from
the marginals µ
i
by using Eq. (5.13). Both ´ v
i,c
(y
c
) and ´ α
i,c
(y
c
) can be computed by using
the Viterbi algorithm (one pass propagation towards the root and one outwards from the
root [Cowell et al., 1999]). We can now express the KKT conditions in terms of the max
marginals for each clique c ∈ T
(i)
and its values y
c
:
´ α
i,c
(y
c
) = 0 ⇒ ´ v
i,c
(y
c
) ≤ ´ v
i,c
(y
c
); ´ α
i,c
(y
c
) > 0 ⇒ ´ v
i,c
(y
c
) ≥ ´ v
i,c
(y
c
). (6.6)
Theorem 6.1.1 The KKT conditions in Eq. (6.5) and Eq. (6.6) are equivalent.
Proof:
Eq. (6.5) ⇒Eq. (6.6). Assume Eq. (6.5). Suppose, we have a violation of KKT1: for
some c, y
c
, ´ α
i,c
(y
c
) = 0, but ´ v
i,c
(y
c
) > ´ v
i,c
(y
c
). Since ´ α
i,c
(y
c
) = max
y∼y
c
α
i
(y) = 0,
6.1. SOLVING THE M
3
N QP 83
then α
i
(y) = 0, ∀y ∼ y
c
. Hence, by Eq. (6.5), v
i
(y) ≤ v
i
(y), ∀y ∼ y
c
. But ´ v
i,c
(y
c
) >
´ v
i,c
(y
c
) implies the opposite: there exists y ∼ y
c
such that v
i
(y) > ´ v
i,c
(y
c
), which also
implies v
i
(y) > v
i
(y), a contradiction.
Now suppose we have a violation of KKT2: for some i, y
c
, ´ α
i,c
(y
c
) > 0, but ´ v
i,c
(y
c
) <
´ v
i,c
(y
c
). Then v
i
(y) < v
i
(y), ∀y ∼ y
c
. But ´ α
i,c
(y
c
) > 0 implies there exists y ∼ y
c
such
that α
i
(y) > 0. For that y, by Eq. (6.5), v
i
(y) ≥ v
i
(y), a contradiction.
Eq. (6.6) ⇒ Eq. (6.5). Assume Eq. (6.6). Suppose we have a violation of KKT1:
for some y, α
i
(y) = 0, but v
i
(y) > v
i
(y). This means that y is the optimum of v
i
(),
hence ´ v
i,c
(y
c
) = v
i
(y) > v
i
(y) > ´ v
i,c
(y
c
), ∀c ∈ T
(i)
, y
c
∼ y. But by Eq. (6.6), if
´ v
i,c
(y
c
) > ´ v
i,c
(y
c
), then we cannot have ´ α
i,c
(y
c
) = 0. Hence all the yconsistent α
i
max
marginals are positive ´ α
i,c
(y
c
) > 0, ∀c ∈ T
(i)
, and it follows that all the yconsistent
marginals µ
i
are positive as well µ
i,c
(y
c
) > 0, ∀c ∈ T
(i)
(since sum upperbounds max).
But α
i
(y) =
c∈T
(i)
µ
i,c
(y
c
)
c∈S
(i)
µ
i,s
(y
s
)
, so if all the yconsistent marginals are positive, then α
i
(y) > 0,
a contradiction.
Now suppose we have a violation of KKT2: for some y, α
i
(y) > 0, but v
i
(y) <
v
i
(y). Since α
i
(y) > 0, we know that all the yconsistent α
i
maxmarginals are positive
´ α
i,c
(y
c
) > 0, ∀c ∈ T
(i)
. By Eq. (6.6), ´ v
i,c
(y
c
) ≥ ´ v
i,c
(y
c
), ∀c ∈ T
(i)
. Note that trivially
max
y
v
i
(y
t
) = max(´ v
i,c
(y
t
c
), ´ v
i,c
(y
t
c
)) for any clique c and clique assignment y
t
c
. Since
´ v
i,c
(y
c
) ≥ ´ v
i,c
(y
c
), ∀c ∈ T
(i)
, then max
y
v
i
(y
t
) = ´ v
i,c
(y
c
), , ∀c ∈ T
(i)
. That is, ´ v
i,c
(y
c
)
is the optimal value. We will show that v
i
(y) = ´ v
i,c
(y
c
), a contradiction. To show that this,
we consider any two adjacent nodes in the tree T
(i)
, cliques a and b, with a separator s, and
show that ´ v
i,a∪b
(y
a∪b
) = ´ v
i,a
(y
a
) = ´ v
i,b
(y
b
). By chaining this equality from the root of the
tree to all the leaves, we get v
i
(y) = ´ v
i,c
(y
c
) for any c.
We need to introduce some more notation to deal with the two parts of the tree induced
by cutting the edge between a and b. Let ¦A, B¦ be a partition of the nodes T
(i)
(cliques
of (
(i)
) resulting from removing the edge between a and b such that a ∈ A and b ∈ B.
We denote the two subsets of an assignment y as y
A
and y
B
(with overlap at y
s
). The
value of an assignment v
i
(y) can be decomposed into two parts: v
i
(y) = v
i,A
(y
A
) +
v
i,B
(y
B
), where v
i,A
(y
A
) and v
i,B
(y
B
) only count the contributions of their constituent
cliques. Take any maximizer, y
(a)
∼ y
a
with v
i
(y
(a)
) = ´ v
i,a
(y
a
) ≥ ´ v
i,a
(y
a
) and any
maximizer y
(b)
∼ y
b
with v
i
(y
(b)
) = ´ v
i,b
(y
b
) ≥ ´ v
i,b
(y
b
), which by deﬁnition agree with y
84 CHAPTER 6. M
3
N ALGORITHMS AND EXPERIMENTS
on the intersection s. We decompose the two associated values into the corresponding parts:
v
i
(y
(a)
) = v
i
(y
(a)
A
)+v
i
(y
(a)
B
) and v
i
(y
(b)
) = v
i
(y
(b)
A
)+v
i
(y
(b)
B
). We create a newassignment
that combines the best of the two: y
(s)
= y
(b)
A
∪ y
(a)
B
. Note that v
i
(y
(s)
) = v
i
(y
(b)
A
) +
v
i
(y
(a)
B
) = ´ v
i,s
(y
s
), since we essentially ﬁxed the intersection s and maximized over the
rest of the variables in A and B separately. Now ´ v
i,a
(y
a
) = ´ v
i,b
(y
b
) ≥ ´ v
i,s
(y
s
) since they
are optimal as we said above. Hence we have v
i
(y
(a)
A
) + v
i
(y
(a)
B
) = v
i
(y
(b)
A
) + v
i
(y
(b)
B
) ≥
v
i
(y
(b)
A
) + v
i
(y
(a)
B
) which implies that v
i
(y
(a)
A
) ≥ v
i
(y
(b)
A
) and v
i
(y
(b)
B
) ≥ v
i
(y
(a)
B
). Now we
create another assignment that clamps the value of both a and b: y
(a∪b)
= y
(a)
A
∪ y
(b)
B
. The
value of this assignment is optimal v
i
(y
(a∪b)
) = v
i
(y
(a)
A
) + v
i
(y
(b)
B
) = v
i
(y
(a)
) = v
i
(y
(b)
).
Structured SMO pair selection and update
As in multiclass problems, we will select the ﬁrst variable in the pair, y
t
, corresponding to
a violated condition, while the second variable, y
tt
, to guarantee that solving Eq. (6.3) will
result in improving the objective. Having selected y
t
and y
tt
, the coefﬁcients for the one
variable QP in Eq. (6.4) are a = v
i
(y
t
)−v
i
(y
tt
), b = C[[f
i
(y
t
)−f
i
(y
tt
)[[
2
, c = −α
i
(y
t
), d =
α
i
(y
tt
). As before, we enforce approximate KKT conditions in the algorithm in Fig. 6.5.
We have two cases, corresponding to violation of KKT1 and violation of KKT2.
Case KKT1. ´ α
i,c
(y
t
c
) = 0 but ´ v
i,c
(y
t
c
) > ´ v
i,c
(y
t
c
)+. We have set y
t
= arg max
y∼y
c
v
i
(y),
so v
i
(y
t
) = ´ v
i,c
(y
t
c
) > ´ v
i,c
(y
t
c
) + > v
i
(y
t
) + and α
i
(y
t
) = 0. This is the case where
i, y
t
is a not support vector but should be. We would like to increase α
i
(y
t
), so we need
α
i
(y
tt
) > 0 to borrow from. There will always be a such a y
tt
(with y
tt
c
,= y
t
c
) since
y
α
i
(y) = 1 and α
i
(y
t
) = 0. We can ﬁnd one by choosing y
c
for which ´ α
i,c
(y
c
) > 0,
which guarantees that for y
tt
c
= arg max
y∼y
c
α
i
(y), α
i
(y
tt
) > 0. Since v
i
(y
t
) ≥ v
i
(y
t
) +,
v
i
(y
t
) ≥ v
i
(y
tt
) +, so the linear coefﬁcient in Eq. (6.4) is a = v
i
(y
t
) −v
i
(y
tt
) > . Hence
the unconstrained maximum is positive a/b > 0. Since the upperbound d = α
i
(y
tt
) > 0,
we have enough freedom to improve the objective.
Case KKT2. ´ α
i,c
(y
t
c
) > 0 but ´ v
i,c
(y
t
c
) < ´ v
i,c
(y
t
c
)−. We have set y
t
= arg max
y∼y
c
α
i
(y),
so α
i
(y
t
) = ´ α
i,c
(y
t
c
) > 0 and v
i
(y
t
) < ´ v
i,c
(y
t
c
) < ´ v
i,c
(y
t
c
) − < v
i
(y
t
) − . This is the
case where i, y
t
is a support vector but should not be. We would like to decrease α
i
(y
t
),
so we need v
i
(y
tt
) > v
i
(y
t
) so that a/b < 0. There will always be a such a y
tt
since
6.2. EXPERIMENTS 85
1. Set violation = 0.
2. For each c ∈ T
(i)
, y
c
3. KKT1: If ´ α
i,c
(y
c
) = 0, and ´ v
i,c
(y
c
) > ´ v
i,c
(y
c
) + ,
4. Set y
t
c
= y
c
, y
t
= arg max
y∼y
c
v
i
(y) and violation = 1 and goto 7.
5. KKT2: If ´ α
i,c
(y
c
) > 0, and ´ v
i,c
(y
c
) < ´ v
i,c
(y
c
) −,
6. Set y
t
c
= y
c
, y
t
= arg max
y∼y
c
α
i
(y) and violation = 2 and goto 7.
7. If violation > 0,
8. For each y
c
,= y
t
c
,
9. If violation = 1 and ´ α
i,c
(y
c
) > 0,
10. Set y
tt
c
= arg max
y∼y
c
α
i
(y) and goto 13.
11. If violation = 2 and ´ v
i,c
(y
c
) > ´ v
i,c
(y
t
c
),
12. Set y
tt
= arg max
y∼y
c
v
i
(y) and goto 13.
13. Return y
t
and y
tt
.
Figure 6.5: Structured SMO pair selection.
v
i
(y
t
) < v
i
(y
t
) − . We can ﬁnd one by choosing y
c
for which ´ v
i,c
(y
c
) > ´ v
i,c
(y
c
) − ,
which guarantees that for y
tt
c
= arg max
y∼y
c
v
i
(y), v
i
(y
tt
) > v
i
(y
t
) − , Since the lower
bound c = −α
i
(y
t
) < 0, again we have enough freedom to improve the objective.
Having computed new values α
t
i
(y
t
) = α
i
(y
t
) + δ and α
t
i
(y
tt
) = α
i
(y
t
) − δ, we need
to project this change onto the marginal dual variables µ
i
. The only marginal affected are
the ones consistent with y
t
and/or y
tt
, and the change is very simple:
µ
t
i,c
(y
c
) = µ
i,c
(y
c
) + δ1I(y
c
∼ y
t
) −δ1I(y
c
∼ y
tt
).
6.2 Experiments
We selected a subset of ∼ 6100 handwritten words, with average length of ∼ 8 characters,
from 150 human subjects, from the data set collected by Kassel [1995]. Each word was
divided into characters, each character was rasterized into an image of 16 by 8 binary
86 CHAPTER 6. M
3
N ALGORITHMS AND EXPERIMENTS
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
LogReg CRF mSVM M^3N
T
e
s
t
e
r
r
o
r
(
a
v
e
r
a
g
e
p
e
r

c
h
a
r
a
c
t
e
r
)
linear quadratic cubic
(a) (b)
Figure 6.6: (a) 3 example words from the OCR data set; (b) OCR: Average per
character test error for logistic regression, CRFs, multiclass SVMs, and M
3
Ns, using linear,
quadratic, and cubic kernels.
pixels. (See Fig. 6.6(a).) In our framework, the image for each word corresponds to x, a
label of an individual character to ¸
j
, and a labeling for a complete word to ¸. Each label
¸
j
takes values from one of 26 classes ¦a, . . . , z¦.
The data set is divided into 10 folds of ∼ 600 training and ∼ 5500 testing examples.
The accuracy results, summarized in Fig. 6.6(b), are averages over the 10 folds. We im
plemented a selection of stateoftheart classiﬁcation algorithms: independent label ap
proaches, which do not consider the correlation between neighboring characters — lo
gistic regression, multiclass SVMs as described in Eq. (2.9), and oneagainstall SVMs
(whose performance was slightly lower than multiclass SVMs); and sequence approaches
— CRFs, and our proposed M
3
networks. Logistic regression and CRFs are both trained by
maximizing the conditional likelihood of the labels given the features, using a zeromean
diagonal Gaussian prior over the parameters, with a standard deviation between 0.1 and
1. The other methods are trained by margin maximization. Our features for each label
¸
j
are the corresponding image of ith character. For the sequence approaches (CRFs and
M
3
), we used an indicator basis function to represent the correlation between ¸
j
and ¸
i+1
.
6.3. RELATED WORK 87
For marginbased methods (SVMs and M
3
), we were able to use kernels (both quadratic
and cubic were evaluated) to increase the dimensionality of the feature space. We used
the structured SMO algorithm with about 3040 iterations through the data. Using these
highdimensional feature spaces in CRFs is not feasible because of the enormous number
of parameters.
Fig. 6.6(b) shows two types of gains in accuracy: First, by using kernels, marginbased
methods achieve a very signiﬁcant gain over the respective likelihood maximizing methods.
Second, by using sequences, we obtain another signiﬁcant gain in accuracy. Interestingly,
the error rate of our method using linear features is 16% lower than that of CRFs, and
about the same as multiclass SVMs with cubic kernels. Once we use cubic kernels our
error rate is 45% lower than CRFs and about 33% lower than the best previous approach.
For comparison, the previously published results, although using a different setup (e.g., a
larger training set), are about comparable to those of multiclass SVMs.
6.3 Related work
The kerneladatron [Friess et al., 1998] and votedperceptron algorithms [Freund &Schapire,
1998] for largemargin classiﬁers have a similar online optimization scheme. Collins
[2001] have applied votedperceptron to structured problems in natural language. Although
headtohead comparisons have not been performed, it seems that, empirically, less passes
(about 3040) are needed for our algorithm than in the perceptron literature.
Recently, the Exponentiated Gradient [Kivinen & Warmuth, 1997] algorithm has been
adopted to solve our structured QP for maxmargin estimation [Bartlett et al., 2004]. Al
though the EG algorithm has attractive convergence properties, it has yet to be shown to
learn faster than Structured SMO, particularly in the early iterations through the dataset.
6.4 Conclusion
In this chapter, we address the large (though polynomial) size of our quadratic program
using an effective optimization procedure inspired by SMO. In our experiments with the
OCRtask, our sequence model signiﬁcantly outperforms other approaches by incorporating
88 CHAPTER 6. M
3
N ALGORITHMS AND EXPERIMENTS
highdimensional decision boundaries of polynomial kernels over character images while
capturing correlations between consecutive characters. Overall, we believe that M
3
net
works will signiﬁcantly further the applicability of high accuracy marginbased methods to
realworld structured data. In the next two chapters, we apply this framework to important
classes of Markov networks for spatial and relational data.
Chapter 7
Associative Markov networks
In the previous chapter, we considered applications of sequencestructured Markov net
works, which allow very efﬁcient inference and learning. The chief computational bottle
neck in applying Markov networks for other largescale prediction problems is inference,
which is NPhard in general networks suitable in a broad range of practical Markov network
structures, including gridtopology networks [Besag, 1986].
One can address the tractability issue by limiting the structure of the underlying net
work. In some cases, such as the quadtree model used for image segmentation [Bouman &
Shapiro, 1994], a tractable structure is determined in advance. In other cases (e.g., [Bach &
Jordan, 2001]), the network structure is learned, subject to the constraint that inference on
these networks is tractable. In many cases, however, the topology of the Markov network
does not allow tractable inference. For example, in hypertext, the network structure can
mirror the hyperlink graph, which is usually highly interconnected, leading to computa
tionally intractable networks.
In this chapter, we show that optimal learning is feasible for an important subclass of
Markov networks — networks with attractive potentials. This subclass, called associa
tive Markov networks (AMNs), contains networks of discrete variables with K labels and
arbitrarysize clique potentials with K parameters that favor the same labels for all vari
ables in the clique. Such positive interactions capture the “guilt by association” pattern of
reasoning present in many domains, in which connected (“associated”) variables tend to
have the same label. AMNs are a natural ﬁt object recognition and segmentation, webpage
89
90 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
classiﬁcation, and many other applications.
In the maxmargin estimation framework, the inference subtask is one of ﬁnding the
best joint (MAP) assignment to all of the variables in a Markov network. By contrast, other
learning tasks (e.g., maximizing the conditional likelihood of the target labels given the
features) require that we compute the posterior probabilities of different label assignments,
rather than just the MAP.
The MAP problem can naturally be expressed as an integer programming problem. We
use a linear program relaxation of this integer program in the minmax formulation. We
show that, for associative Markov networks of over binary variables (K = 2), this linear
program provides exact answers. To our knowledge, our method is the ﬁrst to allowtraining
Markov networks of arbitrary connectivity and topology. For the nonbinary case (K > 2),
the approximate linear programis not guaranteed to be optimal but we can bound its relative
error. Our empirical results suggest that the solutions of the resulting approximate max
margin formulation work well in practice.
We present an AMNbased method for object segmentation of complex from 3D range
data. By constraining the class of Markov networks to AMNs, our models can be learned
efﬁciently and at runtime, scale up to tens of millions of nodes and edges. The proposed
learning formulation effectively and directly learns to exploit a large set of complex surface
and volumetric features, while balancing the spatial coherence modeled by the AMN.
7.1 Associative networks
Associative interactions arise naturally in the context of image processing, where nearby
pixels are likely to have the same label [Besag, 1986; Boykov et al., 1999b]. In this setting,
a common approach is to use a generalized Potts model [Potts, 1952], which penalizes
assignments that do not have the same label across the edge: φ
ij
(k, l) = λ
ij
, ∀k ,= l and
φ
ij
(k, k) = 1, where λ
ij
≤ 1.
For binaryvalued Potts models, Greig et al. [1989] show that the MAP problem can be
formulated as a mincut in an appropriately constructed graph. Thus, the MAP problem can
be solved exactly for this class of models in polynomial time. For L > 2, the MAP problem
7.2. LP INFERENCE 91
is NPhard, but a procedure based on a relaxed linear program guarantees a factor 2 approx
imation of the optimal solution [Boykov et al., 1999b; Kleinberg & Tardos, 1999]. Our
associative potentials extend the Potts model in several ways. Importantly, AMNs allow
different labels to have different attraction strength: φ
ij
(k, k) = λ
ij
(k), where λ
ij
(k) ≥ 1,
and φ
ij
(k, l) = 1, ∀k ,= l. This additional ﬂexibility is important in many domains, as
different labels can have very diverse afﬁnities. For example, foreground pixels tend to
have locally coherent values while background is much more varied.
In a second important extension, AMNs admit nonpairwise interactions between vari
ables, with potentials over cliques involving m variables φ(µ
i1
, . . . , µ
im
). In this case, the
clique potentials are constrained to have the same type of structure as the edge potentials:
There are K parameters φ
c
(k, . . . , k) = λ
c
(k) ≥ 1 and the rest of the entries are set to 1.
In particular, using this additional expressive power, AMNs allow us to encode the pattern
of (soft) transitivity present in many domains. For example, consider the problem of pre
dicting whether two proteins interact [Vazquez et al., 2003]; this probability may increase
if they both interact with another protein. This type of transitivity could be modeled by a
ternary clique that has high λ for the assignment with all interactions present.
More formally, we deﬁne associative functions and potentials as follows.
Deﬁnition 7.1.1 A function g : ¸ →IR is associative for a graph ( over Kary variables if
it can be written as:
g(y) =
v∈1
K
k=1
g
v
(k)1I(y
v
= k) +
c∈(\1
K
k=1
g
c
(k)1I(y
c
= k, . . . , k); g
c
(k) ≥ 0, ∀c ∈ (¸1,
where 1 are the nodes and ( are the cliques of the graph (. A set of potentials φ(y) is
associative if φ(y) = e
g(y)
and g(y) is associative.
7.2 LP Inference
We can write an integer linear program for the problem of ﬁnding the maximum of an
associative function g(y), where we have a “marginal” variable µ
v
(k) for each node v ∈ 1
and each label k, which indicates whether node v has value k, and µ
c
(k) for each clique c
92 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
(containing more than one variable) and label k, which represents the event that all nodes
in the clique c have label k:
max
v∈1
K
k=1
µ
v
(k)g
v
(k) +
c∈(\1
K
k=1
µ
c
(k)g
c
(k) (7.1)
s.t. µ
c
(k) ∈ ¦0, 1¦, ∀c ∈ (, k;
K
k=1
µ
v
(k) = 1, ∀v ∈ 1;
µ
c
(k) ≤ µ
v
(k), ∀c ∈ ( ¸ 1, v ∈ c, k.
Note that we substitute the constraint µ
c
(k) =
_
v∈c
µ
v
(k) by linear inequality con
straints µ
c
(k) ≤ µ
v
(k). This works because the coefﬁcient g
c
(k) is nonnegative and we
are maximizing the objective function. Hence at the optimum, µ
c
(k) = min
v
µ
v
(k) , which
is equivalent to µ
c
(k) =
_
v∈c
µ
v
(k), when µ
v
(k) are binary.
It can be shown that in the binary case, the linear relaxation of Eq. (7.1), (where the
constraints µ
c
(k) ∈ ¦0, 1¦ are replaced by µ
c
(k) ≥ 0), is guaranteed to produce an integer
solution when a unique solution exists.
Theorem 7.2.1 If K = 2, for any associative function g, the linear relaxation of Eq. (7.1)
has an integral optimal solution.
See Appendix A.2.1 for the proof. This result states that the MAP problem in binary AMNs
is tractable, regardless of network topology or clique size. In the nonbinary case (L > 2),
these LPs can produce fractional solutions and we use a rounding procedure to get an
integral solution.
Theorem 7.2.2 If K > 2, for any associative function g, the linear relaxation of Eq. (7.1)
has a solution that is larger than the solution of the integer program by at most the number
of variables in the largest clique.
In the appendix, we also show that the approximation ratio of the rounding procedure is the
inverse of the size of the largest clique (e.g.,
1
2
for pairwise networks). Although artiﬁcial
examples with fractional solutions can be easily constructed by using symmetry, it seems
that in real data such symmetries are often broken. In fact, in all our experiments with
L > 2 on real data, we never encountered fractional solutions.
7.3. MINCUT INFERENCE 93
7.3 Mincut inference
We can also use efﬁcient mincut algorithms to perform exact inference on the learned
models for K = 2 and approximate inference for K > 2. For simplicity, we focus on the
pairwise AMN case. We ﬁrst consider the case of binary AMNs, and later show how to use
the local search algorithm developed by Boykov et al. [1999a] to perform (approximate)
inference in the general multiclass case. For pairwise, binary AMNs, the objective of the
integer program in Eq. (7.1) is:
max
v∈1
[µ
v
(1)g
v
(1) + µ
v
(2)g
v
(2)] +
uv∈c
[µ
uv
(1)g
uv
(1) + µ
uv
(2)g
uv
(2)]. (7.2)
7.3.1 Graph construction
We construct a graph in which the mincut will correspond to the optimal MAP labeling
for the above objective. First, we recast the objective as minimization by simply reversing
the signs on the value of each θ.
min −
v∈1
[µ
v
(1)g
v
(1) + µ
v
(2)g
v
(2)] −
uv∈c
[µ
uv
(1)g
uv
(1) + µ
uv
(2)g
uv
(2)]. (7.3)
The graph will consist of a vertex for each node in the AMN, along with the 1 and 2
terminals. In the ﬁnal (1
1
, 1
2
) cut, the 1
1
set will correspond to label 1, and the 1
2
set will
correspond to label 2. We will show how to deal with the node terms (those depending only
on a single variable) and the edge terms (those depending on a pair of variables), and then
how to combine the two.
Node terms
Consider a node term −µ
v
(1)g
v
(1) −µ
v
(2)g
v
(2). Such a term corresponds to the node po
tential contribution to our objective function for node v. For each node term corresponding
to node v we add a vertex v to the mincut graph. We then look at ∆
v
= g
v
(1) − g
v
(2),
and create an edge of weight [∆
v
[ from v to either 1 or 2, depending on the sign of ∆
v
.
The reason for that is that the ﬁnal mincut graph must consist of only positive weights. An
94 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
1 2 v
1 2 v
1
2
u v
Figure 7.1: Mincut graph construction of node (left) and edge (right) terms.
example is presented in Fig. 7.3.1.
From Fig. 7.3.1, we see that if the AMN consisted of only node potentials, the graph
construction above would add an edge from each node to its more likely label. Thus if we
run mincut, we would simply get a cut with cost 0, since for each introduced vertex we
have only one edge of positive weight to either 1 or 2, and we would always choose not to
cut any edges.
Edge Terms
Now consider an edge term of the form −µ
uv
(1)g
uv
(1) − µ
uv
(2)g
uv
(2). To construct a
mincut graph for the edge term we will introduce two vertices u and v. We will connect
vertex u to 1 with an edge of weight g
uv
(1), connect v to 2 with an edge of weight g
uv
(2)
and connect u to v with an edge of weight g
uv
(1) + g
uv
(2). Fig. 7.3.1 shows an example.
Observe what happens when both nodes are on the 1
2
side of the cut: the value of the
mincut is g
uv
(1), which must be less than g
uv
(2) or the mincut would have placed them
both on the 1 side. When looking at edge terms in isolation, a cut that places each node
in different sets will not occur, but when we combine the graphs for node terms and edge
terms, such cuts will be possible.
We can take the individual graphs we created for node and edge terms and merge them
7.3. MINCUT INFERENCE 95
by adding edge weights together (and treating missing edges as edges with weight 0). It
can be shown that the resulting graph will represent the same objective (in the sense that
running mincut on it will optimize the same objective) as the sum of the objectives of each
graph. Since our MAPinference objective is simply a sumof node and edge terms, merging
the node and edge term graphs will result in a graph in which mincut will correspond to
the MAP labeling.
7.3.2 Multiclass case
The graph construction above ﬁnds the best MAP labeling for the binary case, but in prac
tice we would often like to handle multiple classes in AMNs. One of the most effective
algorithms for minimizing energy functions like ours is the αexpansion algorithm pro
posed by Boykov et al. [1999a]. The algorithm performs a series of “expansion” moves
each of which involves optimization over two labels, and it can be shown that it converges
to within a factor of 2 of the global minimum.
Expansion Algorithm
Consider a current labeling µ and a particular label k ∈ 1, . . . , K. Another labeling µ
t
is
called an “αexpansion” move (following Boykov et al. [1999a]) from µ if µ
t
v
,= k implies
µ
t
v
= µ
v
(where µ
v
is the label of the node v in the AMN.) In other words, a kexpansion
from a current labeling allows each label to either stay the same, or change to k.
The αexpansion algorithm cycles through all labels k in either a ﬁxed or random order,
and ﬁnds the new labeling whose objective has the lowest value. It terminates when there
is no αexpansion move for any label k that has a lower objective than the current labeling
(Fig. 7.2).
The key part of the algorithm is computing the best αexpansion labeling for a ﬁxed
k and a ﬁxed current labeling µ. The mincut construction from earlier allows us to do
exactly that since an αexpansion move essentially minimizes a MAPobjective over two
labels: it either allows a node to retain its current label, or switch to the label α. In this
new binary problem we will let label 1 represent a node keeping its current label and label
2 will denote a node taking on the new label k. In order to construct the right coefﬁcients
96 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
1. Begin with arbitrary labeling µ
2. Set success := 0
3. For each label k ∈ ¦1, . . . K¦
3.1 Compute ˆ µ = arg min −g(µ
t
) among µ
t
within one αexpansion of µ.
3.2 If E(ˆ µ) < E(µ), set µ := ˆ µ and success := 1
4. If success = 1 goto 2.
5. Return µ
Figure 7.2: αexpansion algorithm
for the new binary objective we need to consider several factors. Below, let θ
tk
i
and θ
tk,k
ij
denote the node and edge coefﬁcients associated with the new binary objective:
◦ Node Potentials For each node i in the current labeling whose current label is not α,
we let θ
t0
i
= θ
y
i
i
, and θ
t1
i
= θ
α
i
, where y
i
denotes the current label of node i, and θ
y
i
denotes the coefﬁcient in the multiclass AMN MAP objective. Note that we ignore
nodes with label α altogether since an αexpansion move cannot change their label.
◦ Edge Potentials For each edge (i, j) ∈ E whose nodes have labels different from α,
we add a new edge potential, with weights θ
t1
ij
= θ
α,α
ij
. If the two nodes of the edge
currently have the same label, we set θ
t0
ij
= θ
y
i
,y
j
ij
, and if the two nodes currently have
different labels we let θ
t0
ij
= 0. For each edge (i, j) ∈ E in which exactly one of the
nodes has label α in the current labeling, we add θ
α,α
ij
, to the node potential θ
t1
i
of the
node whose label is different from α.
After we have constructed the new binary MAP objective as above, we can apply the
mincut construction from before to get the optimal labeling within one αexpansion from
the current one. Veksler [1999] shows that the αexpansion algorithm converges in O(N)
iterations where N is the number of nodes. As noted in Boykov et al. [1999a] and as we
have observed in our experiments, the algorithm terminates only after a few iterations with
most of the improvement occurring in the ﬁrst 23 expansion moves.
7.4. MAXMARGIN ESTIMATION 97
7.4 Maxmargin estimation
The potentials of the AMN are once again loglinear combinations of basis functions. We
will need the following assumption to ensure that w
¯
f (x, y) is associative:
Assumption 7.4.1 Basis functions f are componentwise associative for ((x) for any (x, y).
Recall that this implies that for cliques larger than one, all basis functions evaluate to 0
for assignments where the values of the nodes are not equal and are nonnegative for the
assignments where the values of the nodes are equal. To ensure that w
¯
f (x, y) is associa
tive, it is useful to separate the basis functions with support only on nodes from those with
support on larger cliques.
Deﬁnition 7.4.2 Let
˙
f be the subset of basis functions f with support only on singleton
cliques:
˙
f = ¦f ∈ f : ∀ x ∈ A, y ∈ ¸, c ∈ ((((x)), [c[ > 1, f
c
(x
c
, y
c
) = 0¦.
Let
¨
f = f ¸
˙
f be the rest of the basis functions. Let ¦ ˙ w, ¨ w¦ = w be the corresponding
subsets of parameters.
It is easy to verify that any nonnegative combination of associative functions is asso
ciative, and any combination of basis functions with support only on singleton cliques is
also associative, so we have:
Lemma 7.4.3 w
¯
f (x, y) is associative for ((x) for any (x, y) whenever Assumption 7.4.1
holds and ¨ w ≥ 0.
We must make similar associative assumption on the loss function in order to guarantee
that the LP inference can handle it.
Assumption 7.4.4 The loss function (x
(i)
, y
(i)
, y) is associative for (
(i)
for all i.
In practice, this restriction is fairly mild, and the Hamming loss, which we use in general
ization bounds and experiments, is associative.
98 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
Using the above Assumptions 7.4.1 and 7.4.4 and some algebra (see Appendix A.2.3
for derivation), we have the following maxmargin QP for AMNs:
min
1
2
[[w[[
2
+ C
i,v∈1
(i)
ξ
i,v
(7.4)
s.t. w
¯
∆f
i,v
(k) −
c⊃v
m
i,c,v
(k) ≥
i,v
(k) −ξ
i,v
, ∀i, v ∈ 1
(i)
, k;
¨ w
¯
∆
¨
f
i,c
(k) +
v∈c
m
i,c,v
(k) ≥
i,c
(k), ∀i, c ∈ (
(i)
¸ 1
(i)
, k;
m
i,c,v
(k) ≥ −¨ w
¯
¨
f
i,c
(y
(i)
c
)/[c[, ∀i, c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k;
¨ w ≥ 0;
where f
i,c
(k) = f
i,c
(k, . . . , k) and
i,c
(k) =
i,c
(k, . . . , k).
While this primal is more complex than the regular M
3
N factored primal in Eq. (5.4),
the basic structure of the ﬁrst two sets of constraints remains the same: we have local
margin requirements and “credit” passed around through messages m
i,c,v
(k). The extra
constraints are due to the associativity constraints on the resulting model.
The dual of Eq. (7.4) (see derivation in Sec. A.2.3) is given by:
max
i,c∈(
(i)
, k
µ
i,c
(k)
i,c
(k) −
C
2
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,v∈1
(i)
, k
µ
i,v
(k)∆
˙
f
i,v
(k)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
−
C
2
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¨ ν +
i,c∈(
(i)
, k
µ
i,c
(k)∆
¨
f
i,c
(k)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
s.t. µ
i,c
(k) ≥ 0, ∀i, ∀c ∈ (
(i)
, k;
K
k=1
µ
i,v
(k) = 1, ∀i, ∀v ∈ 1
(i)
;
µ
i,c
(k) ≤ µ
i,v
(k), ∀i, ∀c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k;
¨ ν ≥ 0.
In the dual, there are marginals µ for each node and clique, for each value k, similar
to Eq. (5.12). However, the constraints are different, and not surprisingly, are essentially
the constraints from the inference LP relaxation in Eq. (7.1).
7.5. EXPERIMENTS 99
The dual and primal solutions are related by
˙ w =
i,v∈1
(i)
, k
µ
i,v
(k)∆
˙
f
i,v
(k); ¨ w = ¨ ν +
i,c∈(
(i)
, k
µ
i,c
(k)∆
¨
f
i,c
(k).
The ¨ ν variables simply ensure that ¨ ware positive (if any component
i,c∈(
(i)
, k
µ
i,c
(k)∆
¨
f
i,c
(k)
is negative, maximizing the objective will force the corresponding component of ¨ ν to cancel
it out). Note that the objective can be written in terms of dot products of node basis func
tions ∆
˙
f
i,v
(k)
¯
∆
˙
f
j,¯ v
(
¯
k), so they can be kernelized. Unfortunately, the edge basis functions
cannot be kernelized because of the nonnegativity constraint.
For K = 2, the LP inference is exact, so that Eq. (7.4) learns exact maxmargin weights
for Markov networks of arbitrary topology. For K > 2, the linear relaxation leads to a
strengthening of the constraints on w by potentially adding constraints corresponding to
fractional assignments as in the case of untriangualated networks. Thus, the optimal choice
w, ξ for the original QP may no longer be feasible, leading to a different choice of weights.
However, as our experiments show, these weights tend to do well in practice.
7.5 Experiments
We applied associative Markov networks to the task of terrain classiﬁcation. Terrain clas
siﬁcation is very useful for autonomous mobile robots in realworld environments for path
planning, target detection, and as a preprocessing step for other perceptual tasks. The
Stanford Segbot Project
1
has provided us with a laser range maps of the Stanford campus
collected by a moving robot equipped with SICK2 laser sensors Fig. 7.5. The data consists
of around 35 million points, represented as 3D coordinates in an absolute frame of refer
ence Fig. 7.5. Thus, the only available information is the location of points. Each reading
was a point in 3D space, represented by its (x, y, z) coordinates in an absolute frame of
reference. Thus, the only available information is the location of points, which was fairly
noisy because of localization errors.
Our task is to classify the laser range points into four classes: ground, building, tree,
1
Many thanks to Michael Montemerlo and Sebastian Thrun for sharing the data.
100 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
Figure 7.3: Segbot: roving robot equipped with SICK2 laser sensors.
and shrubbery. Since classifying ground points is trivial given their absolute zcoordinate
(height), we classify them deterministically by thresholding the z coordinate at a value
close to 0. After we do that, we are left with approximately 20 million nonground points.
Each point is represented simply as a location in an absolute 3D coordinate system. The
features we use require preprocessing to infer properties of the local neighborhood of a
point, such as how planar the neighborhood is, or how much of the neighbors are close to
the ground. The features we use are invariant to rotation in the xy plane, as well as the
density of the range scan, since scans tend to be sparser in regions farther from the robot.
Our ﬁrst type of feature is based on the principal plane around it. For each point we
sample 100 points in a cube of radius 0.5 meters. We run PCA on these points to get the
plane of maximum variance (spanned by the ﬁrst two principal components). We then par
tition the cube into 3 3 3 bins around the point, oriented with respect to the principal
plane, and compute the percentage of points lying in the various subcubes. We use a num
ber of features derived from the cube such as the percentage of points in the central column,
the outside corners, the central plane, etc. These features capture the local distribution well
and are especially useful in ﬁnding planes. Our second type of feature is based on a column
7.5. EXPERIMENTS 101
Figure 7.4: 3D laser scan range map of the Stanford Quad.
around each point. We take a cylinder of radius 0.25 meters, which extends vertically to
include all the points in a “column”. We then compute what percentage of the points lie in
various segments of this vertical column (e.g., between 2m and 2.5m). Finally, we also use
an indicator feature of whether or not a point lies within 2m of the ground. This feature is
especially useful in classifying shrubbery.
For training we select roughly 30 thousand points that represent the classes well: a
segment of a wall, a tree, some bushes. We considered three different models: SVM,
VotedSVM and AMNs. All methods use the same set of features, augmented with a
quadratic kernel.
The ﬁrst model is a multiclass SVM with a quadratic kernel over the above features.
This model (Fig. 7.5, right panel and Fig. 7.7, top panel) achieves reasonable performance
102 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
Figure 7.5: Terrain classiﬁcation results showing Stanford Memorial Church obtained
with SVM, VotedSVM and AMN models. (Color legend: buildings/red, trees/green,
shrubs/blue, ground/gray).
in many places, but fails to enforce local consistency of the classiﬁcation predictions. For
example arches on buildings and other less planar regions are consistently confused for
trees, even though they are surrounded entirely by buildings.
We improved upon the SVM by smoothing its predictions using voting. For each point
we took its local neighborhood (we varied the radius to get the best possible results) and
assigned the point the label of the majority of its 100 neighbors. The VotedSVM model
(Fig. 7.5, middle panel and Fig. 7.7, middle panel) performs slightly better than SVM: for
example, it smooths out trees and some parts of the buildings. Yet it still fails in areas like
arches of buildings where the SVM classiﬁer has a locally consistent wrong prediction.
The ﬁnal model is a pairwise AMN over laser scan points, with associative potentials
to ensure smoothness. Each point is connected to 6 of its neighbors: 3 of them are sampled
randomly from the local neighborhood in a sphere of radius 0.5m, and the other 3 are
sampled at random from the vertical cylinder column of radius 0.25m. It is important to
ensure vertical consistency since the SVMclassiﬁer is wrong in areas that are higher off the
7.5. EXPERIMENTS 103
0 0.5 1 1.5 2 2.5
x 10
7
0
50
100
150
200
250
Problem size (nodes and edges)
R
u
n
n
i
n
g
t
i
m
e
(
s
e
c
o
n
d
s
)
Mincut inference performance
Figure 7.6: The running time (in seconds) of the mincutbased inference algorithm for
different problem sizes. The problem size is the sum of the number of nodes and the
number of edges. Note the near linear performance of the algorithm and its efﬁciency even
for large models.
ground (due to the decrease in point density) or because objects tend to look different as we
vary their zcoordinate (for example, tree trunks and tree crowns look different). While we
experimented with a variety of edge features including various distances between points,
we found that even using only a constant feature performs well.
We trained the AMN model using CPLEX to solve the quadratic program; the train
ing took about an hour on a Pentium 3 desktop. The inference over each segment was
performed using mincut with αexpansion moves as described above. We used a pub
licly available implementation of the mincut algorithm, which uses bidirectional search
trees for augmenting paths (see Boykov and Kolmogorov [2004]). The implementation is
largely dominated by I/O time, with the actual mincut taking less than two minutes even
for the largest segment. The performance is summarized in Fig. 7.6, and as we can see, it
is roughly linear in the size of the problem (number of nodes and number of edges).
We can see that the predictions of the AMN (Fig. 7.5, left panel and Fig. 7.7, bot
tom panel) are much smoother: for example building arches and tree trunks are predicted
104 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
correctly. We also handlabeled around 180 thousand points of the test set (Fig. 7.8) and
computed accuracies of the predictions shown in Fig. 7.9 (excluding ground, which was
classiﬁed by preprocessing). The differences are dramatic: SVM: 68%, VotedSVM: 73%
and AMN: 93%. See more results, including a ﬂythrough movie of the data, at
http://ai.stanford.edu/˜btaskar/3Dmap/.
7.6 Related work
Several authors have considered extensions to the Potts model. Kleinberg and Tardos
[1999] extend the multiclass Potts model to have more general edge potentials, under the
constraints that negative log of the edge potentials form a metric on the set of labels. They
also provide a solution based on a relaxed LP that has certain approximation guarantees.
More recently, Kolmogorov and Zabih [2002] showed how to optimize energy func
tions containing binary and ternary interactions using graph cuts, as long as the parameters
satisfy a certain regularity condition. Our deﬁnition of associative potentials below also
satisﬁes the Kolmogorov and Zabih regularity condition for K = 2. However, the structure
of our potentials is simpler to describe and extend for the multiclass case. In fact, we can
extend our maxmargin framework to estimate their more general potentials by expressing
inference as a linear program.
Our terrain classiﬁcation approach is most closely related to work in vision applying
conditional random ﬁelds (CRFs) to 2D images. Kumar and Hebert [2003] train CRFs
using a pseudolikelihood approximation to the distribution P(Y [ X) since estimating
the true conditional distribution is intractable. Unlike their work, our learning formulation
provides an exact and tractable optimization algorithm, as well as formal guarantees for
binary classiﬁcation problems. Moreover, unlike their work, our approach can also handle
multiclass problems in a straightforward manner.
7.7 Conclusion
In this chapter, we provide an algorithm for maxmargin training of associative Markov
networks, a subclass of Markov networks that allows only positive interactions between
7.7. CONCLUSION 105
related variables. Our approach relies on a linear programming relaxation of the MAP
problem, which is the key component in the quadratic program associated with the max
margin formulation. We thus provide a polynomial time algorithm which approximately
solves the maximum margin estimation problem for any associative Markov network. Im
portantly, our method is guaranteed to ﬁnd the optimal (marginmaximizing) solution for all
binaryvalued AMNs, regardless of the clique size or the connectivity. To our knowledge,
this algorithm is the ﬁrst to provide an effective learning procedure for Markov networks
of such general structure.
Our results in the binary case rely on the fact that the LP relaxation of the MAP problem
provides exact solutions. In the nonbinary case, we are not guaranteed exact solutions, but
we can prove constantfactor approximation bounds on the MAP solution returned by the
relaxed LP. It would be interesting to see whether these bounds provide us with guarantees
on the quality (e.g., the margin) of our learned model.
We present largescale experiments with terrain segmentation and classiﬁcation from
3D range data involving AMNs with tens of millions of nodes and edges. The class of
associative Markov networks appears to cover a large number of interesting applications.
We have explored only a computer vision application in this chapter, and consider another
one (hypertext classiﬁcation) in the next. It would be very interesting to consider other
applications, such as extracting protein complexes from proteinprotein interaction data, or
predicting links in relational data. The mincut based inference is able to handle very large
networks, and it is an interesting challenge to apply the algorithm to even larger models
and develop efﬁcient distributed implementations.
However, despite the prevalence of fully associative Markov networks, it is clear that
many applications call for repulsive potentials. While clearly we cannot introduce fully
general potentials into AMNs without running against the NPhardness of the general prob
lem, it would be interesting to see whether we can extend the class of networks we can learn
effectively.
106 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
Figure 7.7: Results from the SVM, VotedSVM and AMN models.
7.7. CONCLUSION 107
Figure 7.8: Labeled part of the test set: ground truth (top) and SVM predictions (bottom).
108 CHAPTER 7. ASSOCIATIVE MARKOV NETWORKS
Figure 7.9: Predictions of the VotedSVM (top) and AMN (bottom) models.
Chapter 8
Relational Markov networks
In the previous chapters, we have seen how sequential and spatial correlation between
labels can be exploited for tremendous accuracy gains. In many other supervised learning
tasks, the entities to be labeled are related with each other in very complex ways, not just
sequentially or spatially. For example, in hypertext classiﬁcation, the labels of linked pages
are highly correlated. Astandard approach is to classify each entity independently, ignoring
the correlations between them. In this chapter, we present a framework that builds on
Markov networks and provides a ﬂexible language for modeling rich interaction patterns in
structured data. We provide experimental results on a webpage classiﬁcation task, showing
that accuracy can be signiﬁcantly improved by modeling relational dependencies.
Many realworld data sets are innately relational: hyperlinked webpages, crosscitations
in patents and scientiﬁc papers, social networks, medical records, and more. Such data con
sist of entities of different types, where each entity type is characterized by a different set
of attributes. Entities are related to each other via different types of links, and the link
structure is an important source of information.
Consider a collection of hypertext documents that we want to classify using some set
of labels. Most naively, we can use a bag of words model, classifying each webpage solely
using the words that appear on the page. However, hypertext has a very rich structure that
this approach loses entirely. One document has hyperlinks to others, typically indicating
that their topics are related. Each document also has internal structure, such as a partition
into sections; hyperlinks that emanate from the same section of the document are even
109
110 CHAPTER 8. RELATIONAL MARKOV NETWORKS
more likely to point to similar documents. When classifying a collection of documents,
these are important cues, that can potentially help us achieve better classiﬁcation accuracy.
Therefore, rather than classifying each document separately, we want to provide a form of
collective classiﬁcation, where we simultaneously decide on the class labels of all of the
entities together, and thereby can explicitly take advantage of the correlations between the
labels of related entities.
We propose the use of a joint probabilistic model for an entire collection of related enti
ties. We introduce the framework of relational Markov networks (RMNs), which compactly
deﬁnes a Markov network over a relational data set. The graphical structure of an RMN is
based on the relational structure of the domain, and can easily model complex patterns over
related entities. For example, we can represent a pattern where two linked documents are
likely to have the same topic. We can also capture patterns that involve groups of links: for
example, consecutive links in a document tend to refer to documents with the same label.
As we show, the use of an undirected graphical model avoids the difﬁculties of deﬁning
a coherent generative model for graph structures in directed models. It thereby allows us
tremendous ﬂexibility in representing complex patterns.
8.1 Relational classiﬁcation
Consider hypertext as a simple example of a relational domain. A relational domain is
deﬁned by a schema, which describes entities, their attributes and relations between them.
In our domain, there are two entity types: Doc and Link. If a webpage is represented as a
bag of words, Doc would have a set of boolean attributes Doc.HasWord
k
indicating whether
the word k occurs on the page. It would also have the label attribute Doc.Label, indicating
the topic of the page, which takes on a set of categorical values. The Link entity type has
two attributes: Link.From and Link.To, both of which refer to Doc entities.
In general, a schema speciﬁes of a set of entity types c = ¦E
1
, . . . , E
n
¦. Each type E is
associated with three sets of attributes: content attributes E.X(for example, Doc.HasWord
k
),
label attributes E.Y (for example, Doc.Label), and reference attributes E.R (for example,
Link.To). For simplicity, we restrict label and content attributes to take on categorical val
ues. Reference attributes include a special unique key attribute E.K that identiﬁes each
8.1. RELATIONAL CLASSIFICATION 111
entity. Other reference attributes E.R refer to entities of a single type E
t
= Range(E.R)
and take values in Domain(E
t
.K).
An instantiation 1 of a schema c speciﬁes the set of entities 1(E) of each entity type
E ∈ c and the values of all attributes for all of the entities. For example, an instantiation
of the hypertext schema is a collection of webpages, specifying their labels, words they
contain and links between them. We will use 1.X, 1.Y and 1.R to denote the content,
label and reference attributes in the instantiation 1; 1.x, 1.y and 1.r to denote the values
of those attributes. The component 1.r, which we call an instantiation skeleton or instan
tiation graph, speciﬁes the set of entities (nodes) and their reference attributes (edges). A
hypertext instantiation graph speciﬁes a set of webpages and links between them, but not
their words or labels. Taskar et al. [2001] suggest the use of probabilistic relational mod
els (PRMs) for the collective classiﬁcation task. PRMs [Koller & Pfeffer, 1998; Friedman
et al., 1999; Getoor et al., 2002] are a relational extension of Bayesian networks [Pearl,
1988]. A PRM speciﬁes a probability distribution over instantiations consistent with a
given instantiation graph by specifying a Bayesiannetworklike templatelevel probabilis
tic model for each entity type. Given a particular instantiation graph, the PRM induces
a large Bayesian network over that instantiation that speciﬁes a joint probability distribu
tion over all attributes of all of the entities. This network reﬂects the interactions between
related instances by allowing us to represent correlations between their attributes.
In our hypertext example, a PRM might use a naive Bayes model for words, with a di
rected edge between Doc.Label and each attribute Doc.HadWord
k
; each of these attributes
would have a conditional probability distribution P(Doc.HasWord
k
[ Doc.Label) associ
ated with it, indicating the probability that word k appears in the document given each of
the possible topic labels. More importantly, a PRM can represent the interdependencies
between topics of linked documents by introducing an edge from Doc.Label to Doc.Label
of two documents if there is a link between them. Given a particular instantiation graph
containing some set of documents and links, the PRM speciﬁes a Bayesian network over all
of the documents in the collection. We would have a probabilistic dependency from each
document’s label to the words on the document, and a dependency from each document’s
label to the labels of all of the documents to which it points. Taskar et al. show that this
approach works well for classifying scientiﬁc documents, using both the words in the title
112 CHAPTER 8. RELATIONAL MARKOV NETWORKS
and abstract and the citationlink structure.
However the application of this idea to other domains, such as webpages, is problematic
since there are many cycles in the link graph, leading to cycles in the induced “Bayesian
network”, which is therefore not a coherent probabilistic model. Getoor et al. [2001] sug
gest an approach where we do not include direct dependencies between the labels of linked
webpages, but rather treat links themselves as random variables. Each two pages have a
“potential link”, which may or may not exist in the data. The model deﬁnes the probability
of the link existence as a function of the labels of the two endpoints. In this link exis
tence model, labels have no incoming edges from other labels, and the cyclicity problem
disappears. This model, however, has other fundamental limitations. In particular, the re
sulting Bayesian network has a random variable for each potential link — N
2
variables for
collections containing N pages. This quadratic blowup occurs even when the actual link
graph is very sparse. When N is large (e.g., the set of all webpages), a quadratic growth is
intractable. Even more problematic are the inherent limitations on the expressive power im
posed by the constraint that the directed graph must represent a coherent generative model
over graph structures. The link existence model assumes that the presence of different
edges is a conditionally independent event. Representing more complex patterns involving
correlations between multiple edges is very difﬁcult. For example, if two pages point to the
same page, it is more likely that they point to each other as well. Such interactions between
many overlapping triples of links do not ﬁt well into the generative framework.
Furthermore, directed models such as Bayesian networks and PRMs are usually trained
to optimize the joint probability of the labels and other attributes, while the goal of clas
siﬁcation is a discriminative model of labels given the other attributes. The advantage
of training a model only to discriminate between labels is that it does not have to trade
off between classiﬁcation accuracy and modeling the joint distribution over nonlabel at
tributes. In many cases, discriminatively trained models are more robust to violations of
independence assumptions and achieve higher classiﬁcation accuracy than their generative
counterparts.
8.2. RELATIONAL MARKOV NETWORKS 113
Label 1
Label 2
Label 3
Figure 8.1: An unrolled Markov net over linked documents. The links follow a common
pattern: documents with the same label tend to link to each other more often.
8.2 Relational Markov networks
We now extend the framework of Markov networks to the relational setting. A relational
Markov network (RMN) speciﬁes a conditional distribution over all of the labels of all
of the entities in an instantiation given the relational structure and the content attributes.
(We provide the deﬁnitions directly for the conditional case, as the unconditional case is a
special case where the set of content attributes is empty.) Roughly speaking, it speciﬁes the
cliques and potentials between attributes of related entities at a template level, so a single
model provides a coherent distribution for any collection of instances from the schema.
For example, suppose that pages with the same label tend to link to each other, as
in Fig. 8.1. We can capture this correlation between labels by introducing, for each link, a
clique between the labels of the source and the target page. The potential on the clique will
have higher values for assignments that give a common label to the linked pages.
To specify what cliques should be constructed in an instantiation, we will deﬁne a no
tion of a relational clique template. Arelational clique template speciﬁes tuples of variables
in the instantiation by using a relational query language. For our link example, we can write
the template as a kind of SQL query:
SELECT doc1.Category, doc2.Category
114 CHAPTER 8. RELATIONAL MARKOV NETWORKS
FROM Doc doc1, Doc doc2, Link link
WHERE link.From = doc1.Key and link.To = doc2.Key
Note the three clauses that deﬁne a query: the FROM clause speciﬁes the cross prod
uct of entities to be ﬁltered by the WHERE clause and the SELECT clause picks out the
attributes of interest. Our deﬁnition of clique templates contains the corresponding three
parts.
A relational clique template C = (F, W, S) consists of three components:
◦ F = ¦F
i
¦ — a set of entity variables, where an entity variable F
i
is of type E(F
i
).
◦ W(F.R) — a boolean formula using conditions of the form F
i
.R
j
= F
k
.R
l
.
◦ F.S ⊆ F.X∪ F.Y — a selected subset of content and label attributes in F.
For the clique template corresponding to the SQL query above, Fconsists of doc1, doc2
and link of types Doc, Doc and Link, respectively. W(F.R) is link.From = doc1.Key ∧
link.To = doc2.Key and F.S is doc1.Category and doc2.Category.
A clique template speciﬁes a set of cliques in an instantiation 1:
C(1) ≡ ¦c = f .S : f ∈ 1(F) ∧ W(f .r)¦,
where f is a tuple of entities ¦f
i
¦ in which each f
i
is of type E(F
i
); 1(F) = 1(E(F
1
))
. . . 1(E(F
n
)) denotes the crossproduct of entities in the instantiation; the clause W(f .r)
ensures that the entities are related to each other in speciﬁed ways; and ﬁnally, f .S selects
the appropriate attributes of the entities. Note that the clique template does not specify the
nature of the interaction between the attributes; that is determined by the clique potentials,
which will be associated with the template.
This deﬁnition of a clique template is very ﬂexible, as the WHERE clause of a tem
plate can be an arbitrary predicate. It allows modeling complex relational patterns on the
instantiation graphs. To continue our webpage example, consider another common pattern
in hypertext: links in a webpage tend to point to pages of the same category. This pattern
can be expressed by the following template:
SELECT doc1.Category, doc2.Category
8.2. RELATIONAL MARKOV NETWORKS 115
FROM Doc doc1, Doc doc2, Link link1, Link link2
WHERE link1.From = link2.From and link1.To = doc1.Key
and link2.To = doc2.Key and not doc1.Key = doc2.Key
Depending on the expressive power of our template deﬁnition language, we may be able
to construct very complex templates that select entire subgraph structures of an instantia
tion. We can easily represent patterns involving three (or more) interconnected documents
without worrying about the acyclicity constraint imposed by directed models. Since the
clique templates do not explicitly depend on the identities of entities, the same template can
select subgraphs whose structure is fairly different. The RMN allows us to associate the
same clique potential parameters with all of the subgraphs satisfying the template, thereby
allowing generalization over a wide range of different structures.
A Relational Markov network (RMN) / = (C, Φ) speciﬁes a set of clique templates
C and corresponding potentials Φ = ¦φ
C
¦
C∈C
to deﬁne a conditional distribution:
P(1.y [ 1.x, 1.r)
=
1
Z(1.x, 1.r)
C∈C
c∈C(7)
φ
C
(1.x
c
, 1.y
c
)
where Z(1.x, 1.r) is the normalizing partition function:
Z(1.x, 1.r) =
7.y
C∈C
c∈C(7)
φ
C
(1.x
c
, 1.y
t
c
)
.
Using the loglinear representation of potentials, φ
C
(V
C
) = exp¦w
¯
C
f
C
(V
C
)¦, we can
write
log P(1.y [ 1.x, 1.r) = w
¯
f (1.x, 1.y, 1.r) −log Z(1.x, 1.r)
where
f
C
(1.x, 1.y, 1.r) =
c∈C(7)
f
C
(1.x
c
, 1.y
c
)
is the sum over all appearances of the template C(1) in the instantiation, and f is the vector
116 CHAPTER 8. RELATIONAL MARKOV NETWORKS
of all f
C
.
Given a particular instantiation 1 of the schema, the RMN / produces an unrolled
Markov network over the attributes of entities in 1. The cliques in the unrolled network
are determined by the clique templates C. We have one clique for each c ∈ C(1), and
all of these cliques are associated with the same clique potential φ
C
. In our webpage
example, an RMN with the link basis function described above would deﬁne a Markov net
in which, for every link between two pages, there is an edge between the labels of these
pages. Fig. 8.1 illustrates a simple instance of this unrolled Markov network.
8.3 Approximate inference and learning
Applying both maximum likelihood and maximum margin learning in the relational setting
is requires inference in very large and complicated networks, where exact inference is
typically intractable. We therefore resort to approximate methods.
Maximum likelihood estimation
For maximum likelihood learning, we need to compute basis function expectations, not
just the most likely assignment. There is a wide variety of approximation schemes for this
problem, including MCMC and variational methods. We chose to use belief propagation
for its simplicity and relative efﬁciency and accuracy. Belief Propagation (BP) is a local
message passing algorithm introduced by Pearl [1988]. It is guaranteed to converge to the
correct marginal probabilities for each node only for singly connected Markov networks.
However, recent analysis [Yedidia et al., 2000] provides some theoretical justiﬁcation. Em
pirical results [Murphy et al., 1999] show that it often converges in general networks, and
when it does, the marginals are a good approximation to the correct posteriors. As our
results in Sec. 8.4 show, this approach works well in our domain. We refer the reader to
Yedidia et al. for a detailed description of the BP algorithm.
We provide a brief outline of one variant of BP, referring to [Murphy et al., 1999]
for more details. For simplicity, we assume a pairwise network where all potentials are
associated only with nodes and edges given by:
8.3. APPROXIMATE INFERENCE AND LEARNING 117
P(Y
1
, . . . , Y
n
) =
1
Z
ij
ψ
ij
(Y
i
, Y
j
)
i
ψ
i
(Y
i
)
where ij ranges over the edges of the network and ψ
ij
(Y
i
, Y
j
) = φ(x
ij
, Y
i
, Y
j
), ψ
i
(Y
i
) =
φ(x
i
, Y
i
).
The belief propagation algorithm is very simple. At each iteration, each node Y
i
sends
the following messages to all its neighbors N(i):
m
ij
(Y
j
) ←α
y
i
ψ
ij
(y
i
, Y
j
)ψ
i
(y
i
)
k∈N(i)−j
m
ki
(Y
i
)
where α is a (different) normalizing constant. This process is repeated until the messages
converge. At any point in the algorithm, the marginal distribution of any node Y
i
is approx
imated by
b
i
(Y
i
) = αψ
i
(Y
i
)
k∈N(i)
m
ki
(Y
i
)
and the marginal distribution of a pair of nodes connected by an edge is approximated by
b
ij
(Y
i
, Y
j
) = αψ
ij
(Y
i
, Y
j
)ψ
i
(Y
i
)ψ
j
(Y
j
)
k∈N(i)−j
m
ki
(Y
i
)
l∈N(j)−i
m
lj
(Y
j
)
These approximate marginals are precisely what we need for the computation of the
basis function expectations and performing classiﬁcation. Computing the expected basis
function expectations involves summing their expected values for each clique using the
approximate marginals b
i
(Y
i
) and b
ij
(Y
i
, Y
j
). Similarly, we use max
y
i
b
i
(Y
i
) at prediction
time. Note that we can also max −product variant of loopy BP, with
m
ij
(Y
j
) ←αmax
y
i
ψ
ij
(y
i
, Y
j
)ψ
i
(y
i
)
k∈N(i)−j
m
ki
(Y
i
)
to compute approximate posterior “max”marginals and use those for prediction. In our
experiments, this results in less accurate classiﬁcation, so we use posterior marginal pre
diction.
118 CHAPTER 8. RELATIONAL MARKOV NETWORKS
Maximum margin estimation
For maximummargin estimation, we used approximate LP inference inside the maxmargin
QP, using commercial Ilog CPLEX software to solve it. For networks with general poten
tials, we used the untriangulated LP we described in Sec. 5.4. The untriangulated LP
produced fractional solutions for inference on the test data in several settings, which we
rounded independently for each label. For networks with attractive potentials (AMNs), we
used the LP in Sec. 7.2, which always produced integral solutions on test data.
8.4 Experiments
We tried out our framework on the WebKB dataset [Craven et al., 1998], which is an in
stance of our hypertext example. The data set contains webpages from four different Com
puter Science departments: Cornell, Texas, Washington and Wisconsin. Each page has a
label attribute, representing the type of webpage which is one of course, faculty, student,
project or other. The data set is problematic in that the category other is a grabbag of
pages of many different types. The number of pages classiﬁed as other is quite large,
so that a baseline algorithm that simply always selected other as the label would get an
average accuracy of 75%. We could restrict attention to just the pages with the four other
labels, but in a relational classiﬁcation setting, the deleted webpages might be useful in
terms of their interactions with other webpages. Hence, we compromised by eliminating
all other pages with fewer than three outlinks, making the number of other pages com
mensurate with the other categories. The resulting category distribution is: course (237),
faculty (148), other (332), researchproject (82) and student (542). The number of remain
ing pages for each school are: Cornell (280), Texas (292), Washington (315) and Wisconsin
(454). The number of links for each school are: Cornell (574), Texas (574), Washington
(728) and Wisconsin (1614).
For each page, we have access to the entire html of the page and the links to other
pages. Our goal is to collectively classify webpages into one of these ﬁve categories. In all
of our experiments, we learn a model from three schools and test the performance of the
learned model on the remaining school, thus evaluating the generalization performance of
8.4. EXPERIMENTS 119
the different models. We used C ∈ [0.1, 10] and took the best setting for all models.
Unfortunately, we cannot directly compare our accuracy results with previous work
because different papers use different subsets of the data and different training/test splits.
However, we compare to standard text classiﬁers such as Naive Bayes, Logistic Regression,
and Support Vector Machines, which have been demonstrated to be successful on this data
set [Joachims, 1999].
8.4.1 Flat models
The simplest approach we tried predicts the categories based on just the text content on
the webpage. The text of the webpage is represented using a set of binary attributes that
indicate the presence of different words on the page. We found that stemming and feature
selection did not provide much beneﬁt and simply pruned words that appeared in fewer
than three documents in each of the three schools in the training data. We also experi
mented with incorporating metadata: words appearing in the title of the page, in anchors
of links to the page and in the last header before a link to the page [Yang et al., 2002].
Note that metadata, although mostly originating from pages linking into the considered
page, are easily incorporated as features, i.e. the resulting classiﬁcation task is still ﬂat
featurebased classiﬁcation. Our ﬁrst experimental setup compares three wellknown text
classiﬁers — Naive Bayes, linear support vector machines (Svm), and logistic regression
(Logistic) — using words and metawords. The results, shown in Fig. 8.2, show that the
two discriminative approaches outperformNaive Bayes. Logistic and Svmgive very sim
ilar results. The average error over the 4 schools was reduced by around 4% by introducing
the metadata attributes.
Incorporating metadata gives a signiﬁcant improvement, but we can take additional
advantage of the correlation in labels of related pages by classifying them collectively. We
want to capture these correlations in our model and use them for transmitting informa
tion between linked pages to provide more accurate classiﬁcation. We experimented with
several relational models.
120 CHAPTER 8. RELATIONAL MARKOV NETWORKS
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
NaïveBayes Svm Logistic
T
e
s
t
E
r
r
o
r
Words Words+Meta
Figure 8.2: Comparison of Naive Bayes, Svm, and Logistic on WebKB, with and without
metadata features. (Only averages over the 4 schools are shown here.)
8.4.2 Link model
Our ﬁrst model captures direct correlations between labels of linked pages. These corre
lations are very common in our data: courses and research projects almost never link to
each other; faculty rarely link to each other; students have links to all categories but mostly
courses. The Link model, shown in Fig. 8.1, captures this correlation through links: in
addition to the local bag of words and metadata attributes, we introduce a relational clique
template over the labels of two pages that are linked.We train this model using maximum
conditional likelihood (labels given the words and the links) and maximum margin.
We also compare to a directed graphical model to contrast discriminative and genera
tive models of relational structure. The ExistsML model is a (partially) generative model
proposed by Getoor et al. [2001]. For each page, a logistic regression model predicts
the page label given the words and metafeatures. Then a simple generative model speci
ﬁes a probability distribution over the existence of links between pages conditioned on both
pages’ labels. Concretely, we learn the probability of existence of a link between two pages
given their labels. Note that this model does not require inference during learning. Max
imum likelihood estimation (with regularization) of the generative component is closed
8.4. EXPERIMENTS 121
0%
5%
10%
15%
20%
25%
30%
Cor Tex Was Wis Average
E
r
r
o
r
ExistsML
SVM
LinkML
LinkMM
Figure 8.3: Comparison of ﬂat versus collective classiﬁcation on WebKB: SVM, Exists
model with logistic regression and the Link model estimated using the maximum likelihood
(ML) and the maximum margin (MM) criteria.
form given appropriate cooccurrence counts of linked pages’ labels. However, the predic
tion phase is much more expensive, since the resulting graphical model includes edges not
only for the existing hyperlinks, but also those that do not exist. Intuitively, observing the
link structure directly correlates all page labels in a website, linked or not. By contrast,
the Link model avoids this problem by only modeling the conditional distribution given the
existing links.
Fig. 8.3 shows a gain in accuracy from SVMs to the Link model by using the corre
lations between labels of linked web pages. There is also very signiﬁcant additional gain
by using maximum margin training: the error rate of LinkMM is 40% lower than that of
LinkML, and 51% lower than multiclass SVMs. The Exists model doesn’t perform very
well in comparison. This can be attributed to the simplicity of the generative model and the
difﬁculty of the resulting inference problem.
8.4.3 Cocite model
The second relational model uses the insight that a webpage often has internal structure
that allows it to be broken up into sections. For example, a faculty webpage might have
122 CHAPTER 8. RELATIONAL MARKOV NETWORKS
0%
5%
10%
15%
20%
25%
Cor Tex Was Wis Average
E
r
r
o
r
SVM
CociteML
CociteMM
Figure 8.4: Comparison of Naive Bayes, Svm, and Logistic on WebKB, with and without
metadata features. (Only averages over the 4 schools are shown here.)
one section that discusses research, with a list of links to all of the projects of the faculty
member, a second section might contain links to the courses taught by the faculty member,
and a third to his advisees. We can view a section of a webpage as a ﬁnegrained version of
Kleinberg’s hub [Kleinberg, 1999] (a page that contains a lot of links to pages of particular
category). Intuitively, if two pages are cocited, or linked to from the same section, they are
likely to be on similar topics. Note that we expect the correlation between the labels in this
case to be positive, so we can use AMNtype potentials in the maxmargin estimation. The
Cocite model captures this type of correlation.
To take advantage of this trend, we need to enrich our schema by adding the attribute
Section to Link to refer to the section number it appears in. We deﬁned a section as a
sequence of three or more links that have the same path to the root in the html parse tree.
In the RMN, we have a relational clique template deﬁned by:
SELECT doc1.Category, doc2.Category
FROM Doc doc1, Doc doc2, Link link1, Link link2
WHERE link1.From = link2.From and link1.Section = link2.Section and
link1.To = doc1.Key and link2.To = doc2.Key and not doc1.Key = doc2.Key
We compared the performance of SVM, CociteML and CociteMM. The results,
8.5. RELATED WORK 123
shown in Fig. 8.4, also demonstrate signiﬁcant improvements of the relational models over
the SVM. The improvement is present when testing on each of the schools. Again, maxi
mum likelihood trained model CociteML achieves a worse test error than maximum mar
gin CociteMM model, which shows a 30% relative reduction in test error over SVM.
We note that, in our experiments, the learned CociteMM weights never produced frac
tional solutions when used for inference, which suggests that the optimization successfully
avoided problematic parameterizations of the network, even in the case of the nonoptimal
multiclass relaxation.
8.5 Related work
Our RMN representation is most closely related to the work on PRMs [Koller & Pfeffer,
1998]. Later work showed how to efﬁciently learn model parameters and structure (equiv
alent of clique selection in Markov networks) from data [Friedman et al., 1999]. Getoor
et al. [2002] propose several generative models of relational structure. Their approach
easily captures the dependence of link existence on attributes of entities. However there
are many patterns that we are difﬁcult to model in PRMs, in particular those that involve
several links at a time. We give some examples here.
One useful type of pattern type is a similarity template, where objects that share a cer
tain graphbased property are more likely to have the same label. Consider, for example,
a professor X and two other entities Y and Z. If X’s webpage mentions Y and Z in the
same context, it is likely that the XY relation and the YZ relation are of the same type; for
example, if Y is Professor X’s advisee, then probably so is Z. Our framework accommo
dates these patterns easily, by introducing pairwise cliques between the appropriate relation
variables.
Another useful type of subgraph template involves transitivity patterns, where the pres
ence of an AB link and of a BC link increases (or decreases) the likelihood of an AC link.
For example, students often assist in courses taught by their advisor. Note that this type
of interaction cannot be accounted for just using pairwise cliques. By introducing cliques
over triples of relations, we can capture such patterns as well. We can incorporate even
more complicated patterns, but of course we are limited by the ability of belief propagation
124 CHAPTER 8. RELATIONAL MARKOV NETWORKS
to scale up as we introduce larger cliques and tighter loops in the Markov network.
We describe and exploit these patterns in our work on RMNs using maximumlikelihood
estimation [Taskar et al., 2003b]. Attempts to model such pattern in PRMs run into the
constraint that the probabilistic dependency graph (Bayesian network) must be a directed
acyclic graph. For example, for the transitivity pattern, we might consider simply directing
the correlation edges between link existence variables arbitrarily. However, it is not clear
how to parameterize a link existence variable for a link that is involved in multiple triangles.
The structure of the relational graph has been used extensively to infer importance in
scientiﬁc publications [Egghe & Rousseau, 1990] and hypertext [Kleinberg, 1999]. Sev
eral recent papers have proposed algorithms that use the link graph to aid classiﬁcation.
Chakrabarti et al. [1998] use systempredicted labels of linked documents to iteratively
relabel each document in the test set, achieving a signiﬁcant improvement compared to a
baseline of using the text in each document alone. A similar approach was used by Neville
and Jensen [2000] in a different domain. Slattery and Mitchell [2000] tried to identify di
rectory (or hub) pages that commonly list pages of the same topic, and used these pages to
improve classiﬁcation of university webpages. However, none of these approaches provide
a coherent model for the correlations between linked webpages, applying combinations of
classiﬁers in a procedural way, with no formal justiﬁcation.
8.6 Conclusion
In this chapter, we propose a new approach for classiﬁcation in relational domains. Our ap
proach provides a coherent foundation for the process of collective classiﬁcation, where we
want to classify multiple entities, exploiting the interactions between their labels. We have
shown that we can exploit a very rich set of relational patterns in classiﬁcation, signiﬁcantly
improving the classiﬁcation accuracy over standard ﬂat classiﬁcation.
In some cases, we can incorporate relational features into standard ﬂat classiﬁcation.
For example, when classifying papers into topics, it is possible to simply view the presence
of particular citations as atomic features. However, this approach is limited in cases where
some or even all of the relational features that occur in the test data are not observed in
the training data. In our WebKB example, there is no overlap between the webpages in the
8.6. CONCLUSION 125
different schools, so we cannot learn anything from the training data about the signiﬁcance
of a hyperlink to/from a particular webpage in the test data. Incorporating basic features
(e.g., words) from the related entities can aid in classiﬁcation, but cannot exploit the strong
correlation between the labels of related entities that RMNs capture.
Hypertext is the most easily available source of structured data, however, RMNs are
generally applicable to any relational domain. The results in this chapter represent only
a subset of the domains we have worked on (see [Taskar et al., 2003b]). In particular,
social networks provide extensive information about interactions among people and orga
nizations. RMNs offer a principled method for learning to predict communities of and
hierarchical structure between people and organizations based on both the local attributes
and the patterns of static and dynamic interaction. Given the wealth of possible patterns, it
is particularly interesting to explore the problem of inducing them automatically.
126 CHAPTER 8. RELATIONAL MARKOV NETWORKS
Part III
Broader applications: parsing,
matching, clustering
127
Chapter 9
Context free grammars
We present a novel discriminative approach to parsing using structured maxmargin crite
rion based on the decomposition properties of context free grammars. We show that this
framework allows highaccuracy parsing in cubic time by exploiting novel kinds of lexical
information. Our models can condition on arbitrary features of input sentences, thus incor
porating an important kind of lexical information not usually used by conventional parsers.
We show experimental evidence of the model’s improved performance over a natural base
line model and a lexicalized probabilistic contextfree grammar.
9.1 Context free grammar model
CFGs are one of the primary formalisms for capturing the recursive structure of syntactic
constructions, although many others have also been proposed [Manning & Sch¨ utze, 1999].
For clarity of presentation, we restrict our grammars to be in Chomsky normal form as
in Sec. 3.4. The nonterminal symbols correspond to syntactic categories such as noun
phrase (NP) or verbal phrase (VP). The terminal symbols are usually words of the sen
tence. However, in the discriminative framework that we adopt, we are not concerned with
deﬁning a distribution over sequences of words (language model). Instead, we condition
on the words in a sentence to produce a model of the syntactic structure. Terminal sym
bols for our purposes are partofspeech tags like nouns (NN), verbs (VBD), determiners
(DT). For example, Fig. 9.1(a) shows a parse tree for the sentence The screen was a sea of
128
9.1. CONTEXT FREE GRAMMAR MODEL 129
red. The set of symbols we use is based on the Penn Treebank [Marcus et al., 1993]. The
nonterminal symbols with bars (for example, DT, NN, VBD) are added to conform to the
CNF restrictions. For convenience, we repeat our deﬁnition of a CFG from Sec. 3.4 here:
Deﬁnition 9.1.1 (CFG) A CFG ( consists of:
◦ A set of nonterminal symbols, ^
◦ A designated set of start symbols, ^
S
⊆ ^
◦ A set of terminal symbols, T
◦ A set of productions, T = ¦T
B
, T
U
¦, divided into
Binary productions, T
B
= ¦A →B C : A, B, C ∈ ^¦ and
Unary productions, T
U
= ¦A → D : A ∈ ^, D ∈ T ¦.
A CFG deﬁnes a set of valid parse trees in a natural manner:
Deﬁnition 9.1.2 (CFG tree) A CFG tree is a labeled directed tree, where the set of valid
labels of the internal nodes other than the root is ^ and the set of valid labels for the leaves
is T . The root’s label set is ^
S
. Additionally, each preleaf node has a single child and
this pair of nodes can be labeled as A and D, respectively, if and only if there is a unary
production A → D ∈ T
U
. All other internal nodes have two children, left and right, and
this triple of nodes can be labeled as A, B and C, respectively, if and only if there is a
binary production A →B C ∈ T
B
.
In general, there are exponentially many parse trees that produce a sentence of length n.
This tree representation seems quite different from the graphical models we have been
considering thus far. However, we can use an equivalent representation that essentially
encodes a tree as an assignment to a set of appropriate variables. For each span starting
with s and an ending with e, we introduce a variable Y
s,e
taking values in ^∪⊥to represent
the label of the subtree that exactly covers, or dominates, the words of the sentence from
s to e. The value ⊥ is assigned if no subtree dominates the span. Indices s and e refer to
positions between words, rather than to words themselves, hence 0 ≤ s < e ≤ n for a
sentence of length n. The “top” symbol Y
0,n
is constrained to be in ^
S
, since it represents
130 CHAPTER 9. CONTEXT FREE GRAMMARS
(a) (b)
Figure 9.1: Two representations of a binary parse tree: (a) nested tree structure, and (b)
grid of labeled spans. The row and column number are the beginning and end of the span,
respectively. Empty squares correspond to nonconstituent spans. The gray squares on the
diagonal represent partofspeech tags.
the starting symbol of the sentence. We also introduce variables Y
s,s
taking values in T to
represent the terminal symbol (partofspeech) between s and s +1. If Y
s,e
,= ⊥, it is often
called a constituent. Fig. 9.1(b) shows the representation of the tree in Fig. 9.1(a) as a grid
where each square corresponds to Y
s,e
. The row and column number in the grid correspond
to the beginning and end of the span, respectively. Empty squares correspond to ⊥ values.
The gray squares on the diagonal represent the terminal variables. For example, the ﬁgure
shows Y
0,0
= DT, Y
6,6
= NN, Y
3,5
= NP and Y
1,4
= ⊥.
While any parse tree corresponds to an assignment to this set of variables in a straight
forward manner, the converse is not true: there are assignments that do not correspond
to valid parse trees. In order to characterize the set of valid assignments ¸, consider the
9.1. CONTEXT FREE GRAMMAR MODEL 131
constraints that hold for a valid assignment y:
1I(y
s,e
= A) =
A→B C∈P
B
s<m<e
1I(y
s,m,e
= (A, B, C)), 0 ≤ s < e ≤ n, ∀A ∈ ^; (9.1)
1I(y
s,e
= A) =
B→A C∈P
B
0≤s
<s
1I(y
s
,s,e
= (B, A, C))
+
B→C A∈P
B
e<e
≤n
1I(y
s,e,e
= (B, C, A)), 0 ≤ s < e ≤ n, ∀A ∈ ^; (9.2)
1I(y
s,s+1
= A) =
A→D∈1
U
1I(y
s,s,s+1
= (A, D)), 0 ≤ s < n, ∀A ∈ ^; (9.3)
1I(y
s,s
= D) =
A→D∈1
U
1I(y
s,s,s+1
= (A, D)), 0 ≤ s < n, ∀D ∈ T . (9.4)
The notation y
s,m,e
= (A, B, C) abbreviates y
s,e
= A ∧ y
s,m
= B ∧ y
m,e
= C and
y
s,s,s+1
= (A, D) abbreviates y
s,s+1
= A ∧ y
s,s
= D. The ﬁrst set of constraints (9.1)
holds because if the span from s to e is dominated by a subtree starting with A (that is,
y
s,e
= A), then there must be a unique production starting with A and some split point m,
s < m < e, that produces that subtree. Conversely, if y
s,e
,= A, no productions start with
A and cover s to e. The second set of constraints (9.2) holds because that if the span from
s to e is dominated by a subtree starting with A (y
s,e
= A), then there must be a (unique)
production that generated it: either starting before s or after e. Similarly, the third and
fourth set of constraints (9.3 and 9.4) hold since the terminals are generated using valid
unary productions. We denote the set of assignments y satisfying (9.19.4) as ¸. In fact
the converse is true as well:
Theorem 9.1.3 If y ∈ ¸, then y represents a valid CFG tree.
Proof sketch: It is straightforward to construct a parse tree from y ∈ ¸ in a topdown
manner. Starting from the root symbol, y
0,n
, the ﬁrst set of constraints (9.1) ensures that a
unique production spans 0 to n, say splitting at m and specifying the values for y
0,m
and
y
m,n
. The second set of constraints (9.2) ensures that all other spans y
0,m
and y
m
,n
, for
m
t
,= m are labeled by ⊥. Recursing on the two subtrees, y
0,m
and y
m,n
, will produce the
rest of the tree down to the preterminals. The last two sets of constraints (9.3 and 9.4)
132 CHAPTER 9. CONTEXT FREE GRAMMARS
ensure that the terminals are generated by an appropriate unary productions from the pre
terminals.
9.2 Context free parsing
A standard approach to parsing is to use a CFG to deﬁne a probability distribution over
parse trees. This can be done simply by assigning a probability to each production and
making sure that the sum of probabilities of all productions starting with each symbol is 1:
B,C:A→B C∈1
B
P(A →B C) = 1,
D:A→D∈1
U
P(A →D) = 1, ∀A ∈ ^.
The probability of a tree is simply the product of probabilities of the productions used in
the tree. More generally, a weighted CFG assigns a score to each production (this score
may depend on the position of the production s, m, e) such that the total score of a tree is
the sum of the score of all the productions used:
S(y) =
0≤s<m<e≤n
S
s,m,e
(y
s,m,e
) +
0≤s<n
S
s,s+1
(y
s,s+1
),
where S
s,m,e
(y
s,m,e
) = 0 if (y
s,e
= ⊥ ∨ y
s,m
= ⊥ ∨ y
m,e
= ⊥). If the production scores
are production log probabilities, then the tree score is the tree log probability. However,
weighted CFGs do not have the local normalization constraints Eq. (9.5).
We can use a Viterbistyle dynamic programming algorithm called CKY to compute
the highest score parse tree in O([T[n
3
) time [Younger, 1967; Manning & Sch¨ utze, 1999].
The algorithm computes the highest score of any subtree starting with a symbol over each
span 0 ≤ s < e ≤ n recursively:
S
∗
s,s+1
(A) = max
A→D∈1
U
S
s,s+1
(A, D), 0 ≤ s < n, ∀A ∈ ^; (9.5)
S
∗
s,e
(A) = max
A→B C∈P
B
s<m<e
S
s,m,e
(A, B, C) + S
∗
s,m
(B) + S
∗
m,e
(C), 0 ≤ s < e ≤ n, ∀A ∈ ^.
The highest scoring tree has score max
A∈A
S
S
∗
0,n
(A). Using the arg max’s of the max’s in
9.3. DISCRIMINATIVE PARSING MODELS 133
the computation of S
∗
, we can backtrace the highest scoring tree itself. We assume that
score ties are broken in a predetermined way, say according to some lexicographic order of
the symbols.
9.3 Discriminative parsing models
We cast parsing as a structured classiﬁcation task, where we want to learn a function h :
A → ¸, where A is a set of sentences, and ¸ is a set of valid parse trees according to a
ﬁxed CFG grammar.
The functions we consider take the following linear discriminant form:
h
w
(x) = arg max
y
w
¯
f (x, y),
where w ∈ IR
d
and f is a basis function representation of a sentence and parse tree pair
f : A ¸ → IR
d
. We assume that the basis functions decompose with the CFG structure:
f (x, y) =
0≤s≤e≤n
f (x
s,e
, y
s,e
) +
0≤s≤m<e≤n
f (x
s,m,e
, y
s,m,e
),
where n is the length of the sentence x and x
s,e
and x
s,m,e
are the relevant subsets of
the sentence the basis functions depend on. To simplify notation, we introduce the set of
indices, (, which includes both spans and span triplets:
( = ¦(s, m) : 0 ≤ s ≤ e ≤ n¦ ∪ ¦(s, m, e) : 0 ≤ s ≤ m < e ≤ n¦.
Hence, f (x, y) =
c∈(
f (x
c
, y
c
).
Note that this class of discriminants includes PCFG models, where the basis func
tions consist of the counts of the productions used in the parse, and the parameters w are
the logprobabilities of those productions. For example, f could include functions which
identify the production used together with features of the words at positions s, m, e, and
neighboring positions in the sentence x (e.g. f(x
s,m,e
, y
s,m,e
) = 1I(y
s,m,e
= S, NP, VP) ∧
m
th
word(x) = was)). We could also include functions that identify the label of the span
134 CHAPTER 9. CONTEXT FREE GRAMMARS
from s to e together with features of the word (e.g. f(x
s,m
, y
s,m
) = 1I(y
s,m
= NP) ∧
s
th
word(x) = the)).
9.3.1 Maximum likelihood estimation
The traditional method of estimating the parameters of PCFGs assumes a generative model
that deﬁnes P(x, y) by assigning normalized probabilities to CFG productions. We then
maximize the joint loglikelihood
i
log P(x
(i)
, y
(i)
) (with some regularization). We com
pare to such a generative grammar of Collins [1999] in our experiments.
A alternative probabilistic approach is to estimate the parameters discriminatively by
maximizing conditional loglikelihood. For example, the maximumentropy approach [John
son, 2001] deﬁnes a conditional loglinear model:
P
w
(y [ x) =
1
Z
w
(x)
exp¦w
¯
f (x, y)¦,
where Z
w
(x) =
y
exp¦w
¯
f (x, y)¦, and maximizes the conditional loglikelihood of
the sample,
i
log P(y
(i)
[ y
(i)
), (with some regularization). The same assumption that
the basis functions decompose as sums of local functions over spans and productions is
typically made in such models. Hence, as in Markov networks, the gradient depends
on the expectations of the basis functions, which can be computed in O([T[n
3
) time by
dynamic programming algorithm called insideoutside, which is similar to the CKY al
gorithm. However, computing the expectations over trees is actually more expensive in
practice than ﬁnding the best tree for several reasons. CKY works entirely in the logspace,
while insideoutside needs to compute actual probabilities. Branchandprune techniques,
which save a lot of useless computation, are only applicable in CKY.
A typical method for ﬁnding the parameters is to use Conjugate Gradients or LBFGS
methods [Nocedal & Wright, 1999; Boyd & Vandenberghe, 2004], which repeatedly com
pute these expectations to calculate the gradient. Clark and Curran [2004] report experi
ments involving 479 iterations of training for one model, and 1550 iterations for another
using similar methods.
9.3. DISCRIMINATIVE PARSING MODELS 135
9.3.2 Maximum margin estimation
We assume that loss function also decomposes with the CFG structure:
(x, y, ˆ y) =
0≤s≤e≤n
(x
s,e
, y
s,e
, ˆ y
s,e
) +
0≤s≤m<e≤n
(x
s,m,e
, y
s,m,e
, ˆ y
s,m,e
) =
c∈(
(x
c
, y
c
, ˆ y
c
).
One approach would be to deﬁne (x
s,e
, y
s,e
, ˆ y
s,e
) = 1I(y
s,e
,= ˆ y
s,e
). This would lead to
(x, y, ˆ y) tracking the number of “constituent errors” in ˆ y. Another, more strict deﬁnition
would be to deﬁne (x
s,m,e
, y
s,m,e
, ˆ y
s,m,e
) = 1I(y
s,m,e
,= ˆ y
s,m,e
). This deﬁnition would lead
to (x, y, ˆ y) being the number of productions in ˆ y which are not seen in y. The constituent
loss function does not exactly correspond to the standard scoring metrics, such as F
1
or
crossing brackets, but shares the sensitivity to the number of differences between trees. We
have not thoroughly investigated the exact interplay between the various loss choices and
the various parsing metrics. We used the constituent loss in our experiments.
As in the maxmargin estimation for Markov networks, we can formulate an exponen
tial size QP:
min
1
2
[[w[[
2
+ C
i
ξ
i
(9.6)
s.t. w
¯
∆f
i
(y) ≥
i
(y) −ξ
i
∀i, y,
where ∆f
i
(y) = f (x
(i)
, y
(i)
) −f (x
(i)
, y), and
i
(y) = (x
(i)
, y
(i)
, y).
The dual of Eq. (9.6) (after normalizing by C) is given by:
max
i,y
α
i
(y)
i
(y) −
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,y
α
i
(y)∆f
i
(y)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(9.7)
s.t.
y
α
i
(y) = 1, ∀i; α
i
(y) ≥ 0, ∀i, y.
Both of the above formulations are exponential (in the number of variables or con
straints) in the lengths (n
i
’s) of the sentences. But we can exploit the contextfree structure
of the basis functions and the loss to deﬁne a polynomialsize dual formulation in terms of
136 CHAPTER 9. CONTEXT FREE GRAMMARS
marginal variables µ
i
(y):
µ
i,s,e
(A) ≡
y:y
s,e
=A
α
i
(y), 0 ≤ s ≤ e ≤ n, ∀A ∈ ^;
µ
i,s,s
(D) ≡
y:y
s,s
=D
α
i
(y), 0 ≤ s ≤ e ≤ n, ∀D ∈ T ;
µ
i,s,m,e
(A, B, C) ≡
y:y
s,m,e
=(A,B,C)
α
i
(y), 0 ≤ s < m < e ≤ n, ∀A →B C ∈ T
B
,
µ
i,s,s,s+1
(A, D) ≡
y:y
s,s,s+1
=(A,D)
α
i
(y), 0 ≤ s < n, ∀A →D ∈ T
U
.
There are O([T
B
[n
3
i
+ [T
U
[n
i
) such variables for each sentence of length n
i
, instead of
exponentially many α
i
variables. We can now express the objective function in terms of
the marginals. Using these variables, the ﬁrst set of terms in the objective becomes:
i,y
α
i
(y)
i
(y) =
i,y
α
i
(y)
c∈(
(i)
i,c
(y
c
) =
i,c∈(
(i)
,y
c
µ
i,c
(y
c
)
i,c
(y
c
).
Similarly, the second set of terms (inside the 2norm) becomes:
i,y
α
i
(y)∆f
i
(y) =
i,y
α
i
(y)
c∈(
(i)
∆f
i,c
(y
c
) =
i,c∈(
(i)
,y
c
µ
i,c
(y
c
)∆f
i,c
(y
c
).
As in M
3
Ns, we must characterize the set of marginals µ that corresponds to valid
α. The constraints on µ are essentially based on the those that deﬁne ¸ in (9.19.4). In
addition, we require that the marginals over the root nodes, µ
i,0,n
i
(y
0,n
i
), sums to 1 over the
possible start symbols ^
S
.
9.3. DISCRIMINATIVE PARSING MODELS 137
Putting the pieces together, the factored dual is:
max
i,c∈(
(i)
µ
i,c
(y
c
)
i,c
(y
c
) + C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,c∈(
(i)
µ
i,c
(y
c
)∆f
i,c
(y
c
)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(9.8)
s.t.
A∈A
S
µ
i,0,n
i
(A) = 1, ∀i; µ
i,c
(y
c
) ≥ 0; ∀i, ∀c ∈ (
(i)
;
µ
i,s,e
(A) =
A→B C∈P
B
s<m<e
µ
i,s,m,e
(A, B, C), ∀i, 0 ≤ s < e ≤ n
i
, ∀A ∈ ^;
µ
i,s,e
(A) =
B→A C∈P
B
0≤s
<s
µ
i,s
,s,e
(B, A, C)
+
B→C A∈P
B
e<e
≤n
i
µ
i,s,e,e
(B, C, A), ∀i, 0 ≤ s < e ≤ n
i
, ∀A ∈ ^;
µ
i,s,s+1
(A) =
A→D∈1
U
µ
i,s,s,s+1
(A, D), ∀i, 0 ≤ s < n
i
, ∀A ∈ ^;
µ
i,s,s
(D) =
A→D∈1
U
µ
i,s,s,s+1
(A, D), ∀i, 0 ≤ s < n
i
, ∀D ∈ T .
The constraints on µ is necessary, since they must correspond to marginals of a distri
bution over trees. They are also sufﬁcient:
Theorem 9.3.1 A set of marginals µ
i
(y) satisfying the constraints in Eq. (9.8) corresponds
to a valid distribution over the legal parse trees y ∈ ¸
(i)
. A consistent distribution α
i
(y)
is given by
α
i
(y) = µ
i,0,n
i
(y
0,n
i
)
0≤s≤m<e≤n
i
µ
i,s,m,e
(y
s,m,e
)
µ
i,s,e
(y
s,e
)
,
where 0/0 = 0 by convention.
Proof sketch: The proof follows from insideoutside probability relations [Manning &
Sch¨ utze, 1999]. The ﬁrst term is a valid distribution of starting symbols. Each
µ
i,s,m,e
(y
s,m,e
)
µ
i,s,e
(y
s,e
)
term for m > s corresponds to a conditional distribution over binary productions (y
s,e
→
y
s,m
y
m,e
) that are guaranteed to sum to 1 over split points m and possible productions.
Similarly, each
µ
i,s,s,s+1
(y
s,s,s+1
)
µ
i,s,s+1
(y
s,s+1
)
term for corresponds to a conditional distribution over
138 CHAPTER 9. CONTEXT FREE GRAMMARS
unary productions (y
s,s+1
→ y
s,s
) that are guaranteed to sum to 1 over possible produc
tions. Hence, we have deﬁned a kind of PCFG (where production probabilities depend on
the location of the symbol), which induces a valid distribution α
i
over trees. It straightfor
ward to verify that this distribution has marginals µ
i
.
9.4 Structured SMO for CFGs
We trained our maxmargin models using the Structured SMOalgorithmwith blockcoordinate
descent adopted from graphical models (see Sec. 6.1). The CKY algorithm computes sim
ilar maxmarginals in the course of computing the best tree as does Viterbi in Markov
networks.
´ v
i,c
(y
c
) = max
y∼y
c
[w
¯
f
i
(y) +
i
(y)], ´ α
i,c
(y
c
) = max
y∼y
c
α
i
(y).
We also deﬁne ´ v
i,c
(y
c
) = max
y
c
,=y
c
´ v
i,c
(y
t
c
) = max
y,∼y
c
[w
¯
f
i
(y) +
i
(y)]. Note that we
do not explicitly represent α
i
(y), but we can reconstruct the maximumentropy one from
the marginals µ
i
as in Theorem 9.3.1.
We again express the KKT conditions in terms of the maxmarginals for each span and
span triple c ∈ (
(i)
and its values y
c
:
´ α
i,c
(y
c
) = 0 ⇒ ´ v
i,c
(y
c
) ≤ ´ v
i,c
(y
c
); ´ α
i,c
(y
c
) > 0 ⇒ ´ v
i,c
(y
c
) ≥ ´ v
i,c
(y
c
). (9.9)
The algorithm cycles through the training sentences, runs CKY to compute the max
marginals and performs an SMO update on the violated constraints. We typically ﬁnd that
2040 iterations through the data are sufﬁcient for convergence in terms of the objective
function improvements.
9.5 Experiments
We used the Penn English Treebank for all of our experiments. We report results here for
each model and setting trained and tested on only the sentences of length ≤15 words. Aside
9.5. EXPERIMENTS 139
from the length restriction, we used the standard splits: sections 221 for training (9753
sentences), 22 for development (603 sentences), and 23 for ﬁnal testing (421 sentences).
As a baseline, we trained a CNF transformation of the unlexicalized model of Klein and
Manning [2003] on this data. The resulting grammar had 3975 nonterminal symbols and
contained two kinds of productions: binary nonterminal rewrites and tagword rewrites.
Unary rewrites were compiled into a single compound symbol, so for example a subject
gapped sentence would have label like S+VP. These symbols were expanded back into
their source unary chain before parses were evaluated. The scores for the binary rewrites
were estimated using unsmoothed relative frequency estimators. The tagging rewrites were
estimated with a smoothed model of P(w[t), also using the model from Klein and Manning
[2003]. In particular, Table 9.2 shows the performance of this model (GENERATIVE): 87.99
F
1
on the test set.
For the BASIC maxmargin model, we used exactly the same set of allowed rewrites
(and therefore the same set of candidate parses) as in the generative case, but estimated
their weights using the maxmargin formulation with a loss that counts the number of
wrong spans. Tagword production weights were ﬁxed to be the log of the generative
P(w[t) model. That is, the only change between GENERATIVE and BASIC is the use of the
discriminative maximummargin criterion in place of the generative maximum likelihood
one for learning production weights. This change alone results in a small improvement
(88.20 vs. 87.99 F
1
).
On top of the basic model, we ﬁrst added lexical features of each span; this gave a
LEXICAL model. For a span ¸s, e) of a sentence x, the base lexical features were:
◦ x
s
, the ﬁrst word in the span
◦ x
s−1
, the preceding adjacent word
◦ x
e−1
, the last word in the span
◦ x
e
, the following adjacent word
◦ ¸x
s−1
, x
s
)
◦ ¸x
e−1
, x
e
)
◦ x
s+1
for spans of length 3
140 CHAPTER 9. CONTEXT FREE GRAMMARS
Model P R F
1
GENERATIVE 87.70 88.06 87.88
BASIC 87.51 88.44 87.98
LEXICAL 88.15 88.62 88.39
LEXICAL+AUX 89.74 90.22 89.98
Table 9.1: Development set results of the various models when trained and tested on Penn
treebank sentences of length ≤ 15.
Model P R F
1
GENERATIVE 88.25 87.73 87.99
BASIC 88.08 88.31 88.20
LEXICAL 88.55 88.34 88.44
LEXICAL+AUX 89.14 89.10 89.12
COLLINS 99 89.18 88.20 88.69
Table 9.2: Test set results of the various models when trained and tested on Penn treebank
sentences of length ≤ 15.
These base features were conjoined with the span length for spans of length 3 and below,
since short spans have highly distinct behaviors (see the examples below). The features are
lexical in the sense than they allow speciﬁc words and word pairs to inﬂuence the parse
scores, but are distinct from traditional lexical features in several ways. First, there is no
notion of headword here, nor is there any modeling of wordtoword attachment. Rather,
these features pick up on lexical trends in constituent boundaries, for example the trend
that in the sentence The screen was a sea of red., the (length 2) span between the word was
and the word of is unlikely to be a constituent. These nonhead lexical features capture a
potentially very different source of constraint on tree structures than headargument pairs,
one having to do more with linear syntactic preferences than lexical selection. Regardless
of the relative merit of the two kinds of information, one clear advantage of the present
approach is that inference in the resulting model remains cubic (as opposed to O(n
5
)),
since the dynamic program need not track items with distinguished headwords. With the
addition of these features, the accuracy moved past the generative baseline, to 88.44.
9.5. EXPERIMENTS 141
As a concrete (and particularly clean) example of how these features can sway a de
cision, consider the sentence The Egyptian president said he would visit Libya today to
resume the talks. The generative model incorrectly considers Libya today to be a base NP.
However, this analysis is counter to the trend of today to be a oneword constituent. Two
features relevant to this trend are: (CONSTITUENT ∧ ﬁrstword = today ∧ length = 1) and
(CONSTITUENT ∧ lastword = today ∧ length = 1). These features represent the preference
of the word today for being the ﬁrst and last word in constituent spans of length 1.
1
In the
LEXICAL model, these features have quite large positive weights: 0.62 each. As a result,
this model makes this parse decision correctly.
Another kind of feature that can usefully be incorporated into the classiﬁcation process
is the output of other, auxiliary classiﬁers. For this kind of feature, one must take care
that its reliability on the training not be vastly greater than its reliability on the test set.
Otherwise, its weight will be artiﬁcially (and detrimentally) high. To ensure that such
features are as noisy on the training data as the test data, we split the training into two
folds. We then trained the auxiliary classiﬁers on each fold, and using their predictions as
features on the other fold. The auxiliary classiﬁers were then retrained on the entire training
set, and their predictions used as features on the development and test sets.
We used two such auxiliary classiﬁers, giving a prediction feature for each span (these
classiﬁers predicted only the presence or absence of a bracket over that span, not bracket
labels). The ﬁrst feature was the prediction of the generative baseline; this feature added
little information, but made the learning phase faster. The second feature was the output
of a ﬂat classiﬁer which was trained to predict whether single spans, in isolation, were
constituents or not, based on a bundle of features including the list above, but also the
following: the preceding, ﬁrst, last, and following tag in the span, pairs of tags such as
precedingﬁrst, lastfollowing, precedingfollowing, ﬁrstlast, and the entire tag sequence.
Tag features on the test sets were taken from a pretagging of the sentence by the tagger
described in [Toutanova et al., 2003].While the ﬂat classiﬁer alone was quite poor (P 78.77
/ R 63.94 / F
1
70.58), the resulting maxmargin model (LEXICAL+AUX) scored 89.12 F
1
.
To situate these numbers with respect to other models, the parser in [Collins, 1999],which
1
In this length 1 case, these are the same feature. Note also that the features are conjoined with only one
generic label class “constituent” rather than speciﬁc constituent types.
142 CHAPTER 9. CONTEXT FREE GRAMMARS
is generative, lexicalized, and intricately smoothed scores 88.69 over the same train/test
conﬁguration.
9.6 Related work
A number of recent papers have considered discriminative approaches for natural language
parsing [Johnson et al., 1999; Collins, 2000; Johnson, 2001; Geman & Johnson, 2002;
Miyao & Tsujii, 2002; Clark & Curran, 2004; Kaplan et al., 2004; Collins, 2004]. Broadly
speaking, these approaches fall into two categories, reranking and dynamic programming
approaches. In reranking methods [Johnson et al., 1999; Collins, 2000; Shen et al., 2003],
an initial parser is used to generate a number of candidate parses. A discriminative model
is then used to choose between these candidates. In dynamic programming methods, a
large number of candidate parse trees are represented compactly in a parse tree forest or
chart. Given sufﬁciently “local” features, the decoding and parameter estimation problems
can be solved using dynamic programming algorithms. For example, several approaches
[Johnson, 2001; Geman & Johnson, 2002; Miyao & Tsujii, 2002; Clark & Curran, 2004;
Kaplan et al., 2004] are based on conditional loglinear (maximum entropy) models, where
variants of the insideoutside algorithm can be used to efﬁciently calculate gradients of the
loglikelihood function, despite the exponential number of trees represented by the parse
forest.
The method we presented has several compelling advantages. Unlike reranking meth
ods, which consider only a prepruned selection of “good” parses, our method is an end
toend discriminative model over the full space of parses. This distinction can be very
signiﬁcant, as the set of nbest parses often does not contain the true parse. For example,
in the work of Collins [2000], 41% of the correct parses were not in the candidate pool of
∼30best parses. Unlike previous dynamic programming approaches, which were based on
maximum entropy estimation, our method incorporates an articulated loss function which
penalizes larger tree discrepancies more severely than smaller ones.
Moreover, the structured SMO we use requires only the calculation of Viterbi trees,
rather than expectations over all trees (for example using the insideoutside algorithm).
9.7. CONCLUSION 143
This allows a range of optimizations that prune the space of parses (without making ap
proximations) not possible for maximum likelihood approaches which must extract basis
function expectations from the entire set of parses. In our experiments, 2040 iterations
were generally required for convergence (except the BASIC model, which took about 100
iterations.)
9.7 Conclusion
We have presented a maximummargin approach to parsing, which allows a discriminative
SVMlike objective to be applied to the parsing problem. Our framework permits the use
of a rich variety of input features, while still decomposing in a way that exploits the shared
substructure of parse trees in the standard way.
It is worth considering the cost of this kind of method. At training time, discriminative
methods are inherently expensive, since they all involve iteratively checking current model
performance on the training set, which means parsing the training set (usually many times).
Generative approaches are vastly cheaper to train, since they must only collect counts from
the training set.
On the other hand, the maxmargin approach does have the potential to incorporate
many new kinds of features over the input, and the current feature set allows limited lexi
calization in cubic time, unlike other lexicalized models (including the Collins model which
it outperforms in the present limited experiments). This tradeoff between the complexity,
accuracy and efﬁciency of a parsing model is an important area of future research.
Chapter 10
Matchings
We address the problem of learning to match: given a set of input graphs and corresponding
matchings, ﬁnd a parameterized edge scoring function such that the correct matchings have
the highest score. Bipartite matchings are used in many ﬁelds, for example, to ﬁnd marker
correspondences in vision problems, to map words of a sentence in one language to another,
to identify functional genetic analogues in different organisms. We have shown a compact
maxmargin formulation for bipartite matchings in Ch. 4. In this chapter, we focus on a
more complex problem of nonbipartite matchings. We motivate this problem using an
application in computational biology, disulﬁde connectivity prediction, but nonbipartite
matchings can be used for many other tasks.
Identifying disulﬁde bridges formed by cysteine residues is critical in determining the
structure of proteins. Recently proposed models have formulated this prediction task as a
maximum weight perfect matching problem in a graph containing cysteines as nodes with
edge weights measuring the attraction strength of the potential bridges. We exploit combi
natorial properties of the perfect matching problem to deﬁne a compact, convex, quadratic
program. We use kernels to efﬁciently learn very rich (infact, inﬁnitedimensional) mod
els and present experiments on standard protein databases, showing that our framework
achieves stateoftheart performance on the task.
Throughout this chapter, we use the problem of disulﬁde connectivity prediction as an
example. We provide some background on this problem.
144
10.1. DISULFIDE CONNECTIVITY PREDICTION 145
10.1 Disulﬁde connectivity prediction
Proteins containing cysteine residues form intrachain covalent bonds known as disulﬁde
bridges. Such bonds are a very important feature of protein structure since they enhance
conformational stability by reducing the number of conﬁgurational states and decreasing
the entropic cost of folding a protein into its native state [Matsumura et al., 1989]. They do
so mostly by imposing strict structural constraints due to the resulting links between distant
regions of the protein sequence [Harrison & Sternberg, 1994].
Knowledge of the exact disulﬁde bonding pattern in a protein provides information
about protein structure and possibly its function and evolution. Furthermore, since the
disulﬁde connectivity pattern imposes structure constraints, it can be used to reduce the
search space in both protein folding prediction as well as protein 3D structure prediction.
Thus, the development of efﬁcient, scalable and accurate methods for the prediction of
disulﬁde bonds has numerous practical applications.
Recently, there has been increased interest in applying computational techniques to
the task of predicting the intrachain disulﬁde connectivity [Fariselli & Casadio, 2001;
Fariselli et al., 2002; Vullo & Frasconi, 2004; Klepeis & Floudas, 2003; Baldi et al., 2004].
Since a sequence may contain any number of cysteine residues, which may or may not
participate in disulﬁde bonds, the task of predicting the connectivity pattern is typically
decomposed into two subproblems: predicting the bonding state of each cysteine in the
sequence, and predicting the exact connectivity among bonded cysteines. Alternatively,
there are methods [Baldi et al., 2004] that predict the connectivity pattern without knowing
the bonding state of each cysteine
1
.
We predict the connectivity pattern by ﬁnding the maximum weighted matching in a
graph in which each vertex represents a cysteine residue, and each edge represents the
“attraction strength” between the cysteines it connects [Fariselli & Casadio, 2001]. We
parameterize the this attraction strength via a linear combination of features, which can
include the protein sequence around the two residues, evolutionary information in the form
of multiple alignment proﬁles, secondary structure or solvent accessibility information, etc.
1
We thank Pierre Baldi and Jianlin Cheng for introducing us to the problem of disulﬁde connectivity
prediction and providing us with preliminary draft of their paper and results of their model, as well as the
protein datasets.
146 CHAPTER 10. MATCHINGS
10.2 Learning to match
Formally, we seek a function h : A → ¸ that maps inputs x ∈ A to output matchings
y ∈ ¸, for example, A is the space of protein sequences and ¸ is the space of matchings
of their cysteines. The space of matchings ¸ is very large, in fact, superexponential in
the number of nodes in a graph. However, ¸ has interesting and complex combinatorial
structure which we exploit to learn h efﬁciently.
The training data consists of m examples S = ¦(x
(i)
, y
(i)
)¦
m
i=1
of input graphs and
output matchings. We assume that the input x deﬁnes the space of possible matchings
using some deterministic procedure. For example, given a protein sequence, we construct
a complete graph where each node corresponds to a cysteine. We represent each possible
edge between nodes j and k (j < k) in example i using a binary variable y
(i)
jk
. For simplicity,
we assume complete graphs, but very little needs to be changed to handle sparse graphs.
If example i has L
i
nodes, then there are L
i
(L
i
− 1)/2 edge variables, so y
(i)
is a
binary vector of dimension L
i
(L
i
− 1)/2. In a perfect matching, each node is connected
exactly one other node. In nonperfect matchings, each node is connected to at most one
other node. Let n
i
= L
i
/2, then for complete graphs with even number of vertices L
i
, the
number of possible perfect matchings is
(2n
i
)!
2
n
i n
i
!
(which is Ω((
n
i
2
)
n
i
), superexponential in
n
i
). For example, 1ANS protein in Fig. 10.1 has 6 cysteines (nodes), 15 potential bonds
(edges) and 15 possible perfect matchings.
Our hypothesis class is maximum weight matchings:
h
s
(x) = arg max
y∈¸
jk
s
jk
(x)y
jk
, (10.1)
For disulﬁde connectivity prediction, this model was used by Fariselli and Casadio [2001].
Their model assigns an attraction strength s
jk
(x) to each pair of cysteines, calculated by
assuming that all residues in the local neighborhoods of the two cysteines make contact,
and summing contact potentials for pairs of residues. We consider a simple but very general
class of attraction scoring functions deﬁned by a weighted combination of features or basis
functions:
s
jk
(x) =
d
w
d
f
d
(x
jk
) = w
¯
f (x
jk
), (10.2)
10.2. LEARNING TO MATCH 147
1
2 3
4
5 6
1
2 3
4
5 6
RSCCPCYWGGCPWGQNCYPEGCSGPKV
1234 56
Figure 10.1: PDB protein 1ANS: amino acid sequence, 3D structure, and graph of potential
disulﬁde bonds. Actual disulﬁde connectivity is shown in yellow in the 3D model and the
graph of potential bonds.
where x
jk
is the portion of the input x that directly relates to nodes j and k, f
d
(x
jk
) is
a realvalued basis function and w
d
∈ IR. For example, the basis functions can represent
arbitrary information about the two cysteine neighborhoods: the identity of the residues
at speciﬁc positions around the two cysteines, or the predicted secondary structure in the
neighborhood of each cysteine. We assume that the user provides the basis functions, and
that our goal is to learn the weights w, for the model:
h
w
(x) = arg max
y∈¸
jk
w
¯
f (x
jk
)y
jk
. (10.3)
Below, we will abbreviate w
¯
f (x, y) ≡
jk
w
¯
f (x
jk
)y
jk
, and w
¯
f
i
(y) ≡ w
¯
f (x
(i)
, y),
The naive formulation of the maxmargin estimation, which enumerates all perfect
matchings for each example i, is:
min
1
2
[[w[[
2
s.t. w
¯
f
i
(y
(i)
) ≥ w
¯
f
i
(y) +
i
(y), ∀i, ∀y ∈ ¸
(i)
. (10.4)
The number of constraints in this formulation is superexponential in the number of nodes
in each example. In the following sections we present two maxmargin formulations,
ﬁrst with an exponential set of constraints (Sec. 10.3), and then with a polynomial one
(Sec. 10.4).
148 CHAPTER 10. MATCHINGS
10.3 Minmax formulation
Using the minmax formulation from Ch. 4, we have a single max constraint for each i:
min
1
2
[[w[[
2
s.t. w
¯
f
i
(y
(i)
) ≥ max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)], ∀i. (10.5)
The key to solving this problem efﬁciently is the lossaugmented inference
max
y∈¸
(i) [w
¯
f
i
(y) +
i
(y)]. Under the assumption of Hamming distance loss (or any loss
function that can be written as a sum of terms corresponding to edges), this maximization
is equivalent (up to a constant term) to a maximum weighted matching problem. Note that
since the y variables are binary, the Hamming distance between y
(i)
and y can be written
as (1 − y)
¯
y
(i)
+ (1 − y
(i)
)
¯
y = 1
¯
y
(i)
+ (1 − 2y
(i)
)
¯
y. Hence, the maximum weight
matching where edge jk has weight w
¯
f (x
(i)
jk
)+(1−2y
(i)
jk
) (plus the constant 1
¯
y
(i)
) gives
the value of max
y∈¸
(i) [w
¯
f
i
(y) +
i
(y)].
This problem can be solved in O(L
3
) time [Gabow, 1973; Lawler, 1976]. It can also be
solved as a linear program, where we introduce continuous variables µ
i,jk
instead of binary
variables y
(i)
jk
.
max
jk
µ
i,jk
[w
¯
f (x
(i)
jk
) + (1 −2y
(i)
jk
)] (10.6)
s.t. µ
i,jk
≥ 0, 1 ≤ j < k ≤ L
i
;
k
µ
i,jk
≤ 1, 1 ≤ j ≤ L
i
;
j,k∈V
µ
i,jk
≤
1
2
([V [ −1), V ⊆ ¦1, . . . , L
i
¦, [V [ ≥ 3 and odd.
The constraints
k
µ
i,jk
≤ 1 require that the number of bonds incident on a node is less
or equal to one. For perfect matchings, these constraints are changed to
k
µ
i,jk
= 1 to
ensure exactly one bond. The subset constraints (in the last line of Eq. (10.6)) ensure that
solutions to the LP are integral [Edmonds, 1965]. Note that we have an exponential number
of constraints (O(2
(L
i
−1)
)), but this number is asymptotically smaller than the number of
possible matchings . It is an open problem to derive a polynomial sized LP formulation for
perfect matchings [Schrijver, 2003].
10.3. MINMAX FORMULATION 149
We can write the lossaugmented inference problem in terms of the LP in Eq. (10.6):
max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)] = d
i
+ max
A
i
µ
i
≤b
i
µ
i
≥0
µ
¯
i
[F
i
w+c
i
],
where: d
i
= 1
¯
y
(i)
; µ
i
is a vector of length L
i
(L
i
− 1)/2 indexed by bond jk; A
i
and b
i
are the appropriate constraint coefﬁcient matrix and right hand side vector, respectively. F
i
is a matrix of basis function coefﬁcients such that the component jk of the vector F
i
w is
w
¯
f (x
(i)
jk
) and c
i
= (1 − 2y
(i)
). Note that the dependence on w is linear and occurs only
in the objective of the LP.
The dual of the LP in Eq. (10.6) is
min λ
¯
i
b
i
s.t. A
¯
i
λ
i
≥ F
i
w+c
i
; λ
i
≥ 0. (10.7)
We plug it into Eq. (10.5) and combine the minimization over λ with minimization over w.
min
1
2
[[w[[
2
(10.8)
s.t. w
¯
f
i
(y
(i)
) ≥ d
i
+ λ
¯
i
b
i
, ∀i;
A
¯
i
λ
i
≥ F
i
w+c
i
, ∀i;
λ
i
≥ 0, ∀i.
In case that our basis functions are not rich enough to predict the training data perfectly,
we can introduce a slack variable ξ
i
for each example i to allow violations of the constraints
and minimize the sum of the violations:
min
1
2
[[w[[
2
+ C
i
ξ
i
(10.9)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥ d
i
+ λ
¯
i
b
i
, ∀i;
A
¯
i
λ
i
≥ F
i
w+c
i
, ∀i;
λ
i
≥ 0, ∀i; ξ
i
≥ 0, ∀i.
The parameter C allows the user to trade off violations of the constraints with ﬁt to the
150 CHAPTER 10. MATCHINGS
0
5
10
15
20
25
30
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
NumberofBonds
L
o
g

N
u
m
b
e
r
o
f
C
o
n
s
t
r
a
i
n
t
s
PerfectMatchings
Minmax
Certificate
Figure 10.2: Log of the number of QP constraints (yaxis) vs. number of bonds (xaxis) in
the three formulations (perfect matching enumeration, minmax and certiﬁcate).
data.
Our formulation is a linearlyconstrained quadratic program, albeit with an exponen
tial number of constraints. In the next section, we develop an equivalent polynomial size
formulation.
10.4 Certiﬁcate formulation
Rather than solving the lossaugmented inference problem explicitly, we can focus on ﬁnd
ing a compact certiﬁcate of optimality that guarantees that y
(i)
= arg max
y
[w
¯
f
i
(y) +
i
(y)]. We consider perfect matchings and then provide a reduction for the nonperfect
case. Let M be a perfect matching for a complete undirected graph G = (V, E). In an
alternating cycle/path in G with respect to M, the edges alternate between those that be
long to M and those that do not. An alternating cycle is augmenting with respect to M if
the score of the edges in the matching M is smaller that the score of the edges not in the
matching M.
Theorem 10.4.1 [Edmonds, 1965] A perfect matching M is a maximum weight perfect
matching if and only if there are no augmenting alternating cycles.
10.4. CERTIFICATE FORMULATION 151
The number of alternating cycles is exponential in the number of vertices, so simply enu
merating all of them will not do. Instead, we can rule out such cycles by considering
shortest paths.
We begin by negating the score of those edges not in M. In the discussion below we
assume that each edge score s
jk
has been modiﬁed this way. We also refer to the score s
jk
as the length of the edge jk. An alternating cycle is augmenting if and only if its length is
negative. A condition ruling out negative length alternating cycles can be stated succinctly
using a kind of distance function. Pick an arbitrary root node r. Let d
e
j
, with j ∈ V ,
e ∈ ¦0, 1¦, denote the length of the shortest distance alternating path from r to j, where
e = 1 if the last edge of the path is in M, 0 otherwise. These shortest distances are well
deﬁned if and only if there are no negative alternating cycles. The following constraints
capture this distance function.
s
jk
≥ d
0
k
−d
1
j
, s
jk
≥ d
0
j
−d
1
k
, ∀ jk / ∈ M; (10.10)
s
jk
≥ d
1
k
−d
0
j
, s
jk
≥ d
1
j
−d
0
k
, ∀ jk ∈ M.
Theorem 10.4.2 There exists a distance function ¦d
e
j
¦ satisfying the constraints in
Eq. (10.10) if and only if no augmenting alternating cycles exist.
Proof.
(If) Suppose there are no augmenting alternating cycles. Since any alternating paths
from r to j can be shortened (or left the same length) by removing the cycles they contain,
the two shortest paths to j (one ending with Medge and one not) contain no cycles. Then
let d
0
j
and d
1
j
be the length of those paths, for all j (for j = r, set d
0
r
= d
1
r
= 0). Then for
any jk (or kj) in M, the shortest path to j ending with an edge not in M plus the edge jk
(or kj) is an alternating path to k ending with an edge in M. This path is longer or same
length as the shortest path to k ending with an edge in M: s
jk
+d
0
j
≥ d
1
k
(or s
kj
+d
0
j
≥ d
1
k
),
so the constraint is satisﬁed. Similarly for jk, kj / ∈ M.
(Only if) Suppose a distance function ¦d
e
j
¦ satisﬁes the constraints in Eq. (10.10). Con
sider an alternating cycle C. We renumber the nodes such that the cycle passes through
nodes 1, 2, . . . , l and the ﬁrst edge, (1, 2), is in M. The length of the path is s(C) =
s
1,l
+
l−1
j=1
s
j,j+1
. For each odd j, the edge (j, j + 1) is in M, so s
j,j+1
≥ d
1
j+1
−d
0
j
. For
152 CHAPTER 10. MATCHINGS
even j, the edge (j, j + 1) is not in M, so s
j,j+1
≥ d
0
j+1
−d
1
j
. Finally, the last edge, (1, l),
is not in M, so s
1,l
≥ d
0
1
−d
1
l
. Summing the edges, we have:
s(C) ≥ d
0
1
−d
1
l
+
l−1
j=1,odd
[d
1
j+1
−d
0
j
] +
l−1
j=2,even
[d
0
j+1
−d
1
j
] = 0.
Hence all alternating cycles have nonnegative length.
In our learning formulation we have the lossaugmented edge weights s
(i)
jk
= (2y
(i)
jk
−
1)(w
¯
f (x
jk
)+1−2y
(i)
jk
). Let d
i
be a vector of distance variables d
e
j
, H
i
and G
i
be matrices
of coefﬁcients and q
i
be a vector such that H
i
w + G
i
d
i
≥ q
i
represents the constraints
in Eq. (10.10) for example i. Then the following joint convex programin wand d computes
the maxmargin parameters:
min
1
2
[[w[[
2
(10.11)
s.t. H
i
w+G
i
d
i
≥ q
i
, ∀i.
Once again, in case that our basis functions are not rich enough to predict the training data
perfectly, we can introduce a slack variable vector ξ
i
to allow violations of the constraints.
The case of nonperfect matchings can be handled by a reduction to perfect matchings
as follows [Schrijver, 2003]. We create a new graph by making a copy of the nodes and
the edges and adding edges between each node and the corresponding node in the copy.
We extend the matching by replicating its edges in the copy and for each unmatched node,
introduce an edge to its copy. We deﬁne f (x
jk
) ≡ 0 for edges between the original and
the copy. Perfect matchings in this graph projected onto the original graph correspond to
nonperfect matchings in the original graph.
The comparison between the lognumber of constraints for our three equivalent QP
formulations (enumeration of all perfect matchings, minmax and certiﬁcate) is shown
in Fig. 10.2. The xaxis is the number of edges in the matching (number of nodes divided
by two).
10.5. KERNELS 153
10.5 Kernels
Instead of directly optimizing the primal problem in Eq. (10.8), we can work with its dual.
Each training example i has L
i
(L
i
− 1)/2 dual variables, and α
(i)
jk
is the dual variable
associated with the features corresponding to the edge jk. Let α
(i)
be the vector of dual
variables for example i. The dual quadratic optimization problem has the form:
max
i
c
¯
i
α
(i)
−
1
2
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i
jk∈E
(i)
__
Cy
(i)
jk
−α
(i)
jk
_
f (x
(i)
jk
)
_
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(10.12)
s.t. A
i
α
(i)
≤ Cb
i
, ∀i.
α
(i)
≥ 0, ∀i.
The only occurrence of feature vectors is in the expansion of the squarednorm term in the
objective:
i,j
kl∈E
(i)
mn∈E
(j)
_
Cy
(i)
jk
−α
(i)
jk
_
f (x
(i)
kl
)
¯
f (x
(j)
mn
)
_
Cy
(j)
jk
−α
(j)
jk
_
(10.13)
Therefore, we can apply the kernel trick and let f (x
(i)
kl
)
¯
f (x
(j)
mn
) = K(x
(i)
kl
, x
(j)
mn
). Thus, we
can efﬁciently map the original features f (x
jk
) to a highdimensional space. The primal
and dual solutions are related by:
w =
i
jk
(Cy
(i)
jk
−α
(i)
jk
)f (x
(i)
jk
) (10.14)
Eq. (10.14) can be used to compute the attraction strength s
jk
(x) in a kernelized manner at
prediction time. The polynomialsized representation in Eq. (10.11) is similarly kerneliz
able.
154 CHAPTER 10. MATCHINGS
10.6 Experiments
We assess the performance of our method on two datasets containing sequences with ex
perimentally veriﬁed bonding patterns: DIPRO2 and SP39. The DIPRO2 dataset
2
was
compiled and made publicly available by Baldi et al. [2004]. It consists of all proteins
from PDB [Berman et al., 2000], as of May 2004, which contain intrachain disulﬁde
bonds. After redundance reduction there are a total of 1018 sequences. In addition, the
sequences are annotated with secondary structure and solvent accessibility information de
rived from the DSSP database [Kabsch & Sander, 1983]. The SP39 dataset is extracted
from the SwissProt database of proteins [Bairoch & Apweiler, 2000], release 39. It con
tains only sequences with experimentally veriﬁed disulﬁde bridges, and has a total of 726
proteins. The same dataset was used in earlier work [Baldi et al., 2004; Vullo & Frasconi,
2004; Fariselli & Casadio, 2001], and we have followed the same procedure for extracting
sequences from the database.
Even though our method is applicable to both sequences with a high number of bonds
or sequences in which the bonding state of cysteine residues is unknown, we report results
for the case where the bonding state is known, and the number of bonds is between 2 and
5 (since the case of 1 bond is trivial). The DIPRO2 contains 567 such sequences, and only
53 sequences with a higher number of bonds, so we are able to perform learning on over
90% of all proteins. There are 430 proteins with 2 and 3 bonds and 137 with 4 and 5 bonds.
SP39 contains 446 sequences containing between 2 and 5 bonds.
In order to avoid biases during testing, we adopt the same dataset splitting procedure
as the one used in previous work [Fariselli & Casadio, 2001; Vullo & Frasconi, 2004;
Baldi et al., 2004]. We split SP39 into 4 different subsets, with the constraint that pro
teins no proteins with sequence similarity of more than 30% belong to different subsets.
Sequence similarity was derived using an allagainstall rigorous SmithWaterman local
pairwise alignment [Smith & Waterman, 1981] (with the BLOSUM65 scoring matrix, gap
penalty 12 and gap extension 4). Pairs of chains whose alignment is less than 30 residues
were considered unrelated. The DIPRO2 dataset was split similarly into 5 folds, although
the procedure had less effect due to the redundance reduction applied by the authors of the
2
http://contact.ics.uci.edu/bridge.html
10.6. EXPERIMENTS 155
dataset.
Models
The experimental results we report use the dual formulation of Sec. 10.5 and an RBF kernel
K(x
jk
, x
lm
) = exp(
x
jk
−x
lm

2
γ
), with γ ∈ [0.1, 10]. We use the exponential sized represen
tation of Sec. 10.3 since for the case of proteins containing between two and ﬁve bonds, it
is more efﬁcient due to the low constants in the exponential problem size. We used com
mercial QP software (CPLEX) to train our models. Training time took around 70 minutes
for 450 examples, using a sequential optimization procedure which solves QP subproblems
associated with blocks of training examples. We are currently working on an implemen
tation of the certiﬁcate formulation Sec. 10.4 to handle longer sequences and nonperfect
matchings (when bonding state is unknown). Below, we describe several models we used.
The features we experimented with were all based on the local regions around candidate
cysteine pairs. For each pair of candidate cysteines ¦j, k¦, where j < k, we extract the
aminoacid sequence in windows of size n centered at j and k. As in Baldi et al. [2004],
we augment the features of each model with the number of residues between j and k. The
models below use windows of size n = 9.
The ﬁrst model, SEQUENCE, uses the features described above: for each window, the
actual sequence is expanded to a 20 n binary vector, in which the entries denote whether
or not a particular amino acid occurs at the particular position. For example, the 21st entry
in the vector represents whether or not the aminoacid Alanine occurs at position 2 of the
local window, counting from the left end of the window. The ﬁnal set of features for each
¦j, k¦ pair of cysteines is simply the two local windows concatenated together, augmented
with the linear distance between the cysteine residues.
The second model, PROFILE, is the same as SEQUENCE, except that instead of us
ing the actual protein sequence, we use multiple sequence alignment proﬁle information.
Multiple alignments were computed by running PSIBLAST using default settings to align
the sequence with all sequences in the NR database [Altschul et al., 1997]. Thus, the in
put at each position of a local window is the frequency of occurrence of each of the 20
aminoacids in the alignments.
156 CHAPTER 10. MATCHINGS
K PROFILE DAGRNN
2 0.75 / 0.75 0.74 / 0.74
3 0.60 / 0.48 0.61 / 0.51
4 0.46 / 0.24 0.44 / 0.27
5 0.43 / 0.16 0.41 / 0.11
K SEQUENCE PROFILE PROFILESS
2 0.70 / 0.70 0.73 / 0.73 0.79 / 0.79
3 0.62 / 0.52 0.67 / 0.59 0.74 / 0.69
4 0.44 / 0.21 0.59 / 0.44 0.70 / 0.56
5 0.29 / 0.06 0.43 / 0.17 0.62 / 0.27
(a) (b)
Table 10.1: Numbers indicate Precision / Accuracy. (a) Performance of PROFILE model
on SP39 vs. preliminary results of the DAGRNN model [Baldi et al., 2004] which repre
sent the best currently published results. In each row, the best performance is in bold. (b)
Performance of SEQUENCE, PROFILE, PROFILESS models on the DIPRO2 dataset.
The third model, PROFILESS, augments the PROFILE model with secondary structure
and solventaccessibility information. The DSSP program produces 8 types of secondary
structure, so we augment each local window of size n with an additional length 8 n
binary vector, as well as a length n binary vector representing the solvent accessibility at
each position.
Results and discussion
We evaluate our algorithm using two metrics: accuracy and precision. The accuracy mea
sure counts how many full connectivity patterns were predicted correctly, whereas preci
sion measures the number of correctly predicted bonds as a fraction of the total number of
possible bonds.
The ﬁrst set of experiments compares our model to preliminary results reported in Baldi
et al. [2004], which represent the current topperforming system. We perform 4fold cross
validation on SP39 in order to replicate their setup. As Table 10.1 shows, the PROFILE
model achieves comparable results, with similar or better levels of precision for all bond
numbers, and slightly lower accuracies for the case of 2 and 3 bonds.
In another experiment, we show the performance gained by using multiple alignment
information by comparing the results of the SEQUENCE model with the PROFILE. As we
can see from Table 10.1(b), the evolutionary information captured by the aminoacid align
ment frequencies plays an important role in increasing the performance of the algorithm.
10.7. RELATED WORK 157
2 and 3 bonds
20%
30%
40%
50%
60%
70%
80%
90%
100%
100 150 200 250 300 350 400 450
Training Set Size
Accuracy (2 Bonds)
Precision (3 Bonds)
Accuracy (3 Bonds)
4 and 5 bonds
5%
15%
25%
35%
45%
55%
65%
75%
85%
100 150 200 250 300 350 400 450
Training Set Size
Precision (4 Bonds)
Accuracy (4 Bonds)
Precision (5 Bonds)
Accuracy (5 Bonds)
(a) (b)
Figure 10.3: Performance of PROFILE model as training set size changes for proteins with
(a) 2 and 3 bonds (b) 4 and 5 bonds.
The same phenomenon is observed by Vullo and Frasconi [2004] in their comparison of
sequence and proﬁlebased models.
As a ﬁnal experiment, we examine the role that secondary structure and solventaccessibility
information plays in the model PROFILESS. Table 10.1(b) shows that the gains are sig
niﬁcant, especially for sequences with 3 and 4 bonds. This highlights the importance of
developing even richer features, perhaps through more complex kernels.
Fig. 10.3 shows the performance of the PROFILE model as training set size grows. We
can see that for sequences of all bond numbers, both accuracy and precision increase as the
amount of data grows. The trend is more pronounced for sequences with 4 and 5 bonds
because they are sparsely distributed in the dataset. Such behavior is very promising, since
it validates the applicability of our algorithm as the availability of highquality disulﬁde
bridge annotations increases with time.
10.7 Related work
The problem of inverse perfect matching has been studied by Liu and Zhang [2003] in
the inverse combinatorial optimization framework we describe in Sec. 4.3: Given a set of
nominal weights w
0
and a perfect matching M, which is not a maximum one with respect
to w
0
, ﬁnd a new weight vector w that makes M optimal and minimizes [[w
0
− w[[
p
for p = 1, ∞. They do not provide a compact optimization problem for this related but
158 CHAPTER 10. MATCHINGS
different task, relying instead on the ellipsoid method with constraint generation.
The problem of disulﬁde bond prediction ﬁrst received comprehensive computational
treatment in Fariselli and Casadio [2001]. They modeled the prediction problem as ﬁnding
a perfect matching in a weighted graph where vertices represent bonded cysteine residues,
and edge weights correspond to attraction strength. The problem of learning the edge
weights was addressed using a simulated annealing procedure. Their method is only ap
plicable to the case when bonding state is known. In Fariselli et al. [2002], the authors
switch to using a neural network for learning edge weights and achieve better performance,
especially for the case of 2 and 3 disulﬁde bonds.
The method in Vullo and Frasconi [2004] takes a different approach to the problem. It
scores candidate connectivity patterns according to their similarity with respect to the cor
rect pattern, and uses a recursive neural network architecture [Frasconi et al., 1998] to score
candidate patterns. At prediction time the pattern scores are used to perform an exhaustive
search on the space of all matchings. The method is computationally limited to sequences
of 2 to 5 bonds. It also uses multiple alignment proﬁle information and demonstrates its
beneﬁts over sequence information.
In Baldi et al. [2004], the authors achieve the current stateoftheart performance on
the task. Their method uses Directed Acyclic Graph Recursive Neural Networks [Baldi
& Pollastri, 2003] to predict bonding probabilities between cysteine pairs. The prediction
problem is solved using a weighted graph matching based on these probabilities. Their
method performs better than the one in Vullo and Frasconi [2004] and is also the only
one which can cope with sequences with more than 5 bonds. It also improves on previous
methods by not assuming knowledge of bonding state.
A different approach to predicting disulﬁde bridges is reported in Klepeis and Floudas
[2003], where bond prediction occurs as part of predicting βsheet topology in proteins.
Residuetoresidue contacts (which include disulphide bridges) are predicted by solving a
series of constrained integer programming problems. Interestingly, the approach can be
used to predict disulﬁde bonds with no knowledge of bonding state, but the results are not
comparable with those in other publications.
The task of predicting whether or not a cysteine is bonded has also been addressed using
a variety of machine learning techniques including neural networks, SVMs, and HMMs
10.8. CONCLUSION 159
[Fariselli et al., 1999; Fiser & Simon, 2000; Martelli et al., 2002; Frasconi et al., 2002;
Ceroni et al., 2003] Currently the top performing systems have accuracies around 85%.
10.8 Conclusion
In this chapter, we derive a compact convex quadratic program for the problem of learning
to match. Our approach learns a parameterized scoring function that reproduces the ob
served matchings in a training set. We present two formulations: one which is based on a
linear programming approach to matching, requiring an exponential number of constraints,
and one which develops a certiﬁcate of matching optimality for a compact polynomialsized
representation. We apply our framework to the task of disulﬁde connectivity prediction, for
mulated as a weighted matching problem. Our experimental results show that the method
can achieve performance comparable to current topperforming systems. Furthermore, the
use of kernels makes it easy to incorporate rich sets of features such as secondary structure
information, or extended local neighborhoods of the protein sequence. In the future, it will
be worthwhile to examine how other kernels, such as convolution kernels for protein se
quences, will affect performance. We also hope to explore the more challenging problem
of disulﬁde connectivity prediction when the bonding state of cysteines is unknown. While
we have developed the framework to handle that task, it remains to experimentally deter
mine how well the method performs, especially in comparison to existing methods [Baldi
et al., 2004], which have already addressed the more challenging setting.
Chapter 11
Correlation clustering
Data can often be grouped in many different reasonable clusterings. For example, one user
may organize her email messages by project and time, another by sender and topic. Images
can be segmented by hue or object boundaries. For a given application, there might be
only one of these clusterings that is desirable. Learning to cluster considers the problem of
ﬁnding desirable clusterings on new data, given example desirable clusterings on training
data.
We focus on correlation clustering, a novel clustering method that has recently en
joyed signiﬁcant attention from the theoretical computer science community [Bansal et al.,
2002; Demaine & Immorlica, 2003; Emanuel & Fiat, 2003]. It is formulated as a vertex
partitioning problem: Given a graph with realvalued edge scores (both positive and neg
ative), partition the vertices into clusters to maximize the score of intracluster edges, and
minimize the weight of intercluster edges. Positive edge weights represent correlations be
tween vertices, encouraging those vertices to belong to a common cluster; negative weights
encourage the vertices to belong to different clusters. Unlike most clustering formulations,
correlation clustering does not require the user to specify the number of clusters nor a dis
tance threshold for clustering; both of these parameters are effectively chosen to be the best
possible by the problem deﬁnition. These properties make correlation clustering a promis
ing approach to many clustering problems; in machine learning, it has been successfully
applied to coreference resolution for proper nouns [McCallum & Wellner, 2003].
Recently, several algorithms based on linear programming and positivesemideﬁnite
160
11.1. CLUSTERING FORMULATION 161
programming relaxations have been proposed to approximately solve this problem. In this
chapter, we employ these relaxations to derive a maxmargin formulation for learning the
edge scores for correlation clustering from clustered training data. We formulate the ap
proximate learning problem as a compact convex program with quadratic objective and
linear or positivesemideﬁnite constraints. Experiments on synthetic and realworld data
show the ability of the algorithm to learn an appropriate clustering metric for a variety of
desired clusterings.
11.1 Clustering formulation
An instance of correlation clustering is speciﬁed by an undirected graph ( = (1, c) with
N nodes and edge score s
jk
for each jk in c, (j < k). We assume that the graph is fully
connected (if it is not, we can make it fully connected by adding appropriate edges jk with
s
jk
= 0). We deﬁne binary variables y
jk
, one for each edge jk, that represent whether node
j and k belong to the same cluster. Let ¸ be the space of assignments y that deﬁne legal
partitions. For notational convenience, we introduce both y
jk
and y
kj
variables, which will
be constrained to have the same value. We also introduce y
jj
variables, and ﬁx them to
have value 1 and set s
jj
= 0.
Bansal et al. [2002] consider two related problems:
max
y∈¸
jk:s
jk
>0
s
jk
y
jk
−
jk:s
jk
<0
s
jk
(1 −y
jk
); (MAXAGREE)
min
y∈¸
jk:s
jk
>0
s
jk
(1 −y
jk
) −
jk:s
jk
<0
s
jk
y
jk
; (MINDISAGREE)
The motivation for the names of the two problems comes from separating the set of edges
into positive weight edges and negative weight edges. The best score is obviously achieved
by including all the positive and excluding all the negative edges, but this will not generally
produce a valid partition. In MAXAGREE, we maximize the “agreement” of the partition
with the positive/negative designations: the weight of the positive included edges minus
the weight of negative excluded edges. In MINDISAGREE, we minimize the disagreement:
the weight of positive excluded edges minus the weight of negative included edges. In
162 CHAPTER 11. CORRELATION CLUSTERING
particular, let
s
∗
= max
y∈¸
s
jk
y
jk
; s
−
=
jk:s
jk
<0
s
jk
; s
+
=
jk:s
jk
>0
s
jk
.
Then the value of MAXAGREE is s
∗
− s
−
and the value of MINDISAGREE s
+
− s
∗
. The
optimal partition for the two problems is of course the same (if it is unique). Bansal
et al. [2002] show that both of these problems are NPhard (but have different approxi
mation hardness). We will concentrate on the maximization version, MAXAGREE. Several
approximation algorithms have been developed based on Linear and Semideﬁnite Program
ming [Charikar et al., 2003; Demaine & Immorlica, 2003; Emanuel & Fiat, 2003], which
we consider in the next sections.
11.1.1 Linear programming relaxation
In order to insure that y deﬁnes a partition, it is sufﬁcient to enforce a kind of triangle
inequality for each triple of nodes j < k < l:
y
jk
+ y
kl
≤ y
jl
+ 1; y
jk
+ y
jl
≤ y
kl
+ 1; y
jl
+ y
kl
≤ y
jk
+ 1. (11.1)
The triangle inequality enforces transitivity: if j and k are in the same cluster (y
jk
= 1)
and k and l are in the same cluster (y
kl
= 1), then j and l will be forced to be in this
cluster (y
jl
= 1). The other two cases are similar. Any symmetric, transitive binary relation
induces a partition of the objects.
With these deﬁnitions, we can express the MAXAGREE problem as an integer linear
program (ignoring the constant −s
−
):
max
jk
s
jk
y
jk
(11.2)
s.t. y
jk
+ y
kl
≤ y
lj
+ 1, ∀j, k, l; y
jj
= 1, ∀j; y
jk
∈ ¦0, 1¦, ∀j, k.
Note that the constraints imply that y
ab
= y
ba
for any two nodes a and b. To see this,
consider the inequalities involving node a and b with j = a, k = b, l = b and j = b, k =
11.1. CLUSTERING FORMULATION 163
a, l = a:
y
ab
+ y
bb
≤ y
ba
+ 1; y
ba
+ y
aa
≤ y
ab
+ 1;
Since y
aa
= y
bb
= 1, we have y
ab
= y
ba
.
The LP relaxation is obtained by replacing the binary variables y
jk
∈ ¦0, 1¦ in Eq. (11.2)
with continuous variables 0 ≤ µ
jk
≤ 1.
µ
jk
+ µ
kl
≤ µ
lj
+ 1, ∀j, k, l; µ
jj
= 1, ∀j; µ
jk
≥ 0, ∀j, k. (11.3)
Note that µ
jk
≤ 1 is implied since the triangle inequality with j = l gives µ
jk
+ µ
kj
≤
µ
jj
+ 1, and since µ
jj
= 1 and µ
jk
= µ
kj
, we have µ
jk
≤ 1.
We are not guaranteed that this relaxation will produce integral solutions. The LP
solution, s
LP
, is an upper bound on the s
∗
. Charikar et al. [2003] show that the integrality
gap of this upper bound is at least 2/3:
s
∗
−s
−
s
LP
−s
−
<
2
3
.
11.1.2 Semideﬁnite programming relaxation
An alternative formulation [Charikar et al., 2003] is the SDP relaxation. Let mat(µ) denote
the variables µ
jk
arranged into a matrix.
max
jk
s
jk
µ
jk
(11.4)
s.t. mat(µ) _ 0; µ
jj
= 1, ∀j; µ
jk
≥ 0, ∀j, k.
In effect, we substituted the triangle inequalities by the semideﬁnite constraint. To motivate
this relaxation, consider any clustering solution. Choose a collection of orthogonal unit
vectors ¦v
1
, . . . , v
K
¦, one for each cluster in the solution. Every vertex j in the cluster
is assigned the unit vector v
j
corresponding to the cluster it is in. If vertices j and k
are in the same cluster, then v
¯
j
v
k
= 1, if not, v
¯
j
v
k
= 0. The score of the clustering
164 CHAPTER 11. CORRELATION CLUSTERING
solution can now be expressed in terms of the dot products v
¯
j
v
k
. In the SDP relaxation
in Eq. (11.4), we have mat(µ) _ 0, which can be decomposed into a sum of outer products
mat(µ) =
j
v
j
v
¯
j
.
The entries µ
jk
correspond to inner products v
¯
j
v
k
. The vectors generating the inner
products are unit vectors by the requirement µ
jj
= 1. However, they do not necessarily
form a set of orthogonal vectors.
The SDP solution, s
SDP
, is also an upper bound on the s
∗
and Charikar et al. [2003]
show that the integrality gap of this upper bound is at least 0.82843:
s
∗
−s
−
s
SDP
−s
−
≤ 0.82843.
11.2 Learning formulation
The score for an edge is commonly derived from the characteristics of the pair of nodes.
Speciﬁcally, we parameterize the score as a weighted combination of basis functions
s
jk
= w
¯
f (x
jk
),
w, f (x
jk
) ∈ IR
n
, where x
jk
is a set of features associated with nodes j and k. In document
clustering, the entries of f
x
jk
might be the words shared by the documents j and k, while if
one is clustering points in IR
n
, features might be distances along different dimensions. We
assume f (x
jj
) = 0 so that s
jj
= 0. Hence we write
w
¯
f (x, y) =
jk
y
jk
w
¯
f (x
jk
).
Furthermore, we assume that the loss function decomposes over the edges, into a sum
of edge losses
i,jk
(y
jk
):
i
(y) =
jk
i,jk
(y
jk
) =
jk
y
jk
i,jk
(1) + (1 −y
jk
)
i,jk
(0) =
i
(0) +
jk
y
jk
i,jk
,
where
i,jk
=
i,jk
(1) −
i,jk
(0). For example, the Hamming loss counts the number of
11.2. LEARNING FORMULATION 165
edges incorrectly cut or uncut by a partition.
H
i
(y) =
jk
1I(y
jk
,= y
(i)
jk
) =
jk
y
(i)
jk
+
jk
y
jk
(1 −2y
(i)
jk
) =
H
i
(0) +
jk
y
jk
i,jk
,
where
i,jk
= 1 −2y
(i)
jk
.
With this assumption, the loss augmented maximization is
i
(0) + max
y∈¸
jk
y
jk
[w
¯
f (x
(i)
jk
) +
i,jk
]. (11.5)
We can now use the LP relaxation in Eq. (11.3) and the SDP relaxation in Eq. (11.4) as
upper bounds on Eq. (11.5). We use these upperbounds in the minmax formulation to
achieve approximate maxmargin estimation.
The dual of the LP based upper bound for example i is
i
(0)+
min
jkl
λ
i,jkl
+
j
z
i,j
(11.6)
s.t.
l
[λ
i,jkl
+ λ
i,ljk
−λ
i,klj
] ≥ w
¯
f (x
(i)
jk
) +
i,jk
, ∀j ,= k;
z
i,j
+
l
[λ
i,jjl
+ λ
i,ljj
−λ
i,jlj
] ≥
i,jj
, ∀j;
λ
i,jkl
≥ 0, ∀j, k, l.
Above, we introduced a dual variable λ
i,jkl
for each triangle inequality and z
i,j
for the
identity on the diagonal. Note the righthandside of the second set of inequalities follows
from the assumption f (x
jj
) = 0.
166 CHAPTER 11. CORRELATION CLUSTERING
Plugging this dual into the minmax formulation, we have:
min
1
2
[[w[[
2
+ C
ξ
i
(11.7)
s.t. w
¯
f (x
(i)
, y
(i)
) + ξ
i
≥
i
(0) +
jkl
λ
i,jkl
+
j
z
i,j
, ∀i;
l
[λ
i,jkl
+ λ
i,ljk
−λ
i,klj
] ≥ w
¯
f (x
(i)
jk
) +
i,jk
, ∀i, ∀j ,= k;
z
i,j
+
l
[λ
i,jjl
+ λ
i,ljj
−λ
i,jlj
] ≥
i,jj
, ∀i, ∀j;
λ
i,jkl
≥ 0, ∀i, ∀j, k, l.
Similarly, the dual of the SDP based upper bound is
i
(0)+
min
j
z
i,j
(11.8)
s.t. −λ
i,jk
≥ w
¯
f (x
(i)
jk
) +
i,jk
, ∀j ,= k;
z
i,j
−λ
i,jj
≥
i,jj
∀j;
mat(λ
i
) _ 0.
Plugging the SDP dual into the minmax formulation, we have:
min
1
2
[[w[[
2
+ C
ξ
i
(11.9)
s.t. w
¯
f (x
(i)
, y
(i)
) + ξ
i
≥
i
(0) +
j
z
i,j
, ∀i;
−λ
i,jk
≥ w
¯
f (x
(i)
jk
) +
i,jk
, ∀i, ∀j ,= k;
z
i,j
−λ
i,jj
≥
i,jj
, ∀i, ∀j;
mat(λ
i
) _ 0, ∀i, ∀j, k, l.
11.3. DUAL FORMULATION AND KERNELS 167
11.3 Dual formulation and kernels
The dual of Eq. (11.7) and Eq. (11.9) provide some insight into the structure of the problem
and enable efﬁcient use of kernels. Here we give the dual of Eq. (11.7):
max
i,jk
µ
i,jk
i,jk
−
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,jk
(y
(i)
jk
−µ
i,jk
)f (x
(i)
jk
)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
s.t. µ
jk
+ µ
kl
≤ µ
lj
+ 1, ∀i, ∀j, k, l; µ
i,jj
= 1, ∀i, ∀j; µ
i,jk
≥ 0, ∀i, ∀j, k.
The dual of Eq. (11.9) is very similar, except that the linear transitivity constraints
µ
jk
+ µ
kl
≤ µ
lj
+ 1, ∀i, ∀j, k, l are replaced by the corresponding mat(µ
i
) _ 0:
max
i,jk
µ
i,jk
i,jk
−
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,jk
(y
(i)
jk
−µ
i,jk
)f (x
(i)
jk
)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
s.t. mat(µ
i
) _ 0, ∀i; µ
i,jj
= 1, ∀i, ∀j; µ
i,jk
≥ 0, ∀i, ∀j, k.
The relation between the primal and dual solution is
w = C
i,jk
(y
(i)
jk
−µ
jk
)f (x
(i)
jk
). (11.10)
One important consequence of this relationship is that the edge parameters are all sup
port vector expansions. The dual objective can be expressed in terms of dotproducts
f (x
jk
)
¯
f (x
lm
). Therefore, we can use kernels K(x
jk
, x
lm
) to deﬁne the space of basis
functions. This kernel looks at two pairs of nodes, (j, k) and (l, m), and measures the
similarity between the relation between the nodes of each pair. If we are clustering points
in Euclidian space, the kernel could be a function of the two segments corresponding to
the pairs of points, for example, a polynomial kernel over their lengths and angle between
them.
168 CHAPTER 11. CORRELATION CLUSTERING
11.4 Experiments
We present experiments on a synthetic problem exploring the effect of irrelevant basis
functions (features), and two real data sets, email clustering and image segmentation.
11.4.1 Irrelevant features
In this section, we explore on a synthetic example how our algorithm deals with irrele
vant features. In particular, we generate data (100 points) from a mixture of two one
dimensional Gaussians, where each mixture component corresponds to a cluster. This ﬁrst
dimension is thus the relevant feature. Then we add noise components in D additional
(irrelevant) dimensions. The noise is independently generated for each dimension, from a
mixture of Gaussians with same difference in means and variance as for the relevant dimen
sion. Figure 11.1(a) shows the projection of a data sample onto the ﬁrst two dimensions
and on two irrelevant dimensions.
Let x
j
denote each point and x
j
[d] denote the dth dimension of the point. We used
a basis function for each dimension f
d
(x
jk
) = e
−(x
j
[d]−x
k
[d])
2
, plus an additional constant
basis function. The training and test data consists of a 100 samples from the model. The
results in Fig. 11.1(b) illustrate the capability of our algorithm to learn to ignore irrelevant
dimensions. The accuracy is the fraction of edges correctly predicted to be between/within
cluster. Random clustering will give an accuracy of 50%. The comparison with kmeans is
simply a baseline to illustrate the effect of the noise on the data.
11.4.2 Email clustering
We also test our approach on the task of clustering email into folders. We gathered the
data from the SRI CALO project.
1
Our dataset consisted of email from seven users (ap
proximately 100 consecutive messages per user), which the users had manually ﬁled into
different folders. The number of folders for each users varied from two to six, with an
average of 34 folders. We are interested in the problem of learning to cluster emails.
1
http://www.ai.sri.com/project/CALO
11.4. EXPERIMENTS 169
−4 −3 −2 −1 0 1 2 3
−4
−3
−2
−1
0
1
2
3
4
−4 −3 −2 −1 0 1 2 3 4
−4
−3
−2
−1
0
1
2
3
4
0.45
0.55
0.65
0.75
0.85
0.95
1 2 4 8 16 32 64 128
#noisedimensions
t
e
s
t
a
c
c
u
r
a
c
y
lcc
kmeans
(a) (b)
Figure 11.1: (a) Projection onto ﬁrst two dimensions (top) and two noise dimensions (bot
tom); (c) Performance on 2 cluster problem as function of the number of irrelevant noise
dimensions. Learning to cluster is the solid line, kmeans the dashed line. Errorbars de
note one standard deviation, averages are over 20 runs. Accuracy is the fraction of edges
correctly predicted to be between/within cluster.
Speciﬁcally, what score function s
jk
causes correlation clustering to give clusters similar
to those that human users had chosen?
To test our learning algorithm, we use each user as a training set in turn, learning the
parameters from the partition of a single user’s mailbox into folders. We then use the
learned parameters to cluster the other users’ mail. The basis functions f (x
jk
) measured the
similarity between the text of the messages, the similarity between the “From:” ﬁeld, “To:”
ﬁeld, and “Cc:” ﬁeld. One feature was used for each common word in the pair of emails
(except words that appeared in more than half the messages, which were deemed “stop
words” and omitted). Also, additional features captured the proportion of shared tokens
for each email ﬁeld, including the from, to, Cc, subject and body ﬁelds. The algorithm
is therefore able to automatically learn the relative importance of certain email ﬁelds to
ﬁling two messages together, as well as importance of meaningful words versus common,
irrelevant ones.
We compare our method to the kmeans clustering algorithm using with the same word
170 CHAPTER 11. CORRELATION CLUSTERING
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
1 2 3 4 5 6 7
User
P
a
i
r
F
1
lcc
kmeans
Figure 11.2: Average Pair F1 measure for clustering user mailboxes.
features, and took the best clustering out of ﬁve tries. We made this comparison somewhat
easy for kmeans by giving it the correct number of clusters k. We also informed our algo
rithm of the number of clusters by uniformly adding a positive weight to the edge weights
to cause it to give the correct number of clusters. We performed a simple binary search on
this additional bias weight parameter to ﬁnd the number of clusters comparable to k. The
results in Fig. 11.2 show the average F1 measure (harmonic mean of precision and recall;
a standard metric in information retrieval [BaezaYates & RibeiroNeto, 1999]) computed
on the pairs of messages that belonged to the same cluster. Our algorithm signiﬁcantly
outperforms kmeans on several users and does worse only for one of the users.
11.4.3 Image segmentation
We also test our approach on the task of image segmentation. We selected images from
the Berkeley Image Segmentation Dataset [Martin et al., 2001] for which two users had
signiﬁcantly different segmentations. For example, Fig. 11.3(a) and (b) show two distinct
segmentations: one very coarse, mostly based of overall hue, and one much ﬁner, based
on the hue and intensity. Depending on the task at hand, we may prefer the ﬁrst over the
second or viceversa. It is precisely this kind of variability in the similarity judgements that
11.4. EXPERIMENTS 171
(a) (b)
Figure 11.3: Two segmentations by different users: training image with (a) coarse segmen
tation and (b) ﬁne segmentation.
we want our algorithm to capture.
In order to segment the image, we ﬁrst divided it contiguous regions of approximately
the same color by running connected components on the pixels. We connected two adjacent
pixels by an edge if their RGB value was the same at a coarse resolution (4 bits per each
of the R,G,B channel). We then selected about a hundred largest regions, which covered
8090% of the pixels. These regions are the objects that our algorithm learns to cluster.
(We then use the learned metric to greedily assign the remaining small regions to the large
adjoining regions.)
There is a rich space of possible features we can use in our models: for each pair
of regions, we can consider their shape, color distribution, distance, presence of edges
between them, etc. In our experiments, we used a fairly simple set of features that are very
easy to compute. For each region, we calculated the bounding box, area and average color
(averaging the pixels in the RGB space). We then computed three distances (one for each
HSV channel), as well as the distance in pixels between the bounding boxes and the area
of the smaller of the two regions. All features were normalized to have zero mean and
variance 1.
We trained two models, one using Fig. 11.3(a) and the other using Fig. 11.3(b) and
172 CHAPTER 11. CORRELATION CLUSTERING
(a) (b) (c)
Figure 11.4: Test image: (a) input; (b) segmentation based on coarse training data (c)
segmentation based on ﬁne training data.
tested on the image in Fig. 11.4(a). The results are shown in Fig. 11.4(b) and (c), respec
tively. Note that mountains, rocks and grass are segmented very coarsely based on hue in
(b) while the segmentation in (c) is more detailed and sensitive to saturation and value of
the colors.
11.5 Related work
The performance of most clustering algorithms depends critically on the distance metric
that they are given for measuring the similarity or dissimilarity between different data
points. Recently, a number of algorithms have been proposed for automatically learning
distance metrics as a preprocessing step for clustering [Xing et al., 2002; BarHillel et al.,
2003]. In contrast to algorithms that learn a metric independently of the algorithm that will
be used to cluster the data, we describe a formulation that tightly integrates metric learning
with the clustering algorithm, tuning one to the other in a joint optimization. Thus, instead
of using an externallydeﬁned criterion for choosing the metric, we will instead seek to
learn a good metric for the clustering algorithm. An example of work in a similar vein is
the algorithm for learning a distance metric for spectral clustering [Bach & Jordan, 2003].
The clustering algorithm essentially uses an eigenvector decomposition of an appropriate
matrix derived from the pairwise afﬁnity matrix, which is more efﬁcient than correlation
clustering, for which we use LP or SDP formulations. However the objective in the learning
11.6. CONCLUSION 173
formulation proposed in Bach and Jordan [2003] is not convex and difﬁcult to optimize.
11.6 Conclusion
We looked at correlation clustering, and how to learn the edge weights from example clus
terings. Our approach ties together the inference and learning algorithm, and attempts
to learn a good metric speciﬁcally for the clustering algorithm.. We showed results on a
synthetic dataset, showcasing robustness to noise dimensions. Experiments on the CALO
email and image segmentation experiments show the potential of the algorithm on real
world data. The main limitation of the correlation clustering is scalability: the number of
constraints ([1[
3
) in the LP relaxation and the size of the positivesemideﬁnite constraint
in the SDP relaxation. It would be very interesting to explore constraint generation or sim
ilar approaches to speed up learning and inference. On the theoretical side, it would be
interesting to work out a PAClike bound for generalization of the learned score metric.
174 CHAPTER 11. CORRELATION CLUSTERING
Part IV
Conclusions and future directions
175
Chapter 12
Conclusions and future directions
This thesis presents a novel statistical estimation framework for structured models based
on the large margin principle underlying support vector machines. The framework results
in several efﬁcient learning formulations for complex prediction tasks. Fundamentally,
we rely on the expressive power of convex optimization problems to compactly capture
inference or solution optimality in structured models. Directly embedding this structure
within the learning formulation produces compact convex problems for efﬁcient estimation
of very complex models. For some of these models, alternative estimation methods are
intractable. We develop theoretical foundations for our approach and show a wide range
of experimental applications, including handwriting recognition, 3D terrain classiﬁcation,
disulﬁde connectivity in protein structure prediction, hypertext categorization, natural lan
guage parsing, email organization and image segmentation.
12.1 Summary of contributions
We view a structured prediction model as a mapping from the space of inputs x ∈ A to
a discrete vector output y ∈ ¸. Essentially, a model deﬁnes a compact, parameterized
scoring function w
¯
f (x, y) and prediction using the model reduces to ﬁnding the highest
scoring output y given the input x. Our class of models has the following linear form:
h
w
(x) = arg max
y: g(x,y)≤0
w
¯
f (x, y),
176
12.1. SUMMARY OF CONTRIBUTIONS 177
where w ∈ IR
n
is the vector of parameters of the model, constraints g(x, y) ∈ IR
k
deﬁne
the space of feasible outputs y given the input x and basis functions f (x, y) ∈ IR
n
represent
salient features of the input/output pair. Although the space of outputs ¦y : g(x, y) ≤ 0¦ is
usually immense, we assume that the inference problem arg max
y : g(x,y)≤0
w
¯
f (x, y) can
be solved (or closely approximated) by an efﬁcient algorithm that exploits the structure of
the constraints g and basis functions f . This deﬁnition covers a broad range of models,
from probabilistic models such as Markov networks and context free grammars to more
unconventional models like weighted graphcuts and matchings.
12.1.1 Structured maximum margin estimation
Given a sample S = ¦(x
(i)
, y
(i)
)¦
m
i=1
, we develop methods for ﬁnding parameters w such
that:
arg max
y∈¸
(i)
w
¯
f (x
(i)
, y) ≈ y
(i)
, ∀i,
where ¸
(i)
= ¦y : g(x
(i)
, y) ≤ 0¦.
The naive formulation
1
uses
i
[¸
(i)
[ linear constraints, which is generally exponential
in the number of variables in each y
(i)
.
min
1
2
[[w[[
2
s.t. w
¯
f
i
(y
(i)
) ≥ w
¯
f
i
(y) +
i
(y), ∀i, ∀y ∈ ¸
(i)
.
We propose two general approaches that transform the above exponential size QP to an
exactly equivalent polynomial size QP in many important classes of models. These formu
lations allow us to ﬁnd globally optimal parameters (with ﬁxed precision) in polynomial
time using standard optimization software. In many models where maximum likelihood
estimation is intractable, we provide exact maximum margin solutions (Ch. 7 and Ch. 10).
1
For simplicity, we omit the slack variables in this summary.
178 CHAPTER 12. CONCLUSIONS AND FUTURE DIRECTIONS
Minmax formulation
We can turn the above problem into an equivalent minmax formulation with i nonlinear
maxconstraints:
min
1
2
[[w[[
2
s.t. w
¯
f
i
(y
(i)
) ≥ max
y∈¸
(i)
[w
¯
f
i
(y) +
i
(y)], ∀i.
The key to solving the estimation problem above efﬁciently is the lossaugmented infer
ence problem max
y∈¸
(i) [w
¯
f
i
(y) +
i
(y)]. Even if max
y∈¸
(i) w
¯
f
i
(y) can be solved in
polynomial time using convex optimization, the form of the loss term
i
(y) is crucial for
the lossaugmented inference to remain tractable. We typically use a natural loss func
tion which is essentially the Hamming distance between y
(i)
and h(x
(i)
): the number of
variables predicted incorrectly.
We show that if we can express the (lossaugmented) inference as a compact convex
optimization problem (e.g., LP, QP, SDP, etc.), we can embed the maximization inside the
minmax formulation to get a compact convex program equivalent to the naive exponential
formulation. We show that this approach leads to exact polynomialsize formulations for
estimation of lowtreewidth Markov networks, associative Markov networks over binary
variables, contextfree grammars, bipartite matchings, and many other models.
Certiﬁcate formulation
There are several important combinatorial problems which allow polynomial time solu
tion yet do not have a compact convex optimization formulation. For example, maximum
weight perfect (nonbipartite) matching and spanning tree problems can be expressed as
linear programs with exponentially many constraints, but no polynomial formulation is
known [Bertsimas & Tsitsiklis, 1997; Schrijver, 2003]. Both of these problems, however,
can be solved in polynomial time using combinatorial algorithms. In some cases, though,
we can ﬁnd a compact certiﬁcate of optimality that guarantees that
y
(i)
= arg max
y
[w
¯
f
i
(y) +
i
(y)].
12.1. SUMMARY OF CONTRIBUTIONS 179
For perfect (nonbipartite) matchings, this certiﬁcate is a condition that ensures there are
no augmenting alternating cycles (see Ch. 10). We can express this condition by deﬁning
an auxiliary distance function on the nodes an a set of linear constraints that are satisﬁed if
and only if there are no negative cycles. This simple set of linear constraints scales linearly
with the number of edges in the graph. Similarly, we can derive a compact certiﬁcate for
the spanning tree problem.
The certiﬁcate formulation relies on the fact that verifying optimality of a solution is
often easier than actually ﬁnding one. This observation allows us to apply our framework
to an even broader range of models with combinatorial structure than the minmax formu
lation.
Maximum margin vs. maximum likelihood
There are several theoretical advantages to our approach in addition to the empirical accu
racy improvements we have shown experimentally. Because our approach only relies on
using the maximum in the model for prediction, and does not require a normalized dis
tribution P(y [ x) over all outputs, maximum margin estimation can be tractable when
maximum likelihood is not. For example, to learn a probabilistic model P(y [ x) over
bipartite matchings using maximum likelihood requires computing the normalizing parti
tion function, which is #Pcomplete [Valiant, 1979; Garey & Johnson, 1979]. By contrast,
maximum margin estimation can be formulated as a compact QP with linear constraints.
Similar results hold for an important subclass of Markov networks and nonbipartite match
ings.
In models that are tractable for both maximum likelihood and maximum margin (such
as lowtreewidth Markov networks, context free grammars, many other problems in which
inference is solvable by dynamic programming), our approach has an additional advantage.
Because of the hingeloss, the solutions to the estimation are relatively sparse in the dual
space (as in SVMs), which makes the use of kernels much more efﬁcient. Maximum like
lihood models with kernels are generally nonsparse and require pruning or greedy support
vector selection methods [Wahba et al., 1993; Zhu & Hastie, 2001; Lafferty et al., 2004;
Altun et al., 2004].
180 CHAPTER 12. CONCLUSIONS AND FUTURE DIRECTIONS
There are, of course, several advantages to maximum likelihood estimation. In appli
cations where probabilistic conﬁdence information is a must, maximum likelihood is much
more appropriate. Also, in training settings with missing data and hidden variables, proba
bilistic interpretation permits the use of wellunderstood algorithms such as EM [Dempster
et al., 1977].
Approximations
In many problems, the maximization problem we are interested in may be NPhard, for
example, we consider MAP inference in large treewidth Markov networks in Ch. 8, multi
way cuts in Ch. 7, graphpartitioning in Ch. 11. Many such problems can be written as
integer programs. Relaxations of such integer programs into LPs, QPs or SDPs often pro
vide excellent approximation algorithms and ﬁt well within our framework, particularly the
minmax formulation. We show empirically that these approximations are very effective in
many applications.
12.1.2 Markov networks: maxmargin, associative, relational
The largest portion of the thesis is devoted to novel estimation algorithms, representational
extensions, generalization analysis and experimental validation for Markov networks.
◦ Lowtreewidth Markov networks
We use a compact LP for MAP inference in Markov networks with sequence and
other lowtreewidth structure to derive an exact, compact, convex learning formu
lation. The dual formulation allows efﬁcient integration of kernels with graphical
models that leverages rich highdimensional representations for accurate prediction
in realworld tasks.
◦ Scalable online algorithm
Although our convex formulation is a QP with linear number of variables and con
straints in the size of the data, for large datasets (millions of examples), it is very
difﬁcult to solve using standard software. We present an efﬁcient algorithm for solv
ing the estimation problem called Structured SMO. Our onlinestyle algorithm uses
12.1. SUMMARY OF CONTRIBUTIONS 181
inference in the model and analytic updates to solve extremely large estimation prob
lems.
◦ Generalization analysis
We analyze the theoretical generalization properties of maxmargin estimation in
Markov networks and derive a novel marginbased bound for structured prediction.
This is the ﬁrst bound to address structured error (e.g., proportion of mislabeled
pixels in an image).
◦ Learning associative Markov networks (AMNs)
We deﬁne an important subclass of Markov networks that captures positive correla
tions present in many domains. This class of networks extends the Potts model [Potts,
1952] often used in computer vision and allows exact MAP inference in the case of
binary variables. We show how to express the inference problem using an LP which
is exact for binary networks. As a result, for associative Markov networks over bi
nary variables, our framework allows exact estimation of networks of arbitrary con
nectivity and topology, for which likelihood methods are believed to be intractable.
For the nonbinary case, we provide an approximation that works well in practice.
We present an AMNbased method for object segmentation from 3D range data. By
constraining the class of Markov networks to AMNs, our models are learned efﬁ
ciently and, at runtime, can scale up to tens of millions of nodes and edges by using
graphcut based inference [Kolmogorov & Zabih, 2002].
◦ Representation and learning of relational Markov networks
We introduce relational Markov networks (RMNs), which compactly deﬁne tem
plates for Markov networks for domains with relational structure: objects, attributes,
relations. The graphical structure of an RMN is based on the relational structure of
the domain, and can easily model complex interaction patterns over related entities.
We apply this class of models to classiﬁcation of hypertext using hyperlink structure
to deﬁne relations between webpages. We use a compact approximate MAP LP in
these complex Markov networks, in which exact inference is intractable, to derive an
approximate maxmargin formulation.
182 CHAPTER 12. CONCLUSIONS AND FUTURE DIRECTIONS
12.1.3 Broader applications: parsing, matching, clustering
The other large portion of the thesis addresses a range of prediction tasks with very diverse
models: context free grammars for natural language parsing, perfect matchings for disulﬁde
connectivity in protein structure prediction, graph partitions for clustering documents and
segmenting images.
◦ Learning to parse
We exploit dynamic programming decomposition of context free grammars to derive
a compact maxmargin formulation. We build on a recently proposed “unlexicalized”
grammar that allows cubic time parsing and we show how to achieve highaccuracy
parsing (still in cubic time) by exploiting novel kinds of lexical information. We show
experimental evidence of the model’s improved performance over several baseline
models.
◦ Learning to match
We use a combinatorial optimality condition, namely the absence of augmenting al
ternating cycles, to derive an exact, efﬁcient certiﬁcate formulation for learning to
match. We apply our framework to prediction of disulﬁde connectivity in proteins
using perfect matchings. The algorithmwe propose uses kernels, which makes it pos
sible to efﬁciently embed input features in very highdimensional spaces and achieve
stateoftheart accuracy.
◦ Learning to cluster
By expressing the correlation clustering problem as a compact LP and SDP, we use
the minmax formulation to learn a parameterized scoring function for clustering. In
contrast to algorithms that learn a metric independently of the algorithm that will
be used to cluster the data, we describe a formulation that tightly integrates metric
learning with the clustering algorithm, tuning one to the other in a joint optimization.
We formulate the approximate learning problem as a compact convex program. Ex
periments on synthetic and realworld data show the ability of the algorithm to learn
an appropriate clustering metric for a variety of desired clusterings, including email
folder organization and image segmentation.
12.2. EXTENSIONS AND OPEN PROBLEMS 183
12.2 Extensions and open problems
There are several immediate applications, less immediate extensions and open problems for
our estimation framework. We organize these ideas into several sections below, including
further theoretical analysis and new optimization algorithms, novel prediction tasks, and
more general learning settings.
12.2.1 Theoretical analysis and optimization algorithms
◦ Approximation bounds
In several of the intractable models, like multiclass AMNs in Ch. 7 and correlation
clustering in Ch. 11, we used approximate convex programs within the minmax for
mulation. These approximate inference programs have strong relative error bounds.
An open question is to translate these error bounds on inference into error bounds on
the resulting maxmargin formulations.
◦ Generalization bounds with distributional assumptions
In Ch. 5, we presented a bound on the structured error in Markov networks, with
out any assumption about the distribution of P(y [ x), relying only on the samples
(x
(i)
, y
(i)
) being i.i.d. This distributionfree assumption leads to a worst case analy
sis, while some assumptions about the approximate decomposition P(y [ x) may be
warranted. For example, for sequential prediction problems, the Markov assumption
of some ﬁnite order is reasonable (i.e., given the input and previous k labels, the next
label is independent of the labels more than k in the past). In spatial prediction tasks,
a label variable is independent of the rest given a large enough ball of labels around
it. Similar assumptions may be made for some “degree of separation” in relational
domains. More generally, it would be interesting to exploit such conditional indepen
dence assumptions or asymptotic bounds on entropy of P(y [ x) to get generalization
guarantees even from a single structured example (x, y).
◦ Problemspeciﬁc optimization methods
Although our convex formulations are polynomial in the size of the data, scaling
184 CHAPTER 12. CONCLUSIONS AND FUTURE DIRECTIONS
up to larger datasets will require problemspeciﬁc optimization methods. For low
treewidth Markov networks and context free grammars, we have presented the Struc
tured SMO algorithm. Another algorithm useful for such models is Exponentiated
Gradient [Bartlett et al., 2004]. Both algorithms rely on dynamic programming de
compositions. However, models which do not permit such decompositions, such as
graphcuts, matchings, and many others, create a need for new algorithms that can ef
fectively use combinatorial optimization as a subroutine to eliminate the dependence
on generalpurpose convex solvers.
12.2.2 Novel prediction tasks
◦ Bipartite matchings
Maximum weight bipartite matchings are used in a variety of problems to predict
mappings between sets of items. In machine translation, matchings are used to
map words of the two languages in aligned sentences [Matusov et al., 2004]. In 2D
shape matching, points on two shapes are matched based on their local contour fea
tures [Belongie et al., 2002]. Our framework provides an exact, efﬁcient alternative
to the maximum likelihood estimation for learning the matching scoring function.
◦ Sequence alignment
In standard pairwise alignment of biological sequences, a string edit distance is used
to determine which portions of the sequences align to each other [Needleman &
Wunsch, 1970; Durbin et al., 1998]. Finding the best alignment involves a dynamic
program that generalizes the longest common subsequence algorithm. Our frame
work can be applied (just as in context free grammar estimation) to efﬁciently learn
a more complex edit function that depends on the contextual string features, perhaps
using novel string kernels [Haussler, 1999; Leslie et al., 2002; Lodhi et al., 2000].
◦ Continuous prediction problems
We have addressed estimation of models with discrete output spaces, generalizing
classiﬁcation models to multivariate, structured classiﬁcation. Similarly, we can
consider a whole range of problems where the prediction variables are continuous.
12.2. EXTENSIONS AND OPEN PROBLEMS 185
Such problems are a natural generalizations of regression, involving correlated, inter
constrained realvalued outputs. For example, several recent models of metabolic
ﬂux in yeast use linear programming formulations involving quantities of various
enzymes, with stoichiometric constraints [Varma & Palsson, 1994]. It would be
interesting to use observed equilibria data under different conditions to learn what
“objective” the cell is maximizing. In ﬁnancial modeling, convex programs are often
used to model portfolio management; for example, Markowitz portfolio optimization
is formulated as a quadratic program which minimizes risk and maximizes expected
return under budget constraints [Markowitz, 1991; Luenberger, 1997]. In this setting,
one could learn a user’s return projection and risk assessment function from observed
portfolio allocations by the user.
These problems are similar to the discrete structured prediction models we have con
sidered: inference in the model can formulated as a convex optimization problem.
However, there are obstacles to directly applying the minmax or certiﬁcate formu
lations. Details of this are beyond the scope of this thesis, but it sufﬁces to say that
lossaugmented inference using, Hamming distance equivalent, L
1
loss (or L
2
loss),
no longer produces a maximization of a concave objective with convex constraints
since L
1
, L
2
are convex, not concave (it turns out that it is actually possible to use
L
∞
loss). Developing effective loss functions and maxmargin formulations for the
continuous setting could provide a novel set of effective models for structured multi
variate realvalued prediction problems.
12.2.3 More general learning settings
◦ Structure learning
We have focused on the problem of learning parameters of the model (even though
our kernelized models can be considered nonparametric). In the case of Markov
networks, especially in spatial and relational domains, there is a wealth of possible
structures (cliques in the network) one can use to model a problem. It is particularly
interesting to explore the problem of inducing these cliques automatically from data.
The standard method of greedy stepwise selection followed by reestimation is very
186 CHAPTER 12. CONCLUSIONS AND FUTURE DIRECTIONS
expensive in general networks [Della Pietra et al., 1997; Bach & Jordan, 2001].
Recent work on selecting input features in Markov networks (or CRFs) uses several
approximations to learn efﬁciently with millions of candidate features [McCallum,
2003]. However, clique selection is still relatively unexplored. It is possible that
AMNs, by restricting the network to be tractable under any structure, may permit
more efﬁcient clique selection methods.
◦ Semisupervised learning
Throughout the thesis we have assumed completely labeled data. This assumption
often limits us to relatively small training sets where data has been carefully anno
tated, while much of the easily accessible data is not at all or suitably labeled. There
are several more general settings we would like to extend our framework.
The simplest setting is a mix of labeled and unlabeled examples, where a small su
pervised dataset is augmented by a large unsupervised one. There has been much
research in this setting for classiﬁcation [Blum & Mitchell, 1998; Nigam et al., 2000;
Chapelle et al., 2002; Szummer & Jaakkola, 2001; Zhu et al., 2003; Corduneanu &
Jaakkola, 2003]. Although most of this work has been done in a probabilistic set
ting, the principle of regularizing (discouraging) decision boundaries near densely
clustered inputs could be applicable to our structured setting.
A more complex and rich setting involves presence of hidden variables in each ex
ample. For example, in machine translation, word correspondences between pairs of
sentences are usually not manually annotated (at least not on a large scale). These
correspondence variables can be treated as hidden variables. Similarly, in handwrit
ing recognition, we may not have each letter segmented out but instead just get a
word or sentence as a label for the entire image. This setting has been studied mainly
in the probabilistic, generative models often using the EMalgorithm[Dempster et al.,
1977; Cowell et al., 1999]. Discriminative methods have been explored far less. Es
pecially in the case of combinatorial structures, extensions of our framework allow
opportunities for problemspeciﬁc convex approximations to be exploited.
12.3. FUTURE 187
12.3 Future
We have presented a supervised learning framework for a large class of prediction mod
els with rich and interesting structure. Our approach has several theoretical and practical
advantages over standard probabilistic models and estimation methods for structured pre
diction. We hope that continued research in this framework will help tackle evermore
sophisticated prediction problems in the future.
Appendix A
Proofs and derivations
A.1 Proof of Theorem 5.5.1
The proof of Theorem 5.5.1 uses the covering number bounds of Zhang [2002] (in the
DataDependent Structural Risk Minimization framework [ShaweTaylor et al., 1998].)
Zhang provides generalization guarantees for linear binary classiﬁers of the form h
w
(x) =
sgn(w
¯
x). His analysis is based on the upper bounds on the covering number for the class
of linear functions T
L
(w, z) = w
¯
z where the norms of the vectors w and z are bounded.
We reproduce the relevant deﬁnitions and theorems from Zhang [2002] here to highlight
the necessary extensions for structured classiﬁcation.
The covering number is a key quantity in measuring function complexity. Intuitively,
the covering number of an inﬁnite class of functions (e.g. parameterized by a set of weights
w) is the number of vectors necessary to approximate the values of any function in the class
on a sample. Marginbased analysis of generalization error uses the margin achieved by a
classiﬁer on the training set to approximate the original function class of the classiﬁer by
a ﬁnite covering with precision that depends on the margin. Here, we will only deﬁne the
∞norm covering number.
188
A.1. PROOF OF THEOREM 5.5.1 189
A.1.1 Binary classiﬁcation
In binary classiﬁcation, we are given a sample S = ¦x
(i)
, y
(i)
¦
m
i=1
, from distribution D over
A ¸, where A = IR
n
and ¸ is mapped to ±1, so we can fold x and y into z = yx.
Deﬁnition A.1.1 (Covering Number) Let 1 = ¦v
(1)
, . . . , v
(r)
¦, where v
(j)
∈ IR
m
, be a
covering of a function class T(w, S) with precision under the metric ρ, if for all w there
exists a v
(j)
such that for each data sample z
(i)
∈ S:
ρ(v
(j)
i
, T(w, z
(i)
)) ≤ .
The covering number of a sample S is the size of the smallest covering: ^
∞
(T, ρ, , S) =
inf [1[ s.t. 1 is a covering of T(w, S). We also deﬁne the covering number for any sample
of size m: ^
∞
(T, ρ, , m) = sup
S: [S[=m
^
∞
(T, ρ, , S).
When the norms of w and z are bounded, we have the following upper bound on the
covering number of linear functions under the linear metric ρ
L
(v, v
t
) = [v −v
t
[.
Theorem A.1.2 (Theorem 4 from Zhang [2002]) If w
2
≤ a and z
2
≤ b, then ∀
> 0,
log
2
^
∞
(T
L
, ρ
L
, , m) ≤ 36
a
2
b
2
2
log
2
(2 ¸4ab/ + 2 m + 1) .
In order to use the classiﬁer’s margin to bound its expected loss, the bounds below use
a stricter, marginbased loss on the training sample that measures the worst loss achieved
by the approximate covering based on this margin. Let f : IR → [0, 1] be a loss function.
In binary classiﬁcation, we let f(v) = 1I(v ≤ 0) be the step function, so that 01 loss of
sgn(w
¯
x) is f(T
L
(w, z)). The next theorem bounds the expected f loss in terms of the
γmargin loss, f
γ
(v) = sup
ρ(v,v
)<2γ
f(v
t
), on the training sample. For 01 loss and linear
metric ρ
L
, the corresponding γmargin loss is f
γ
(v) = 1I(v ≤ 2γ).
Theorem A.1.3 (Corollary 1 from Zhang [2002]) Let f : IR → [0, 1] be a loss function
and f
γ
(v) = sup
ρ(v,v
)<2γ
f(v
t
) be the γmargin loss for a metric ρ. Let γ
1
> γ
2
> . . . be
190 APPENDIX A. PROOFS AND DERIVATIONS
a decreasing sequence of parameters, and p
i
be a sequence of positive numbers such that
∞
i=1
p
i
= 1, then for all δ > 0, with probability of at least 1 −δ over data:
E
D
[f(T(w, z))] ≤ E
S
[f
γ
(T(w, z))] +
¸
32
m
_
ln 4^
∞
(T, ρ, γ
i
, S) + ln
1
p
i
δ
_
for all w and γ, where for each ﬁxed γ, we use i to denote the smallest index s.t. γ
i
≤ γ.
A.1.2 Structured classiﬁcation
We will extend this framework to bound the average perlabel loss
H
(y)/L for structured
classiﬁcation by deﬁning an appropriate loss f and a function class T (as well as a metric
ρ) such that f(T) computes average perlabel loss and f
γ
(T) provides a suitable γmargin
loss. We will bound the corresponding covering number by building on the bound in The
orem A.1.2.
We can no longer simply fold x and y, since y is a vector, so we let z = (x, y). In
order for our loss function to compute average perlabel loss, it is convenient to make our
function class vectorvalued (instead of scalarvalued as above). We deﬁne a new function
class T
M
(w, z), which is a vector of minimum values of w
¯
∆f
i
(y) for each error level
H
(y) from 1 to L as described below.
Deﬁnition A.1.4 (dtherrorlevel function) The dtherrorlevel function M
d
(w, z) for d ∈
¦1, . . . , L¦ is given by:
M
d
(w, z) = min
y:
H
(y)=d
w
¯
∆f
i
(y).
Deﬁnition A.1.5 (Multierrorlevel function class) The multierrorlevel function class T
M
(w, z)
is given by:
T
M
(w, z) = (M
1
(w, z), . . . , M
d
(w, z), . . . , M
L
(w, z)) .
We can now compute the average perlabel loss from T
M
(w, z) by deﬁning an appropriate
loss function f
M
.
A.1. PROOF OF THEOREM 5.5.1 191
Deﬁnition A.1.6 (Average perlabel loss) The average perlabel loss f
M
: IR
L
→[0, 1] is
given by:
f
M
(v) =
1
L
arg min
d:v
d
≤0
v
d
,
where in case ∀d, v
d
> 0, we deﬁne arg min
d:v
d
≤0
v
d
≡ 0.
With the above deﬁnitions, we have an upper bound on the average perlabel loss
f
M
(T
M
(w, z)) =
1
L
arg min
d:M
d
(w,z)≤0
M
d
(w, z) ≥
1
L
H
_
arg max
y
w
¯
f
i
(y)
_
.
Note that the case ∀d, M
d
(w, z) > 0 corresponds to the classiﬁer making no mistakes:
arg max
y
w
¯
f
i
(y) = y. This upper bound is tight if y = arg max
y
w
¯
f (x, y
t
), Other
wise, it is adversarial: it picks from all y
t
which are better (w
¯
f (y) ≤ w
¯
f (y
t
)), one that
maximizes the Hamming distance from y.
We now need to deﬁne an appropriate metric ρ that in turn deﬁnes γmargin loss for
structured classiﬁcation. Since the margin of the hypothesis grows with the number of
mistakes, our metric can become “looser” with the number of mistakes, as there is more
room for error.
Deﬁnition A.1.7 (Multierrorlevel metric) Let the multierrorlevel metric ρ
M
: IR
L
IR
L
→IR for a vector in IR
L
be given by:
ρ
M
(v, v
t
) = max
d
[v
d
−v
t
d
[
d
.
We now deﬁne the corresponding γmargin loss using the new metric:
Deﬁnition A.1.8 (γmargin average perlabel loss) The γmargin average perlabel loss
f
γ
M
: IR
L
→[0, 1] is given by:
f
γ
M
(v) = sup
ρ
M
(v,v
)≤2γ
f
M
(v
t
).
Combining the two deﬁnitions, we get:
f
γ
M
(T
M
(w, z)) = sup
v:[v
d
−M
d
(w,z)[≤2dγ
1
L
arg min
d:v
d
≤0
v
d
.
192 APPENDIX A. PROOFS AND DERIVATIONS
We also deﬁne the corresponding covering number for our vectorvalued function class:
Deﬁnition A.1.9 (Multierrorlevel covering number) Let 1 = ¦V
(1)
, . . . , V
(r)
¦, where
V
(j)
= (V
(j)
1
, . . . , V
(j)
i
, . . . , V
(j)
m
) and V
(j)
i
∈ IR
L
, be a covering of T
M
(w, S), with 
precision under the metric ρ
M
, if for all w there exists a V
(j)
such that for each data
sample z
(i)
∈ S:
ρ
M
(V
(j)
i
, T
M
(w, z
(i)
)) ≤ .
The covering number of a sample S is the size of the smallest covering: ^
∞
(T
M
, ρ
M
, , S) =
inf [1[ s.t. 1 is a covering of T
M
(w, S). We also deﬁne
^
∞
(T
M
, ρ
M
, , m) = sup
S: [S[=m
^
∞
(T
M
, ρ
M
, , S).
We provide a bound on the covering number of our new function class in terms of a
covering number for the linear function class. Recall that N
c
is the maximum number of
cliques in ((x), V
c
is the maximum number of values in a clique [Y
c
[, q is the maximum
number of cliques that have a variable in common, and R
c
is an upperbound on the 2norm
of clique basis functions. Consider a ﬁrstorder sequence model as an example, with L as
the maximum length, and V the number of values a variable takes. Then N
c
= 2L−1 since
we have L node cliques and L −1 edge cliques; V
c
= V
2
because of the edge cliques; and
q = 3 since nodes in the middle of the sequence participate in 3 cliques: previouscurrent
edge clique, node clique, and currentnext edge clique.
Lemma A.1.10 (Bound on multierrorlevel covering number)
^
∞
(T
M
, ρ
M
, q, m) ≤ ^
∞
(T
L
, ρ
L
, , mN
c
(V
c
−1)).
Proof: We will show that ^
∞
(T
M
, ρ
M
, q, S) ≤ ^
∞
(T
L
, ρ
L
, , S
t
) for any sample S
of size m, where we construct the sample S
t
of size mN
c
(V
c
− 1) in order to cover the
clique potentials as described below. Note that this is sufﬁcient since ^
∞
(T
L
, ρ
L
, , S
t
) ≤
^
∞
(T
L
, ρ
L
, , mN
c
(V
c
−1)), by deﬁnition, so
^
∞
(T
M
, ρ
M
, q, m) = sup
S:[S[=m
^
∞
(T
M
, ρ
M
, q, S) ≤ ^
∞
(T
L
, ρ
L
, , mN
c
(V
c
−1)).
A.1. PROOF OF THEOREM 5.5.1 193
The construction of S
t
below is inspired by the proof technique in Collins [2001],
but the key difference is that our construction is linear in the number of cliques N
c
and
exponential in the number of label variables per clique, while his is exponential in the total
number of label variables per example. This reduction in size comes about because our
covering approximates the values of clique potentials w
¯
∆f
i,c
(y
c
) for each clique c and
clique assignment y
c
as opposed to the values of entire assignments w
¯
∆f
i
(y).
For each sample z ∈ S, we create N
c
(V
c
− 1) samples ∆f
i,c
(y
c
), one for each clique
c and each assignment y
c
,= y
(i)
c
. We construct a set of vectors 1 = ¦v
(1)
, . . . , v
(r)
¦,
where v
(j)
∈ IR
mN
c
(V
c
−1)
. The component of v
(j)
corresponding to the sample z
(i)
and the
assignment y
c
to the labels of the clique c will be denoted by v
(j)
i,c
(y
c
). For convenience,
we deﬁne v
(j)
i,c
(y
(i)
c
) = 0 for correct label assignments, as ∆f
i,c
(y
(i)
c
) = 0. To make 1 an
∞norm covering of T
L
(w, S
t
) under ρ
L
, we require that for any w there exists a v
(j)
∈ 1
such that for each sample z
(i)
:
[v
(j)
i,c
(y
c
) −w
¯
∆f
i,c
(y
c
)[ ≤ ; ∀c ∈ (
(i)
, ∀y
c
. (A.1)
By Deﬁnition A.1.1, the number of vectors in 1 is given by r = ^
∞
(T
L
, ρ
L
, , mN
c
(V
c
−1)).
We can now use 1 to construct a covering 1 = ¦V
(1)
, . . . , V
(r)
¦, where
V
(j)
= (V
(j)
1
, . . . , V
(j)
i
, . . . , V
(j)
m
)
and V
(j)
i
∈ IR
L
, for our multierrorlevel function T
M
. Let v
(j)
i
(y) =
c
v
(j)
i,c
(y
c
), and
M
d
(v
(j)
i
, z
(i)
) = min
y:
H
i
(y)=d
v
(j)
i
(y), then
V
(j)
i
= (M
1
(v
(j)
, z
(i)
), . . . , M
d
(v
(j)
, z
(i)
), . . . , M
L
(v
(j)
, z
(i)
)) . (A.2)
Note that v
(j)
i,c
(y
c
) is zero for all cliques c for which the assignment is correct: y
c
= y
(i)
c
.
Thus for an assignment y with d mistakes, at most dq v
(j)
i,c
(y
c
) will be nonzero, as each
label can appear in at most q cliques. By combining this fact with Eq. (A.1), we obtain:
¸
¸
¸v
(j)
i
(y) −w
¯
∆f
i
(y)
¸
¸
¸ ≤ dq, ∀i, ∀y :
H
i
(y) = d. (A.3)
194 APPENDIX A. PROOFS AND DERIVATIONS
We conclude the proof by showing that 1 is a covering of T
M
under ρ
M
: For each w,
pick V
(j)
∈ 1 such that the corresponding v
(j)
∈ 1 satisﬁes the condition in Eq. (A.1). We
must now bound:
ρ
M
(V
(j)
i
, T
M
(w, z
(i)
)) = max
d
[ min
y:
H
i
(y)=d
v
(j)
i
(y) −min
y:
H
i
(y)=d
w
¯
∆f
i
(y)[
d
.
Fix any i. Let y
v
d
= arg min
y:
H
i
(y)=d
v
(j)
i
(y) and y
w
d
= arg min
y:
H
i
(y)=d
w
¯
∆f
i
(y). Con
sider the case where v
(j)
i
(y
v
d
) ≥ w
¯
∆f
i
(y
w
d
) (the reverse case is analogous), we must
prove that:
v
(j)
i
(y
v
d
) −w
¯
∆f
i
(y
w
d
) ≤ v
(j)
i
(y
w
d
) −w
¯
∆f
i
(y
w
d
) ≤ dq ; (A.4)
where the ﬁrst step follows from deﬁnition of y
v
d
, since v
(j)
i
(y
v
d
) ≤ v
(j)
i
(y
w
d
). The last step
is a direct consequence of Eq. (A.3). Hence ρ
M
(V
(j)
i
, T
M
(w, z
(i)
)) ≤ q.
Lemma A.1.11 (Numeric bound on multierrorlevel covering number)
log
2
^
∞
(T
M
, ρ
M
, , m) ≤ 36
R
2
c
w
2
2
q
2
2
log
2
_
1 + 2
_
4
R
c
w
2
q
+ 2
_
mN
c
(V
c
−1)
_
.
Proof: Substitute Theorem A.1.2 into Lemma A.1.10.
Theorem A.1.12 (Multilabel analog of Theorem A.1.3) Let f
M
and f
γ
M
(v) be as deﬁned
above. Let γ
1
> γ
2
> . . . be a decreasing sequence of parameters, and p
i
be a sequence
of positive numbers such that
∞
i=1
p
i
= 1, then for all δ > 0, with probability of at least
1 −δ over data:
E
z
f
M
(T
M
(w, z)) ≤ E
S
f
γ
M
(T
M
(w, z)) +
¸
32
m
_
ln 4^
∞
(T
M
, ρ
M
, γ
i
, S) + ln
1
p
i
δ
_
for all w and γ, where for each ﬁxed γ, we use i to denote the smallest index s.t. γ
i
≤ γ.
Proof: Similar to the proof of Zhang’s Theorem 2 and Corollary 1 [Zhang, 2002] where
in Step 3 (derandomization) we substitute the vectorvalued T
M
and the metric ρ
M
.
Theorem 5.5.1 follows from above theorem with γ
i
= R
c
w
2
/2
i
and p
i
= 1/2
i
using an
A.2. AMN PROOFS AND DERIVATIONS 195
argument identical to the proof of Theorem 6 in Zhang [2002].
A.2 AMN proofs and derivations
In this appendix, we present proofs of the LP inference properties and derivations of the
factored primal and dual maxmargin formulation from Ch. 7. Recall that the LP relaxation
for ﬁnding the optimal max
y
g(y) is:
max
v∈1
K
k=1
µ
v
(k)g
v
(k) +
c∈(\1
K
k=1
µ
c
(k)g
c
(k) (A.5)
s.t. µ
c
(k) ≥ 0, ∀c ∈ (, k;
K
k=1
µ
v
(k) = 1, ∀v ∈ 1;
µ
c
(k) ≤ µ
v
(k), ∀c ∈ ( ¸ 1, v ∈ c, k.
A.2.1 Binary AMNs
Proof (For Theorem 7.2.1) Consider any fractional, feasible µ. We show that we can con
struct a new feasible assignment µ
t
which increases the objective (or leaves it unchanged)
and furthermore has fewer fractional entries.
Since g
c
(k) ≥ 0, we can assume that µ
c
(k) = min
v∈c
µ
v
(k); otherwise we could in
crease the objective by increasing µ
c
(k). We construct an assignment µ
t
from µ by leaving
integral values unchanged and uniformly shifting fractional values by λ:
µ
t
v
(1) = µ
v
(1) −λ1I(0 < µ
v
(1) < 1), µ
t
v
(2) = µ
v
(2) + λ1I(0 < µ
v
(2) < 1),
µ
t
c
(1) = µ
c
(1) −λ1I(0 < µ
c
(1) < 1), µ
t
c
(2) = µ
c
(2) + λ1I(0 < µ
c
(2) < 1).
Now consider the smallest fractional µ
v
(k), λ(k) = min
v : µ
v
(k)>0
y
v
(k) for k = 1, 2.
Note that if λ = λ(1) or λ = −λ(2), µ
t
will have at least one more integral µ
t
v
(k) than µ.
Thus if we can show that the update results in a feasible and better scoring assignment, we
can apply it repeatedly to get an optimal integer solution. To show that µ
t
is feasible, we
need µ
t
v
(1) + µ
t
v
(2) = 1, µ
t
v
(k) ≥ 0 and µ
t
c
(k) = min
i∈c
µ
t
v
(k).
196 APPENDIX A. PROOFS AND DERIVATIONS
First, we show that µ
t
v
(1) + µ
t
v
(2) = 1.
µ
t
v
(1) + µ
t
v
(2) = µ
v
(1) −λ1I(0 < µ
v
(1) < 1) + µ
v
(2) + λ1I(0 < µ
v
(2) < 1)
= µ
v
(1) + µ
v
(2) = 1.
Above we used the fact that if µ
v
(1) is fractional, so is µ
v
(2), since µ
v
(1) + µ
v
(2) = 1.
To show that µ
t
v
(k) ≥ 0, we prove min
v
µ
t
v
(k) = 0.
min
v
µ
t
v
(k) = min
v
_
µ
v
(k) −( min
i:µ
v
(k)>0
µ
v
(k))1I(0 < µ
v
(k) < 1)
_
= min
_
min
i
µ
v
(k), min
i:µ
v
(k)>0
_
µ
v
(k) − min
i:µ
v
(k)>0
µ
v
(k)
__
= 0.
Lastly, we show µ
t
c
(k) = min
i∈c
µ
t
v
(k).
µ
t
c
(1) = µ
c
(1) −λ1I(0 < µ
c
(1) < 1)
= (min
i∈c
µ
v
(1)) −λ1I(0 < min
i∈c
µ
v
(1) < 1) = min
i∈c
µ
t
v
(1);
µ
t
c
(2) = µ
c
(2) + λ1I(0 < µ
c
(1) < 1)
= (min
i∈c
µ
v
(2)) + λ1I(0 < min
i∈c
µ
v
(2) < 1) = min
i∈c
µ
t
v
(2).
We have established that the new µ
t
are feasible, and it remains to show that we can
improve the objective. We can show that the change in the objective is always λD for some
constant D that depends only on µ and g. This implies that one of the two cases, λ = λ(1)
or λ = −λ(2), will necessarily increase the objective (or leave it unchanged). The change
in the objective is:
v∈1
k=1,2
[µ
t
v
(k) −µ
v
(k)]g
v
(k) +
c∈(\1
k=1,2
[µ
t
c
(k) −µ
c
(k)]g
c
(k)
= λ
_
_
v∈1
[D
v
(1) −D
v
(2)] +
c∈(\1
[D
c
(1) −D
c
(2)]
_
_
= λD
D
v
(k) = g
v
(k)1I(0 < µ
v
(k) < 1), D
c
(k) = g
c
(k)1I(0 < µ
c
(k) < 1).
Hence the new assignment µ
t
is feasible, does not decrease the objective function, and
A.2. AMN PROOFS AND DERIVATIONS 197
has strictly fewer fractional entries.
A.2.2 Multiclass AMNs
For K > 2, we use the randomized rounding procedure of Kleinberg and Tardos [1999]
to produce an integer solution for the linear relaxation, losing at most a factor of m =
max
c∈(
[c[ in the objective function. The basic idea of the rounding procedure is to treat
µ
v
(k) as probabilities and assign labels according to these probabilities in phases. In each
phase, we pick a label k, uniformly at random, and a threshold α ∈ [0, 1] uniformly at
random. For each node i which has not yet been assigned a label, we assign the label k
if µ
v
(k) ≥ α. The procedure terminates when all nodes have been assigned a label. Our
analysis closely follows that of Kleinberg and Tardos [1999].
Lemma A.2.1 The probability that a node i is assigned label k by the randomized proce
dure is µ
v
(k).
Proof The probability that an unassigned node is assigned label k during one phase is
1
K
µ
v
(k), which is proportional to µ
v
(k). By symmetry, the probability that a node is as
signed label k over all phases is exactly µ
v
(k).
Lemma A.2.2 The probability that all nodes in a clique c are assigned label k by the
procedure is at least
1
[c[
µ
c
(k).
Proof For a single phase, the probability that all nodes in a clique c are assigned label k if
none of the nodes were previously assigned is
1
K
min
i∈c
µ
v
(k) =
1
K
µ
c
(k). The probability
that at least one of the nodes will be assigned label k in a phase is
1
K
(max
i∈c
µ
v
(k)). The
probability that none of the nodes in the clique will be assigned any label in one phase is
1 −
1
K
K
k=1
max
i∈c
µ
v
(k).
Nodes in the clique c will be assigned label k by the procedure if they are assigned label
k in one phase. (They can also be assigned label k as a result of several phases, but we can
ignore this possibility for the purposes of the lower bound.) The probability that all the
198 APPENDIX A. PROOFS AND DERIVATIONS
nodes in c will be assigned label k by the procedure in a single phase is:
∞
j=1
1
K
µ
c
(k)
_
1 −
1
K
K
k=1
max
i∈c
µ
v
(k)
_
j−1
=
µ
c
(k)
K
k=1
max
i∈c
µ
v
(k)
≥
µ
c
(k)
K
k=1
i∈c
µ
v
(k)
=
µ
c
(k)
i∈c
K
k=1
µ
v
(k)
=
µ
c
(k)
[c[
.
Above, we ﬁrst used the fact that for d < 1,
∞
i=0
d
i
=
1
1−d
, and then upperbounded
the max of the set of positive µ
v
(k)’s by their sum.
Theorem A.2.3 The expected cost of the assignment found by the randomized procedure
given a solution µ to the linear program in Eq. (A.5) is at least
v∈1
K
k=1
g
v
(k)µ
v
(k) +
c∈(\1
1
[c[
K
k=1
g
c
(k)µ
k
c
.
Proof This is immediate from the previous two lemmas.
The only difference between the expected cost of the rounded solution and the (non
integer) optimal solution is the
1
[c[
factor in the second term. By picking m = max
c∈(
[c[, we
have that the rounded solution is at most m times worse than the optimal solution produced
by the LP of Eq. (A.5).
We can also derandomize this procedure to get a deterministic algorithm with the same
guarantees, using the method of conditional probabilities, similar in spirit to the approach
of Kleinberg and Tardos [1999].
Note that the approximation factor of m applies, in fact, only to the clique poten
tials. Thus, if we compare the logprobability of the optimal MAP solution and the log
probability of the assignment produced by this randomized rounding procedure, the terms
corresponding to the logpartitionfunction and the node potentials are identical. We obtain
an additive error (in logprobability space) only for the clique potentials. As node poten
tials are often larger in magnitude than clique potentials, the fact that we incur no loss
proportional to node potentials is likely to lead to smaller errors in practice. Along similar
lines, we note that the constant factor approximation is smaller for smaller cliques; again,
we observe, the potentials associated with large cliques are typically smaller in magnitude,
reducing further the actual error in practice.
A.2. AMN PROOFS AND DERIVATIONS 199
A.2.3 Derivation of the factored primal and dual maxmargin QP
Using Assumptions 7.4.1 and 7.4.4, we have the dual of the LP used to represent the
interior max subproblem max
y
w
¯
f
i
(y) +
i
(y) in Eq. (3.2):
min
v∈1
ξ
i,v
(A.6)
s.t. −w
¯
f
i,v
(k) −
c⊃v
m
i,c,v
(k) ≥
i,v
(k) −ξ
i,v
, ∀i, v ∈ 1
(i)
, k;
−¨ w
¯
¨
f
i,c
(k) +
v∈c
m
i,c,v
(k) ≥
i,c
(k), ∀i, c ∈ (
(i)
¸ 1
(i)
, k;
m
i,c,v
(k) ≥ 0, ∀i, c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k;
where f
i,c
(k) = f
i,c
(k, . . . , k) and
i,c
(k) =
i,c
(k, . . . , k). In the dual, we have a variable
ξ
i,v
for each normalization constraint in Eq. (7.1) and variables m
i,c,v
(k) for each of the
inequality constraints.
Substituting this dual into Eq. (5.1), we obtain:
min
1
2
[[w[[
2
+ C
i
ξ
i
(A.7)
s.t. w
¯
f
i
(y
(i)
) + ξ
i
≥
v∈1
(i)
ξ
i,v
, ∀i;
−w
¯
f
i,v
(k) −
c⊃v
m
i,c,v
(k) ≥
i,v
(k) −ξ
i,v
, ∀i, v ∈ 1
(i)
, k;
−¨ w
¯
¨
f
i,c
(k) +
v∈c
m
i,c,v
(k) ≥
i,c
(k), ∀i, c ∈ (
(i)
¸ 1
(i)
, k;
m
i,c,v
(k) ≥ 0, ∀i, c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k;
¨ w ≥ 0.
Now let ξ
i,v
= ξ
t
i,v
+ w
¯
f
i,v
(y
(i)
v
) +
c⊃v
¨ w
¯
¨
f
i,c
(y
(i)
c
)/[c[ and m
i,c,v
(k) = m
t
i,c,v
(k) +
¨ w
¯
¨
f
i,c
(y
(i)
c
)/[c[. Reexpressing the above QP in terms of these new variables, we get:
200 APPENDIX A. PROOFS AND DERIVATIONS
min
1
2
[[w[[
2
+ C
i
ξ
i
(A.8)
s.t. ξ
i
≥
v∈1
(i)
ξ
t
i,v
, ∀i;
w
¯
∆f
i,v
(k) −
c⊃v
m
t
i,c,v
(k) ≥
i,v
(k) −ξ
t
i,v
, ∀i, v ∈ 1
(i)
, k;
¨ w
¯
∆
¨
f
i,c
(k) +
v∈c
m
t
i,c,v
(k) ≥
i,c
(k), ∀i, c ∈ (
(i)
¸ 1
(i)
, k;
m
t
i,c,v
(k) ≥ −¨ w
¯
¨
f
i,c
(y
(i)
c
)/[c[, ∀i, c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k;
¨ w ≥ 0.
Since ξ
i
=
i,v∈1
(i)
ξ
t
i,v
at the optimum, we can eliminate ξ
i
and the corresponding set
of constraints to get the formulation in Eq. (7.4), repeated here for reference:
min
1
2
[[w[[
2
+ C
i,v∈1
(i)
ξ
i,v
(A.9)
s.t. w
¯
∆f
i,v
(k) −
c⊃v
m
i,c,v
(k) ≥
i,v
(k) −ξ
i,v
, ∀i, v ∈ 1
(i)
, k;
¨ w
¯
∆
¨
f
i,c
(k) +
v∈c
m
i,c,v
(k) ≥
i,c
(k), ∀i, c ∈ (
(i)
¸ 1
(i)
, k;
m
i,c,v
(k) ≥ −¨ w
¯
¨
f
i,c
(y
(i)
c
)/[c[, ∀i, c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k;
¨ w ≥ 0.
A.2. AMN PROOFS AND DERIVATIONS 201
Now the dual of Eq. (A.9) is given by:
max
i,c∈(
(i)
, k
µ
i,c
(k)
i,c
(k) −
1
2
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,v∈1
(i)
, k
µ
i,v
(k)∆
˙
f
i,v
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
(A.10)
−
1
2
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¨ τ +
i,c∈(
(i)
\1
(i)
,v∈c, k
λ
i,c,v
(k)
¨
f
i,c
(y
(i)
c
)/[c[ +
i,c∈(
(i)
, k
µ
i,c
(k)∆
¨
f
i,c
(k)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
s.t. µ
i,c
(k) ≥ 0, ∀i, ∀c ∈ (
(i)
, k;
K
k=1
µ
i,v
(k) = C, ∀i, ∀v ∈ 1
(i)
;
µ
i,c
(k) −µ
i,v
(k) = λ
i,c,v
(k), ∀i, ∀c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k;
λ
i,c,v
(k) ≥ 0 ∀i, ∀c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k,
¨ τ ≥ 0.
In this dual, µ correspond to the ﬁrst two sets of constraints, while λ and ¨ τ correspond
to third and fourth set of constraints. Using the substitution
¨ ν = ¨ τ +
i,c∈(
(i)
\1
(i)
,v∈c, k
λ
i,c,v
(k)
¨
f
i,c
(y
(i)
c
)/[c[
and the fact that λ
i,c,v
(k) ≥ 0 and
¨
f
i,c
(y
(i)
c
) ≥ 0, we can eliminate λ and ¨ τ, as well as divide
µ’s by C, and reexpress the above QP as:
max
i,c∈(
(i)
, k
µ
i,c
(k)
i,c
(k) −
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
i,v∈1
(i)
, k
µ
i,v
(k)∆
˙
f
i,v
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
−
1
2
C
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¨ ν +
i,c∈(
(i)
, k
µ
i,c
(k)∆
¨
f
i,c
(k)
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
¸
2
s.t. µ
i,c
(k) ≥ 0, ∀i, ∀c ∈ (
(i)
, k;
K
k=1
µ
i,v
(k) = 1, ∀i, ∀v ∈ 1
(i)
;
µ
i,c
(k) ≤ µ
i,v
(k), ∀i, ∀c ∈ (
(i)
¸ 1
(i)
, v ∈ c, k; ¨ ν ≥ 0.
Bibliography
Abbeel, P., & Ng, A. Y. (2004). Apprenticeship learning via inverse reinforcement learning.
Proc. ICML.
Ahuja, R., & Orlin, J. (2001). Inverse optimization, Part I: Linear programming and general
problem. Operations Research, 35, 771–783.
Altschul, S., Madden, T., Schaffer, A., Zhang, A., Miller, W., & Lipman (1997). Gapped
BLAST and PSIBLAST: a new generation of protein database search programs. Nucleid
Acids Res., 25, 3389–3402.
Altun, Y., Smola, A., & Hofmann, T. (2004). Exponential families for conditional random
ﬁelds. Proc. UAI.
Altun, Y., Tsochantaridis, I., & Hofmann, T. (2003). Hidden markov support vector ma
chines. Proc. ICML.
Bach, F., & Jordan, M. (2001). Thin junction trees. NIPS.
Bach, F., & Jordan, M. (2003). Learning spectral clustering. NIPS.
BaezaYates, R., & RibeiroNeto, B. (1999). Modern information retrieval. Addison
WesleyLongman.
Bairoch, A., & Apweiler, R. (2000). The SwissProt protein sequence database and its
supplement trembl. Nucleic Acids Res., 28, 45–48.
Baldi, P., Cheng, J., & Vullo, A. (2004). Largescale prediction of disulphide bond connec
tivity. Proc. NIPS.
202
BIBLIOGRAPHY 203
Baldi, P., & Pollastri, G. (2003). The principled design of largescale recursive neural
network architectures dagrnns and the protein structure prediction problem. Journal of
Machine Learning Research, 4, 575–602.
Bansal, N., Blum, A., & Chawla, S. (2002). Correlation clustering. FOCS.
BarHillel, A., Hertz, T., Shental, N., & Weinshall, D. (2003). Learning distance functions
using equivalence relations. Proc. ICML.
Bartlett, P., Collins, M., Taskar, B., & McAllester, D. (2004). Exponentiated gradient
algorithms for largemargin structured classiﬁcation. NIPS.
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2003). Convexity, classiﬁcation, and risk
bounds (Technical Report 638). Department of Statistics, U.C. Berkeley.
Belongie, S., Malik, J., & Puzicha, J. (2002). Shape matching and object recognition using
shape contexts. IEEE Trans. Pattern Anal. Mach. Intell., 24.
Berman, H., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T., Weissig, H., Shindyalov, I., &
Bourne, P. (2000). The protein data bank.
Bertsekas, D. (1999). Nonlinear programming. Belmont, MA: Athena Scientiﬁc.
Bertsimas, D., & Tsitsiklis, J. (1997). Introduction to linear programming. Athena Scien
tiﬁc.
Besag, J. E. (1986). On the statistical analysis of dirty pictures. Journal of the Royal
Statistical Society B, 48.
Bishop, C. (1995). Neural networks for pattern recognition. Oxford, UK: Oxford Univer
sity Press.
Blum, A., & Mitchell, T. (1998). Combining labeled and unlabeled data with cotraining.
Proc. COLT.
Bouman, C., & Shapiro, M. (1994). A multiscale random ﬁeld model for bayesian image
segmentation. IP, 3(2).
204 BIBLIOGRAPHY
Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.
Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of mincut/maxﬂow
algorithms for energy minimization in computer vision. PAMI.
Boykov, Y., Veksler, O., & Zabih, R. (1999a). Fast approximate energy minimization via
graph cuts. ICCV.
Boykov, Y., Veksler, O., & Zabih, R. (1999b). Markov random ﬁelds with efﬁcient approx
imations. CVPR.
Burton, D., & Toint, P. L. (1992). On an instance of the inverse shortest paths problem.
Mathematical Programming, 53, 45–61.
Ceroni, A., Frasconi, P., Passerini, A., & Vullo, A. (2003). Predicting the disulﬁde bond
ing state of cysteines with combinations of kernel machines. Journal of VLSI Signal
Processing, 35, 287–295.
Chakrabarti, S., Dom, B., & Indyk, P. (1998). Enhanced hypertext categorization using
hyperlinks. SIGMOD.
Chapelle, O., Weston, J., & Schoelkopf, B. (2002). Cluster kernels for semisupervised
learning. Proc. NIPS.
Charikar, M., Guruswami, V., & Wirth, A. (2003). Clustering with qualitative information.
FOCS.
Charniak, E. (1993). Statistical language learning. MIT Press.
Clark, S., & Curran, J. R. (2004). Parsing the wsj using ccg and loglinear models. Pro
ceedings of the 42nd Annual Meeting of the Association for Computational Linguistics
(ACL ’04).
Collins, M. (1999). Headdriven statistical models for natural language parsing. Doctoral
dissertation, University of Pennsylvania.
BIBLIOGRAPHY 205
Collins, M. (2000). Discriminative reranking for natural language parsing. ICML 17 (pp.
175–182).
Collins, M. (2001). Parameter estimation for statistical parsing models: Theory and prac
tice of distributionfree methods. IWPT.
Collins, M. (2004). Parameter estimation for statistical parsing models: Theory and prac
tice of distributionfree methods. In H. Bunt, J. Carroll and G. Satta (Eds.), New devel
opments in parsing technology. Kluwer.
Corduneanu, A., & Jaakkola, T. (2003). On information regularization. Proc. UAI.
Cormen, T., Leiserson, C., Rivest, R., & Stein, C. (2001). Introduction to algorithms. MIT
Press. 2nd edition.
Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. New York: Wiley.
Cowell, R., Dawid, A., Lauritzen, S., & Spiegelhalter, D. (1999). Probabilistic networks
and expert systems. New York: Springer.
Crammer, K., & Singer, Y. (2001). On the algorithmic implementation of multiclass kernel
based vector machines. Journal of Machine Learning Research, 2(5), 265–292.
Craven, M., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., & Slattery,
S. (1998). Learning to extract symbolic knowledge from the world wide web. Proc
AAAI98 (pp. 509–516).
Cristianini, N., & ShaweTaylor, J. (2000). An introduction to support vector machines and
other kernelbased learning methods. Cambridge University Press.
DeGroot, M. H. (1970). Optimal statistical decisions. New York: McGrawHill.
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997). Inducing features of random ﬁelds.
IEEE Trans. on Pattern Analysis and Machine Intelligence, 19(4), 380–393.
Demaine, E. D., & Immorlica, N. (2003). Correlation clustering with partial information.
APPROX.
206 BIBLIOGRAPHY
Dempster, P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete
data via the EM algorithm. Journal of the Royal Statistical Society, 39.
Devroye, L., Gy¨ orﬁ, L., & Lugosi, G. (1996). Probabilistic theory of pattern recognition.
New York: SpringerVerlag.
Duda, R. O., Hart, P. E., & Stork, D. G. (2000). Pattern classiﬁcation. New York: Wiley
Interscience. 2nd edition.
Durbin, R., Eddy, S., Krogh, A., & Mitchison, G. (1998). Biological sequence analysis.
Cambridge University Press.
Edmonds, J. (1965). Maximum matching and a polyhedron with 01 vertices. Journal of
Research at the National Bureau of Standards, 69B, 125–130.
Egghe, L., & Rousseau, R. (1990). Introduction to informetrics. Elsevier.
Emanuel, D., & Fiat, A. (2003). Correlation clustering  minimizing disagreements on
arbitrary weighted graphs. ESA.
Fariselli, P., & Casadio, R. (2001). Prediction of disulﬁde connectivity in proteins. Bioin
formatics, 17, 957–964.
Fariselli, P., Martelli, P., & Casadio, R. (2002). A neural networkbased method for pre
dicting the disulﬁde connectivity in proteins. Knowledge based intelligent information
engineering systems and allied technologies (KES 2002), 1, 464–468.
Fariselli, P., Ricobelli, P., & Casadio, R. (1999). Role of evolutionary information in pre
dicting the disulﬁdebonding state of cysteine in proteins. Proteins, 36, 340–346.
Fiser, A., & Simon, I. (2000). Predicting the oxidation state of cysteines by multiple se
quence alignment. Bionformatics, 3, 251–256.
Forsyth, D. A., & Ponce, J. (2002). Computer vision: A modern approach. Prentice Hall.
Frasconi, P., Gori, M., & Sperduti, A. (1998). A general framework for adaptive structures.
IEEE Transactions on Neural Networks.
BIBLIOGRAPHY 207
Frasconi, P., Passerini, A., & Vullo, A. (2002). A two stage svm architecture for predicting
the disulﬁde bonding state of cysteines. Proceedings of IEEE Neural Network for signal
processing conference.
Freund, Y., & Schapire, R. (1998). Large margin classiﬁcation using the perceptron algo
rithm. Computational Learing Theory.
Friedman, N., Getoor, L., Koller, D., & Pfeffer, A. (1999). Learning probabilistic relational
models. Proc. IJCAI99 (pp. 1300–1309). Stockholm, Sweden.
Friess, T., Cristianini, N., & Campbell, C. (1998). The kernel adatron algorithm: a fast and
simple learning procedure for support vector machine. Proc. ICML.
Gabow, H. (1973). Implementation of algorithms for maximum matching on nonbipartite
graphs. Doctoral dissertation, Stanford University.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. Freeman.
Geman, S., & Johnson, M. (2002). Dynamic programming for parsing and estimation of
stochastic uniﬁcationbased grammars. Proceedings of the 40th Annual Meeting of the
Association for Computational Linguistics.
Getoor, L., Friedman, N., Koller, D., & Taskar, B. (2002). Learning probabilistic models
of link structure. Journal of Machine Learning Research, 8.
Getoor, L., Segal, E., Taskar, B., & Koller, D. (2001). Probabilistic models of text and link
structure for hypertext classiﬁcation. Proc. IJCAI01 Workshop on Text Learning: Beyond
Supervision. Seattle, Wash.
Greig, D. M., Porteous, B. T., & Seheult, A. H. (1989). Exact maximum a posteriori
estimation for binar images. J. R. Statist. Soc. B, 51.
Guestrin, C., Koller, D., Parr, R., & Venkataraman, S. (2003). Efﬁcient solution algorithms
for factored mdps. Journal of Artiﬁcial Intelligence Research, 19.
Gusﬁeld, D. (1997). Algorithms on strings, trees, and sequences : Computer science and
computational biology. Cambridge University Press.
208 BIBLIOGRAPHY
Harrison, P., & Sternberg, M. (1994). Analysis and classiﬁcation of disulphide connectivity
in proteins. the entropic effect of crosslinkage. Journal of Molecular Biology, 244.
Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning. New
York: SpringerVerlag.
Haussler, D. (1999). Convolution kernels on discrete structures (Technical Report). UC
Santa Cruz.
Heuberger, C. (2004). Inverse combinatorial optimization: Asurvey on problems, methods,
and results. Journal of Combinatorial Optimization, 8.
Hochbaum, D. S. (Ed.). (1997). Approximation algorithms for NPhard problems. PWS
Publishing Company.
Joachims, T. (1999). Transductive inference for text classiﬁcation using support vector
machines. Proc. ICML99 (pp. 200–209). Morgan Kaufmann Publishers, San Francisco,
US.
Johnson, M. (2001). Joint and conditional estimation of tagging and parsing models. ACL
39.
Johnson, M., Geman, S., Canon, S., Chi, Z., & Riezler, S. (1999). Estimators for stochastic
“uniﬁcationbased” grammars. Proceedings of ACL 1999.
Kabsch, W., & Sander, C. (1983). Dictionary of protein secondary structure: Pattern recog
nition of hydrogenbonded and geometrical features.
Kaplan, R., Riezler, S., King, T., Maxwell, J., Vasserman, A., & Crouch, R. (2004). Speed
and accuracy in shallow and deep stochastic parsing. Proceedings of HLTNAACL’04.
Kassel, R. (1995). A comparison of approaches to online handwritten character recogni
tion. Doctoral dissertation, MIT Spoken Language Systems Group.
Kivinen, J., & Warmuth, M. (1997). Exponentiated gradient versus gradient descent for
linear predictors. Information and Computation, 132(1), 1–63.
BIBLIOGRAPHY 209
Klein, D., & Manning, C. D. (2003). Accurate unlexicalized parsing. ACL 41 (pp. 423–
430).
Kleinberg, J., & Tardos, E. (1999). Approximation algorithms for classiﬁcation problems
with pairwise relationships: Metric labeling and Markov random ﬁelds. FOCS.
Kleinberg, J. M. (1999). Authoritative sources in a hyperlinked environment. Journal of
the ACM, 46(5), 604–632.
Klepeis, J., & Floudas, C. (2003). Prediction of βsheet topology and disulﬁde bridges in
polypeptides. Journal of Computational Chemistry, 24, 191–208.
Koller, D., & Pfeffer, A. (1998). Probabilistic framebased systems. Proc. AAAI98 (pp.
580–587). Madison, Wisc.
Kolmogorov, V., & Zabih, R. (2002). What energy functions can be minimized using graph
cuts? PAMI.
Kumar, S., & Hebert, M. (2003). Discriminative ﬁelds for modeling spatial dependencies
in natural images. NIPS.
Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random ﬁelds: Probabilistic
models for segmenting and labeling sequence data. ICML.
Lafferty, J., Zhu, X., & Liu, Y. (2004). Kernel conditional random ﬁelds: Representation
and clique selection. ICML.
Lawler, E. (1976). Combinatorial optimization: Networks and matroids. New York: Holt,
Rinehart and Winston.
Leslie, C., Eskin, E., & Noble, W. (2002). The spectrum kernel: a string kernel for svm
protein classiﬁcation. Proc. Paciﬁc Symposium on Biocomputing.
Liu, Z., & Zhang, J. (2003). On inverse problems of optimum perfect matching. Journal
of Combinatorial Optimization, 7.
210 BIBLIOGRAPHY
Lodhi, H., ShaweTaylor, J., Cristianini, N., & Watkins, C. (2000). Text classiﬁcation using
string kernels. NIPS.
Luenberger, D. (1997). Investment science. Oxford University Press.
Manning, C., &Sch¨ utze, H. (1999). Foundations of statistical natural language processing.
Cambridge, Massachusetts: The MIT Press.
Marcus, M. P., Santorini, B., & Marcinkiewicz, M. A. (1993). Building a large annotated
corpus of English: The Penn Treebank. Computational Linguistics, 19(2), 313–330.
Markowitz, H. (1991). Portfolio selection: Efﬁcient diversiﬁcation of investments. Basil
Blackwell.
Martelli, P., Fariselli, P., Malaguti, L., & Casadio, R. (2002). Prediction of the disulﬁde
bonding state of cysteines in proteins at 88% accuracy. Protein Science, 11, 27359.
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2001). A database of human segmented
natural images and its application to evaluating segmentation algorithms and measuring
ecological statistics. Proc. ICCV.
Matsumura, M., Signor, G., &Matthews, B. (1989). Substantial increase of protein stability
by multiple disulﬁde bonds. Nature, 342, 291:293.
Matusov, E., Zens, R., & Ney, H. (2004). Symmetric word alignments for statistical ma
chine translation. Proc. COLING.
McCallum, A. (2003). Efﬁciently inducing features of conditional random ﬁelds. Proc.
UAI.
McCallum, A., & Wellner, B. (2003). Toward conditional models of identity uncertainty
with application to proper noun coreference. IJCAI Workshop on Information Integration
on the Web.
Mitchell, T. (1997). Machine learning. McGrawHill.
BIBLIOGRAPHY 211
Miyao, Y., & Tsujii, J. (2002). Maximum entropy estimation for feature forests. Proceed
ings of Human Language Technology Conference (HLT 2002).
Murphy, K. P., Weiss, Y., & Jordan, M. I. (1999). Loopy belief propagation for approximate
inference: an empirical study. Proc. UAI99 (pp. 467–475).
Needleman, S., & Wunsch, C. (1970). A general method applicable to the search for
similarities in the amino acid sequences of two proteins. Journal of Molecular Biology,
48.
Nemhauser, G. L., & Wolsey, L. A. (1999). Integer and combinatorial optimization. New
York: J. Wiley.
Neville, J., & Jensen, D. (2000). Iterative classiﬁcation in relational data. Proc. AAAI2000
Workshop on Learning Statistical Models from Relational Data (pp. 13–20).
Ng, A., & Jordan, M. (2001). On discriminative vs. generative classiﬁers: A comparison
of logistic regression and naive Bayes. NIPS.
Ng, A. Y., & Russell, S. (2000). Algorithms for inverse reinforcement learning. Proc.
ICML.
Nigam, K., McCallum, A., Thrun, S., & Mitchell, T. (2000). Text classiﬁcation from
labeled and unlabeled documents using em. Machine Learning, 39.
Nocedal, J., & Wright, S. J. (1999). Numerical optimization. New York: Springer.
Papadimitriou, C., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and
complexity. Englewood Cliffs, NJ: PrenticeHall.
Pearl, J. (1988). Probabilistic reasoning in intelligent systems. San Francisco: Morgan
Kaufmann.
Pinto, D., McCallum, A., Wei, X., &Croft, W. B. (2003). Table extraction using conditional
random ﬁelds. Proc. ACM SIGIR.
212 BIBLIOGRAPHY
Platt, J. (1999). Using sparseness and analytic QP to speed training of support vector
machines. NIPS.
Potts, R. B. (1952). Some generalized orderdisorder transformations. Proc. Cambridge
Phil. Soc., 48.
Quinlan, J. R. (2001). Induction of decision trees. Machine Learning, 1, 81–106.
Schrijver, A. (2003). Combinatorial optimization: Polyhedra and efﬁciency. Springer.
Sha, F., & Pereira, F. (2003). Shallow parsing with conditional random ﬁelds. Proc. HLT
NAACL.
ShaweTaylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998). Structural
risk minimization over datadependent hierarchies. IEEE Trans. on Information Theory,
44(5), 1926–1940.
Shen, L., Sarkar, A., & Joshi, A. K. (2003). Using ltag based features in parse reranking.
Proc. EMNLP.
Slattery, S., & Mitchell, T. (2000). Discovering test set regularities in relational domains.
Proc. ICML00 (pp. 895–902).
Smith, T., & Waterman, M. (1981). Identiﬁcation of common molecular subsequences. J.
Mol. Biol., 147, 195–197.
Sutton, C., Rohanimanesh, K., & McCallum, A. (2004). Dynamic conditional random
ﬁelds: Factorized probabilistic models for labeling and segmenting sequence data. Proc.
ICML.
Szummer, M., & Jaakkola, T. (2001). Partially labeled classiﬁcation with Markov random
walks. Proc. NIPS.
Tarantola, A. (1987). Inverse problem theory: Methods for data ﬁtting and model parame
ter estimation. Amsterdam: Elsevier.
BIBLIOGRAPHY 213
Taskar, B., Abbeel, P., & Koller, D. (2002). Discriminative probabilistic models for rela
tional data. UAI.
Taskar, B., Chatalbashev, V., & Koller, D. (2004a). Learning associative Markov networks.
Proc. ICML.
Taskar, B., Guestrin, C., & Koller, D. (2003a). Max margin Markov networks. NIPS.
Taskar, B., Klein, D., Collins, M., Koller, D., & Manning, C. (2004b). Max margin parsing.
EMNLP.
Taskar, B., Segal, E., & Koller, D. (2001). Probabilistic classiﬁcation and clustering in
relational data. Proc. IJCAI01 (pp. 870–876). Seattle, Wash.
Taskar, B., Wong, M., Abbeel, P., & Koller, D. (2003b). Link prediction in relational data.
Proc. NIPS.
Toutanova, K., Klein, D., Manning, C. D., & Singer, Y. (2003). Featurerich partofspeech
tagging with a cyclic dependency network. NAACL 3 (pp. 252–259).
Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004). Support vector machine
learning for interdependent and structured output spaces. Twentyﬁrst international con
ference on Machine learning.
Valiant, L. G. (1979). The complexity of computing the permanent. Theoretical Computer
Science, 8, 189–201.
Vapnik, V. (1995). The nature of statistical learning theory. New York, New York:
SpringerVerlag.
Varma, A., & Palsson, B. (1994). Metabolic ﬂux balancing: Basic concepts, scientiﬁc and
practical use. Bio/Technology, 12.
Vazquez, A., Flammini, A., Maritan, A., & Vespignani, A. (2003). Global protein function
prediction from proteinprotein interaction networksh. Nature Biotechnology, 6.
214 BIBLIOGRAPHY
Veksler, O. (1999). Efﬁcient graphbased energy minimization methods in computer vision.
Doctoral dissertation, Cornell University.
Vullo, A., & Frasconi, P. (2004). Disulﬁde connectivity prediction using recursive neural
networks and evolutionary information. Bioinformatics, 20, 653–659.
Wahba, G., Gu, C., Wang, Y., & Chappell, R. (1993). Soft classiﬁcation, a.k.a. risk estima
tion, via penalized log likelihood and smoothing spline analysis of variance. Computa
tional Learning Theory and Natural Learning Systems.
Wainwright, M., Jaakkola, T., & Willsky, A. (2002). Map estimation via agreement on
(hyper)trees: Messagepassing and linear programming approaches. Proc. Allerton Con
ference on Communication, Control and Computing.
Wainwright, M., & Jordan, M. I. (2003). Variational inference in graphical models: The
view from the marginal polytope. Proc. Allerton Conference on Communication, Control
and Computing.
Weston, J., & Watkins, C. (1998). Multiclass support vector machines (Technical Re
port CSDTR9804). Department of Computer Science, Royal Holloway, University of
London.
Xing, E., Ng, A., Jordan, M., & Russell, S. (2002). Distance metric learning, with applica
tion to clustering with sideinformation. NIPS.
Yang, Y., Slattery, S., & Ghani, R. (2002). A study of approaches to hypertext categoriza
tion. Journal of Intelligent Information Systems, 18(2).
Yedidia, J., Freeman, W., & Weiss, Y. (2000). Generalized belief propagation. NIPS.
Younger, D. H. (1967). Recognition and parsing of contextfree languages in time n
3
.
Information and Control, 10, 189–208.
Zhang, J., & Ma, Z. (1996). A network ﬂow method for solving inverse combinatorial
optimization problems. Optimization, 37, 59–72.
BIBLIOGRAPHY 215
Zhang, T. (2002). Covering number bounds of certain regularized linear function classes.
Journal of Machine Learning Research, 2, 527–550.
Zhu, J., & Hastie, T. (2001). Kernel logistic regression and the import vector machine.
Proc. NIPS.
Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semisupervised learning using gaussian
ﬁelds and harmonic functions. Proc. ICML.
c Copyright by Ben Taskar 2005 All Rights Reserved
ii
I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy.
Daphne Koller
Computer Science Department Stanford University
(Principal Advisor)
I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy.
Andrew Y. Ng
Computer Science Department Stanford University
I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy.
Fernando Pereira
Computer Science Department University of Pennsylvania
Approved for the University Committee on Graduate Studies:
iii
iv
Mark and Tsilya. Anat. . and my love.To my parents.
.
In natural language processing. spatial constraints and correlations. reconstruct 3D shapes from stereo and video. has placed the heaviest emphasis on complex questions with simple answers. likelihoodbased estimation methods by concentrating directly on the robustness of the decision boundary of a model. Our framework deﬁnes a suite of efﬁcient learning algorithms that rely on the expressive power of convex optimization to compactly capture inference or vii . combinatorial optimization problems such as weighted matchings and graphcuts. In computational biology. such as its corresponding partofspeech sequence. grammatical. temporal. and track motion of articulated bodies.Abstract Most questions require more than just truefalse or multiplechoice answers. and recognize functional portions of a genome. ﬁnd global alignment of related DNA strings. In computer vision. we often need to construct a global. chemical. recursive language models such as context free grammars. Such complex answers may consist of multiple interrelated decisions that must be weighed against each other to arrive at a globally satisfactory and consistent solution to the question. parse tree. we segment complex objects in cluttered scenes. we analyze genetic sequences to predict 3D structure of proteins. the largemargin criterion provides an alternative to probabilistic. Yet supervised learning. The acquired expertise must now be used to address tasks that demand answers as complex as the questions. like standardized testing. coherent analysis of a sentence. Intuitively. This thesis presents a discriminative estimation framework for structured models based on the large margin principle underlying support vector machines. Such structured models include graphical models such as Markov networks (Markov random ﬁelds). We typically handle the exponential explosion of possible answers by building models that compactly capture the structural properties of the problem: sequential. or translation into another language.
we solve very large estimation problems. attributes. We use graph decomposition to derive an exact. our framework applies to a wide range of other models: We exploit context free grammar structure to derive a compact maxmargin formulation that allows highaccuracy parsing in cubic time by using novel kinds of lexical information. We describe experimental applications to a diverse range of tasks. 3D terrain classiﬁcation. we derive a maxmargin formulation for learning the scoring metric for clustering from clustered training data. which are undirected probabilistic graphical models widely used to efﬁciently represent and reason about joint multivariate distributions. disulﬁde connectivity prediction in proteins. While likelihoodbased methods are believed to be intractable for AMNs over binary variables. alternative estimation methods are intractable. accurate prediction in realworld tasks. natural language parsing. efﬁcient formulation for learning to match and apply it to prediction of disulﬁde connectivity in proteins. tuning one to the other in a joint optimization. convex formulation for largemargin estimation of Markov networks with sequence and other lowtreewidth structure. We also introduce relational Markov networks (RMNs). relations. compact. Finally. associative Markov networks (AMNs). including handwriting recognition. viii . which compactly deﬁne templates for Markov networks for domains with relational structure: objects. hypertext categorization. which captures positive correlations between variables and permits exact inference which scales up to tens of millions of nodes and edges. We deﬁne an important subclass of Markov networks. These empirical evaluations show signiﬁcant improvements over stateoftheart methods and promise wide practical use for our framework.solution optimality in structured models. which tightly integrates metric learning with the clustering algorithm. email organization and image segmentation. For some of these models. The largest portion of the thesis is devoted to Markov networks. Seamless integration of kernels with graphical models allows efﬁcient. We use combinatorial properties of weighted matchings to develop an exact. Using an efﬁcient onlinestyle algorithm that exploits inference in the model and analytic updates. In addition to graphical models. We analyze the theoretical generalization properties of maxmargin estimation in Markov networks and derive a novel type of bound on structured error. our framework allows exact estimation of such networks of arbitrary connectivity and topology.
Christian Shelton. Daphne Koller. Daphne’s research group is an institution in itself. Alexis Battle. as well as my defense committee members. Fernando’s work on Markov networks has inspired my focus on this subject. Andrew’s research on clustering and classiﬁcation has informed many of the practical problems addressed in the thesis. Ron Parr. Luke Biewald. Andrew Ng and Fernando Pereira. I ix . JeanClaude Latombe was my ﬁrst research advisor when I was still an undergraduate at Stanford. Xavier Boyen. David Vickrey. Her tireless pursuit of excellence in research. His thoughtful guidance and quick wit were a great welcome and inspiration to continue my studies. In particular. advising. Stephen Boyd and Sebastian Thrun. Dirk Ormoneit. Lise Getoor. Finally. the ideas. Carlos Guestrin. When I started my research in machine learning with Daphne.Acknowledgements I am profoundly grateful to my advisor. writing and presenting results in an engaging manner. Drago Anguelov. Sebastian introduced me to the fascinating problems in 3D vision and robotics. and every other aspect of her academic work is truly inspirational. Eran Segal. Uri Lerner. Haidong Wang and Ming Fai Wong. I would like to thank my thesis committee. Vassil Chatalbashev. the questions and the expertise of Pieter Abbeel. Stephen’s book on convex optimization is the primary source of many of the insights and derivations in this thesis. Simon Tong. making progress on difﬁcult ones. teaching. I am indebted to Daphne for priceless and copious advice about selecting interesting problems. I am very lucky to have been a part of it and shared the company. I have learned a great deal from their work and their inﬂuence on this thesis is immense. pushing ideas to their full development. Gal Chechik. Uri Nodelman. for their excellent suggestions and thoughtprovoking questions.
David’s wideranging research on probability and logic. Dan has an incredible gift of making ideas work. good cheer and the great knack for always coming through. I could not wish for more caring advice and encouragement than she has given me all these years. Chris’ healthy scepticism and emphasis on the practical has kept me from going down many deadend paths. and better yet. Collins’ work on learning largemargin tagging and parsing models motivated me to look at such methods for other structured models. Luke Biewald. Carlos Guestrin. who is always willing to share with me everything from research problems to music and backpacking treks to Russian books and Belgian beer. my personal climbing instructor. explaining why other ideas do not work. Drago Anguelov. over cheap Thai food. Vasco Chatalbashev. tennis court. avid grillmaster x . with his endearing combination of humor and warmth. my sounding board for many ideas in convex optimization and learning. Eran Segal. Lise Getoor. They have taught me to remain steadfast when elegant theories meet the ragged edge of real problems. Michael Collins. for his company and ideas. Peter Bartlett. hard work and dedication: Pieter Abbeel. Geremy Heitz. I was lucky to meet Michael Collins. has been a constant source of encouragement and inspiration. Chris Manning. Audrey Gasch. Lise has been a great friend and my other big sister throughout my graduate life. Lise Getoor and Eran Segal. everready to checkmate. (Almost) everything I know about natural language processing I learned from Chris Manning and Dan Klein. anywhere: gym. Merci beaucoup to Pieter Abbeel. Dan Klein. fellow photography fanatic. David Vickrey and Ming Fai Wong. I am very glad I had the chance to work with him on the maxmargin parsing project. Michael Littman. Muchas gracias to Carlos Guestrin. enlightened much of my work.had the privilege and pleasure to work with Nir Friedman. always late. Ogromnoye spasibo to my ofﬁcemate. Nir Friedman. for numerous enlightening discussions that we have had anytime. sportsmate. to mention a few. David McAllester. lightness and depth. Michael Littman and David McAllester all in one place. I would like to express my appreciation and gratitude to all my collaborators for their excellent ideas. Blagodarya vi mnogo for another great Bulgarian I have the good luck to know. Drago Anguelov. while I was a summer intern at AT&T. languages and generalization bounds. Daphne Koller. biking to EV. Vassil Chatalbashev.
Talia.and exploiterofstructure extraordinaire. Anna. for opening his ear and heart to me when it matters most. hardship and love. for his sense of humor. but worked hard to keep my relative sanity throughout. To my tireless partner in work and play. I am grateful for bringing me so much joy and love. thank you for making me happy next to you. Mhgoisaai to Ming Fai Wong. and my sweet niece. My parents. Mark and Tsilya. have given me unbending support and constant encouragement. I will not list all of you here. Ilya. my brotherinlaw. but my gratitude to you is immense. To my sister. kind heart and excellent work. xi . tears and laughter. Anat Caspi. I thank them for all the sacriﬁces they have made to ensure that their children would have freedom and opportunities they never had in Soviet Union. Many thanks to my friends who have had nothing to do with work in this thesis.
xii .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Complex prediction problems . . . . . . . .2 2. . . . . . . Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Structured models . . . . . . . . . . . . . . . . . . . 22 24 3 Structured models 3. . . . . . . . . . . .5 1. . .2 1. 21 SVM dual and kernels . . . . . . . . . . . . . . . . . . . . 19 Logistic regression . . . . . . . . . . . . . . . . . . . vii ix 1 2 4 6 8 Thesis outline . .5 15 16 Classiﬁcation with generalized linear models . . . . . . . . .3 2. . . . . . . 11 Previously published work . . . . . 20 Logistic dual and maximum entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3 1. . . . . .6 Supervised learning . . . . . .1 Probabilistic models: generative and conditional . . . . . . . . . 21 Support vector machines . . .Contents Abstract Acknowledgements 1 Introduction 1. . . . . . . .1 2. . . . . . . . . . . 13 I Models and methods 2 Supervised learning 2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 2. . . . . . 25 xiii . . . . .4 1. . .1 1. . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 4. . . . . . . . . . . . . . . . .3. . . . . . . . . . . . . . . . . . . . . . .2. . . . . . . . . . . . . . . . . . . . 70 Related work . . . . . . . .1. . . 50 Constraint strengthening . . . . . . . . .2 3. . . . . . . . . . . . . . . . . . . . .3 4. . . . .1. . . . . . .2. . . . . . . .3. . . .1 Solving the M3 N QP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 II Markov networks 57 58 5 Markov networks 5. . . . . . . . . . . . . .3 Prediction models: normalized and unnormalized . .1 6. . . . . . . . . . . . . . 61 M3 N dual and kernels . . . . . . . 59 Maximum margin estimation . . . . . . . . . . . . . . . . 37 Combinatorial problems . . . . . . . . 28 Inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 Markov networks . . . . . . . . . 78 xiv . . . . . .2 4. . . . . . . . 52 Approximations: upper and lower bounds . . .3 5. . .2 4. . . . . . . . . . 40 42 4 Structured maximum margin estimation 4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .5 Context free grammars . . . . . . . . . .2 3. . . . . . . . . . 48 Constraint generation . . . . . . . . . . . . . . . . . . . . . . . . . . . .7 Maximum likelihood estimation . 74 75 6 M3 N algorithms and experiments 6. . . . . . . . . . . . . . . . . . . .3 Representation . . . . . . . . . . . . . 43 Minmax formulation . . . . . . . . . . . .4 Maxmargin estimation .6 5.3. . . 69 Generalization bound . . . 31 Linear programming MAP inference . . . .1 4. . . . . . . . . . . . . . . . . . .2 5. . . . . . . .1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 Related work . . . . . . . . . . . . . . . .1 5. . 65 Untriangulated models . . . . . . . . . . . . . . . . . .1 4. . . . . . . . . . . . . . . . . 27 3.4 3. . . . . . . . . . . . . . .4 5. .1 3. . . . . .3. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 Conclusion . . .5 5. . 34 3. . . . . . 43 Certiﬁcate formulation . . . . . . . . . . . . . . . .2 4. . . . . . . . . . . . . 53 Conclusion . . . . . 75 SMO .
. . . . . . . . . . . . . . . .3 Flat models . . . . . . . . . . . . . . . . . . . . . . . . . .1 8. . . . 119 Link model . . .3 Associative networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 Multiclass case . . . . . . . . . . . . . . . . . . . . . . . . . . . .7 Maxmargin estimation . . . . . . . . . .3 8. . . . . . . . . . . . . . . . . . . . . . . . 91 Mincut inference . . . . . . . . . . . . . . . . . . .3 6. . . . . . . . . . . 95 7. . . . . . . . 87 89 7 Associative Markov networks 7. . . . . . . . . .2 7. . . . . . . . . . 116 Experiments . .2 6. . .1 7. . . 81 Experiments .2 8. . . . . . . . . . . . . .1 8. . . . . . . .4 7. . . 110 Relational Markov networks . . . . . . . . . . 124 III Broader applications: parsing.1 127 128 Context free grammar model . . . . . . . . .2 8. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 Relational classiﬁcation . . . . . . . . . . . . . . . . . . . 87 Conclusion . . . . . . . . . . 120 Cocite model . . . . . . . . . . . . .1 7.3. . . . . . . . . . . . . . . . . . . . 118 8. . . . . . . . . . . . . . . . . . . . . . 123 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . 121 8.1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 Structured SMO . . . .5 7. . . . . . . . 90 LP Inference . . . . . .1. . . . 85 Related work . . . . . . . . . . . . 113 Approximate inference and learning . . 93 7.4 Selecting SMO pairs . . . . . . . . .4. . . . . . . .4. . . .3 6. . . . . . . . . . . . . . . . . . .3. . . . . . . . . . . . . . . .6 Related work . . . . . . . . . . . . . . . . . . . . .5 8. . . 104 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2 6. . . .6. . . . . . . . . 97 Experiments . . clustering 9 Context free grammars 9. . . . . . . matching. . . . . .6 7. . . . . . . . . . . . . .2 Graph construction . .4. . . . . . . . 99 Related work . . . . 104 109 8 Relational Markov networks 8. . . . . . . . . . . . . . . . . 128 xv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 11. . . . . .1 Disulﬁde connectivity prediction .4 9. . . . . . . . . . . . . . . . . . .2 9. . . . . . . . . 138 Related work . . . . . . . . . . . . . 142 Conclusion . . . . . . . . . . . . . . . . . . .4. . . . . . . . . . . . . . . . . . . . . . . . . . . .4. . . . . . 168 11. . . . . . . .1 Clustering formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157 10. . .5 Related work . . . . . . .4 Experiments . . . . . . 173 xvi . . . . . . . . . . . . 132 Discriminative parsing models . . . . . . . . . . . . . . 170 11. . . . . . . . . . .3. . . . . . . . . 138 Experiments . . . . . . . . . . . . . . . . .2 Learning formulation . . . . . . . . . . .2 Maximum likelihood estimation . . . . . . . . . . . . . . . . . . . . . .3 Dual formulation and kernels . . . . . . . . 134 Maximum margin estimation . . . . . . . . . . . . . . . . . . . . . . 167 11. . . . . . . . . . . . . . . . . 154 10.7 Structured SMO for CFGs . . .6 9. . . .2 Email clustering . . . . . . . . . . . . . . .2 Learning to match . . . . . . . . . . . . . . . . . .1 Irrelevant features . . . . . . .6 Experiments . . . . . . . . . . . . . . . . . . . . . . . . 159 11 Correlation clustering 160 11. . . . . . . . . . . .6 Conclusion . . . . . . . 164 11. . . . . . . . . . . . . . . 168 11. . . 161 11.9.4. . . . . . . . . . . . . . . . . . . . . . . . . . . .1.7 Related work . . . . . . . . . . . . . . . 148 10. . .1 9. . . . . . . . . . . . . . . 153 10. . . .3 Image segmentation . . . .3 Context free parsing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145 10. . . . . . 143 144 10 Matchings 10. . . . . . . . . . . . . .2 Semideﬁnite programming relaxation . . . . . . . . . . . . . . . .4 Certiﬁcate formulation . . . . . . . . . . . . . . . . . . . .8 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . .5 9. . . . . 133 9. . . . . . . . . . . . . . . 168 11. . . . .1. . . . . . . . . . . . . .3. . . . . 172 11. . . . . . . . . . . . . . . . . 162 11. . . . . . . . . . . . . . 135 9.3 Minmax formulation . . . . . . . . . . . . . . . . . . . . . . . . . 150 10. . . . .1 Linear programming relaxation . . . . . . . . . . . . . 146 10.5 Kernels . .
. . . . . . . . . . . . . . .1 Summary of contributions . 182 12. .1 Binary classiﬁcation . . . . . . . . . . . . .IV Conclusions and future directions 12 Conclusions and future directions 175 176 12. . . . . . . . . .2 AMN proofs and derivations . . . . . . . . .2 Novel prediction tasks . . . . . . . . . . . . . . . . . .2. . . . . . . . .1 Structured maximum margin estimation . . . . . . . . . . . . . . . . .2. . . . . . . . . . . . 195 A. relational . . . . 190 A. . . . .1 Proof of Theorem 5. . . . . . . . . . . . .3 Future . . . . . . . . 183 12.1 .3 Derivation of the factored primal and dual maxmargin QP . .1 Theoretical analysis and optimization algorithms . . . .1 Binary AMNs . . 180 12. . . 177 12. . . . . . . .2 Structured classiﬁcation . . . . . . . . . . . . . . matching. associative. . 197 A. . . . . . . . . . . . 199 Bibliography 202 xvii . 187 A Proofs and derivations 188 A. . . .2 Extensions and open problems . . 176 12. .3 Broader applications: parsing. . . . . . .2. . . . . . . . . .1. . . . . . . 183 12. . . .2. .1. . . . . . . .1. . . . .2. . . . . . . . . . . . . . . . . . . . . . . .2. . . .2 Multiclass AMNs . . . . . . . . . . 185 12.2 Markov networks: maxmargin. 184 12. . . . . . . . . . . 188 A. . .5. . . . 195 A. . . . . . . . . . . . . . . . . . . . . . .1. . .3 More general learning settings . 189 A. . . . . . . . . . . . . . . . . . . . . . . . . . . . .1. . clustering . . . . . . . . . . . .
140 10. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 Parsing results on test set . . . . . 156 xviii . . . . . . . . . . . . . . . . . . . . . . .1 Bond connectivity prediction results . . .List of Tables 9. . . .1 9. .2 Parsing results on development set . . . . . .
. . . .1 4. . . . . . . . . . . . . . . . . 85 OCR results . . . . . . . . . . .1 3. . . . . . . . . . . . . . 51 A constraint generation algorithm.2 3. . .4 6. . . . . . . . . . . . . . . Examples of complex prediction problems . . . .1 2. 20 Handwritten word recognition . . . . . . . . . . . . . . . . . . . . . . . . 79 SMO pair selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 Exact and approximate constraints for maxmargin estimation . . . . . . . . . . . . . . . . . .1 1. 77 SMO subproblem . . . . . . . .2 3. . . . . 52 Chain M3 N example . . . . . . . 69 Blockcoordinate ascent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 Diamond Markov network . . . . . . . . . . . . . . . . .2 2. . . . . . . . . .6 4. . . . . . . . . . . . . . . . . . . . . . . 80 Structured SMO diagram . . .2 6. . . . . .3 3. . . . . . . .5 6. . . . . . . . .2 6. . . . . . . . .2 5. 35 Example parse tree . . . .5 3. . . . . . .4 3. . . . . . . . . . . . . . . . . . . . 25 Chain Markov network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 Classiﬁcation loss and upper bounds . 34 Marginal agreement . . . . . . . . . . . . . . . . . . . . . . . . . . . .3 6. . . . . . . . . . . . . . . . . . . . . .1 5. . 82 Structured SMO pair selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .List of Figures 1. . . . . . . . . . . . . . . 32 Diamond network junction tree . 64 Diamond Markov network . . . . . . . . . . . . . . . . . 86 xix . .6 Supervised learning setting . . .1 6. 3 4 Handwritten character recognition . . . . . .
. . . . . . . . . . . . . . . 171 11. . .1 PDB protein 1ANS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170 11. . .7. . . . . . . . 157 11. 102 Mincut inference running times . . . . . . . . . . . . . . . . . . .1 Learning to cluster with irrelevant features . .2 Learning to organize email . . . .2 Number of constraints vs. . . . 96 Segbot: roving robot equipped with SICK2 laser sensors. . .1 7. . . . . . . . . . . . . . . . . 121 WebKB results: cocite model . . . . . . . 172 xx . . . . 147 10. . . . . .6 7. . .5 7. . . .1 Mincut graph construction . . . . . number of bonds . . . . . . . 94 αexpansion algorithm . . . . . 103 Comparison of terrain classiﬁcation models (zoomedout) . . . . . . . . . . . . .3 Learning curve for bond connectivity prediction . . . . . . . . . . .2 7. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 WebKB results: link model . . .1 8. . .2 8.7 7. . . . . . . . . . . . . . . . . . 113 WebKB results: ﬂat models . . . . . . . . . . . . . . .3 8. . . . . . . .4 Two segmentations by different models . . . . 130 10. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .9 8. . . . . .3 Two segmentations by different users . . . . 100 3D laser scan range map of the Stanford Quad. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4 9. . . . . . . . . 106 Labeled portion of the test terrain dataset (Ground truth and SVM predictions)107 Labeled portion of the test terrain dataset (VotedSVM and AMN predictions)108 Link model for document classiﬁcation .4 7. . . .8 7. . 169 11. . . . . . 122 Two representations of a binary parse tree . . . .3 7. . . . . . . . . . 101 Comparison of terrain classiﬁcation models (detail) . . . . . . . . . . 150 10. . . . . . . . . . . .
as opposed to. say. likely letter combinations that make up words. The reconstruction of an entire sentence from the photons hitting the retina off of each tiny patch of an image undoubtedly requires an elaborate interplay of recognition and representation of the penstrokes. the list of things we would like a computer to learn to do is much. DNA sequence analysis. the individual letters. game playing. are performed almost effortlessly by a person.Chapter 1 Introduction The breadth of tasks addressed by machine learning is rapidly expanding. One of its primary goals 1 . fraud detection. Major applications include medical diagnosis. The complex synthesis of many levels of signal processing a person executes when confronted by a line of handwritten text is daunting. Computer scientists. for example. are primarily concerned with achieving acceptable speed and accuracy of recognition rather than modeling this complicated process with any biological verity. frequent grammatical constructions of the phrases. much longer. Some tasks. image analysis. whole words and constituent phrases. Machine learning offers an alternative to encoding all the intricate details of such a model from scratch. we encounter the need for very sophisticated decision making from our programs. neuroscientists. robot locomotion and many more. Computational models for handwriting recognition aim to capture the salient properties of the problem: typical shapes of the letters. ﬁnancial analysis. Of course. As we work our way down that list. etc. common ways to combine words into phrases. speech and handwriting recognition. handwriting recognition. scientiﬁc discovery. but remain difﬁcult and errorprone for computers.
2
CHAPTER 1. INTRODUCTION
is to devise efﬁcient algorithms for training computers to automatically acquire effective and accurate models from experience. In this thesis, we present a discriminative learning framework and a novel family of efﬁcient models and algorithms for complex recognition tasks in several disciplines, including natural language processing, computer vision and computational biology. We develop theoretical foundations for our approach and show a wide range of experimental applications, including handwriting recognition, 3dimensional terrain classiﬁcation, disulﬁde connectivity in protein structure prediction, hypertext categorization, natural language parsing, email organization and image segmentation.
1.1 Supervised learning
The most basic supervised learning task is classiﬁcation. Suppose we wish to learn to recognize a handwritten character from a scanned image. This is a classiﬁcation task, because we must assigns a class (an English letter from ‘a’ through ‘z’) to an observation of an object (an image). Essentially, a classiﬁer is a function that maps an input (an image) to an output (a letter). In the supervised learning setting, we construct a classiﬁer by observing labeled training examples, in our case, sample images paired with appropriate letters. The main problem addressed by supervised learning is generalization. The learning program is allowed to observe only a small sample of labeled images to produce an accurate classiﬁer on unseen images of letters. More formally, let x denote an input. For example, a blackandwhite image x can be represented as a vector of pixel intensities. We use X to denote the space of all possible inputs. Let y denote the output, and Y be the discrete space of possible outcomes (e.g., 26 letters ‘a’‘z’). A classiﬁer (or hypothesis) h is a function from X to Y, h : X → Y. We denote the set of all classiﬁers that our learning program can produce as H (hypothesis class). Then given a set of labeled examples {x(i) , y (i) }, i = 1, . . . , m, a learning program seeks to produce a classiﬁer h ∈ H that will work well on unseen examples x, usually by ﬁnding h that accurately classiﬁes training data. The diagram in Fig. 1.1 summarizes the supervised learning setting.
1.1. SUPERVISED LEARNING
3
Hypotheses
Labeled data
Learning Prediction New data
Figure 1.1: Supervised learning setting
The problem of classiﬁcation has a long history and highly developed theory and practice (see for example, Mitchell [1997]; Vapnik [1995]; Duda et al. [2000]; Hastie et al. [2001]). The two most important dimensions of variation of classiﬁcation algorithms is the hypothesis class H and the criterion for selection of a hypothesis h from H given the training data. In this thesis, we build upon the generalized linear model family, which underlies standard classiﬁers such as logistic regression and support vector machines. Through the use of kernels to implicitly deﬁne highdimensional and even inﬁnitedimensional input representations, generalized linear models can approximate arbitrarily complex decision boundaries. The task of selecting a hypothesis h reduces to estimating model parameters. Broadly speaking, probabilistic estimation methods associate a joint distribution p(x, y) or conditional distribution p(y  x) with h and select a model based on the likelihood of the data [Hastie et al., 2001]. Joint distribution models are often called generative, while conditional models are called discriminative. Large margin methods, by contrast, select a model based on a more direct measure of conﬁdence of its predictions on the training data called the margin [Vapnik, 1995]. The difference between these two methods is one of the key
4
CHAPTER 1. INTRODUCTION
The screen was a sea of red
RSCCPCYWGGCPW GQNCYPEGCSGPKV
brace
(a)
(b)
(c)
(d)
Figure 1.2: Examples of complex prediction problems (inputstop, outputsbottom):
(a) handwriting recognition [image → word]; (b) natural language parsing [sentence → parse tree]; (c) disulﬁde bond prediction in proteins [aminoacid sequence → bond structure (shown in yellow)]; (d) terrain segmentation [3D image → segmented objects (trees, bushes, buildings, ground)]
themes in this thesis. Most of the research has focused on the analysis and classiﬁcation algorithms for the case of binary outcomes Y = 2, or a small number of classes. In this work, we focus on prediction tasks that involve not a single decision with a small set of outcomes, but a complex, interrelated collection of decisions.
1.2 Complex prediction problems
Consider once more the problem of character recognition. In fact, a more natural and useful task is recognizing words and entire sentences. Fig. 1.2(a) shows an example handwritten word “brace.” Distinguishing between the second letter and fourth letter (‘r’ and ‘c’) in isolation is actually far from trivial, but in the context of the surrounding letters that together form a word, this task is much less errorprone for humans and should be for computers as well. It is also more complicated, as different decisions must be weighed against each other to arrive at the globally satisfactory prediction. The space of all possible outcomes
1.2. COMPLEX PREDICTION PROBLEMS
5
Y is immense, usually exponential in the number of individual decisions, for example, the number of 5 letter sequences (265 ). However, most of these outcomes are unlikely given the observed input. By capturing the most salient structure of the problem, for example the strong local correlations between consecutive letters, we will construct compact models that efﬁciently deal with this complexity. Below we list several examples from different ﬁelds. • Natural language processing Vast amounts of electronically available text have spurred a tremendous amount of research into automatic analysis and processing of natural language. We mention some of the lowerlevel tasks that have received a lot of recent attention [Charniak, 1993; Manning & Sch¨ tze, 1999]. Partofspeech tagging involves assigning each u word in a sentence a partofspeech tag, such as noun, verb, pronoun, etc. As with handwriting recognition, capturing sequential structure of correlations between consecutive tags is key. In parsing, the goal is to recognize the recursive phrase structure of a sentence, such as verbal, noun and prepositional phrases and their nesting in relation to each other. Fig. 1.2(b) shows a parse tree corresponding to the sentence: “The screen was a sea of red” (more on this in Ch. 9). Many other problems, such as namedentity and relation extraction, text summarization, translation, involve complex global decision making. • Computational biology The last two decades have yielded a wealth of highthroughput experimental data, including complete sequencing of many genomes, precise measurements of protein 3D structure, genomewide assays of mRNA levels and proteinprotein interactions. Major research has been devoted to geneﬁnding, alignment of sequences, protein structure prediction, molecular pathway discovery [Gusﬁeld, 1997; Durbin et al., 1998]. Fig. 1.2(c) shows disulﬁde bond structure (shown in yellow) we would like to predict from the aminoacid sequence of the protein (more on this in Ch. 10). • Computer vision As digital cameras and optical scanners become commonplace accessories, medical imaging technology produces detailed physiological measurements, laser scanners
buildings. parameterized scoring function. Inference in these models refers to computing the highest scoring output given the input and usually involves dynamic programming or combinatorial optimization. which we formally deﬁne in Ch. The graphical structure of the network (more precisely. The graphical structure of the models encodes the qualitative aspects of the distribution: direct dependencies as well as conditional independencies.2(d) shows a 3D laser range data image of the Stanford campus collected by a roving robot which we would like to segment into objects such as trees. Example tasks include object detection and segmentation. (more on this in Ch. bushes. ground.3 Structured models This wide range of problems have been tackled using various models and methods. 1. • Markov networks Markov networks (a. spatial. a model assigns a score (or likelihood in probabilistic models) to each possible input/output pair (x. typically through a compact. 3D reconstruction from stereo and video. Abstractly. etc. 1. Fig. The quantitative aspect of the model is deﬁned by the potentials that are associated with nodes and cliques of the graph.a. 7). • Context free grammars . Such models are encoded by a graph. Markov random ﬁelds) are extensively used to model complex sequential.6 CHAPTER 1. we are ﬂooded with images we would like our computer to analyze. and much more [Forsyth & Ponce. and whose edges represent and quantify direct dependencies between them. satellites and telescopes bring pictures of Earth and distant stars. the treewidth of the graph. 3) is critical to efﬁcient inference and learning in the model. and relational interactions in prediction problems arising in many ﬁelds. Markov networks compactly represent complex joint distributions of the label variables by modeling their local interactions. y). These problems involve labeling a set of related objects that exhibit local consistency. INTRODUCTION capture 3D environments. 2002]. motion tracking. whose nodes represent the different object labels. We focus on the models that compactly capture correlation and constraint structure inherent to many tasks.k.
Cormen et al. V P → V P P P . the nonterminal symbols (labels of internal nodes) correspond to syntactic categories such as noun phrase (NP). the disulﬁde connectivity prediction in Fig.2. A CFG consists of recursive productions (e. we use the term model very broadly. The productions deﬁne the set of syntactically allowed phrase structures (derivations).g. For example.2(c) can be modeled by maximum weight perfect matchings. where the weights deﬁne potential bond strength based on the local aminoacid sequence properties. For example.3. determiners (DT) and prepositions (IN). to include any scheme that assigns scores to the output space Y and has a procedure for ﬁnding the optimal scoring y. verbal phrase (VP) or prepositional phrase (PP) and partofspeech tags like nouns (NN). maximum likelihood estimation of scoring function parameters for combinatorial structures is often intractable because of the problem of deﬁning a normalized distribution over an exponential set of combinatorial structures. The terminal symbols (leaves) are the words of the sentence. . 1976.1. Although the term ‘model’ is often reserved for probabilistic models. edgecover. graphcut. DT → The) that can be applied to derive a sentence of the language. 1.. and the prediction task reduces to ﬁnding the most likely tree given the sentence. The other combinatorial structures we consider and apply in this thesis include graph cuts and partitions. The context free restriction allows efﬁcient inference and learning in such models. and many others [Lawler. Papadimitriou & Steiglitz. verbs (VBD). probabilistic CFGs construct a distribution over parse trees and sentences. 1. 2001]. By compactly deﬁning a probability distribution over individual productions. and spanning trees. bipartite matchings. However. both joint and conditional. • Combinatorial structures Many important computational tasks are formulated as combinatorial optimization problems such as the maximum weight bipartite and perfect matching. 1999]. STRUCTURED MODELS 7 Contextfree grammars are one of the primary formalisms for capturing the recursive structure of syntactic constructions [Manning & Sch¨ tze. spanning tree. u in Fig. 1982. The standard methods of estimation for Markov networks and context free grammars are based on maximum likelihood.
from Markov networks to context free grammars to combinatorial graph structures such as matchings and cuts.8 CHAPTER 1. we ﬁnd parameters such that inference in the model (dynamic programming. The second one only requires compactly expressing optimality of a given assignment according to the model and applies to a broader range of combinatorial problems. ◦ Markov networks The largest portion of the thesis is devoted to novel estimation algorithms. The seamless integration of kernels with graphical models allows us to create . representational extensions. compact. ◦ Learning framework for structured models We propose a general framework for efﬁcient estimation of models for structured prediction. taking advantage of prediction task structure. INTRODUCTION 1. this framework builds upon the large margin estimation principle. generalization analysis and experimental validation for Markov networks. Intuitively. Lowtreewidth Markov networks We use graph decomposition to derive an exact. These two formulations form the foundation which the rest of the thesis develops. combinatorial optimization) predicts the correct answers on the training data with maximum conﬁdence. a model class of choice in many structured prediction tasks in language. The ﬁrst formulation relies on the ability to express inference in the model as a compact convex optimization problem. We consider a very large class of structured models. or can be efﬁciently approximated. vision and biology.4 Contributions This thesis addresses the problem of efﬁcient learning of highaccuracy models for complex prediction problems. We focus on those models where exact inference is tractable. We develop general conditions under which exact large margin estimation is tractable and present two formulations for structured maxmargin estimation that deﬁne compact convex optimization problems. An alternative to likelihoodbased methods. convex learning formulation for Markov networks with sequence and other lowtreewidth structure.
. For the nonbinary case.1. our framework allows exact estimation of networks of arbitrary connectivity and topology. Representation and learning of relational Markov networks We introduce relational Markov networks (RMNs). Learning associative Markov networks (AMNs) We deﬁne an important subclass of Markov networks that captures positive correlations present in many domains.4. scale up to tens of millions of nodes and edges.g. Generalization analysis We analyze the theoretical generalization properties of maxmargin estimation in Markov networks and derive a novel marginbased bound for structured prediction. proportion of mislabeled pixels in an image) and uses a proof that exploits the graphical model structure. We also use approximate graph decomposition to derive a compact approximate formulation for Markov networks in which inference is intractable. This bound is the ﬁrst to address structured error (e. our models are learned efﬁciently and. for which likelihood methods are believed to be intractable. We present an AMNbased method for object segmentation from 3D range data. CONTRIBUTIONS 9 very rich models that leverage the immense amount of research in kernel design and graphical model decompositions for efﬁcient. We show that for AMNs over binary variables. Our onlinestyle algorithm uses inference in the model and analytic updates to solve extremely large estimation problems. we provide an approximation that works well in practice. accurate prediction in realworld tasks. Scalable online algorithm We present an efﬁcient algorithm for solving the estimation problem called Structured SMO. By constraining the class of Markov networks to AMNs. at runtime. which compactly deﬁne templates for Markov networks for domains with relational structure objects.
perfect matchings for disulﬁde connectivity in protein structure prediction. We show experimental evidence of the model’s improved performance over several baseline models. Experiments on synthetic and realworld data show the ability of the algorithm to learn an appropriate . matching. graph partitions for clustering documents and segmenting images.10 CHAPTER 1. In contrast to algorithms that learn a metric independently of the algorithm that will be used to cluster the data. in which exact inference is intractable. We apply this class of models to classiﬁcation of hypertext using hyperlink structure to deﬁne relations between webpages. INTRODUCTION attributes. We use approximate inference in these complex models. which makes it possible to efﬁciently embed the features in very highdimensional spaces and achieve stateoftheart accuracy. efﬁcient algorithm for learning to match. tuning one to the other in a joint optimization. relations. We apply our framework to prediction of disulﬁde connectivity in proteins using perfect nonbipartite matchings. Learning to parse We exploit context free grammar structure to derive a compact maxmargin formulation and show highaccuracy parsing in cubic time by exploiting novel kinds of lexical information. to derive an approximate learning formulation. The graphical structure of an RMN is based on the relational structure of the domain. The algorithm we propose uses kernels. we describe a formulation that tightly integrates metric learning with the clustering algorithm. Learning to cluster We derive a maxmargin formulation for learning the afﬁnity metric for clustering from clustered training data. ◦ Broader applications: parsing. clustering The other large portion the thesis addresses a range of prediction tasks with very diverse models: context free grammars for natural language parsing. and can easily model complex interaction patterns over related entities. Learning to match We use combinatorial properties of weighted matchings to develop an exact.
allow us to exploit decomposition and combinatorial structure of the prediction task. including email folder organization and image segmentation. and review estimation methods based on maximizing likelihood. minmax and certiﬁcate. in particular using upper and lower bounds. We consider generalized linear models. We describe representation and inference for Markov networks. we deﬁne the abstract class of structured prediction problems and models addressed by the thesis. Chapter 3.5. loss functions. risk. Structured maximum margin estimation: This chapter outlines the main principles of maximum margin estimation for structured models. Structured models: In this chapter. They lead to polynomial size programs for estimation of models where the prediction problem is tractable. We also brieﬂy describe context free grammars and combinatorial structures as models. We also discuss approximations. These formulations. for solving intractable or very large problems. We compare probabilistic models. including logistic regression and support vector machines. We address the exponential blowup of the naive problem formulation by deriving two general equivalent convex formulation. compact formulation that seamlessly integrates kernels with graphical models. We use graphical model decomposition to derive a convex. Markov networks: We review maximum conditional likelihood estimation and present maximum margin estimation for Markov networks. Chapter 4. including dynamic and linear programming inference. Chapter 5. 1. generative and discriminative and unnormalized models. We describe the relationship between the dual estimation problems and kernels.1. conditional likelihood and margin. We analyze the theoretical generalization . Supervised learning: We review basic deﬁnitions and statistical framework for classiﬁcation. We deﬁne hypothesis classes.5 Thesis outline Below is a summary of the rest of the chapters in the thesis: Chapter 2. THESIS OUTLINE 11 clustering metric for a variety of desired clusterings.
Chapter 8. As we show. We show . We show that for associative Markov networks of over binary variables. discriminative graphical model avoids the difﬁculties of deﬁning a coherent generative model for graph structures in directed models and allows us tremendous ﬂexibility in representing complex patterns. and can easily model complex patterns over related entities. called Structured SMO. maxmargin estimation allows exact training of networks of arbitrary connectivity and topology. attributes and relations. Chapter 7. Our onlinestyle algorithm uses inference in the model and analytic updates to solve extremely large quadratic problems. M3 N algorithms and experiments: We present an efﬁcient algorithm for solving the estimation problem in graphical models. We present experiments with handwriting recognition. the use of an undirected. Relational Markov networks: We introduce the framework of relational Markov networks (RMNs). Associative Markov networks: We deﬁne an important subclass of Markov networks. We present an AMNbased method for object segmentation from 3D range data that scales to very large prediction tasks involving tens of millions of points. that captures positive interactions present in many domains. for which maximum likelihood methods are believed to be intractable.12 CHAPTER 1. For the nonbinary case. we provide an approximation that works well in practice. The graphical structure of an RMN is based on the relational structure of the domain. INTRODUCTION properties of maxmargin estimation and derive a novel marginbased bound for structured classiﬁcation. Context free grammars: We present maxmargin estimation for natural language parsing on the decomposition properties of context free grammars. showing that accuracy can be signiﬁcantly improved by modeling relational dependencies. which compactly deﬁnes templates for Markov networks in domains with rich structure modeled by objects. Chapter 6. associative Markov networks (AMNs). We provide experimental results on a webpage classiﬁcation task. where our models signiﬁcantly outperform other approaches by effectively capturing correlation between adjacent letters and incorporating highdimensional input representation via kernels. Chapter 9.
. we derive a maxmargin formulation for learning afﬁnity scores for correlation clustering from clustered training data. We use combinatorial properties of weighted matchings to develop an exact. We formulate the approximate learning problem as a compact convex program with quadratic objective and linear or positivesemideﬁnite constraints. although they underly several papers mentioned below. 5 was published for a less general case. using a dual decomposition technique [Taskar et al.1. Chapter 10. PREVIOUSLY PUBLISHED WORK 13 that this framework allows highaccuracy parsing in cubic time by exploiting novel kinds of lexical information. Perfect matchings: We apply our framework to learning to predict disulﬁde connectivity in proteins using perfect matchings. Correlation clustering: In this chapter. 4. Conclusions and future directions: We review the main contributions of the thesis and summarize their signiﬁcance. 7) was published with experiments on hypertext and newswire classiﬁcation [Taskar et al. 2004a].6 Previously published work Some of the work described in this thesis has been published in conference proceedings. Experiments on synthetic and realworld data show the ability of the algorithm to learn an appropriate clustering metric for a variety of desired clusterings. 2003a]. We show experimental evidence of the model’s improved performance over several baseline models. The algorithm we propose uses kernels. Work on associative Markov networks (Ch. The minmax and certiﬁcate formulations for structured maxmargin estimation have not been published in their general form outlined in Ch.6. efﬁcient algorithm for learning the parameters of the model. Chapter 12. The polynomial formulation of maximum margin Markov networks presented in Ch.. A paper . Chapter 11. including email folder organization and image segmentation. We discuss extensions and future research directions not addressed in the thesis. applicability and limitations. 1. which makes it possible to efﬁciently embed the features in very highdimensional spaces and achieve stateoftheart accuracy.
work on correlation clustering in Ch. . 9 was published in Taskar et al. [2004b]. Vassil Chatalbashev. using maximum (conditional) likelihood estimation. 8). Daphne Koller and Andrew Ng). 10 (joint work with Vassil Chatalbashev and Daphne Koller) is currently under review. Geremy Heitz. [2002] and Taskar et al. Natural language parsing in Ch. which presents a experiments on terrain classiﬁcation and other tasks. Disulﬁde connectivity prediction using perfect matchings in Ch. [2003b] deﬁned and applied the Relational Markov networks (Ch. Finally. INTRODUCTION on 3D object segmentation using AMNs. has not been published. is currently under review (joint work with Drago Anguelov.14 CHAPTER 1. done jointly with Pieter Abbeel and Andrew Ng. 11. Taskar et al. Dinkar Gupta.
Part I Models and methods 15 .
. including accuracy.Chapter 2 Supervised learning In supervised learning. . for example. The goal of a learning algorithm is to output a hypothesis h such that h(x) will approximate y on new samples from the distribution (x. We arrive at such a criterion by quantifying what it means for h(x) to approximate 16 . yk }.d. Numerous classes of functions have been well studied. A supervised learning problem with discrete outputs. . y) ∼ D. The second crucial dimension of a learning algorithm is the criterion for selection of h from H. We will concentrate on the last two classes. for indepth discussion of these and many other models). . generalized loglinear models and kernel methods (see Quinlan [2001]. including decision trees. The input to an algorithm is training data. The input space X is an arbitrary set (often X = IRn ).i. is called classiﬁcation. [2001]. neural networks. [2000]. we seek a function h : X → Y that maps inputs x ∈ X to outputs y ∈ Y. a set of m i. Learning algorithms can be distinguished among several dimensions. X is the set of images of letters and Y is the alphabet (see Fig. 2. y (i) )}m drawn from a ﬁxed but unknown distribution D i=1 over X × Y. In handwritten character recognition. Bishop [1995].1). efﬁciency. Duda et al. chief among them is the hypothesis class H of functions h the algorithm outputs. where k is the number of classes. (independent and identically distributed) samples S = {(x(i) . for several reasons we discuss below. and extensibility to more complex structured prediction tasks will consider in the next chapter. Hastie et al. Y = {y1 . while the output space Y we consider in this chapter discrete. nearestneighbors.
if X = IR. For a vast majority of supervised learning algorithms. i = (1. 1 I(·) I(true) = 1 and 1 I(false) = 0. simply selecting a hypothesis with lowest risk h∗ = arg min RS [h]. but high actual risk. we estimate the risk of h using its empirical risk RS . is large enough. h(x)) ≡ 1 = h(x)). y). Since we do not generally know the distribution D. Y = IR and H includes all polynomials of degree m − 1. this fundamental balance is . y.1) : X × Y × Y → IR+ measures the penalty for predicting h(x) on the sample (x. y. In general. RS [h] is often called the training If our set of hypotheses..2) where we abbreviate (x(i) . we assume that (x. The risk functional RD [(h)] measures the expected error of the approximation: RD [h] = E(x. y (i) ). we can always ﬁnd a polynomial h that passes through all the sample points (x(i) . h(x(i) )) = error or training loss. it will have zero empirical risk. h∈H is generally not a good idea. that is. h(x )) = m (i) (i) (i) (i) i (h(x )). where the loss function (2. y .. y ) = 0 if y = y . . we will be able to ﬁnd h that has zero or very small empirical risk. y..y)∼D [ (x. that is. h(x))].17 y. RS [h] is simply the proportion of training examples that h misclassiﬁes. H. m) assuming that all the x(i) are unique.g. I(y where 1 denotes the indicator function. The key to selecting a good hypothesis is to tradeoff complexity of class H (e. computed on the training sample S: 1 RS [h] = m m i=1 1 (x . the degree of the polynomial) with the error on the training data as measured by empirical risk RS . m i (h(x i=1 (i) )). However. For 0/1 loss. ˆ ˆ A common loss function for classiﬁcation is 0/1 loss 0/1 (x. y (i) . For example. This polynomial is very likely to overﬁt the training data. (2.
For many classes. 1 . x. Hence. where w ∈ W is a set of parameters.4) where f (w. it is intractable [Bishop. minimizing the objective with the usual 0/1 training error is generally a very difﬁcult problem with multiple maxima for most realistic H. Quinlan. y). and we must resort to approximate.18 CHAPTER 2. For these intractable classes. for example decision trees and multilayer neural networks. h∈H (2. the loss function . y∈Y (2. and the regularization D[h]. 1995. x. usually with W ⊆ IRn . As we discuss below. the search for the optimal h∗ in (2. The formulation in (2. the search procedure used by the learning algorithm is crucial. greedy optimization methods. Below however. the learning algorithms we consider are completely characterized by the hypothesis class H. Hastie et al. [2001] for details. See discussion in the next section about approaches to dealing with 0/1 loss. We assume that ties in the arg max are broken using some arbitrary but ﬁxed rule. we consider hypothesis classes of the following parametric form: hw (x) = arg max f (w. 2001].4) of the hypothesis class in terms of an optimization procedure will become crucial to extending supervised learning techniques to cases where the output space Y is more complex. SUPERVISED LEARNING achieved by minimizing the weighted combination of the two criteria: h∗ = arg min D[h] + CRS [h] . Devroye et al. Depending on the complexity of the class H. For classiﬁcation. The term D[h] is often called regularization. this class of hypotheses is very rich and includes many standard models. [1996]. y) is a function f : W × X × Y → IR.3) where D[h] measures the inherent dimension or complexity of h.3) may be a daunting task1 . and C ≥ 0 is a tradeoff parameter. but simply adopt the standard measures as needed and refer the reader to Vapnik [1995]. we will concentrate on models where the optimal h∗ can be found efﬁciently using convex optimization in polynomial time. In general. We will not go into derivation of various complexity measures D[h] here.
. (x. The most common loss for classiﬁcation is 0/1 loss. 2.2. there are statistical beneﬁts of minimizing a convex upper bound [Bartlett et al. 2003]). col) and char ∈ Y. We might have a basis function fj (x. Intuitively. I(x where xrow. y∈Y (2. The regularization D[hw ] for the linear family is typically the norm of the parameters wp for p = 1.5) Consider the character recognition example in Fig. (In addition to computational advantages of this approach.1 Classiﬁcation with generalized linear models For classiﬁcation. differ primarily in their choice of the upper bound on the training 0/1 loss. y). logistic regression and support vector machines.col = on ∧ y = char) for each possible (row. this very simple model captures enough information to perform reasonably well. a hypothesis hw ∈ H is deﬁned by a set of n coefﬁcients wj ∈ IR such that: n hw (x) = arg max y∈Y i=1 wj fj (x. . Given n realvalued basis functions fj : X × Y → IR.. Minimizing the 0/1 risk is generally a very difﬁcult problem with multiple maxima for any large class H. . col). Our input x is a vector of pixel values of the image and y is the alphabet {a.1. y) and hence is simpler than a hw with a large weight wj .1. . y. 2. h(x)) ≥ (x. Two of the primary classiﬁcation methods we consider. y. we consider the generalized linear family of hypotheses H. . z}. y) = 1 row.1: Handwritten character recognition: sample letters from Kassel [1995] data set.col denotes the value of pixel (row. CLASSIFICATION WITH GENERALIZED LINEAR MODELS 19 a b c d e Figure 2. y) = arg max w f (x. 2. or small weight wj implies that the hypothesis hw does not depend on the value of fj (x. The standard solution is minimizing an upper bound on the 0/1 loss. Since different letters tend to have different pixels turned on. h(x)). a zero.
The logloss log Zw (x) − w f (x.5 1 0. Horizontal axis shows w f (x. This approach is called the (regularized) maximum likelihood estimation.7) where C is a userspeciﬁed constant the determines the tradeoff between regularization and likelihood of the data.2: 0/1loss upper bounded by logloss and hingeloss. y) − maxy =y w f (x.20 CHAPTER 2. while the vertical axis show the value of the associated loss.2). y)}.2 Logistic regression In logistic regression.5 log−loss hinge−loss 0/1−loss 3 2. Common choices for regularization are 1 or 2norm regularization on the weights. Zw (x) (2. we use 2norm below: min 1 w2 + C 2 log Zw (x(i) ) − w f (x(i) . The optimal weights are selected by maximiz ing the conditional likelihood of the data (minimizing the logloss) with some regularization. 2.6) y∈Y exp{w f (x.5 −1 −0. we assign a probabilistic interpretation to the hypothesis hw as deﬁning a conditional distribution: Pw (y  x) = where Zw (x) = 1 exp{w f (x.5 1 1. y) is an upper bound (up to a constant) on the 0/1 loss 0/1 (see Fig.5 2 1. where y is the correct label for x.5 2 Figure 2. 2. . The logloss is shown up to an additive constant for illustration purposes. y ). i (2. y (i) ). y)}. SUPERVISED LEARNING 3.5 0 0.5 0 −2 −1.
The gradient with respect to w is given by: w+C i Ei. − i. LOGISTIC DUAL AND MAXIMUM ENTROPY 21 2.w [∆fi (y)] = 0.w [f (y)] = y f (y)Pw (y  x(i) ) is the expectation under the conditional distribu tion Pw (y  x(i) ) and ∆fi (y) = f (x(i) .2. y (i) ) − w f (x(i) . 1995] select the weights based on the “margin” of conﬁdence of hw . 1998. y (i) ) = w − C i Ei. y) = min w ∆fi (y). 2.3 Logistic dual and maximum entropy The objective function is convex in the parameters w. 1991] that the dual of the maximum likelihood problem (without regularization) is the maximum entropy problem: max s. the margin on example i quantiﬁes by how much the true label “wins” over the wrong ones: γi = 1 1 min w f (x(i) . so we have an unconstrained (differentiable) convex optimization problem.y Pw (y  x(i) ) log Pw (y  x(i) ) (2. Ignoring the regularization term. It can be shown [Cover & Thomas.t.4 Support vector machines Support vector machines [Vapnik.8) Ei. y (i) ) − f (x(i) . w y=y(i) w y=y(i) . In the multiclass SVM formulation [Weston & Watkins.3. y)] − fi (x(i) . where Ei. ∀i. We can interpret logistic regression as trying to match the empirical basis function expectations while maintaining a high entropy conditional distribution Pw (y  x). 2001]. the gradient is zero when the basis function expectations are equal to the basis functions evaluated on the labels y (i) .w [∆fi (y)]. y).w [fi (x(i) . Crammer & Singer.
and the optimization problem Eq.22 CHAPTER 2.2).y (2. ∀i. y. (2.10) The hingeloss maxy [ (see Fig. 2. y). αi (y) ≥ 0. We can also express ξi as maxy 0/1 i (y) − w ∆fi (y). 0/1 In the dual.7): min 1 w2 + C 2 max[ i y 0/1 i (y) − w ∆fi (y)]. Maximizing the smallest such margin (and allowing for negative margins) is equivalent to solving the following quadratic program: min s. (2. SUPERVISED LEARNING where ∆fi (y) = f (x(i) . (2. max i. y (i) ) − f (x(i) .y ∗ αi (y)∆fi (y). The solution to the dual α gives the solution to the primal as a weighted combination of basis functions of examples: w∗ = i.t.9).t.y αi (y) 0/1 i (y) 1 − 2 2 αi (y)∆fi (y) i. the αi (y) variables correspond to the w ∆fi (y) ≥ ∗ (y)−ξi constraints in the primal Eq.5 SVM dual and kernels The form of the dual of Eq. ∀y ∈ Y.11) s. . (2. ∀i. (2. y αi (y) = C.9) is crucial to efﬁcient solution of SVM and the ability to use a high or even inﬁnite dimensional set of basis functions via kernels. 1 w2 + C 2 w ∆fi (y) ≥ ξi i 0/1 (2.9) ∀i. 0/1 i (y) − w ∆fi (y)] is also an upper bound on the 0/1 loss 0/1 2. Note that the slack variable ξi is constrained to be positive in the above program since w ∆fi (y (i) ) = 0 and 0/1 (y (i) ) = 0.9) in a form similar to Eq. (y) − ξi .
we might have basis functions that are polynomial of degree d in terms of image pixels.¯ y αi (y)αj (¯)∆fi (y) ∆fj (¯).. SVM DUAL AND KERNELS 23 ∗ The pairings of examples and incorrect labels.y = i. the hinge loss formulation usually produces sparse solutions in terms of the number of support vectors. are called support vectors. y ) can be computed efﬁciently. y ) = ¯ i. y). we can x ¯ solve Eq. . y) f (x. Expanding the quadratic term.y αi (y)[f (x(i). y )−f (x(i). Computing this polynomial kernel can be done independently of the dimension d. . (2. . col1 ) . we also do not need to worry about the dimension of f since: w f (x. 1993. ¯ ¯ For example.5. 1995]. . fj (x. Zhu & Hastie. (i.11) independently of the actual dimension of f . (rowd . as long as the dot product f (x. cold ) and char ∈ Y. In fact. An important feature of the dual formulation is that the basis functions f appear only as dot products.y αi (y)∆fi (y) f (x. y) f (¯ . However.col1 = on ∧ .y j. that have nonzero αi (y). Note that at classiﬁcation time. we have: 2 αi (y)∆fi (y) i. . y )].2. y y Hence. ∧ xrowd . y (i) ) f (x. while solutions to the corresponding kernelized logloss problem are generally nonsparse (all examples are support vectors) and require approximations for even relatively small datasets [Wahba et al. y ) = ¯ i.cold = on ∧ y = char) for each I(x possible (row1 . 2001]. logistic regression can also be kernelized. even though the number of basis functions grows exponentially with d [Vapnik. y) = 1 row1 .
We call problems with discrete output spaces structured classiﬁcation or structured prediction. We refer to joint spaces with constraints and correlations as structured. For concreteness. machine vision. we might restrict that the letter ‘q’ never follows by ‘z’ in English. respecting the constraints and exploiting the correlations in the output space. . each Yj is the alphabet. . . Fig. let the number of variables L be ﬁxed. The range of prediction problems these broad deﬁnitions encompass is immense. In word recognition. In word recognition.×YL . . arising in ﬁelds as diverse as natural language analysis. .1 shows an example handwritten word “brace. Y ⊂ Y1 ×. and computational 24 .g. . the output variables are often highly correlated.” Distinguishing between the second letter and fourth letter (‘r’ and ‘c’) in isolation is far from trivial. In addition to “hard” constraints. but in the context of the surrounding letters that together form a word. e. for example an entire sequence of L characters.Chapter 3 Structured models Consider once more the problem of character recognition. In this chapter. 3. while Y is the dictionary. This joint output space is often a proper subset of the product of singleton output spaces. yL ). but a set of values y = (y1 . consecutive letters in a word. we consider prediction problems in which the output is not a single discrete value y. In fact. a more natural and useful task is recognizing words and entire sentences. The output space Y ⊆ Y1 × . Structured models we consider in this chapter (and thesis) predict the outputs jointly. this task is much less errorprone for humans and should be for computers as well. . . × YL we consider is a subset of product of output spaces of single variables.
PROBABILISTIC MODELS: GENERATIVE AND CONDITIONAL 25 b r a c e Figure 3. For the most part. y) is a vector of functions f : X × Y → IRn . biology. y) ≥ 0. . combinatorial optimization problems like mincut and matching. we will restrict our attention to models where this optimization problem can be solved in polynomial time. y : g(x. to name a few. we use an approximate polynomial time optimization procedure. This includes. convex optimization such as linear.1: Handwritten word recognition: sample from Kassel [1995] data set. A generative model assigns a normalized joint density p(x. except that y has been replaced by y: hw (x) = arg max w f (x. This formulation is very general. where g : X × Y → IRk .1.1) where as before f (x. probabilistic models like Markov networks (in certain cases) and contextfree grammars. like intractable Markov networks (Ch. 3. The output space Y = {y : g(x. The class of structured models H we consider is essentially of the same form as in previous chapter. Clearly. 11).y)≤0 (3. quadratic and semideﬁnite programming. y) ≤ 0} is deﬁned using a vector of functions g(x. y) = 1. 8) and correlation clustering (Ch. y) that deﬁne the constraints.3. y) to the input and output space X × Y with p(x. for example. ﬁnding the optimal y is intractable.1 Probabilistic models: generative and conditional The term model is often reserved for probabilistic models. g pairs. for many f . In other cases. y∈Y x∈X p(x. which can be subdivided into generative and conditional with respect to the prediction task. y).
which we use to make the predictions. A very common class of generative models is the exponential family: p(x. y). For exponential families. A generative model must make simplifying assumptions (more precisely. by optimizing the model to ﬁt the joint distribution p(x. generative models may actually outperform conditional models [Ng & Jordan. generative models actually need fewer samples to converge to a good estimate of the joint distribution than conditional models need to accurately represent the conditional distribution. . It also provides an intuitive measure of conﬁdence in the predictions of a model in terms of conditional probabilities. y)] [DeGroot. the maximum likelihood parameters w with respect to the joint distribution can be computed in closed form using the empirical basis function expectations ES [f (x. Because of this. the conditional model will learn the best approximation to p(y  x) possible using w. In a regime with very few training samples (relative to the number of parameters w). independence assumptions) about the entire p(x. Probabilistic interpretation of the model offers wellunderstood semantics and an immense toolbox of methods for inference and learning. y∈Y p(y  x) = 1 ∀x ∈ X . y) will not necessarily do so. In addition. generative models are typically structured to allow very efﬁcient maximum likelihood learning. y)}. 2001]. however. Typically. Any model is an approximation to the true distribution underlying the data. y).. y) ∝ exp{w f (x. while a conditional model makes many fewer assumption by focusing on p(y  y). this efﬁciency comes at a price. STRUCTURED MODELS A conditional model assigns a normalized density p(y  x) only over the output space Y with p(y  x) ≥ 0. while the generative model p(x. Given sufﬁcient data.26 CHAPTER 3. 1970. Hastie et al. we may be tuning the approximation away from optimal conditional distribution p(y  x). 2001]. Of course.
The models treat the inputs and outputs as random variables X with domain X and Y with domain Y and compactly deﬁne a conditional density p(Y  X) or distribution P (Y  X) (we concentrate here on the . We still heavily rely on the representation and inference tools familiar from probabilistic models for the construction of and prediction in unnormalized models. typically perform as well or better than logistic regression [Vapnik.2. we can often achieve higher accuracy models when we do not learn a normalized distribution over the outputs.1)). In this chapter. 2000]. 3.. but concentrate on the margin or decision boundary. Essentially. Cowell et al. The learning methods we advocate in this thesis circumvent this problem by requiring only the maximization problem to be tractable. while the optimal y can be found in polynomial time. which do not represent a conditional distribution. the difference between the optimal y and the rest. PREDICTION MODELS: NORMALIZED AND UNNORMALIZED 27 3.3. we use the term model very broadly. we review basic concepts in probabilistic graphical models called Markov networks or Markov random ﬁelds. normalizing the model (summing over the entire Y) is intractable.2 Prediction models: normalized and unnormalized Probabilistic semantics are certainly not necessary for a good predictive model if we are simply interested in the optimal prediction (the arg max in Eq. 1988. 1995. This fact makes standard maximum likelihood estimation infeasible. (3. to include any scheme that assigns scores to the output space Y and has a procedure for ﬁnding the optimal scoring y. support vector machines. in many cases we discuss below. but largely dispense with the probabilistic interpretation when needed. Even more importantly. 1999]. We also brieﬂy touch upon examples of contextfree grammars and combinatorial problems that will be explained in greater detail in Part III to illustrate the range of prediction problems we address. As we discussed in the previous chapter. In general.3 Markov networks Markov networks provide a framework for a rich family of models for both discrete and continuous prediction [Pearl. Cristianini & ShaweTaylor.
but many of the same representation and inference concepts translate to continuous domains. {Y5 }. In the chain network in Fig. consider a ﬁrstorder Markov chain a model for the word recognition task. 3.2. Note that each subclique of a clique is also a clique.2. . We focus on discrete output spaces Y below. The quantitative aspect of the model is deﬁned by the potentials that are associated with nodes and cliques of the graph. . A clique is a set of nodes c ⊆ V that form a fully connected subgraph (every two nodes are connected by an edge). an assignment of variables in the clique as yc and the space of all assignments to the clique as Yc . Yb . b < j < a.3. STRUCTURED MODELS conditional Markov networks or CRFs [Lafferty et al. Ya . More precisely. it sufﬁces to separately ﬁnd the optimal subsequence from 1 to j ending with yj . Yj+1 . P (Ya  Yj . and we consider each node a singleton clique. x) = P (Yb  Yj . we use a model where P (Yb  Yj . . No assumption is . the correlation between a letter Yb before j and a letter Ya after j is negligible. The advantage of a graphical framework is that it can exploit sparseness in the correlations between outputs Y . The graphical structure of the models encodes the qualitative aspects of the distribution: direct dependencies as well as conditional independencies. Intuitively. 3. x). . this conditional independence property means that the optimization problem is decomposable: given that Yj = yj . We denote the set of variables in a clique c as Yc . 2001]). Y2 }. {Y1 . Before a formal deﬁnition.1 Representation The structure of a Markov network is deﬁned by an undirected graph G = (V. For the purposes of ﬁnding the most likely y. x). Y5 }}. We do not explicitly represent the inputs X in the ﬁgure. . . . In Fig. {Y4 .28 CHAPTER 3. E). . but the ﬁrstorder model is making the assertion (which is certainly an approximation) that once the value of a letter Yj is known. 3. . where the nodes are associated with variables V = {Y1 . . the nodes are associated with output variables Yi and the edges correspond to direct dependencies or correlations. YL }. For example. the cliques are simply the nodes and the edges: C(G) = {{Y1 }.. adjacent letters in a word are highly correlated. . . and the optimal subsequence starting with yj from j to L. x) = P (Ya  Yj . the model encodes that Yj is conditionally independent of the rest of the variables given Yj−1 .
Φ) deﬁnes a conditional distribution: P (y  x) = 1 Z(x) φc (x. which speciﬁes a nonnegative value for each assignment yc to variables in Yc and any input x. .‘e’). yc ). we have node and edge potentials. .1 A Markov network is deﬁned by an undirected graph G = (V. The nodes are associated with variables V = {Y1 . For simplicity.2. Intuitively. φi. The Markov network (G. made about X .3. though perhaps there would be some ambiguity with the second and fourth letter. Potentials do not have a local probabilistic interpretation. yc ).3. the node potentials quantify the correlation between the input x and the value of the node. while the edge potentials quantify the correlation between the pair of adjacent output variables as well as the input x. YL }.2: Firstorder Markov chain: φi (Yi ) are node potentials. Deﬁnition 3. Each clique c ∈ C(G) is associated with a potential φc (x. yc ) with φc : X × Yc → IR+ . assume that the edge potentials would not depend . In our example Fig.3.‘c’. c∈C(G) where C(G) is the set of all the cliques of the graph and Z(x) is the partition function given by Z(x) = y∈Y c∈C(G) φc (x. E) and a set of potentials Φ = {φc }. . 3.‘a’. Yi+1 ) are edge potentials (dependence on x is not shown). . Conditioned on the image input.‘r’. appropriate node potentials in our network should give high scores to the correct letters (‘b’. but can be thought of as deﬁning an unnormalized score for each assignment in the clique.i+1 (Yi . MARKOV NETWORKS 29 Figure 3.
no matter in what position they appear in the sequence. which can be accomplished by adding more basis functions that condition on the position of the clique. Usually.row. all single node potentials would share the same weights and basis functions (albeit the relevant portion of the input xc is different) and similarly for the pairwise cliques. For the edge potentials. the node Sometimes we might actually want some dependence on the position in the sequence. Similarly. yc ) where nc is the number of basis functions for the clique c. Multiplied together. the edge functions in f (xc . STRUCTURED MODELS on the images. which we denote as xc . yc ) = exp wc fc (x. col) in xj . we stack all basis functions into one vector f .30 CHAPTER 3. f has node functions and edge functions. yc ) − log Zw (x). these scores should favor the correct output “brace”. yj+1 ) = 1 j = char1 ∧yj+1 = I(y char2 ) for each char1 ∈ Yj and char2 ∈ Yj+1 .1 With slight abuse of notation. yc ) are deﬁned to evaluate to zero. we are likely to “tie” or “share” the parameters of the model wc across cliques. a Markov network is a generalized loglinear model. For the sequence model. we can deﬁne basis functions for each combination of letters (assume for simplicity no dependence on x) : fj.k (x. so when c is a node. when c is an edge. Hence the log of the conditional probability is given by: log P (y  x) = c∈C(G) wc fc (x. In this problem (as well as many others). yj . since the potentials φc (xc .col = on ∧ yj = char) for each I(x possible (row. yc ) could be represented (in logspace) as a sum of basis functions over x. but simply should give high scores to pairs of letters that tend to appear often consecutively. In fact.k fc. we condition a clique only on a portion of the input x.k (x. 1 .j+1. In general. yc ) = exp k=1 wc. the window of the image that corresponds to letter j and each char ∈ Yj (we assume the input has been segmented into images xj that correspond to letters). yc : nc φc (xc . yj ) = 1 j. we could use the same basis functions as for individual character recognition: fj.k (x. In case of node potentials for word recognition.
known as maximum aposteriori (MAP) or most likely explanation (MPE). is just one of such questions. say according to some lexicographic order of the symbols.3..1). 1 φ∗ (yk ) = k yk−1 ∈Yk−1 ∀y1 ∈ Y1 . 3. but most relevant to our discussion. ∀yk ∈ Yk . (3. Using the arg max’s of the max’s in L the computation of φ∗ .2 Inference There are several important questions that can be answered by probabilistic models. yj ). we can backtrace the highest scoring sequence itself. Now we can write: f (x. We stack the weights in the corresponding manner. MARKOV NETWORKS 31 functions in f (xc . y). y∈Y y∈Y in the same form as Eq. yj−1 . . y1 ). yk ).3. yc ) are also deﬁned to evaluate to zero. j The algorithm computes the highest scores recursively: φ∗ (y1 ) = φ1 (x. yk )φj (x. y) = c∈C(G) f (xc .3.k−1 φj (x. 1 < k ≤ L. max φ∗ (yk−1 )φj (x. so the most likely assignment according to the model is given by: arg max log Pw (y  x) = arg max w f (x. We assume that score ties are broken in a predetermined way. k−1 The highest scoring sequence has score maxyL φ∗ (yL ). yk−1 . The Viterbi dynamic programming algorithm solves this problem for chain networks in O(L) time. yc ). The task of ﬁnding the most likely assignment. yj )φj (x. Let the highest score of any subsequence from 1 to k > 1 ending with value yk be deﬁned as φ∗ (yk ) = max k y1.
vl ).3: Diamond Markov network (added triangulation edge is dashed). vi+1 ) ∈ G.3. 1999]. Y3 ) or (Y2 . . In general. there are several important subclasses of networks that allow polynomial time inference. The critical property of a triangulation for the inference procedure is the size of the largest clique. distinct except that v0 = vl . The inference procedure creates a tree of cliques using the graph augmented by triangulation. like chains and trees. A chord of this cycle is an edge (vi . Recall that a cycle of length l in an undirected graph G is a sequence of nodes (v0 . 3. v1 . The treewidth of an untriangulated graph G is the minimum treewidth of all triangulations of G. We need the concept of triangulation (or chordality) to formally deﬁne treewidth. there are many possible sets of edges that can be added to triangulate a graph.3 (Treewidth of a graph) The treewidth of a triangulated graph G is the size of its largest clique minus 1. . STRUCTURED MODELS Figure 3. are triangulated since they contain no cycles..3. which are connected by edges (vi . Deﬁnition 3. .3. . we can add the edge (Y1 . To triangulate it. .32 CHAPTER 3.2 (Triangulated graph) An undirected graph G is triangulated if every one of its cycles of length ≥ 4 possesses a chord. MAP inference is NPhard [Cowell et al. Deﬁnition 3. The most important of these is the class of networks with low treewidth. Singlyconnected graphs. However. vj ) ∈ G between nonconsecutive nodes. In general Markov networks. The simplest untriangulated network is the diamond in Fig. Y4 ).
Y3 ) = φ2 (Y2 )φ3 (Y3 )φ12 (Y1 . We denote the leaves of the tree as Lv(T ) and the children of node c (relative to the root r) as Chr (c): φ∗ (yl ) = φl (x. Deﬁnition 3. yc ) c c ∈Chr (c) ∀l ∈ Lv(T ).4 (Junction tree) A junction tree T = (V. yc ∼yc max φ∗ (yc ). The inference procedure is based on a data structure called junction tree that can be constructed for a triangulated graph. Each of the original clique potentials must associated with exactly one node in the junction tree. ∀yc ∈ Yc . φ123 (Y1 .3 is 2. 1999]. the potentials for the {Y1 . Y4 } and {Y1 . c ∀c ∈ V(T ) \ Lv(T ). 3. yl ). The Viterbi algorithm for junction trees picks an arbitrary root r for the tree T and proceeds recursively from the leaves to compute the highest scoring subtree at a node by combining the subtrees with highest score from its children. E) for a triangulated graph G is a tree in which the nodes are a subset of the cliques of the graph.3.. Algorithms for constructing junction trees from triangulated graphs are described in detail in Cowell et al.4 shows a junction tree for the diamond network. Y3 ). the variables in the intersection c ∩ c are contained in the clique of every node of the tree on the (unique) path between c and c .3. Y4 )φ34 (Y3 . Y2 )φ23 (Y2 . Y2 . Y4 ). l φ∗ (yc ) = φc (x. Y3 . but good heuristic algorithms exist [Cowell et al. V ⊆ C(G) and the edges E satisfy the running intersection property: for any two cliques c and c . MARKOV NETWORKS 33 The treewidth of a chain or a tree is 1 and the treewidth of Fig. . The junction tree is an alternative representation of the same distribution that allows simple dynamic programming inference similar to the Viterbi algorithm for chains. 3. Fig. ∀yl ∈ Yl .3. [1999]. For example. Y3 . Y4 ) = φ1 (Y1 )φ4 (Y4 )φ14 (Y1 . Finding the minimum treewidth triangulation of a general graph is NPhard. Y3 . Y4 } nodes are the product of the associated clique potentials: φ134 (Y1 .
Although solving the MAP inference using a general LP solver is less efﬁcient than the dynamic programming algorithms above. Each of the original potentials is associated with a node in the tree. yc ). 3. this formulation is crucial in viewing Markov networks in a uniﬁed framework of the structured models we consider and to our development of common estimation methods in later chapters. Similar type of computations using the junction tree can be used to compute the partition function Zw (x) (by simply replacing max by ) as well as marginal probabilities P (yc x) for the cliques of the graph [Cowell et al.3 Linear programming MAP inference In this section.4: Diamond network junction tree. Note that this algorithm is exponential in the treewidth.3. yc ) = c. where yc ∼ yc denotes whether the partial assignment yc is consistent with the partial assignment yc on the variables in the intersection of c and c . the size of the largest clique. We represent an assignment as a set binary variables µc (yc ). The highest score is given by maxyr φ∗ (yr ). we can backr trace the highest scoring assignment itself. STRUCTURED MODELS Figure 3.yc µc (yc ) log φc (x. we present an alternative inference method based on linear programming. 1999]. such that: log c φc (x. that denotes whether the assignment has that value.. Let us begin with a linear integer program to compute the optimal assignment y. one for each clique c and each value of the clique yc . .34 CHAPTER 3. Using the arg max’s of the max’s in the computation of φ∗ .
. yc ) µc (yc ) = 1. Together. For example. s ⊂ c.5. we can deﬁne µc (yc ) variables that satisfy the above constraints by setting µc (yc ) = 1 c = yc ). yc (3. In fact.3.yc µc (yc ) log φc (x.5: Example of marginal agreement: row sums of µ12 (y1 . s. We can also show that converse is true: any I(y valid setting of µc (yc ) corresponds to a valid assignment y. as they correspond to the marginals of a distribution that has all of its mass centered on the MAP instantiation (assuming it is unique). ∀c ∈ C. Second. ∀yc . column sums agree with µ2 (y2 ). 1}. the assignment of the subclique. µs (ys ). First. these constraints deﬁne a linear integer program: max c. There are several elementary constraints that such marginals satisfy. MARKOV NETWORKS 35 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 Figure 3. y2 ) agree with µ1 (y1 ). the marginals for cliques that share variables are consistent. in case the network is a chain or a tree. 3. We call these variables marginals. µs (ys ) = yc ∼ys µc (yc ). Clearly.2) µc (yc ) ∈ {0. ∀c ∈ C. ∀s.t.3. must be consistent with the assignment of the clique. µc (yc ). c ∈ C. they must sum to one for each clique. ∀ys . for any assignment y . we will have node and edge marginals that sum to 1 and agree with each other as in Fig. For any clique c ∈ C and a subclique s ⊂ c.
(3. If the MAP assignment is not unique. with the following edge marginals that are consistent with the constraints: µ12 (0. Y3 . 0) = µ12 (1. The corresponding node marginals must all be set to 0. and any linear combination of the MAP assignments maximizes the LP. 3). A proof of this lemma appears in Wainwright et al. the diamond network in Fig. µ23 (0. µ14 (1. 0) = µ12 (0. 0) = µ23 (1. the integrality constraint in the integer program in Eq. Y4 } with their corresponding constraints.5. If we triangulate the graph and add the cliques {Y1 . 1) = 0. STRUCTURED MODELS Lemma 3. In Ch. 1) = 0. 2). In graphs where triangulation produces very large cliques.36 CHAPTER 3. Consider. µ12 (1. the value of the LP is the same as the value of the integer program. Note that the edge marginals for (1. the constraints force the marginals µc (yc ) to correspond to some valid joint distribution over the assignments. µ34 (1. we discuss another subclass of networks where MAP inference using LPs is tractable for any network topology. 1) = 0. In case the network is not triangulated. 3. 0) = µ14 (0. 0) = µ34 (1.5. 1) = 0. 0) = µ34 (0. the above marginals will be disallowed. 1) = 0. [2002]. µ14 (0.3 with binary variables. The optimal distribution with the respect to the objective puts all its mass on the MAP assignment. (3. We can resort to the above LP without triangulation as an approximate inference procedure (augmented with some procedure for rounding possibly fractional solutions). .5. the set of marginals is not guaranteed to represent a valid distribution. 7. Intuitively. 0) = µ23 (0. Y3 } and {Y1 . Y2 .3. 1) = 0. 4) disallow any assignment other than 0000 or 1111. 1) = 0. µ23 (1. exact inference is intractable.5. 4) disallows any assignment that has Y1 = Y4 . but the edge marginal for (1. Hence this set of marginals disallows all assignments. (2.5. but with a restricted type of potentials.2) can be relaxed and the resulting LP is guaranteed to have integer solutions. 1) = 0.5 For a triangulated network with unique MAP assignment. for example. µ34 (0. 0) = µ34 (1.
Fig. . The terminal symbols (leaves) are the words of the sentence.. 3. 1993]. NS ⊆ N 2 Any CFG can be represented by another CFG in CNF that generates the same set of sentences. where A. The nonterminal symbols (labels of internal nodes) correspond to syntactic categories such as noun phrase (NP). 1999]. This tree is from the Penn Treebank [Marcus et al.1 (CFG) A CFG G consists of: ◦ A set of nonterminal symbols.4 Context free grammars Contextfree grammars are one of the primary formalisms for capturing the recursive structure of syntactic constructions [Manning & Sch¨ tze. where all rules in the grammar are of the form: A → B C and A → D. For example.6 shows u a parse tree for the sentence The screen was a sea of red. Deﬁnition 3. N ◦ A designated set of start symbols.6: Example parse tree from Penn Treebank [Marcus et al.3. a primary linguistic resource for expertannotated English text. verbs (VBD).4. and D is a terminal symbol. we restrict our grammars to be in Chomsky normal form2 (CNF). 3. determiners (DT) and prepositions (IN). B and C are nonterminal symbols. CONTEXT FREE GRAMMARS 37 Figure 3. verbal phrase (VP) or prepositional phrase (PP) and partofspeech tags like nouns (NN). For clarity of presentation.4.. 1993].
B. rewriting the NP as NP → DT NN with DT → The and NN → cat. then rewriting the VP as VP → VBD NP with VBD → saw. from} ◦ PB = {S → NP VP. PU = {A → D : A ∈ N . The likely analysis of the sentence is that the cat. We can represent such derivations using trees like in Fig. PU }. P = {PB . It can also generate the same sentence several ways. VP. PP. again using NP → DT NN. An unlikely but possible alternative is that the cat . divided into Binary productions. saw the dog. IN} ◦ NS = {S} ◦ T = {The. VBD. D ∈ T }. VP → VBD NP. tree. NP. we can generate The cat saw the dog by starting with S → NP VP. The simple grammar above can generate sentences of arbitrary length. C ∈ N } and Unary productions. NN → cat. Consider the sentence The cat saw the dog from the tree. since it has several recursive productions. NP → NP PP. NN → dog. T ◦ A set of productions. NP → DT NN. dog. 3. DT → the. PP → IN NP}. ◦ PU = {DT → The. NN. NN → tree.38 CHAPTER 3. In general. For example. saw. but now with DT → the and NN → dog. the. IN → from} A grammar generates a sentence by starting with a symbol in NS and applying the productions in P to rewrite nonterminal symbols. DT. there are exponentially many parse trees that produce a sentence of length l.6 or (more compactly) using bracketed expressions like the one below: [[TheDT catNN ]NP [sawVBD [theDT dogNN ]NP ]VP ]S . Consider a very simple grammar: ◦ N = {S. sitting in the tree. VBD → saw. STRUCTURED MODELS ◦ A set of terminal symbols. VP → VP PP. PB = {A → B C : A. cat.
C:A→B C∈PB D:A→D∈PU P (A → D ) = 1. B.y)≤0 and describe the associated algorithm to compute the highest scoring parse tree y given a sentence x. . with the difference being in the analysis of the toplevel VP: [sawVBD [theDT dogNN ]NP ]VP [[fromIN [theDT treeNN ]NP ]PP . Standard PCFG parsers use a Viterbistyle algorithm to compute arg maxy P (x. y). Our grammar allows both interpretations. By letting our basis functions f (x. 9. sawVBD [[theDT dogNN ]NP [fromIN [theDT treeNN ]NP ]PP ]NP . we will show how to represent a parse tree as an assignment of variables Y with appropriate constraints to express PCFGS (and more generally weighted CFGs) in the form of Eq. y) as the most likely parse tree for a sentence x. The distribution P (x. CONTEXT FREE GRAMMARS 39 actually saw the dog who lived near the tree or was tied to it in the past. We also need to assign a probability to the different starting symbols P (A) ∈ NS such that A∈NS P (A) = 1. y : g(x. y) is deﬁned by assigning a probability to each production and making sure that the sum of probabilities of all productions starting with a each symbol is 1: P (A → B C) = 1.4. In Ch. A standard approach to resolving ambiguity is to use a PCFG to deﬁne a joint probability distribution over the space of parse trees Y and sentences X . Hence the logprobability of a tree is a sum of the logprobabilities of its productions. is very common in many realistic grammars. ∀A ∈ N .1) as hw (x) = arg max w f (x. This kind of ambiguity. y) consist of the counts of the productions and w be their logprobabilities. we can cast PCFG as a structured linear model (in log space).3. The probability of a tree is simply the product of probabilities of the productions used in the tree (times the probability of the starting symbol). called prepositional attachment. (3.
and that each reviewer be assigned at most P papers. scheduling. The bipartite matching problem can be solved using a combinatorial algorithm or the following linear program: max j. but in many others. We represent a matching with a set of binary variables yjk that take the value 1 if reviewer j is assigned to paper k.40 CHAPTER 3.t. For each paper and reviewer. 1976. In some domains. suppose we would like to have R reviewers per paper. Treated abstractly. routing.. edgecover. 1982. the weights of the objective function in the optimization problem are simple and natural to deﬁne (for example.5 Combinatorial problems Many important computational tasks are formulated as combinatorial optimization problems such as the maximum weight bipartite and perfect matching.3) µjk ≤ P. 0 ≤ µjk ≤ 1. together with a scoring scheme that assigns weights to candidate outputs is a kind of a model. consider modeling the task of assigning reviewers to papers as a maximum weight bipartite matching problem. More speciﬁcally. Cormen et al. STRUCTURED MODELS 3. we have an a weight qjk indicating the qualiﬁcation level of reviewer j for evaluating paper k. s. and many others [Lawler.k µjk qjk µjk = R. 1999]. job assignment. binpacking. spanning tree. These problems arise in applications such as resource allocation. such as matchings or graphcuts or trees). j k (3. where the weights represent the “expertise” of each reviewer for each paper. and 0 otherwise. Papadimitriou & Steiglitz. constructing the weights is an important and laborintensive design task. Euclidian distance or temporal latency). Our objective is to ﬁnd an assignment for reviewers to papers that maximizes the total weight. As a particularly simple and relevant example. a combinatorial space of structures. graphcut. network design and many more. 2001]. A simple scheme could measure the “expertise” as the percent of word . This LP is guaranteed to produce integer solutions (as long as P and R are integers) for any weights q(y) [Nemhauser & Wolsey. The quality of the solution found depends critically on the choice of weights that deﬁne the objective.
The maximum weight bipartite matching can be found in polynomial (cubic) time in the number of nodes in the graph using a combinatorial algorithm.3. y) is easier than the normalization problem y∈Y exp{w f (x. We can deﬁne fd (x. even simply counting the number of matchings is #Pcomplete [Valiant. we will represent the objective q(y) as a weighted combination of a set of basis functions w f (x. which is essentially weighted counting. This fact makes a probabilistic interpretation of the model as a distribution over matchings intractable to compute. just as it is for Markov networks for handwriting recognition.5. The space of bipartite matchings illustrates an important property of many structured spaces: the maximization problem arg maxy∈Y w f (x. Then the d words. exact maximum likelihood estimation is intractable. 1979]. In the next chapter we will show how to learn the parameters w in much the same way we learn the parameters w of a Markov network. Similarly. a weighted combination of overlapping the web page of a reviewer and the abstract of the paper that were matched in y. since it requires computing the normalization. Constructing and tuning the weights for a problem is a difﬁcult and timeconsuming process. However. the number of times word d was in both wd 1 I(wordd ∈ xjk ). . As usual. Note that counting is easier than normalization. we would want to weight certain words much more (words that are relevant to the subject and infrequent). Let xjk denote the intersection of the set of words occurring in webpage(j)∩abstract(k). Garey & Johnson. COMBINATORIAL PROBLEMS 41 overlap in the reviewer’s home page and the paper’s abstract. y)}. y). y) = score qjk is simply qjk = jk yjk 1 I(wordd ∈ xjk ). However. the web page of a reviewer j and the abstract of the paper k. 1979.
we describe at an abstract level two general approaches to structured estimation that we apply in the rest of the thesis. Second. y(i) )}m . A compact problem formulation is polynomial in the description length of the objective and the constraints. y : g(x. we can ﬁnd globally optimal parameters (with ﬁxed precision) in polynomial time. Although specialpurpose algorithms that exploit the structure of a particular problem are often much faster 42 . y). y) can be solved or approximated by a compact convex optimization problem for some convex subset of parameters w ∈ W.Chapter 4 Structured maximum margin estimation In the previous chapter. y) ≈ y(i) . ∀i. There are several reasons to derive compact convex formulations. First and foremost.y)≤0 (4. we develop methods for ﬁnding parameters w i=1 such that: arg max w f (x(i) .y)≤0 w f (x. we can use standard optimization software to solve the problem. In this chapter. we described several important types of structured models of the form: hw (x) = arg max w f (x. Given a sample S = {(x(i) .1) where we assume that the optimization problem maxy : g(x. y) ≤ 0}. y∈Y (i) where Y (i) = {y : g(x(i) . Both of these approaches deﬁne a convex optimization problem for ﬁnding such parameters w.
y∈Y (i) . (4. Such models include graph cuts and weighted matchings. Third.1 Minmax formulation Throughout. 4. MAXMARGIN ESTIMATION 43 (see Ch. We discuss how to use these approximate solutions for approximate learning of parameters. We will explore these and more general loss functions in the following chapters. such as Markov networks and contextfree grammars. a natural loss function is a kind of Hamming distance between y(i) and h(x(i) ): the number of variables predicted incorrectly.1 Maxmargin estimation As in the univariate prediction.1) is intractable. Our framework applies not only to the standard models typically estimated by probabilistic methods.1.1. 4. the loss is often not just the simple 01 loss or squared error. we consider convex programs that provide only an upper or lower bound on the true solution. we can analyze the generalization performance of the framework without worrying about the actual algorithms used to carry out the optimization and the associated woes of intractable optimization problems: local minima. In prediction problems where the maximization in Eq. we measure the error of approximation using a loss function . etc. where we are jointly predicting multiple variables. we will adopt the hinge upper bound i (h(x(i) )) on the loss function for structured classiﬁcation inspired by maxmargin criterion: i (h(x (i) )) = max [w fi (y) + i (y)] − w fi (y(i) ) ≥ i (h(x(i) )). 6). We provide exact maximum margin solutions for several of these problems (Ch. In structured problems. For structured classiﬁcation. the availability of offtheshelf software is very important for quick development and testing of such models. greedy and heuristic methods. 7 and Ch. but also to a wide range of “unconventional” predictive models.4. where maximum likelihood estimation is intractable. 10).
h(x(i) )). and show a strong connection between the lossscaled margin and expected risk of the learned model. 1 w2 + C 2 (i) ξi i y∈Y (i) (4. Another way to express this problem is using i Y (i)  linear constraints. This form reveals the “maximum margin” nature of the formulation. and fi (y) = f (x(i) . but assume this throughout this chapter.9) and Eq. ∀y ∈ Y (i) .2) is that the constraints have a very unwieldy form. the constraints enforce w fi (y(i) ) − w fi (y) ≥ i (y). Assuming ξi are all zero (say because C is very large). We can interpret 1 w w [fi (y(i) ) − fi (y)] as the margin of y(i) over another y ∈ Y (i) . the minmax formulation for structured classiﬁcation problem is analogous to multiclass SVM formulation in Eq. In Ch. (4. then the constraints make costly mistakes (those with high i (y)) less likely. min s. ∀i. the number of variables in yi . we did not explicitly include the constraint that the parameters are in some legal convex set (w ∈ W. The slack variables ξi allow for violations of the constraints at a cost Cξi .t. For brevity. The formulation in Eq. so minimizing w maximizes the smallest such margin.3) is a standard QP with linear constraints. but its exponential . scaled by the loss i (y). i (h(x(i) )) = (x(i) . most often IRn ).44 CHAPTER 4. With this upper bound. i (h(x(i) )) = (x(i) . The problem with Eq. 1 w2 + C 2 (i) ξi i (4. STRUCTURED MAXIMUM MARGIN ESTIMATION where as before. (4. y(i) . y). 5 we analyze the effect of nonuniform loss function (Hamming distance type loss) on generalization.10): min s. (2. If the loss function is not uniform over all the mistakes y = y(i) . ∀i.t. since maxy∈Y (i) [w fi (y) + i (y)] is convex in w (maximum of afﬁne functions is a convex function). y(i) . (2. which is generally exponential in Li . The above formulation is a convex quadratic program in w. h(x(i) )).3) w fi (y ) + ξi ≥ w fi (y) + i (y).2) w fi (y ) + ξi ≥ max [w fi (y) + i (y)].
(4. Likewise. µi ). The range of tractable losses will depend strongly on the problem itself (f and Y). some are more efﬁciently computable than others. we develop a maxmargin formulation that uses Lagrangian duality (see [Boyd & Vandenberghe. yjk ) = yjk 1 I(wordd ∈ xjk ). consider the example of the reviewerassignment problem we discussed in the previous chapter: we would like a bipartite matching with R reviewers per paper and at most P papers per reviewer.4. Note that maxµi :gi (µi )≤0 fi (w.1. The key to solving Eq. We can deﬁne a basis function fd (xjk . since Eq.5) y∈Y (i) µi :gi (µi )≤0 We call such formulation compact if the number of variables µi and constraints gi (µi ) is polynomial in Li . µi ) and subject to convex constraints gi (µi ): max [w fi (y) + i (y)] = max fi (w.2) and transform it to a a more manageable problem. (4. we can assume that it is feasible and bounded if Eq. Each training sample i consists of a matching of Np papers and Nr reviewers from some previous year. In the next section. which indicates whether the word d is (i) (i) . (4. µi ) must be convex in w.2) efﬁciently is the lossaugmented inference max [w fi (y) + i (y)]. 2004] for an excellent review) to deﬁne a joint. To make the symbols concrete. compact convex problem for estimating the parameters w. the number of variables in y(i) . Even within the range of tractable losses. (4.4) y∈Y (i) Even if maxy∈Y (i) w fi (y) can be solved in polynomial time using convex optimization. Assume that we ﬁnd such a formulation in terms of a set of variables µi . MAXMARGIN ESTIMATION 45 size is in general prohibitive. We now return to Eq. A large part of the development of structured estimation methods in the following chapters is identifying appropriate loss functions for the application and designing convex formulations for the lossaugmented inference.4) is. with a concave (in µi ) objective fi (w. the form of the loss term i (y) is crucial for the lossaugmented inference to remain tractable.4) is. Let yjk indicate whether reviewer j is matched to the paper k. (4. (4. Let xjk denote the intersection of the set of words occurring in the web page of a reviewer j and the abstract of the paper k.
jk ≤ 1.3) (without the constant term RNp ): max jk (i) µi. Fi . 0 ≤ µi. y) and g(x. (i) The last equality follows from the fact that any valid matching for example i has R reviewers for Np papers.jk = R.jk ≤ 1. Ai . For example.t.j µi. µi ) = RNp + and gi (µi ) ≤ 0 ⇔ j i.t. (i) In terms of Eq. (3. (4.jk ≤ P. (i) The lossaugmented inference problem can be then written as an LP in µi similar to Eq.46 CHAPTER 4.jk (yjk ) = jk (i) 1 jk = yjk ) = RNp − I(y jk (i) yjk yjk . which depend only on x(i) . 0 ≤ µi. y). If this LP is compact (the number of variables and constraints is polynomial in the number of .5). y) = jk [w f (xjk . We abbreviate the vector of all the basis functions for each edge jk as yjk fjk = f (xjk . j k (i) (i) s. µi. Note that the dependence on w is linear and only in the objective of the LP. In general. yjk ) + 0/1 i.jk = R. the Hamming loss simply counts the number of different edges in the matchings y and y(i) : H i (y) (i) (i) = jk 0/1 i. y(i) . fi and gi are afﬁne in µi : fi (w. ci . Combining the two pieces.6) for appropriately deﬁned di . when we can express maxy∈Y (i) w f (x(i) . k µi. STRUCTURED MAXIMUM MARGIN ESTIMATION in both the web page of a reviewer and the abstract of the paper that are matched in y. f (x. We assume that the loss function decomposes over the variables yij . hence RNp − (i) (i) jk yjk yjk represents exactly the number of edges that (i) are different between y and y(i) . (4.jk [w fjk − yjk ] µi. yjk ). Ai µi ≤ bi . we have w f (x(i) . µi ≥ 0.jk ≤ P. we have a linear program of this form for the lossaugmented inference: di + max (Fi w + ci ) µi s.jk [w fjk −yjk ] µi.jk (yjk )] (i) = RNp + jk yjk [w fjk − yjk ]. bi . y) as an LP and we use a loss function this is linear in the number of mistakes.
(4.9) where hi (w. λi ) for brevity.) Since the original problem had polynomial size. λi ) are convex in both w and λi . Since we assume that fi (w. λi ). 1 w2 + C 2 ξi i qi (w. Plugging Eq.6) is di + min bi λi s. For example.λi )≤0 (4. λi ) ≤ 0. hi (w. The Lagrangian associated with Eq. (4. ∀i. (4. λi ≥0 µi µi :gi (µi )≤0 For many forms of f and g. ξ}. one for each constraint function in gi (µi ). (We folded λi ≥ 0 into qi (w. we have strong duality: max fi (w.w (µi . the dual is polynomial size as well. λi ) and qi (w. (4.1.8) into Eq.4) is given by Li. λi ≥ 0. µi ) is concave in µi and bounded on the nonempty set µi : gi (µi ) ≤ 0. (4. λi ) ≤ 0 is {Fi w + ci − Ai λi ≤ 0.8) where hi (w.w (µi . λi ) = fi (w. we can write the Lagrangian dual minλi ≥0 maxµi Li. −λi ≤ 0}.4.t. w fi (y(i) ) + ξi ≥ Moreover. MAXMARGIN ESTIMATION 47 label variables). The . λi ) qi (w. λi ) = di + bi λi and qi (w.10) min hi (w. we can combine the minimization over λ with minimization over {w. λi ).t. (4. Ai λi ≥ Fi w + ci . we get min s. then we can use it to solve the maxmargin estimation problem efﬁciently by using convex duality.7) where λi ≥ 0 is a vector of Lagrange multipliers.2). (4. µi ) − λi gi (µi ). the dual of the LP in Eq. λi ) explicitly as: min s.w (µi . µi ) = min max Li.t.
1 w2 + C 2 ξi i (4. 2003]. λi ). Ai λi ≥ Fi w + ci . λi ) ≤ 0.t. ∀i. ∀i. STRUCTURED MAXIMUM MARGIN ESTIMATION reason for this is that if the right hand side is not at the minimum. ∀i. ξ} that is optimal. 4.11) w fi (y(i) ) + ξi ≥ hi (w. Intuitively. In some cases. ∀i. we assumed a compact convex formulation of the lossaugmented max in Eq. 1997. min s. but no polynomial formulation is known [Bertsimas & Tsitsiklis. (4.12) ∀i. though. Hence we have a joint and compact convex optimization program for estimating w. λi ≥ 0. . Both of these problems. just verifying that a given assignment is optimal is sometimes easier than actually ﬁnding it.1. qi (w.48 CHAPTER 4. w fi (y(i) ) + ξi ≥ di + bi λi . we have a QP with linear constraints: min s.2 Certiﬁcate formulation In the previous section.t. we can ﬁnd a compact certiﬁcate of optimality that guarantees that y(i) = arg maxy [w fi (y) + i (y)] without expressing lossaugmented inference as a compact convex program. maximum weight perfect (nonbipartite) matching and spanning tree problems can be expressed as linear programs with exponentially many constraints. the constraint is tighter than necessary.4). 1 w2 + C 2 ξi i (4. There are several important combinatorial problems which allow polynomial time solution yet do not have a compact convex optimization formulation. For example. Optimizing jointly over λ as well will produce a solution to {w. For our LPbased example. however. can be solved in polynomial time using combinatorial algorithms. The exact form of this program depends strongly on f and g. leading to a suboptimal solution w. Schrijver.
and minimizes the complexity .t. Expressing the spanning tree optimality does not require additional variables νi .4. In the spanning tree problem.j k + i. ∀y ∈ Y (i) . νi ) ≤ 0 ⇔ w fi (y(i) ) ≥ w fi (y) + i (y). MAXMARGIN ESTIMATION 49 Consider the maximum weight spanning tree problem. but in other problems.13) ∀i. k ∈ Vk [jk]. (4.jk for some basis functions f (xjk . such auxiliary variables are needed. where V (i)  is the number of nodes in the graph for example i. jointly convex in w and auxiliary variables νi : ∃νi s.j k i. Essentially. qi (w. such as in perfect matching optimality in Ch. (4.. Note that this formulation does not allow for violations of the margin constraints (it has no slack variables ξi ). 2001]. Vk [jk]). k ) in the graph with j ∈ Vj [jk]. k) is larger than (or equal to) the weight of any other edge (j .jk ≥ w fi. (i) Then the optimality conditions are: (i) . We discuss the conditions for optimality of perfect matchings in Ch. suppose yjk encodes whether edge (j.t. yjk ). j k s. We also assume that the loss function decomposes into a sum of losses over the edges. k) is in the tree and the score of the edge is given by w fi. If the basis functions are not sufﬁciently rich to ensure that each y(i) is optimal. k) in the tree connecting Vj [jk] and Vk [jk].t. k ∈ Vk [jk] [Cormen et al. we have V (i) 3 ) constraints for each example i. this formulation requires that the upper bound on the empirical risk be zero. yjk = 1. Then the following joint convex program in w and ν computes the maxmargin parameters: min s. 1 w2 2 qi (w. with loss for each wrong edge given by w fi. 10. then Eq.jk . A basic property of a spanning tree is that cutting any edge (j.1. A spanning tree is optimal with respect to a set of edge weights if and only if for every edge (j. j ∈ Vj [jk]. 10. νi ). For a full graph.1.2) may be infeasible. νi ) ≤ 0. Suppose that we can ﬁnd a compact convex formulation of these conditions via a polynomial (in Li ) set of functions qi (w. RS [hw ] = 0. k) in the tree creates two disconnected sets of nodes (Vj [jk]. the weight of (j. where j ∈ Vj [jk] and k ∈ Vk [jk]. ∀jk.
2 Approximations: upper and lower bounds There are structured prediction tasks for which we might not be able to solve the estimation problem exactly. y) that take into account additional information about x. these slack variables would not represent upper bounds on the loss as they are in the minmax formulation. Only a subset of those constraints will be active at the optimal solution w. (4. 4. The nature of these lower and upper bounds depends on the problem. we do not have to include all of them.2. but can only upper or lower bound it. However. If we continue adding constraints until there are no more violated ones. where we have an exponential number of linear constraints.50 CHAPTER 4. 4. the designer could add more basis functions f (x. we cannot compute maxy∈Y (i) [w fi (y) + i (y)] exactly or explicitly. since that is the number of variables. If the problem is infeasible. One could also add slack variables for each example and each constraint that would allow violations of optimality conditions with some penalty. Of course. We assume that we have an algorithm that produces y = arg maxy∈Y (i) [w fi (y) + . not more than the number of parameters n plus the number of examples m can be active in general. Fig.1 Constraint generation When neither compact maximization or optimality formulation is possible. In fact.1 shows schematically how approximating of the max subproblem reduces or extends the feasible space of w and ξ and leads to approximate solutions. 4.3). Often. one for each i and y ∈ Y (i) . we can resort to constraint generation or cutting plane methods. and therefore are less justiﬁed. If we can identify a small number of constraints that are critical to the solution. but we consider two general cases below. but the maximization problem can be solved or approximated by a combinatorial algorithm. Consider Eq. STRUCTURED MAXIMUM MARGIN ESTIMATION of the hypothesis hw as measured by the norm of the weights. the resulting solution is optimal. identifying these constraints is in general as difﬁcult as solving the problem. but a greedy approach of adding the most violated constraints often achieves good approximate solutions after adding a small (polynomial) number of constraints.
(4. In Fig. (4.3) and Eq. The only difference between Eq. where (i) is a user deﬁned precision parameter. for each example i. The algorithm terminates when no constraints are violated.2. ‘x’ and ‘o’ mark the different optima. At each iteration.4. w fi (y(i) ) + ξi ≥ w fi (y) + i (y). we solve the problem with a subset of constraints: min s. i (y)].14) is that Y (i) has been replaced by Y (i) . We then compute y = arg maxy∈Y (i) [w fi (y) + i (y)] for each i and check whether the constraint w fi (y(i) ) + ξi + ≥ w fi (y) + i (y). The solid red line represents the constraints imposed by the assignments y ∈ Y(i) .1.14) ∀i. The approximate constraints may coincide with the exact constraints in some cases. 4. terminating when the desired precision is reached. The algorithm is described in Fig. If it is violated.t. We note that if the algorithm that produces y = arg maxy∈Y (i) [w fi (y)+ i (y)] is . whereas the dashed and dotted lines represent approximate constraints. a small but growing set of assignments Y (i) ⊂ Y (i) . 4. We maintain. 1 w2 + C 2 ξi i (4. APPROXIMATIONS: UPPER AND LOWER BOUNDS 51 Upperbound Exact Lowerbound + × Figure 4. The parabolic contours represent the value of the objective function and ‘+’. we set Y = Y (i) ∪ y. ∀y ∈ Y (i) .1: Exact and approximate constraints on the maxmargin quadratic program. and be more stringent or relaxed in others. the lowerbound on the constraints provided by Y (i) ∪ y keeps tightening with each iteration.2. is violated.
For each i. if w fi (y(i) ) + ξi + ≤ w fi (y) + i (y). ∀y ∈ Y (i) .52 CHAPTER 4. Many such problems can be written as integer programs. we consider MAP inference in large treewidth Markov networks in Ch. 1 w2 + C 2 (i) ξi i w fi (y ) + ξi ≥ w fi (y) + i (y). 8. 1997.2: A constraint generation algorithm. Nemhauser & Wolsey. 1. Initialize: Y (i) = {}. The relaxation usually deﬁnes a larger feasible space Y (i) ⊃ Y (i) over . ∀ i. Set violation = 0 and solve for w and ξ by optimizing min s. 2. the approximation error of the solution we achieve might be much greater than . STRUCTURED MAXIMUM MARGIN ESTIMATION Input: precision parameter . 4. 2004] for a more indepth discussion of cutting planes methods. 1999]. then set Y (i) = Y (i) ∪ y and violation = 1 4. suboptimal. Relaxations of such integer programs into LPs.t. Return w.2 Constraint strengthening In many problems. QPs or SDPs often provide excellent approximation algorithms [Hochbaum. if violation = 1 goto 2. Figure 4. 7. multiway cut in Ch. 11. For example. Compute y = arg maxy∈Y (i) [w fi (y) + i (y)]. The number of constraints that must be added before the algorithm terminates depends on the precision and problem speciﬁc characteristics. 1997. See [Bertsimas & Tsitsiklis. while the maximization algorithm is comparatively fast. the maximization problem we are interested in may be very expensive or intractable. Boyd & Vandenberghe. 3.2. ∀i. but very large. This approach may also be computationally faster in providing a very good approximation in practice if the explicit convex programming formulation is polynomial in size. graphpartitioning in Ch.
1996. thereby driving up the corresponding slack ξi . the approximate constraints are tightened because of the additional invalid assignments. a solution to the MAP LP in Eq. Heuberger. (3. 2001. the approximate MAP solution has higher value than any integer solution. and a target solution yt . we will show experimentally that such approximations often work very well. which make the . for weights w for which the MAP approximation is integervalued. In practice. minimizing the objective tends to drive the weights w away from the regions where the solutions to the approximation are fractional. In this case. y∈Y (i) y∈Y (i) Hence the constraint set is tightened with such invalid assignments.3. RELATED WORK 53 which the maximization is done. In essence.4. intuitively. but (close to) optimal for the particular approximate maximization algorithm used. where y ∈ Y (i) may correspond to a “fractional” assignment.1 shows how the overestimate reduces the feasible space of w and ξ. For example. the margin has the standard interpretation as the difference between the score of y(i) and the MAP y (according to w). Ahuja & Orlin. By contrast. 1992. 2004]. the approximation is an overestimate of the constraints: max [w fi (y) + i (y)] ≥ max [w fi (y) + i (y)]. Note that for every setting of the weights w that produces fractional solutions for the relaxation. the estimation algorithm is ﬁnding weights that are not necessarily optimal for an exact maximization algorithm. 4. a set of nominal weights w0 . including the true assignment y(i) .2) for an untriangulated network may not correspond to any valid assignment.3 Related work Our maxmargin formulation is related to a body of work called inverse combinatorial and convex optimization [Burton & Toint. In such a case. 4. Zhang & Ma. Fig. An inverse optimization problem is deﬁned by an instance of an optimization problem maxy∈Y w f (y). The goal is to ﬁnd the weights w closest to the nominal w0 in some norm. As the objective includes a penalty for the slack variable.
2000. The agent collects a reward at each step. the inverse optimization problem attempts to match the behavior while not perturbing the “guesstimate” too much. then w = 0 is trivially the optimal solution. Provided educated guesses for the parameters w0 and the behavior of the system as a target. To map this problem (approximately) to our setting. which generally depends on the on the current and the next state and the action taken. The solution w depends critically on the choice of nominal weights. The environment is modeled as a system that can be in one of a set of discrete states. 1987] for indepth discussion of a wide range of applications). The study of inverse problems began with geophysical scientists (see [Tarantola. Moreover. Abbeel & Ng. we do not assume as given a nominal set of weights. Note that if we set w0 = 0. note that a policy roughly corresponds to the labels . ∀y ∈ Y. a state to action mapping) that maximizes its expected reward. Modeling a complex physical system often involves a large number of parameters which scientists ﬁnd hard or impossible to set correctly. Most of the attention has been on L1 and L∞ norms. w − w0 p w f (yt ) ≥ w f (y). the goals are very different than ours. but we brieﬂy describe the Markov decision process (MDP) model commonly used for sequential decision making problems where an agent interacts with its environment.54 CHAPTER 4. which is not appropriate in the learning setting. but L2 norm is also used. we are learning a parameterized objective function that depends on the input x and will generalize well in prediction on new instances. A rational agent executes a policy (essentially. In our framework. 2004] is much closer to our setting. the agent chooses an action from a discrete set of actions and the system transitions to a next state with a probability that depends on the current state and the action taken.t. At every time step. The goal is to learn a reward function that will cause a rational agent to act similar to the observed behavior of an expert. The inverse reinforcement learning problem [Ng & Russell. Although there is a strong connection between inverse optimization problems and our formulations. STRUCTURED MAXIMUM MARGIN ESTIMATION target solution optimal: min s. A full description of the problem is beyond our scope.
but produce accurate approximate prediction models in practice. minmax. (such as lowtreewidth Markov networks. 4. context free grammars. and does not require a normalized distribution P (y  x) over all outputs. certiﬁcate. maximum margin estimation can be formulated as a compact QP with linear constraints. only requires expressing optimality of a given assignment according to the model. This and related problems are formulated as a convex program in Ng and Russell [2000] and Abbeel and Ng [2004]. relies on the ability to express inference in the model as a compact convex optimization problem. 1979]. the state sequence correspond to the input x and the reward for a state/action sequence is assumed to be w f (x. y(i) ) of the expert such that the maximizing the expected reward according to the system model makes the agent imitate the expert. The goal is to learn w from a set of state/action sequences (x(i) . Similar results hold for nonbipartite matchings and mincuts. The ﬁrst formulation.4. y) for some basis functions w f (x. context free grammars. Because our approach only relies using the maximum in the model for prediction. to learn a probabilistic model P (y  x) over bipartite matchings using maximum likelihood requires computing the normalizing partition function. By contrast. and many combinatorial structures such as matchings and graphcuts. For example. The estimated parameters are then approximate.4 Conclusion In this chapter. 1979. When the prediction problem is intractable or very expensive to solve exactly. many other problems in which . Our framework applies to a wide range of prediction problems that we explore in the rest of the thesis.4. The second one. y). The estimation problem is tractable and exact whenever the prediction problem can be formulated as a compact convex optimization problem or a polynomial time combinatorial algorithm with compact convex optimality conditions. we resort to approximations that only provide upper/lower bounds on the predictions. In models that are tractable for both maximum likelihood and maximum margin. including Markov networks. we presented two formulations of structured maxmargin estimation that deﬁne a compact convex optimization problem. Garey & Johnson. which is #Pcomplete [Valiant. CONCLUSION 55 y. maximum margin estimation can be tractable when maximum likelihood is not.
2004. The range of applications of these principles is very broad and leads to estimation problems with very interesting structure in each particular problem. Maximum likelihood estimation with kernels results in models that are generally nonsparse and require pruning or greedy support vector selection methods [Lafferty et al. The forthcoming formulations in the thesis follow the principles laid out in this chapter. the solutions to the estimation are relatively sparse in the dual space (as in SVMs).56 CHAPTER 4.. . STRUCTURED MAXIMUM MARGIN ESTIMATION inference is solvable by dynamic programming). Because of the hingeloss. Altun et al.. our approach has an additional advantage. from Markov networks and contextfree grammars to graph cuts and perfect matchings. 2004]. which makes the use of kernels much more efﬁcient.
Part II Markov networks 57 .
whose nodes represent the different object labels.. neighboring pixels exhibit spatial label coherence in denoising. a Markov network for the hypertext domain would include a node for each webpage. the labels (letters) of adjacent inputs (images) are highly correlated.. and an edge between any pair of webpages whose labels are directly correlated (e. Such models are encoded by a graph. In proteomic analysis. compuu tational biology (gene ﬁnding. and whose edges represent and quantify direct dependencies between them. 1998. spatial. Boykov et al.. Taskar et al.g. In image processing. In hypertext or bibliographic classiﬁcation. 1998]).Chapter 5 Markov networks Markov networks are extensively used to model complex sequential. speech recognition. location and function of proteins that interact are often highly correlated [Vazquez et al. because one links to the other).. 1999a].. and many other ﬁelds. For example. 2002]. Sequential prediction problems arise in natural language processing (partofspeech tagging. sequence alignment [Durbin et al. 2003]. encoding its label. Markov networks compactly represent complex joint distributions of the label variables by modeling their local interactions. 1999]). information extraction [Manning & Sch¨ tze. These problems involve labeling a set of related objects that exhibit local consistency. labels of linked and cocited documents tend to be similar [Chakrabarti et al. and relational interactions in prediction problems arising in many ﬁelds. segmentation and stereo correspondence [Besag. 1986. protein structure prediction.. We address the problem of maxmargin estimation the parameters of Markov networks 58 . In sequential labeling problems (such as handwriting recognition).
For instance. 3. We focus on conditional Markov networks (or CRFs [Lafferty et al. y)} and w ∈ IRn . y) − log Zw (x). this mapping depends on the segmentation algorithm that determines how many letters the sample image contains and splits the image into individual images for each letter. Before we present the maximum margin estimation. In handwriting recognition.1. ﬁrstorder Markov chain or a higherorder models. We are given a labeled training sample S = {(x(i) . y). The objective is to minimize the training logloss with an additional regularization term. which represent P (y  x) instead of generative models P (x. for example. drawn from a ﬁxed disi=1 tribution D over X × Y. might be different for each example i. usually the squarednorm of the weights w [Lafferty et al. 2. The loglinear representation we have described in Sec. y): log Pw (y  x) = w f (x. 2001]: 1 w2 − C 2 1 log Pw (y(i)  x(i) ) = w2 + C 2 log Zw (x(i) ) − w fi (y(i) ). MAXIMUM LIKELIHOOD ESTIMATION 59 for such structured classiﬁcation problems.5.3.2. We analyze the theoretical generalization properties of maxmargin estimation and derive a novel marginbased bound for structured classiﬁcation.. Note that the topology and size of the graph G (i) . We show a compact convex formulation that seamlessly integrates kernels with graphical models. where Zw (x) = y exp{w f (x. We abbreviate G(x(i) ) as G (i) below. the training sequences might have different lengths. 2001]).1 is deﬁned via a vector of n basis functions f (x. 5. y(i) )}m . It also depends on the basis functions we use to model the dependencies of the problem. we review the standard maximum likelihood method.1 Maximum likelihood estimation The regularized maximum likelihood approach of learning the weights w of a Markov network is similar to logistic regression we described in Sec. We assume the structure of the network is given: we have a mapping from an input x to the corresponding Markov network graph G(x) = {V. E} where the nodes V map to the variables in y.. i i .
w [fi (y)] =  x(i) ) is the expectation under the conditional dis tribution Pw (y  x(i) ) and ∆fi (y) = f (x(i) . A standard approach is to use an approximate second order method that does not need to compute the Hessian.w [∆fi (y)]. even with millions of parameters w.w [fi (y)]. Boyd & Vandenberghe. Second order methods for solving unconstrained convex optimization problems. Since the basis functions decompose over the cliques of the network. 2003. The Hessian of the objective depends on the covariances of the basis functions: I +C i Ei. where Ei. since we need to calculate joint marginals of every pair of cliques c and c . so we have an unconstrained convex optimization problem.60 CHAPTER 5.. y). Let δfi (y) = fi (y) − Ei.w [fi (y)] − fi (y(i) ) = w − C i y∈Y fi (y)Pw (y Ei. we can use inference in the Markov network to calculate marginals Pw (yc  x(i) ) for each clique c in the network Sec. The gradient with respect to w is given by: w+C i Ei. require the second derivatives as well as the gradient. 3.2. Pw (yc∪c  xi ) as well as covariances of all basis functions. MARKOV NETWORKS where fi (y) = f (x(i) . 2003]. which is quadratic in the number of cliques and the number of functions. To compute the expectations. y(i) ) − f (x(i) .c (yc )Pw (yc  x(i) ). 2004]. Computing the Hessian is more expensive than the gradient.w [fi (y)] = (i) c∈C (i) yc ∈Yc fi. such as Newton’s method. the expectation decomposes as well: Ei.w δfi (y)δfi (y) . Pinto et al. . where I is a n × n identity matrix. Conjugate Gradients or LBFGS methods have been shown to work very well on large estimation problems [Sha & Pereira.3. This objective function is convex in the parameters w. as before. but uses only the gradient information [Nocedal & Wright. y). 1999.
Assumption 5. but the important difference is the loss function i . [2003]. yc ) = c c∈C(G (i) ) i.c (yc ) ≥ 0. ∀ys .3 how to express maxy w fi (y) as an LP. yc . yc µi.c (yc ) = 1.c (yc )] (5. w fi (y(i) ) + ξi ≥ max [w fi (y) + i (y)]. 3.c (yc ). ∀c ∈ C (i) . 3. The simplest loss is the 0/1 loss i (y) ≡ 1 (i) = y). where we are predicting multiple labels.2) µi. like the basis functions.s (ys ) = yc ∼ys µi. We will focus on decomposable loss functions below. ∀i. s.1) s. I(y (i) With this assumption. ∀c ∈ C (i) . in structured problems. µi. In general. However. ∀yc .3. we can express this inference problem for a triangulated graph as a linear program for each example i as in Sec.t.2. In fact I(y this loss for sequence models was used by Collins [2001] and Altun et al. .2 Maximum margin estimation For maximummargin estimation.3. A natural choice that we use in our experiments is the Hamming distance: H (x(i) .5. MAXIMUM MARGIN ESTIMATION 61 5.1: min 1 w2 + C 2 ξi i y (5.1 The loss function i (y) is decomposable: i (y) = c∈C(G (i) ) (i) (x(i) .2. 4. ∀i. y(i) . We know from Sec.c (yc )[w fi. the loss is often not just the simple 0/1 loss.c (yc ) + i. we assume that the loss. decomposes over the cliques of labels. c ∈ C (i) . but may depend on the number of labels and type of labels predicted incorrectly or perhaps the number of cliques of labels predicted incorrectly.c (yc ).yc µi. y) = v∈V (i) 1 v = yv ). we begin with the minmax formulation from Sec. s ⊂ c.t. ∀s.3: max c.
c variables correspond to the normalization constraints.c (yc ) = s⊂c. ys ∼yc mi.c mi.c.c . (5.c + ∀c ∈ C (i) . ∀c ∈ C (i) .c (yc ). we also introduce variables that capture the effect of all the agreement variables m: Mi. Plugging the dual into Eq.s. the λi. we have: min s. For readability. 1 w2 + C 2 ξi i (5. any convex combination of the assignments is a valid solution).1) for each example i and maximizing jointly over all the variables (w. ∀c ∈ C (i) .s. ∀yc .3) mi.c w fi (y(i) ) + ξi ≥ λi. If the most likely assignment is unique.c (yc ) − mi.t.c (yc ). then the distribution that maximizes the objective puts all its weight on that assignment.2) is given by: min c λi.62 CHAPTER 5. s⊂c.s. ∀i.s (ys ) − s⊃c mi. λi. (5.c + s⊃c mi. while mi.c (yc ) − s⊃c (5. ∀i. As we showed before. (5. ys ∼yc In order to gain some intuition about this formulation. ∀i. .c. ys ∼yc In this dual. ∀c ∈ C (i) .c (yc ) + i.s (ys ) ≥ w fi.c (yc ) + ξi.c : (i) λi.c (yc ) + i. s.s (yc ) variables correspond to the agreement constraints in the primal in Eq. ξ.2). ∀yc .4) λi. s⊂c. ∀yc . we make a change of variables from λi.c. MARKOV NETWORKS where C (i) = C(G (i) ) are the cliques of the Markov network for example i.c . The reason for naming the new variables using the letter ξ will be clear in the following. The dual of Eq.s (ys ) ≥ w fi.c.c (yc ). (If the arg max is not unique.t. the constraints ensure that the µi ’s form a proper distribution. i.c = w fi.c to ξi. λ and m).
c (yc ) + ξi.c (yc ) + i. Hence we can simply eliminate c ξi.c (yc ).c and mi. ∀i.s variables. (i) w fi. The mi. 1 w2 + C 2 ξi ≥ c (i) w fi. ∀c ∈ C (i) . Mi.c at the optimum. since the slack variable ξi only appears only in the and the objective minimizes Cξi .s.c (yc ).c (yc ) + ξi.c (yc )]. for each clique: min s.c (yc ) (5.2. ∀c ∈ C (i) .c (yc ) = s⊂c.c (yc ) + Mi. ys ∼yc mi. ∀c ∈ C (i) .c (yc ) (5.t. ∀i. Note that ξi = constraint ξi ≥ c ξi.c.c. ∀yc . (5.c i. ∀i.c (yc ) ξi i (5.c (yc ) = s⊂c. ∀yc .c this set of variables: min s.t. ∀c ∈ C (i) . ∀yc .c (yc ) + ξi.s (ys ) variables correspond to a certain kind of messages between cliques that distribute “credit” to cliques to fulﬁll this margin requirement from other cliques which have sufﬁcient margin. Finally. ∀yc .c i. but deﬁned at a local level. ∀i. ∀i.s (ys ) − s⊃c mi.7) + Mi.t. ∀c ∈ C (i) .c .c i.s. Note that without Mi.c (yc ).5.c.s (ys ) − s⊃c mi. 1 w2 + C 2 ξi.c ≥ max [w fi. ∀i. 1 w2 + C 2 ξi.5) ξi.1). ys ∼yc mi. or a margin requirement. + Mi. we can write this in a form that resembles our original formulation Eq.c ≥ w fi. ys ∼yc mi.6) + Mi. . MAXIMUM MARGIN ESTIMATION 63 With these new variables.c (yc ). (i) w fi.s (ys ) − s⊃c mi.c yc i. we essentially treat each clique as an independent classiﬁcation problem: for each clique we have a hinge upperbound on the local loss.c.c (yc ) = s⊂c.c (yc ). ∀i. ∀c ∈ C (i) . we have: min s.c (yc ) + Mi. ∀yc .c.s.c ≥ w fi.
I(y w f3 (y3 ) + ξ3 ≥ w f3 (y3 ) + 1 3 = y3 ) − m3. ∀y5 . 5.12 (y2 ) − m2. MARKOV NETWORKS Figure 5.34 (y3 ). I(y w f4 (y4 ) + ξ4 ≥ w f4 (y4 ) + 1 4 = y4 ) − m4.23 (y3 ) − m3.23 (y2 ).1. I(y (∗) (∗) (∗) (∗) (∗) (∗) (∗) (∗) (∗) (∗) .45 (y5 ). ∀y3 . ∀y1 . ∀y2 . I(y w f2 (y2 ) + ξ2 ≥ w f2 (y2 ) + 1 2 = y2 ) − m2.64 CHAPTER 5. below we use the Hamming j (yj ) (i) .1: Firstorder chain shown as a set of cliques (nodes and edges). As an example. The set of cliques consists of the ﬁve nodes and the four edges.45 (y4 ). The ﬁgure shows the local slack variables ξ and messages m between cliques for this sample. The constraints associated with the node cliques in this sequence are: w f1 (y1 ) + ξ1 ≥ w f1 (y1 ) + 1 1 = y1 ) − m1. For concreteness.34 (y4 ) − m4. consider the ﬁrstorder Markov chain in Fig. we drop the dependence on the sample index i in the indexing of the variables (we also used yj loss H (∗) instead of yj below). I(y w f5 (y5 ) + ξ5 ≥ w f5 (y5 ) + 1 5 = y5 ) − m5.12 (y1 ). ∀y4 . Also shown are the corresponding local slack variables ξ for each clique and messages m between cliques. which decomposes into local terms = 1 j = yj ) for each node and is I(y (∗) zero for the edges. Suppose for the sake of this example that our training data consists of only one training sample. For brevity of notion in this example.
3 M3N dual and kernels In the previous section. y2 ) + ξ12 ≥ w f12 (y1 . w f34 (y3 . 2 αi (y)∆fi (y) i. ∀y1 . we develop an alternative dual derivation that provides a very interesting interpretation of the problem and is a departure for specialpurpose algorithms we develop.3. so that they sum .5. We make two small transformations to the dual that do not change the problem: we normalize α’s by C (by letting αi (y) = Cαi (y)). ∀i. w f23 (y2 . y4 . In the dual. where ∆fi (y) ≡ f (x(i) .34 (y4 ). y5 ) + m4. ∀y4 . y3 . ∀y2 . the exponential number of αi (y) variables correspond to the exponential number of constraints in the primal.8) w ∆fi (y) ≥ i (y) − ξi .12 (y1 ) + m2. (∗) (∗) (∗) (∗) (∗) (∗) (∗) (∗) 5.23 (y2 ) + m3. y3 ) + ξ23 ≥ w f23 (y2 . y). y. (4. ∀i. y4 ) + m3.23 (y3 ).3): min s. ∀y3 . y αi (y) ≥ 0.t.45 (y5 ).y (5. w f45 (y4 . In this section. y3 ) + m2.t. The dual is given by: max i. y4 ) + ξ34 ≥ w f34 (y3 . y5 ) + ξ45 ≥ w f45 (y4 .y 1 αi (y) i (y) − 2 αi (y) = C. y5 . y(i) ) − f (x(i) . y2 ) + m1. 1 w2 + C 2 ξi i (5. M3 N DUAL AND KERNELS 65 The edge constraints are: w f12 (y1 . y.45 (y4 ) + m5.34 (y3 ) + m4.9) s. ∀i. We begin with the formulation as in Eq. y2 .12 (y2 ). we showed a derivation of a compact formulation based on LP inference.
10) in terms of these marginal dual variables. .yc i. y αi (y) ≥ 0. Our main insight is that the variables αi (y) in the dual formulation Eq.t. y. Consider. ∀y. MARKOV NETWORKS to 1 and divide the objective by C. we only need clique marginals of the distribution αi (y) to compute their expectations. We deﬁne the marginal dual variables as follows: µi.c (yc ). for example.11) where y ∼ yc denotes whether the partial assignment yc is consistent with the full assignment y .c (yc ) and ∆fi (y) = c ∆fi.10) s.c (yc ) decompose over the cliques of the Markov network. ∀c ∈ C (i) . As in multiclass SVMs. (5.c (yc ) variables is small (polynomial) compared to the number of αi (y) variables (exponential) if the size of the largest clique is constant with respect to the size of the network.c (yc ) y ∼yc αi (y ) = c.c (yc ) = c. Since i (y) = c i.y 1 αi (y) i (y) − C 2 αi (y) = 1. This dual distribution does not represent the probability that the model assigns to an instantiation. the solution to the dual α gives the solution to the primal as a weighted combination: w∗ = C i. The dual objective is a function of expectations of i (y) and ∆fi (y) with respect to αi (y). Note that the number of µi.y (5. since they lie in the simplex αi (y) = 1.yc µi. ∀yc . but the importance of the constraint associated with the instantiation to the solution. Now we can reformulate our entire QP (5. ∀i. ∀i. ∀i. y αi (y) ≥ 0.c (yc ) = y ∼yc αi (y ). The resulting dual is given by: max i. (5.c (yc ) i.10) can be interpreted as a kind of distribution over y.66 CHAPTER 5. the ﬁrst term in the objective function (ﬁxing a particular i): αi (y) i (y) = y y αi (y) c i.y ∗ αi (y)∆fi (y). 2 αi (y)∆fi (y) i.
What is its range. ∀ys . when all G (i) are triangulated. µ∈R[M] α∈D[M] Hence we must ensure that µi corresponds to some distribution αi . that is.10): max i. is the product of simplices for all the m examples.c (yc ) i.yc (5. i.3. but there is a continuum of distributions consistent with a set of marginals. ∀i. The solution to the structured dual µ∗ gives us the primal solution: w∗ = C i. M3 N DUAL AND KERNELS 67 The decomposition of the second term in the objective is analogous.s (ys ) = yc ∼ys µi. the α distribution is not unique.11) .c (yc ) y ∼yc αi (y ) = c.5. which is exactly what the constraints in the LP for MAP inference enforce (see discussion of Lemma 3.c (yc ).c (yc ). but do not make a commitment about what it is. αi (y)∆fi (y) = y c.yc ∆fi. µi.c (yc ). ∀c ∈ C (i) .c. (5.c.yc µ∗ (yc )∆fi. where M denotes the marginalization operator deﬁned by Eq.t. Note that it only depends on αi (y) through its marginals µi. ∀i.c (yc ) i.10) as Q(α).c. D[M].c (yc ) = 1. Let us denote the the objective of Eq.yc 1 µi. the following structured dual QP has the same primal solution (w∗ ) as the original exponential dual QP in Eq. (5.c (yc )∆fi. Q(α) = Q (M(α)).c In this structured dual.12) s.yc µi. R[M]. s ⊂ c. c ∈ C (i) .5). the set of legal marginals? Characterizing this set (also known as marginal polytope) compactly will allow us to work in the space of µ’s: max Q(α) ⇔ max Q (µ).3. The domain of this operator.c (yc ) − C 2 2 µi.c (yc )∆fi. Therefore. ∀i. we only enforce that there exists an αi consistent with µi . yc µi. ∀s. In general. (5. The objective of .c (yc ).c (yc ) ≥ 0. ∀yc . µi. ∀c ∈ C (i) .
68 CHAPTER 5. however. by convention 0/0 ≡ 0. 6. we use a ¯ polynomial kernel on the pixel values for the node cliques. c ¯ ¯ ¯ ¯ ¯ c c (j) (j) (j) Hence. The maximumentropy distribution αi consistent with a set of marginals µi . I(y ¯ ¯ ¯ ¯ Of course. (5. (i) (j) . e. Kernels are typically deﬁned on the input. (5. k(xc . In our handwriting example. yc )]. (5. s∈S (i) µi. We denote the set of separators as S (i) .c (yc ) ∆fj.. associated with each edge (c. 1999]. Hence. since it is a subclique of a larger clique. yc )] [f (xc .12) can be expressed in terms of dot products between local basis functions (i) ∆fi. each logpotential in the network “remembers” only a small proportion of the relevant training data inputs. yc ) − f (x(i) . Now we can deﬁne the maximumentropy distribution αi (y) as follows: αi (y) = Again. the solutions to the maxmargin QP are typically sparse in the µ variables. Speciﬁcally.¯(yc ) = [f (x(i) .12) efﬁciently.13) Kernels Note that the solution is a weighted combination of local basis functions and the objective of Eq. xc ). Note that each separator s and complement of a separator c \ s is also a clique of the original graph. c ) in the tree T (i) is a set of variables called the separator s = c ∩ c . xc ). yc ) ≡ 1 c = yc )k(xc .c (yc ) . yc ) − f (xc . c∈T (i) µi. MARKOV NETWORKS the QP Eq. we can locally kernelize our models and solve Eq. We usually extend the kernel over the input space to the joint input and output space by simply deﬁning f (xc .g.2 we experiment with several kernels for the handwriting example. In Sec. yc ) f (xc .s (ys ) (5. other deﬁnitions are possible and may be useful when the assignments in each clique yc have interesting structure. As in SVMs.10) does not distinguish between these distributions. since it only depends on their marginals. is unique for a triangulated model and can be computed using the junction tree T (i) for the network [Cowell et al.
y1 ∀y2 . y3 ) = µ12 (y1 . y3 . y3 ). For example. .2: Diamond Markov network (added triangulation edge is dashed and threenode marginals are in dashed rectangles).4 Untriangulated models If the underlying Markov net is not chordal. y2 ). adding ﬁllin edges to ensure triangulation. y3 µ134 (y1 .5. they do not add any new basis functions nor change the objective function. y3 . Y3 . y3 . Y3 and Y1 . y4 . y3 The new marginal variables appear only in the constraints. 5. y3 ). we can triangulate the graph by adding an arc Y1 —Y3 . y1 µ134 (y1 . y4 ) = µ13 (y1 . y3 . y2 . y2 . y4 ) = µ34 (y3 . y4 ). ∀y1 .4. µ123 (y1 . 5. Y4 and the corresponding marginals.2. UNTRIANGULATED MODELS 69 Figure 5. y2 . y2 . that is. y3 ) = µ23 (y2 . y3 . we must address the problem by triangulating the graph. This will introduce new cliques Y1 . Y2 . We can then use this new graph to produce the constraints on the marginals: µ123 (y1 . µ123 (y1 . if our graph is a 4cycle Y1 —Y2 —Y3 —Y4 —Y1 as in Fig. ∀y3 . ∀y1 . y3 ) and µ134 (y1 . y4 ).
12) deﬁned by an untriangulated graph. we show a generalization bound for the task of structured classiﬁcation that allows us to relate the error rate on the training set to the generalization error. we can still solve the QP in the structured primal Eq. the learned parameters produce very accurate approximate models in practice. Unfortunately. (5. Note that we could also strengthen the untriangulated relaxation without introducing an exponential number of constraints. optimizes our objective only over a relaxation of the marginal polytope. which enforces only local consistency of marginals. (5. For instance.70 CHAPTER 5. For example. The approximate QP does not guarantee that the learned model using exact inference minimizes the true objective: (upperbound on) empirical risk plus regularization. However. the number of constraints introduced is exponential in the number of variables in the new cliques — the treewidth of the graph. they are often much more expensive. To the best . which tend to improve the approximation of the marginal polytope. But do we really need these optimal parameters if we cannot perform exact inference? A more useful goal is to make sure that training error is minimized using the approximate inference procedure via the untriangulated LP. Such a formulation. where 100% accuracy is achievable on the training data by some parameter setting w such that approximate inference (using the untriangulated LP) produces integral solutions.6) or the structured dual Eq. consider the separable case. 8 demonstrate. even sparsely connected networks. We conjecture that the parameters learned by the approximate QP in fact do that to some degree. 5. have large treewidth. as experiments in Ch.5 Generalization bound In this section. we can add positive semideﬁnite constraints on the marginals µ used by Wainwright and Jordan [2003]. for example 2D grids often used in image analysis. MARKOV NETWORKS In general. However. Although this and other more complex relaxations are a very interesting area of future development. the formulation trades off fractionality of the untriangulated LP solutions with complexity of the weights w2 . Solving the problem as C → ∞ will ﬁnd this solution even though it may not be optimal (in terms of the norm of the w) using exact inference. For C in intermediate range.
Consider a ﬁrstorder sequence . As in other generalization bounds for marginbased classiﬁers. it picks from all y which are better when helped by γ H (y. y) ≤ Lγ (w. y ). y ). and Rc be an upperbound on the 2norm of clique basis functions.5.To state the bound. y) = max 1 f (y ) L H y : w f (y)≤w (y. it is adversarial: it picks from all y which are better (w f (y) ≤ w f (y )). x. GENERALIZATION BOUND 71 of our knowledge. Let Nc be the maximum number of cliques in G(x). Consider an upper bound on the above loss: L(w. y ) + H (y. We can now deﬁne a γmargin perlabel loss: L(w. We can now prove that the generalization accuracy of any hypothesis w is bounded by its empirical γmargin perlabel loss. Our goal in structured classiﬁcation is often to minimize the number of misclassiﬁed labels.5. x. x. x. y )].y ) L H y : w f (y)≤w f (y )+γ (y. This upper bound is tight if y = arg maxy w f (x. one that maximizes the Hamming distance from y. this bound is the ﬁrst to deal with structured error. we need to deﬁne several other factors it depends upon. plus a term that grows inversely with the margin. as we detail below. one that maximizes the Hamming distance from y. Otherwise. or the Hamming distance between y and h(x). y) ≤ L(w. arg max w f (x. otherwise. Our analysis of Hamming loss allows to prove a signiﬁcantly stronger result than previous bounds for the 0/1 loss. x. we relate the generalization error to the margin of the classiﬁer. This upper bound is even more adversarial: it is tight if y = arg maxy [w f (x. y )). such as the Hamming distance. y ). Vc be the maximum number of values in a clique Yc . y) = max 1 H (y. Note that the loss we minimize in the maxmargin formulation is very closely related (although not identical to) this upper bound. An appropriate error function is the average perlabel loss L(w. x. y) = 1 L H (y. y where L is the number of label variables in y. y) ≤ L(w. q be the maximum number of cliques that have a variable in common. y ).
and m > 1 samples. the expected perlabel loss is bounded by: ED [L(w. However we propose a novel method for covering the space of structured prediction models by using a cover of the individual clique basis function differences ∆fi. 2001]. This new type of cover is polynomial in the number of cliques. Vc = V 2 because of the edge cliques. Finally. in OCR. y)] at high margin γ quantiﬁes the conﬁdence of the prediction model. and any δ > 0. 2002]. The second term depends on w/γ. Proof: See Appendix A. y)] ≤ ES [Lγ (w. with L as the maximum length. yielding signiﬁcant improvements in the bound. our bound has a logarithmic dependence on the number of cliques (ln Nc ) and depends only on the 2norm of the basis functions perclique (Rc ). if the number of instances is at least a constant times the length of a word). Speciﬁcally. there exists a constant K such that for any γ > 0 perlabel margin. then our bound is independent . Theorem 5. This is a signiﬁcant gain over the previous result of Collins [2001] for 0/1 loss. and depends on the joint 2norm of all of the basis functions for an example (which is ∼ Nc Rc ). the result provides a bound to the generalization error that trades off the effective complexity of the hypothesis space with the training error. The ﬁrst term upper bounds the training error of w. L m = O(1) (for example. Low loss ES [Lγ (w. which corresponds to the complexity of the classiﬁer (normalized by the margin level). for sequences. Such a result was. x. Thus. with probability at least 1 − δ.1 For the family of hypotheses parameterized by w. MARKOV NETWORKS model as an example. and currentnext edge clique. and q = 3 since nodes in the middle of the sequence participate in 3 cliques: previouscurrent edge clique. x.72 CHAPTER 5. The proof uses a covering number argument analogous to previous results in SVMs [Zhang. y)] + 2 K Rc w2 q 2 1 [ln m + ln Nc + ln Vc ] + ln m γ2 δ .c (yc ). until now.5.1 for the proof details and the exact value of the constant K. x. and V the number of values a variable takes. note that if of the number of labels L. an open problem for marginbased sequence classiﬁcation [Collins. which has linear dependence (inside the square root) on the number of nodes (L). Then Nc = 2L − 1 since we have L node cliques and L − 1 edge cliques. node clique.
but it sufﬁces to say that our original decomposition of the maxmargin QP was inspired by the proposed technique to transform an exponential set of constraints into a polynomial one using a triangulated graph. By considering the more natural Hamming loss. the bound does not explicitly depend on the length of the sequence. In addition. His generalization bound (for 0/1 loss) based on the SVMlike margin. RELATED WORK 73 5. The work of Lafferty et al. [2003] presents LP decompositions based on graphical model structure for the value function approximation problem in factored MDPs (Markov decision processes with structure). In a followup paper. [2004] show that only a polynomial number of constraints are needed to be generated to guarantee a ﬁxed level of precision of the solution.6 Related work The application of marginbased estimation methods to parsing and sequence modeling was pioneered by Collins [2001] using the VotedPerceptron algorithm [Freund & Schapire. It also depends on the joint 2norm of all of the basis functions for an example (which is ∼ Nc Rc ).1 to problems natural language processing. However. Describing the exact setting is beyond our scope. He provides generalization guarantees (for 0/1 loss) that hold for separable case and depend on the number of mistakes the perceptron makes before convergence. Collins [2004] also suggested an SVMlike formulation (with exponentially many constraints) and a constraint generation method for solving it. computational biology. Altun et al. Tsochantaridis et al.2. the corresponding problem needs to be resolved (or at least approximately resolved) after each additional constraint is added.5. we achieve a much tighter analysis. which is prohibitively expensive for large number of examples and label variables. has linear dependence (inside the square root) on the number of nodes (L). however. [2003] have applied the exponentialsize formulation with constraint generation we described in Sec. There has been a recent explosion of work in maximum conditional likelihood estimation of Markov networks. the number of constraints in many important cases is several orders higher (in L) than in the the approach we present. [2001] has inspired many applications in natural language. The work of Guestrin et al. computer vision and relational modeling [Sha . Remarkably. 1998]. 4.6. although undoubtedly the number of mistakes does.
.7 Conclusion We use graph decomposition to derive an exact.. Taskar et al. We also use approximate graph decomposition to derive a compact approximate formulation for Markov networks in which inference is intractable. convex maxmargin formulation for Markov networks with sequence and other lowtreewidth structure.. 2002. 2003. the solutions are nonsparse and the proposed algorithms are forced to use greedy selection of support vectors or heuristic pruning methods. we present an efﬁcient algorithm that exploits graphical model inference and show experiments on a large handwriting recognition task that utilize the powerful representational capability of kernels. 2004. 2003b]. compact.. Our formulation avoids the exponential blowup in the number of constraints in the maxmargin QP that plagued previous approaches. Sutton et al. Kumar & Hebert. 2003. MARKOV NETWORKS & Pereira. We provide theoretical guarantees on the average perlabel generalization error of our models in terms of the training set margin. In the next chapter.. Pinto et al.74 CHAPTER 5. Lafferty et al. The seamless integration of kernels with graphical models allows us to create very rich models that leverage the immense amount of research in kernel design and graphical model decompositions. Taskar et al. Our generalization bound signiﬁcantly tightens previous results of Collins [Collins. 2004. 2003. 5.. However.. 2004]. 2001] and suggests possibilities for analyzing perlabel generalization properties of graphical models. As in the case of logistic regression. maximum conditional likelihood estimation for Markov networks can also be kernelized [Altun et al.
w ∆fi (y) ≥ (y) − ξi . the problem is often too large even for small training sets. for standard QP solvers.t. As we describe below. The KKT conditions [Bertsekas.y 1 αi (y) i (y) − C 2 αi (y) = 1. ∀i. we use a coordinate dual ascent method analogous to the sequential minimal optimization (SMO) used for SVMs [Platt.12) is polynomial in the size of the data. αi (y)∆fi (y) i. s.1 Solving the M3N QP Let us begin by considering the primal and dual QPs for multiclass SVMs: 2 1 min w2 + C 2 ξi i max i.y s. 1999]. We show that our models signiﬁcantly outperform other approaches by incorporating highdimensional decision boundaries of polynomial kernels over character images while capturing correlations between consecutive characters. Instead. these conditions have certain locality with respect to each example i. Boyd & Vandenberghe. ∀i. (5. We apply our M3 N framework and structured SMO algorithm to a handwriting recognition task. y. which allows us to perform 75 . 2004] provide sufﬁcient and necessary criteria for optimality of a dual solution α. 6. unfortunately. y αi (y) ≥ 0. ∀i. y.t. 1999.Chapter 6 M3N algorithms and experiments Although the number of variables and constraints in the structured dual in Eq.
αi (y) > 0 ⇒ w ∆fi (y) = i (y) − ξi . (6. A feasible dual solution α and a primal solution deﬁned by: w = C i. however. we will enforce KKT conditions up to a given tolerance 0 < αi (y) = 0 ⇒ vi (y) ≤ vi (y) + . y To simplify the notation. αi (y) can be nonzero only if vi (y) is at most smaller than the all others.76 CHAPTER 6. y (KKT1) (KKT2). With these deﬁnitions. M3 N ALGORITHMS AND EXPERIMENTS the search for optimal α by repeatedly considering one example at a time. are optimal if they satisfy the following two types of constraints: αi (y) = 0 ⇒ w ∆fi (y) > i (y) − ξi . Essentially. Note that the normalization constraints on the dual variables α are local to each example i. αi (y) > 0 ⇒ vi (y) ≥ vi (y) − . This allows us to perform dual blockcoordinate ascent where a block corresponds to . (KKT1) (KKT2) αi (y) > 0 ⇒ w fi (y) + i (y) = max [w fi (y ) + i (y )]. 1. we deﬁne vi (y) = w fi (y) + i (y). (KKT2). We can express these conditions as αi (y) = 0 ⇒ w fi (y) + i (y) < max [w fi (y ) + i (y )].2) vi (y) = max [w fi (y ) + i (y )]. Con versely. αi (y) can be zero only if vi (y) is at most larger than the all others. (KKT1) αi (y) > 0 ⇒ vi (y) ≥ vi (y). we have αi (y) = 0 ⇒ vi (y) < vi (y).1) ξi = max [ i (y) − w∆fi (y)] = max [ i (y) + w fi (y)] − w fi (y (i) ). y =y In practice.y y αi (y)∆fi (y) y (6.
Find feasible αi such that Q(αi . Initialize: αi (y) = 1 = y (i) ). When optimizing with respect to a single block i. the objective function can be split into two terms: Q(α) = Q(α−i ) + Q(αi .1. the vector of dual variables αi for a single example i. 5.y αj (y)∆fj (y) . . Set violation = 0. ∀ i. I(y 2. α−i ) matters for optimizing with respect to αi . If violation = 1 goto 2. α−i ) > Q(αi .6. SOLVING THE M3 N QP 77 1.1 is essentially coordinate ascent on blocks αi . maintaining the feasibility of the dual. Checking the constraints requires computing w and ξ from α according to Eq.y y 1 λ(y) i (y) − C 2 2 λ(y)∆fi (y) + y j. Let αi (y) = αi (y) + λ(y). The general form of blockcoordinate ascent algorithm as shown in Fig.1).1: Blockcoordinate dual ascent. If αi violates (KKT1) or (KKT2). 6. (6. Set violation = 1. Note that y λ(y) = 0 and αi (y) + λ(y) ≥ 0 so that αi is feasible. 6. y. Figure 6. where α−i denotes all dual αk variables for k other than i. As long as the local ascent step over αi is guaranteed to improve the objective when KKT conditions are violated. The algorithm starts with a feasible dual solution α and improves the objective blockwise until all KKT conditions are satisﬁed. 4. This allows us to focus on efﬁcient updates to a single block of αi at a time. α−i ). the algorithm will converge to the global maximum in a ﬁnite number of steps (within the precision). Only the second part of the objective Q(αi . α−i ) in terms of λ and α: αj (y) j (y) + j. For each i. We can write the objective Q(α−i ) + Q(αi . 3. 7. α−i ) and set αi = αi .
M3 N ALGORITHMS AND EXPERIMENTS By dropping all terms that do not involve λ. αi (y ) − δ ≥ 0. We address a strategy for selecting the two variables in the next section. 1 [vi (y ) − vi (y )]δ − Cfi (y ) − fi (y )2 δ 2 2 αi (y ) + δ ≥ 0.78 CHAPTER 6.3) . but for now assume we have picked λ(y ) and λ(y ).1. 2 λ(y)fi (y) y s. All that is required is an ascent step. Then we have δ = λ(y ) = −λ(y ) in order to sum to 1. In our case. we have the simplex constraint.1 SMO We do not need to solve the optimization subproblem above at each pass through the data. Sequential Minimal Optimization (SMO) approach takes an ascent step that modiﬁes the least number of variables. λ(y)∆fi (y) = y y λ(y)fi (y (i) ) − y λ(y)fi (y) = − y i (y) λ(y)fi (y). so we must change at least two variables in order to respect the normalization constraint (by moving weight from one dual variable to another).t. we get: 1 − C 2 2 λ(y) i (y) − w y y λ(y)∆fi (y) λ(y)∆fi (y) y . The optimization problem becomes a single variable quadratic program in δ: max s. 6. ∀y.t. (6. not a full optimization.y αj (y)∆fj (y). Since y λ(y) = 0. y αi (y) + λ(y) ≥ 0. and making the substitution w=C j. Below we also make the substitution vi (y) = w fi (y) + problem for λ: max y to get the optimization 1 λ(y)vi (y) − C 2 λ(y) = 0.
6.1. SOLVING THE M3 N QP
79
0.5
0
−0.5
−1
−1.5
−2 −0.5
−0.4
−0.3
−0.2
−0.1
0
0.1
0.2
0.3
0.4
0.5
Figure 6.2: Representative examples of the SMO subproblem. Horizonal axis represents δ with two vertical lines depicting the upper and lower bounds c and d. Vertical axis represents the objective. Optimum either occurs at the maximum of the parabola if it is feasible or the upper or lower bound otherwise.
With a = vi (y ) − vi (y ), b = Cfi (y ) − fi (y )2 , c = −αi (y ), d = αi (y ), we have: b max [aδ − δ 2 ] s.t. c ≤ δ ≤ d, 2 (6.4)
where the optimum is achieved at the maximum of the parabola a/b if c ≤ a/b ≤ d or at the boundary c or d (see Fig. 6.1.1). Hence the solution is given by simply clipping a/b: δ ∗ = max(c, min(d, a/b)). The key advantage of SMO is the simplicity of this update. Computing the coefﬁcients involves dot products (or kernel evaluations) to compute w fi (y ) and w fi (y ) as well as (fi (y ) − fi (y )) (fi (y ) − fi (y )).
6.1.2 Selecting SMO pairs
How do we actually select such a pair to guarantee that we make progress in optimizing the objective? Note that at least one of the assignments y must violate (KKT1) or (KKT2),
80
CHAPTER 6. M3 N ALGORITHMS AND EXPERIMENTS
1. Set violation = 0. 2. For each y, 3. 4. 5. 6. 8. 9. 10. 11. 12. KKT1: If αi (y) = 0 and vi (y) > vi (y) + , Set y = y and violation = 1 and goto 7. KKT2: If αi (y) > 0 and vi (y) < vi (y) − , Set y = y and violation = 2 and goto 7. For each y = y , If violation = 1 and αi (y) > 0, Set y = y and goto 13. If violation = 2 and vi (y) > vi (y ), Set y = y and goto 13.
7. If violation > 0,
13. Return y and y . Figure 6.3: SMO pair selection. because otherwise αi is optimal with respect to the current α−i . The selection algorithm is outlined in Fig. 6.3. The ﬁrst variable in the pair, y , corresponds to a violated condition, while the second variable, y , is chosen to guarantee that solving Eq. (6.3) will result in improving the objective. There are two cases, corresponding to violation of KKT1 and violation of KKT2. Case KKT1. αi (y ) = 0 but vi (y ) > vi (y ) + . This is the case where i, y is a not support vector but should be. We would like to increase αi (y ), so we need αi (y ) > 0 to borrow from. There will always be a such a y since
y
αi (y) = 1 and αi (y ) = 0.
Since vi (y ) > vi (y ) + , vi (y ) > vi (y ) + , so the linear coefﬁcient in Eq. (6.4) is a = vi (y ) − vi (y ) > . Hence the unconstrained maximum is positive a/b > 0. Since the upperbound d = αi (y ) > 0, we have enough freedom to improve the objective. Case KKT2. αi (y ) > 0 but vi (y ) < vi (y ) − . This is the case where i, y is a support vector but should not be. We would like to decrease αi (y ), so we need vi (y ) > vi (y ) so that a/b < 0. There will always be a such a y since vi (y ) < vi (y ) − . Since the
6.1. SOLVING THE M3 N QP
81
lowerbound c = −αi (y ) < 0, again we have enough freedom to improve the objective. Since at each iteration we are guaranteed to improve the objective if the KKT conditions are violated and the objective is bounded, we can use the SMO in the blockcoordinate ascent algorithm to converge in a ﬁnite number of steps. To the best of our knowledge, there are no upper bounds on the speed of convergence of SMO, but experimental evidence has shown it a very effective algorithm for SVMs [Platt, 1999]. Of course, we can improve the speed of convergence by adding heuristics in the selection of the pair, as long as we guarantee that improvement is possible when KKT conditions are violated.
6.1.3 Structured SMO
Clearly, we cannot perform the above SMO updates in the space of α directly for the structured problems, since the number of α variables is exponential. The constraints on µ variables are much more complicated, since each µ participates not only in nonnegativity and normalization constraints, but also cliqueagreement constraints. We cannot limit our ascent steps to changing only two µ variables at a time, because in order to make a change in one clique and stay feasible, we need to modify variables in overlapping cliques. Fortunately, we can perform SMO updates on α variables implicitly in terms of the marginal dual variables µ. The diagram in Fig. 6.1.3 shows the abstract outline of the algorithm. The key steps in the SMO algorithm are checking for violations of the KKT conditions, selecting the pair y and y , computing the corresponding coefﬁcients a, b, c, d and updating the dual. We will show how to do these operations by doing all the hard work in terms of the polynomially many marginal µi variables and auxiliary “maxmarginals” variables.
Structured KKT conditions As before, we deﬁne vi (y) = w fi (y) + i (y). The KKT conditions are, for all y: αi (y) = 0 ⇒ vi (y) ≤ vi (y); αi (y) > 0 ⇒ vi (y) ≥ vi (y). (6.5)
82
CHAPTER 6. M3 N ALGORITHMS AND EXPERIMENTS
select & lift
SMO update
project
Figure 6.4: Structured SMO diagram. We use marginals µ to select an appropriate pair of instantiations y and y and reconstruct their α values. We then perform the simple SMO update and project the result back onto the marginals.
Of course, we cannot check these explicitly. Instead, we deﬁne maxmarginals for each clique in the junction tree c ∈ T (i) and its values yc , as: vi,c (yc ) = max [w fi (y) + i (y)],
y∼yc
αi,c (yc ) = max αi (y).
y∼yc
We also deﬁne vi,c (yc ) = maxyc =yc vi,c (yc ) = maxy∼yc [w fi (y) + i (y)]. Note that we do not explicitly represent αi (y), but we can reconstruct the maximumentropy one from the marginals µi by using Eq. (5.13). Both vi,c (yc ) and αi,c (yc ) can be computed by using the Viterbi algorithm (one pass propagation towards the root and one outwards from the root [Cowell et al., 1999]). We can now express the KKT conditions in terms of the maxmarginals for each clique c ∈ T (i) and its values yc : αi,c (yc ) = 0 ⇒ vi,c (yc ) ≤ vi,c (yc ); αi,c (yc ) > 0 ⇒ vi,c (yc ) ≥ vi,c (yc ). (6.6)
Theorem 6.1.1 The KKT conditions in Eq. (6.5) and Eq. (6.6) are equivalent. Proof: Eq. (6.5) ⇒ Eq. (6.6). Assume Eq. (6.5). Suppose, we have a violation of KKT1: for some c, yc , αi,c (yc ) = 0, but vi,c (yc ) > vi,c (yc ). Since αi,c (yc ) = maxy∼yc αi (y) = 0,
vi (y) ≥ vi (y). But αi. But vi.c (yc ) > 0.c (yc ) < vi. This means that y is the optimum of vi (·).5). and it follows that all the yconsistent marginals µi are positive as well µi.5).a (ya ) = vi. Eq. which by deﬁnition agree with y .c (yc ). vi (y) ≤ vi (y). But by Eq. αi (y) > 0.c (yc )) for any clique c and clique assignment yc . Take any maximizer.c (yc ).a∪b (ya∪b ) = vi. We will show that vi (y) = vi. Let {A.c (yc ) > 0. ∀y ∼ yc . we get vi (y) = vi.c (yc ).6.6).c (yc ) > vi. (6. so if all the yconsistent marginals are positive. by Eq.c (yc ). Now suppose we have a violation of KKT2: for some i. y(a) ∼ ya with vi (y(a) ) = vi.c (yc ) is the optimal value. a contradiction. We need to introduce some more notation to deal with the two parts of the tree induced by cutting the edge between a and b. if vi. ∀y ∼ yc . cliques a and b. Note that trivially maxy vi (y ) = max(vi.A (yA ) + vi. Since αi (y) > 0. yc ∼ y. That is. but vi (y) > vi (y). We denote the two subsets of an assignment y as yA and yB (with overlap at ys ). Then vi (y) < vi (y). a contradiction.6).b (yb ).5). ∀c ∈ T (i) .c (yc ) ≥ vi.b (yb ) ≥ vi.a (ya ) and any maximizer y(b) ∼ yb with vi (y(b) ) = vi. (6. ∀y ∼ yc .c (yc ) = 0. Now suppose we have a violation of KKT2: for some y.6). . But αi (y) = c∈T (i) c∈S (i) µi. By chaining this equality from the root of the tree to all the leaves. ∀c ∈ T (i) . ∀c ∈ T (i) (since sum upperbounds max). hence vi.c (yc ) implies the opposite: there exists y ∼ yc such that vi (y) > vi.c (yc ) > 0.c (yc ). Suppose we have a violation of KKT1: for some y.6) ⇒ Eq. (6. ∀c ∈ T (i) . which also implies vi (y) > vi (y).B (yB ). B} be a partition of the nodes T (i) (cliques of C (i) ) resulting from removing the edge between a and b such that a ∈ A and b ∈ B. αi. then we cannot have αi. a contradiction.c (yc ) ≥ vi. with a separator s.c (yc ). (6.c (yc ) = vi (y) > vi (y) > vi. (6. vi. vi. By Eq.c (yc ) > vi. The value of an assignment vi (y) can be decomposed into two parts: vi (y) = vi. ∀c ∈ T (i) . then maxy vi (y ) = vi. vi.B (yB ) only count the contributions of their constituent cliques. (6. but vi. ∀c ∈ T (i) .s (ys ) .c (yc ).b (yb ).1.c (yc ) for any c.c (yc ). Since vi.c (yc ). Assume Eq. a contradiction. then αi (y) > 0. and show that vi. For that y.a (ya ) ≥ vi.c (yc ) > 0.c (yc ) µi. αi (y) = 0. we consider any two adjacent nodes in the tree T (i) .A (yA ) and vi. Hence all the yconsistent αi maxmarginals are positive αi.c (yc ) > 0 implies there exists y ∼ yc such that αi (y) > 0. yc . Hence. To show that this. by Eq. (6. we know that all the yconsistent αi maxmarginals are positive αi. SOLVING THE M3 N QP 83 then αi (y) = 0. ∀c ∈ T (i) . but vi (y) < vi (y). where vi.
c (yc ) − < vi (y ) − . (6. so the linear coefﬁcient in Eq. so αi (y ) = αi.5.c (yc )+ .b (yb ) ≥ vi. We create a new assignment that combines the best of the two: y(s) = yA ∪ yB . y . Hence the unconstrained maximum is positive a/b > 0. while the second variable.s (ys ) since they are optimal as we said above. M3 N ALGORITHMS AND EXPERIMENTS on the intersection s. y is a support vector but should not be. We have two cases. so we need αi (y ) > 0 to borrow from. We can ﬁnd one by choosing yc for which αi. We would like to increase αi (y ). (6. so we need vi (y ) > vi (y ) so that a/b < 0. so vi (y ) = vi. (a) (b) (a) (b) (b) (a) (a) (b) (b) (a) (a) (a) (b) (b) (a) (b) (a) (b) (a) (a) (b) (b) Structured SMO pair selection and update As in multiclass problems. Hence we have vi (yA ) + vi (yB ) = vi (yA ) + vi (yB ) ≥ vi (yA ) + vi (yB ) which implies that vi (yA ) ≥ vi (yA ) and vi (yB ) ≥ vi (yB ). αi (y ) > 0. Case KKT1. y . We would like to decrease αi (y ). Case KKT2.c (yc ) + > vi (y ) + and αi (y ) = 0. which guarantees that for yc = arg maxy∼yc αi (y). The value of this assignment is optimal vi (y(a∪b) ) = vi (yA ) + vi (yB ) = vi (y(a) ) = vi (y(b) ). we will select the ﬁrst variable in the pair.c (yc ) > 0 and vi (y ) < vi.c (yc ) > vi. we have enough freedom to improve the objective. αi. We decompose the two associated values into the corresponding parts: vi (y(a) ) = vi (yA )+vi (yB ) and vi (y(b) ) = vi (yA )+vi (yB ).a (ya ) = vi. b = Cfi (y )−fi (y )2 . Having selected y and y . vi (y ) ≥ vi (y ) + .c (yc ) > vi.c (yc ) < vi.4) is a = vi (y ) − vi (y ) > .c (yc ) > 0. corresponding to violation of KKT1 and violation of KKT2. c = −αi (y ). 6. αi. Since the upperbound d = αi (y ) > 0. y is a not support vector but should be. Note that vi (y(s) ) = vi (yA ) + vi (yB ) = vi. As before.c (yc ) > 0 but vi. corresponding to a violated condition. d = αi (y ). we enforce approximate KKT conditions in the algorithm in Fig. the coefﬁcients for the onevariable QP in Eq.84 CHAPTER 6. This is the case where i.c (yc ) < vi. since we essentially ﬁxed the intersection s and maximized over the rest of the variables in A and B separately. This is the case where i. (6. There will always be a such a y since .c (yc ) = 0 but vi.s (ys ). We have set y = arg maxy∼yc αi (y). to guarantee that solving Eq.c (yc )− .3) will result in improving the objective. Now we create another assignment that clamps the value of both a and b: y(a∪b) = yA ∪ yB . Since vi (y ) ≥ vi (y ) + . We have set y = arg maxy∼yc vi (y).4) are a = vi (y )−vi (y ). There will always be a such a y (with yc = yc ) since y αi (y) = 1 and αi (y ) = 0. Now vi.
10.c (yc ) = µi. If violation > 0. y = arg maxy∼yc αi (y) and violation = 2 and goto 7.c (yc ) − .c (yc ) > vi. with average length of ∼ 8 characters. KKT2: If αi. 2. and vi. again we have enough freedom to improve the objective. Set yc = yc .c (yc ). from 150 human subjects. yc 3. each character was rasterized into an image of 16 by 8 binary . 9.c (yc ) + δ1 c ∼ y ) − δ1 c ∼ y ).c (yc ) < vi. we need to project this change onto the marginal dual variables µi . from the data set collected by Kassel [1995].6. KKT1: If αi. and the change is very simple: µi. If violation = 1 and αi. Set violation = 0. which guarantees that for yc = arg maxy∼yc vi (y).c (yc ) > vi.c (yc ) = 0. If violation = 2 and vi. vi (y ) < vi (y ) − . Each word was divided into characters. y = arg maxy∼yc vi (y) and violation = 1 and goto 7. For each c ∈ T (i) . Set yc = arg maxy∼yc αi (y) and goto 13. vi (y ) > vi (y ) − . Having computed new values αi (y ) = αi (y ) + δ and αi (y ) = αi (y ) − δ.2 Experiments We selected a subset of ∼ 6100 handwritten words. and vi. 11. 5. 13. I(y I(y 6. Since the lowerbound c = −αi (y ) < 0. EXPERIMENTS 85 1. 12. We can ﬁnd one by choosing yc for which vi.5: Structured SMO pair selection.c (yc ) > 0.c (yc ) + . Set yc = yc . 7.c (yc ) − . Return y and y . 4. For each yc = yc . Set y = arg maxy∼yc vi (y) and goto 13. Figure 6. 6. 8. The only marginal affected are the ones consistent with y and/or y .2.c (yc ) > vi.c (yc ) > 0.
. using linear.6: (a) 3 example words from the OCR data set. Logistic regression and CRFs are both trained by maximizing the conditional likelihood of the labels given the features. z}.) In our framework. pixels.35 linear Test error (average percharacter) 0. 6.86 CHAPTER 6.25 0. multiclass SVMs as described in Eq. CRFs. . . and oneagainstall SVMs (whose performance was slightly lower than multiclass SVMs). (See Fig. and sequence approaches — CRFs. and cubic kernels.3 0.1 0. which do not consider the correlation between neighboring characters — logistic regression. Our features for each label Yj are the corresponding image of ith character.6(b). summarized in Fig. The data set is divided into 10 folds of ∼ 600 training and ∼ 5500 testing examples.1 and 1. using a zeromean diagonal Gaussian prior over the parameters. Each label Yj takes values from one of 26 classes {a. quadratic. .6(a). 6. and a labeling for a complete word to Y. multiclass SVMs. and M3 Ns.2 0. the image for each word corresponds to x.15 0. We implemented a selection of stateoftheart classiﬁcation algorithms: independent label approaches. with a standard deviation between 0. a label of an individual character to Yj . The accuracy results. The other methods are trained by margin maximization.9). and our proposed M3 networks. For the sequence approaches (CRFs and M3 ). (2. (b) OCR: Average percharacter test error for logistic regression. .05 0 LogReg CRF quadratic cubic m SVM M^3N (a) (b) Figure 6. M3 N ALGORITHMS AND EXPERIMENTS 0. are averages over the 10 folds. we used an indicator basis function to represent the correlation between Yj and Yi+1 .
For comparison. particularly in the early iterations through the dataset. Interestingly. by using sequences. In our experiments with the OCR task. 1998] for largemargin classiﬁers have a similar online optimization scheme. a larger training set).g. we address the large (though polynomial) size of our quadratic program using an effective optimization procedure inspired by SMO.3. Although headtohead comparisons have not been performed. Once we use cubic kernels our error rate is 45% lower than CRFs and about 33% lower than the best previous approach. 6.4 Conclusion In this chapter. are about comparable to those of multiclass SVMs. we obtain another signiﬁcant gain in accuracy. it seems that. Although the EG algorithm has attractive convergence properties. less passes (about 3040) are needed for our algorithm than in the perceptron literature. Recently. Collins [2001] have applied votedperceptron to structured problems in natural language. and about the same as multiclass SVMs with cubic kernels. it has yet to be shown to learn faster than Structured SMO. marginbased methods achieve a very signiﬁcant gain over the respective likelihood maximizing methods. the previously published results..3 Related work The kerneladatron [Friess et al. 6. empirically. We used the structured SMO algorithm with about 3040 iterations through the data.. the error rate of our method using linear features is 16% lower than that of CRFs. the Exponentiated Gradient [Kivinen & Warmuth. 1998] and votedperceptron algorithms [Freund & Schapire. RELATED WORK 87 For marginbased methods (SVMs and M3 ).6. although using a different setup (e.. 1997] algorithm has been adopted to solve our structured QP for maxmargin estimation [Bartlett et al. our sequence model signiﬁcantly outperforms other approaches by incorporating . Second. by using kernels. we were able to use kernels (both quadratic and cubic were evaluated) to increase the dimensionality of the feature space.6(b) shows two types of gains in accuracy: First. 2004]. 6. Using these highdimensional feature spaces in CRFs is not feasible because of the enormous number of parameters. Fig.
Overall. we apply this framework to important classes of Markov networks for spatial and relational data. . M3 N ALGORITHMS AND EXPERIMENTS highdimensional decision boundaries of polynomial kernels over character images while capturing correlations between consecutive characters. we believe that M3 networks will signiﬁcantly further the applicability of high accuracy marginbased methods to realworld structured data.88 CHAPTER 6. In the next two chapters.
In some cases. webpage 89 . such as the quadtree model used for image segmentation [Bouman & Shapiro. the network structure is learned. the network structure can mirror the hyperlink graph. 1994]. In many cases. In this chapter. For example. in which connected (“associated”) variables tend to have the same label. including gridtopology networks [Besag. we show that optimal learning is feasible for an important subclass of Markov networks — networks with attractive potentials. contains networks of discrete variables with K labels and arbitrarysize clique potentials with K parameters that favor the same labels for all variables in the clique. One can address the tractability issue by limiting the structure of the underlying network. subject to the constraint that inference on these networks is tractable. [Bach & Jordan. This subclass. Such positive interactions capture the “guilt by association” pattern of reasoning present in many domains. AMNs are a natural ﬁt object recognition and segmentation. in hypertext.g. The chief computational bottleneck in applying Markov networks for other largescale prediction problems is inference. which is usually highly interconnected. a tractable structure is determined in advance. we considered applications of sequencestructured Markov networks. which is NPhard in general networks suitable in a broad range of practical Markov network structures.. the topology of the Markov network does not allow tractable inference.Chapter 7 Associative Markov networks In the previous chapter. which allow very efﬁcient inference and learning. In other cases (e. however. 2001]). 1986]. leading to computationally intractable networks. called associative Markov networks (AMNs).
.g. The MAP problem can naturally be expressed as an integer programming problem. 1952]. the approximate linear program is not guaranteed to be optimal but we can bound its relative error. and many other applications. maximizing the conditional likelihood of the target labels given the features) require that we compute the posterior probabilities of different label assignments. Thus. Our empirical results suggest that the solutions of the resulting approximate maxmargin formulation work well in practice. [1989] show that the MAP problem can be formulated as a mincut in an appropriately constructed graph. l) = λij .90 CHAPTER 7. which penalizes assignments that do not have the same label across the edge: φij (k. In the maxmargin estimation framework. while balancing the spatial coherence modeled by the AMN. For binaryvalued Potts models. 1986. By constraining the class of Markov networks to AMNs. To our knowledge.. We present an AMNbased method for object segmentation of complex from 3D range data. the MAP problem . 1999b]. our models can be learned efﬁciently and at runtime. For L > 2. rather than just the MAP. ASSOCIATIVE MARKOV NETWORKS classiﬁcation. The proposed learning formulation effectively and directly learns to exploit a large set of complex surface and volumetric features.1 Associative networks Associative interactions arise naturally in the context of image processing. scale up to tens of millions of nodes and edges. ∀k = l and φij (k. We show that. the MAP problem can be solved exactly for this class of models in polynomial time. By contrast. 7. We use a linear program relaxation of this integer program in the minmax formulation. k) = 1. a common approach is to use a generalized Potts model [Potts. Greig et al. where nearby pixels are likely to have the same label [Besag. the inference subtask is one of ﬁnding the best joint (MAP) assignment to all of the variables in a Markov network. other learning tasks (e. Boykov et al. For the nonbinary case (K > 2). where λij ≤ 1. this linear program provides exact answers. for associative Markov networks of over binary variables (K = 2). In this setting. our method is the ﬁrst to allow training Markov networks of arbitrary connectivity and topology.
l) = 1. In this case.1 A function g : Y → IR is associative for a graph G over Kary variables if it can be written as: K K g(y) = v∈V k=1 gv (k)1 v = k) + I(y c∈C\V k=1 gc (k)1 c = k. µim ). k) = λc (k) ≥ 1 and the rest of the entries are set to 1. as different labels can have very diverse afﬁnities. . Deﬁnition 7. 7. . .7. .1.2. AMNs admit nonpairwise interactions between variables. . and φij (k. . where V are the nodes and C are the cliques of the graph G. This additional ﬂexibility is important in many domains. . where λij (k) ≥ 1. 1999b. Importantly. AMNs allow us to encode the pattern of (soft) transitivity present in many domains. with potentials over cliques involving m variables φ(µi1 . foreground pixels tend to have locally coherent values while background is much more varied. 1999]. . Our associative potentials extend the Potts model in several ways. This type of transitivity could be modeled by a ternary clique that has high λ for the assignment with all interactions present. In a second important extension. For example. we deﬁne associative functions and potentials as follows. AMNs allow different labels to have different attraction strength: φij (k. Kleinberg & Tardos. . . k) = λij (k). this probability may increase if they both interact with another protein. ∀c ∈ C\V. using this additional expressive power. ∀k = l. and µc (k) for each clique c . which indicates whether node v has value k. but a procedure based on a relaxed linear program guarantees a factor 2 approximation of the optimal solution [Boykov et al.. For example.2 LP Inference We can write an integer linear program for the problem of ﬁnding the maximum of an associative function g(y). k). I(y gc (k) ≥ 0. LP INFERENCE 91 is NPhard. A set of potentials φ(y) is associative if φ(y) = eg(y) and g(y) is associative. consider the problem of predicting whether two proteins interact [Vazquez et al. . the clique potentials are constrained to have the same type of structure as the edge potentials: There are K parameters φc (k. In particular.. More formally. 2003]. where we have a “marginal” variable µv (k) for each node v ∈ V and each label k. .
2. which represents the event that all nodes in the clique c have label k: K K max v∈V k=1 µv (k)gv (k) + c∈C\V k=1 µc (k)gc (k) K (7. 1}. Theorem 7.2.t. the linear relaxation of Eq. (7. . for any associative function g. ASSOCIATIVE MARKOV NETWORKS (containing more than one variable) and label k. these LPs can produce fractional solutions and we use a rounding procedure to get an integral solution. µc (k) ∈ {0. the linear relaxation of Eq. which is equivalent to µc (k) = v∈c µv (k). k. µc (k) = minv µv (k) . µc (k) ≤ µv (k). it seems that in real data such symmetries are often broken.1). k. Although artiﬁcial examples with fractional solutions can be easily constructed by using symmetry.g.92 CHAPTER 7. in all our experiments with L > 2 on real data.2 If K > 2.1 If K = 2. regardless of network topology or clique size. This result states that the MAP problem in binary AMNs is tractable. v∈c Note that we substitute the constraint µc (k) = µv (k) by linear inequality con straints µc (k) ≤ µv (k). for any associative function g. is guaranteed to produce an integer solution when a unique solution exists. In fact. In the appendix. (7. Theorem 7. (7. In the nonbinary case (L > 2).2. Hence at the optimum. k=1 µv (k) = 1. ∀c ∈ C \ V. It can be shown that in the binary case. the linear relaxation of Eq. (where the constraints µc (k) ∈ {0.1 for the proof.1) has an integral optimal solution. v ∈ c. we never encountered fractional solutions. 1 2 for pairwise networks).1) s. when µv (k) are binary. we also show that the approximation ratio of the rounding procedure is the inverse of the size of the largest clique (e.1) has a solution that is larger than the solution of the integer program by at most the number of variables in the largest clique. See Appendix A. ∀c ∈ C. ∀v ∈ V.. 1} are replaced by µc (k) ≥ 0). This works because the coefﬁcient gc (k) is nonnegative and we are maximizing the objective function.
binary AMNs. (7. The reason for that is that the ﬁnal mincut graph must consist of only positive weights. and create an edge of weight ∆v  from v to either 1 or 2. For pairwise. depending on the sign of ∆v . (7.7. An . For each node term corresponding to node v we add a vertex v to the mincut graph. (7. V2 ) cut.3) The graph will consist of a vertex for each node in the AMN. [1999a] to perform (approximate) inference in the general multiclass case.3. We ﬁrst consider the case of binary AMNs. we recast the objective as minimization by simply reversing the signs on the value of each θ. we focus on the pairwise AMN case. along with the 1 and 2 terminals.1) is: max v∈V [µv (1)gv (1) + µv (2)gv (2)] + uv∈E [µuv (1)guv (1) + µuv (2)guv (2)].3. the objective of the integer program in Eq. In the ﬁnal (V1 . and then how to combine the two. MINCUT INFERENCE 93 7.1 Graph construction We construct a graph in which the mincut will correspond to the optimal MAP labeling for the above objective. First. We then look at ∆v = gv (1) − gv (2). For simplicity. and the V2 set will correspond to label 2. Such a term corresponds to the node potential contribution to our objective function for node v. min − v∈V [µv (1)gv (1) + µv (2)gv (2)] − uv∈E [µuv (1)guv (1) + µuv (2)guv (2)].2) 7. Node terms Consider a node term −µv (1)gv (1) − µv (2)gv (2). the V1 set will correspond to label 1.3 Mincut inference We can also use efﬁcient mincut algorithms to perform exact inference on the learned models for K = 2 and approximate inference for K > 2. and later show how to use the local search algorithm developed by Boykov et al. We will show how to deal with the node terms (those depending only on a single variable) and the edge terms (those depending on a pair of variables).
we would simply get a cut with cost 0. and we would always choose not to cut any edges. We will connect vertex u to 1 with an edge of weight guv (1). Edge Terms Now consider an edge term of the form −µuv (1)guv (1) − µuv (2)guv (2). 7. which must be less than guv (2) or the mincut would have placed them both on the 1 side.3. but when we combine the graphs for node terms and edge terms. since for each introduced vertex we have only one edge of positive weight to either 1 or 2. We can take the individual graphs we created for node and edge terms and merge them . Observe what happens when both nodes are on the V2 side of the cut: the value of the mincut is guv (1).1. Fig. 7.1 shows an example. connect v to 2 with an edge of weight guv (2) and connect u to v with an edge of weight guv (1) + guv (2). such cuts will be possible. To construct a mincut graph for the edge term we will introduce two vertices u and v.3. Thus if we run mincut. 7. the graph construction above would add an edge from each node to its more likely label.3. we see that if the AMN consisted of only node potentials. example is presented in Fig. a cut that places each node in different sets will not occur. From Fig.94 CHAPTER 7.1: Mincut graph construction of node (left) and edge (right) terms.1. When looking at edge terms in isolation. ASSOCIATIVE MARKOV NETWORKS 1 v 2 1 u v 1 v 2 2 Figure 7.
[1999a]) from µ if µv = k implies µv = µv (where µv is the label of the node v in the AMN. or change to k. Another labeling µ is called an “αexpansion” move (following Boykov et al. In this new binary problem we will let label 1 represent a node keeping its current label and label 2 will denote a node taking on the new label k.3. The algorithm performs a series of “expansion” moves each of which involves optimization over two labels. 7. or switch to the label α. . . In order to construct the right coefﬁcients . a kexpansion from a current labeling allows each label to either stay the same. and it can be shown that it converges to within a factor of 2 of the global minimum.) In other words. One of the most effective algorithms for minimizing energy functions like ours is the αexpansion algorithm proposed by Boykov et al.2 Multiclass case The graph construction above ﬁnds the best MAP labeling for the binary case. The mincut construction from earlier allows us to do exactly that since an αexpansion move essentially minimizes a MAPobjective over two labels: it either allows a node to retain its current label. It can be shown that the resulting graph will represent the same objective (in the sense that running mincut on it will optimize the same objective) as the sum of the objectives of each graph.3. Since our MAPinference objective is simply a sum of node and edge terms. The key part of the algorithm is computing the best αexpansion labeling for a ﬁxed k and a ﬁxed current labeling µ.7. It terminates when there is no αexpansion move for any label k that has a lower objective than the current labeling (Fig. 7.2). [1999a]. and ﬁnds the new labeling whose objective has the lowest value. Expansion Algorithm Consider a current labeling µ and a particular label k ∈ 1. MINCUT INFERENCE 95 by adding edge weights together (and treating missing edges as edges with weight 0). . . The αexpansion algorithm cycles through all labels k in either a ﬁxed or random order. K. but in practice we would often like to handle multiple classes in AMNs. merging the node and edge term graphs will result in a graph in which mincut will correspond to the MAP labeling.
k for the new binary objective we need to consider several factors. we can apply the mincut construction from before to get the optimal labeling within one αexpansion from the current one. Note that we ignore nodes with label α altogether since an αexpansion move cannot change their label. j) ∈ E in which exactly one of the α. let θik and θij denote the node and edge coefﬁcients associated with the new binary objective: ◦ Node Potentials For each node i in the current labeling whose current label is not α. α. we add θij . and if the two nodes currently have 0 different labels we let θij = 0. and θyi denotes the coefﬁcient in the multiclass AMN MAP objective. . with weights θij = θij . we set θij = θiji j . [1999a] and as we have observed in our experiments. 5.α nodes has label α in the current labeling.96 CHAPTER 7. set µ := µ and success := 1 µ ˆ 4. where yi denotes the current label of node i. ◦ Edge Potentials For each edge (i.1 Compute µ = arg min −g(µ ) among µ within one αexpansion of µ. If success = 1 goto 2. y α we let θi0 = θi i . Begin with arbitrary labeling µ 2. . Return µ Figure 7. ASSOCIATIVE MARKOV NETWORKS 1. the algorithm terminates only after a few iterations with most of the improvement occurring in the ﬁrst 23 expansion moves. to the node potential θi1 of the y . Set success := 0 3. For each label k ∈ {1. Below. ˆ 3.2 If E(ˆ) < E(µ). Veksler [1999] shows that the αexpansion algorithm converges in O(N ) iterations where N is the number of nodes. .α 1 we add a new edge potential.y node whose label is different from α. After we have constructed the new binary MAP objective as above. K} 3.2: αexpansion algorithm k. As noted in Boykov et al. j) ∈ E whose nodes have labels different from α. and θi1 = θi . For each edge (i. . If the two nodes of the edge 0 currently have the same label.
c > 1. and the Hamming loss. y) is associative for G (i) for all i. y).4. which we use in generalization bounds and experiments.4 Maxmargin estimation The potentials of the AMN are once again loglinear combinations of basis functions.4. so we have: Lemma 7. it is useful to separate the basis functions with support only on nodes from those with support on larger cliques. y ∈ Y. fc (xc . . is associative. ˙ Deﬁnition 7. y) whenever Assumption 7. To ensure that w f (x.7. y) is associative: Assumption 7. It is easy to verify that any nonnegative combination of associative functions is associative.1 ¨ holds and w ≥ 0.3 w f (x. all basis functions evaluate to 0 for assignments where the values of the nodes are not equal and are nonnegative for the assignments where the values of the nodes are equal. In practice.4. y) is associative for G(x) for any (x. w} = w be the corresponding f subsets of parameters. c ∈ C(G(x)). ˙ ˙ ¨ Let ¨ = f \ f be the rest of the basis functions. We will need the following assumption to ensure that w f (x.2 Let f be the subset of basis functions f with support only on singleton cliques: ˙ f = {f ∈ f : ∀ x ∈ X . We must make similar associative assumption on the loss function in order to guarantee that the LP inference can handle it. Let {w. Assumption 7. y(i) .1 Basis functions f are componentwise associative for G(x) for any (x. Recall that this implies that for cliques larger than one.4 The loss function (x(i) .4.4. and any combination of basis functions with support only on singleton cliques is also associative. this restriction is fairly mild.4. MAXMARGIN ESTIMATION 97 7. yc ) = 0}. y) is associative.
In the dual. k. k. (5.c.c (k) = i. for each value k. (7. ∀c ∈ C . k.c (k) − 2 i. we have the following maxmargin QP for AMNs: min s.c (k) + f ∀i.v (k) ≥ −w ¨i. .c.2. ASSOCIATIVE MARKOV NETWORKS Using the above Assumptions 7.4).v∈V (i) .v (k) − c⊃v mi.c (k. k).c (k) i.1). k) and i. The dual of Eq. (7. The extra constraints are due to the associativity constraints on the resulting model.3) is given by: 2 2 max i. ∀i. ν ≥ 0. and not surprisingly. k C µi. ¨ w ∆¨i. . k s.3 for derivation).v (k)∆fi. k. ¨ w ≥ 0. ∀c ∈ C (i) k=1 (i) µi. However. ∀i. ∀i.c.c (k) ≥ 0. similar to Eq.c. the basic structure of the ﬁrst two sets of constraints remains the same: we have local margin requirements and “credit” passed around through messages mi.1 and 7. While this primal is more complex than the regular M3 N factored primal in Eq. c ∈ C (i) \ V (i) . . . v ∈ V (i) . k (i) C ˙ µi. \ V . . where fi. µi. (5.c (k) = fi. 1 w2 + C 2 ξi.v (k). . the constraints are different.2.c∈C (i) .c (k) ≤ µi. c ∈ C (i) \ V (i) .v (k).98 CHAPTER 7.c (k).c (k)∆¨i. .c∈C (i) . A.c (k) f i.v (k) ≥ v∈c − ξi.v∈V (i) (7. ∀i. are essentially the constraints from the inference LP relaxation in Eq.t. µi.c (yc )/c.4) (see derivation in Sec.v (k) − 2 K ν+ ¨ µi. there are marginals µ for each node and clique.4 and some algebra (see Appendix A.4. v ∈ c. . . (i) ¨ f mi. v ∈ c.12). k.v i.c (k.t. ∀v ∈ V (i) . w ∆fi. ¨ ∀i.v .v (k) i.4) i.v (k) = 1.v (k) ≥ mi.4.
c (k) f ¨ The ν variables simply ensure that w are positive (if any component ¨ i. target detection.c (k)∆¨i. . 1 Many thanks to Michael Montemerlo and Sebastian Thrun for sharing the data. as our experiments show.v∈V (i) .5.v (k). f µi. these weights tend to do well in practice. 7. maximizing the objective will force the corresponding component of ν to cancel ¨ it out). k µi.7. However. ¨ w=ν+ ¨ i.c∈C (i) . represented as 3D coordinates in an absolute frame of reference Fig. Thus. and as a preprocessing step for other perceptual tasks. ξ for the original QP may no longer be feasible. For K > 2. Thus. Terrain classiﬁcation is very useful for autonomous mobile robots in realworld environments for path planning. the only available information is the location of points. leading to a different choice of weights. Our task is to classify the laser range points into four classes: ground. z) coordinates in an absolute frame of reference.v (k) ∆fj.4) learns exact maxmargin weights for Markov networks of arbitrary topology. EXPERIMENTS 99 The dual and primal solutions are related by ˙ w= i. k ˙ µi.5 Experiments We applied associative Markov networks to the task of terrain classiﬁcation.c (k)∆¨i. the LP inference is exact. Unfortunately. Note that the objective can be written in terms of dot products of node basis func˙ ˙ v ¯ tions ∆fi.5. the linear relaxation leads to a strengthening of the constraints on w by potentially adding constraints corresponding to fractional assignments as in the case of untriangualated networks. building.c (k). Each reading was a point in 3D space. represented by its (x. Thus. the optimal choice w. k is negative. For K = 2.c∈C (i) . The Stanford Segbot Project1 has provided us with a laser range maps of the Stanford campus collected by a moving robot equipped with SICK2 laser sensors Fig. y. so that Eq. so they can be kernelized. which was fairly noisy because of localization errors. the edge basis functions cannot be kernelized because of the nonnegativity constraint.¯(k). 7.v (k)∆fi. tree. The data consists of around 35 million points.5. the only available information is the location of points. (7. 7.
we are left with approximately 20 million nonground points. since scans tend to be sparser in regions farther from the robot.100 CHAPTER 7. the outside corners. such as how planar the neighborhood is. as well as the density of the range scan. We use a number of features derived from the cube such as the percentage of points in the central column.3: Segbot: roving robot equipped with SICK2 laser sensors. Since classifying ground points is trivial given their absolute zcoordinate (height). For each point we sample 100 points in a cube of radius 0. We then partition the cube into 3 × 3 × 3 bins around the point. and shrubbery. We run PCA on these points to get the plane of maximum variance (spanned by the ﬁrst two principal components).5 meters. These features capture the local distribution well and are especially useful in ﬁnding planes. and compute the percentage of points lying in the various subcubes. Our second type of feature is based on a column . The features we use are invariant to rotation in the xy plane. Our ﬁrst type of feature is based on the principal plane around it. etc. or how much of the neighbors are close to the ground. Each point is represented simply as a location in an absolute 3D coordinate system. After we do that. The features we use require preprocessing to infer properties of the local neighborhood of a point. we classify them deterministically by thresholding the z coordinate at a value close to 0. oriented with respect to the principal plane. ASSOCIATIVE MARKOV NETWORKS Figure 7. the central plane.
g. VotedSVM and AMNs. around each point.5m). All methods use the same set of features. between 2m and 2. we also use an indicator feature of whether or not a point lies within 2m of the ground.7.25 meters. which extends vertically to include all the points in a “column”. 7. This model (Fig. some bushes. We considered three different models: SVM.5..7. We take a cylinder of radius 0. 7. top panel) achieves reasonable performance .5. For training we select roughly 30 thousand points that represent the classes well: a segment of a wall. Finally. This feature is especially useful in classifying shrubbery. right panel and Fig. augmented with a quadratic kernel. EXPERIMENTS 101 Figure 7.4: 3D laser scan range map of the Stanford Quad. a tree. The ﬁrst model is a multiclass SVM with a quadratic kernel over the above features. We then compute what percentage of the points lie in various segments of this vertical column (e.
7. For each point we took its local neighborhood (we varied the radius to get the best possible results) and assigned the point the label of the majority of its 100 neighbors. For example arches on buildings and other less planar regions are consistently confused for trees. 7. with associative potentials to ensure smoothness. It is important to ensure vertical consistency since the SVM classiﬁer is wrong in areas that are higher off the . We improved upon the SVM by smoothing its predictions using voting.5m. middle panel) performs slightly better than SVM: for example. ground/gray). Each point is connected to 6 of its neighbors: 3 of them are sampled randomly from the local neighborhood in a sphere of radius 0. in many places.102 CHAPTER 7. The ﬁnal model is a pairwise AMN over laser scan points. middle panel and Fig.5: Terrain classiﬁcation results showing Stanford Memorial Church obtained with SVM. VotedSVM and AMN models. it smooths out trees and some parts of the buildings.25m.7. The VotedSVM model (Fig. even though they are surrounded entirely by buildings. and the other 3 are sampled at random from the vertical cylinder column of radius 0. shrubs/blue.5. trees/green. (Color legend: buildings/red. ASSOCIATIVE MARKOV NETWORKS Figure 7. but fails to enforce local consistency of the classiﬁcation predictions. Yet it still fails in areas like arches of buildings where the SVM classiﬁer has a locally consistent wrong prediction.
We can see that the predictions of the AMN (Fig. While we experimented with a variety of edge features including various distances between points. left panel and Fig. and as we can see. the training took about an hour on a Pentium 3 desktop. The problem size is the sum of the number of nodes and the number of edges. Note the near linear performance of the algorithm and its efﬁciency even for large models.5 1 1. The inference over each segment was performed using mincut with αexpansion moves as described above.6. it is roughly linear in the size of the problem (number of nodes and number of edges). 7. The implementation is largely dominated by I/O time. which uses bidirectional search trees for augmenting paths (see Boykov and Kolmogorov [2004]). with the actual mincut taking less than two minutes even for the largest segment. We used a publicly available implementation of the mincut algorithm.7.5. 7. we found that even using only a constant feature performs well.5 x 10 7 Figure 7. ground (due to the decrease in point density) or because objects tend to look different as we vary their zcoordinate (for example.5 Problem size (nodes and edges) 2 2.6: The running time (in seconds) of the mincutbased inference algorithm for different problem sizes. tree trunks and tree crowns look different).5. The performance is summarized in Fig. bottom panel) are much smoother: for example building arches and tree trunks are predicted .7. We trained the AMN model using CPLEX to solve the quadratic program. EXPERIMENTS 103 Mincut inference performance 250 200 Running time (seconds) 150 100 50 0 0 0. 7.
we provide an algorithm for maxmargin training of associative Markov networks. as well as formal guarantees for binary classiﬁcation problems.9 (excluding ground. Unlike their work. They also provide a solution based on a relaxed LP that has certain approximation guarantees. See more results. 7. However. Kolmogorov and Zabih [2002] showed how to optimize energy functions containing binary and ternary interactions using graph cuts. Kumar and Hebert [2003] train CRFs using a pseudolikelihood approximation to the distribution P (Y  X) since estimating the true conditional distribution is intractable. ASSOCIATIVE MARKOV NETWORKS correctly. Our terrain classiﬁcation approach is most closely related to work in vision applying conditional random ﬁelds (CRFs) to 2D images. Our deﬁnition of associative potentials below also satisﬁes the Kolmogorov and Zabih regularity condition for K = 2. In fact. a subclass of Markov networks that allows only positive interactions between .7 Conclusion In this chapter.104 CHAPTER 7. which was classiﬁed by preprocessing). unlike their work. including a ﬂythrough movie of the data. Kleinberg and Tardos [1999] extend the multiclass Potts model to have more general edge potentials. under the constraints that negative log of the edge potentials form a metric on the set of labels. at http://ai. the structure of our potentials is simpler to describe and extend for the multiclass case. The differences are dramatic: SVM: 68%.stanford. 7. as long as the parameters satisfy a certain regularity condition.6 Related work Several authors have considered extensions to the Potts model. VotedSVM: 73% and AMN: 93%. More recently. our learning formulation provides an exact and tractable optimization algorithm.edu/˜btaskar/3Dmap/. Moreover. our approach can also handle multiclass problems in a straightforward manner. We also handlabeled around 180 thousand points of the test set (Fig. we can extend our maxmargin framework to estimate their more general potentials by expressing inference as a linear program. 7. 7.8) and computed accuracies of the predictions shown in Fig.
our method is guaranteed to ﬁnd the optimal (marginmaximizing) solution for all binaryvalued AMNs. we are not guaranteed exact solutions. While clearly we cannot introduce fully general potentials into AMNs without running against the NPhardness of the general problem. but we can prove constantfactor approximation bounds on the MAP solution returned by the relaxed LP.7. CONCLUSION 105 related variables. Our approach relies on a linear programming relaxation of the MAP problem. Our results in the binary case rely on the fact that the LP relaxation of the MAP problem provides exact solutions. To our knowledge. In the nonbinary case. such as extracting protein complexes from proteinprotein interaction data. regardless of the clique size or the connectivity. and consider another one (hypertext classiﬁcation) in the next. which is the key component in the quadratic program associated with the maxmargin formulation. despite the prevalence of fully associative Markov networks. . We have explored only a computer vision application in this chapter.g. It would be interesting to see whether these bounds provide us with guarantees on the quality (e. and it is an interesting challenge to apply the algorithm to even larger models and develop efﬁcient distributed implementations. It would be very interesting to consider other applications. We present largescale experiments with terrain segmentation and classiﬁcation from 3D range data involving AMNs with tens of millions of nodes and edges. the margin) of our learned model. Importantly. or predicting links in relational data.. The class of associative Markov networks appears to cover a large number of interesting applications. it would be interesting to see whether we can extend the class of networks we can learn effectively. We thus provide a polynomial time algorithm which approximately solves the maximum margin estimation problem for any associative Markov network.7. However. it is clear that many applications call for repulsive potentials. The mincut based inference is able to handle very large networks. this algorithm is the ﬁrst to provide an effective learning procedure for Markov networks of such general structure.
ASSOCIATIVE MARKOV NETWORKS Figure 7.7: Results from the SVM. . VotedSVM and AMN models.106 CHAPTER 7.
7. .8: Labeled part of the test set: ground truth (top) and SVM predictions (bottom).7. CONCLUSION 107 Figure 7.
9: Predictions of the VotedSVM (top) and AMN (bottom) models. . ASSOCIATIVE MARKOV NETWORKS Figure 7.108 CHAPTER 7.
medical records. Entities are related to each other via different types of links. in hypertext classiﬁcation. Most naively. ignoring the correlations between them. classifying each webpage solely using the words that appear on the page. A standard approach is to classify each entity independently. Such data consist of entities of different types. For example. In many other supervised learning tasks. social networks. crosscitations in patents and scientiﬁc papers.Chapter 8 Relational Markov networks In the previous chapters. In this chapter. the entities to be labeled are related with each other in very complex ways. typically indicating that their topics are related. we can use a bag of words model. hypertext has a very rich structure that this approach loses entirely. Many realworld data sets are innately relational: hyperlinked webpages. One document has hyperlinks to others. However. Each document also has internal structure. the labels of linked pages are highly correlated. We provide experimental results on a webpage classiﬁcation task. where each entity type is characterized by a different set of attributes. such as a partition into sections. Consider a collection of hypertext documents that we want to classify using some set of labels. and more. hyperlinks that emanate from the same section of the document are even 109 . we have seen how sequential and spatial correlation between labels can be exploited for tremendous accuracy gains. and the link structure is an important source of information. not just sequentially or spatially. we present a framework that builds on Markov networks and provides a ﬂexible language for modeling rich interaction patterns in structured data. showing that accuracy can be signiﬁcantly improved by modeling relational dependencies.
rather than classifying each document separately. consecutive links in a document tend to refer to documents with the same label. we restrict label and content attributes to take on categorical values. It would also have the label attribute Doc. which describes entities. . there are two entity types: Doc and Link.K that identiﬁes each .X (for example. a schema speciﬁes of a set of entity types E = {E1 .110 CHAPTER 8. we want to provide a form of collective classiﬁcation. In general.HasWordk indicating whether the word k occurs on the page.Label. these are important cues. their attributes and relations between them. Therefore. RELATIONAL MARKOV NETWORKS more likely to point to similar documents. Each type E is associated with three sets of attributes: content attributes E. the use of an undirected graphical model avoids the difﬁculties of deﬁning a coherent generative model for graph structures in directed models. As we show.To). 8. For simplicity. When classifying a collection of documents. The graphical structure of an RMN is based on the relational structure of the domain. The Link entity type has two attributes: Link. It thereby allows us tremendous ﬂexibility in representing complex patterns. We can also capture patterns that involve groups of links: for example. indicating the topic of the page. A relational domain is deﬁned by a schema. where we simultaneously decide on the class labels of all of the entities together. we can represent a pattern where two linked documents are likely to have the same topic. and can easily model complex patterns over related entities. and thereby can explicitly take advantage of the correlations between the labels of related entities. Reference attributes include a special unique key attribute E. Doc would have a set of boolean attributes Doc. which takes on a set of categorical values.HasWordk ). label attributes E. that can potentially help us achieve better classiﬁcation accuracy. For example. Doc. Doc. both of which refer to Doc entities. . Link. . En }. and reference attributes E.From and Link.To.Label). We introduce the framework of relational Markov networks (RMNs).R (for example. which compactly deﬁnes a Markov network over a relational data set.1 Relational classiﬁcation Consider hypertext as a simple example of a relational domain. In our domain.Y (for example. . If a webpage is represented as a bag of words. We propose the use of a joint probabilistic model for an entire collection of related entities.
2002] are a relational extension of Bayesian networks [Pearl. For example. Taskar et al. words they contain and links between them.Label to Doc. Getoor et al. show that this approach works well for classifying scientiﬁc documents. In our hypertext example. RELATIONAL CLASSIFICATION 111 entity. An instantiation I of a schema E speciﬁes the set of entities I(E) of each entity type E ∈ E and the values of all attributes for all of the entities.8. the PRM speciﬁes a Bayesian network over all of the documents in the collection. Given a particular instantiation graph.Label) associated with it. 1999. PRMs [Koller & Pfeffer.HadWordk . the PRM induces a large Bayesian network over that instantiation that speciﬁes a joint probability distribution over all attributes of all of the entities.Label of two documents if there is a link between them. I.HasWordk  Doc. Friedman et al. A PRM speciﬁes a probability distribution over instantiations consistent with a given instantiation graph by specifying a Bayesiannetworklike templatelevel probabilistic model for each entity type. We will use I.Label and each attribute Doc.y and I. Other reference attributes E. a PRM might use a naive Bayes model for words. The component I. This network reﬂects the interactions between related instances by allowing us to represent correlations between their attributes. Taskar et al.X. each of these attributes would have a conditional probability distribution P (Doc.x. We would have a probabilistic dependency from each document’s label to the words on the document. A hypertext instantiation graph speciﬁes a set of webpages and links between them. and a dependency from each document’s label to the labels of all of the documents to which it points. [2001] suggest the use of probabilistic relational models (PRMs) for the collective classiﬁcation task. label and reference attributes in the instantiation I.r. More importantly.. Given a particular instantiation graph containing some set of documents and links.R refer to entities of a single type E = Range(E. 1988].r to denote the values of those attributes. but not their words or labels..K). I.R to denote the content.Y and I. an instantiation of the hypertext schema is a collection of webpages. I. with a directed edge between Doc. specifying their labels. indicating the probability that word k appears in the document given each of the possible topic labels. a PRM can represent the interdependencies between topics of linked documents by introducing an edge from Doc.R) and take values in Domain(E . speciﬁes the set of entities (nodes) and their reference attributes (edges). using both the words in the title . which we call an instantiation skeleton or instantiation graph.1. 1998.
In this link existence model. Even more problematic are the inherent limitations on the expressive power imposed by the constraint that the directed graph must represent a coherent generative model over graph structures. and the cyclicity problem disappears. [2001] suggest an approach where we do not include direct dependencies between the labels of linked webpages. The advantage of training a model only to discriminate between labels is that it does not have to trade off between classiﬁcation accuracy and modeling the joint distribution over nonlabel attributes. is problematic since there are many cycles in the link graph. leading to cycles in the induced “Bayesian network”. the resulting Bayesian network has a random variable for each potential link — N 2 variables for collections containing N pages. such as webpages.. In many cases. This quadratic blowup occurs even when the actual link graph is very sparse. RELATIONAL MARKOV NETWORKS and abstract and the citationlink structure. The link existence model assumes that the presence of different edges is a conditionally independent event. while the goal of classiﬁcation is a discriminative model of labels given the other attributes.g. however. Each two pages have a “potential link”. Such interactions between many overlapping triples of links do not ﬁt well into the generative framework. When N is large (e. This model. Getoor et al. which is therefore not a coherent probabilistic model. the set of all webpages). Representing more complex patterns involving correlations between multiple edges is very difﬁcult. it is more likely that they point to each other as well. . discriminatively trained models are more robust to violations of independence assumptions and achieve higher classiﬁcation accuracy than their generative counterparts. if two pages point to the same page. The model deﬁnes the probability of the link existence as a function of the labels of the two endpoints. has other fundamental limitations. a quadratic growth is intractable. However the application of this idea to other domains. but rather treat links themselves as random variables. labels have no incoming edges from other labels.112 CHAPTER 8. Furthermore. For example. In particular. which may or may not exist in the data. directed models such as Bayesian networks and PRMs are usually trained to optimize the joint probability of the labels and other attributes.
it speciﬁes the cliques and potentials between attributes of related entities at a template level. For example. suppose that pages with the same label tend to link to each other. 8. We can capture this correlation between labels by introducing. so a single model provides a coherent distribution for any collection of instances from the schema.1: An unrolled Markov net over linked documents.) Roughly speaking. RELATIONAL MARKOV NETWORKS Label 1 Label 2 Label 3 113 Figure 8. To specify what cliques should be constructed in an instantiation. A relational clique template speciﬁes tuples of variables in the instantiation by using a relational query language.2. we can write the template as a kind of SQL query: SELECT doc1.Category. for each link. For our link example.8. The potential on the clique will have higher values for assignments that give a common label to the linked pages.Category .2 Relational Markov networks We now extend the framework of Markov networks to the relational setting. 8. (We provide the deﬁnitions directly for the conditional case.1. as in Fig. The links follow a common pattern: documents with the same label tend to link to each other more often. as the unconditional case is a special case where the set of content attributes is empty. a clique between the labels of the source and the target page. doc2. A relational Markov network (RMN) speciﬁes a conditional distribution over all of the labels of all of the entities in an instantiation given the relational structure and the content attributes. we will deﬁne a notion of a relational clique template.
Doc and Link.Category.S is doc1.S : f ∈ I(F) ∧ W(f . and ﬁnally. . consider another common pattern in hypertext: links in a webpage tend to point to pages of the same category.Key ∧ link.Key and link. Link link WHERE link. I(F) = I(E(F1 )) × .T o = doc2. This pattern can be expressed by the following template: SELECT doc1.Rl . This deﬁnition of a clique template is very ﬂexible. To continue our webpage example. W.R) — a boolean formula using conditions of the form Fi .Category and doc2. where f is a tuple of entities {fi } in which each fi is of type E(Fi ).Key and F. Doc doc2.114 CHAPTER 8. doc2. RELATIONAL MARKOV NETWORKS FROM Doc doc1.Rj = Fk . as the WHERE clause of a template can be an arbitrary predicate. Note that the clique template does not specify the nature of the interaction between the attributes. f . that is determined by the clique potentials. respectively.Y — a selected subset of content and label attributes in F. S) consists of three components: ◦ F = {Fi } — a set of entity variables. where an entity variable Fi is of type E(Fi ).Category .Key Note the three clauses that deﬁne a query: the FROM clause speciﬁes the cross product of entities to be ﬁltered by the WHERE clause and the SELECT clause picks out the attributes of interest.r)}.From = doc1.S selects the appropriate attributes of the entities. A relational clique template C = (F.To = doc2. W(F. ◦ W(F. the clause W(f .r) ensures that the entities are related to each other in speciﬁed ways. It allows modeling complex relational patterns on the instantiation graphs.Category. × I(E(Fn )) denotes the crossproduct of entities in the instantiation. For the clique template corresponding to the SQL query above.F rom = doc1.S ⊆ F.X ∪ F. which will be associated with the template. doc2 and link of types Doc. ◦ F. .R) is link. Our deﬁnition of clique templates contains the corresponding three parts. F consists of doc1. A clique template speciﬁes a set of cliques in an instantiation I: C(I) ≡ {c = f .
r) = c∈C(I) fC (I.y  I. Using the loglinear representation of potentials.r) − log Z(I.y C∈C c∈C(I) φC (I. RELATIONAL MARKOV NETWORKS 115 FROM Doc doc1.x. I. I. φC (VC ) = exp{wC fC (VC )}.From and link1.Key and not doc1.8.r) = I. and f is the vector .x.2. I. I.From = link2. A Relational Markov network (RMN) M = (C.r) where fC (I. Doc doc2. Since the clique templates do not explicitly depend on the identities of entities. I.yc ) is the sum over all appearances of the template C(I) in the instantiation.To = doc1.y. Φ) speciﬁes a set of clique templates C and corresponding potentials Φ = {φC }C∈C to deﬁne a conditional distribution: P (I. I.r) 1 = Z(I. the same template can select subgraphs whose structure is fairly different.x.Key Depending on the expressive power of our template deﬁnition language. Link link2 WHERE link1. I.x. we can write log P (I. I.xc .Key and link2.yc ) c∈C(I) where Z(I.xc .xc . I. Link link1.yc ) . I. The RMN allows us to associate the same clique potential parameters with all of the subgraphs satisfying the template.x.y  I.x.y. I. thereby allowing generalization over a wide range of different structures.r) = w f (I. We can easily represent patterns involving three (or more) interconnected documents without worrying about the acyclicity constraint imposed by directed models.To = doc2.r) C∈C φC (I. I. we may be able to construct very complex templates that select entire subgraph structures of an instantiation.x.Key = doc2. I.x.r) is the normalizing partition function: Z(I.
8. the RMN M produces an unrolled Markov network over the attributes of entities in I. recent analysis [Yedidia et al. this approach works well in our domain. The cliques in the unrolled network are determined by the clique templates C. Given a particular instantiation I of the schema. 8. we assume a pairwise network where all potentials are associated only with nodes and edges given by: .116 CHAPTER 8. We refer the reader to Yedidia et al. We provide a brief outline of one variant of BP. and when it does. for every link between two pages. There is a wide variety of approximation schemes for this problem.. for a detailed description of the BP algorithm. For simplicity. Belief Propagation (BP) is a local message passing algorithm introduced by Pearl [1988]. the marginals are a good approximation to the correct posteriors. not just the most likely assignment. RELATIONAL MARKOV NETWORKS of all fC . 8. Fig. In our webpage example.1 illustrates a simple instance of this unrolled Markov network. an RMN with the link basis function described above would deﬁne a Markov net in which. where exact inference is typically intractable.. As our results in Sec. including MCMC and variational methods. 1999] show that it often converges in general networks. we need to compute basis function expectations. Empirical results [Murphy et al. We chose to use belief propagation for its simplicity and relative efﬁciency and accuracy. We therefore resort to approximate methods.4 show. 2000] provides some theoretical justiﬁcation. and all of these cliques are associated with the same clique potential φC . 1999] for more details. referring to [Murphy et al. We have one clique for each c ∈ C(I).3 Approximate inference and learning Applying both maximum likelihood and maximum margin learning in the relational setting is requires inference in very large and complicated networks. It is guaranteed to converge to the correct marginal probabilities for each node only for singly connected Markov networks.. However. there is an edge between the labels of these pages. Maximum likelihood estimation For maximum likelihood learning.
Yj )ψi (yi ) k∈N (i)−j mki (Yi ) where α is a (different) normalizing constant. In our experiments. Yi ). Yj ). At each iteration. Yj )ψi (Yi )ψj (Yj ) k∈N (i)−j mki (Yi ) l∈N (j)−i mlj (Yj ) These approximate marginals are precisely what we need for the computation of the basis function expectations and performing classiﬁcation. Yn ) = 1 Z ψij (Yi . This process is repeated until the messages converge. . The belief propagation algorithm is very simple. At any point in the algorithm.8. with mij (Yj ) ← α max ψij (yi . Yj ) = αψij (Yi . Similarly. Yi . this results in less accurate classiﬁcation. . Yj ) = φ(xij . each node Yi sends the following messages to all its neighbors N (i): mij (Yj ) ← α yi ψij (yi . we use maxyi bi (Yi ) at prediction time. . Yj )ψi (yi ) yi k∈N (i)−j mki (Yi ) to compute approximate posterior “max”marginals and use those for prediction. . ψi (Yi ) = φ(xi . APPROXIMATE INFERENCE AND LEARNING 117 P (Y1 . the marginal distribution of any node Yi is approximated by bi (Yi ) = αψi (Yi ) k∈N (i) mki (Yi ) and the marginal distribution of a pair of nodes connected by an edge is approximated by bij (Yi . Note that we can also max − product variant of loopy BP. Yj ) ij i ψi (Yi ) where ij ranges over the edges of the network and ψij (Yi .3. . so we use posterior marginal prediction. Yj ). Computing the expected basis function expectations involves summing their expected values for each clique using the approximate marginals bi (Yi ) and bij (Yi .
7. we have access to the entire html of the page and the links to other pages. other (332).118 CHAPTER 8. 8.2. but in a relational classiﬁcation setting. Hence. we used approximate LP inference inside the maxmargin QP. Each page has a label attribute. faculty. The number of links for each school are: Cornell (574). making the number of other pages commensurate with the other categories. which always produced integral solutions on test data. Washington and Wisconsin. Our goal is to collectively classify webpages into one of these ﬁve categories.4 Experiments We tried out our framework on the WebKB dataset [Craven et al. which we rounded independently for each label. thus evaluating the generalization performance of . we learn a model from three schools and test the performance of the learned model on the remaining school.4. Washington (728) and Wisconsin (1614). student. The data set is problematic in that the category other is a grabbag of pages of many different types. faculty (148).. We could restrict attention to just the pages with the four other labels. representing the type of webpage which is one of course. The resulting category distribution is: course (237). The number of remaining pages for each school are: Cornell (280). For each page. researchproject (82) and student (542). 1998]. Texas. the deleted webpages might be useful in terms of their interactions with other webpages. 5. we used the LP in Sec. project or other. RELATIONAL MARKOV NETWORKS Maximum margin estimation For maximum margin estimation. Texas (292). so that a baseline algorithm that simply always selected other as the label would get an average accuracy of 75%. For networks with general potentials. using commercial Ilog CPLEX software to solve it. Washington (315) and Wisconsin (454). we used the untriangulated LP we described in Sec. For networks with attractive potentials (AMNs). which is an instance of our hypertext example. we compromised by eliminating all other pages with fewer than three outlinks. The data set contains webpages from four different Computer Science departments: Cornell. In all of our experiments. The untriangulated LP produced fractional solutions for inference on the test data in several settings. Texas (574). The number of pages classiﬁed as other is quite large.
. show that the two discriminative approaches outperform Naive Bayes.. 10] and took the best setting for all models. we compare to standard text classiﬁers such as Naive Bayes. The text of the webpage is represented using a set of binary attributes that indicate the presence of different words on the page.4. we cannot directly compare our accuracy results with previous work because different papers use different subsets of the data and different training/test splits. and logistic regression (Logistic) — using words and metawords.2. 2002]. 8. linear support vector machines (Svm). i. We want to capture these correlations in our model and use them for transmitting information between linked pages to provide more accurate classiﬁcation. but we can take additional advantage of the correlation in labels of related pages by classifying them collectively. although mostly originating from pages linking into the considered page. 8. shown in Fig. Our ﬁrst experimental setup compares three wellknown text classiﬁers — Naive Bayes. Logistic Regression. Logistic and Svm give very similar results. EXPERIMENTS 119 the different models. The average error over the 4 schools was reduced by around 4% by introducing the metadata attributes.1 Flat models The simplest approach we tried predicts the categories based on just the text content on the webpage. However. We also experimented with incorporating metadata: words appearing in the title of the page. We used C ∈ [0. the resulting classiﬁcation task is still ﬂat featurebased classiﬁcation.e. are easily incorporated as features. We found that stemming and feature selection did not provide much beneﬁt and simply pruned words that appeared in fewer than three documents in each of the three schools in the training data. Incorporating metadata gives a signiﬁcant improvement.1. which have been demonstrated to be successful on this data set [Joachims. Unfortunately. The results. We experimented with several relational models. and Support Vector Machines. in anchors of links to the page and in the last header before a link to the page [Yang et al. 1999].4. Note that metadata.8.
For each page.15 0.2 Link model Our ﬁrst model captures direct correlations between labels of linked pages.05 0 Words Words+Meta Naïve Bayes Svm Logistic Figure 8.35 0.4. The ExistsML model is a (partially) generative model proposed by Getoor et al. We also compare to a directed graphical model to contrast discriminative and generative models of relational structure.1 0. Then a simple generative model speciﬁes a probability distribution over the existence of links between pages conditioned on both pages’ labels.) 8. a logistic regression model predicts the page label given the words and metafeatures.1. students have links to all categories but mostly courses. we learn the probability of existence of a link between two pages given their labels. Maximum likelihood estimation (with regularization) of the generative component is closed .25 Test Error 0. [2001]. we introduce a relational clique template over the labels of two pages that are linked.We train this model using maximum conditional likelihood (labels given the words and the links) and maximum margin. with and without metadata features. The Link model. and Logistic on WebKB. Concretely. shown in Fig. faculty rarely link to each other. Note that this model does not require inference during learning. These correlations are very common in our data: courses and research projects almost never link to each other.3 0. Svm. captures this correlation through links: in addition to the local bag of words and metadata attributes.120 CHAPTER 8. 8.2 0.2: Comparison of Naive Bayes. (Only averages over the 4 schools are shown here. RELATIONAL MARKOV NETWORKS 0.
However. a faculty webpage might have .3: Comparison of ﬂat versus collective classiﬁcation on WebKB: SVM.3 Cocite model The second relational model uses the insight that a webpage often has internal structure that allows it to be broken up into sections. Exists model with logistic regression and the Link model estimated using the maximum likelihood (ML) and the maximum margin (MM) criteria. linked or not. and 51% lower than multiclass SVMs. since the resulting graphical model includes edges not only for the existing hyperlinks. Fig. By contrast. observing the link structure directly correlates all page labels in a website. Intuitively.4. 8. but also those that do not exist. For example. This can be attributed to the simplicity of the generative model and the difﬁculty of the resulting inference problem.3 shows a gain in accuracy from SVMs to the Link model by using the correlations between labels of linked web pages. the prediction phase is much more expensive. EXPERIMENTS 121 30% 25% 20% ExistsML SVM LinkML LinkMM Error 15% 10% 5% 0% Cor Tex Was Wis Average Figure 8. There is also very signiﬁcant additional gain by using maximum margin training: the error rate of LinkMM is 40% lower than that of LinkML. 8. form given appropriate cooccurrence counts of linked pages’ labels. The Exists model doesn’t perform very well in comparison.8.4. the Link model avoids this problem by only modeling the conditional distribution given the existing links.
Doc doc2.Key = doc2. Link link2 WHERE link1. with and without metadata features. Link link1.Key We compared the performance of SVM. We can view a section of a webpage as a ﬁnegrained version of Kleinberg’s hub [Kleinberg. The Cocite model captures this type of correlation.122 CHAPTER 8. if two pages are cocited.4: Comparison of Naive Bayes. Svm. . Intuitively. they are likely to be on similar topics. and a third to his advisees. 1999] (a page that contains a lot of links to pages of particular category). doc2. (Only averages over the 4 schools are shown here. To take advantage of this trend.Key and not doc1. or linked to from the same section. and Logistic on WebKB.From = link2. we need to enrich our schema by adding the attribute Section to Link to refer to the section number it appears in. In the RMN.Key and link2. The results.Section = link2.) one section that discusses research.From and link1.To = doc2. We deﬁned a section as a sequence of three or more links that have the same path to the root in the html parse tree. RELATIONAL MARKOV NETWORKS 25% 20% SVM CociteML CociteMM Error 15% 10% 5% 0% Cor Tex Was Wis Average Figure 8.Category FROM Doc doc1. Note that we expect the correlation between the labels in this case to be positive. so we can use AMNtype potentials in the maxmargin estimation.Category.To = doc1. we have a relational clique template deﬁned by: SELECT doc1. CociteML and CociteMM. a second section might contain links to the courses taught by the faculty member. with a list of links to all of the projects of the faculty member.Section and link1.
Another useful type of subgraph template involves transitivity patterns.5. Later work showed how to efﬁciently learn model parameters and structure (equivalent of clique selection in Markov networks) from data [Friedman et al. However there are many patterns that we are difﬁcult to model in PRMs. [2002] propose several generative models of relational structure. One useful type of pattern type is a similarity template. it is likely that the XY relation and the YZ relation are of the same type. if Y is Professor X’s advisee. Note that this type of interaction cannot be accounted for just using pairwise cliques. in our experiments. 8. maximum likelihood trained model CociteML achieves a worse test error than maximum margin CociteMM model. RELATED WORK 123 shown in Fig. the learned CociteMM weights never produced fractional solutions when used for inference.. By introducing cliques over triples of relations. We note that. If X’s webpage mentions Y and Z in the same context. We can incorporate even more complicated patterns. we can capture such patterns as well. 1998]. Our framework accommodates these patterns easily. For example. Getoor et al. which shows a 30% relative reduction in test error over SVM. 8. for example. a professor X and two other entities Y and Z. 1999]. where objects that share a certain graphbased property are more likely to have the same label. then probably so is Z. in particular those that involve several links at a time. even in the case of the nonoptimal multiclass relaxation.5 Related work Our RMN representation is most closely related to the work on PRMs [Koller & Pfeffer. The improvement is present when testing on each of the schools. We give some examples here.8. which suggests that the optimization successfully avoided problematic parameterizations of the network. for example. students often assist in courses taught by their advisor. by introducing pairwise cliques between the appropriate relation variables. but of course we are limited by the ability of belief propagation . Their approach easily captures the dependence of link existence on attributes of entities.4. also demonstrate signiﬁcant improvements of the relational models over the SVM. Again. Consider. where the presence of an AB link and of a BC link increases (or decreases) the likelihood of an AC link.
A similar approach was used by Neville and Jensen [2000] in a different domain. The structure of the relational graph has been used extensively to infer importance in scientiﬁc publications [Egghe & Rousseau. However. 1990] and hypertext [Kleinberg. none of these approaches provide a coherent model for the correlations between linked webpages. where we want to classify multiple entities. and used these pages to improve classiﬁcation of university webpages. for the transitivity pattern. with no formal justiﬁcation. this approach is limited in cases where some or even all of the relational features that occur in the test data are not observed in the training data.124 CHAPTER 8.. it is possible to simply view the presence of particular citations as atomic features. For example. In some cases. applying combinations of classiﬁers in a procedural way. Several recent papers have proposed algorithms that use the link graph to aid classiﬁcation. exploiting the interactions between their labels. RELATIONAL MARKOV NETWORKS to scale up as we introduce larger cliques and tighter loops in the Markov network. 8. 1999]. achieving a signiﬁcant improvement compared to a baseline of using the text in each document alone. We have shown that we can exploit a very rich set of relational patterns in classiﬁcation. However. [1998] use systempredicted labels of linked documents to iteratively relabel each document in the test set. there is no overlap between the webpages in the .6 Conclusion In this chapter. we might consider simply directing the correlation edges between link existence variables arbitrarily. we propose a new approach for classiﬁcation in relational domains. In our WebKB example. signiﬁcantly improving the classiﬁcation accuracy over standard ﬂat classiﬁcation. it is not clear how to parameterize a link existence variable for a link that is involved in multiple triangles. when classifying papers into topics. Slattery and Mitchell [2000] tried to identify directory (or hub) pages that commonly list pages of the same topic. We describe and exploit these patterns in our work on RMNs using maximum likelihood estimation [Taskar et al. 2003b]. we can incorporate relational features into standard ﬂat classiﬁcation. Attempts to model such pattern in PRMs run into the constraint that the probabilistic dependency graph (Bayesian network) must be a directed acyclic graph. Chakrabarti et al. However. For example. Our approach provides a coherent foundation for the process of collective classiﬁcation.
but cannot exploit the strong correlation between the labels of related entities that RMNs capture. RMNs are generally applicable to any relational domain. it is particularly interesting to explore the problem of inducing them automatically. so we cannot learn anything from the training data about the signiﬁcance of a hyperlink to/from a particular webpage in the test data. . words) from the related entities can aid in classiﬁcation..8. In particular. The results in this chapter represent only a subset of the domains we have worked on (see [Taskar et al. RMNs offer a principled method for learning to predict communities of and hierarchical structure between people and organizations based on both the local attributes and the patterns of static and dynamic interaction. CONCLUSION 125 different schools. Incorporating basic features (e.6.. however.g. social networks provide extensive information about interactions among people and organizations. 2003b]). Hypertext is the most easily available source of structured data. Given the wealth of possible patterns.
RELATIONAL MARKOV NETWORKS .126 CHAPTER 8.
clustering 127 . matching.Part III Broader applications: parsing.
verbs (VBD). 9. we are not concerned with deﬁning a distribution over sequences of words (language model). For example.4.1 Context free grammar model CFGs are one of the primary formalisms for capturing the recursive structure of syntactic constructions. Terminal symbols for our purposes are partofspeech tags like nouns (NN). 1999]. we condition on the words in a sentence to produce a model of the syntactic structure. u For clarity of presentation. 9. The nonterminal symbols correspond to syntactic categories such as noun phrase (NP) or verbal phrase (VP). 3. thus incorporating an important kind of lexical information not usually used by conventional parsers. determiners (DT). although many others have also been proposed [Manning & Sch¨ tze.1(a) shows a parse tree for the sentence The screen was a sea of 128 . We show experimental evidence of the model’s improved performance over a natural baseline model and a lexicalized probabilistic contextfree grammar. The terminal symbols are usually words of the sentence.Chapter 9 Context free grammars We present a novel discriminative approach to parsing using structured maxmargin criterion based on the decomposition properties of context free grammars. we restrict our grammars to be in Chomsky normal form as in Sec. Fig. Instead. We show that this framework allows highaccuracy parsing in cubic time by exploiting novel kinds of lexical information. Our models can condition on arbitrary features of input sentences. in the discriminative framework that we adopt. However.
1 (CFG) A CFG G consists of: ◦ A set of nonterminal symbols. if and only if there is a unary production A → D ∈ PU . The value ⊥ is assigned if no subtree dominates the span. A CFG deﬁnes a set of valid parse trees in a natural manner: Deﬁnition 9.1. 3.4 here: Deﬁnition 9. each preleaf node has a single child and this pair of nodes can be labeled as A and D. we introduce a variable Ys. where the set of valid labels of the internal nodes other than the root is N and the set of valid labels for the leaves is T . Indices s and e refer to positions between words. respectively. For convenience. Additionally.e taking values in N ∪⊥ to represent the label of the subtree that exactly covers. The nonterminal symbols with bars (for example. if and only if there is a binary production A → B C ∈ PB .2 (CFG tree) A CFG tree is a labeled directed tree. the words of the sentence from s to e. This tree representation seems quite different from the graphical models we have been considering thus far. there are exponentially many parse trees that produce a sentence of length n. T ◦ A set of productions. PU = {A → D : A ∈ N . rather than to words themselves. divided into Binary productions. respectively. since it represents . C ∈ N } and Unary productions.1. PU }. DT. or dominates. For each span starting with s and an ending with e. we repeat our deﬁnition of a CFG from Sec.. N ◦ A designated set of start symbols. In general. 1993]. hence 0 ≤ s < e ≤ n for a sentence of length n. P = {PB . NS ⊆ N ◦ A set of terminal symbols. VBD) are added to conform to the CNF restrictions.9. B and C. The root’s label set is NS .1. PB = {A → B C : A. we can use an equivalent representation that essentially encodes a tree as an assignment to a set of appropriate variables. All other internal nodes have two children. The set of symbols we use is based on the Penn Treebank [Marcus et al. The “top” symbol Y0.n is constrained to be in NS . B. left and right. However. CONTEXT FREE GRAMMAR MODEL 129 red. NN. D ∈ T }. and this triple of nodes can be labeled as A.
the starting symbol of the sentence. Y6. The gray squares on the diagonal represent the terminal variables. 9. While any parse tree corresponds to an assignment to this set of variables in a straightforward manner. the converse is not true: there are assignments that do not correspond to valid parse trees.1: Two representations of a binary parse tree: (a) nested tree structure.130 CHAPTER 9. We also introduce variables Ys. consider the . respectively.e = ⊥.5 = NP and Y1. The gray squares on the diagonal represent partofspeech tags.4 = ⊥.0 = DT. The row and column number are the beginning and end of the span. respectively. and (b) grid of labeled spans. Fig. Y3. In order to characterize the set of valid assignments Y.s taking values in T to represent the terminal symbol (partofspeech) between s and s + 1. CONTEXT FREE GRAMMARS (a) (b) Figure 9. the ﬁgure shows Y0. 9.1(b) shows the representation of the tree in Fig. If Ys. it is often called a constituent. For example. Empty squares correspond to nonconstituent spans. The row and column number in the grid correspond to the beginning and end of the span.e .1(a) as a grid where each square corresponds to Ys.6 = NN. Empty squares correspond to ⊥ values.
3 and 9. D) abbreviates ys.e = A) = I(y + B→A C∈PB 1 s. Recursing on the two subtrees. B.s. (9. that produces that subtree. y0. ∀A ∈ N . C.s+1 = (A. 0 ≤ s < n. CONTEXT FREE GRAMMAR MODEL 131 constraints that hold for a valid assignment y: 1 s.s+1 = (A.2) holds because that if the span from s to e is dominated by a subtree starting with A (ys.m. I(y e<e ≤n 0 ≤ s < e ≤ n.n .e = A. Conversely.s. B.1) ensures that a unique production spans 0 to n. then there must be a unique production starting with A and some split point m. then there must be a (unique) production that generated it: either starting before s or after e.e = (A. ys. then y represents a valid CFG tree.2) B→C A∈PB 1 s. ∀D ∈ T . C)) I(y 0≤s <s 0 ≤ s < e ≤ n. I(y (9.e = A ∧ ys.3) (9.e. The second set of constraints (9. ∀A ∈ N .n . A. no productions start with A and cover s to e.1) A→B C∈PB 1 s. A)). Starting from the root symbol. I(y 1 s. y0. for m = m are labeled by ⊥.e = A) = I(y s<m<e 1 s.s+1 = A ∧ ys. C)). the third and fourth set of constraints (9. The last two sets of constraints (9. if ys. Similarly.4) as Y. the ﬁrst set of constraints (9. D)).3 and 9.1. s < m < e. We denote the set of assignments y satisfying (9.s = D.1) holds because if the span from s to e is dominated by a subtree starting with A (that is. C) abbreviates ys.m and ym. Proof sketch: It is straightforward to construct a parse tree from y ∈ Y in a topdown manner.n .4) hold since the terminals are generated using valid unary productions. will produce the rest of the tree down to the preterminals.1.m and ym . say splitting at m and specifying the values for y0. D)). I(y 1 s .e = C and ys.e = A).m = B ∧ ym. (9.4) .e = A).e = (B.s.9. In fact the converse is true as well: Theorem 9. ∀A ∈ N . The second set of constraints (9.s+1 = A) = I(y 1 s.s+1 = (A.2) ensures that all other spans y0. 0 ≤ s < n.s.e = (A.e = (B.4) A→D∈PU A→D∈PU The notation ys.m.s = D) = I(y 1 s.m and ym. The ﬁrst set of constraints (9.3 If y ∈ Y.19.n .
e (ys.m. 0 ≤ s < n. We can use a Viterbistyle dynamic programming algorithm called CKY to compute the highest score parse tree in O(Pn3 ) time [Younger. ∀A ∈ N . a weighted CFG assigns a score to each production (this score may depend on the position of the production s.5).m. B. (9. m. More generally. D). ∗ ∗ Ss.e = ⊥ ∨ ys. u The algorithm computes the highest score of any subtree starting with a symbol over each span 0 ≤ s < e ≤ n recursively: ∗ Ss. weighted CFGs do not have the local normalization constraints Eq. C) + Ss. Manning & Sch¨ tze.e (A) = A→D∈PU max Ss. e) such that the total score of a tree is the sum of the score of all the productions used: S(y) = 0≤s<m<e≤n Ss.m (B) + Sm. 9.e ) = 0 if (ys.C:A→B C∈PB D:A→D∈PU P (A → D) = 1. CONTEXT FREE GRAMMARS ensure that the terminals are generated by an appropriate unary productions from the preterminals.n (A).e (ys. B. If the production scores are production log probabilities.m.e = ⊥). 1999].2 Context free parsing A standard approach to parsing is to use a CFG to deﬁne a probability distribution over parse trees.m. Using the arg max’s of the max’s in . 1967. This can be done simply by assigning a probability to each production and making sure that the sum of probabilities of all productions starting with each symbol is 1: P (A → B C) = 1.e (A. The probability of a tree is simply the product of probabilities of the productions used in the tree.e (C). A→B C∈PB max s<m<e ∗ The highest scoring tree has score maxA∈NS S0. ∀A ∈ N .m = ⊥ ∨ ym. However. where Ss.m.s+1 ).s+1 (A) = ∗ Ss. ∀A ∈ N . then the tree score is the tree log probability. (9.s+1 (A.s+1 (ys.132 CHAPTER 9.e ) + 0≤s<n Ss.5) 0 ≤ s < e ≤ n.
m.3. and neighboring positions in the sentence x (e.m.e and xs. where n is the length of the sentence x and xs. y where w ∈ IRd and f is a basis function representation of a sentence and parse tree pair f : X × Y → IRd . m. and the parameters w are the logprobabilities of those productions. Note that this class of discriminants includes PCFG models. and Y is a set of valid parse trees according to a ﬁxed CFG grammar.9. f could include functions which identify the production used together with features of the words at positions s.e are the relevant subsets of the sentence the basis functions depend on. y) = 0≤s≤e≤n f (xs. ys. which includes both spans and span triplets: C = {(s. we can backtrace the highest scoring tree itself.e = S. ys. f (x. The functions we consider take the following linear discriminant form: hw (x) = arg max w f (x.m.e . e. m) : 0 ≤ s ≤ e ≤ n} ∪ {(s. where X is a set of sentences. say according to some lexicographic order of the symbols. yc ). C. ys.m.m. y).m. where we want to learn a function h : X → Y. y) = c∈C f (xc .g. For example.e ) = 1 s. where the basis functions consist of the counts of the productions used in the parse. To simplify notation. We assume that the basis functions decompose with the CFG structure: f (x. We assume that score ties are broken in a predetermined way.3 Discriminative parsing models We cast parsing as a structured classiﬁcation task. 9. e) : 0 ≤ s ≤ m < e ≤ n}.e ) + 0≤s≤m<e≤n f (xs. VP) ∧ I(y mth word(x) = was)). m.e . We could also include functions that identify the label of the span . f (xs.e ). NP. DISCRIMINATIVE PARSING MODELS 133 the computation of S ∗ .e . Hence. we introduce the set of indices.
134
CHAPTER 9. CONTEXT FREE GRAMMARS
from s to e together with features of the word (e.g. f (xs,m , ys,m ) = 1 s,m = NP) ∧ I(y sth word(x) = the)).
9.3.1 Maximum likelihood estimation
The traditional method of estimating the parameters of PCFGs assumes a generative model that deﬁnes P (x, y) by assigning normalized probabilities to CFG productions. We then maximize the joint loglikelihood
i
log P (x(i) , y(i) ) (with some regularization). We com
pare to such a generative grammar of Collins [1999] in our experiments. A alternative probabilistic approach is to estimate the parameters discriminatively by maximizing conditional loglikelihood. For example, the maximum entropy approach [Johnson, 2001] deﬁnes a conditional loglinear model: Pw (y  x) = where Zw (x) = the sample,
i
1 exp{w f (x, y)}, Zw (x)
y
exp{w f (x, y)}, and maximizes the conditional loglikelihood of
log P (y(i)  y(i) ), (with some regularization). The same assumption that
the basis functions decompose as sums of local functions over spans and productions is typically made in such models. Hence, as in Markov networks, the gradient depends on the expectations of the basis functions, which can be computed in O(Pn3 ) time by dynamic programming algorithm called insideoutside, which is similar to the CKY algorithm. However, computing the expectations over trees is actually more expensive in practice than ﬁnding the best tree for several reasons. CKY works entirely in the logspace, while insideoutside needs to compute actual probabilities. Branchandprune techniques, which save a lot of useless computation, are only applicable in CKY. A typical method for ﬁnding the parameters is to use Conjugate Gradients or LBFGS methods [Nocedal & Wright, 1999; Boyd & Vandenberghe, 2004], which repeatedly compute these expectations to calculate the gradient. Clark and Curran [2004] report experiments involving 479 iterations of training for one model, and 1550 iterations for another using similar methods.
9.3. DISCRIMINATIVE PARSING MODELS
135
9.3.2
Maximum margin estimation
We assume that loss function also decomposes with the CFG structure: ˆ (x, y, y) = (xs,e , ys,e , ys,e ) + ˆ ˆ (xs,m,e , ys,m,e , ys,m,e ) =
c∈C
ˆ (xc , yc , yc ).
0≤s≤e≤n
0≤s≤m<e≤n
One approach would be to deﬁne (xs,e , ys,e , ys,e ) = 1 s,e = ys,e ). This would lead to ˆ I(y ˆ ˆ ˆ (x, y, y) tracking the number of “constituent errors” in y. Another, more strict deﬁnition ˆ ˆ would be to deﬁne (xs,m,e , ys,m,e , ys,m,e ) = 1 s,m,e = ys,m,e ). This deﬁnition would lead I(y ˆ ˆ to (x, y, y) being the number of productions in y which are not seen in y. The constituent loss function does not exactly correspond to the standard scoring metrics, such as F1 or crossing brackets, but shares the sensitivity to the number of differences between trees. We have not thoroughly investigated the exact interplay between the various loss choices and the various parsing metrics. We used the constituent loss in our experiments. As in the maxmargin estimation for Markov networks, we can formulate an exponential size QP: min s.t. 1 w2 + C 2 ξi
i
(9.6)
w ∆fi (y) ≥ i (y) − ξi ∀i, y,
where ∆fi (y) = f (x(i) , y(i) ) − f (x(i) , y), and i (y) = (x(i) , y(i) , y). The dual of Eq. (9.6) (after normalizing by C) is given by: max
i,y
1 αi (y) i (y) − C 2 αi (y) = 1,
2
αi (y)∆fi (y)
i,y
(9.7)
s.t.
y
∀i; αi (y) ≥ 0, ∀i, y.
Both of the above formulations are exponential (in the number of variables or constraints) in the lengths (ni ’s) of the sentences. But we can exploit the contextfree structure of the basis functions and the loss to deﬁne a polynomialsize dual formulation in terms of
136
CHAPTER 9. CONTEXT FREE GRAMMARS
marginal variables µi (y): µi,s,e (A) ≡
y:ys,e =A
αi (y), 0 ≤ s ≤ e ≤ n, ∀A ∈ N ; αi (y),
y:ys,s =D
µi,s,s (D) ≡ µi,s,m,e (A, B, C) ≡
0 ≤ s ≤ e ≤ n, ∀D ∈ T ; αi (y), 0 ≤ s < m < e ≤ n, ∀A → B C ∈ PB , 0 ≤ s < n, ∀A → D ∈ PU .
y:ys,m,e =(A,B,C)
µi,s,s,s+1 (A, D) ≡
y:ys,s,s+1 =(A,D)
αi (y),
There are O(PB n3 + PU ni ) such variables for each sentence of length ni , instead of i exponentially many αi variables. We can now express the objective function in terms of the marginals. Using these variables, the ﬁrst set of terms in the objective becomes: αi (y) i (y) =
i,y i,y
αi (y)
c∈C (i)
i,c (yc )
=
i,c∈C (i) ,yc
µi,c (yc )
i,c (yc ).
Similarly, the second set of terms (inside the 2norm) becomes: αi (y)∆fi (y) =
i,y i,y
αi (y)
c∈C (i)
∆fi,c (yc ) =
i,c∈C (i) ,yc
µi,c (yc )∆fi,c (yc ).
As in M3 Ns, we must characterize the set of marginals µ that corresponds to valid α. The constraints on µ are essentially based on the those that deﬁne Y in (9.19.4). In addition, we require that the marginals over the root nodes, µi,0,ni (y0,ni ), sums to 1 over the possible start symbols NS .
9.3. DISCRIMINATIVE PARSING MODELS
137
Putting the pieces together, the factored dual is:
2
max
i,c∈C (i)
µi,c (yc )
i,c (yc )
+C
i,c∈C (i)
µi,c (yc )∆fi,c (yc ) µi,c (yc ) ≥ 0; ∀i, ∀c ∈ C (i) ; ∀i, 0 ≤ s < e ≤ ni , ∀A ∈ N ;
(9.8)
s.t.
A∈NS
µi,0,ni (A) = 1, µi,s,e (A) =
s<m<e
∀i;
µi,s,m,e (A, B, C), µi,s ,s,e (B, A, C)
0≤s <s
A→B C∈PB
µi,s,e (A) = + µi,s,s+1 (A) = µi,s,s (D) =
B→A C∈PB
µi,s,e,e (B, C, A), ∀i, 0 ≤ s < e ≤ ni , ∀A ∈ N ; µi,s,s,s+1 (A, D), µi,s,s,s+1 (A, D), ∀i, 0 ≤ s < ni , ∀A ∈ N ; ∀i, 0 ≤ s < ni , ∀D ∈ T .
B→C A∈PB e<e ≤ni
A→D∈PU
A→D∈PU
The constraints on µ is necessary, since they must correspond to marginals of a distribution over trees. They are also sufﬁcient: Theorem 9.3.1 A set of marginals µi (y) satisfying the constraints in Eq. (9.8) corresponds to a valid distribution over the legal parse trees y ∈ Y (i) . A consistent distribution αi (y) is given by αi (y) = µi,0,ni (y0,ni )
0≤s≤m<e≤ni
µi,s,m,e (ys,m,e ) , µi,s,e (ys,e )
where 0/0 = 0 by convention. Proof sketch: The proof follows from insideoutside probability relations [Manning & Sch¨ tze, 1999]. The ﬁrst term is a valid distribution of starting symbols. Each u
µi,s,m,e (ys,m,e ) µi,s,e (ys,e )
term for m > s corresponds to a conditional distribution over binary productions (ys,e → ys,m ym,e ) that are guaranteed to sum to 1 over split points m and possible productions. Similarly, each
µi,s,s,s+1 (ys,s,s+1 ) µi,s,s+1 (ys,s+1 )
term for corresponds to a conditional distribution over
138
CHAPTER 9. CONTEXT FREE GRAMMARS
unary productions (ys,s+1 → ys,s ) that are guaranteed to sum to 1 over possible productions. Hence, we have deﬁned a kind of PCFG (where production probabilities depend on the location of the symbol), which induces a valid distribution αi over trees. It straightforward to verify that this distribution has marginals µi .
9.4 Structured SMO for CFGs
We trained our maxmargin models using the Structured SMO algorithm with blockcoordinate descent adopted from graphical models (see Sec. 6.1). The CKY algorithm computes similar maxmarginals in the course of computing the best tree as does Viterbi in Markov networks. vi,c (yc ) = max [w fi (y) + i (y)],
y∼yc
αi,c (yc ) = max αi (y).
y∼yc
We also deﬁne vi,c (yc ) = maxyc =yc vi,c (yc ) = maxy∼yc [w fi (y) + i (y)]. Note that we do not explicitly represent αi (y), but we can reconstruct the maximumentropy one from the marginals µi as in Theorem 9.3.1. We again express the KKT conditions in terms of the maxmarginals for each span and span triple c ∈ C (i) and its values yc : αi,c (yc ) = 0 ⇒ vi,c (yc ) ≤ vi,c (yc ); αi,c (yc ) > 0 ⇒ vi,c (yc ) ≥ vi,c (yc ). (9.9)
The algorithm cycles through the training sentences, runs CKY to compute the maxmarginals and performs an SMO update on the violated constraints. We typically ﬁnd that 2040 iterations through the data are sufﬁcient for convergence in terms of the objective function improvements.
9.5 Experiments
We used the Penn English Treebank for all of our experiments. We report results here for each model and setting trained and tested on only the sentences of length ≤ 15 words. Aside
9.5. EXPERIMENTS
139
from the length restriction, we used the standard splits: sections 221 for training (9753 sentences), 22 for development (603 sentences), and 23 for ﬁnal testing (421 sentences). As a baseline, we trained a CNF transformation of the unlexicalized model of Klein and Manning [2003] on this data. The resulting grammar had 3975 nonterminal symbols and contained two kinds of productions: binary nonterminal rewrites and tagword rewrites. Unary rewrites were compiled into a single compound symbol, so for example a subjectgapped sentence would have label like S + VP. These symbols were expanded back into their source unary chain before parses were evaluated. The scores for the binary rewrites were estimated using unsmoothed relative frequency estimators. The tagging rewrites were estimated with a smoothed model of P (wt), also using the model from Klein and Manning [2003]. In particular, Table 9.2 shows the performance of this model (GENERATIVE): 87.99 F1 on the test set. For the
BASIC
maxmargin model, we used exactly the same set of allowed rewrites
(and therefore the same set of candidate parses) as in the generative case, but estimated their weights using the maxmargin formulation with a loss that counts the number of wrong spans. Tagword production weights were ﬁxed to be the log of the generative P (wt) model. That is, the only change between GENERATIVE and BASIC is the use of the discriminative maximummargin criterion in place of the generative maximum likelihood one for learning production weights. This change alone results in a small improvement (88.20 vs. 87.99 F1 ). On top of the basic model, we ﬁrst added lexical features of each span; this gave a
LEXICAL
model. For a span s, e of a sentence x, the base lexical features were:
◦ xs , the ﬁrst word in the span ◦ xs−1 , the preceding adjacent word ◦ xe−1 , the last word in the span ◦ xe , the following adjacent word ◦ xs−1 , xs ◦ xe−1 , xe ◦ xs+1 for spans of length 3
140
CHAPTER 9. CONTEXT FREE GRAMMARS
Model GENERATIVE BASIC LEXICAL LEXICAL+AUX
P 87.70 87.51 88.15 89.74
R 88.06 88.44 88.62 90.22
F1 87.88 87.98 88.39 89.98
Table 9.1: Development set results of the various models when trained and tested on Penn treebank sentences of length ≤ 15.
Model GENERATIVE BASIC LEXICAL LEXICAL+AUX COLLINS 99
P 88.25 88.08 88.55 89.14 89.18
R F1 87.73 87.99 88.31 88.20 88.34 88.44 89.10 89.12 88.20 88.69
Table 9.2: Test set results of the various models when trained and tested on Penn treebank sentences of length ≤ 15.
These base features were conjoined with the span length for spans of length 3 and below, since short spans have highly distinct behaviors (see the examples below). The features are lexical in the sense than they allow speciﬁc words and word pairs to inﬂuence the parse scores, but are distinct from traditional lexical features in several ways. First, there is no notion of headword here, nor is there any modeling of wordtoword attachment. Rather, these features pick up on lexical trends in constituent boundaries, for example the trend that in the sentence The screen was a sea of red., the (length 2) span between the word was and the word of is unlikely to be a constituent. These nonhead lexical features capture a potentially very different source of constraint on tree structures than headargument pairs, one having to do more with linear syntactic preferences than lexical selection. Regardless of the relative merit of the two kinds of information, one clear advantage of the present approach is that inference in the resulting model remains cubic (as opposed to O(n5 )), since the dynamic program need not track items with distinguished headwords. With the addition of these features, the accuracy moved past the generative baseline, to 88.44.
1999]. but also the following: the preceding. We used two such auxiliary classiﬁers.62 each. this analysis is counter to the trend of today to be a oneword constituent.5. As a result. based on a bundle of features including the list above. not bracket labels). 2003].58). lastfollowing. To situate these numbers with respect to other models. but made the learning phase faster.12 F1 . last. were constituents or not.9. pairs of tags such as precedingﬁrst. this model makes this parse decision correctly. We then trained the auxiliary classiﬁers on each fold.1 In the LEXICAL model.which In this length 1 case. these features have quite large positive weights: 0. However. and following tag in the span. Otherwise. To ensure that such features are as noisy on the training data as the test data. The ﬁrst feature was the prediction of the generative baseline. and their predictions used as features on the development and test sets. precedingfollowing. consider the sentence The Egyptian president said he would visit Libya today to resume the talks. For this kind of feature.. the parser in [Collins.While the ﬂat classiﬁer alone was quite poor (P 78. EXPERIMENTS 141 As a concrete (and particularly clean) example of how these features can sway a decision. and using their predictions as features on the other fold. 1 . we split the training into two folds. in isolation. Another kind of feature that can usefully be incorporated into the classiﬁcation process is the output of other. These features represent the preference of the word today for being the ﬁrst and last word in constituent spans of length 1. the resulting maxmargin model (LEXICAL + AUX) scored 89. ﬁrst. auxiliary classiﬁers.94 / F1 70. Two features relevant to this trend are: (CONSTITUENT ∧ ﬁrstword = today ∧ length = 1) and (CONSTITUENT ∧ lastword = today ∧ length = 1). this feature added little information. The second feature was the output of a ﬂat classiﬁer which was trained to predict whether single spans. its weight will be artiﬁcially (and detrimentally) high. one must take care that its reliability on the training not be vastly greater than its reliability on the test set. these are the same feature. ﬁrstlast. giving a prediction feature for each span (these classiﬁers predicted only the presence or absence of a bracket over that span.77 / R 63. and the entire tag sequence. Tag features on the test sets were taken from a pretagging of the sentence by the tagger described in [Toutanova et al. The auxiliary classiﬁers were then retrained on the entire training set. Note also that the features are conjoined with only one generic label class “constituent” rather than speciﬁc constituent types. The generative model incorrectly considers Libya today to be a base NP.
Collins. Moreover. an initial parser is used to generate a number of candidate parses. 2004. 2001. Clark & Curran. . rather than expectations over all trees (for example using the insideoutside algorithm). This distinction can be very signiﬁcant. 2004. Kaplan et al. For example. our method is an endtoend discriminative model over the full space of parses. 2002.6 Related work A number of recent papers have considered discriminative approaches for natural language parsing [Johnson et al. reranking and dynamic programming approaches. 1999. 2002. 2001. 2000.. 2004. 41% of the correct parses were not in the candidate pool of ∼30best parses. 1999. which consider only a prepruned selection of “good” parses. a large number of candidate parse trees are represented compactly in a parse tree forest or chart. CONTEXT FREE GRAMMARS is generative.. 2003]. in the work of Collins [2000]. In dynamic programming methods. Shen et al.69 over the same train/test conﬁguration. Miyao & Tsujii. and intricately smoothed scores 88. The method we presented has several compelling advantages. as the set of nbest parses often does not contain the true parse. 9.. several approaches [Johnson. Geman & Johnson. the decoding and parameter estimation problems can be solved using dynamic programming algorithms. 2004]. 2002. these approaches fall into two categories.. Unlike previous dynamic programming approaches. our method incorporates an articulated loss function which penalizes larger tree discrepancies more severely than smaller ones. which were based on maximum entropy estimation. Kaplan et al. despite the exponential number of trees represented by the parse forest.. Clark & Curran. Miyao & Tsujii. Collins.142 CHAPTER 9. Collins. where variants of the insideoutside algorithm can be used to efﬁciently calculate gradients of the loglikelihood function. Geman & Johnson. A discriminative model is then used to choose between these candidates. 2004] are based on conditional loglinear (maximum entropy) models. 2000. Broadly speaking. Johnson. lexicalized. Unlike reranking methods. Given sufﬁciently “local” features. 2002. For example. the structured SMO we use requires only the calculation of Viterbi trees. In reranking methods [Johnson et al.
discriminative methods are inherently expensive. This tradeoff between the complexity. the maxmargin approach does have the potential to incorporate many new kinds of features over the input. In our experiments.7. Generative approaches are vastly cheaper to train.7 Conclusion We have presented a maximummargin approach to parsing. and the current feature set allows limited lexicalization in cubic time. while still decomposing in a way that exploits the shared substructure of parse trees in the standard way. which took about 100 9.9.) BASIC model. CONCLUSION 143 This allows a range of optimizations that prune the space of parses (without making approximations) not possible for maximum likelihood approaches which must extract basis function expectations from the entire set of parses. unlike other lexicalized models (including the Collins model which it outperforms in the present limited experiments). At training time. . accuracy and efﬁciency of a parsing model is an important area of future research. since they must only collect counts from the training set. which allows a discriminative SVMlike objective to be applied to the parsing problem. 2040 iterations were generally required for convergence (except the iterations. On the other hand. It is worth considering the cost of this kind of method. Our framework permits the use of a rich variety of input features. since they all involve iteratively checking current model performance on the training set. which means parsing the training set (usually many times).
We provide some background on this problem. We have shown a compact maxmargin formulation for bipartite matchings in Ch. to identify functional genetic analogues in different organisms. Throughout this chapter. Identifying disulﬁde bridges formed by cysteine residues is critical in determining the structure of proteins.Chapter 10 Matchings We address the problem of learning to match: given a set of input graphs and corresponding matchings. quadratic program. Recently proposed models have formulated this prediction task as a maximum weight perfect matching problem in a graph containing cysteines as nodes with edge weights measuring the attraction strength of the potential bridges. We motivate this problem using an application in computational biology. for example. In this chapter. showing that our framework achieves stateoftheart performance on the task. to ﬁnd marker correspondences in vision problems. We exploit combinatorial properties of the perfect matching problem to deﬁne a compact. We use kernels to efﬁciently learn very rich (infact. but nonbipartite matchings can be used for many other tasks. Bipartite matchings are used in many ﬁelds. 4. 144 . we use the problem of disulﬁde connectivity prediction as an example. disulﬁde connectivity prediction. ﬁnd a parameterized edge scoring function such that the correct matchings have the highest score. to map words of a sentence in one language to another. we focus on a more complex problem of nonbipartite matchings. inﬁnitedimensional) models and present experiments on standard protein databases. convex.
Such bonds are a very important feature of protein structure since they enhance conformational stability by reducing the number of conﬁgurational states and decreasing the entropic cost of folding a protein into its native state [Matsumura et al.1 Disulﬁde connectivity prediction Proteins containing cysteine residues form intrachain covalent bonds known as disulﬁde bridges.1. Since a sequence may contain any number of cysteine residues. 2004]. Vullo & Frasconi. 2003. Alternatively. and predicting the exact connectivity among bonded cysteines. as well as the protein datasets.. 1 . Klepeis & Floudas. Recently. since the disulﬁde connectivity pattern imposes structure constraints. Baldi et al. it can be used to reduce the search space in both protein folding prediction as well as protein 3D structure prediction. evolutionary information in the form of multiple alignment proﬁles. there has been increased interest in applying computational techniques to the task of predicting the intrachain disulﬁde connectivity [Fariselli & Casadio. the task of predicting the connectivity pattern is typically decomposed into two subproblems: predicting the bonding state of each cysteine in the sequence.. etc. We predict the connectivity pattern by ﬁnding the maximum weighted matching in a graph in which each vertex represents a cysteine residue. Thus. 1994].. which may or may not participate in disulﬁde bonds. We parameterize the this attraction strength via a linear combination of features. secondary structure or solvent accessibility information.. 2001]. They do so mostly by imposing strict structural constraints due to the resulting links between distant regions of the protein sequence [Harrison & Sternberg. 2001. DISULFIDE CONNECTIVITY PREDICTION 145 10. We thank Pierre Baldi and Jianlin Cheng for introducing us to the problem of disulﬁde connectivity prediction and providing us with preliminary draft of their paper and results of their model. 2002. the development of efﬁcient. there are methods [Baldi et al. Knowledge of the exact disulﬁde bonding pattern in a protein provides information about protein structure and possibly its function and evolution. 2004] that predict the connectivity pattern without knowing the bonding state of each cysteine1 . which can include the protein sequence around the two residues. scalable and accurate methods for the prediction of disulﬁde bonds has numerous practical applications. 2004. and each edge represents the “attraction strength” between the cysteines it connects [Fariselli & Casadio.10. Fariselli et al. 1989]. Furthermore.
The space of matchings Y is very large. this model was used by Fariselli and Casadio [2001]. we seek a function h : X → Y that maps inputs x ∈ X to output matchings y ∈ Y.146 CHAPTER 10. For example. (10. MATCHINGS 10.1 has 6 cysteines (nodes). each node is connected to at most one other node. However.1) For disulﬁde connectivity prediction. superexponential in the number of nodes in a graph. X is the space of protein sequences and Y is the space of matchings of their cysteines. we assume complete graphs. then there are Li (Li − 1)/2 edge variables. the number of possible perfect matchings is (2ni )! 2ni ni ! (i) (which is Ω(( ni )ni ). For example. calculated by assuming that all residues in the local neighborhoods of the two cysteines make contact. 15 potential bonds (edges) and 15 possible perfect matchings. y(i) )}m of input graphs and i=1 output matchings. If example i has Li nodes. in fact. Our hypothesis class is maximum weight matchings: hs (x) = arg max y∈Y jk sjk (x)yjk . In nonperfect matchings. 1ANS protein in Fig. The training data consists of m examples S = {(x(i) . but very little needs to be changed to handle sparse graphs. Y has interesting and complex combinatorial structure which we exploit to learn h efﬁciently. superexponential in 2 ni ). Their model assigns an attraction strength sjk (x) to each pair of cysteines.2) . so y(i) is a binary vector of dimension Li (Li − 1)/2. (10. We represent each possible edge between nodes j and k (j < k) in example i using a binary variable yjk . We consider a simple but very general class of attraction scoring functions deﬁned by a weighted combination of features or basis functions: sjk (x) = d wd fd (xjk ) = w f (xjk ). 10. then for complete graphs with even number of vertices Li . given a protein sequence. Let ni = Li /2.2 Learning to match Formally. We assume that the input x deﬁnes the space of possible matchings using some deterministic procedure. and summing contact potentials for pairs of residues. In a perfect matching. each node is connected exactly one other node. we construct a complete graph where each node corresponds to a cysteine. for example. For simplicity.
Actual disulﬁde connectivity is shown in yellow in the 3D model and the graph of potential bonds.10. and w fi (y) ≡ w f (x(i) . y). is: min jk w f (xjk )yjk . w fi (y(i) ) ≥ w fi (y) + i (y). which enumerates all perfect 1 w2 s. 2 (10. where xjk is the portion of the input x that directly relates to nodes j and k. 10. ∀i. We assume that the user provides the basis functions. for the model: hw (x) = arg max y∈Y jk w f (xjk )yjk .4).3) Below.4) The number of constraints in this formulation is superexponential in the number of nodes in each example.2. and that our goal is to learn the weights w. For example. and then with a polynomial one (Sec. ∀y ∈ Y (i) . 3D structure. and graph of potential disulﬁde bonds. 10. fd (xjk ) is a realvalued basis function and wd ∈ IR. LEARNING TO MATCH 147 RSCCPCYWGGCPWGQNCYPEGCSGPKV 1 2 3 4 5 6 2 3 1 4 5 6 Figure 10.1: PDB protein 1ANS: amino acid sequence. . The naive formulation of the maxmargin estimation. In the following sections we present two maxmargin formulations.3). or the predicted secondary structure in the neighborhood of each cysteine. the basis functions can represent arbitrary information about the two cysteine neighborhoods: the identity of the residues at speciﬁc positions around the two cysteines.t. ﬁrst with an exponential set of constraints (Sec. y) ≡ matchings for each example i. we will abbreviate w f (x. (10.
Hence. . The subset constraints (in the last line of Eq. we have a single max constraint for each i: min 1 w2 s. Li }. Under the assumption of Hamming distance loss (or any loss function that can be written as a sum of terms corresponding to edges). 1 ≤ j ≤ Li . 1965]. but this number is asymptotically smaller than the number of possible matchings . this maximization is equivalent (up to a constant term) to a maximum weighted matching problem.jk instead of binary variables yjk .t.jk ≤ (V  − 1). k (i) (i) (10.jk ≤ 1 require that the number of bonds incident on a node is less k or equal to one. the Hamming distance between y(i) and y can be written as (1 − y) y(i) + (1 − y(i) ) y = 1 y(i) + (1 − 2y(i) ) y. 1973. . 4. MATCHINGS 10. 1976].k∈V 1 µi. the maximum weight matching where edge jk has weight w f (xjk )+(1 −2yjk ) (plus the constant 1 y(i) ) gives the value of maxy∈Y (i) [w fi (y) + i (y)]. 2003].6)) ensure that solutions to the LP are integral [Edmonds.5) The key to solving this problem efﬁciently is the lossaugmented inference maxy∈Y (i) [w fi (y) + i (y)]. V  ≥ 3 and odd.6) µi. Note that since the y variables are binary. Note that we have an exponential number of constraints (O(2(Li −1) )). 2 V ⊆ {1. max jk (i) (i) (i) µi. . It can also be solved as a linear program.jk [w f (xjk ) + (1 − 2yjk )] µi. .jk = 1 to ensure exactly one bond. ∀i. Lawler. (10. This problem can be solved in O(L3 ) time [Gabow. It is an open problem to derive a polynomial sized LP formulation for perfect matchings [Schrijver.jk ≥ 0.148 CHAPTER 10. 1 ≤ j < k ≤ Li .jk ≤ 1. where we introduce continuous variables µi. s. w fi (y(i) ) ≥ max [w fi (y) + i (y)]. these constraints are changed to µi. For perfect matchings.3 Minmax formulation Using the minmax formulation from Ch. j. .t. The constraints k µi. 2 y∈Y (i) (10.
9) w fi (y ) + ξi ≥ di + λi bi . (10.t. The dual of the LP in Eq. Fi is a matrix of basis function coefﬁcients such that the component jk of the vector Fi w is w f (xjk ) and ci = (1 − 2y(i) ).5) and combine the minimization over λ with minimization over w. ∀i.t.6): max [w fi (y) + i (y)] = di + max µi [Fi w + ci ]. MINMAX FORMULATION 149 We can write the lossaugmented inference problem in terms of the LP in Eq. (10. (10. (10. ∀i. Ai µi ≤bi µi ≥0 y∈Y (i) where: di = 1 y(i) .6) is min λi bi s. min s.8) In case that our basis functions are not rich enough to predict the training data perfectly. Ai λi ≥ Fi w + ci . Ai and bi are the appropriate constraint coefﬁcient matrix and right hand side vector. Note that the dependence on w is linear and occurs only in the objective of the LP. ∀i. λi ≥ 0. µi is a vector of length Li (Li − 1)/2 indexed by bond jk. Ai λi ≥ Fi w + ci . ξi ≥ 0. (10. ∀i. The parameter C allows the user to trade off violations of the constraints with ﬁt to the . ∀i. ∀i. Ai λi ≥ Fi w + ci . λi ≥ 0. ∀i.t. 1 w2 + C 2 (i) ξi i (10.10. 1 w2 2 w fi (y(i) ) ≥ di + λi bi .7) (i) We plug it into Eq.3. we can introduce a slack variable ξi for each example i to allow violations of the constraints and minimize the sum of the violations: min s. respectively. λi ≥ 0.
1965] A perfect matching M is a maximum weight perfect matching if and only if there are no augmenting alternating cycles. Let M be a perfect matching for a complete undirected graph G = (V. minmax and certiﬁcate). we develop an equivalent polynomial size formulation. 10. MATCHINGS 30 Perfect Matchings 25 Minmax Certificate 20 LogNumber of Constraints 15 10 5 0 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Number of Bonds Figure 10.1 [Edmonds. Our formulation is a linearlyconstrained quadratic program. Theorem 10. number of bonds (xaxis) in the three formulations (perfect matching enumeration. An alternating cycle is augmenting with respect to M if the score of the edges in the matching M is smaller that the score of the edges not in the matching M . the edges alternate between those that belong to M and those that do not.4 Certiﬁcate formulation Rather than solving the lossaugmented inference problem explicitly. We consider perfect matchings and then provide a reduction for the nonperfect case.4. .2: Log of the number of QP constraints (yaxis) vs. In an alternating cycle/path in G with respect to M . we can focus on ﬁnding a compact certiﬁcate of optimality that guarantees that y(i) = arg maxy [w fi (y) + i (y)]. data. E). albeit with an exponential number of constraints. In the next section.150 CHAPTER 10.
j + 1) is in M . Conj sider an alternating cycle C. We begin by negating the score of those edges not in M . j k sjk ≥ d1 − d0 . . For j j+1 .10) Theorem 10. the shortest path to j ending with an edge not in M plus the edge jk (or kj) is an alternating path to k ending with an edge in M . sjk ≥ d0 − d1 .l + l−1 j=1 sj. Since any alternating paths from r to j can be shortened (or left the same length) by removing the cycles they contain. (10. We also refer to the score sjk as the length of the edge jk. the edge (j. The following constraints capture this distance function. / (Only if) Suppose a distance function {de } satisﬁes the constraints in Eq. kj ∈ M . for all j (for j = r.10).j+1 . (If) Suppose there are no augmenting alternating cycles. For each odd j. 0 otherwise. . An alternating cycle is augmenting if and only if its length is negative.2 There exists a distance function {de } satisfying the constraints in j Eq. A condition ruling out negative length alternating cycles can be stated succinctly using a kind of distance function.j+1 ≥ d1 − d0 . Proof. set d0 = d1 = 0). Let de . l and the ﬁrst edge. j j k k so the constraint is satisﬁed.10) if and only if no augmenting alternating cycles exist. we can rule out such cycles by considering shortest paths. The length of the path is s(C) = s1. (10. denote the length of the shortest distance alternating path from r to j. where e = 1 if the last edge of the path is in M .4. This path is longer or same length as the shortest path to k ending with an edge in M : sjk + d0 ≥ d1 (or skj + d0 ≥ d1 ). Then let d0 and d1 be the length of those paths. 2). j k ∀ jk ∈ M . . These shortest distances are welldeﬁned if and only if there are no negative alternating cycles.4. the two shortest paths to j (one ending with M edge and one not) contain no cycles. . Then for j j r r any jk (or kj) in M .10. We renumber the nodes such that the cycle passes through nodes 1. is in M . k j sjk ≥ d1 − d0 . (1. Instead. with j ∈ V . j e ∈ {0. 1}. CERTIFICATE FORMULATION 151 The number of alternating cycles is exponential in the number of vertices. (10. / ∀ jk ∈ M. 2. Pick an arbitrary root node r. In the discussion below we assume that each edge score sjk has been modiﬁed this way. Similarly for jk. k j sjk ≥ d0 − d1 . so simply enumerating all of them will not do. so sj.
152 CHAPTER 10. 10. Then the following joint convex program in w and d computes the maxmargin parameters: min s. in case that our basis functions are not rich enough to predict the training data perfectly. l). We extend the matching by replicating its edges in the copy and for each unmatched node. Hi and Gi be matrices j of coefﬁcients and qi be a vector such that Hi w + Gi di ≥ qi represents the constraints in Eq. so sj. Finally. In our learning formulation we have the lossaugmented edge weights sjk = (2yjk − 1)(w f (xjk )+1−2yjk ). Perfect matchings in this graph projected onto the original graph correspond to nonperfect matchings in the original graph. so s1. (1. The comparison between the lognumber of constraints for our three equivalent QP formulations (enumeration of all perfect matchings. 1 w2 2 H i w + G i di ≥ q i . j + 1) is not in M . j+1 j is not in M . introduce an edge to its copy. we have: 1 l l−1 l−1 s(C) ≥ d0 1 − d1 l + j=1. j+1 j j=2. We deﬁne f (xjk ) ≡ 0 for edges between the original and the copy. minmax and certiﬁcate) is shown in Fig. Let di be a vector of distance variables de .l ≥ d0 − d1 .10) for example i. We create a new graph by making a copy of the nodes and the edges and adding edges between each node and the corresponding node in the copy. The xaxis is the number of edges in the matching (number of nodes divided by two). the edge (j. (10. Summing the edges. . (i) (i) (i) Once again.even Hence all alternating cycles have nonnegative length.2.t. The case of nonperfect matchings can be handled by a reduction to perfect matchings as follows [Schrijver.j+1 ≥ d0 − d1 .odd [d1 j+1 − d0 ] j + [d0 − d1 ] = 0. (10. the last edge. we can introduce a slack variable vector ξi to allow violations of the constraints. MATCHINGS even j. 2003].11) ∀i.
8). The polynomialsized representation in Eq. The primal and dual solutions are related by: w= i jk (Cyjk − αjk )f (xjk ) (i) (i) (i) (10. ∀i. (10.j kl∈E (i) mn∈E (j) (i) (j) (i) (j) (i) (i) (i) (j) (j) (10. α(i) ≥ 0. Let α(i) be the vector of dual variables for example i.14) can be used to compute the attraction strength sjk (x) in a kernelized manner at prediction time.t. The only occurrence of feature vectors is in the expansion of the squarednorm term in the objective: Cyjk − αjk f (xkl ) f (x(j) ) Cyjk − αjk mn i. (10.12) s. we can work with its dual. Each training example i has Li (Li − 1)/2 dual variables.14) Eq. ∀i.5 Kernels Instead of directly optimizing the primal problem in Eq.5. xmn ). The dual quadratic optimization problem has the form: 2 (i) max i ci α(i) − 1 2 Cyjk − αjk f (xjk ) i jk∈E (i) (i) (i) (i) (10.11) is similarly kernelizable. Ai α(i) ≤ Cbi . we can efﬁciently map the original features f (xjk ) to a highdimensional space. we can apply the kernel trick and let f (xkl ) f (xmn ) = K(xkl . and αjk is the dual variable associated with the features corresponding to the edge jk. . Thus. KERNELS 153 10.13) Therefore.10. (10.
Fariselli & Casadio. so we are able to perform learning on over 90% of all proteins. After redundance reduction there are a total of 1018 sequences.. 2000]. Baldi et al. 2001]. MATCHINGS 10. The DIPRO2 dataset2 was compiled and made publicly available by Baldi et al. The DIPRO2 contains 567 such sequences. although the procedure had less effect due to the redundance reduction applied by the authors of the 2 http://contact.. Sequence similarity was derived using an allagainstall rigorous SmithWaterman local pairwise alignment [Smith & Waterman. as of May 2004. Vullo & Frasconi.. SP39 contains 446 sequences containing between 2 and 5 bonds. 2004. and only 53 sequences with a higher number of bonds. In addition. with the constraint that proteins no proteins with sequence similarity of more than 30% belong to different subsets. We split SP39 into 4 different subsets. The same dataset was used in earlier work [Baldi et al. we adopt the same dataset splitting procedure as the one used in previous work [Fariselli & Casadio. 2000]. In order to avoid biases during testing.154 CHAPTER 10. which contain intrachain disulﬁde bonds. 1981] (with the BLOSUM65 scoring matrix.uci. [2004]. Even though our method is applicable to both sequences with a high number of bonds or sequences in which the bonding state of cysteine residues is unknown. and has a total of 726 proteins. Pairs of chains whose alignment is less than 30 residues were considered unrelated. The DIPRO2 dataset was split similarly into 5 folds. The SP39 dataset is extracted from the SwissProt database of proteins [Bairoch & Apweiler. 2004]. gap penalty 12 and gap extension 4).edu/bridge. 1983]. It contains only sequences with experimentally veriﬁed disulﬁde bridges. and we have followed the same procedure for extracting sequences from the database. and the number of bonds is between 2 and 5 (since the case of 1 bond is trivial). Vullo & Frasconi. we report results for the case where the bonding state is known. the sequences are annotated with secondary structure and solvent accessibility information derived from the DSSP database [Kabsch & Sander.html . It consists of all proteins from PDB [Berman et al. 2004.ics. 2001.6 Experiments We assess the performance of our method on two datasets containing sequences with experimentally veriﬁed bonding patterns: DIPRO2 and SP39. release 39. 2004. There are 430 proteins with 2 and 3 bonds and 137 with 4 and 5 bonds.
3 since for the case of proteins containing between two and ﬁve bonds. augmented with the linear distance between the cysteine residues. For each pair of candidate cysteines {j. We are currently working on an implementation of the certiﬁcate formulation Sec. the input at each position of a local window is the frequency of occurrence of each of the 20 aminoacids in the alignments. 10. As in Baldi et al. EXPERIMENTS 155 dataset. with γ ∈ [0. the actual sequence is expanded to a 20 × n binary vector. k}.5 and an RBF kernel K(xjk .. We used commercial QP software (CPLEX) to train our models. Thus. in which the entries denote whether or not a particular amino acid occurs at the particular position. counting from the left end of the window.4 to handle longer sequences and nonperfect matchings (when bonding state is unknown). where j < k. it is more efﬁcient due to the low constants in the exponential problem size. Models The experimental results we report use the dual formulation of Sec. 1997]. Training time took around 70 minutes for 450 examples. the 21st entry in the vector represents whether or not the aminoacid Alanine occurs at position 2 of the local window. xlm ) = exp( xjk −xlm γ 2 ). [2004]. SEQUENCE. 10]. We use the exponential sized represen tation of Sec.6. PROFILE. 10. we describe several models we used.1. . The features we experimented with were all based on the local regions around candidate cysteine pairs. we use multiple sequence alignment proﬁle information. Multiple alignments were computed by running PSIBLAST using default settings to align the sequence with all sequences in the NR database [Altschul et al. The ﬁnal set of features for each {j. we augment the features of each model with the number of residues between j and k. The models below use windows of size n = 9. Below. For example. k} pair of cysteines is simply the two local windows concatenated together.10. The ﬁrst model. we extract the aminoacid sequence in windows of size n centered at j and k. 10. is the same as SEQUENCE. The second model. except that instead of using the actual protein sequence. using a sequential optimization procedure which solves QP subproblems associated with blocks of training examples. uses the features described above: for each window.
In another experiment. As Table 10.1: Numbers indicate Precision / Accuracy. PROFILESS models on the DIPRO2 dataset.75 0. the evolutionary information captured by the aminoacid alignment frequencies plays an important role in increasing the performance of the algorithm. In each row.60 / 0.52 0.43 / 0. and slightly lower accuracies for the case of 2 and 3 bonds. As we can see from Table 10.06 PROFILE 0.69 0. which represent the current topperforming system.73 / 0. (b) Performance of SEQUENCE.16 (a) DAGRNN 0.24 0.75 / 0.29 / 0.. The ﬁrst set of experiments compares our model to preliminary results reported in Baldi et al.48 0.11 K 2 3 4 5 SEQUENCE 0. with similar or better levels of precision for all bond numbers.74 / 0. PROFILESS.59 0. 2004] which represent the best currently published results. (a) Performance of PROFILE model on SP39 vs.74 0. we show the performance gained by using multiple alignment information by comparing the results of the SEQUENCE model with the PROFILE.70 0. the best performance is in bold. augments the PROFILE model with secondary structure and solventaccessibility information.17 (b) PROFILESS 0. PROFILE.79 0.62 / 0.44 / 0.74 / 0. Results and discussion We evaluate our algorithm using two metrics: accuracy and precision.67 / 0. The accuracy measure counts how many full connectivity patterns were predicted correctly. MATCHINGS K 2 3 4 5 PROFILE 0.61 / 0.1(b).46 / 0. The DSSP program produces 8 types of secondary structure. The third model.70 / 0.70 / 0.51 0. We perform 4fold crossvalidation on SP39 in order to replicate their setup.156 CHAPTER 10. [2004].79 / 0.41 / 0.27 0.59 / 0.44 / 0.44 0.21 0. .73 0. preliminary results of the DAGRNN model [Baldi et al.56 0.43 / 0. so we augment each local window of size n with an additional length 8 × n binary vector.1 shows. whereas precision measures the number of correctly predicted bonds as a fraction of the total number of possible bonds. as well as a length n binary vector representing the solvent accessibility at each position. the PROFILE model achieves comparable results.62 / 0.27 Table 10.
4.7 Related work The problem of inverse perfect matching has been studied by Liu and Zhang [2003] in the inverse combinatorial optimization framework we describe in Sec. 10.3: Given a set of nominal weights w0 and a perfect matching M .1(b) shows that the gains are signiﬁcant. They do not provide a compact optimization problem for this related but . we examine the role that secondary structure and solventaccessibility information plays in the model PROFILESS. both accuracy and precision increase as the amount of data grows. Fig.7. which is not a maximum one with respect to w0 . The same phenomenon is observed by Vullo and Frasconi [2004] in their comparison of sequence and proﬁlebased models. since it validates the applicability of our algorithm as the availability of highquality disulﬁde bridge annotations increases with time. Such behavior is very promising. RELATED WORK 157 2 and 3 bonds 100% 90% 80% 70% 60% 50% 40% 30% 20% 100 150 200 250 300 Training Set Size 350 Accuracy (2 Bonds) Precision (3 Bonds) Accuracy (3 Bonds) 4 and 5 bonds 85% 75% 65% 55% 45% 35% 25% 15% 5% Precision (4 Bonds) Accuracy (4 Bonds) Precision (5 Bonds) Accuracy (5 Bonds) 400 450 100 150 200 250 300 Training Set Size 350 400 450 (a) (b) Figure 10. As a ﬁnal experiment. ∞. ﬁnd a new weight vector w that makes M optimal and minimizes w0 − wp for p = 1. 10. especially for sequences with 3 and 4 bonds. perhaps through more complex kernels.10. This highlights the importance of developing even richer features.3 shows the performance of the PROFILE model as training set size grows. We can see that for sequences of all bond numbers. The trend is more pronounced for sequences with 4 and 5 bonds because they are sparsely distributed in the dataset. Table 10.3: Performance of PROFILE model as training set size changes for proteins with (a) 2 and 3 bonds (b) 4 and 5 bonds.
Their method uses Directed Acyclic Graph Recursive Neural Networks [Baldi & Pollastri. relying instead on the ellipsoid method with constraint generation. but the results are not comparable with those in other publications. The prediction problem is solved using a weighted graph matching based on these probabilities. where bond prediction occurs as part of predicting βsheet topology in proteins. Residuetoresidue contacts (which include disulphide bridges) are predicted by solving a series of constrained integer programming problems. In Baldi et al. the authors achieve the current stateoftheart performance on the task. and edge weights correspond to attraction strength. It also improves on previous methods by not assuming knowledge of bonding state. The problem of learning the edge weights was addressed using a simulated annealing procedure. The method is computationally limited to sequences of 2 to 5 bonds.158 CHAPTER 10. The method in Vullo and Frasconi [2004] takes a different approach to the problem. MATCHINGS different task. SVMs. It also uses multiple alignment proﬁle information and demonstrates its beneﬁts over sequence information. 2003] to predict bonding probabilities between cysteine pairs. the approach can be used to predict disulﬁde bonds with no knowledge of bonding state. They modeled the prediction problem as ﬁnding a perfect matching in a weighted graph where vertices represent bonded cysteine residues. The task of predicting whether or not a cysteine is bonded has also been addressed using a variety of machine learning techniques including neural networks. especially for the case of 2 and 3 disulﬁde bonds. and uses a recursive neural network architecture [Frasconi et al. [2004]. [2002]. Interestingly. Their method is only applicable to the case when bonding state is known. At prediction time the pattern scores are used to perform an exhaustive search on the space of all matchings. The problem of disulﬁde bond prediction ﬁrst received comprehensive computational treatment in Fariselli and Casadio [2001]. It scores candidate connectivity patterns according to their similarity with respect to the correct pattern. In Fariselli et al. 1998] to score candidate patterns. A different approach to predicting disulﬁde bridges is reported in Klepeis and Floudas [2003]. and HMMs . Their method performs better than the one in Vullo and Frasconi [2004] and is also the only one which can cope with sequences with more than 5 bonds. the authors switch to using a neural network for learning edge weights and achieve better performance..
or extended local neighborhoods of the protein sequence. . 2004]. CONCLUSION 159 [Fariselli et al. Ceroni et al. which have already addressed the more challenging setting. Frasconi et al..8 Conclusion In this chapter.10.. 2002.8. it remains to experimentally determine how well the method performs. we derive a compact convex quadratic program for the problem of learning to match. Fiser & Simon. We apply our framework to the task of disulﬁde connectivity prediction. requiring an exponential number of constraints. We present two formulations: one which is based on a linear programming approach to matching. such as convolution kernels for protein sequences. the use of kernels makes it easy to incorporate rich sets of features such as secondary structure information. 2000.. Our approach learns a parameterized scoring function that reproduces the observed matchings in a training set. We also hope to explore the more challenging problem of disulﬁde connectivity prediction when the bonding state of cysteines is unknown. Our experimental results show that the method can achieve performance comparable to current topperforming systems. 10... especially in comparison to existing methods [Baldi et al. it will be worthwhile to examine how other kernels. Martelli et al. Furthermore. will affect performance. 2003] Currently the top performing systems have accuracies around 85%. While we have developed the framework to handle that task. and one which develops a certiﬁcate of matching optimality for a compact polynomialsized representation. 2002. formulated as a weighted matching problem. 1999. In the future.
2003]. Learning to cluster considers the problem of ﬁnding desirable clusterings on new data. For example. Recently. and minimize the weight of intercluster edges. negative weights encourage the vertices to belong to different clusters. Images can be segmented by hue or object boundaries. 2003]. encouraging those vertices to belong to a common cluster. For a given application. several algorithms based on linear programming and positivesemideﬁnite 160 . 2003.Chapter 11 Correlation clustering Data can often be grouped in many different reasonable clusterings. there might be only one of these clusterings that is desirable. It is formulated as a vertex partitioning problem: Given a graph with realvalued edge scores (both positive and negative). These properties make correlation clustering a promising approach to many clustering problems. one user may organize her email messages by project and time. another by sender and topic. Emanuel & Fiat. Demaine & Immorlica.. Positive edge weights represent correlations between vertices. correlation clustering does not require the user to specify the number of clusters nor a distance threshold for clustering. Unlike most clustering formulations. both of these parameters are effectively chosen to be the best possible by the problem deﬁnition. We focus on correlation clustering. it has been successfully applied to coreference resolution for proper nouns [McCallum & Wellner. given example desirable clusterings on training data. 2002. a novel clustering method that has recently enjoyed signiﬁcant attention from the theoretical computer science community [Bansal et al. in machine learning. partition the vertices into clusters to maximize the score of intracluster edges.
E) with N nodes and edge score sjk for each jk in E. In M AX AGREE. we introduce both yjk and ykj variables. We assume that the graph is fully connected (if it is not. We formulate the approximate learning problem as a compact convex program with quadratic objective and linear or positivesemideﬁnite constraints.1 Clustering formulation An instance of correlation clustering is speciﬁed by an undirected graph G = (V. Bansal et al. jk:sjk <0 (M AX AGREE) (M IN D IS AGREE) min y∈Y jk:sjk >0 sjk (1 − yjk ) − The motivation for the names of the two problems comes from separating the set of edges into positive weight edges and negative weight edges. Let Y be the space of assignments y that deﬁne legal partitions. [2002] consider two related problems: max y∈Y jk:sjk >0 sjk yjk − jk:sjk <0 sjk (1 − yjk ). 11. we maximize the “agreement” of the partition with the positive/negative designations: the weight of the positive included edges minus the weight of negative excluded edges. In this chapter. we minimize the disagreement: the weight of positive excluded edges minus the weight of negative included edges. For notational convenience. and ﬁx them to have value 1 and set sjj = 0. Experiments on synthetic and realworld data show the ability of the algorithm to learn an appropriate clustering metric for a variety of desired clusterings. one for each edge jk. We deﬁne binary variables yjk . The best score is obviously achieved by including all the positive and excluding all the negative edges.1. but this will not generally produce a valid partition. In . which will be constrained to have the same value. (j < k). We also introduce yjj variables. we employ these relaxations to derive a maxmargin formulation for learning the edge scores for correlation clustering from clustered training data.11. sjk yjk . In M IN D IS AGREE. CLUSTERING FORMULATION 161 programming relaxations have been proposed to approximately solve this problem. we can make it fully connected by adding appropriate edges jk with sjk = 0). that represent whether node j and k belong to the same cluster.
∀j.. yjk + yjl ≤ ykl + 1. The optimal partition for the two problems is of course the same (if it is unique). With these deﬁnitions. yjj = 1.1 Linear programming relaxation In order to insure that y deﬁnes a partition. Bansal et al. 2003. let s∗ = max y∈Y sjk yjk . consider the inequalities involving node a and b with j = a. which we consider in the next sections. we can express the M AX AGREE problem as an integer linear program (ignoring the constant −s− ): max jk sjk yjk yjk + ykl ≤ ylj + 1. l = b and j = b. 11. Any symmetric. 2003.1.t. 1}.1) The triangle inequality enforces transitivity: if j and k are in the same cluster (yjk = 1) and k and l are in the same cluster (ykl = 1). s+ = jk:sjk >0 sjk . Emanuel & Fiat.2) yjk ∈ {0. yjl + ykl ≤ yjk + 1. CORRELATION CLUSTERING particular. (11. (11. k = . transitive binary relation induces a partition of the objects. Demaine & Immorlica. l. [2002] show that both of these problems are NPhard (but have different approximation hardness). it is sufﬁcient to enforce a kind of triangle inequality for each triple of nodes j < k < l: yjk + ykl ≤ yjl + 1. s− = jk:sjk <0 sjk . k. ∀j. ∀j. s. then j and l will be forced to be in this cluster (yjl = 1). k = b. To see this. M AX AGREE. 2003]. We will concentrate on the maximization version. Note that the constraints imply that yab = yba for any two nodes a and b. k. The other two cases are similar.162 CHAPTER 11. Several approximation algorithms have been developed based on Linear and Semideﬁnite Programming [Charikar et al. Then the value of M AX AGREE is s∗ − s− and the value of M IN D IS AGREE s+ − s∗ .
max jk sjk µjk mat(µ) 0. To motivate this relaxation. We are not guaranteed that this relaxation will produce integral solutions. ∀j. k. ∀j. LP − s− s 3 11. Choose a collection of orthogonal unit vectors {v1 . The LP solution. then vj vk = 1. k. [2003] show that the integrality gap of this upper bound is at least 2/3: s∗ − s− 2 < . ∀j. one for each cluster in the solution. sLP . (11. µjj = 1. Every vertex j in the cluster is assigned the unit vector vj corresponding to the cluster it is in.2 Semideﬁnite programming relaxation An alternative formulation [Charikar et al. vK }.. The LP relaxation is obtained by replacing the binary variables yjk ∈ {0.1. we substituted the triangle inequalities by the semideﬁnite constraint.3) Note that µjk ≤ 1 is implied since the triangle inequality with j = l gives µjk + µkj ≤ µjj + 1. ∀j. k. In effect. l = a: yab + ybb ≤ yba + 1. (11. Since yaa = ybb = 1. consider any clustering solution. µjk ≥ 0. . The score of the clustering . 1} in Eq.2) with continuous variables 0 ≤ µjk ≤ 1. vj vk = 0. If vertices j and k are in the same cluster. Let mat(µ) denote the variables µjk arranged into a matrix. . µjk ≥ 0.4) s. we have µjk ≤ 1.11. Charikar et al. if not. we have yab = yba .1. is an upper bound on the s∗ . (11. l. µjj = 1. 2003] is the SDP relaxation. yba + yaa ≤ yab + 1. µjk + µkl ≤ µlj + 1. .t. and since µjj = 1 and µjk = µkj . ∀j. CLUSTERING FORMULATION 163 a. .
the Hamming loss counts the number of .4).jk (yjk ) = jk yjk i.jk (1) − i. (11.jk (1) + (1 − yjk ) i. We assume f (xjj ) = 0 so that sjj = 0. The SDP solution. is also an upper bound on the s∗ and Charikar et al. while if one is clustering points in IRn .2 Learning formulation The score for an edge is commonly derived from the characteristics of the pair of nodes.164 CHAPTER 11. where i.jk (0) = i (0) + jk yjk i. Speciﬁcally.82843. However. For example. The vectors generating the inner products are unit vectors by the requirement µjj = 1. Furthermore. Hence we write w f (x. [2003] show that the integrality gap of this upper bound is at least 0. sSDP − s− 11.jk (0). w. which can be decomposed into a sum of outer products vj vj . the entries of fxjk might be the words shared by the documents j and k.jk (yjk ): = jk i. we have mat(µ) mat(µ) = j 0. features might be distances along different dimensions.jk . f (xjk ) ∈ IRn . In the SDP relaxation in Eq. y) = jk yjk w f (xjk ). sSDP . they do not necessarily form a set of orthogonal vectors. where xjk is a set of features associated with nodes j and k.82843: s∗ − s− ≤ 0. into a sum of edge losses i (y) i. In document clustering. CORRELATION CLUSTERING solution can now be expressed in terms of the dot products vj vk . we parameterize the score as a weighted combination of basis functions sjk = w f (xjk ).jk = i. The entries µjk correspond to inner products vj vk . we assume that the loss function decomposes over the edges.
Above.5). (11.jj . The dual of the LP based upper bound for example i is i (0)+ min jkl λi. ∀j. (11.jk ]. . (11.jk . H i (y) = jk 1 jk = yjk ) = I(y jk (i) (i) yjk + jk (i) yjk (1 − 2yjk ) = (i) H i (0) + jk yjk i.5) We can now use the LP relaxation in Eq.ljj − λi. (11.jkl ≥ 0. s. We use these upperbounds in the minmax formulation to achieve approximate maxmargin estimation. λi. (11. where i.6) ∀j = k.jk = 1 − 2yjk .11. Note the righthandside of the second set of inequalities follows from the assumption f (xjj ) = 0. ∀j.jkl for each triangle inequality and zi.klj ] ≥ w f (xjk ) + zi.4) as upper bounds on Eq. LEARNING FORMULATION 165 edges incorrectly cut or uncut by a partition.3) and the SDP relaxation in Eq.ljk − λi. l [λi.jjl + λi. k.j (i) i.j + l [λi.jk .t.jkl + λi.jlj ] ≥ i.2. l. we introduced a dual variable λi. the loss augmented maximization is i (0) + max y∈Y jk yjk [w f (xjk ) + (i) i.jkl + j zi. With this assumption.j for the identity on the diagonal.
klj ] ≥ w l + ∀i.8) ∀j = k. ∀i.9) zi.jk .jkl + λi.7) λi. ∀j.j .166 CHAPTER 11. ∀j. [λi. i.jjl + λi. zi.jj (i) i. ∀j = k. ∀j.j + l [λi. Plugging the SDP dual into the minmax formulation. l. zi.j − λi. y(i) ) + ξi ≥ i (0) + j (11.ljk − λi. i.jlj ] ≥ ∀i. ∀i.ljj − λi.j −λi. we have: min s. 0. 1 w2 + C ξi 2 w f (x(i) . ∀i. ∀i.jj ≥ mat(λi ) 0.jj .jk ≥ w f (xjk ) + zi. −λi.jk . k. l.t. s. ∀i.jj .jj ≥ mat(λi ) i. Similarly. ∀i.jk ≥ w f (xjk ) + zi. we have: min s.t. y(i) ) + ξi ≥ i (0) + jkl (11. (11. 1 w2 + C ξi 2 w f (x(i) . ∀j. (i) i. . k. the dual of the SDP based upper bound is i (0)+ min j zi. ∀j. CORRELATION CLUSTERING Plugging this dual into the minmax formulation.jkl + j (i) f (xjk ) i.jk .j .jkl ≥ 0.j − λi. ∀j = k. λi.t.
Therefore. µi.jk 1 i. ∀j.jk (yjk − µjk )f (xjk ). ∀i.jk )f (xjk ) s.jj = 1. mat(µi ) µi. µjk + µkl ≤ µlj + 1. max i. k.jk − C 2 0.jk − C 2 2 (i) (yjk i. for example.jk − (i) µi. k. (11. k) and (l. DUAL FORMULATION AND KERNELS 167 11.11. l are replaced by the corresponding mat(µi ) µi. m).7): max i. (11. If we are clustering points in Euclidian space. The dual of Eq. Here we give the dual of Eq. ∀i.jk ≥ 0.jk ≥ 0. ∀i. (i) (i) (11. ∀i.t. (11. the kernel could be a function of the two segments corresponding to the pairs of points.jk )f (xjk ) s. and measures the similarity between the relation between the nodes of each pair. k. µi. ∀i. ∀j.jk 1 i.jj = 1. The relation between the primal and dual solution is w = C i. ∀j.jk 0: − (i) µi.jk ∀i. ∀j.3 Dual formulation and kernels The dual of Eq.10) One important consequence of this relationship is that the edge parameters are all support vector expansions. ∀j.7) and Eq. . l.t. k.9) is very similar. ∀j. we can use kernels K(xjk . 2 (i) (yjk i. µi.jk µi. a polynomial kernel over their lengths and angle between them. except that the linear transitivity constraints µjk + µkl ≤ µlj + 1. This kernel looks at two pairs of nodes. (11. xlm ) to deﬁne the space of basis functions. ∀i.3. (j.9) provide some insight into the structure of the problem and enable efﬁcient use of kernels. The dual objective can be expressed in terms of dotproducts f (xjk ) f (xlm ).
1 Irrelevant features In this section.4. 1 http://www.1 Our dataset consisted of email from seven users (approximately 100 consecutive messages per user).4 Experiments We present experiments on a synthetic problem exploring the effect of irrelevant basis functions (features).2 Email clustering We also test our approach on the task of clustering email into folders.168 CHAPTER 11. where each mixture component corresponds to a cluster. We are interested in the problem of learning to cluster emails. Let xj denote each point and xj [d] denote the dth dimension of the point. The comparison with kmeans is simply a baseline to illustrate the effect of the noise on the data. This ﬁrst dimension is thus the relevant feature. with an average of 34 folders. The results in Fig. We used a basis function for each dimension fd (xjk ) = e−(xj [d]−xk [d]) . plus an additional constant basis function. The number of folders for each users varied from two to six. we explore on a synthetic example how our algorithm deals with irrelevant features. The noise is independently generated for each dimension. We gathered the data from the SRI CALO project. 11. we generate data (100 points) from a mixture of two onedimensional Gaussians.1(a) shows the projection of a data sample onto the ﬁrst two dimensions and on two irrelevant dimensions. Random clustering will give an accuracy of 50%.com/project/CALO .sri.ai. The training and test data consists of a 100 samples from the model.4.1(b) illustrate the capability of our algorithm to learn to ignore irrelevant dimensions. In particular. CORRELATION CLUSTERING 11. email clustering and image segmentation. and two real data sets. 2 11. Then we add noise components in D additional (irrelevant) dimensions. The accuracy is the fraction of edges correctly predicted to be between/within cluster. 11. which the users had manually ﬁled into different folders. from a mixture of Gaussians with same difference in means and variance as for the relevant dimension. Figure 11.
as well as importance of meaningful words versus common. Cc. One feature was used for each common word in the pair of emails (except words that appeared in more than half the messages.1: (a) Projection onto ﬁrst two dimensions (top) and two noise dimensions (bottom).11.55 0.45 1 2 4 8 16 32 64 128 lcc kmeans 2 1 0 −1 −2 −3 −4 −4 4 −3 −2 −1 0 1 2 3 3 2 1 0 −1 −2 # noise dimensions −3 −2 −1 0 1 2 3 4 −3 −4 −4 (a) (b) Figure 11. The algorithm is therefore able to automatically learn the relative importance of certain email ﬁelds to ﬁling two messages together. learning the parameters from the partition of a single user’s mailbox into folders. kmeans the dashed line. and “Cc:” ﬁeld. what score function sjk causes correlation clustering to give clusters similar to those that human users had chosen? To test our learning algorithm. Also. subject and body ﬁelds. The basis functions f (xjk ) measured the similarity between the text of the messages. “To:” ﬁeld. which were deemed “stop words” and omitted).95 test accuracy 0. additional features captured the proportion of shared tokens for each email ﬁeld.85 0. EXPERIMENTS 169 4 3 0.4. Accuracy is the fraction of edges correctly predicted to be between/within cluster. including the from.75 0. the similarity between the “From:” ﬁeld. Learning to cluster is the solid line. We then use the learned parameters to cluster the other users’ mail. Errorbars denote one standard deviation. averages are over 20 runs.65 0. We compare our method to the kmeans clustering algorithm using with the same word . (c) Performance on 2 cluster problem as function of the number of irrelevant noise dimensions. we use each user as a training set in turn. to. irrelevant ones. Speciﬁcally.
We also informed our algorithm of the number of clusters by uniformly adding a positive weight to the edge weights to cause it to give the correct number of clusters.170 CHAPTER 11. 11. and took the best clustering out of ﬁve tries. It is precisely this kind of variability in the similarity judgements that . We made this comparison somewhat easy for kmeans by giving it the correct number of clusters k. Our algorithm signiﬁcantly outperforms kmeans on several users and does worse only for one of the users.8 0.7 0. 2001] for which two users had signiﬁcantly different segmentations. features. We selected images from the Berkeley Image Segmentation Dataset [Martin et al. and one much ﬁner.2 0. We performed a simple binary search on this additional bias weight parameter to ﬁnd the number of clusters comparable to k. based on the hue and intensity. a standard metric in information retrieval [BaezaYates & RibeiroNeto.2 show the average F 1 measure (harmonic mean of precision and recall.4 0. 11. mostly based of overall hue..2: Average Pair F1 measure for clustering user mailboxes.3 Image segmentation We also test our approach on the task of image segmentation.6 0. The results in Fig. Depending on the task at hand.3(a) and (b) show two distinct segmentations: one very coarse. Fig.3 0.1 0 1 2 3 4 User 5 6 7 Figure 11. we may prefer the ﬁrst over the second or viceversa.5 Pair F1 lcc kmeans 0. 11. For example.4. 1999]) computed on the pairs of messages that belonged to the same cluster. CORRELATION CLUSTERING 0.
G. We then selected about a hundred largest regions.) There is a rich space of possible features we can use in our models: for each pair of regions. etc. distance. 11. We connected two adjacent pixels by an edge if their RGB value was the same at a coarse resolution (4 bits per each of the R. (We then use the learned metric to greedily assign the remaining small regions to the large adjoining regions. we used a fairly simple set of features that are very easy to compute. area and average color (averaging the pixels in the RGB space).B channel).3: Two segmentations by different users: training image with (a) coarse segmentation and (b) ﬁne segmentation.11.3(b) and . presence of edges between them. In our experiments. We then computed three distances (one for each HSV channel). In order to segment the image. These regions are the objects that our algorithm learns to cluster.4. which covered 8090% of the pixels. as well as the distance in pixels between the bounding boxes and the area of the smaller of the two regions. We trained two models. we want our algorithm to capture. we calculated the bounding box. we ﬁrst divided it contiguous regions of approximately the same color by running connected components on the pixels. one using Fig. All features were normalized to have zero mean and variance 1. we can consider their shape. For each region.3(a) and the other using Fig. 11. EXPERIMENTS 171 (a) (b) Figure 11. color distribution.
4(a). BarHillel et al. 2003]. 11. Recently. a number of algorithms have been proposed for automatically learning distance metrics as a preprocessing step for clustering [Xing et al. 2003]. The clustering algorithm essentially uses an eigenvector decomposition of an appropriate matrix derived from the pairwise afﬁnity matrix. which is more efﬁcient than correlation clustering. respectively. Thus. tested on the image in Fig.5 Related work The performance of most clustering algorithms depends critically on the distance metric that they are given for measuring the similarity or dissimilarity between different datapoints.. we will instead seek to learn a good metric for the clustering algorithm. (b) segmentation based on coarse training data (c) segmentation based on ﬁne training data.4(b) and (c). 11. In contrast to algorithms that learn a metric independently of the algorithm that will be used to cluster the data.172 CHAPTER 11. However the objective in the learning . Note that mountains. instead of using an externallydeﬁned criterion for choosing the metric. 2002.. tuning one to the other in a joint optimization. The results are shown in Fig.4: Test image: (a) input. CORRELATION CLUSTERING (a) (b) (c) Figure 11. 11. for which we use LP or SDP formulations. we describe a formulation that tightly integrates metric learning with the clustering algorithm. An example of work in a similar vein is the algorithm for learning a distance metric for spectral clustering [Bach & Jordan. rocks and grass are segmented very coarsely based on hue in (b) while the segmentation in (c) is more detailed and sensitive to saturation and value of the colors.
6.6 Conclusion We looked at correlation clustering. On the theoretical side. it would be interesting to work out a PAClike bound for generalization of the learned score metric.. and how to learn the edge weights from example clusterings. showcasing robustness to noise dimensions. We showed results on a synthetic dataset. CONCLUSION 173 formulation proposed in Bach and Jordan [2003] is not convex and difﬁcult to optimize.11. Our approach ties together the inference and learning algorithm. The main limitation of the correlation clustering is scalability: the number of constraints (V3 ) in the LP relaxation and the size of the positivesemideﬁnite constraint in the SDP relaxation. 11. and attempts to learn a good metric speciﬁcally for the clustering algorithm. . Experiments on the CALO email and image segmentation experiments show the potential of the algorithm on realworld data. It would be very interesting to explore constraint generation or similar approaches to speed up learning and inference.
CORRELATION CLUSTERING .174 CHAPTER 11.
Part IV Conclusions and future directions 175 .
disulﬁde connectivity in protein structure prediction. a model deﬁnes a compact. y). We develop theoretical foundations for our approach and show a wide range of experimental applications. email organization and image segmentation. natural language parsing. 12. y : g(x. alternative estimation methods are intractable. For some of these models.Chapter 12 Conclusions and future directions This thesis presents a novel statistical estimation framework for structured models based on the large margin principle underlying support vector machines. including handwriting recognition. parameterized scoring function w f (x. we rely on the expressive power of convex optimization problems to compactly capture inference or solution optimality in structured models. y) and prediction using the model reduces to ﬁnding the highest scoring output y given the input x. Essentially.1 Summary of contributions We view a structured prediction model as a mapping from the space of inputs x ∈ X to a discrete vector output y ∈ Y.y)≤0 176 . Directly embedding this structure within the learning formulation produces compact convex problems for efﬁcient estimation of very complex models. hypertext categorization. The framework results in several efﬁcient learning formulations for complex prediction tasks. Fundamentally. 3D terrain classiﬁcation. Our class of models has the following linear form: hw (x) = arg max w f (x.
t. . SUMMARY OF CONTRIBUTIONS 177 where w ∈ IRn is the vector of parameters of the model. from probabilistic models such as Markov networks and context free grammars to more unconventional models like weighted graphcuts and matchings. y) ≈ y(i) . We propose two general approaches that transform the above exponential size QP to an exactly equivalent polynomial size QP in many important classes of models. we assume that the inference problem arg maxy : g(x.1.y)≤0 w f (x. min s. y) ∈ IRn represent salient features of the input/output pair. In many models where maximum likelihood estimation is intractable. The naive formulation1 uses i Y (i)  linear constraints. constraints g(x. we develop methods for ﬁnding parameters w such i=1 that: arg max w f (x(i) .12. which is generally exponential in the number of variables in each y(i) . ∀i. y) ≤ 0} is usually immense. 10). y∈Y (i) where Y (i) = {y : g(x(i) . This deﬁnition covers a broad range of models. 12. Although the space of outputs {y : g(x. we omit the slack variables in this summary. y) ≤ 0}. 1 For simplicity. y(i) )}m . 7 and Ch.1 Structured maximum margin estimation Given a sample S = {(x(i) .1. y) ∈ IRk deﬁne the space of feasible outputs y given the input x and basis functions f (x. These formulations allow us to ﬁnd globally optimal parameters (with ﬁxed precision) in polynomial time using standard optimization software. y) can be solved (or closely approximated) by an efﬁcient algorithm that exploits the structure of the constraints g and basis functions f . ∀y ∈ Y (i) . 1 w2 2 w fi (y(i) ) ≥ w fi (y) + i (y). we provide exact maximum margin solutions (Ch. ∀i.
t. We show that this approach leads to exact polynomialsize formulations for estimation of lowtreewidth Markov networks. the form of the loss term i (y) is crucial for the lossaugmented inference to remain tractable.178 CHAPTER 12. we can ﬁnd a compact certiﬁcate of optimality that guarantees that y(i) = arg max[w fi (y) + i (y)]. 1 w2 2 w fi (y(i) ) ≥ max [w fi (y) + i (y)].). In some cases. Even if maxy∈Y (i) w fi (y) can be solved in polynomial time using convex optimization. For example.g. LP. bipartite matchings. Schrijver. we can embed the maximization inside the minmax formulation to get a compact convex program equivalent to the naive exponential formulation. SDP. maximum weight perfect (nonbipartite) matching and spanning tree problems can be expressed as linear programs with exponentially many constraints. and many other models. can be solved in polynomial time using combinatorial algorithms. 1997. contextfree grammars. y∈Y (i) The key to solving the estimation problem above efﬁciently is the lossaugmented inference problem maxy∈Y (i) [w fi (y) + i (y)]. Both of these problems. but no polynomial formulation is known [Bertsimas & Tsitsiklis. associative Markov networks over binary variables. etc.. CONCLUSIONS AND FUTURE DIRECTIONS Minmax formulation We can turn the above problem into an equivalent minmax formulation with i nonlinear maxconstraints: min s. We show that if we can express the (lossaugmented) inference as a compact convex optimization problem (e. though. however. 2003]. QP. ∀i. We typically use a natural loss function which is essentially the Hamming distance between y(i) and h(x(i) ): the number of variables predicted incorrectly. Certiﬁcate formulation There are several important combinatorial problems which allow polynomial time solution yet do not have a compact convex optimization formulation. y .
we can derive a compact certiﬁcate for the spanning tree problem. 1979. Similarly. We can express this condition by deﬁning an auxiliary distance function on the nodes an a set of linear constraints that are satisﬁed if and only if there are no negative cycles. The certiﬁcate formulation relies on the fact that verifying optimality of a solution is often easier than actually ﬁnding one. Lafferty et al. For example. 10). Zhu & Hastie.. Garey & Johnson. Maximum margin vs. SUMMARY OF CONTRIBUTIONS 179 For perfect (nonbipartite) matchings. our approach has an additional advantage. Because our approach only relies on using the maximum in the model for prediction. 2004]. In models that are tractable for both maximum likelihood and maximum margin (such as lowtreewidth Markov networks. This observation allows us to apply our framework to an even broader range of models with combinatorial structure than the minmax formulation. 2001.1. context free grammars. which is #Pcomplete [Valiant. This simple set of linear constraints scales linearly with the number of edges in the graph.. By contrast.12. Because of the hingeloss. to learn a probabilistic model P (y  x) over bipartite matchings using maximum likelihood requires computing the normalizing partition function. 2004. Altun et al. maximum margin estimation can be formulated as a compact QP with linear constraints. many other problems in which inference is solvable by dynamic programming). Maximum likelihood models with kernels are generally nonsparse and require pruning or greedy support vector selection methods [Wahba et al. maximum margin estimation can be tractable when maximum likelihood is not. Similar results hold for an important subclass of Markov networks and nonbipartite matchings.. 1979]. the solutions to the estimation are relatively sparse in the dual space (as in SVMs). maximum likelihood There are several theoretical advantages to our approach in addition to the empirical accuracy improvements we have shown experimentally. which makes the use of kernels much more efﬁcient. 1993. and does not require a normalized distribution P (y  x) over all outputs. this certiﬁcate is a condition that ensures there are no augmenting alternating cycles (see Ch. .
Relaxations of such integer programs into LPs. generalization analysis and experimental validation for Markov networks. we consider MAP inference in large treewidth Markov networks in Ch. We present an efﬁcient algorithm for solving the estimation problem called Structured SMO.1. compact. 11. probabilistic interpretation permits the use of wellunderstood algorithms such as EM [Dempster et al. Also. QPs or SDPs often provide excellent approximation algorithms and ﬁt well within our framework. ◦ Lowtreewidth Markov networks We use a compact LP for MAP inference in Markov networks with sequence and other lowtreewidth structure to derive an exact. maximum likelihood is much more appropriate. in training settings with missing data and hidden variables. associative. 7. Our onlinestyle algorithm uses . representational extensions. of course. graphpartitioning in Ch. CONCLUSIONS AND FUTURE DIRECTIONS There are. 1977]. it is very difﬁcult to solve using standard software. multiway cuts in Ch.2 Markov networks: maxmargin. ◦ Scalable online algorithm Although our convex formulation is a QP with linear number of variables and constraints in the size of the data. Approximations In many problems. Many such problems can be written as integer programs. 12.180 CHAPTER 12. particularly the minmax formulation. several advantages to maximum likelihood estimation. 8. In applications where probabilistic conﬁdence information is a must.. for large datasets (millions of examples). We show empirically that these approximations are very effective in many applications. for example. the maximization problem we are interested in may be NPhard. The dual formulation allows efﬁcient integration of kernels with graphical models that leverages rich highdimensional representations for accurate prediction in realworld tasks. relational The largest portion of the thesis is devoted to novel estimation algorithms. convex learning formulation.
our models are learned efﬁciently and. SUMMARY OF CONTRIBUTIONS 181 inference in the model and analytic updates to solve extremely large estimation problems. For the nonbinary case. which compactly deﬁne templates for Markov networks for domains with relational structure: objects. As a result. We show how to express the inference problem using an LP which is exact for binary networks. We apply this class of models to classiﬁcation of hypertext using hyperlink structure to deﬁne relations between webpages.. for associative Markov networks over binary variables. ◦ Learning associative Markov networks (AMNs) We deﬁne an important subclass of Markov networks that captures positive correlations present in many domains. By constraining the class of Markov networks to AMNs. to derive an approximate maxmargin formulation. . We use a compact approximate MAP LP in these complex Markov networks. This is the ﬁrst bound to address structured error (e. 1952] often used in computer vision and allows exact MAP inference in the case of binary variables. proportion of mislabeled pixels in an image). for which likelihood methods are believed to be intractable. This class of networks extends the Potts model [Potts. ◦ Generalization analysis We analyze the theoretical generalization properties of maxmargin estimation in Markov networks and derive a novel marginbased bound for structured prediction. 2002].g. at runtime. relations. The graphical structure of an RMN is based on the relational structure of the domain. attributes. and can easily model complex interaction patterns over related entities. in which exact inference is intractable. our framework allows exact estimation of networks of arbitrary connectivity and topology. We present an AMNbased method for object segmentation from 3D range data. can scale up to tens of millions of nodes and edges by using graphcut based inference [Kolmogorov & Zabih. we provide an approximation that works well in practice.12.1. ◦ Representation and learning of relational Markov networks We introduce relational Markov networks (RMNs).
to derive an exact. which makes it possible to efﬁciently embed input features in very highdimensional spaces and achieve stateoftheart accuracy. tuning one to the other in a joint optimization. perfect matchings for disulﬁde connectivity in protein structure prediction. In contrast to algorithms that learn a metric independently of the algorithm that will be used to cluster the data. Experiments on synthetic and realworld data show the ability of the algorithm to learn an appropriate clustering metric for a variety of desired clusterings.1. ◦ Learning to parse We exploit dynamic programming decomposition of context free grammars to derive a compact maxmargin formulation. matching. we use the minmax formulation to learn a parameterized scoring function for clustering. . ◦ Learning to cluster By expressing the correlation clustering problem as a compact LP and SDP. The algorithm we propose uses kernels. graph partitions for clustering documents and segmenting images. namely the absence of augmenting alternating cycles. We build on a recently proposed “unlexicalized” grammar that allows cubic time parsing and we show how to achieve highaccuracy parsing (still in cubic time) by exploiting novel kinds of lexical information. CONCLUSIONS AND FUTURE DIRECTIONS 12. including email folder organization and image segmentation. ◦ Learning to match We use a combinatorial optimality condition. We show experimental evidence of the model’s improved performance over several baseline models. We apply our framework to prediction of disulﬁde connectivity in proteins using perfect matchings.182 CHAPTER 12. we describe a formulation that tightly integrates metric learning with the clustering algorithm. We formulate the approximate learning problem as a compact convex program. clustering The other large portion of the thesis addresses a range of prediction tasks with very diverse models: context free grammars for natural language parsing. efﬁcient certiﬁcate formulation for learning to match.3 Broader applications: parsing.
d.2. y). the Markov assumption of some ﬁnite order is reasonable (i. a label variable is independent of the rest given a large enough ball of labels around it. 5. 7 and correlation clustering in Ch. for sequential prediction problems.2 Extensions and open problems There are several immediate applications. Similar assumptions may be made for some “degree of separation” in relational domains. ◦ Generalization bounds with distributional assumptions In Ch. without any assumption about the distribution of P (y  x). and more general learning settings. less immediate extensions and open problems for our estimation framework. including further theoretical analysis and new optimization algorithms. For example. given the input and previous k labels.2.e.12.1 Theoretical analysis and optimization algorithms ◦ Approximation bounds In several of the intractable models. ◦ Problemspeciﬁc optimization methods Although our convex formulations are polynomial in the size of the data. This distributionfree assumption leads to a worst case analysis. scaling . like multiclass AMNs in Ch. relying only on the samples (x(i) . 11. y(i) ) being i. the next label is independent of the labels more than k in the past). In spatial prediction tasks. EXTENSIONS AND OPEN PROBLEMS 183 12. An open question is to translate these error bounds on inference into error bounds on the resulting maxmargin formulations. while some assumptions about the approximate decomposition P (y  x) may be warranted. it would be interesting to exploit such conditional independence assumptions or asymptotic bounds on entropy of P (y  x) to get generalization guarantees even from a single structured example (x. we presented a bound on the structured error in Markov networks. 12. These approximate inference programs have strong relative error bounds. novel prediction tasks. More generally.. We organize these ideas into several sections below. we used approximate convex programs within the minmax formulation.i.
models which do not permit such decompositions. Leslie et al. points on two shapes are matched based on their local contour features [Belongie et al.. perhaps using novel string kernels [Haussler. Our framework provides an exact... ◦ Sequence alignment In standard pairwise alignment of biological sequences. efﬁcient alternative to the maximum likelihood estimation for learning the matching scoring function. Durbin et al. However. 12. For lowtreewidth Markov networks and context free grammars. we can consider a whole range of problems where the prediction variables are continuous. Our framework can be applied (just as in context free grammar estimation) to efﬁciently learn a more complex edit function that depends on the contextual string features. 1998]. Similarly.2. 2004]. a string edit distance is used to determine which portions of the sequences align to each other [Needleman & Wunsch.184 CHAPTER 12.. Another algorithm useful for such models is Exponentiated Gradient [Bartlett et al. 1970. matchings are used to map words of the two languages in aligned sentences [Matusov et al. In machine translation. and many others. structured classiﬁcation. generalizing classiﬁcation models to multivariate. 2000].2 Novel prediction tasks ◦ Bipartite matchings Maximum weight bipartite matchings are used in a variety of problems to predict mappings between sets of items. 1999.. create a need for new algorithms that can effectively use combinatorial optimization as a subroutine to eliminate the dependence on generalpurpose convex solvers. 2004]. matchings. Lodhi et al.. . we have presented the Structured SMO algorithm. 2002. In 2D shape matching. 2002]. CONCLUSIONS AND FUTURE DIRECTIONS up to larger datasets will require problemspeciﬁc optimization methods. Finding the best alignment involves a dynamic program that generalizes the longest common subsequence algorithm. Both algorithms rely on dynamic programming decompositions. such as graphcuts. ◦ Continuous prediction problems We have addressed estimation of models with discrete output spaces.
1997]. but it sufﬁces to say that lossaugmented inference using. there are obstacles to directly applying the minmax or certiﬁcate formulations. These problems are similar to the discrete structured prediction models we have considered: inference in the model can formulated as a convex optimization problem. 1994]. EXTENSIONS AND OPEN PROBLEMS 185 Such problems are a natural generalizations of regression. involving correlated.3 More general learning settings ◦ Structure learning We have focused on the problem of learning parameters of the model (even though our kernelized models can be considered nonparametric). It would be interesting to use observed equilibria data under different conditions to learn what “objective” the cell is maximizing.2. The standard method of greedy stepwise selection followed by reestimation is very . Luenberger.2. L1 loss (or L2 loss). In this setting. there is a wealth of possible structures (cliques in the network) one can use to model a problem. Hamming distance equivalent. Details of this are beyond the scope of this thesis.12. several recent models of metabolic ﬂux in yeast use linear programming formulations involving quantities of various enzymes. 1991. one could learn a user’s return projection and risk assessment function from observed portfolio allocations by the user. For example. 12. L2 are convex. with stoichiometric constraints [Varma & Palsson. not concave (it turns out that it is actually possible to use L∞ loss). no longer produces a maximization of a concave objective with convex constraints since L1 . It is particularly interesting to explore the problem of inducing these cliques automatically from data. Developing effective loss functions and maxmargin formulations for the continuous setting could provide a novel set of effective models for structured multivariate realvalued prediction problems. especially in spatial and relational domains. for example. Markowitz portfolio optimization is formulated as a quadratic program which minimizes risk and maximizes expected return under budget constraints [Markowitz. convex programs are often used to model portfolio management. In ﬁnancial modeling. interconstrained realvalued outputs. However. In the case of Markov networks.
2003]. while much of the easily accessible data is not at all or suitably labeled. Bach & Jordan. There are several more general settings we would like to extend our framework. The simplest setting is a mix of labeled and unlabeled examples. Recent work on selecting input features in Markov networks (or CRFs) uses several approximations to learn efﬁciently with millions of candidate features [McCallum.. Chapelle et al. Zhu et al. clique selection is still relatively unexplored. generative models often using the EM algorithm [Dempster et al. It is possible that AMNs. These correspondence variables can be treated as hidden variables... Szummer & Jaakkola. by restricting the network to be tractable under any structure. There has been much research in this setting for classiﬁcation [Blum & Mitchell. 2003]. Especially in the case of combinatorial structures. 2001]. 1977. 2000. .186 CHAPTER 12. where a small supervised dataset is augmented by a large unsupervised one. ◦ Semisupervised learning Throughout the thesis we have assumed completely labeled data. A more complex and rich setting involves presence of hidden variables in each example. extensions of our framework allow opportunities for problemspeciﬁc convex approximations to be exploited. This assumption often limits us to relatively small training sets where data has been carefully annotated. Discriminative methods have been explored far less. Nigam et al. may permit more efﬁcient clique selection methods. word correspondences between pairs of sentences are usually not manually annotated (at least not on a large scale). the principle of regularizing (discouraging) decision boundaries near densely clustered inputs could be applicable to our structured setting.. However. Similarly. Cowell et al. 2002. in handwriting recognition. 1999].. we may not have each letter segmented out but instead just get a word or sentence as a label for the entire image. 1997. Although most of this work has been done in a probabilistic setting. 2001. CONCLUSIONS AND FUTURE DIRECTIONS expensive in general networks [Della Pietra et al.. in machine translation. 2003. Corduneanu & Jaakkola. For example. This setting has been studied mainly in the probabilistic. 1998.
FUTURE 187 12.12. . We hope that continued research in this framework will help tackle evermore sophisticated prediction problems in the future. Our approach has several theoretical and practical advantages over standard probabilistic models and estimation methods for structured prediction.3.3 Future We have presented a supervised learning framework for a large class of prediction models with rich and interesting structure.
The covering number is a key quantity in measuring function complexity. Marginbased analysis of generalization error uses the margin achieved by a classiﬁer on the training set to approximate the original function class of the classiﬁer by a ﬁnite covering with precision that depends on the margin. 1998]. His analysis is based on the upper bounds on the covering number for the class of linear functions FL (w. Here.5.1 uses the covering number bounds of Zhang [2002] (in the DataDependent Structural Risk Minimization framework [ShaweTaylor et al.g. we will only deﬁne the ∞norm covering number. z) = w z where the norms of the vectors w and z are bounded.1 The proof of Theorem 5.1 Proof of Theorem 5.. Intuitively. parameterized by a set of weights w) is the number of vectors necessary to approximate the values of any function in the class on a sample. We reproduce the relevant deﬁnitions and theorems from Zhang [2002] here to highlight the necessary extensions for structured classiﬁcation. 188 .Appendix A Proofs and derivations A.) Zhang provides generalization guarantees for linear binary classiﬁers of the form hw (x) = sgn(w x).5. the covering number of an inﬁnite class of functions (e.
Deﬁnition A. In order to use the classiﬁer’s margin to bound its expected loss. Theorem A. 1] be a loss function and f γ (v) = supρ(v. so that 01 loss of I(v sgn(w x) is f (FL (w.2 (Theorem 4 from Zhang [2002]) If w > 0.t. v(r) }. S) with precision under the metric ρ. from distribution D over i=1 X × Y.1. When the norms of w and z are bounded. the corresponding γmargin loss is f γ (v) = 1 ≤ 2γ). 1] be a loss function. where v(j) ∈ IRm .1. For 01 loss and linear metric ρL . if for all w there exists a v(j) such that for each data sample z(i) ∈ S: ρ(vi . PROOF OF THEOREM 5.1 189 A. we have the following upper bound on the covering number of linear functions under the linear metric ρL (v. be . v ) = v − v . y (i) }m . The covering number of a sample S is the size of the smallest covering: N∞ (F. . .v )<2γ f (v ). . S). Let γ1 > γ2 > . I(v Theorem A. We also deﬁne the covering number for any sample of size m: N∞ (F. In binary classiﬁcation. marginbased loss on the training sample that measures the worst loss achieved by the approximate covering based on this margin.1. ρL .1. S) = inf V  s. z(i) )) ≤ . . . m) ≤ 36 a2 b2 2 2 ≤ a and z 2 ≤ b. The next theorem bounds the expected f loss in terms of the γmargin loss. on the training sample. log2 N∞ (FL . V (j) is a covering of F(w. where X = IRn and Y is mapped to ±1. . be a covering of a function class F(w.3 (Corollary 1 from Zhang [2002]) Let f : IR → [0. so we can fold x and y into z = yx. Let f : IR → [0. then ∀ log2 (2 4ab/ + 2 m + 1) . .v )<2γ f (v ) be the γmargin loss for a metric ρ.1 Binary classiﬁcation In binary classiﬁcation. m) = supS: S=m N∞ (F. z)). F(w. f γ (v) = supρ(v. . ρ.1.5. we let f (v) = 1 ≤ 0) be the step function. .A. S). we are given a sample S = {x(i) . . ρ.1 (Covering Number) Let V = {v(1) . the bounds below use a stricter. ρ.
z) = min w ∆fi (y). γi ≤ γ. PROOFS AND DERIVATIONS a decreasing sequence of parameters. then for all δ > 0. we use i to denote the smallest index s. . z))] ≤ ES [f γ (F(w. S) + ln m pi δ ED [f (F(w. where for each ﬁxed γ. z)) . z). z) by deﬁning an appropriate loss function fM .190 APPENDIX A. . since y is a vector. .2 Structured classiﬁcation We will extend this framework to bound the average perlabel loss H (y)/L for structured classiﬁcation by deﬁning an appropriate loss f and a function class F (as well as a metric ρ) such that f (F) computes average perlabel loss and f γ (F) provides a suitable γmargin loss. y). z). . Deﬁnition A. . We can no longer simply fold x and y. z) is given by: FM (w. which is a vector of minimum values of w ∆fi (y) for each error level H (y) from 1 to L as described below.2. so we let z = (x. . A. .1.5 (Multierrorlevel function class) The multierrorlevel function class FM (w. In order for our loss function to compute average perlabel loss. z) for d ∈ {1.1. . . . ρ. with probability of at least 1 − δ over data: 32 1 ln 4N∞ (F. z). ML (w. .4 (dtherrorlevel function) The dtherrorlevel function Md (w. z) = (M1 (w.1. . L} is given by: Md (w. Md (w. . z))] + for all w and γ. We can now compute the average perlabel loss from FM (w. it is convenient to make our function class vectorvalued (instead of scalarvalued as above). y: H (y)=d Deﬁnition A. and pi be a sequence of positive numbers such that ∞ i=1 pi = 1.1. We will bound the corresponding covering number by building on the bound in Theorem A.t. γi . We deﬁne a new function class FM (w.
1. we have an upper bound on the average perlabel loss fM (FM (w. vd > 0.8 (γmargin average perlabel loss) The γmargin average perlabel loss γ fM : IR L → [0. PROOF OF THEOREM 5. v ) = max d vd − vd  . d:vd ≤0 L . We now need to deﬁne an appropriate metric ρ that in turn deﬁnes γmargin loss for structured classiﬁcation.5. z) ≥ d:Md (w.1. 1] is given by: γ fM (v) = sup ρM (v.1. our metric can become “looser” with the number of mistakes. Combining the two deﬁnitions. z)) = 1 1 arg min Md (w.1 191 Deﬁnition A. Otherwise.z)≤2dγ 1 arg min vd . y ).6 (Average perlabel loss) The average perlabel loss fM : IR L → [0. With the above deﬁnitions. Md (w.A. one that maximizes the Hamming distance from y.v )≤2γ fM (v ). d:vd ≤0 L where in case ∀d. d We now deﬁne the corresponding γmargin loss using the new metric: Deﬁnition A.7 (Multierrorlevel metric) Let the multierrorlevel metric ρM : IRL × IRL → IR for a vector in IR L be given by: ρM (v. Deﬁnition A. z)) = sup v:vd −Md (w. 1] is given by: fM (v) = 1 arg min vd . z) > 0 corresponds to the classiﬁer making no mistakes: arg maxy w fi (y) = y. as there is more room for error. it is adversarial: it picks from all y which are better (w f (y) ≤ w f (y )). we deﬁne arg mind:vd ≤0 vd ≡ 0. y Note that the case ∀d. Since the margin of the hypothesis grows with the number of mistakes.1.z)≤0 L L H arg max w fi (y) . This upper bound is tight if y = arg maxy w f (x. we get: γ fM (FM (w.
q is the maximum number of cliques that have a variable in common. and V the number of values a variable takes. . mNc (Vc − 1)). m) = sup N∞ (FM . S: S=m (j) (j) (j) (j) (j) ∈ IRL . ρL . . ρL . q. where V(j) = (V1 . Proof: We will show that N∞ (FM . . m) ≤ N∞ (FL . Consider a ﬁrstorder sequence model as an example. S). . q. S) ≤ N∞ (FL . so N∞ (FM . S ) for any sample S of size m.192 APPENDIX A. . ρM . FM (w. ρM . where we construct the sample S of size mNc (Vc − 1) in order to cover the clique potentials as described below. S:S=m .9 (Multierrorlevel covering number) Let V = {V(1) . ρM . S ) ≤ N∞ (FL . Lemma A. . . ρM . be a covering of FM (w. S) ≤ N∞ (FL . with L as the maximum length. . ρL . Then Nc = 2L−1 since we have L node cliques and L − 1 edge cliques. Vm ) and Vi sample z(i) ∈ S: ρM (Vi . S) = inf V s. .1. z(i) )) ≤ . S). .1. by deﬁnition. ρM .10 (Bound on multierrorlevel covering number) N∞ (FM . . ρL . Vc = V 2 because of the edge cliques. q. mNc (Vc − 1)). m) = sup N∞ (FM . if for all w there exists a V(j) such that for each data We provide a bound on the covering number of our new function class in terms of a covering number for the linear function class. and q = 3 since nodes in the middle of the sequence participate in 3 cliques: previouscurrent edge clique. node clique. ρL . Vc is the maximum number of values in a clique Yc .t. . Note that this is sufﬁcient since N∞ (FL . and Rc is an upperbound on the 2norm of clique basis functions. . Recall that Nc is the maximum number of cliques in G(x). PROOFS AND DERIVATIONS We also deﬁne the corresponding covering number for our vectorvalued function class: Deﬁnition A. . . with  precision under the metric ρM . . V is a covering of FM (w. . Vi . ρM . . mNc (Vc − 1)). We also deﬁne N∞ (FM . q. V(r) }. The covering number of a sample S is the size of the smallest covering: N∞ (FM . ρM . . . and currentnext edge clique. S).
Let vi (y) = (j) (j) c vi. Vi . ∀c ∈ C (i) . . then i Vi = (M1 (v(j) . . PROOF OF THEOREM 5. z(i) ) = miny: H (y)=d vi (y). .c (yc ) will be nonzero. . . . v(r) }. . V(r) }. we create Nc (Vc − 1) samples ∆fi. . mNc (Vc −1)). .c (yc ) for each clique c and clique assignment yc as opposed to the values of entire assignments w ∆fi (y). z(i) ). we obtain: vi (y) − w ∆fi (y) ≤ dq . .A.c (yc ) is zero for all cliques c for which the assignment is correct: yc = yc . (j) (j) ∀i. S ) under ρL . (j) (j) (j) (A. . the number of vectors in V is given by r = N∞ (FL . . as each label can appear in at most q cliques. Thus for an assignment y with d mistakes. . . . The component of v(j) corresponding to the sample z(i) and the assignment yc to the labels of the clique c will be denoted by vi.1) By Deﬁnition A.2) (i) Note that vi. ML (v(j) . This reduction in size comes about because our covering approximates the values of clique potentials w ∆fi. . To make ∞norm covering of FL (w. while his is exponential in the total number of label variables per example.c (yc ). By combining this fact with Eq. for our multierrorlevel function FM . We construct a set of vectors (j) (i) V = {v(1) . (A. . . (j) (i) (j) (i) (i) V an (j) ∈V (A.c (yc ).1. .1). For each sample z ∈ S. and (j) Md (vi . as ∆fi. one for each clique c and each assignment yc = yc .c (yc ) = 0. For convenience. z(i) ).5. at most dq vi.1. . .1 193 The construction of S below is inspired by the proof technique in Collins [2001]. we deﬁne vi. . Vm ) (j) (j) and Vi (j) ∈ IRL . Md (v(j) . z(i) )) . We can now use V to construct a covering V = {V(1) . .3) . ρL .c (yc ) = 0 for correct label assignments. ∀y : H i (y) = d. where (j) V(j) = (V1 . where v(j) ∈ IRmNc (Vc −1) .c (yc ) − w ∆fi.c (yc ). (A.1. but the key difference is that our construction is linear in the number of cliques Nc and exponential in the number of label variables per clique. .c (yc ) ≤ . ∀yc . . we require that for any w there exists a v such that for each sample z : vi.
12 (Multilabel analog of Theorem A.3). z(i) )) ≤ q . z)) + ∞ i=1 pi = 1. γi ≤ γ.5. w v Fix any i.1. Proof: Similar to the proof of Zhang’s Theorem 2 and Corollary 1 [Zhang.10. Proof: Substitute Theorem A. Theorem 5. Coni i w v sider the case where vi (yd ) ≥ w ∆fi (yd ) (the reverse case is analogous). 2002] where in Step 3 (derandomization) we substitute the vectorvalued FM and the metric ρM .1. (A.t. γ Theorem A. m) ≤ 36 2 Rc w 2 2 2 (j) q2 log2 1 + 2 4 Rc w 2 q + 2 mNc (Vc − 1) . be a decreasing sequence of parameters. Lemma A.1. . since vi (yd ) ≤ vi (yd ).1. FM (w. ρM .194 APPENDIX A. FM (w. Let yd = arg miny: H (y)=d vi (y) and yd = arg miny: H (y)=d w ∆fi (y). and pi be a sequence of positive numbers such that 1 − δ over data: γ Ez fM (FM (w.1. with probability of at least 1 32 ln 4N∞ (FM . we must (j) prove that: v w w w vi (yd ) − w ∆fi (yd ) ≤ vi (yd ) − w ∆fi (yd ) ≤ dq . z)) ≤ ES fM (FM (w. S) + ln m pi δ for all w and γ.11 (Numeric bound on multierrorlevel covering number) log2 N∞ (FM . PROOFS AND DERIVATIONS We conclude the proof by showing that V is a covering of FM under ρM : For each w. We must now bound: (j) ρM (Vi . we use i to denote the smallest index s.3) Let fM and fM (v) be as deﬁned above.1 follows from above theorem with γi = Rc w 2 /2i and pi = 1/2i using an . (j) (j) (j) (j) (A. then for all δ > 0. ρM . pick V(j) ∈ V such that the corresponding v(j) ∈ V satisﬁes the condition in Eq. where for each ﬁxed γ. The last step is a direct consequence of Eq. .2 into Lemma A. . γi . (A.1). Let γ1 > γ2 > . Hence ρM (Vi .4) v v w where the ﬁrst step follows from deﬁnition of yd . z(i) )) = max d  miny: H (y)=d vi (y) − miny: H (y)=d w ∆fi (y) i i d (j) (j) .
2. we need µv (1) + µv (2) = 1.t. 2. ∀v ∈ V. A. A. We show that we can construct a new feasible assignment µ which increases the objective (or leaves it unchanged) and furthermore has fewer fractional entries. To show that µ is feasible. Note that if λ = λ(1) or λ = −λ(2). 7. k. otherwise we could increase the objective by increasing µc (k). . ∀c ∈ C.A. λ(k) = minv : µv (k)>0 yv (k) for k = 1. v ∈ c. µv (k) ≥ 0 and µc (k) = mini∈c µv (k). feasible µ. µc (k) ≥ 0. I(0 Now consider the smallest fractional µv (k).2. I(0 µc (1) = µc (1) − λ1 < µc (1) < 1). We construct an assignment µ from µ by leaving integral values unchanged and uniformly shifting fractional values by λ: µv (1) = µv (1) − λ1 < µv (1) < 1). k. I(0 µc (2) = µc (2) + λ1 < µc (2) < 1). k=1 (A.2 AMN proofs and derivations In this appendix.2.5) s. I(0 µv (2) = µv (2) + λ1 < µv (2) < 1). AMN PROOFS AND DERIVATIONS 195 argument identical to the proof of Theorem 6 in Zhang [2002]. we can assume that µc (k) = minv∈c µv (k). ∀c ∈ C \ V. we can apply it repeatedly to get an optimal integer solution. Thus if we can show that the update results in a feasible and better scoring assignment.1 Binary AMNs Proof (For Theorem 7. we present proofs of the LP inference properties and derivations of the factored primal and dual maxmargin formulation from Ch.1) Consider any fractional. Since gc (k) ≥ 0. µ will have at least one more integral µv (k) than µ. Recall that the LP relaxation for ﬁnding the optimal maxy g(y) is: K K max v∈V k=1 µv (k)gv (k) + c∈C\V k=1 K µc (k)gc (k) µv (k) = 1. µc (k) ≤ µv (k).
I(0 Dv (k) = gv (k)1 < µv (k) < 1). µv (1) + µv (2) = µv (1) − λ1 < µv (1) < 1) + µv (2) + λ1 < µv (2) < 1) I(0 I(0 = µv (1) + µv (2) = 1. min µv (k) = min µv (k) − ( min µv (k))1 < µv (k) < 1) I(0 v v i:µv (k)>0 = min min µv (k). Lastly. I(0 i∈c i∈c i∈c We have established that the new µ are feasible. we prove minv µv (k) = 0. we show µc (k) = mini∈c µv (k). I(0 Hence the new assignment µ is feasible. so is µv (2). To show that µv (k) ≥ 0. λ = λ(1) or λ = −λ(2). min i i:µv (k)>0 µv (k) − min µv (k) i:µv (k)>0 = 0. I(0 i∈c i∈c i∈c µc (2) = µc (2) + λ1 < µc (1) < 1) I(0 = (min µv (2)) + λ1 < min µv (2) < 1) = min µv (2). This implies that one of the two cases. and . and it remains to show that we can improve the objective.2 = λ v∈V [Dv (1) − Dv (2)] + c∈C\V [Dc (1) − Dc (2)] = λD Dc (k) = gc (k)1 < µc (k) < 1). PROOFS AND DERIVATIONS First. will necessarily increase the objective (or leave it unchanged).2 [µc (k) − µc (k)]gc (k) c∈C\V k=1. We can show that the change in the objective is always λD for some constant D that depends only on µ and g. we show that µv (1) + µv (2) = 1. Above we used the fact that if µv (1) is fractional. µc (1) = µc (1) − λ1 < µc (1) < 1) I(0 = (min µv (1)) − λ1 < min µv (1) < 1) = min µv (1). does not decrease the objective function. since µv (1) + µv (2) = 1. The change in the objective is: [µv (k) − µv (k)]gv (k) + v∈V k=1.196 APPENDIX A.
losing at most a factor of m = maxc∈C c in the objective function. The probability that none of the nodes in the clique will be assigned any label in one phase is maxi∈c µv (k). we use the randomized rounding procedure of Kleinberg and Tardos [1999] to produce an integer solution for the linear relaxation. Lemma A.2. but we can ignore this possibility for the purposes of the lower bound. In each phase. (They can also be assigned label k as a result of several phases. K v which is proportional to µv (k).1 The probability that a node i is assigned label k by the randomized procedure is µv (k). uniformly at random. Proof The probability that an unassigned node is assigned label k during one phase is 1 µ (k). we pick a label k. The procedure terminates when all nodes have been assigned a label.2 The probability that all nodes in a clique c are assigned label k by the procedure is at least 1 µ (k). c c Proof For a single phase.) The probability that all the . By symmetry.2 Multiclass AMNs For K > 2. AMN PROOFS AND DERIVATIONS 197 has strictly fewer fractional entries. For each node i which has not yet been assigned a label.2. Nodes in the clique c will be assigned label k by the procedure if they are assigned label k in one phase.A. the probability that all nodes in a clique c are assigned label k if none of the nodes were previously assigned is 1 K mini∈c µv (k) = that at least one of the nodes will be assigned label k in a phase 1− 1 K K k=1 1 µ (k).2. we assign the label k if µv (k) ≥ α. and a threshold α ∈ [0. Lemma A. The probability K c 1 is K (maxi∈c µv (k)). A.2. The basic idea of the rounding procedure is to treat µv (k) as probabilities and assign labels according to these probabilities in phases. the probability that a node is as signed label k over all phases is exactly µv (k). Our analysis closely follows that of Kleinberg and Tardos [1999]. 1] uniformly at random.
again. (A. As node potentials are often larger in magnitude than clique potentials. we note that the constant factor approximation is smaller for smaller cliques. c Proof This is immediate from the previous two lemmas. using the method of conditional probabilities. we ﬁrst used the fact that for d < 1. reducing further the actual error in practice. we observe. the terms corresponding to the logpartitionfunction and the node potentials are identical. The only difference between the expected cost of the rounded solution and the (non1 integer) optimal solution is the c factor in the second term. By picking m = maxc∈C c. we have that the rounded solution is at most m times worse than the optimal solution produced by the LP of Eq. the potentials associated with large cliques are typically smaller in magnitude. PROOFS AND DERIVATIONS nodes in c will be assigned label k by the procedure in a single phase is: ∞ j=1 1 1 µc (k) 1 − K K µc (k) K k=1 i∈c K j−1 max µv (k) k=1 i∈c = = µc (k) K k=1 maxi∈c µv (k) ≥ µv (k) = i∈c µc (k) K k=1 µv (k) ∞ i=0 µc (k) . similar in spirit to the approach of Kleinberg and Tardos [1999]. We can also derandomize this procedure to get a deterministic algorithm with the same guarantees. c 1 . We obtain an additive error (in logprobability space) only for the clique potentials.2. (A. in fact. the max of the set of positive µv (k)’s by their sum. Along similar lines. di = and then upperbounded Theorem A. 1−d Above. Thus. Note that the approximation factor of m applies.198 APPENDIX A.5) is at least 1 c∈C\V c K k=1 v∈V K k=1 gv (k)µv (k) + gc (k)µk .3 The expected cost of the assignment found by the randomized procedure given a solution µ to the linear program in Eq. the fact that we incur no loss proportional to node potentials is likely to lead to smaller errors in practice.5). . if we compare the logprobability of the optimal MAP solution and the logprobability of the assignment produced by this randomized rounding procedure. only to the clique potentials.
v (k) + (i) ¨ f w ¨i.v (k) ≥ mi. (i) (i) ¨ f Now let ξi.c.2.c.c (k) = i. v ∈ c.c. AMN PROOFS AND DERIVATIONS 199 A. .v (k) ≥ mi. k). ∀i. ∀i. c ∈ C (i) \ V (i) . k.t. (5. c ∈ C (i) \ V (i) .A. Reexpressing the above QP in terms of these new variables.c. (7. k.c (k) + mi.v (k) for each of the Substituting this dual into Eq.7) ξi.6) mi. ∀i. i.2): min v∈V ξi.v (k) i. v ∈ V (i) .v (yv ) + c⊃v w ¨i. ∀i.v (k) − c⊃v ∀i. mi.v .v (k) ≥ 0. we get: .c (k). (3. we have a variable ξi. .v .1 and 7.v + w fi. 1 w2 + C 2 (i) ξi i (A. v∈V (i) w fi (y ) + ξi ≥ −w fi. ¨ f −w ¨i.v (k) ≥ v∈c − ξi.4. In the dual.1) and variables mi. .c (yc )/c and mi.c. ¨ w ≥ 0. where fi.c.2.c (yc )/c. .v −w fi.1). . k.c (k) + mi. ¨ f −w ¨i. . v ∈ c.4. we obtain: min s.4. k.v for each normalization constraint in Eq.v (k) − c⊃v (A.v .c (k) = fi. k. c ∈ C (i) \ V (i) . i.3 Derivation of the factored primal and dual maxmargin QP Using Assumptions 7. . k. c ∈ C (i) \ V (i) . ∀i.c. k) and inequality constraints.c (k).c. v ∈ V (i) .c (k. we have the dual of the LP used to represent the interior max subproblem maxy w fi (y) + i (y) in Eq.c.v (k) ≥ 0.v (k) = mi.v (k) i. − ξi.c (k. s. ∀i. .v (k) ≥ v∈c i.t.v = ξi.
v∈V (i) (A.v . k.v∈V (i) ξi. 1 w2 + C 2 ξi ≥ v∈V (i) ξi i (A.c (k) + f ∀i.8) ξi.c (k).c. (i) ¨ f mi.v (k) − c⊃v mi. . 1 w2 + C 2 ξi. ∀i.c. v ∈ c.v (k) ≥ v∈c − ξi. k.v (k) ≥ −w ¨i. we can eliminate ξi and the corresponding set of constraints to get the formulation in Eq.c (k).v at the optimum. mi.v i.9) i.v (k) ≥ mi. (i) ¨ f mi. k. Since ξi = i. (7.c (yc )/c. ∀i.c. v ∈ V (i) . k. c ∈ C (i) \ V (i) .t.v (k) ≥ ∀i. ¨ w ∆¨i. ¨ w ≥ 0. v ∈ V (i) .v (k) − ¨ w ∆¨i. c ∈ C (i) \ V (i) .c. ¨ w ≥ 0. mi. v ∈ c. PROOFS AND DERIVATIONS min s. ∀i.c (yc )/c. w ∆fi.c.v . c ∈ C (i) \ V (i) .c. w ∆fi.t.v (k) ≥ c⊃v i.v (k) ≥ −w ¨i.c (k) + f v∈c − ξi. ∀i. ∀i.v (k) i. k.v . c ∈ C (i) \ V (i) .v (k) i. k.4). repeated here for reference: min s.200 APPENDIX A.
µi. we can eliminate λ and τ . and reexpress the above QP as: 2 2 max i. ∀c ∈ C (i) . ν ≥ 0. k (i) i.c (k) ≥ 0.v (k) = 1. k s.c (k) ≤ µi.c.A.c (k) f i. ∀i. k 1 µi.c∈C (i) \V (i) . v ∈ c. k. µi.v (k)∆fi.c (yc ) ≥ 0.c (k) − µi. k. ∀c ∈ C (i) \ V (i) .9) is given by: 2 max i.v∈V (i) .v (k) = C. µi.v∈V (i) . µi. k K 1 ¨ − C ν+ 2 µi. Using the substitution ν=τ+ ¨ ¨ i. λi.c (k) ≥ 0.c∈C (i) .t. ¨ .c∈C (i) .c.t. k (A. k (i) λi. ∀i.c (k) − 2 1 τ+ ¨ − 2 ˙ µi. k s. v ∈ c.v (k).v i. AMN PROOFS AND DERIVATIONS 201 Now the dual of Eq.v (k)∆fi. ∀i.c.c.c∈C (i) \V (i) .v (k) ≥ 0 and ¨i.v (k) ≥ 0 τ ≥ 0.c (k) f i. ∀c ∈ C (i) k=1 (i) µi. ∀v ∈ V (i) .v i. ∀i. ∀c ∈ C . ∀i.c (k)∆¨i. ∀c ∈ C (i) \ V (i) . k.v∈c. ¨ ∀i.c∈C (i) . In this dual. as well as divide f (i) µ’s by C.c (yc )/c f ¨ and the fact that λi. \ V . k=1 µi. (A.v∈c.v (k) = λi.c.10) 2 (i) λi.c (k) i.c (k)∆¨i.2.c (k) − C 2 ˙ µi.v (k). v ∈ c. while λ and τ correspond ¨ to third and fourth set of constraints. µ correspond to the ﬁrst two sets of constraints. ∀i. k.c (k) i. k 1 µi.c (yc )/c + f K µi.v (k)¨i. k.c∈C (i) .v (k)¨i. ∀v ∈ V (i) .
Nucleid Acids Res.. R. & Lipman (1997). P. & Jordan. R. 28. Ahuja. & RibeiroNeto. A. J. Schaffer. W. M. (2004). & Apweiler. T. ICML. Baldi.. Exponential families for conditional random ﬁelds. 35. M. Modern information retrieval. Smola. NIPS... Proc. Proc. Bach. (2003). & Hofmann. Cheng.. & Hofmann. Proc. P. Hidden markov support vector machines. A.. (2003). Apprenticeship learning via inverse reinforcement learning. Thin junction trees. S. & Orlin. (2001). Tsochantaridis.... NIPS.. Bach. Bairoch. F.... Zhang. Nucleic Acids Res. Proc.. Altun. A. 25. & Jordan. Y. NIPS. (2001).. R.. Learning spectral clustering. I. Inverse optimization.. Altschul. Altun. (1999). 771–783. (2004). Madden. ICML. (2000). (2004). B. 45–48. F. J. Part I: Linear programming and general problem. Gapped BLAST and PSIBLAST: a new generation of protein database search programs.Bibliography Abbeel. The SwissProt protein sequence database and its supplement trembl. Y. A.. & Vullo. Y. T.. Miller. UAI. & Ng. Largescale prediction of disulphide bond connectivity. 3389–3402. Operations Research. 202 . A. T. BaezaYates. AddisonWesleyLongman. A.
Shindyalov. Belongie. Bishop.. NIPS. MA: Athena Scientiﬁc. & Bourne. S. Nonlinear programming... J. Bouman. H. M. Department of Statistics. Exponentiated gradient algorithms for largemargin structured classiﬁcation. 48. (2004).. Journal of the Royal Statistical Society B. Gilliland.. S. Journal of Machine Learning Research. & Weinshall.. Pattern Anal. Berkeley. Blum. (1998). IP. BarHillel. T. & McAllester. Hertz. Collins. . & Mitchell. Bansal. (2003). 3(2). E. C.. Malik. The principled design of largescale recursive neural network architectures dagrnns and the protein structure prediction problem. N. Oxford. Bhat. Taskar. Correlation clustering. B. D. Belmont. Z. L. & Puzicha. ICML. IEEE Trans. On the statistical analysis of dirty pictures. Learning distance functions using equivalence relations.BIBLIOGRAPHY 203 Baldi. I. Besag. (1995). P.. Proc. (1986).. D. I. Bartlett. & Shapiro. M. The protein data bank.C. D. A. Shape matching and object recognition using shape contexts. J. A. Neural networks for pattern recognition. D. J. COLT. Westbrook. J. H. 4. Jordan. Weissig. & Tsitsiklis. Berman. (2000). (2002). UK: Oxford University Press.. C..... (1994). Proc. P. Blum. & Chawla. 24. M. Feng. D. (2003).. (2002). (1999).. A multiscale random ﬁeld model for bayesian image segmentation. Convexity. U.. Athena Scientiﬁc. N.. classiﬁcation. Intell. T. 575–602. G.. Bartlett. and risk bounds (Technical Report 638).. T. FOCS. Shental. Introduction to linear programming. J. P. Combining labeled and unlabeled data with cotraining. (1997).. A. & McAuliffe. (2003). G. Bertsimas.. J. Bertsekas.. Mach. P.. & Pollastri.
Frasconi. Veksler. V. NIPS. Collins. M.. O. Clark. Boykov. Charikar. (2004).. Ceroni.. O. R. (1999b).. A. & Zabih.. Headdriven statistical models for natural language parsing. V.. Y. & Curran. Statistical language learning. Cluster kernels for semisupervised learning. Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL ’04). Doctoral dissertation. Chakrabarti. (2004). & Indyk. S. (2002). Burton. O. A. (2004). Journal of VLSI Signal Processing. P.. 287–295. B. 45–61.. Convex optimization. Weston. & Vullo. (2003).. M. L. Boykov. FOCS.204 BIBLIOGRAPHY Boyd. & Kolmogorov. A. MIT Press. (1992). Markov random ﬁelds with efﬁcient approximations. D. Parsing the wsj using ccg and loglinear models. & Wirth. ICCV. J. Cambridge University Press. Fast approximate energy minimization via graph cuts. R.. SIGMOD. Passerini. P. Mathematical Programming. On an instance of the inverse shortest paths problem. University of Pennsylvania. R.. Veksler.. Dom.. . S. 35.... Clustering with qualitative information. & Zabih. B. (1999a). Guruswami. J. & Toint. (1999). A. (1993). Proc. Y. (2003). Charniak. & Vandenberghe. Predicting the disulﬁde bonding state of cysteines with combinations of kernel machines. L. 53. Y. E. & Schoelkopf. PAMI. Enhanced hypertext categorization using hyperlinks. P. (1998). Boykov. An experimental comparison of mincut/maxﬂow algorithms for energy minimization in computer vision. Chapelle.. S. CVPR.
& ShaweTaylor. & Immorlica. J. Collins. & Stein. UAI. & Lafferty. S.. Journal of Machine Learning Research. T.. J. 19(4). 2nd edition. DeGroot. Cambridge University Press. An introduction to support vector machines and other kernelbased learning methods. McCallum. Nigam. A. M.BIBLIOGRAPHY 205 Collins. M... R.. (2001). Dawid. H. Elements of information theory. A. On the algorithmic implementation of multiclass kernelbased vector machines. & Thomas. Introduction to algorithms.. New developments in parsing technology. (1970). & Spiegelhalter. Proc AAAI98 (pp. 175–182). Lauritzen. (1997). Della Pietra. 2(5). (1998). & Slattery.. In H. Proc. R. C. K. (1999). S. D. Carroll and G. T. (2001). A. New York: Wiley. D.. T. 509–516). Satta (Eds. New York: McGrawHill. N. Optimal statistical decisions. Y. (2003). Parameter estimation for statistical parsing models: Theory and practice of distributionfree methods.. J. M. (1991). (2001). IEEE Trans. & Jaakkola.. Bunt.. Kluwer. J. New York: Springer. M. Learning to extract symbolic knowledge from the world wide web. Corduneanu. D.). (2003).. Cowell. & Singer. Della Pietra.. Discriminative reranking for natural language parsing.. (2000).. ICML 17 (pp. Cormen. N. Inducing features of random ﬁelds. Demaine. Cover. on Pattern Analysis and Machine Intelligence. A. 380–393. K. . Correlation clustering with partial information. M.. D. V. 265–292. Collins. Freitag. Craven. Leiserson. DiPasquo. MIT Press. Parameter estimation for statistical parsing models: Theory and practice of distributionfree methods. Mitchell. On information regularization. E. Cristianini. Probabilistic networks and expert systems. Crammer. M.. APPROX. IWPT. T. Rivest. (2000). S.. (2004). C..
& Mitchison. J.. Gori. (1998). (1999)... 125–130. A.. & Casadio. New York: Wiley Interscience. P. 2nd edition. 36. Devroye. Fariselli.. & Casadio. P. 3. (2001). 39. S. Durbin. 957–964. Forsyth. L. J. Probabilistic theory of pattern recognition. Journal of Research at the National Bureau of Standards.. (2003). P. (1996). O. (1965). Introduction to informetrics. M.. L. G. P. Biological sequence analysis. D. Laird. Fariselli. A. & Rousseau. Prediction of disulﬁde connectivity in proteins. I. Bioinformatics. (1998). A. 464–468.. Emanuel. & Stork. Cambridge University Press. Correlation clustering . R. . (2000). 251–256. Journal of the Royal Statistical Society.. P. 69B. ESA. & Lugosi. 340–346. Predicting the oxidation state of cysteines by multiple sequence alignment. o New York: SpringerVerlag.206 BIBLIOGRAPHY Dempster. Fiser.. E. Krogh. B. (2002).. A. Edmonds.... IEEE Transactions on Neural Networks. Bionformatics. G.. Eddy. Proteins. (2002). G. Martelli. 1. Prentice Hall. R. & Casadio. Role of evolutionary information in predicting the disulﬁdebonding state of cysteine in proteins. R. Fariselli. P.. & Sperduti. R. (1990). N. 17. Hart.. & Simon. & Fiat. Maximum likelihood from incomplete data via the EM algorithm.. A. Ricobelli.minimizing disagreements on arbitrary weighted graphs. Egghe. (2000). (1977). R. L. Elsevier. D. Maximum matching and a polyhedron with 01 vertices. Frasconi. Gy¨ rﬁ. A neural networkbased method for predicting the disulﬁde connectivity in proteins.. P. Duda. P. R. A general framework for adaptive structures. D. Knowledge based intelligent information engineering systems and allied technologies (KES 2002). & Rubin. Computer vision: A modern approach. & Ponce. Pattern classiﬁcation. M.. D.
M. Passerini. . Freeman. (1997). Segal. IJCAI01 Workshop on Text Learning: Beyond Supervision. J. E. Gabow. (1973). IJCAI99 (pp. Exact maximum a posteriori estimation for binar images. ICML. (2003). Learning probabilistic relational models. Stockholm. Large margin classiﬁcation using the perceptron algorithm. S. & Campbell. & Johnson. Porteous. Algorithms on strings. & Johnson.. D. D. Friedman. Proceedings of IEEE Neural Network for signal processing conference. trees. N. Koller.. Proc. R. C.. Stanford University. D. Journal of Machine Learning Research. Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics. A. (1989). Taskar. A. Getoor. P. (2002). The kernel adatron algorithm: a fast and simple learning procedure for support vector machine. L. R.. Gusﬁeld. Wash. Sweden. Computational Learing Theory. Friess. Garey. N. L. Koller. T. Freund. Seattle.. Cristianini... Proc. L. Koller. and sequences : Computer science and computational biology. (1998). R. S. Efﬁcient solution algorithms for factored mdps. (1979). Parr. (2002). Cambridge University Press. & Seheult. B. (1999).. Getoor. (2001). 51. Guestrin. Greig. 1300–1309). Y... & Venkataraman. Implementation of algorithms for maximum matching on nonbipartite graphs. Statist. H. Getoor.. A. (2002). & Pfeffer. & Vullo.. & Koller. & Taskar. Dynamic programming for parsing and estimation of stochastic uniﬁcationbased grammars. Learning probabilistic models of link structure... Friedman... Probabilistic models of text and link structure for hypertext classiﬁcation. N... Computers and intractability. B. A two stage svm architecture for predicting the disulﬁde bonding state of cysteines. D. B. H... D. M. (1998). & Schapire. 19. D. Soc. B. R.BIBLIOGRAPHY 207 Frasconi. Journal of Artiﬁcial Intelligence Research. Doctoral dissertation. Proc. 8. M. D.. Geman. A. C. S. T.
& Sander. Journal of Molecular Biology. Analysis and classiﬁcation of disulphide connectivity in proteins. S.. S. Maxwell. P. (2001). M. ICML99 (pp. Kaplan... (1999). Journal of Combinatorial Optimization. J. (1995). (1999). King. S.. 1–63. Heuberger. & Friedman. Transductive inference for text classiﬁcation using support vector machines.. S. M. Kabsch. (1997). 200–209). D. Information and Computation. 132(1).. the entropic effect of crosslinkage. Joint and conditional estimation of tagging and parsing models. S.. (1994). (1999). T. methods. Canon. R. & Riezler. MIT Spoken Language Systems Group. Approximation algorithms for NPhard problems. R. UC Santa Cruz. Proceedings of HLTNAACL’04.. (1983). . Proceedings of ACL 1999. Hochbaum. J. San Francisco. Proc. T. (Ed. & Crouch. C. Z. Hastie. Tibshirani. 244. Inverse combinatorial optimization: A survey on problems. Haussler. Dictionary of protein secondary structure: Pattern recognition of hydrogenbonded and geometrical features. (2004). Riezler. (2004). R. W.. A.. & Warmuth. Johnson. Chi. C.. T. R. (2001). & Sternberg. Morgan Kaufmann Publishers. Kivinen. Geman.. (1997). Kassel. ACL 39. Johnson. D. Doctoral dissertation. Convolution kernels on discrete structures (Technical Report). Estimators for stochastic “uniﬁcationbased” grammars..208 BIBLIOGRAPHY Harrison. A comparison of approaches to online handwritten character recognition. PWS Publishing Company. Joachims.).. and results. 8. Vasserman. M. Exponentiated gradient versus gradient descent for linear predictors. Speed and accuracy in shallow and deep stochastic parsing. The elements of statistical learning. US. J. M. New York: SpringerVerlag.
. 46(5). Eskin. (2001). (1999). Zhu. & Pfeffer. ICML. (2002). X. Kolmogorov. On inverse problems of optimum perfect matching. A. Journal of the ACM. (1976). Lafferty. & Zabih. FOCS. Kernel conditional random ﬁelds: Representation and clique selection. (2003). E.. Probabilistic framebased systems. R. D. C. (2003). 580–587). (1998). D. (2003). & Pereira. (2002).. J. A. ICML. M. F. Z.. Prediction of βsheet topology and disulﬁde bridges in polypeptides. S. C.. Conditional random ﬁelds: Probabilistic models for segmenting and labeling sequence data. E. Wisc. Kleinberg. What energy functions can be minimized using graph cuts? PAMI. J. 24. . Proc. & Zhang. Kleinberg. & Liu. D. (2003). 191–208.. J. Paciﬁc Symposium on Biocomputing. J. Authoritative sources in a hyperlinked environment.. Discriminative ﬁelds for modeling spatial dependencies in natural images. & Tardos. NIPS. 604–632.. Rinehart and Winston. V. Madison. (2004). & Floudas. Leslie.BIBLIOGRAPHY 209 Klein. Journal of Combinatorial Optimization. C. 7. Koller. M. Approximation algorithms for classiﬁcation problems with pairwise relationships: Metric labeling and Markov random ﬁelds. Lafferty. Lawler. & Noble.. E. Klepeis. J. 423– 430). Proc. Journal of Computational Chemistry. Accurate unlexicalized parsing.. New York: Holt. W. McCallum. Liu. (1999). ACL 41 (pp. Combinatorial optimization: Networks and matroids. The spectrum kernel: a string kernel for svm protein classiﬁcation. Y. J. & Manning. & Hebert... AAAI98 (pp.. Kumar.
. Prediction of the disulﬁdebonding state of cysteines in proteins at 88% accuracy. R. Matsumura. McCallum. N. Fowlkes. C. Manning. Santorini. L. 291:293. (2003). D.210 BIBLIOGRAPHY Lodhi. (1991). Zens. UAI. 342. & Marcinkiewicz. (2000). H.. . J. D. Toward conditional models of identity uncertainty with application to proper noun coreference. & Malik. Symmetric word alignments for statistical machine translation. Martin. P. Basil Blackwell. Substantial increase of protein stability by multiple disulﬁde bonds. M. T. & Casadio. u Cambridge.. C. (1999). M. Tal. COLING. A. (1989). Computational Linguistics. Investment science.. Marcus. McGrawHill. C. (2004). (2002). & Ney. Foundations of statistical natural language processing. IJCAI Workshop on Information Integration on the Web.. ICCV. 313–330. R. Machine learning. (1993). & Wellner. Proc.. A. Cristianini. Martelli. McCallum. H. (2001).. Proc. H.. & Watkins. B. G. Efﬁciently inducing features of conditional random ﬁelds. Protein Science.. (2003). E. H. Nature... D. Signor. M. (1997). P. A. & Matthews. 19(2).. & Sch¨ tze. (1997). J. Portfolio selection: Efﬁcient diversiﬁcation of investments. Massachusetts: The MIT Press. B. Markowitz. Malaguti. Text classiﬁcation using string kernels. 11. Luenberger. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics.. Building a large annotated corpus of English: The Penn Treebank. B. NIPS. Fariselli. 27359. Matusov... ShaweTaylor. P. Mitchell. Proc. Oxford University Press...
X. S. I. A. Loopy belief propagation for approximate inference: an empirical study... Maximum entropy estimation for feature forests.. (1970). Pearl. Murphy. Machine Learning. AAAI2000 Workshop on Learning Statistical Models from Relational Data (pp.. K. & Jordan. & Russell. Y. Nocedal. Ng. Combinatorial optimization: Algorithms and complexity. generative classiﬁers: A comparison of logistic regression and naive Bayes. ICML. T. . Text classiﬁcation from labeled and unlabeled documents using em. Probabilistic reasoning in intelligent systems. & Wunsch. NJ: PrenticeHall. D. L. (1988). K. New York: J.BIBLIOGRAPHY 211 Miyao. A. & Wolsey. Nemhauser. Englewood Cliffs. & Jensen. C. J. Nigam. NIPS. Algorithms for inverse reinforcement learning. W.. Thrun. UAI99 (pp. B.. Wiley. 39. McCallum. (2001). (2003). & Croft. Proc.. Proceedings of Human Language Technology Conference (HLT 2002). S. & Tsujii. Papadimitriou. Proc. McCallum. Weiss. Table extraction using conditional random ﬁelds. A. Neville. M... (1982). A. S. Proc. J. 13–20). Numerical optimization. G. J. J. (2000). Pinto. & Mitchell. (1999). M. D. (1999). P.... S. Journal of Molecular Biology. 48. On discriminative vs.. 467–475). Y. (2000). Iterative classiﬁcation in relational data. San Francisco: Morgan Kaufmann. (2000). Y. C. & Steiglitz. (2002). ACM SIGIR. L.. Integer and combinatorial optimization. New York: Springer. & Wright. & Jordan. A. (1999). Needleman. K. J. Proc.. Ng. A general method applicable to the search for similarities in the amino acid sequences of two proteins. Wei..
. Proc. M. R. (2003). (1998). Proc. C. A. . Some generalized orderdisorder transformations. T. Tarantola. Machine Learning. & Joshi. A. Discovering test set regularities in relational domains. & Anthony. HLTNAACL. A. Springer.. ICML00 (pp. F. Smith. Sha. T. Shallow parsing with conditional random ﬁelds. Soc. ICML. 48. 195–197. 81–106. A. M. Partially labeled classiﬁcation with Markov random walks. Cambridge Phil.. (1999).. (2000).. 1. (2001). F. L. J. Proc. Mol. Inverse problem theory: Methods for data ﬁtting and model parameter estimation. S. Biol. J. on Information Theory. J. Shen. L. Proc. (2003). & McCallum. Using sparseness and analytic QP to speed training of support vector machines. (1981). R. Rohanimanesh. EMNLP. Proc. K.. M. & Waterman. Schrijver. J. T... 895–902). ShaweTaylor. NIPS. Structural risk minimization over datadependent hierarchies. R. Proc. A. Amsterdam: Elsevier. Sarkar. Using ltag based features in parse reranking. Dynamic conditional random ﬁelds: Factorized probabilistic models for labeling and segmenting sequence data. 44(5). (1952). B. Williamson.. (1987). Induction of decision trees. (2004). & Mitchell. (2001). Bartlett.. Combinatorial optimization: Polyhedra and efﬁciency. (2003). Slattery. C. Sutton. Potts.212 BIBLIOGRAPHY Platt. Quinlan.. Identiﬁcation of common molecular subsequences. & Pereira. P. 1926–1940. K. 147. NIPS. Szummer.. IEEE Trans. & Jaakkola..
BIBLIOGRAPHY 213 Taskar.. D.. Taskar. & Koller.. D. & Singer. IJCAI01 (pp. D. (1994). B.. Max margin Markov networks. Taskar. UAI. Proc. (2004). Probabilistic classiﬁcation and clustering in relational data. Support vector machine learning for interdependent and structured output spaces. A. 189–201.. Learning associative Markov networks. A. B. Valiant. C. B. Vazquez. Toutanova. E. NIPS. 8. M. Theoretical Computer Science. Y... Featurerich partofspeech tagging with a cyclic dependency network. (2004b). & Altun.. T. V. & Koller.. (2003). M. Seattle. & Koller.. & Palsson. 252–259). T. Wash. Taskar. (2003a). D. ICML. B. Guestrin. Nature Biotechnology. Proc. 870–876). D. (2004a). (2003b). & Vespignani.. (1979). 12. & Koller.. Vapnik. Twentyﬁrst international conference on Machine learning. 6. NAACL 3 (pp.. D.. (2002). (2003). G. Metabolic ﬂux balancing: Basic concepts. Maritan. New York: SpringerVerlag. Proc.. The nature of statistical learning theory.. (2001). Koller.. Abbeel. Varma. Abbeel. B.. Manning. Tsochantaridis. C... Y. D. Collins. scientiﬁc and practical use. D.. EMNLP. Discriminative probabilistic models for relational data. & Manning. New York. D. The complexity of computing the permanent. A. P. Klein. Max margin parsing. Global protein function prediction from proteinprotein interaction networksh. Segal. (1995). V. Flammini. L. I... C.. A. Wong. NIPS. Taskar. . P. Joachims. B. K.. Bio/Technology. Chatalbashev. Klein. B. & Koller. Taskar. A. Link prediction in relational data. Hofmann.
M. Distance metric learning. Wainwright. D. Wainwright. Wahba.. 10. Yang.a. & Willsky. Wang. (1967). (2000). H. T. Jordan. Allerton Conference on Communication. Information and Control.. Allerton Conference on Communication. a. Map estimation via agreement on (hyper)trees: Messagepassing and linear programming approaches. Zhang. Y. & Ghani. Ng. E.k. Proc. Bioinformatics. (2002). & Watkins. M. (2004). Weston. Computational Learning Theory and Natural Learning Systems.. Gu. M. I. Journal of Intelligent Information Systems. Vullo. Xing. & Jordan. (1999). (2002). C. A.. (2003). via penalized log likelihood and smoothing spline analysis of variance. with application to clustering with sideinformation. J. Soft classiﬁcation. & Weiss. Royal Holloway. J.. A. Younger. Efﬁcient graphbased energy minimization methods in computer vision. . Generalized belief propagation. Recognition and parsing of contextfree languages in time n3 . (1993).. Freeman. (1996). Y. Optimization. A network ﬂow method for solving inverse combinatorial optimization problems. A.. Jaakkola.. & Russell. J. A study of approaches to hypertext categorization..214 BIBLIOGRAPHY Veksler.. Variational inference in graphical models: The view from the marginal polytope. (1998). G. Doctoral dissertation.. S. C. S. risk estimation. Z. P. & Ma. (2002). 20. Control and Computing. 59–72. Slattery. M. Disulﬁde connectivity prediction using recursive neural networks and evolutionary information. & Frasconi. Department of Computer Science. University of London. 18(2).. NIPS. 653–659. Yedidia.. W. O. Proc... & Chappell. R.. 189–208. Y. Control and Computing. R. NIPS. Cornell University. Multiclass support vector machines (Technical Report CSDTR9804). 37.
& Hastie.. Journal of Machine Learning Research. J. & Lafferty. Z. 2. (2003). NIPS.BIBLIOGRAPHY 215 Zhang. J. Ghahramani. ICML. (2002). 527–550. Semisupervised learning using gaussian ﬁelds and harmonic functions. Proc.. T. Zhu.. T. Proc. Kernel logistic regression and the import vector machine. (2001). X. Zhu. . Covering number bounds of certain regularized linear function classes.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.