好的,这是解决问题的快速方法(如果您想使用截断高斯)。设置边界和所需的标准差。我假设平均值为 0。然后快速粗略的代码对分布 sigma 进行二进制搜索,求解非线性根(brentq() 应在生产代码中使用)。所有公式均取自 Truncated Normal 上的 Wiki 页面。它(sigma)应大于所需的 stddev,因为截断会删除导致大 stddev 的随机值。然后我们进行快速抽样测试——均值和标准差接近期望值,但从不完全等于它们。代码(Python-3.7、Anaconda、Win10 x64)
import numpy as np
from scipy.special import erf
from scipy.stats import truncnorm
def alpha(a, sigma):
return a/sigma
def beta(b, sigma):
return b/sigma
def xi(x, sigma):
return x/sigma
def fi(xi):
return 1.0/np.sqrt(2.0*np.pi) * np.exp(-0.5*xi*xi)
def Fi(x):
return 0.5*(1.0 + erf(x/np.sqrt(2.0)))
def Z(al, be):
return Fi(be) - Fi(al)
def Variance(sigma, a, b):
al = alpha(a, sigma)
be = beta(b, sigma)
ZZ = Z(al, be)
return sigma*sigma*(1.0 + (al*fi(al) - be*fi(be))/ZZ - ((fi(al)-fi(be))/ZZ)**2)
def stddev(sigma, a, b):
return np.sqrt(Variance(sigma, a, b))
m = 0.0 # mean
s = 1.0 # this is what we want
a = -3.0 # left boundary
b = 3.0 # right boundary
#print(stddev(s , a, b))
#print(stddev(s + 0.1, a, b))
slo = 1.0
shi = 1.1
stdlo = stddev(slo, a, b)
stdhi = stddev(shi, a, b)
sigma = -1.0
while True: # binary search for sigma
sme = (slo + shi) / 2.0
stdme = stddev(sme, a, b)
if stdme - s == 0.0:
sigma = stdme
break
elif stdme - s < 0.0:
slo = sme
else:
shi = sme
if shi - slo < 0.0000001:
sigma = (shi + slo) / 2.0
break
print(sigma) # we got it, shall be slightly bigger than s, desired stddev
np.random.seed(73123457)
rvs = truncnorm.rvs(a, b, loc=m, scale=sigma, size=1000000) # quick sampling test
print(np.mean(rvs))
print(np.std(rvs))
对我来说是打印出来的
sigma = 1.0153870105743408
mean = -0.000400729471992301
stddev = 1.0024267696681475
使用不同的种子或序列长度,您可能会得到类似
的输出
1.0153870105743408
-0.00015923177289006116
0.9999974266369461