archive
Every paper Pith has read. Search by title, abstract, or pith.
1340 papers in cs.IT · page 18
-
Noise shaping allows reliable one-bit quantization of graph data
Reliable one-bit quantization of bandlimited graph data via single-shot noise shaping
-
Bayes theorem equals the unique optimal data-deletion rule
Optimal information deletion and Bayes' theorem
-
New inequalities tighten learning generalization bounds
Tighter Information-Theoretic Generalization Bounds via a Novel Class of Change of Measure Inequalities
-
Information theory accounts for human categorization as well as classic models
A Rational Account of Categorization Based on Information Theory
-
Pinching antennas outperform fixed arrays in blocked multicasting
Multicasting Pinching Antenna Systems With LoS Blockage
-
ArcMark watermarks LLM text with multiple bytes per few hundred tokens
ArcMark: Distortion-Free Multi-Byte LLM Watermark via Optimal Transport
-
Rational adversaries lose in two-repetition vector coding
Game of Coding for Vector-Valued Computations
-
Transformer decodes multi-AP OFDM uplink without CSI
Scalable Cross-Attention Transformer for Cooperative Multi-AP OFDM Uplink Reception
-
Single-state models bound contextual info by I(C;O|λ)
Contextuality from Single-State Ontological Models: An Information-Theoretic Obstruction
-
Two-stage method detects unknown quantum changes optimally
Asymptotically Optimal Quantum Universal Quickest Change Detection
-
Convex needs drive convexity in optimal languages
When Efficient Communication Explains Convexity
-
Rank condition secures secrecy in multi-user distributed computing
Secure Multi-User Linearly-Separable Distributed Computing
-
Finite evaluations set hard limits on function approximation
Approximation of Functions: Optimal Sampling and Complexity
-
Two graph eigenvalues let one model prune for many codes
Spectral-Aligned Pruning for Universal Error-Correcting Code Transformers
-
Limited capacity forces LLMs to hallucinate non-facts
Hallucination is a Consequence of Space-Optimality: A Rate-Distortion Theorem for Membership Testing
-
Trade-offs quantified for secrecy and detection in secure ISAC
Secure Integrated Sensing and Communication against Communication and Sensing Eavesdropping
-
Simple codec cuts transformer inference bitrate sharply
Rate-Distortion Optimization for Transformer Inference
-
Learnable codec cuts redundancy by extracting shared vision info
Lossy Common Information in a Learnable Gray-Wyner Network
-
Quantum tomography gains valid confidence sets at any stopping time
Anytime-Valid Quantum State Tomography via Confidence Sequences
-
Networks approach optimal tests by retaining more divergence
Implicit Hypothesis Testing and Divergence Preservation in Neural Network Representations
-
Neural nets near optimal rules by keeping more KL divergence
Implicit Hypothesis Testing and Divergence Preservation in Neural Network Representations
-
RF signals fix scale ambiguity in monocular SLAM
When Simultaneous Localization and Mapping Meets Wireless Communications: A Survey
-
Contextuality sets positive lower bound on external simulation cost
Contextuality as an External Bookkeeping Cost under Fixed Shared-State Semantics
-
Neural estimator predicts full MI matrix in one pass
Neural Estimation of Pairwise Mutual Information in Masked Discrete Sequence Models
-
Gradient design cuts fluid antenna error by 30% in fixed size
Finite-Aperture Fluid Antenna Array Design: Analysis and Algorithm
-
Joint beamforming and RIS design raises secrecy rate in ISAC
Secure Beamforming and Reflection Design for RIS-ISAC Systems Under Collusion of Passive and Active Eavesdroppers
-
Closed-form BER formula for SAGINs accounts for residual Doppler
Space-Air-Ground-Integrated Networks: The BER vs. Residual Delay and Doppler Analysis
-
High-rate theory sets exact bound for quantized MatMul
High-Rate Quantized Matrix Multiplication I
-
Exact minimal weight perturbations derived for DNN layers
Theory of Minimal Weight Perturbations in Deep Networks and its Applications for Low-Rank Activated Backdoor Attacks
-
Markov privacy via stationary-time redaction costs constant average erasures
Perfect Privacy and Strong Stationary Times for Markovian Sources
-
Tensor method yields explicit K/N rate for non-linear server tasks
Multi-User Non-Linearly Separable Distributed Computing
-
Deterministic codes cap DMRA overhead at 1 + log2 e bits
A Remark on Downlink Massive Random Access
-
Stabilizer codes raise achievable rates on asymmetric quantum channels
Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds
-
Optimal resilience exists for any network of three or more nodes
On the existence of Ulanowicz's optimal structural resilience in complex networks
-
ML estimator drives error to zero below explicit noise threshold
Direct and Converse Theorems in Estimating Signals with Sublinear Sparsity
-
Symbolic mechanisms resolve collisions in semantic embeddings
Semantic Identity Compression: Zero-Error Laws, Rate-Distortion, and Neurosymbolic Necessity
-
Waiting strategies raise mean binary freshness in query monitoring
Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems
-
This paper proposes Group Relative Policy Optimization (GRPO)
Group Relative Policy Optimization for Robust Blind Interference Alignment with Fluid Antennas
-
Tsallis entropy concave along heat flow in any dimension
Concavity of Tsallis Entropy and Tsallis Entropy Power along Heat Flow
-
Relativity emerges from averaged multiplicative Hamiltonian
Relativistic Hamiltonian as an emergent structure from information geometry
-
Hamming weight sets computation capacity for Boolean functions over channels
Beyond Identification: Computing Boolean Functions via Channels
-
Vision transformer decoder beats baselines on toric codes
A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding
-
Cubic generating set creates infinite family of 2-quasi-perfect Lee codes
$2$-quasi-perfect Lee codes and abelian Ramanujan graphs: a new construction and relationship
-
Unique reciprocal cost on ratios forces balanced discrete ledgers
Coherent Comparison as Information Cost: A Cost-First Ledger Framework for Discrete Dynamics
-
Cascaded tests recover defectives optimally up to logs
Small-Error Cascaded Group Testing
-
Closed-form RDC tradeoffs derived for Bernoulli sources
Rate-Distortion-Classification Representation Theory for Bernoulli Sources
-
Rényi RDP closed forms derived for scalar Gaussians
On the R\'enyi Rate-Distortion-Perception Function and Functional Representations
-
Gaussian-noise bounds match for quantitative group testing
The Noisy Quantitative Group Testing Problem
-
Relative entropy thresholds optimize one- and two-sample tests
Asymptotically Optimal Tests for One- and Two-Sample Problems
-
Single-letter bounds for Markov-channel coordination
Empirical Coordination over Markov Channel with Independent Source