Autonomously Learning an Action Hierarchy Using a Learned
... Reinforcement learning (RL) is a popular method for enabling agents to learn in unknown environments [Sutton and Barto, 1998]. Much work in RL focuses on learning to maximize a reward given a set of states S and a set of actions A. In this paper we focus on continuous environments and we present a m ...
... Reinforcement learning (RL) is a popular method for enabling agents to learn in unknown environments [Sutton and Barto, 1998]. Much work in RL focuses on learning to maximize a reward given a set of states S and a set of actions A. In this paper we focus on continuous environments and we present a m ...
From: AAAI Technical Report S-9 -0 . Compilation copyright © 199
... FromFigure I wecan see that there are two distinct types of specification present: The dynamic specifications and the static specifications. Dynamic specifications refer to aspects of the systemthat are under constant changeor for whichthe interaction of the componentsare undetermineddue to their co ...
... FromFigure I wecan see that there are two distinct types of specification present: The dynamic specifications and the static specifications. Dynamic specifications refer to aspects of the systemthat are under constant changeor for whichthe interaction of the componentsare undetermineddue to their co ...
Disregarding Duration Uncertainty in Partial Order - LIA
... been added to prevent the occurrence of resource conflicts, whatever the activity durations are. A POS can be obtained through a variety of methods (the reader may refer for details to [7, 4, 5, 10–13]). A POS can be designed to optimize some probabilistic performance metric, such as the expected ma ...
... been added to prevent the occurrence of resource conflicts, whatever the activity durations are. A POS can be obtained through a variety of methods (the reader may refer for details to [7, 4, 5, 10–13]). A POS can be designed to optimize some probabilistic performance metric, such as the expected ma ...
An Overview of Some Recent Developments in Bayesian Problem
... The Bayesian network formalism is the single development most responsible for progress in building practical systems capable of handling uncertain information. The first book on Bayesian networks [Pearl 1988] was published just over ten years ago and since then several other text books have appeared ...
... The Bayesian network formalism is the single development most responsible for progress in building practical systems capable of handling uncertain information. The first book on Bayesian networks [Pearl 1988] was published just over ten years ago and since then several other text books have appeared ...
Towards common-sense reasoning via conditional
... the formalism is a universal probabilistic Turing machine called QUERY that performs conditional simulation, and thereby captures the operation of conditioning probability distributions that are themselves represented by probabilistic Turing machines. We will use QUERY to model the inductive leaps t ...
... the formalism is a universal probabilistic Turing machine called QUERY that performs conditional simulation, and thereby captures the operation of conditioning probability distributions that are themselves represented by probabilistic Turing machines. We will use QUERY to model the inductive leaps t ...
DSTO-TR-2324 PR
... domain. An assignment function can be thought to assign context. Formula/Concept A type of description which is built in a well-defined way using: elements from a vocabulary; various connectives, punctuation marks and other symbols; sometimes quantifiers; and sometimes a possibly infinite set of var ...
... domain. An assignment function can be thought to assign context. Formula/Concept A type of description which is built in a well-defined way using: elements from a vocabulary; various connectives, punctuation marks and other symbols; sometimes quantifiers; and sometimes a possibly infinite set of var ...
Na¨ıve Inference viewed as Computation
... inference is computationally intractable (Cooper, 1990). For some, this intractability does not vitiate the explanatory value of Bayesian inference viewed as an optimal solution for a cognitive or perceptual problem (e.g., Anderson, 1990). The point is made that such models can be viewed as theories ...
... inference is computationally intractable (Cooper, 1990). For some, this intractability does not vitiate the explanatory value of Bayesian inference viewed as an optimal solution for a cognitive or perceptual problem (e.g., Anderson, 1990). The point is made that such models can be viewed as theories ...
PDF
... in closed form, except for the following cases: Gaussian or normal distribution, S2 (, 0, ) = N(, 2 ); Cauchy distribution, S1 (, 0, ); Lévy distribution, S1/2 (, 1, ); and a constant which has the degenerate distribution S (0, 0, ). For a complete treatment of stable distributions see S ...
... in closed form, except for the following cases: Gaussian or normal distribution, S2 (, 0, ) = N(, 2 ); Cauchy distribution, S1 (, 0, ); Lévy distribution, S1/2 (, 1, ); and a constant which has the degenerate distribution S (0, 0, ). For a complete treatment of stable distributions see S ...
Logical Foundations for Belief Representation WILLIAM J.
... But the performance limitation must be taken seriously. The feeling that a sentence such as (1) must be a joke raises the question of how deep the nesting actually can be in ordinary cases (cf. Dennett, 1983, p. 345). There are some clear cases where up to three occurrences of ‘believes that’ are na ...
... But the performance limitation must be taken seriously. The feeling that a sentence such as (1) must be a joke raises the question of how deep the nesting actually can be in ordinary cases (cf. Dennett, 1983, p. 345). There are some clear cases where up to three occurrences of ‘believes that’ are na ...
A suitable semantics for implicit and explicit belief
... set of explicit beliefs. The resulting semantics is both simple and flexible: implicit belief it typically modelled on normal frames for epistemic logic as a K45 or a KD45 modality, whereas different conditions imposed on the set of propositions of which the agents are aware allow us to capture var ...
... set of explicit beliefs. The resulting semantics is both simple and flexible: implicit belief it typically modelled on normal frames for epistemic logic as a K45 or a KD45 modality, whereas different conditions imposed on the set of propositions of which the agents are aware allow us to capture var ...
Applications of Automated Reasoning Nr. 9/2007 Arbeitsberichte
... Empirical Aspects Two important achievements in automated reasoning research are the commonly used benchmark suite TPTP ([SS98]) and the CASC-competition ([PSS02]). The TPTP (Thousands of Problems for Theorem Provers) problem library is a library of test problems for automated theorem proving (ATP) ...
... Empirical Aspects Two important achievements in automated reasoning research are the commonly used benchmark suite TPTP ([SS98]) and the CASC-competition ([PSS02]). The TPTP (Thousands of Problems for Theorem Provers) problem library is a library of test problems for automated theorem proving (ATP) ...
Symbol Acquisition for Probabilistic High
... reward operator involves three integrals, during learning we use the following equation: J(o, s) = Es0 ,τ [R(s0 , τ |s, o)] , which simply estimates the expected reward for executing an option from each state. The reward obtained after option execution from a state is a sample of the right hand side ...
... reward operator involves three integrals, during learning we use the following equation: J(o, s) = Es0 ,τ [R(s0 , τ |s, o)] , which simply estimates the expected reward for executing an option from each state. The reward obtained after option execution from a state is a sample of the right hand side ...
The Information Bottleneck Revisited or How to Choose a Good Distortion Measure
... method has found natural interpretations and a number of applications as described in [2], [3], [4], [5], [6], [7], [8]. The results in these papers do not rule out the possibility that similar results could have been obtained by other means (other distortion measure). Our approach will be via rate ...
... method has found natural interpretations and a number of applications as described in [2], [3], [4], [5], [6], [7], [8]. The results in these papers do not rule out the possibility that similar results could have been obtained by other means (other distortion measure). Our approach will be via rate ...
KNOWLEDGE REPRESENTATION AND REASONING 1
... system. This is certainly true of Expert Systems[see (135), for example], currently the most visible and plentiful type of AI system. This is not to say that all AI systems exhibiting knowledgeare knowledge based in this sense. A typical game-playingprogram,for instance, might act as if it believed ...
... system. This is certainly true of Expert Systems[see (135), for example], currently the most visible and plentiful type of AI system. This is not to say that all AI systems exhibiting knowledgeare knowledge based in this sense. A typical game-playingprogram,for instance, might act as if it believed ...
Early Knowledge Representation Formalisms [1] Uli Sattler General
... • if A1, . . . , Ak are all sub-classes of a class B , does this imply that – Ai and Aj are disjoint for each 1 ≤ i < j ≤ n, i.e., cannot have a common instance? – that each instance of B is an instance of some Ai, i.e., the Aj cover B ? – none or both of the above? • if A is an individual and B is ...
... • if A1, . . . , Ak are all sub-classes of a class B , does this imply that – Ai and Aj are disjoint for each 1 ≤ i < j ≤ n, i.e., cannot have a common instance? – that each instance of B is an instance of some Ai, i.e., the Aj cover B ? – none or both of the above? • if A is an individual and B is ...
Sborník vědeckých prací Vysoké školy báňské
... One exceptional type of knowledge which is gathered mainly by experience is heuristic knowledge. It is the collection of all the skills, tricks or strategies that we might have accomplished during our professional work. For instance, an experienced physician can frequently decide at the very first l ...
... One exceptional type of knowledge which is gathered mainly by experience is heuristic knowledge. It is the collection of all the skills, tricks or strategies that we might have accomplished during our professional work. For instance, an experienced physician can frequently decide at the very first l ...
Visualizing Inference Henry Lieberman and Joe Henke MIT Media Lab
... Graphical visualization has demonstrated enormous power in helping people to understand complexity in many branches of science. But, curiously, AI has been slow to pick up on the power of visualization. Alar is a visualization system intended to help people understand and control symbolic inference. ...
... Graphical visualization has demonstrated enormous power in helping people to understand complexity in many branches of science. But, curiously, AI has been slow to pick up on the power of visualization. Alar is a visualization system intended to help people understand and control symbolic inference. ...
Bayesian Networks for Logical Reasoning
... [Neapolitan 1990]. I leave it open as to whether the specified probabilities are objective or degrees of rational belief. If they are objective, I assume that they directly constrain rational belief: if the objective probability of ci given state di of its parents is x then X should believe ci to de ...
... [Neapolitan 1990]. I leave it open as to whether the specified probabilities are objective or degrees of rational belief. If they are objective, I assume that they directly constrain rational belief: if the objective probability of ci given state di of its parents is x then X should believe ci to de ...
Lebeltel2000
... where the first equality results from the marginalization rule (equation [E3.10]), the second results from the product rule (equation [E3.6]) and the third corresponds to a second application of the marginalization rule. The denominator appears to be a normalization term. Consequently, by convention ...
... where the first equality results from the marginalization rule (equation [E3.10]), the second results from the product rule (equation [E3.6]) and the third corresponds to a second application of the marginalization rule. The denominator appears to be a normalization term. Consequently, by convention ...
On the Incompatibility of Negative Introspection and Knowledge as
... is a form of introspective access. If the queried fact is stored the positive reply exhibits positive introspection, a negative reply exhibits negative introspection. Some try to defend the introspective principles by distinguishing between occurring and dispositional belief, or maybe implicit beli ...
... is a form of introspective access. If the queried fact is stored the positive reply exhibits positive introspection, a negative reply exhibits negative introspection. Some try to defend the introspective principles by distinguishing between occurring and dispositional belief, or maybe implicit beli ...
[pdf]
... approximated with a compact Fourier expansion? We first discuss which functions can be represented exactly in the Fourier domain with coefficients up to degree d. To answer this question, we show a tight connection between Fourier representations with bounded degree and decision trees with bounded d ...
... approximated with a compact Fourier expansion? We first discuss which functions can be represented exactly in the Fourier domain with coefficients up to degree d. To answer this question, we show a tight connection between Fourier representations with bounded degree and decision trees with bounded d ...
Approximating propositional knowledge with affine formulas
... in this case, the formula can give the answer to any query. To summarize, approximations can help saving a lot of time when answering queries (for instance in an on-line framework), especially if they can be reasoned with efficiently and if their size is reasonable. Not many classes of formulas sati ...
... in this case, the formula can give the answer to any query. To summarize, approximations can help saving a lot of time when answering queries (for instance in an on-line framework), especially if they can be reasoned with efficiently and if their size is reasonable. Not many classes of formulas sati ...
Planning and acting in partially observable stochastic domains
... L.P. Kaelbling et al. / Artificial Intelligence 101 (1998) 99–134 ...
... L.P. Kaelbling et al. / Artificial Intelligence 101 (1998) 99–134 ...
A Normal Form for Classical Planning Tasks
... / vars(eff (o)). A plan for Π is a sequence of operators that are iteratively applicable starting in sI and result in a state consistent with s? . Definition 1. A planning task Π is in transition normal form (TNF) if vars(pre(o)) = vars(eff (o)) for all operators o of Π and the goal of Π is a fully ...
... / vars(eff (o)). A plan for Π is a sequence of operators that are iteratively applicable starting in sI and result in a state consistent with s? . Definition 1. A planning task Π is in transition normal form (TNF) if vars(pre(o)) = vars(eff (o)) for all operators o of Π and the goal of Π is a fully ...