Deduce upper bound of variance from Chernoff-type tail bound

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












For a random variable $X$, I have a large deviation inequality of the form
beginequation
P(|X-mathbb EX|geq r)leq ce^-alpha r,.
endequation



Consider a sample mean $S_n=frac1n(X_1+X_2+dots+X_n)$. I would to obtain a central limit theorem of the form $sqrt n(S_n-mu)equiv N(0,sigma^2)$. Is this possible?



It seems that I need to know the variance of $X$ to apply the Lindeberg–Lévy CLT. I don't see how I can get the variance of $X$ from its tail bound.




central-limit-theorem distribution-tails




share|cite|improve this question






















  • Typed a more relevant title.
    – Did
    Aug 28 at 19:09














up vote
1
down vote

favorite












For a random variable $X$, I have a large deviation inequality of the form
beginequation
P(|X-mathbb EX|geq r)leq ce^-alpha r,.
endequation



Consider a sample mean $S_n=frac1n(X_1+X_2+dots+X_n)$. I would to obtain a central limit theorem of the form $sqrt n(S_n-mu)equiv N(0,sigma^2)$. Is this possible?



It seems that I need to know the variance of $X$ to apply the Lindeberg–Lévy CLT. I don't see how I can get the variance of $X$ from its tail bound.




central-limit-theorem distribution-tails




share|cite|improve this question






















  • Typed a more relevant title.
    – Did
    Aug 28 at 19:09












up vote
1
down vote

favorite









up vote
1
down vote

favorite











For a random variable $X$, I have a large deviation inequality of the form
beginequation
P(|X-mathbb EX|geq r)leq ce^-alpha r,.
endequation



Consider a sample mean $S_n=frac1n(X_1+X_2+dots+X_n)$. I would to obtain a central limit theorem of the form $sqrt n(S_n-mu)equiv N(0,sigma^2)$. Is this possible?



It seems that I need to know the variance of $X$ to apply the Lindeberg–Lévy CLT. I don't see how I can get the variance of $X$ from its tail bound.




central-limit-theorem distribution-tails




share|cite|improve this question














For a random variable $X$, I have a large deviation inequality of the form
beginequation
P(|X-mathbb EX|geq r)leq ce^-alpha r,.
endequation



Consider a sample mean $S_n=frac1n(X_1+X_2+dots+X_n)$. I would to obtain a central limit theorem of the form $sqrt n(S_n-mu)equiv N(0,sigma^2)$. Is this possible?



It seems that I need to know the variance of $X$ to apply the Lindeberg–Lévy CLT. I don't see how I can get the variance of $X$ from its tail bound.





central-limit-theorem distribution-tails





share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 28 at 19:08









Did

243k23209444




243k23209444










asked Aug 28 at 18:39









Alice Schwarze

8713




8713











  • Typed a more relevant title.
    – Did
    Aug 28 at 19:09
















  • Typed a more relevant title.
    – Did
    Aug 28 at 19:09















Typed a more relevant title.
– Did
Aug 28 at 19:09




Typed a more relevant title.
– Did
Aug 28 at 19:09










1 Answer
1






active

oldest

votes

















up vote
1
down vote



accepted










You have, for a non-negative random variable $Z$,
$$
mathbbE[Z] = int_0^infty mathbbPZ geq zdz tag1
$$
from which you can bound the variance of $X$:
$$
operatornameVar X = mathbbE[(X-mathbbE[X])^2]
= int_0^infty mathbbP(X-mathbbE[X])^2 geq zdz
= int_0^infty mathbbPlvert X-mathbbE[X]rvertgeq sqrt z dztag2
$$
and using your concentration bound you thus obtain
$$
operatornameVar X
leq int_0^infty c e^-alpha sqrtzdz = fraccalpha^2 tag3
$$
Does that suffice for your purposes?






share|cite|improve this answer






















  • yes, that helps. thank you!
    – Alice Schwarze
    Aug 28 at 19:03










  • @AliceSchwarze You're welcome!
    – Clement C.
    Aug 28 at 19:05










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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2897562%2fdeduce-upper-bound-of-variance-from-chernoff-type-tail-bound%23new-answer', 'question_page');

);

Post as a guest

















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
1
down vote



accepted










You have, for a non-negative random variable $Z$,
$$
mathbbE[Z] = int_0^infty mathbbPZ geq zdz tag1
$$
from which you can bound the variance of $X$:
$$
operatornameVar X = mathbbE[(X-mathbbE[X])^2]
= int_0^infty mathbbP(X-mathbbE[X])^2 geq zdz
= int_0^infty mathbbPlvert X-mathbbE[X]rvertgeq sqrt z dztag2
$$
and using your concentration bound you thus obtain
$$
operatornameVar X
leq int_0^infty c e^-alpha sqrtzdz = fraccalpha^2 tag3
$$
Does that suffice for your purposes?






share|cite|improve this answer






















  • yes, that helps. thank you!
    – Alice Schwarze
    Aug 28 at 19:03










  • @AliceSchwarze You're welcome!
    – Clement C.
    Aug 28 at 19:05














up vote
1
down vote



accepted










You have, for a non-negative random variable $Z$,
$$
mathbbE[Z] = int_0^infty mathbbPZ geq zdz tag1
$$
from which you can bound the variance of $X$:
$$
operatornameVar X = mathbbE[(X-mathbbE[X])^2]
= int_0^infty mathbbP(X-mathbbE[X])^2 geq zdz
= int_0^infty mathbbPlvert X-mathbbE[X]rvertgeq sqrt z dztag2
$$
and using your concentration bound you thus obtain
$$
operatornameVar X
leq int_0^infty c e^-alpha sqrtzdz = fraccalpha^2 tag3
$$
Does that suffice for your purposes?






