29,236 research outputs found

    Importance sampling the union of rare events with an application to power systems analysis

    Full text link
    We consider importance sampling to estimate the probability μ\mu of a union of JJ rare events HjH_j defined by a random variable x\boldsymbol{x}. The sampler we study has been used in spatial statistics, genomics and combinatorics going back at least to Karp and Luby (1983). It works by sampling one event at random, then sampling x\boldsymbol{x} conditionally on that event happening and it constructs an unbiased estimate of μ\mu by multiplying an inverse moment of the number of occuring events by the union bound. We prove some variance bounds for this sampler. For a sample size of nn, it has a variance no larger than μ(μˉ−μ)/n\mu(\bar\mu-\mu)/n where μˉ\bar\mu is the union bound. It also has a coefficient of variation no larger than (J+J−1−2)/(4n)\sqrt{(J+J^{-1}-2)/(4n)} regardless of the overlap pattern among the JJ events. Our motivating problem comes from power system reliability, where the phase differences between connected nodes have a joint Gaussian distribution and the JJ rare events arise from unacceptably large phase differences. In the grid reliability problems even some events defined by 57725772 constraints in 326326 dimensions, with probability below 10−2210^{-22}, are estimated with a coefficient of variation of about 0.00240.0024 with only n=10,000n=10{,}000 sample values

    A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding

    Get PDF
    Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a special case of the truncated moment problem in which only the zero-th order moment is known (i.e., the support). By writing the dual of the above semi-infinite linear programming problem, it is shown that, if the nonlinearities in the measurement and process equations are polynomial and if the bounding sets for initial state, process and measurement noises are described by polynomial inequalities, then an approximation of this semi-infinite linear programming problem can efficiently be obtained by using the theory of sum-of-squares polynomial optimization. We then derive a smart greedy procedure to compute a polytopic outer-approximation of the true membership-set, by computing the minimum-volume polytope that outer-bounds the set that includes all the means computed with respect to P

    Modelling Learning as Modelling

    Get PDF
    Economists tend to represent learning as a procedure for estimating the parameters of the "correct" econometric model. We extend this approach by assuming that agents specify as well as estimate models. Learning thus takes the form of a dynamic process of developing models using an internal language of representation where expectations are formed by forecasting with the best current model. This introduces a distinction between the form and content of the internal models which is particularly relevant for boundedly rational agents. We propose a framework for such model development which use a combination of measures: the error with respect to past data, the complexity of the model, the cost of finding the model and a measure of the model's specificity The agent has to make various trade-offs between them. A utility learning agent is given as an example
    • …
    corecore