Rezultati pretraživanja
  1. prije 16 sati

    The highest sources of are those where every outcome is equally likely. Using this as an upper bound, a source with n discrete outcomes cannot have an entropy that exceeds log2(n) bits.

  2. 1. velj
  3. 1. velj

    I wrote a brief note the other day on how to use information theory to distinguish between exact, imprecise, and simply incorrect hypotheses:

    Prikaži ovu nit
  4. 31. sij

    Please send any opportunities links this way! 😀Especially

  5. 28. sij
  6. 28. sij
  7. 28. sij

    How did studying lead to insights into , , , and ? *Watch at 16:30 CET today* for on the spin glass cornucopia!

  8. 27. sij

    Information is quantified in terms of surprise. If everything in a message is expected, then it contains no information, no matter how long it is.

  9. 22. sij

    Shannon doesn't adequately handle (i.e., tell us whether mutual information is mutually understood). Here's a 1-minute animation on a new paper by SFI Postdoc Artemy Kolchinsky & Bernat Corominas-Mutra:

    Prikaži ovu nit
  10. Many innovators of our modern world are well-known: Jobs, Gates, Zuckerberg, etc. But do you know Claude Shannon, Father of ? Come watch "The Bit Player," to learn more about this digital revolutionary.

  11. Read the latest study on : A detailed characterization of complex networks using

  12. 21. stu 2019.

    Time for another science . This time I chose Claude Shannon (1916-2001) the father of modern among other incredible things.

  13. To save countless hours of my life , if a message's information is still conveyed even with ludicrous misspellings, I still hit send. Given my phone typing I think this saves me 1 year of life

  14. New preprint from my lab. Using an framework and awake as animal model we find that the ventral (IC) is insanely good in tracking acoustic timing of natural sounds. The ventral IC could be an important target for midbrain implants.

  15. 25. lis 2019.
    Prikaži ovu nit
  16. "If a full-blown course feels unrealistic, Complexity Explorer also offers mini-tutorials on topics such as , and ." Thanks & for the feature!

  17. Congratulation to our lab member Ali Ossia for successfully defending his under the supervision of . Ali has great works on , Preserving, and with the international cooperation of , and .

  18. 29. kol 2019.

    Just finished my latest post "Universal Portfolios: how to (not) get rich" on using Online Learning, Online Mirror Descent et al to compute Universal Portfolios and what to (not) expect.

  19. 12. kol 2019.

    I'm going to release my first novel on September 1. It's a sci fi story that deals with , , and . More info to come.

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.