AINeutralarXiv – CS AI · Jun 106/10
🧠A theoretical computer science paper formalizes decision-making under information constraints as action-sufficient compression, where systems need only preserve distinctions relevant to choosing optimal actions rather than reconstructing full state information. The framework applies rate-distortion theory to support states with regret-based distortion, offering a mathematical foundation for robust single-cycle arbitration.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers propose a novel information-theoretic framework for compressing bioelectrical signals that reframes compression limits as dependent on AI model capacity and task requirements rather than fixed signal properties. The three-level hierarchical approach—signal, physiological, and semantic—could enable more efficient brain-computer interfaces by transmitting only task-relevant residual information rather than raw waveforms.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers have developed a mathematical framework for optimal quantization that constrains output distributions while minimizing mean squared error. This theoretical advance has practical applications in entropy control, mutual information maximization, communication systems, and privacy-preserving data anonymization.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers introduce an information-theoretic framework to measure representational ambiguity in neural networks, demonstrating that network connectivity structures can encode unambiguous content independent of behavioral performance. Using MNIST classification experiments, they achieve 100% accuracy in identifying output neuron class identity from relational structure alone in dropout-trained networks, suggesting neural systems can exhibit the low-ambiguity representations theorized as necessary for consciousness.
AINeutralarXiv – CS AI · Jun 95/10
🧠Researchers have developed a formal decision-theoretic framework that quantifies the value of perception, prediction, communication, and common sense in autonomous decision-making systems. The work reveals that perception alone can have negative value, while combined perception-prediction and standalone prediction always yield non-negative returns, with applications to autonomous systems design and cognitive science.
AINeutralarXiv – CS AI · Jun 86/10
🧠Researchers adapted FunSearch, an LLM-guided evolutionary search method, to discover deletion-correcting codes—mathematical constructs that help recover data lost during transmission. The work represents the first application of LLM-guided evolutionary search to error-correcting codes, achieving improvements in single and multiple deletion scenarios, though computational limitations restrict the approach to short code lengths.
AIBullisharXiv – CS AI · Jun 56/10
🧠Researchers introduce InfoShield, a privacy-preserving machine learning technique that maintains depression detection accuracy while preventing the inference of sensitive demographic attributes from speech data. The method uses information-theoretic optimization to reduce mutual information between speech representations and demographic information, addressing a critical barrier to clinical deployment of speech-based mental health screening.
AINeutralarXiv – CS AI · Jun 55/10
🧠Researchers propose DDM-SSCC, a discrete diffusion model framework that improves lossless image transmission over noisy channels by combining pixel-level restoration with arithmetic coding. The approach outperforms existing lossless and semantic communication baselines on standard datasets, offering practical improvements for exact-recovery image transmission scenarios.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers introduce TaskPGM, a framework that optimizes how training data is distributed across multiple tasks when fine-tuning large language models by modeling task relationships through an energy-based probabilistic approach. The method balances task coverage against redundancy, demonstrating improvements over conventional uniform or size-proportional sampling strategies across multiple model families and evaluation benchmarks.
AINeutralarXiv – CS AI · Jun 46/10
🧠A new theoretical framework defines Bayes-sufficient representations in supervised learning, establishing what information is genuinely required for optimal predictions based on loss functions. The work formalizes the concept of Bayes quotients and minimal representations, connecting representation learning to property elicitation theory with experimental validation across synthetic and real datasets.
AINeutralarXiv – CS AI · Jun 46/10
🧠Researchers introduce KITE, a novel example selection method for in-context learning in large language models that uses information theory and kernel methods to choose task-specific examples from a prompt bank. The approach addresses limitations of existing nearest-neighbor methods by improving diversity and generalization, demonstrating measurable improvements across classification tasks in label-scarce scenarios.
AIBullishMIT News – AI · Jun 36/10
🧠MIT researchers demonstrated that smaller AI models can outperform larger ones at asking strategic questions by using the classic game Battleship as a training framework. The findings suggest that efficient questioning strategies could reduce AI inference costs by up to 99 percent while improving performance.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers introduce AnyEdit++, an improved framework for editing long-form knowledge in Large Language Models that uses Bayesian Surprise to identify semantic boundaries instead of fixed-window chunking. The method demonstrates superior performance across mathematical reasoning, code generation, and narrative tasks by maintaining structural coherence during knowledge updates.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers present graph-coupled causal Bayesian optimization, a method that improves expensive system optimization by sharing information across related interventions through a causal kernel. The approach demonstrates logarithmic information gains and cleanly separates optimization, causal estimation, and intervention selection errors, with strongest performance when direct interventions are unavailable.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers demonstrate that deep spiking neural networks organize information through functional ensembles—groups of neurons with statistically significant correlations—that encode data through rare, coordinated firing patterns. The study reveals these ensembles operate via robust computational principles similar to biological brains, with potential applications in neural network diagnostics and adversarial robustness testing.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers establish information-theoretic lower bounds for bit-constrained stochastic optimization, proving that B-bit quantized gradients require communication overhead of TB = Omega(d) and statistical complexity of T = Omega(sigma^2 d / eps^2 * max{1, d/B}). The work provides the first rigorous characterization of what's theoretically possible in low-precision pretraining, contrasting with existing empirical studies of FP8 and MXFP4 systems.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers propose a novel metric called 'Decan' for measuring diversity in AI-generated creative outputs using in-context learning and language model probabilities, achieving 84.6% accuracy on benchmark tests. The approach detects mode collapse and diversity loss across training stages without requiring specialized embedding models or human annotation, offering a practical tool for evaluating generative AI systems.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers propose Canopy Entropy (CE*), a new metric that reveals fine-tuning reorganizes uncertainty in language models rather than simply reducing it. The measure shows that fine-tuned models convert token-level uncertainty into more semantically meaningful and informative outputs, fundamentally changing how we understand model alignment and information generation.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers propose IBAL, an adversarial learning framework that makes multi-agent reinforcement learning systems robust against attacks that disrupt agent coordination through observation and action perturbations. The method addresses a gap in existing defenses by focusing on interaction-breaking attacks rather than value-oriented ones, demonstrating improved resilience across multiple scenarios.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers provide the first rigorous theoretical analysis of temperature scaling, a widely-used technique for controlling uncertainty in machine learning models. The study reveals that while temperature scaling reliably increases entropy in classifiers, it does not necessarily increase diversity in large language models as commonly claimed, and establishes temperature scaling as the unique linear calibration method that preserves hard predictions.
AIBullisharXiv – CS AI · May 286/10
🧠Researchers introduce InfoNoise, an adaptive noise scheduling method for diffusion model training that dynamically reallocates computational resources toward the most informative denoising levels. By estimating conditional-entropy-rate profiles during training, the approach matches or exceeds fixed schedules on image benchmarks while achieving up to 3x computational efficiency gains on diverse tasks including DNA and language generation.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose a novel emergent communication framework for 6G agentic AI networks that enables autonomous agents to learn their own communication protocols while accounting for physical networking constraints. The framework applies information-theoretic principles to quantify trade-offs between task-relevant information and computational complexity, with experimental validation showing improved generalization performance.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers discover that neural networks across different modalities (vision, point clouds, language) converge toward shared representations, with non-language modalities systematically moving toward language's neighborhood structure rather than vice versa. Using directional analysis, they attribute this asymmetry to language representations occupying more compact feature space, proposing that language serves as the asymptotic attractor in multimodal representation learning.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose Information Density as a quantitative framework for optimizing IoT sensor networks by enabling virtual sensing through AI. Using spatial, temporal, and cross-modal correlations, the system can replace physical sensors with computational models while maintaining sub-4% error margins, demonstrated via Madrid's smart city infrastructure.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers present Neural Information Causality (Neural-IC), a theoretical framework that formalizes how neural network representations function as communication channels under query-separated computation. The work establishes operational bounds on information leakage through bottlenecks and demonstrates that quantum advantages in specific architectures depend on fair query-conditioned access rather than total information capacity.
🏢 Meta
