Information Theory

Feeds to Scour
SubscribedAll
Scoured 111 posts in 7.1 ms

SynIB: Informational Bottleneck for Maximizing Synergy in Multimodal Learning

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·
Less-relevant results

Maynooth’s new Pathway fellow on quantum research and applications

 🔐Cryptography
siliconrepublic.com·

The Man Who Buried His Teacher

 🔄Category Theory

Optimal Feedback Communication with Information Maximization and Distortion Minimization

 📈Complexity Theory  Content type: Academic
arxiv.org·

Annihilating both time and space: What the telegraph gave email

 🤝Protocol Design  Content type: Blog
buttondown.com·

Support sufficiency as action-sufficient compression: a single-cycle rate-regret formulation

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

Lovable deepens Google Cloud partnership as AI app builder surpasses 25 Million projects — TFN

 Algorithmic Game Theory
techfundingnews.com·

Letting Homogeneity Entropy Select S-Pairs in Buchberger's Algorithm

 🎯Randomized Algorithms  Content type: Academic
arxiv.org·

Paradox as ground: The shadows in the archetypes

 🔄Category Theory

These open-source tools do what Claude charges for, and some do it better

 📣Software Criticism
xda-developers.com·

Mutual Information Optimization via K-Recursion and Automatic Differentiation for Linear Gaussian Wireless Networks

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

Weighing Timed Regular Languages: The Final Step (long version)

 Functional Programming  Content type: Academic
arxiv.org·

Finite-Blocklength Lossy Joint Source-Channel Coding over Unknown Channels

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

В умелых руках и sed — балалайка или пишем «Морской бой» на регулярках

 🦀Rust  Content type: Blog
habr.com·

Algorithmic and Minimax Complexities in Kernel Bandits

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

Simplest Nontrivial Maxwellian Random Field Models for Stochastic LoS MIMO Using the Dyadic Green's Function

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

Automated Proving of Shannon-Type Entropy Inequalities via Fine-Tuned Language Models and Guided Tree Search

 🎯Constraint Programming  Content type: Academic
arxiv.org·

Exact output statistics of Icart's encoding in the exceptional \(j=0\) case

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

Fixed-Threshold One-Bit Toeplitz Covariance Estimation under Sparse-Ruler Sampling

 🎯Randomized Algorithms  Content type: Academic
arxiv.org·

Soft Covering via Hypothesis Testing: Typical-Code Exponents and Mismatched Detection

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

Keyboard Shortcuts

Navigation

Next / previous item
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help