Distribution System Topology Detection Using Consumer Load and Line Flow Measurements Raffi Avo Sevlian and Ram Rajagopal

Total Page:16

File Type:pdf, Size:1020Kb

Distribution System Topology Detection Using Consumer Load and Line Flow Measurements Raffi Avo Sevlian and Ram Rajagopal 1 Distribution System Topology Detection Using Consumer Load and Line Flow Measurements Raffi Avo Sevlian and Ram Rajagopal Abstract—This work presents a topology detection method for breaker status indicators, and assume knowledge of the combining home smart meter information and sparse line flow system line parameters. The measurement types are focused measurements. The problem is formulated as a spanning tree on substation SCADA and load measurements in a very simple detection problem over a graph given partial nodal and edge flow information in a deterministic and stochastic setting. In the network. In [9] the authors introduce the use of high fre- deterministic case of known nodal power consumption and edge quency micro-Phasor Measurement Unit (µPMU) data in the flows we provide sensor placement criterion which guarantees topology detection task. They propose a method of comparing correct identification of all spanning trees. We then present a simulation and measured µPMU data for each topology. This detection method which is polynomial in complexity to the size work assumes high frequency voltage magnitude and phase of the graph. In the stochastic case where loads are given by forecasts derived from delayed smart meter data, we provide measurements are available in each bus. In [10], [11] and a combinatorial Maximum a Posteriori (MAP) detector and [12] the authors develop a voltage time series approach to a polynomial complexity approximate MAP detector which is identifying topology changes relying on voltage data at each shown to work near optimum in low noise regime numerical home. However they rely on long time captures, so their cases and moderately well in higher noise regime. method is more in line of network discovery not real time IEEE Transactions on Control of Network Systems topology detection. In [13] the authors present a general state estimator based method that is used in topology detection, similar to [8]. I. INTRODUCTION The need for advanced controls in the distribution system is an emerging topic in power system and controls com- munities. Proposed computational models for problems such as dispatching of distributed energy resources [1], [2] or coordinated voltage control [3], [4], [5], [6] assume known system topology and network parameters. In reality customer level feeders are not known with an accuracy equivalent to that of the transmission system. Enabling improved management and control requires signif- icantly improved estimation of the system state. This can be illustrated in the IEEE 123 Bus System shown in Figure I. The network not only has end nodes which represent residential transformers (blue rectangle), but various switching devices (green rectangles) and four feeders (red circles). In this system, Fig. 1. IEEE 123 Distribution system with commonly occurring sensing and actuating technologies, illustrated in clockwise order: Switching device, estimating the system state requires the determination of the smart meters, substations and line sensors. arXiv:1503.07224v5 [cs.SY] 15 Sep 2017 voltage phasor at every node and the status of all discrete devices that can connect and disconnect loads. In such a setting The contributions of this work differs significantly from a Generalized State Estimator (GSE) [7] is used to determine prior work in the following ways. Fist, we assume the the f0; 1g of each discrete device as well as the voltage at following information is available: 1) widely available load each bus. measurements from smart meters; 2) line flows on a fraction Some previous work has presented solutions to this issue,1 of the lines obtained from either line sensing or substation which differ from the contributions of this work. In [8], a SCADA. The line measurements are typically available in real traditional GSE is employed to identify the correct topology time, while smart metering data is delayed by multiple hours in a distribution system. The work presents a traditional requiring some forecasting if real time topology detection is weighted least square state estimator and use dummy variables required. Second, the detection and sensor placement problems are developed in both the deterministic case of combining R. Sevlian is with the Department of Electrical Engineering and the Stanford Sustainable Systems Lab, Department of Civil and Environmental historical load and line data and the stochastic case of combin- Engineering, Stanford University, CA, 94305. Email: [email protected]. ing line measurements with load forecasts. Additionally, our R. Rajagopal is with the Stanford Sustainable Systems Lab, Department model assumes a lossless network, which although introducing of Civil and Environmental Engineering, Stanford University, CA, 94305. R. Rajagopal is supported by the Powell Foundation Fellowship. Email: some error is much smaller than the typical load forecast. We [email protected]. show this solution lends itself well to a very robust data driven 2 approach where many of the line parameters are not known, D. Measurement Model or when AMI connectivity information may be in error. This For any edge e of the original distribution system, we denote robustness under large uncertainty makes this a very practical by s the power flow on it to all active downstream loads. and useful method for utilities. The sensor placement M ⊂ E, is a subset of edges of the The paper is organized as follows. Section II, III formulates network. We assume that the magnitude and direction of power the problem of topology detection. Sections IV and V solve the flow is measured. Additionally, we assume that the power flow detection and sensor placement problems in the deterministic measurements are error free. This assumption can be made and stochastic cases respectively. Finally, numerical demon- since any instrumentation error will be much smaller than the strations are given in Section VI, with additional details in the pseudo-measurement errors in practice. Appendix. Given a topology defined by w, the set of all measurements is s where the kth is given by II. PROBLEM FORMULATION X Consider a power distribution network where multiple feed- sk(w; x) = xj: (2) ers can supply energy to all consumers, and must be operated j:vj 2Vk(w) in a radial structure at all times. In network reconfiguration, The set V (w) is the subset of nodes for a particular topology sets of breakers and tie switches can reconfigure themselves k downstream of kth flow measurement under switch state w. such that all loads are connected and no feeders are connected. The task of recovering the network topology is to detect the switch statuses given all available information. E. Topology Detection A. DC Power Flow The detection and placement problem is solved in two scenarios: (1) deterministic case, where loads and flows are We use a DC power flow approximation to the actual AC known perfectly, (2) stochastic case, where loads are known flow in the distribution system [14]. The model is normally with uncertainty due to forecasting error. used in approximating the voltage magnitude and phase in In the deterministic case, a simple detector will return all the network, but since our detection problem relies on power topologies which satisfy the load and flow information as flows, this is equivalent to using a lossless network flow follows: representation. K In a usual representation, the distribution system is modeled w^ = fw 2 f0; 1g : sobs = s(w; x)g: (3) as a graph G(V; E) where vertices, v 2 V represent nodes (transformers) and the edges e 2 E represent the distribution In the stochastic case, a MAP detector can be written as lines. The signed incidence matrix is B 2 {−1; 0; +1gjV |×|Ej, w^ 2 arg max Pr (w j s; ^x) : (4) K where each undirected edge has a pre specified direction: ek = wi2f0;1g (vn; vm) on which to assign columns of B as follows: These naive methods are inefficient and provides no guaran- 8 tee on unique detection or sensor placement. For both detector >+1 if vi is the originating node of edge ej < types the following general questions are explored. Bi;j = −1 if vi is the terminal node of edge ej (1) :>0 else: 1) (Correctness): How to guarantee that this method will return a unique and correct spanning tree? Given the set of net injections in the network, y the flow 2) (Efficiency): How to search for the correct configuration constraints can be represented as: Bf = y. This can be without evaluating all 2K configuration since this can extended to a complex load case but is out of the scope of be inefficient? this work. 3) (Sensor placement): Where to place line sensing to minimize missed detections in both deterministic and B. Load Model stochastic settings? Each load vn in the system has a consumption xn. We The following sections show how this problem can be assume that the loads are single phase real power quantities reduced to a spanning tree detection problem, and how it can and the forecast errors are independent random variables: be solved in an efficient matter and provide some guarantees 2 2 n ∼ N(0; σn) and xn ∼ N(^xn; σn). Given the single global on sensor placement for correct status recovery. source of energy, we have the following y = [1T x − x]T . C. Switching Model Network Configuration III. MODEL REDUCTION Each switch has a status wi 2 f0; 1g, and w = We show that the general distribution system with switching fw1; : : : ; wK g. The switching is constrained so that all loads devices under a lossless power flow can be reduced to an island must be connected to some feeder and there can exist no graph which simplifies the structure of the valid configurations. path between various feeders. This ensures that each feeder The detection problem is then cast as a spanning tree detection is connected to some set of loads in a radial configuration, problem with nodal and edge measurements on the island and that no loads are in outage.
Recommended publications
  • Applications of the Quantum Algorithm for St-Connectivity
    Applications of the quantum algorithm for st-connectivity KAI DELORENZO1 , SHELBY KIMMEL1 , AND R. TEAL WITTER1 1Middlebury College, Computer Science Department, Middlebury, VT Abstract We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bipartiteness) using a reduction to st-connectivity. Furthermore, we show that our algorithm for cycle detection has improved performance under the promise of large circuit rank or a small number of edges. We also provide algo- rithms for detecting even-length cycles and for estimating the circuit rank of a graph. All of our algorithms have logarithmic space complexity. 1 Introduction Quantum query algorithms are remarkably described by span programs [15, 16], a linear algebraic object originally created to study classical logspace complexity [12]. However, finding optimal span program algorithms can be challenging; while they can be obtained using a semidefinite program, the size of the program grows exponentially with the size of the input to the algorithm. Moreover, span programs are designed to characterize the query complexity of an algorithm, while in practice we also care about the time and space complexity. One of the nicest span programs is for the problem of undirected st-connectivity, in which one must decide whether two vertices s and t are connected in a given graph. It is “nice” for several reasons: It is easy to describe and understand why it is correct. • It corresponds to a quantum algorithm that uses logarithmic (in the number of vertices and edges of • the graph) space [4, 11].
    [Show full text]
  • The Normalized Laplacian Spectrum of Subdivisions of a Graph
    The normalized Laplacian spectrum of subdivisions of a graph Pinchen Xiea,b, Zhongzhi Zhanga,c, Francesc Comellasd aShanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai 200433, China bDepartment of Physics, Fudan University, Shanghai 200433, China cSchool of Computer Science, Fudan University, Shanghai 200433, China dDepartment of Applied Mathematics IV, Universitat Polit`ecnica de Catalunya, 08034 Barcelona Catalonia, Spain Abstract Determining and analyzing the spectra of graphs is an important and excit- ing research topic in mathematics science and theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on some relevant dynamical aspects, in particular those related to random walks. In this paper, we give the spec- tra of the normalized Laplacian of iterated subdivisions of simple connected graphs. As an example of application of these results we find the exact val- ues of their multiplicative degree-Kirchhoff index, Kemeny's constant and number of spanning trees. Keywords: Normalized Laplacian spectrum, Subdivision graph, Degree-Kirchhoff index, Kemeny's constant, Spanning trees 1. Introduction Spectral analysis of graphs has been the subject of considerable research effort in mathematics and computer science [1, 2, 3], due to its wide appli- cations in this area and in general [4, 5]. In the last few decades a large body of scientific literature has established that important structural and dynamical properties
    [Show full text]
  • Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory
    Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2012, Article ID 973920, 27 pages doi:10.1155/2012/973920 Research Article Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory Jianguo Tang,1, 2 Kun She,1 and William Zhu3 1 School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China 2 School of Computer Science and Engineering, XinJiang University of Finance and Economics, Urumqi 830012, China 3 Lab of Granular Computing, Zhangzhou Normal University, Zhangzhou 363000, China Correspondence should be addressed to William Zhu, [email protected] Received 4 February 2012; Revised 30 April 2012; Accepted 18 May 2012 Academic Editor: Mehmet Sezer Copyright q 2012 Jianguo Tang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Constructing structures with other mathematical theories is an important research field of rough sets. As one mathematical theory on sets, matroids possess a sophisticated structure. This paper builds a bridge between rough sets and matroids and establishes the matroidal structure of rough sets. In order to understand intuitively the relationships between these two theories, we study this problem from the viewpoint of graph theory. Therefore, any partition of the universe can be represented by a family of complete graphs or cycles. Then two different kinds of matroids are constructed and some matroidal characteristics of them are discussed, respectively. The lower and the upper approximations are formulated with these matroidal characteristics.
    [Show full text]
  • Permutation of Elements in Double Semigroups
    PERMUTATION OF ELEMENTS IN DOUBLE SEMIGROUPS MURRAY BREMNER AND SARA MADARIAGA Abstract. Double semigroups have two associative operations ◦, • related by the interchange relation: (a • b) ◦ (c • d) ≡ (a ◦ c) • (b ◦ d). Kock [13] (2007) discovered a commutativity property in degree 16 for double semigroups: as- sociativity and the interchange relation combine to produce permutations of elements. We show that such properties can be expressed in terms of cycles in directed graphs with edges labelled by permutations. We use computer alge- bra to show that 9 is the lowest degree for which commutativity occurs, and we give self-contained proofs of the commutativity properties in degree 9. 1. Introduction Definition 1.1. A double semigroup is a set S with two associative binary operations •, ◦ satisfying the interchange relation for all a,b,c,d ∈ S: (⊞) (a • b) ◦ (c • d) ≡ (a ◦ c) • (b ◦ d). The symbol ≡ indicates that the equation holds for all values of the variables. We interpret ◦ and • as horizontal and vertical compositions, so that (⊞) ex- presses the equivalence of two decompositions of a square array: a b a b a b (a ◦ b) • (c ◦ d) ≡ ≡ ≡ ≡ (a • c) ◦ (b • d). c d c d c d This interpretation of the operations extends to any double semigroup monomial, producing what we call the geometric realization of the monomial. The interchange relation originated in homotopy theory and higher categories; see Mac Lane [15, (2.3)] and [16, §XII.3]. It is also called the Godement relation by arXiv:1405.2889v2 [math.RA] 26 Mar 2015 some authors; see Simpson [21, §2.1].
    [Show full text]
  • G-Parking Functions and Tree Inversions
    G-PARKING FUNCTIONS AND TREE INVERSIONS DAVID PERKINSON, QIAOYU YANG, AND KUAI YU Abstract. A depth-first search version of Dhar’s burning algorithm is used to give a bijection between the parking functions of a graph and labeled spanning trees, relating the degree of the parking function with the number of inversions of the spanning tree. Specializing to the complete graph solves a problem posed by R. Stanley. 1. Introduction Let G = (V, E) be a connected simple graph with vertex set V = {0,...,n} and edge set E. Fix a root vertex r ∈ V and let SPT(G) denote the set of spanning trees of G rooted at r. We think of each element of SPT(G) as a directed graph in which all paths lead away from the root. If i, j ∈ V and i lies on the unique path from r to j in the rooted spanning tree T , then i is an ancestor of j and j is a descendant of i in T . If, in addition, there are no vertices between i and j on the path from the root, then i is the parent of its child j, and (i, j) is a directed edge of T . Definition 1. An inversion of T ∈ SPT(G) is a pair of vertices (i, j), such that i is an ancestor of j in T and i > j. It is a κ-inversion if, in addition, i is not the root and i’s parent is adjacent to j in G. The number of κ-inversions of T is the tree’s κ-number, denoted κ(G, T ).
    [Show full text]
  • The Normalized Laplacian Spectrum of Subdivisions of a Graph
    The normalized Laplacian spectrum of subdivisions of a graph Pinchen Xiea,c, Zhongzhi Zhangb,c, Francesc Comellasd aDepartment of Physics, Fudan University, Shanghai 200433, China bSchool of Computer Science, Fudan University, Shanghai 200433, China cShanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai 200433, China dDepartment of Applied Mathematics IV, Universitat Polit`ecnica de Catalunya, 08034 Barcelona Catalonia, Spain Abstract Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on some relevant dynamical aspects, in particular those related to random walks. In this paper, we give the spectra of the nor- malized Laplacian of iterated subdivisions of simple connected graphs. As an example of application of these results we find the exact values of their multiplicative degree-Kirchhoff index, Kemeny’s constant and number of spanning trees. Keywords: Normalized Laplacian spectrum, Subdivision graph, Degree-Kirchhoff index, Kemeny’s constant, Spanning trees 1. Introduction arXiv:1510.02394v1 [math.CO] 7 Oct 2015 Spectral analysis of graphs has been the subject of considerable research effort in theoretical computer science [1, 2, 3], due to its wide applications in this area and in general [4, 5]. In the last few decades a large body of scientific literature has established that important structural and dynamical properties
    [Show full text]
  • Classes of Graphs Embeddable in Order-Dependent Surfaces
    Classes of graphs embeddable in order-dependent surfaces Colin McDiarmid Sophia Saller Department of Statistics Department of Mathematics University of Oxford University of Oxford [email protected] and DFKI [email protected] 12 June 2021 Abstract Given a function g = g(n) we let Eg be the class of all graphs G such that if G has order n (that is, has n vertices) then it is embeddable in some surface of Euler genus at most g(n), and let eEg be the corresponding class of unlabelled graphs. We give estimates of the sizes of these classes. For example we 3 g show that if g(n) = o(n= log n) then the class E has growth constant γP, the (labelled) planar graph growth constant; and when g(n) = O(n) we estimate the number of n-vertex graphs in Eg and eEg up g to a factor exponential in n. From these estimates we see that, if E has growth constant γP then we must have g(n) = o(n= log n), and the generating functions for Eg and eEg have strictly positive radius of convergence if and only if g(n) = O(n= log n). Such results also hold when we consider orientable and non-orientable surfaces separately. We also investigate related classes of graphs where we insist that, as well as the graph itself, each subgraph is appropriately embeddable (according to its number of vertices); and classes of graphs where we insist that each minor is appropriately embeddable. In a companion paper [43], these results are used to investigate random n-vertex graphs sampled uniformly from Eg or from similar classes.
    [Show full text]
  • Cheminformatics for Genome-Scale Metabolic Reconstructions
    CHEMINFORMATICS FOR GENOME-SCALE METABOLIC RECONSTRUCTIONS John W. May European Molecular Biology Laboratory European Bioinformatics Institute University of Cambridge Homerton College A thesis submitted for the degree of Doctor of Philosophy June 2014 Declaration This thesis is the result of my own work and includes nothing which is the outcome of work done in collaboration except where specifically indicated in the text. This dissertation is not substantially the same as any I have submitted for a degree, diploma or other qualification at any other university, and no part has already been, or is currently being submitted for any degree, diploma or other qualification. This dissertation does not exceed the specified length limit of 60,000 words as defined by the Biology Degree Committee. This dissertation has been typeset using LATEX in 11 pt Palatino, one and half spaced, according to the specifications defined by the Board of Graduate Studies and the Biology Degree Committee. June 2014 John W. May to Róisín Acknowledgements This work was carried out in the Cheminformatics and Metabolism Group at the European Bioinformatics Institute (EMBL-EBI). The project was fund- ed by Unilever, the Biotechnology and Biological Sciences Research Coun- cil [BB/I532153/1], and the European Molecular Biology Laboratory. I would like to thank my supervisor, Christoph Steinbeck for his guidance and providing intellectual freedom. I am also thankful to each member of my thesis advisory committee: Gordon James, Julio Saez-Rodriguez, Kiran Patil, and Gos Micklem who gave their time, advice, and guidance. I am thankful to all members of the Cheminformatics and Metabolism Group.
    [Show full text]
  • COLORING GRAPHS USING TOPOLOGY 11 Realized by Tutte Who Called an Example of a Disc G for Which the Boundary Has Chromatic Number 4 a Chromatic Obstacle
    COLORING GRAPHS USING TOPOLOGY OLIVER KNILL Abstract. Higher dimensional graphs can be used to color 2- dimensional geometric graphs G. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colorable with 4 colors. The later goal is achieved if all inte- rior edge degrees are even. Using a refinement process which cuts the interior along surfaces S we can adapt the degrees along the boundary S. More efficient is a self-cobordism of G with itself with a host graph discretizing the product of G with an interval. It fol- lows from the fact that Euler curvature is zero everywhere for three dimensional geometric graphs, that the odd degree edge set O is a cycle and so a boundary if H is simply connected. A reduction to minimal coloring would imply the four color theorem. The method is expected to give a reason \why 4 colors suffice” and suggests that every two dimensional geometric graph of arbitrary degree and ori- entation can be colored by 5 colors: since the projective plane can not be a boundary of a 3-dimensional graph and because for higher genus surfaces, the interior H is not simply connected, we need in general to embed a surface into a 4-dimensional simply connected graph in order to color it. This explains the appearance of the chromatic number 5 for higher degree or non-orientable situations, a number we believe to be the upper limit. For every surface type, we construct examples with chromatic number 3; 4 or 5, where the construction of surfaces with chromatic number 5 is based on a method of Fisk.
    [Show full text]
  • Graph Theory Trees
    GGRRAAPPHH TTHHEEOORRYY -- TTRREEEESS http://www.tutorialspoint.com/graph_theory/graph_theory_trees.htm Copyright © tutorialspoint.com Trees are graphs that do not contain even a single cycle. They represent hierarchical structure in a graphical form. Trees belong to the simplest class of graphs. Despite their simplicity, they have a rich structure. Trees provide a range of useful applications as simple as a family tree to as complex as trees in data structures of computer science. Tree A connected acyclic graph is called a tree. In other words, a connected graph with no cycles is called a tree. The edges of a tree are known as branches. Elements of trees are called their nodes. The nodes without child nodes are called leaf nodes. A tree with ‘n’ vertices has ‘n-1’ edges. If it has one more edge extra than ‘n-1’, then the extra edge should obviously has to pair up with two vertices which leads to form a cycle. Then, it becomes a cyclic graph which is a violation for the tree graph. Example 1 The graph shown here is a tree because it has no cycles and it is connected. It has four vertices and three edges, i.e., for ‘n’ vertices ‘n-1’ edges as mentioned in the definition. Note − Every tree has at least two vertices of degree one. Example 2 In the above example, the vertices ‘a’ and ‘d’ has degree one. And the other two vertices ‘b’ and ‘c’ has degree two. This is possible because for not forming a cycle, there should be at least two single edges anywhere in the graph.
    [Show full text]
  • Hamiltonian Cycle and Related Problems: Vertex-Breaking, Grid
    Hamiltonian Cycle and Related Problems: Vertex-Breaking, Grid Graphs, and Rubik’s Cubes by Mikhail Rudoy Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Masters of Engineering in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 2017 ○c Mikhail Rudoy, MMXVII. All rights reserved. The author hereby grants to MIT permission to reproduce and to distribute publicly paper and electronic copies of this thesis document in whole or in part in any medium now known or hereafter created. Author............................................................................ Department of Electrical Engineering and Computer Science May 26, 2017 Certified by. Erik Demaine Professor Thesis Supervisor Accepted by....................................................................... Christopher J. Terman Chairman, Masters of Engineering Thesis Committee THIS PAGE INTENTIONALLY LEFT BLANK 2 Hamiltonian Cycle and Related Problems: Vertex-Breaking, Grid Graphs, and Rubik’s Cubes by Mikhail Rudoy Submitted to the Department of Electrical Engineering and Computer Science on May 26, 2017, in partial fulfillment of the requirements for the degree of Masters of Engineering in Electrical Engineering and Computer Science Abstract In this thesis, we analyze the computational complexity of several problems related to the Hamiltonian Cycle problem. We begin by introducing a new problem, which we call Tree-Residue Vertex-Breaking (TRVB). Given a multigraph 퐺 some of whose vertices are marked “breakable,” TRVB asks whether it is possible to convert 퐺 into a tree via a sequence of applications of the vertex- breaking operation: disconnecting the edges at a degree-푘 breakable vertex by replacing that vertex with 푘 degree-1 vertices.
    [Show full text]
  • Learning Max-Margin Tree Predictors
    Learning Max-Margin Tree Predictors Ofer Meshiy∗ Elad Ebany∗ Gal Elidanz Amir Globersony y School of Computer Science and Engineering z Department of Statistics The Hebrew University of Jerusalem, Israel Abstract years using structured output prediction has resulted in state-of-the-art results in many real-worlds problems from computer vision, natural language processing, Structured prediction is a powerful frame- computational biology, and other fields [Bakir et al., work for coping with joint prediction of 2007]. Such predictors can be learned from data using interacting outputs. A central difficulty in formulations such as Max-Margin Markov Networks using this framework is that often the correct (M3N) [Taskar et al., 2003, Tsochantaridis et al., 2006], label dependence structure is unknown. At or conditional random fields (CRF) [Lafferty et al., the same time, we would like to avoid an 2001]. overly complex structure that will lead to intractable prediction. In this work we ad- While the prediction and the learning tasks are dress the challenge of learning tree structured generally computationally intractable [Shimony, 1994, predictive models that achieve high accuracy Sontag et al., 2010], for some models they can be while at the same time facilitate efficient carried out efficiently. For example, when the model (linear time) inference. We start by proving consists of pairwise dependencies between output vari- that this task is in general NP-hard, and then ables, and these form a tree structure, prediction can suggest an approximate alternative. Our be computed efficiently using dynamic programming CRANK approach relies on a novel Circuit- at a linear cost in the number of output variables RANK regularizer that penalizes non-tree [Pearl, 1988].
    [Show full text]