Non-autocorrelation sampling method for large sample space complex probability distribution

A probability distribution, large sample technology, applied in the field of non-autocorrelation sampling of complex probability distribution in large sample space, can solve problems such as efficiency loss, achieve the effect of small I/O amount, eliminate sample autocorrelation, and fast calculation speed

Active Publication Date: 2019-07-05
NAT UNIV OF DEFENSE TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0065] The technical problem to be solved in the present invention is aimed at the autocorrelation problem of the MCMC method and the efficiency loss problem of skip sampling, and provides a kind of non-autocorrelation sampling method for the complex probability distribution of the large sample space, so as to achieve the same sampling rate as the MCMC method. Under the premise of efficiency, generate a sample sequence without autocorrelation

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Non-autocorrelation sampling method for large sample space complex probability distribution
  • Non-autocorrelation sampling method for large sample space complex probability distribution
  • Non-autocorrelation sampling method for large sample space complex probability distribution

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0129] The overall process of the present invention is as image 3 shown, including the following steps:

[0130] Step 1: Select the initial state and initialize the buffer

[0131] 1.1 Define the state space of the Markov chain as S={s 1 ,s 2 ,...,s i ,...,s N}, where for a positive integer i (1≤i≤N), there is s i and X={x in the sample space 1 ,x 2 ,...,x i ,...,x N} element x i correspond;

[0132] 1.2 Construct the sample probability function f based on the Markov chain state space S s (s), such that for an integer i, f s (s i ) = f(x i ), where f(x i ) means sampling to get sample x i The probability;

[0133] 1.3 Arbitrarily select the easy-to-sample random distribution g(s) on the state space S as the auxiliary probability distribution, where g(s i ) means that the state s obtained by sampling i as a sample probability.

[0134] 1.4 Set the sample buffer capacity L to 4000, initialize the sample buffer to be empty, and the capacity is to accommodate ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a non-autocorrelation sampling method for large sample space complex probability distribution, which aims to solve the autocorrelation problem of an MCMC method and the efficiency loss problem of skip sampling. According to the technical scheme, when samples are generated, the correlation among the samples is eliminated by setting a sample buffer area; or as a post-processing method, the generated samples are read in sequence, and the sample sequence is updated through the sample buffer to eliminate the autocorrelation of the sample sequence. When one sample is generated each time or one sample is read from the file, the obtained sample is stored into the sample buffer area, and the sample is randomly selected from the buffer area to output when the buffer area is full. By means of the random output mode, a layer of extra randomness is added between samples, and finally the purpose of eliminating the sample sequence autocorrelation is achieved. By adopting the method, the calculation speed is fast, the MCMC efficiency is maintained, the expenditure of the additionally-increased buffer region operation can be ignored relatively, and meanwhile the sample autocorrelation is eliminated.

Description

technical field [0001] The invention relates to a sampling method for complex probability distribution samples in a large sample space, in particular to a Markov chain-based non-autocorrelation sampling method. Background technique [0002] Computer processing of random events is a necessary means of engineering application analysis. In recent decades, with the rapid development of computer performance, computers have been widely used in aerospace, automobile and ship design and manufacture, bridge building design and manufacture, environmental engineering, weather forecast, polymer materials, etc., and in these engineering applications, Both need to calculate and analyze random events through computers to achieve purposes such as bridge reliability testing and weather forecasting. In random event analysis, a necessary step is to sample complex probability distributions to obtain independent, random samples. [0003] An efficient sampling algorithm is a necessary means to ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/18
CPCG06F17/18
Inventor 吴俊杰刘雍熊敏徐平强晓刚黄安琪付祥邓明堂
Owner NAT UNIV OF DEFENSE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products