Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
Information Theory
ℹ️ Information Theory
Shannon Entropy, Coding Theory, Compression, Channel Capacity
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
107
posts in
17.5
ms
Prime Event Languages: An
Information-Theoretic
Investigation of Twin-Prime Event Structure
🌸
Bloom Filters
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Prime Event Languages: An Information-Theoretic Investigation of Twin-Prime Event Structure
Cosmos-Research-Institute/Emulation/Life at main · cosmosoneness/Cosmos-Research-Institute
🧠
Machine Learning
Content type:
Code
github.com
·
1d
1 day ago
·
Hacker News
Actions for Cosmos-Research-Institute/Emulation/Life at main · cosmosoneness/Cosmos-Research-Institute
A Note on the
Kullback-Leibler
Divergence
in Discretized Empirical Distributions
🎓
Advanced content
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for A Note on the Kullback-Leibler Divergence in Discretized Empirical Distributions
Minimum
Distortion
Quantization with Specified Output Distribution
🔢
BitNet
Content type:
Academic
arxiv.org
·
8h
8 hours ago
Actions for Minimum Distortion Quantization with Specified Output Distribution
The Bioelectrical
Information
Theory
: Investigating the theoretical
compression
limit of bioelectrical signals under artificial intelligence
📖
E-Ink Displays
Content type:
Academic
arxiv.org
·
8h
8 hours ago
Actions for The Bioelectrical Information Theory: Investigating the theoretical compression limit of bioelectrical signals under artificial intelligence
Optimal Feedback Communication with
Information
Maximization and
Distortion
Minimization
♟️
Game Theory
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Optimal Feedback Communication with Information Maximization and Distortion Minimization
Automated Proving of
Shannon-Type
Entropy
Inequalities via Fine-Tuned Language Models and Guided Tree Search
🤖
LLM
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Automated Proving of Shannon-Type Entropy Inequalities via Fine-Tuned Language Models and Guided Tree Search
Support sufficiency as action-sufficient
compression
: a single-cycle
rate-regret
formulation
🧠
Agent Memory
Content type:
Academic
arxiv.org
·
8h
8 hours ago
Actions for Support sufficiency as action-sufficient compression: a single-cycle rate-regret formulation
SMI: Efficient Self-Supervised Learning via
Mutual-Information-Inspired
Dependency Optimization
🧠
Machine Learning
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for SMI: Efficient Self-Supervised Learning via Mutual-Information-Inspired Dependency Optimization
Mutual
Information
Optimization via K-Recursion and Automatic Differentiation for Linear Gaussian Wireless Networks
🔢
BitNet
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for Mutual Information Optimization via K-Recursion and Automatic Differentiation for Linear Gaussian Wireless Networks
Robust Repair of Reed-Solomon Codes
🔓
Hacking
Content type:
Academic
arxiv.org
·
5d
5 days ago
Actions for Robust Repair of Reed-Solomon Codes
Optimality of FSQ Tokens for Continuous Diffusion for Categorical Data with Application to Text-to-Speech
💬
NLP
Content type:
Academic
arxiv.org
·
8h
8 hours ago
Actions for Optimality of FSQ Tokens for Continuous Diffusion for Categorical Data with Application to Text-to-Speech
Finite-Blocklength
Lossy
Joint
Source-Channel
Coding
over Unknown Channels
🔢
BitNet
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Finite-Blocklength Lossy Joint Source-Channel Coding over Unknown Channels
Conditional Vendi Score: Prompt-Aware Diversity Evaluation for Generative AI Models and LLMs
✨
Gemini
Content type:
Academic
arxiv.org
·
8h
8 hours ago
Actions for Conditional Vendi Score: Prompt-Aware Diversity Evaluation for Generative AI Models and LLMs
Self-Distilled Policy Gradient
⚗️
Knowledge Distillation
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Self-Distilled Policy Gradient
Structure and Construction of Two-Dimensional Minimal Linear Codes over the rings $\mathbb{Z}_{p^n}$ with Applications to Secret Sharing
🔐
Cryptography
Content type:
Academic
arxiv.org
·
2d
2 days ago
Actions for Structure and Construction of Two-Dimensional Minimal Linear Codes over the rings $\mathbb{Z}_{p^n}$ with Applications to Secret Sharing
Soft Covering via Hypothesis Testing:
Typical-Code
Exponents and Mismatched Detection
🪝
eBPF
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Soft Covering via Hypothesis Testing: Typical-Code Exponents and Mismatched Detection
Selective Coupling of Decoupled
Informative
Regions: Masked Attention Alignment for Data-Free Quantization of Vision Transformers
✨
LLMs
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Selective Coupling of Decoupled Informative Regions: Masked Attention Alignment for Data-Free Quantization of Vision Transformers
Simplest Nontrivial Maxwellian Random Field Models for Stochastic
LoS
MIMO Using the Dyadic Green's Function
⚡
Edge AI
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Simplest Nontrivial Maxwellian Random Field Models for Stochastic LoS MIMO Using the Dyadic Green's Function
Improving the Efficiency and Effectiveness of LLM Knowledge Distillation for Conversational Search
🔍
Information Retrieval
Content type:
Academic
arxiv.org
·
6d
6 days ago
Actions for Improving the Efficiency and Effectiveness of LLM Knowledge Distillation for Conversational Search
Page 2 »
Log in to enable infinite scrolling
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
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
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help