Archives AI News

Low-dimensional topology of deep neural networks

arXiv:2606.31856v2 Announce Type: replace Abstract: We study layered models, including feedforward networks, ResNets, and transformers, by limiting each layer to a width of $d = 3$, i.e., $mathbb{R}^3$ as representation space. This allows us to track how a neural network…

Position: Fairness Failure in Generative Models is an Evaluation Problem

arXiv:2608.16974v1 Announce Type: new Abstract: Despite groundbreaking advancements in generative models during the last decade, concerns about their lack of fairness, reinforcing societal inequalities and harming marginalized groups, remain under-addressed and difficult to act upon. This position paper argues that…

Why Does Self-Distillation (Sometimes) Degrade the Reasoning Capability of LLMs?

arXiv:2603.24472v4 Announce Type: replace-cross Abstract: Self-distillation has emerged as an effective post-training paradigm for LLMs, often improving performance while shortening reasoning traces. However, in mathematical reasoning, we find that it can reduce response length while degrading performance. We trace this…

Non-KKT Accumulation in Entropic Mirror Descent

arXiv:2608.01658v3 Announce Type: replace-cross Abstract: For mirror descent generated by a Legendre kernel, perhaps one of the most basic question in optimization is this: must every accumulation point of a bounded mirror descent sequence be Karush–Kuhn–Tucker (KKT) stationary under proper…

Communication Reduction via Semantic-Based Encoding in DMPC Using LSTMs

arXiv:2608.17592v1 Announce Type: cross Abstract: The communication demands of distributed model prediction control (DMPC) can overwhelm even advanced wireless communication technologies as agents must exchange a significant amount of information at least once per time step. To semantically reduce communication…

Toward the Optimal Regret-Instability Trade-off in Multi-Armed Bandits

arXiv:2608.17841v1 Announce Type: cross Abstract: Multi-armed bandit algorithms are evaluated by regret, yet comparable regret can coexist with different allocations across independent runs. We study the trade-off between worst-case regret $mathcal{R}_{K,T}$ and instability $mathcal S_{K,T}$, defined as the largest standard…

Backward through Time, Algebraically

arXiv:2608.17087v1 Announce Type: new Abstract: Linear temporal logic is a modal extension of propositional logic that allows one to state how a system should behave over time. Its canonical domain is the booleans, but discretely-valued judgements are of little use…