Feeds to Scour
SubscribedAll
Scoured 26582 posts in 31.7 ms
Modern LZ Compression Part 2: FSE and Arithmetic Coding  🎯Arithmetic Coding Theory
glinscott.github.io·1d·Hacker News
Dynamic Parameter Scheduling in Soft-Hard BPGD for Lossy Source Coding  📊Rate-Distortion Theory
arxiv.org·4d
HT-NRC: A high-throughput and noise-resilient lossless image compression architecture for deep-space CMOS cameras  ⚡Compression Hardware
mdpi.com·2d·Lobsters
Ramanujan-Pi Series and Nvidia Blackwell B200 : FP64 Architecting Transcendental Entropy for Bitcoin Security  🔢Bitwise Algorithms
zenodo.org·6d·Hacker News
Oxford Information Theory Lecture 1: Defining Entropy and Information  📈Entropy Estimation
ickma2311.github.io·5d
Entropy lower bounds and sum-product phenomena  🧮Kolmogorov Bounds
arxiv.org·2d
Quantization robustness from dense representations of sparse functions in high-capacity kernel associative memory  📊Quantization
arxiv.org·2d
Efficient Arithmetic-and-Comparison Homomorphic Encryption with Space Switching  🔐Homomorphic Encryption
arxiv.org·2d
Sequential KV Cache Compression via Probabilistic Language Tries: Beyond the Per-Vector Shannon Limit  🌊Streaming Compression
arxiv.org·5d·Hacker News
Hierarchical Joint Source-Channel Coding with Constrained Information Leakage  ⧗Information Bottleneck
arxiv.org·1d
Cross-Entropy Is Load-Bearing: A Pre-Registered Scope Test of the K-Way Energy Probe on Bidirectional Predictive Coding  🧠Intelligence Compression
arxiv.org·1d
Mismatch Capacity under Stochastic Decoding  ⚽Sphere Packing
arxiv.org·4d
Provably Secure Steganography Based on List Decoding  🕵️Steganographic Archives
arxiv.org·1d
Constructive Approaches to Perception-Aware Lossy Source Coding: Information-Theoretic Guidelines  📊Rate-Distortion Theory
arxiv.org·3d
Lossless Compression via Chained Lightweight Neural Predictors with Information Inheritance  📊Quantization
arxiv.org·5d
Rate-Distortion Theory for Deductive Sources under Closure Fidelity  🧮Kolmogorov Complexity
arxiv.org·5d
Safety-Certified CRT Sparse FFT: $\Omega(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case  📐Error Bounds
arxiv.org·3d
About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment  🌳Huffman Trees
arxiv.org·4d
LoRaQ: Optimized Low Rank Approximation for 4-bit Quantization  📊Quantization
arxiv.org·4d
Predicting LLM Compression Degradation from Spectral Statistics  🧠Learned Codecs
arxiv.org·4d

No more posts from matmat's subscribed feeds.

Scour all 24374 feedsLearn more about Feeds

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