Your AI model could be failing right now without triggering a single alarm. The API is up, latency is low, and DevOps dashboard is showing green, but the quality of predictions is quietly eroding. This is the “silent failure” trap: infrastructure is healthy, but the intelligence is bankrupt. Traditional monitoring tools track “plumbing” like CPU load and error codes, but they miss model drift and biased outputs. To catch a model that is technically “online” but functionally broken, […]

Ver mais

Table of Links Abstract and 1. Introduction 2. Pairing functions Enumerating trees LZ-trees Conclusion and References Abstract I present a simple algorithm for enumerating the trees generated by a Context Free Grammar (CFG). The algorithm uses a pairing function to form a bijection between CFG derivations and natural numbers, so that trees can be uniquely decoded from counting. This provides a general way to number expressions in natural logical languages, and potentially can be extended to other combinatorial […]

Ver mais

arXiv:2504.05695v5 Announce Type: replace-cross Abstract: We prove that overparametrized neural networks are able to generalize with a test error that is independent of the level of overparametrization, and independent of the Vapnik-Chervonenkis (VC) dimension. We prove explicit bounds that only depend on the metric geometry of the test and training sets, on the regularity properties of the activation function, and on the operator norms of the weights and norms of biases. For overparametrized deep ReLU networks with a […]

Ver mais

arXiv:2604.06215v1 Announce Type: new Abstract: The governance of frontier general-purpose artificial intelligence has become a public-sector problem of institutional design, not merely a technical issue of model performance. Recent evidence indicates that AI capabilities are advancing rapidly, though unevenly, while knowledge about harms, safeguards, and effective interventions remains partial and lagged. This combination creates a difficult policy condition: governments must decide under uncertainty, across multiple plausible trajectories of progress through 2030, and in environments where adoption outcomes depend […]

Ver mais

arXiv:2605.29642v1 Announce Type: new Abstract: In federated language modeling, $K$ nodes each hold $n$ samples but cannot pool data or exchange full-precision gradients or weights. We study the minimax rate at which a conditional distribution over $V$ tokens can be estimated when each node may upload at most $B$ bits per query in a public probe set. In federated probe-logit distillation (FPLD), each node transmits a scalar-quantized logit vector on the probe set, and an aggregator distills a […]

Ver mais

Contrastive Language-Image Pretraining (CLIP) models excel at understanding image-text relationships but struggle with adapting to new data without forgetting prior knowledge. To address this, models are typically fine-tuned using both new task data and a memory buffer of past tasks. However, CLIP’s contrastive loss suffers when the memory buffer is small, leading to performance degradation on previous tasks. We propose a memory-efficient, distributionally robust method that dynamically reweights losses per class during training. Our approach, tested on class […]

Ver mais