Daily report — 2026-10-15

Population dynamics are often observed only as unpaired snapshots, which leave the evolution between measurements underdetermined. Second-order regularization can constrain it, but a penalty on the accelerations of sampled particles is a prior on joint particle paths, and different particle representations of the same marginal curve can have different acceleration costs.

Claimed: none extracted

Evidence: + toy/synthetic experiments ("synthetic"); + small/synthetic data ("synthetic"); + public benchmarks ("benchmarks"); + explicit algorithm/pseudocode ("Algorithm 1"); + concrete method ("closed form"); + formal statement ("we prove"); + claims simplicity ("Simple"); + code: https://github.com/amartya21/Neural-Wasserstein-Splines.git; + keywords: regularization, ranking

heuristic

Neural operators learn mappings between function spaces, enabling fast surrogate solutions to partial differential equations. Despite remarkable architectural diversity, these methods often share a common input representation: raw coordinate-value pairs $(x, u(x))$.

Claimed: none extracted

Evidence: + cheap/closed-form ("closed form"); + public benchmarks ("benchmark"); + concrete method ("closed form"); + formal statement ("We prove"); + claims simplicity ("simple"); + code: https://github.com/FaresBMehouachi/delNO; + keywords: regularization

heuristic

Conditional distribution equality testing is a core problem with applications in causal inference, model diagnostics, and transfer learning. Existing methods often lose power when the conditioning variable is high-dimensional.

Claimed: none extracted

Evidence: + toy/synthetic experiments ("synthetic"); + small/synthetic data ("synthetic"); + concrete method ("We propose a new"); + formal statement ("Theorem"); + claims simplicity ("straightforward"); no public code found; + keywords: kernel

heuristic

We introduce Continuum Attention (CA), a causal Transformer attention operator that replaces discrete key and value lookup with integration over a continuous, piecewise linear memory curve. Each query induces an exponential relevance density along the curve.

Claimed: none extracted

Evidence: + cheap/closed-form ("closed form"); + concrete method ("closed form"); + code: https://github.com/akhadangi/continuum-attention; + 2 HF upvotes

heuristic

On-policy distillation (OPD) trains a student model on its own rollouts with token-level supervision from a teacher, assuming that the teacher can reach a correct answer from any prefix the student writes. We call this property the recoverability of the teacher and show it fails on incorrect rollouts: the teacher follows student errors, although it recognizes them.

Claimed: none extracted

Evidence: + public benchmarks ("benchmarks"); + explicit algorithm/pseudocode ("Algorithm 1"); + code: https://github.com/kzhao5/CriticOPD; + 61 HF upvotes

heuristic

We study classification dynamics under small initialization and identify a pronounced non-monotone behavior of accuracy that we call the accuracy well: accuracy rises rapidly early in training, subsequently drops, and only much later recovers. We observe this phenomenon in deep linear networks, fully connected ReLU networks on MNIST, deep convolutional networks on CIFAR-10, and controlled syntheti

Claimed: accuracy 100.0%

Evidence: + toy/synthetic experiments ("synthetic"); + small/synthetic data ("MNIST"); + formal statement ("we prove"); + claims simplicity ("simple"); no public code found; + keywords: optimizer

heuristic

Federated learning over decentralized networks inherently trades off the suppression of local finite-sample noise through collaboration against the bias that collaboration introduces between heterogeneous nodes. We study this tension by performing a large-dimensional analysis of Generalized Total Variation Minimization with least-squares models.

Claimed: none extracted

Evidence: + toy/synthetic experiments ("synthetic"); + small/synthetic data ("synthetic"); + formal statement ("convergence"); + claims simplicity ("straightforward"); no public code found; + keywords: regularization

heuristic

It is folklore that passing "convergence" diagnostics does not guarantee that a Markov chain has converged. We prove this as an impossibility for any finite checklist of diagnostics.

Claimed: none extracted

Evidence: + formal statement ("convergence"); + claims simplicity ("simple"); + code: https://github.com/BaroqueObama/mcmc-impossibility-code; + keywords: sampling

heuristic

Pairwise comparison data are a standard supervision signal in preference learning, but disagreement in such data can reflect stable latent heterogeneity, ephemeral stochasticity, or non-binary responses hidden by a forced-choice interface. We study which of these semantic distinctions are identifiable from the feedback channel itself.

Claimed: none extracted

Evidence: + toy/synthetic experiments ("synthetic"); + small/synthetic data ("synthetic"); + formal statement ("we prove"); + claims simplicity ("simple"); no public code found

heuristic

How well can a language model turn a large, incomplete and partly contradictory body of documents into a plan when no single correct answer exists? We introduce Mission Analysis (MA)-Bench, built on mission analysis, the first step of military operational planning, in which a staff reads the full situation and states the problem before anyone proposes a solution.

Claimed: none extracted

Evidence: + toy/synthetic experiments ("synthetic"); + small/synthetic data ("synthetic"); no public code found; + keywords: ranking

heuristic