Results 281 to 290 of about 720,962 (318)
Some of the next articles are maybe not open access.
Proceedings of the fifth annual workshop on Computational learning theory, 1992
Most theories of learning consider inferring a function f from either (1) observations about f or, (2) questions about f. We consider a scenario whereby the learner observes fand asks queries to some set A. EX[A] is the set of concept classes EX-learnable by an inductive inference machine with oracle A. A and F are EX-equivalent if EX[A] = EX[B].
Kummer, Martin +7 more
openaire +1 more source
Most theories of learning consider inferring a function f from either (1) observations about f or, (2) questions about f. We consider a scenario whereby the learner observes fand asks queries to some set A. EX[A] is the set of concept classes EX-learnable by an inductive inference machine with oracle A. A and F are EX-equivalent if EX[A] = EX[B].
Kummer, Martin +7 more
openaire +1 more source
Generalizing Monotonicity Inferences to Opposition Inferences
2012This paper generalizes the notion of monotonicities to opposition properties (OPs). Some propositions regarding the OPs of determiners will be proposed and proved. We will also define the notion of OP-chain and deduce a condition that enables us to determine the OPs of an iterated quantifier in its predicates based on the OPs of its constituent ...
openaire +1 more source
Journal of Philosophical Logic, 1987
The paper discusses the proof of a statement about a recursively defined rapidly increasing function. The hypotheses involve universal quantifiers and the statement is easily proved in second order logic. An estimate of the size of the set needed to replace the quantifiers by Gentzen cuts shows that the first order proof would need a number of symbols ...
openaire +2 more sources
The paper discusses the proof of a statement about a recursively defined rapidly increasing function. The hypotheses involve universal quantifiers and the statement is easily proved in second order logic. An estimate of the size of the set needed to replace the quantifiers by Gentzen cuts shows that the first order proof would need a number of symbols ...
openaire +2 more sources
Generative replay underlies compositional inference in the hippocampal-prefrontal circuit
Cell, 2023Philipp Schwartenbeck +2 more
exaly
Operations Research, 1965
We consider a model for dynamic uncertain processes that affords considerably more generality of formulation than do Markovian models or their derivatives. The underlying statistical parameters of a stochastic process that produces observable outputs are themselves allowed to change at times generated by another stochastic process.
openaire +2 more sources
We consider a model for dynamic uncertain processes that affords considerably more generality of formulation than do Markovian models or their derivatives. The underlying statistical parameters of a stochastic process that produces observable outputs are themselves allowed to change at times generated by another stochastic process.
openaire +2 more sources
The frontier of simulation-based inference
Proceedings of the National Academy of Sciences of the United States of America, 2020K Cranmer +2 more
exaly
Spectrum Inference in Cognitive Radio Networks: Algorithms and Applications
IEEE Communications Surveys and Tutorials, 2018Guoru Ding, Yutao Jiao, Jinlong Wang
exaly