share|cite|improve this answer






















  • yes, that helps. thank you!
    – Alice Schwarze
    Aug 28 at 19:03










  • @AliceSchwarze You're welcome!
    – Clement C.
    Aug 28 at 19:05












up vote
1
down vote



accepted







up vote
1
down vote



accepted






You have, for a non-negative random variable $Z$,
$$
mathbbE[Z] = int_0^infty mathbbPZ geq zdz tag1
$$
from which you can bound the variance of $X$:
$$
operatornameVar X = mathbbE[(X-mathbbE[X])^2]
= int_0^infty mathbbP(X-mathbbE[X])^2 geq zdz
= int_0^infty mathbbPlvert X-mathbbE[X]rvertgeq sqrt z dztag2
$$
and using your concentration bound you thus obtain
$$
operatornameVar X
leq int_0^infty c e^-alpha sqrtzdz = fraccalpha^2 tag3
$$
Does that suffice for your purposes?






share|cite|improve this answer














You have, for a non-negative random variable $Z$,
$$
mathbbE[Z] = int_0^infty mathbbPZ geq zdz tag1
$$
from which you can bound the variance of $X$:
$$
operatornameVar X = mathbbE[(X-mathbbE[X])^2]
= int_0^infty mathbbP(X-mathbbE[X])^2 geq zdz
= int_0^infty mathbbPlvert X-mathbbE[X]rvertgeq sqrt z dztag2
$$
and using your concentration bound you thus obtain
$$
operatornameVar X
leq int_0^infty c e^-alpha sqrtzdz = fraccalpha^2 tag3
$$
Does that suffice for your purposes?







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Aug 28 at 19:05









Alice Schwarze

8713




8713










answered Aug 28 at 18:50









Clement C.

47.4k33783




47.4k33783











  • yes, that helps. thank you!
    – Alice Schwarze
    Aug 28 at 19:03










  • @AliceSchwarze You're welcome!
    – Clement C.
    Aug 28 at 19:05
















  • yes, that helps. thank you!
    – Alice Schwarze
    Aug 28 at 19:03










  • @AliceSchwarze You're welcome!
    – Clement C.
    Aug 28 at 19:05















yes, that helps. thank you!
– Alice Schwarze
Aug 28 at 19:03




yes, that helps. thank you!
– Alice Schwarze
Aug 28 at 19:03












@AliceSchwarze You're welcome!
– Clement C.
Aug 28 at 19:05




@AliceSchwarze You're welcome!
– Clement C.
Aug 28 at 19:05

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2897562%2fdeduce-upper-bound-of-variance-from-chernoff-type-tail-bound%23new-answer', 'question_page');

);

Post as a guest
































































-

這個網誌中的熱門文章

How to combine Bézier curves to a surface?

圖片
Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite My aim is to smooth the terrain in a video game. Therefore I contrived an algorithm that makes use of Bézier curves of different orders. But this algorithm is defined in a two dimensional space for now. To shift it into the third dimension I need to somehow combine the Bézier curves. Given two curves in each two dimensions, how can I combine them to build a surface? I thought about something like a curve of a curve. Or maybe I could multiply them somehow. How can I combine them to cause the wanted behavior? Is there a common approach? In the image you can see the input, on the left, and the output, on the right, of the algorithm that works in a two dimensional space. For the real application there is a three dimensional input. The algorithm relays only on the adjacent tiles. Given these it will define the control points of the mentioned Bézier curve. Additionally it marks one side of the curve as inside t
閱讀完整內容

Why am i infinitely getting the same tweet with the Twitter Search API?

圖片
up vote 0 down vote favorite My code workes perfectly for other queries, but for one query I am infinitely getting the same tweet. I can't understand what the problem is. API call: query='Allergic asthma OR Nonallergic asthma OR Occupational asthma OR EIB OR Exercise-induced bronchoconstriction OR Nocturnal asthma OR Cough-variant asthma' new_tweets = api.search(q=searchQuery, count=100, since_id=since_id, lang='en',tweet_mode='extended') if not new_tweets: print("No more tweets found") break for tweet in new_tweets: if True: print(jsonpickle.encode(tweet._json, unpicklable=False)) my_file = open('searchTweets.txt','a') my_file.write(jsonpickle.encode(tweet._json, unpicklable=False)+'n') my_file.close() else: continue Output in file: https://pastebin.com/JmRCsTeE These are the JSONs of the same Tweet. Other queries that work: Breast cancer OR Prostate cancer OR Colon cancer OR Lung cancer Type 2 dia
閱讀完整內容

Is there any way to eliminate the singular point to solve this integral by hand or by approximations?

圖片
Clash Royale CLAN TAG #URR8PPP up vote 0 down vote favorite 1 $$int_0^1 (1+(x^-p-1)^1-p)^frac1pdx, pin mathbbR, pge 1$$ I find that $x=0,1$ are singular points(discontinuous points of this integral), is there a way to eliminate those singular points to make sure that this integral can be calculated by hand or by Taylor approximations. In either cases, what are those steps of calculating the integral? calculus real-analysis analysis approximation share | cite | improve this question edited Sep 11 at 5:07 asked Sep 11 at 4:48 Mclalalala 126 8 1 What is $p$? Please give more information to make it complete. – xbh Sep 11 at 5:02 @xbh already fixed it, thanks for reminding. – Mclalalala Sep 11 at 5:10 Seems that $0$ is not singular here… [I might compute wrong] – xbh Sep 11 at 5:30 @xbh can you show me how to get the close formula for the integral above? – Mclalalala Sep 11 at 5:33
閱讀完整內容