Results 1  10
of
223
Temporal Resolution of Uncertainty and Dynamic Choice Theory,”Econometrica
, 1978
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 291 (0 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
A Model of Inductive Bias Learning
 Journal of Artificial Intelligence Research
, 2000
"... A major problem in machine learning is that of inductive bias: how to choose a learner's hypothesis space so that it is large enough to contain a solution to the problem being learnt, yet small enough to ensure reliable generalization from reasonablysized training sets. Typically such bias is suppl ..."
Abstract

Cited by 143 (0 self)
 Add to MetaCart
A major problem in machine learning is that of inductive bias: how to choose a learner's hypothesis space so that it is large enough to contain a solution to the problem being learnt, yet small enough to ensure reliable generalization from reasonablysized training sets. Typically such bias is supplied by hand through the skill and insights of experts. In this paper a model for automatically learning bias is investigated. The central assumption of the model is that the learner is embedded within an environment of related learning tasks. Within such an environment the learner can sample from multiple tasks, and hence it can search for a hypothesis space that contains good solutions to many of the problems in the environment. Under certain restrictions on the set of all hypothesis spaces available to the learner, we show that a hypothesis space that performs well on a sufficiently large number of training tasks will also perform well when learning novel tasks in the same environment. Exp...
Bisimulation for Labelled Markov Processes
 Information and Computation
, 1997
"... In this paper we introduce a new class of labelled transition systems  Labelled Markov Processes  and define bisimulation for them. ..."
Abstract

Cited by 139 (23 self)
 Add to MetaCart
In this paper we introduce a new class of labelled transition systems  Labelled Markov Processes  and define bisimulation for them.
SOME USEFUL FUNCTIONS FOR FUNCTIONAL LIMIT THEOREMS
, 1980
"... Many useful descriptions of stochastic models can be obtained from functional limit theorems (invariance principles or weak convergence theorems for probability meastires on function spaces). These descriptions typically come from standard functional limit theorems via the o^ntinuous mapping theorem ..."
Abstract

Cited by 59 (19 self)
 Add to MetaCart
Many useful descriptions of stochastic models can be obtained from functional limit theorems (invariance principles or weak convergence theorems for probability meastires on function spaces). These descriptions typically come from standard functional limit theorems via the o^ntinuous mapping theorem. This paper facilitates applications of the continuous mapping theorem by determining when several important ftmctions and sequences of functions preserve convergence. The functions considered are composition, addition, composition plus addition, multiplication, supremtun, reflecting barrier, first passage time and time reversal. These functions provide means for proving new functional limit theorems from previous ones. These functions are useful, for example, to establish the stability or continuity of queues and other stochastic models.
Exponential Stability for Nonlinear Filtering
, 1996
"... We study the a.s. exponential stability of the optimal filter w.r.t. its initial conditions. A bound is provided on the exponential rate (equivalently, on the memory length of the filter) for a general setting both in discrete and in continuous time, in terms of Birkhoff's contraction coefficient. C ..."
Abstract

Cited by 53 (2 self)
 Add to MetaCart
We study the a.s. exponential stability of the optimal filter w.r.t. its initial conditions. A bound is provided on the exponential rate (equivalently, on the memory length of the filter) for a general setting both in discrete and in continuous time, in terms of Birkhoff's contraction coefficient. Criteria for exponential stability and explicit bounds on the rate are given in the specific cases of a diffusion process on a compact manifold, and discrete time Markov chains on both continuous and discretecountable state spaces. R'esum'e Nous 'etudions la stabilit'e du filtre optimal par raport `a ses conditions initiales. Le taux de d'ecroissance exponentielle est calcul'e dans un cadre g'en'eral, pour temps discret et temps continu, en terme du coefficient de contraction de Birkhoff. Des crit`eres de stabilit'e exponentielle et des bornes explicites sur le taux sont calcul'ees pour les cas particuliers d'une diffusion sur une vari'ete compacte, ainsi que pour des chaines de Markov sur ...
Analysis and Geometry on Configuration Spaces
, 1997
"... In this paper foundations are presented to a new systematic approach to analysis and geometry for an important class of infinite dimensional manifolds, namely, configuration spaces. More precisely, a differential geometry is introduced on the configuration space \Gamma X over a Riemannian manifold X ..."
Abstract

Cited by 50 (8 self)
 Add to MetaCart
In this paper foundations are presented to a new systematic approach to analysis and geometry for an important class of infinite dimensional manifolds, namely, configuration spaces. More precisely, a differential geometry is introduced on the configuration space \Gamma X over a Riemannian manifold X. This geometry is "nonflat" even if X = IR d . It is obtained as a natural lifting of the Riemannian structure on X. In particular, a corresponding gradient r \Gamma , divergence div \Gamma , and LaplaceBeltrami operator H \Gamma = \Gammadiv \Gamma r \Gamma are constructed. The associated volume elements, i.e., all measures ¯ on \Gamma X w.r.t. which r \Gamma and div \Gamma become dual operators on L 2 (\Gamma X ; ¯), are identified as exactly the mixed Poisson measures with mean measure equal to a multiple of the volume element dx on X. In particular, all these measures obey an integration by parts formula w.r.t. vector fields on \Gamma X . The corresponding Dirichlet...
Metrics for Labelled Markov Systems
, 2001
"... The notion of process equivalence of probabilistic processes is sensitive to the exact probabilities of transitions. Thus, a slight change in the transition probabilities will result in two equivalent processes being deemed no longer equivalent. This instability is due to the quantitative nature of ..."
Abstract

Cited by 48 (10 self)
 Add to MetaCart
The notion of process equivalence of probabilistic processes is sensitive to the exact probabilities of transitions. Thus, a slight change in the transition probabilities will result in two equivalent processes being deemed no longer equivalent. This instability is due to the quantitative nature of probabilistic processes. In a situation where the process behaviour has a quantitative aspect there should be a more robust approach to process equivalence. This paper studies a metric between labelled Markov processes. This metric has the property that processes are at zero distance if and only if they are bisimilar. The metric is inspired by earlier work on logics for characterizing bisimulation and is related, in spirit, to the Hutchinson metric.
Laws of Large Numbers for Dynamical Systems with Randomly Matched Individuals
 Journal of Economic Theory
, 1992
"... Biologists and economists have analyzed populations where each individual interacts with randomly selected individuals. The random matching generates a very complicated stochastic system. Consequently biologists and economists have approximated such a system with a deterministic system. The justitic ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
Biologists and economists have analyzed populations where each individual interacts with randomly selected individuals. The random matching generates a very complicated stochastic system. Consequently biologists and economists have approximated such a system with a deterministic system. The justitication for such an approximation is that the population is assumed to be very large and thus some law of large numbers must hold. This paper gives a characterization of random matching schemes for countably infinite populations. In particular this paper shows that there exists a random matching scheme such that the stochastic system and the deterministic system are the same. Journal of Economic Literature Classification
RealTime Queues in Heavy Traffic with EarliestDeadlineFirst Queue Discipline
, 2000
"... This paper introduces a new aspect of queueing theory, the study of systems that service customers with specic timing requirements (e.g. due dates or deadlines). Unlike standard queueing theory in which common performance measures are customer delay, queue length and server utilization, realtime qu ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
This paper introduces a new aspect of queueing theory, the study of systems that service customers with specic timing requirements (e.g. due dates or deadlines). Unlike standard queueing theory in which common performance measures are customer delay, queue length and server utilization, realtime queueing theory focuses on the ability of a queue discipline to meet customer timing requirements, e.g., the fraction of customers who meet their requirements and the distribution of customer lateness. It also focuses on queue control policies to reduce or minimize lateness, although these control aspects are not explicitly addressed in this paper. To study these measures, one must keep track of the leadtimes (deadline minus current time) of each customer, hence the system state is of unbounded dimension. A heavy trac analysis is presented for the earliest deadline rst (EDF) scheduling policy. This analysis decomposes the behavior of the realtime queue into two parts: the number in the sys...