{"arxiv_id":"2003.01822","incoming":{"papers":5,"sentences":11,"groups":[{"kind":"extends","label":"Builds on it","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2110.01288","title":"Implicit Riemannian Concave Potential Maps","url":"/paper/2110.01288","section":"Introduction","sentence":"Our contributions are as follows: * We introduce Implicit Riemannian Concave Potential Maps, IRCPMs which extend Riemannian Convex Potential Maps, RCPMs from [ref] by allowing for much more general c-concave functions, <Ref>, and by making it easy to incorporate symmetries of the target density, <Ref>; * We extend results from implicit layers, [ref] , allowing higher-order implicit derivatives to be efficiently computed, <Ref>; * We discuss conditions under which the infimum problem necessary to define the potential $ψ^c$ can be simply solved by gradient descent, Section [ref].","intent_p":1.0,"contests_p":null}]},{"kind":"method_or_tool","label":"Uses its method or tool","papers":2,"sentences":2,"quotes":[{"arxiv_id":"2604.14184","title":"End-to-End Learning-based Operation of Integrated Energy Systems for Buildings and Data Centers","url":"/paper/2604.14184","section":"Constrained Optimization as a Neural Layer","sentence":"According to the implicit function theorem stated in [ref] , the derivatives of solution $U$ to the input predictions $Ŷ$ can be calculated by [equation]","intent_p":0.94,"contests_p":null},{"arxiv_id":"2110.01288","title":"Implicit Riemannian Concave Potential Maps","url":"/paper/2110.01288","section":"Implicit higher-order gradients","sentence":"As in [ref] , $u_i$ are obtained by solving a linear system of equations [equation] Second and higher-order vector-Jacobian products can be obtained by a recursive application of <Ref>.","intent_p":0.94,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":3,"sentences":4,"quotes":[{"arxiv_id":"2103.12803","title":"JFB: Jacobian-Free Backpropagation for Implicit Networks","url":"/paper/2103.12803","section":"Introduction","sentence":"A growing paradigm shift has emerged from explicit to implicit neural networks [ref] .","intent_p":0.98,"contests_p":null},{"arxiv_id":"2110.01288","title":"Implicit Riemannian Concave Potential Maps","url":"/paper/2110.01288","section":"Related Work","sentence":"In [ref] implicit layers defined via minimisation or fixed-point equations have been studied.","intent_p":0.94,"contests_p":null},{"arxiv_id":"2210.01802","title":"Alternating Differentiation for Optimization Layers","url":"/paper/2210.01802","section":"Related work","sentence":"Implicit models There has been growing interest in implicit models in recent years [ref] .","intent_p":1.0,"contests_p":null}]}],"unlabelled_sentences":4},"outgoing":{"papers":3,"sentences":5,"groups":[{"kind":"data_used","label":"Uses data or values from","papers":1,"sentences":1,"quotes":[{"arxiv_id":"1512.03012","title":"ShapeNet: An Information-Rich 3D Model Repository","url":"/paper/1512.03012","section":"Experiments - Level Set Layers","sentence":"Our network was evaluated with the proposed formulation on 8,000 3D models from four different categories ('cars', 'chairs', 'bottles' and 'sofas') in the ShapeNet dataset [ref] .","intent_p":0.97,"contests_p":null}]},{"kind":"background","label":"Cites as background","papers":1,"sentences":1,"quotes":[{"arxiv_id":"1607.05447","title":"On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization","url":"/paper/1607.05447","section":"Related Works","sentence":"Differentiation through optimization problems, e.g., $2$ operators, has seen a number of advances in recent years, among which, there are techniques that come up in bi-level optimization [ref] and sensitivity analysis [ref] .","intent_p":0.98,"contests_p":null}]}],"unlabelled_sentences":3},"claims":[],"thresholds":{"intent_p":0.8,"supports_p":0.95,"contests_p":0.7},"method":"Citing sentences come from each paper's LaTeX source; every \\cite marks the sentence and the works it cites. Pith's classifier typed each sentence. A label is shown at intent probability 0.8 or more (0.95 for support), a contest at 0.7 or more. Measured accuracy against two blind model families is at https://pith.science/accuracy. The quoted sentences are the citing authors' own.","held_up":null,"_links":{"html":"https://pith.science/paper/2003.01822"}}