Timeline for Maximizing mutual information between two linearly projected random variables

14 events

when toggle format	what		by	license	comment
Feb 3, 2020 at 17:20	history	edited	Martin Sleziak	CC BY-SA 4.0	minor typos
May 2, 2018 at 9:02	comment	added	Jeff		actually, the original version is simple, as you solved it. The actual question was the one that you can see now. I am updating the question to include the answer to the reverse problem.
May 2, 2018 at 9:01	comment	added	R W		It is not a good practice when you completely change your question without saying anything about answers to their original versions
May 2, 2018 at 8:56	history	edited	Jeff	CC BY-SA 4.0	added mutual information instead of entropy
May 2, 2018 at 8:44	answer	added	R W		timeline score: 2
May 2, 2018 at 7:19	comment	added	Jeff		@MichaelHardy, you are right and that was a typo. I have corrected the question.
May 2, 2018 at 7:18	comment	added	Jeff		@Memming the map might not be invertible in general.
May 2, 2018 at 7:16	history	edited	Jeff	CC BY-SA 4.0	added 59 characters in body
May 1, 2018 at 18:32	history	edited	Michael Hardy	CC BY-SA 3.0	added 8 characters in body
May 1, 2018 at 13:07	comment	added	Memming		Trivial if you can make the map invertible? Can I choose a $c_1$ and $c_2$ such that you can decode back $X_1$ and $X_2$ from $Z$?
May 1, 2018 at 10:58	comment	added	Jeff		yes, I have corrected the question.
May 1, 2018 at 10:58	history	edited	Jeff	CC BY-SA 3.0	deleted 2 characters in body
May 1, 2018 at 10:10	comment	added	Jean Duchon		You mean $Z$ instead of $RX$, don't you?
Apr 30, 2018 at 20:21	history	asked	Jeff	CC BY-SA 3.0