How can we approximate a function by sampling a distribution proportial to it and making a histogram of samples? The 2019 Stack Overflow Developer Survey Results Are InDesigning an efficient sampling strategyProblems sampling from a $pdf$ over $SOleft(3right)$Central Limit Theorem Definition“Empirical” entropy.Statistically quantifying a variable with a limited number of samplesHow Much of a Distribution has One Seen After N Samples with Replacement?Finding the sampling distribution of the packets of assorted resistorsSampling Distribution Disturbing AnswerHamiltonian monte carlo sampling : Energy Histogram vs Sample HistogramAre events correlated in a Poisson distribution?
Why not take a picture of a closer black hole?
How to save as into a customized destination on macOS?
Have you ever entered Singapore using a different passport or name?
Right tool to dig six foot holes?
Why isn't the circumferential light around the M87 black hole's event horizon symmetric?
Did 3000BC Egyptians use meteoric iron weapons?
Time travel alters history but people keep saying nothing's changed
What is the meaning of Triage in Cybersec world?
Are there any other methods to apply to solving simultaneous equations?
Can we generate random numbers using irrational numbers like π and e?
Worn-tile Scrabble
The difference between dialogue marks
Write faster on AT24C32
Is there any way to tell whether the shot is going to hit you or not?
Why hard-Brexiteers don't insist on a hard border to prevent illegal immigration after Brexit?
What is the meaning of the verb "bear" in this context?
Button changing it's text & action. Good or terrible?
What is the accessibility of a package's `Private` context variables?
Return to UK after being refused entry years previously
One word riddle: Vowel in the middle
Why did Acorn's A3000 have red function keys?
Shouldn't "much" here be used instead of "more"?
Did Section 31 appear in Star Trek: The Next Generation?
Are spiders unable to hurt humans, especially very small spiders?
How can we approximate a function by sampling a distribution proportial to it and making a histogram of samples?
The 2019 Stack Overflow Developer Survey Results Are InDesigning an efficient sampling strategyProblems sampling from a $pdf$ over $SOleft(3right)$Central Limit Theorem Definition“Empirical” entropy.Statistically quantifying a variable with a limited number of samplesHow Much of a Distribution has One Seen After N Samples with Replacement?Finding the sampling distribution of the packets of assorted resistorsSampling Distribution Disturbing AnswerHamiltonian monte carlo sampling : Energy Histogram vs Sample HistogramAre events correlated in a Poisson distribution?
$begingroup$
I've read the following (here on page 2):
Suppose that you want to approximate a function $f$. One way to do this is to produce a sampling distribution proportional to $f$ and then make a histogram of samples taken from the distribution. The resulting histogram will be proportional to $f$ (obviously), so it only needs to be scaled to approximate $f$.
The procedure can be summarized as follows:
- Create a sampling distribution proportial to $f$
- Make a histogram of samples taken from the sampling distribution
- Scale the histogram to approximate $f$
The sacle factor $s$ needed to make the histogram approximate $f$ is the ratio of the average value $v$ of $f$ over the sampling domain to the average number $h$ of samples per bin in the histogram, i.e. $s=v/h$.
I'm not sure how seriously this has to be taken, but could anybody explain to me (in a more formal way) what the author is meaning to say?
Let's consider a example: Assume $f$ is the density of the standard normal distribution $mathcal N_0,:1$. We could divide an interval $[a,b]$ into $C$ "bins" of size $delta$. Now we could draw $n$ samples from $mathcal N_0,:1$ and record for each bin $i$ the number $B(i)$ of samples falling into that bin (if $xin[a,b)$ is a sample, it lies in the $lfloorfracx-adeltarfloor$-th bin).
Clearly, $$[a,b)ni xmapsto Bleft(lfloorfracx-adeltarfloorright)tag1$$ is an approximation of the shape of $f$.
Now, let $v$ be the average value of $f$ on $[a,b]$, $h$ be the average number of samples per bin and $s:=v/h$. If I got it right, the desired approximation would be $$tilde f(x):=sBleft(lfloorfracx-adeltarfloorright);;;textfor xin[a,b).$$ Here's a plot of the result for $a=-5$, $b=5$, $C=2000$, $delta=(b-a)/C$ and $n=1000000$:
Obviously, the scale is not correct. Did I made any mistake or is there something wrong with the description in the paper?
probability-theory statistics probability-distributions sampling monte-carlo
$endgroup$
add a comment |
$begingroup$
I've read the following (here on page 2):
Suppose that you want to approximate a function $f$. One way to do this is to produce a sampling distribution proportional to $f$ and then make a histogram of samples taken from the distribution. The resulting histogram will be proportional to $f$ (obviously), so it only needs to be scaled to approximate $f$.
The procedure can be summarized as follows:
- Create a sampling distribution proportial to $f$
- Make a histogram of samples taken from the sampling distribution
- Scale the histogram to approximate $f$
The sacle factor $s$ needed to make the histogram approximate $f$ is the ratio of the average value $v$ of $f$ over the sampling domain to the average number $h$ of samples per bin in the histogram, i.e. $s=v/h$.
I'm not sure how seriously this has to be taken, but could anybody explain to me (in a more formal way) what the author is meaning to say?
Let's consider a example: Assume $f$ is the density of the standard normal distribution $mathcal N_0,:1$. We could divide an interval $[a,b]$ into $C$ "bins" of size $delta$. Now we could draw $n$ samples from $mathcal N_0,:1$ and record for each bin $i$ the number $B(i)$ of samples falling into that bin (if $xin[a,b)$ is a sample, it lies in the $lfloorfracx-adeltarfloor$-th bin).
Clearly, $$[a,b)ni xmapsto Bleft(lfloorfracx-adeltarfloorright)tag1$$ is an approximation of the shape of $f$.
Now, let $v$ be the average value of $f$ on $[a,b]$, $h$ be the average number of samples per bin and $s:=v/h$. If I got it right, the desired approximation would be $$tilde f(x):=sBleft(lfloorfracx-adeltarfloorright);;;textfor xin[a,b).$$ Here's a plot of the result for $a=-5$, $b=5$, $C=2000$, $delta=(b-a)/C$ and $n=1000000$:
Obviously, the scale is not correct. Did I made any mistake or is there something wrong with the description in the paper?
probability-theory statistics probability-distributions sampling monte-carlo
$endgroup$
add a comment |
$begingroup$
I've read the following (here on page 2):
Suppose that you want to approximate a function $f$. One way to do this is to produce a sampling distribution proportional to $f$ and then make a histogram of samples taken from the distribution. The resulting histogram will be proportional to $f$ (obviously), so it only needs to be scaled to approximate $f$.
The procedure can be summarized as follows:
- Create a sampling distribution proportial to $f$
- Make a histogram of samples taken from the sampling distribution
- Scale the histogram to approximate $f$
The sacle factor $s$ needed to make the histogram approximate $f$ is the ratio of the average value $v$ of $f$ over the sampling domain to the average number $h$ of samples per bin in the histogram, i.e. $s=v/h$.
I'm not sure how seriously this has to be taken, but could anybody explain to me (in a more formal way) what the author is meaning to say?
Let's consider a example: Assume $f$ is the density of the standard normal distribution $mathcal N_0,:1$. We could divide an interval $[a,b]$ into $C$ "bins" of size $delta$. Now we could draw $n$ samples from $mathcal N_0,:1$ and record for each bin $i$ the number $B(i)$ of samples falling into that bin (if $xin[a,b)$ is a sample, it lies in the $lfloorfracx-adeltarfloor$-th bin).
Clearly, $$[a,b)ni xmapsto Bleft(lfloorfracx-adeltarfloorright)tag1$$ is an approximation of the shape of $f$.
Now, let $v$ be the average value of $f$ on $[a,b]$, $h$ be the average number of samples per bin and $s:=v/h$. If I got it right, the desired approximation would be $$tilde f(x):=sBleft(lfloorfracx-adeltarfloorright);;;textfor xin[a,b).$$ Here's a plot of the result for $a=-5$, $b=5$, $C=2000$, $delta=(b-a)/C$ and $n=1000000$:
Obviously, the scale is not correct. Did I made any mistake or is there something wrong with the description in the paper?
probability-theory statistics probability-distributions sampling monte-carlo
$endgroup$
I've read the following (here on page 2):
Suppose that you want to approximate a function $f$. One way to do this is to produce a sampling distribution proportional to $f$ and then make a histogram of samples taken from the distribution. The resulting histogram will be proportional to $f$ (obviously), so it only needs to be scaled to approximate $f$.
The procedure can be summarized as follows:
- Create a sampling distribution proportial to $f$
- Make a histogram of samples taken from the sampling distribution
- Scale the histogram to approximate $f$
The sacle factor $s$ needed to make the histogram approximate $f$ is the ratio of the average value $v$ of $f$ over the sampling domain to the average number $h$ of samples per bin in the histogram, i.e. $s=v/h$.
I'm not sure how seriously this has to be taken, but could anybody explain to me (in a more formal way) what the author is meaning to say?
Let's consider a example: Assume $f$ is the density of the standard normal distribution $mathcal N_0,:1$. We could divide an interval $[a,b]$ into $C$ "bins" of size $delta$. Now we could draw $n$ samples from $mathcal N_0,:1$ and record for each bin $i$ the number $B(i)$ of samples falling into that bin (if $xin[a,b)$ is a sample, it lies in the $lfloorfracx-adeltarfloor$-th bin).
Clearly, $$[a,b)ni xmapsto Bleft(lfloorfracx-adeltarfloorright)tag1$$ is an approximation of the shape of $f$.
Now, let $v$ be the average value of $f$ on $[a,b]$, $h$ be the average number of samples per bin and $s:=v/h$. If I got it right, the desired approximation would be $$tilde f(x):=sBleft(lfloorfracx-adeltarfloorright);;;textfor xin[a,b).$$ Here's a plot of the result for $a=-5$, $b=5$, $C=2000$, $delta=(b-a)/C$ and $n=1000000$:
Obviously, the scale is not correct. Did I made any mistake or is there something wrong with the description in the paper?
probability-theory statistics probability-distributions sampling monte-carlo
probability-theory statistics probability-distributions sampling monte-carlo
edited yesterday
0xbadf00d
asked Apr 5 at 5:46
0xbadf00d0xbadf00d
1,71041534
1,71041534
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3175554%2fhow-can-we-approximate-a-function-by-sampling-a-distribution-proportial-to-it-an%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3175554%2fhow-can-we-approximate-a-function-by-sampling-a-distribution-proportial-to-it-an%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown