archive
Every paper Pith has read. Search by title, abstract, or pith.
1340 papers in cs.IT · page 5
-
Neural weight norm equals Kolmogorov complexity
Neural Weight Norm = Kolmogorov Complexity
-
Local privacy multiplies PIR capacity on graph unions
Local Private Information Retrieval: A New Privacy Perspective for Graph-Based Replicated Systems
-
Hollow-core upgrades cut QKD modules by 49% in metro networks
Selective Placement of Hollow-Core Fibers for QKD and Classical Communication Coexistence
-
LASSO matches homogeneous threshold for mixed-quality sparse data
Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data
-
Mamba replaces attention to scale neural decoders for long codes
Scalable Mamba-Based Message-Passing Neural Decoder for Error-Correcting Codes
-
Log-sum regularization outperforms l1 at low signal densities
Sparse Signal Recovery using Log-Sum Regularization and Adaptive Smoothing
-
Coprimeness of q-1 and d-2 yields uniform weight-2 cosets
Weight distributions of cosets of weight 2 of the generalized doubly extended Reed-Solomon codes
-
Folded quantum Hermitian codes reach quantum Singleton bound
List-Decodable Folded Quantum Hermitian Codes
-
Exact optimal repair bandwidth for (n,n-2,2) MDS codes found
Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
-
Adaptive min-sum decoder nears BP for quantum LDPC codes
Syndrome Adaptive Gain Control for Min-Sum Decoding of Quantum LDPC Codes
-
Sharp jumps in feature overlap set optimal neural scaling laws
Sharp feature-learning transitions and Bayes-optimal neural scaling laws in extensive-width networks
-
Optimal learners derived for misspecified universal learning
Misspecified Universal Learning
-
2-bit beamforming sustains GNSS at 70 dB jamming
Low-Cost GNSS Anti-Jamming Through 2-Bit Phase Shift Beamforming with Machine Learning
-
Adaptive offloading lifts LLM throughput 65% at 47% lower energy
GELATO: Generative Entropy- and Lyapunov-based Adaptive Token Offloading for Device-Edge Speculative LLM Inference
-
Kaplan-Meier estimators give unbiased ARL and ADD for finite sequences
Accurate Evaluation of Quickest Changepoint Detectors via Non-parametric Survival Analysis
-
Splitting method decodes random hypergraphs in m^{5/3} time
A Fast Hierarchical Splitting Approach for Non-Adaptive Learning of Random Hypergraphs
-
HMM aligns unlabeled RSS to build accurate radio maps
Survey-Free Radio Map Construction via HMM-Based Coarse-to-Fine Inference
-
CSI data alone recovers trajectories for indoor radio mapping
Annotation-Free Indoor Radio Mapping via Physics-Informed Trajectory Inference
-
Conditional privacy measure removes penalty on semantic recovery
R\'enyi Rate-Distortion-Perception-Privacy Tradeoff under Indirect Observation
-
Closed-form estimators compute multi-source PID for Gaussians
Closed-Form Gaussian Estimators for Multi-Source Partial Information Decomposition
-
Finite-field OFDM yields global QC-LDPC code for joint decoding
A Global Coding Scheme for OFDM over Finite Fields
-
Synthetic data improves models only with external information signals
An Information-Theoretic Criterion for Efficient Data Synthesis
-
Common randomness simplifies cross-domain compression to direct coupling
Cross-Domain Lossy Compression via Constrained Minimum Entropy Coupling
-
Algorithm learns adversary utilities for sublinear regret in coding game
Learning from Acceptance: Cumulative Regret in the Game of Coding
-
Recovery algorithms classify linear batch codes into a hierarchy
Recovery Algorithms for Linear Batch Codes
-
Entropy-based branching beats fixed beam search for LLMs
Entropy-informed Decoding: Adaptive Information-Driven Branching
-
Rényi entropy subadditive on majorization lattice
Geometry of R\'enyi Entropy on the Majorization Lattice
-
Rényi entropy is subadditive on the majorization lattice for all α
Geometry of R\'enyi Entropy on the Majorization Lattice
-
Perfect codes create symmetric 5x5 and 8x8 Sudokus
Symmetric Sudoku-Type Games from Perfect Codes
-
Geometry mismatch drives forgetting in sequential LLM training
Geometry Conflict: Explaining and Controlling Forgetting in LLM Continual Post-Training
-
Matching bounds set exact mu threshold for submatrix detection
Minimax optimal submatrix detection: Sharp non-asymptotic rates
-
Exact signal thresholds derived for submatrix detection
Minimax optimal submatrix detection: Sharp non-asymptotic rates
-
Support size sets the privacy limit for sparse local DP mechanisms
Sparse Discrete Laplace and Gaussian Mechanisms under Local Differential Privacy
-
Feature selection tolerates noise and weak symmetry
Universal Feature Selection with Noisy Observations and Weak Symmetry Conditions
-
Secure subset retrieval hits rate 1-1/N for any family
Secure and Private Structured-Subset Retrieval: Fundamental Limits and Achievable Schemes
-
Any demand family permits 1-1/N retrieval rate
Secure and Private Structured-Subset Retrieval: Fundamental Limits and Achievable Schemes
-
Superposition coding boosts covert rates on degraded broadcast channels
Covert Capacity of Degraded Broadcast Channels
-
Forward KL regularization yields first fast rates for offline contextual bandits
Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
-
Symmetry raises depolarizing channel quantum capacity threshold past all prior gains
Enhanced quantum capacity thresholds from symmetry
-
Symmetry lifts depolarizing channel capacity threshold after 18 years
Enhanced quantum capacity thresholds from symmetry
-
Stats on surfaces parameterized by Abelian and cubic differentials
On Conservative Statistical Riemann Surfaces
-
Router models LLM as channel to cut reliability cost 56% at same quality
A Communication-Theoretic Framework for LLM Agents: Cost-Aware Adaptive Reliability
-
Eulerian cycles build capacity-achieving weakly constrained codes
Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
-
Eulerian cycles build capacity-achieving weakly constrained codes
Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
-
Secret messages with deniability reveal only state cutoffs
Secret Communication with Plausible Deniability
-
Every (n-2) subspace of R^n holds vector with ratio >= n/2-1
Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes
-
Bounds set optimal trade-offs for multi-bit watermarking
Fundamental Trade-Offs in Multi-Bit Watermarking of Stochastic Processes
-
Stochastic bridge yields tractable soft objective for one-pass generative actors
Generative Actor-Critic with Soft Bridge Policies
-
Two-level rotations raise secrecy rates in multicast ISAC
Sensing-Aided Secure Multicast in Two-Level Rotatable Antenna-Enabled ISAC Systems: Modeling and Optimization
-
AI turns wrong-key outputs into shortcuts for cracking ciphers
AI-Accelerated Brute Force Cryptanalysis