{"title":"Salvage and Wreck","authors":"N. Phillips, Nicholas Craig, D. Steel","doi":"10.4324/9781003122647-10","DOIUrl":"https://doi.org/10.4324/9781003122647-10","url":null,"abstract":"","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83749125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Spencer Breiner, Blake S. Pollard, E. Subrahmanian, Olivier Marie-Rose
{"title":"Modeling Hierarchical System with Operads","authors":"Spencer Breiner, Blake S. Pollard, E. Subrahmanian, Olivier Marie-Rose","doi":"10.4204/EPTCS.323.5","DOIUrl":"https://doi.org/10.4204/EPTCS.323.5","url":null,"abstract":"This paper applies operads and functorial semantics to address the problem of failure diagnosis in complex systems. We start with a concrete example, developing a hierarchical interaction model for the Length Scale Interferometer, a high-precision measurement system operated by the US National Institute of Standards and Technology. The model is expressed in terms of combinatorial/diagrammatic structures called port-graphs, and we explain how to extract an operad LSI from a collection of these diagrams. Next we show how functors to the operad of probabilities organize and constrain the relative probabilities of component failure in the system. Finally, we show how to extend the analysis from general component failure to specific failure modes.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80244974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning Functors using Gradient Descent","authors":"Bruno Gavranovic","doi":"10.4204/EPTCS.323.15","DOIUrl":"https://doi.org/10.4204/EPTCS.323.15","url":null,"abstract":"Neural networks are a general framework for differentiable optimization which includes many other machine learning approaches as special cases. In this paper we build a category-theoretic formalism around a neural network system called CycleGAN. CycleGAN is a general approach to unpaired image-to-image translation that has been getting attention in the recent years. Inspired by categorical database systems, we show that CycleGAN is a \"schema\", i.e. a specific category presented by generators and relations, whose specific parameter instantiations are just set-valued functors on this schema. We show that enforcing cycle-consistencies amounts to enforcing composition invariants in this category. We generalize the learning procedure to arbitrary such categories and show a special class of functors, rather than functions, can be learned using gradient descent. Using this framework we design a novel neural network system capable of learning to insert and delete objects from images without paired data. We qualitatively evaluate the system on the CelebA dataset and obtain promising results.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84653544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Topos Semantics for a Higher-Order Temporal Logic of Actions","authors":"Philip Johnson-Freyd, Jon M. Aytac, G. Hulette","doi":"10.4204/EPTCS.323.11","DOIUrl":"https://doi.org/10.4204/EPTCS.323.11","url":null,"abstract":"TLA is a popular temporal logic for writing stuttering-invariant specifications of digital systems. However, TLA lacks higher-order features useful for specifying modern software written in higher-order programming languages. We use categorical techniques to recast a real-time semantics for TLA in terms of the actions of a group of time dilations, or \"stutters,\" and an extension by a monoid incorporating delays, or \"falters.\" Via the geometric morphism of the associated presheaf topoi induced by the inclusion of stutters into falters, we construct the first model of a higher-order TLA.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88513681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"String Diagrams for Regular Logic (Extended Abstract)","authors":"Brendan Fong, David I. Spivak","doi":"10.4204/EPTCS.323.14","DOIUrl":"https://doi.org/10.4204/EPTCS.323.14","url":null,"abstract":"Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free regular category FRg(T) on a set T. From this point of view, regular theories are certain monoidal 2-functors from a suitable 2-category of contexts -- the 2-category of relations in FRg(T) -- to that of posets. Such functors assign to each context the set of formulas in that context, ordered by entailment. We refer to such a 2-functor as a regular calculus because it naturally gives rise to a graphical string diagram calculus in the spirit of Joyal and Street. We shall show that every natural category has an associated regular calculus, and conversely from every regular calculus one can construct a regular category.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73408869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Compositional Game Theory with Mixed Strategies: Probabilistic Open Games Using a Distributive Law","authors":"Neil Ghani, C. Kupke, A. Lambert, F. Forsberg","doi":"10.4204/EPTCS.323.7","DOIUrl":"https://doi.org/10.4204/EPTCS.323.7","url":null,"abstract":"We extend the Open Games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category, which can be used to compose probabilistic games in parallel and sequentially. We also consider morphisms between games, and show that intuitive constructions give rise to functors and adjunctions between pure and probabilistic open games.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87215494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Atkey, Bruno Gavranovic, Neil Ghani, C. Kupke, J. Ledent, F. Forsberg
{"title":"Compositional Game Theory, Compositionally","authors":"R. Atkey, Bruno Gavranovic, Neil Ghani, C. Kupke, J. Ledent, F. Forsberg","doi":"10.4204/EPTCS.333.14","DOIUrl":"https://doi.org/10.4204/EPTCS.333.14","url":null,"abstract":"We present a new compositional approach to compositional game theory (CGT) based upon Arrows, a concept originally from functional programming, closely related to Tambara modules, and operators to build new Arrows from old. We model equilibria as a module over an Arrow and define an operator to build a new Arrow from such a module over an existing Arrow. We also model strategies as graded Arrows and define an operator which builds a new Arrow by taking the colimit of a graded Arrow. A final operator builds a graded Arrow from a graded bimodule. We use this compositional approach to CGT to show how known and previously unknown variants of open games can be proven to form symmetric monoidal categories.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86532005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proof Theory of Partially Normal Skew Monoidal Categories","authors":"Tarmo Uustalu, Niccolò Veltri, N. Zeilberger","doi":"10.4204/EPTCS.333.16","DOIUrl":"https://doi.org/10.4204/EPTCS.333.16","url":null,"abstract":"The skew monoidal categories of Szlach'anyi are a weakening of monoidal categories where the three structural laws of left and right unitality and associativity are not required to be isomorphisms but merely transformations in a particular direction. In previous work, we showed that the free skew monoidal category on a set of generating objects can be concretely presented as a sequent calculus. This calculus enjoys cut elimination and admits focusing, i.e. a subsystem of canonical derivations, which solves the coherence problem for skew monoidal categories. In this paper, we develop sequent calculi for partially normal skew monoidal categories, which are skew monoidal categories with one or more structural laws invertible. Each normality condition leads to additional inference rules and equations on them. We prove cut elimination and we show that the calculi admit focusing. The result is a family of sequent calculi between those of skew monoidal categories and (fully normal) monoidal categories. On the level of derivability, these define 8 weakenings of the (unit,tensor) fragment of intuitionistic non-commutative linear logic.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86356271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. Felice, Elena Di Lavore, Mario Rom'an, Alexis Toumi
{"title":"Functorial Language Games for Question Answering","authors":"G. Felice, Elena Di Lavore, Mario Rom'an, Alexis Toumi","doi":"10.4204/EPTCS.333.21","DOIUrl":"https://doi.org/10.4204/EPTCS.333.21","url":null,"abstract":"We present some categorical investigations into Wittgenstein's language-games, with applications to game-theoretic pragmatics and question-answering in natural language processing.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72750935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The linear-non-linear substitution 2-monad","authors":"M. Hyland, C. Tasson","doi":"10.4204/EPTCS.333.15","DOIUrl":"https://doi.org/10.4204/EPTCS.333.15","url":null,"abstract":"We introduce a general construction on 2-monads. We develop background on maps of 2-monads, their left semi-algebras, and colimits in 2-category. Then we introduce the construction of a colimit induced by a map of 2-monads, show that we obtain the structure of a 2-monad and give a characterisation of its algebras. Finally, we apply the construction to the map of 2-monads between free symmetric monoidal and the free cartesian 2-monads and combine them into a Linear Non-Linear 2-monad.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88788399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
