Reports de recerca
http://hdl.handle.net/2117/3488
Sat, 23 Sep 2017 05:18:33 GMT2017-09-23T05:18:33ZIdentifiability and transportability in dynamic causal networks
http://hdl.handle.net/2117/101979
Identifiability and transportability in dynamic causal networks
Blondel, Gilles; Arias Vicente, Marta; Gavaldà Mestre, Ricard
In this paper we propose a causal analog to the purely observational Dynamic Bayesian Networks, which we call Dynamic Causal Networks.
We provide a sound and complete algorithm for identification of Dynamic Causal Networks, namely, for computing the effect of an intervention or experiment, based on passive observations only, whenever possible. We note the existence of two types of confounder variables that affect in substantially different ways the identification
procedures, a distinction with no analog in either Dynamic Bayesian Networks or standard causal graphs. We further propose a procedure
for the transportability of causal effects in Dynamic Causal Network settings, where the result of causal experiments in a source domain may be used for the identification of causal effects in a target domain.
Mon, 06 Mar 2017 16:15:45 GMThttp://hdl.handle.net/2117/1019792017-03-06T16:15:45ZBlondel, GillesArias Vicente, MartaGavaldà Mestre, RicardIn this paper we propose a causal analog to the purely observational Dynamic Bayesian Networks, which we call Dynamic Causal Networks.
We provide a sound and complete algorithm for identification of Dynamic Causal Networks, namely, for computing the effect of an intervention or experiment, based on passive observations only, whenever possible. We note the existence of two types of confounder variables that affect in substantially different ways the identification
procedures, a distinction with no analog in either Dynamic Bayesian Networks or standard causal graphs. We further propose a procedure
for the transportability of causal effects in Dynamic Causal Network settings, where the result of causal experiments in a source domain may be used for the identification of causal effects in a target domain.Generalising discontinuity
http://hdl.handle.net/2117/100910
Generalising discontinuity
Morrill, Glyn; Merenciano Saladrigas, Josep Maria
This paper makes two generalisations of categorial calculus of discontinuity. In the first we introduce unary modalities which mediate between continuous and discontinuous strings. In the second each of the modes of adjunction of the proposal to date, concatenation, juxtaposition and interpolation, are augmented with variants. Linguistic illustration and motivation is provided, and we show how adherence to a discipline of sorting renders the generalisations tractable within a particularly efficient logic programming paradigm.
Mon, 13 Feb 2017 11:51:52 GMThttp://hdl.handle.net/2117/1009102017-02-13T11:51:52ZMorrill, GlynMerenciano Saladrigas, Josep MariaThis paper makes two generalisations of categorial calculus of discontinuity. In the first we introduce unary modalities which mediate between continuous and discontinuous strings. In the second each of the modes of adjunction of the proposal to date, concatenation, juxtaposition and interpolation, are augmented with variants. Linguistic illustration and motivation is provided, and we show how adherence to a discipline of sorting renders the generalisations tractable within a particularly efficient logic programming paradigm.An efficient closed frequent itemset miner for the MOA stream mining system
http://hdl.handle.net/2117/99416
An efficient closed frequent itemset miner for the MOA stream mining system
Quadrana, Massimo; Bifet Figuerol, Albert Carles; Gavaldà Mestre, Ricard
Mining itemsets is a central task in data mining, both in the batch and the streaming paradigms. While robust, efficient, and well-tested implementations exist for batch mining, hardly any publicly available equivalent exists for the streaming scenario. The lack of an efficient, usable tool for the task hinders its use by practitioners and makes it difficult to assess new research in the area. To alleviate this situation, we review the algorithms described in the literature, and implement and evaluate the IncMine algorithm by Cheng, Ke, and Ng (2008) for mining frequent closed itemsets from data streams. Our implementation works on top of the MOA (Massive Online Analysis) stream mining framework to ease its use and integration with other stream mining tasks. We provide a PAC-style rigorous analysis of the quality of the output of IncMine as a function of its parameters; this type of analysis is rare in pattern mining algorithms. As a by-product, the analysis shows how one of the user-provided parameters in the original description can be removed entirely while retaining the performance guarantees. Finally, we experimentally confirm both on synthetic and real data the excellent performance of the algorithm, as reported in the original paper, and its ability to handle concept drift.
Tue, 17 Jan 2017 10:16:22 GMThttp://hdl.handle.net/2117/994162017-01-17T10:16:22ZQuadrana, MassimoBifet Figuerol, Albert CarlesGavaldà Mestre, RicardMining itemsets is a central task in data mining, both in the batch and the streaming paradigms. While robust, efficient, and well-tested implementations exist for batch mining, hardly any publicly available equivalent exists for the streaming scenario. The lack of an efficient, usable tool for the task hinders its use by practitioners and makes it difficult to assess new research in the area. To alleviate this situation, we review the algorithms described in the literature, and implement and evaluate the IncMine algorithm by Cheng, Ke, and Ng (2008) for mining frequent closed itemsets from data streams. Our implementation works on top of the MOA (Massive Online Analysis) stream mining framework to ease its use and integration with other stream mining tasks. We provide a PAC-style rigorous analysis of the quality of the output of IncMine as a function of its parameters; this type of analysis is rare in pattern mining algorithms. As a by-product, the analysis shows how one of the user-provided parameters in the original description can be removed entirely while retaining the performance guarantees. Finally, we experimentally confirm both on synthetic and real data the excellent performance of the algorithm, as reported in the original paper, and its ability to handle concept drift.Modeling cloud resources using machine learning
http://hdl.handle.net/2117/99413
Modeling cloud resources using machine learning
Berral, Josep Ll.; Gavaldà Mestre, Ricard; Torres Viñals, Jordi
Cloud computing is a new Internet infrastructure paradigm where management optimization has become a challenge to be solved, as all current management systems are human-driven or ad-hoc automatic systems that must be tuned manually by experts. Management of cloud resources require accurate information about all the elements involved (host machines, resources, offered services, and clients), and some of this information can only be obtained a posteriori. Here we present the cloud and part of its architecture as a new scenario where data mining and machine learning can be applied to discover information and improve its management thanks to modeling and prediction. As a novel case of study we show in this work the modeling of basic cloud resources using machine learning, predicting resource requirements from context information like amount of load and clients, and also predicting the quality of service from resource planning, in order to feed cloud schedulers. Further, this work is an important part of our ongoing research program, where accurate models and predictors are essential to optimize cloud management autonomic systems.
Tue, 17 Jan 2017 10:07:13 GMThttp://hdl.handle.net/2117/994132017-01-17T10:07:13ZBerral, Josep Ll.Gavaldà Mestre, RicardTorres Viñals, JordiCloud computing is a new Internet infrastructure paradigm where management optimization has become a challenge to be solved, as all current management systems are human-driven or ad-hoc automatic systems that must be tuned manually by experts. Management of cloud resources require accurate information about all the elements involved (host machines, resources, offered services, and clients), and some of this information can only be obtained a posteriori. Here we present the cloud and part of its architecture as a new scenario where data mining and machine learning can be applied to discover information and improve its management thanks to modeling and prediction. As a novel case of study we show in this work the modeling of basic cloud resources using machine learning, predicting resource requirements from context information like amount of load and clients, and also predicting the quality of service from resource planning, in order to feed cloud schedulers. Further, this work is an important part of our ongoing research program, where accurate models and predictors are essential to optimize cloud management autonomic systems.The Plogi and ACi-1 operators on the polynomial time hierarchy
http://hdl.handle.net/2117/97278
The Plogi and ACi-1 operators on the polynomial time hierarchy
Castro Rabal, Jorge; Seara Ojea, Carlos
In a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, Pi_k^p, Delta_k^P and Theta_k^P-classes both operators have the same behaviour, but this coincidence does not seem to be true on other classes included in the PH hierarchy: we give a set A such that, relativized to A, P_{log^i}(P_{log^j}(NP)) is different from AC^{i-1}(P_{log^j}(NP)). As a result of these characterizations we show P_{log}(Theta_k^p) = Theta_k^p, an equality that is useful to show lowness properties. In fact, we get easily the Theta-lowness results given by Long and Sheu in their paper [LS-91]. Besides, we clarify the situation of the classes in L_2^{p,Delta} for which their membership to L_2^{p,Theta} was not clear.
Mon, 28 Nov 2016 09:01:43 GMThttp://hdl.handle.net/2117/972782016-11-28T09:01:43ZCastro Rabal, JorgeSeara Ojea, CarlosIn a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, Pi_k^p, Delta_k^P and Theta_k^P-classes both operators have the same behaviour, but this coincidence does not seem to be true on other classes included in the PH hierarchy: we give a set A such that, relativized to A, P_{log^i}(P_{log^j}(NP)) is different from AC^{i-1}(P_{log^j}(NP)). As a result of these characterizations we show P_{log}(Theta_k^p) = Theta_k^p, an equality that is useful to show lowness properties. In fact, we get easily the Theta-lowness results given by Long and Sheu in their paper [LS-91]. Besides, we clarify the situation of the classes in L_2^{p,Delta} for which their membership to L_2^{p,Theta} was not clear.Syntactic connectivity
http://hdl.handle.net/2117/97249
Syntactic connectivity
Morrill, Glyn
Type logical grammar presents a paradigm of linguistic
description based on what we may refer to as a
Lambek-van Benthem correspondence: (logical) formulas
as (linguistic) categories. Lexical signs are classified by
category formulas, and the language model projected by
a lexicon is determined by the consequence relation
induced on category formulas by their interpretation.
In this logical model of language, (logical) proofs
correspond to (linguistic) derivations, but such syntax
serves just to calculate what is generated,
not to define it. Although syntax
plays no definitional role linguistically, from a
computational linguistic point of view we are interested
in the process of grammatical reasoning, and we propose
to reinstate syntactic
structure as the trace of such processing.
Addressing the question `What is the essential structure
of the relevant kinds of proofs?' yields a new answer
to the question `What is syntactic structure?' under
the slogan *proof nets as syntactic structures*.
This provides a particularly vivid realisation of
the notion of categorial syntactic connection of Ajdukiewicz (1935)
as a harmonic mutual connectivity of the valencies of the words
making up a sentence.
We offer a general methodology
for the development of proof nets for partially commutative
categorial logics.
Fri, 25 Nov 2016 12:22:04 GMThttp://hdl.handle.net/2117/972492016-11-25T12:22:04ZMorrill, GlynType logical grammar presents a paradigm of linguistic
description based on what we may refer to as a
Lambek-van Benthem correspondence: (logical) formulas
as (linguistic) categories. Lexical signs are classified by
category formulas, and the language model projected by
a lexicon is determined by the consequence relation
induced on category formulas by their interpretation.
In this logical model of language, (logical) proofs
correspond to (linguistic) derivations, but such syntax
serves just to calculate what is generated,
not to define it. Although syntax
plays no definitional role linguistically, from a
computational linguistic point of view we are interested
in the process of grammatical reasoning, and we propose
to reinstate syntactic
structure as the trace of such processing.
Addressing the question `What is the essential structure
of the relevant kinds of proofs?' yields a new answer
to the question `What is syntactic structure?' under
the slogan *proof nets as syntactic structures*.
This provides a particularly vivid realisation of
the notion of categorial syntactic connection of Ajdukiewicz (1935)
as a harmonic mutual connectivity of the valencies of the words
making up a sentence.
We offer a general methodology
for the development of proof nets for partially commutative
categorial logics.Memoisation of categorial proof nets: parallelism in categorial processing
http://hdl.handle.net/2117/97106
Memoisation of categorial proof nets: parallelism in categorial processing
Morrill, Glyn
We introduce a method of memoisation of categorial proof nets.
Exploiting the planarity of non-commutative proof nets, and
unifiability as a correctness criterion, parallelism is simulated
through construction of a proof net matrix of most general unifiers
for modules, in a manner analogous to the Cocke-Younger-Kasami
algorithm for context free grammars.
Wed, 23 Nov 2016 11:50:47 GMThttp://hdl.handle.net/2117/971062016-11-23T11:50:47ZMorrill, GlynWe introduce a method of memoisation of categorial proof nets.
Exploiting the planarity of non-commutative proof nets, and
unifiability as a correctness criterion, parallelism is simulated
through construction of a proof net matrix of most general unifiers
for modules, in a manner analogous to the Cocke-Younger-Kasami
algorithm for context free grammars.Learnability of Kolmogorov-easy circuit expressions via queries
http://hdl.handle.net/2117/96996
Learnability of Kolmogorov-easy circuit expressions via queries
Balcázar Navarro, José Luis; Buhrman, H; Hermo, M
Circuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We study here the case in which the circuit expressions are of low (time-bounded) Kolmogorov complexity. We show that these are polynomial-time learnable from membership queries in the presence of an NP oracle. We also exactly characterize, in terms of advice classes, the sets that have such easy circuit expressions, obtain consequences regarding their lowness, and precisely identify the subclass whose circuit expressions can be learned from membership queries alone, by means of doubly tally polynomial time degrees. The extension of the results to various Kolmogorov complexity bounds is discussed.
Tue, 22 Nov 2016 12:03:01 GMThttp://hdl.handle.net/2117/969962016-11-22T12:03:01ZBalcázar Navarro, José LuisBuhrman, HHermo, MCircuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We study here the case in which the circuit expressions are of low (time-bounded) Kolmogorov complexity. We show that these are polynomial-time learnable from membership queries in the presence of an NP oracle. We also exactly characterize, in terms of advice classes, the sets that have such easy circuit expressions, obtain consequences regarding their lowness, and precisely identify the subclass whose circuit expressions can be learned from membership queries alone, by means of doubly tally polynomial time degrees. The extension of the results to various Kolmogorov complexity bounds is discussed.Incremental processing and acceptability
http://hdl.handle.net/2117/96982
Incremental processing and acceptability
Morrill, Glyn
We present a left to right incremental algorithm for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly predicts a wide variety of performance phenomena: garden pathing, left to right quantifier scope preference, centre embedding unacceptability, preference for lower attachment, and heavy noun phrase shift.
Tue, 22 Nov 2016 11:07:40 GMThttp://hdl.handle.net/2117/969822016-11-22T11:07:40ZMorrill, GlynWe present a left to right incremental algorithm for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly predicts a wide variety of performance phenomena: garden pathing, left to right quantifier scope preference, centre embedding unacceptability, preference for lower attachment, and heavy noun phrase shift.Higher-order linear logic programming of categorial deduction
http://hdl.handle.net/2117/96971
Higher-order linear logic programming of categorial deduction
Morrill, Glyn
We show how categorial deduction can be implemented in (higher-order) linear logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing problem of Lambek categorial grammar applicable to a variety of its extensions. We illustrate categorial calculi of discontinuity, and calculi with unary bracket operators.
Tue, 22 Nov 2016 09:49:46 GMThttp://hdl.handle.net/2117/969712016-11-22T09:49:46ZMorrill, GlynWe show how categorial deduction can be implemented in (higher-order) linear logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing problem of Lambek categorial grammar applicable to a variety of its extensions. We illustrate categorial calculi of discontinuity, and calculi with unary bracket operators.