Domain-specific curvature is an appealing idea for domain generalization (DG), but curvature learning can denote substantially different computations. This paper evaluates one deliberately narrow implementation: the code calls it HyperDG, but it rescales Euclidean encoder features during training by learned positive sc...
LLM agents can adapt to task feedback by revising the textual context that guides their behavior, without changing their model parameters. However, turning execution rewards into reusable context updates is challenging: individual trajectories offer limited comparative evidence about what to change, while task-specific...
Connection-tableau provers typically construct closed tableaux by backtracking search. This gives lightweight proof procedures, but their low-memory search state leaves little derived information to reuse after a failed attempt. SATCoP addresses this by retaining grounded tableau clauses in an incremental SAT solver, a...
Martin S. Fixman, Fredrik R{\o}mming, Sean B. Holden· 0 citations
Soil organic carbon (SOC) is an indicator of agricultural soil condition and carbon storage, but numerical outputs from large language models (LLMs) require validation before use in monitoring or management. We evaluated seven general-purpose LLM configurations on three direct-response tasks: estimating 0--10 cm SOC co...
Yingxuan Cheng, Tong Li, Yayong Li et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Parallel generation is widely regarded as an inherent advantage of diffusion large language models. Yet our fixed-quota evaluation of four representative models reveals severe degradation across mathematics and code, with all scores below 15% at 16 tokens per step. Token-level probes identify local predictive potential...
Jiahao Kuang, Yangfan Gao, Tao Gui et al.· 0 citations
This work proposes QRR (Quotient Recurrent Reasoner), a gauge-equivariant recurrent architecture with an exact per-token phase-rotation symmetry that achieves stable and faster convergence to solution roots in quotient space, while matching or surpassing recent recurrent reasoning models on Sudoku, Maze, and Mini-ARC.
Randomly initialised neural networks of width $m$ converge to Gaussian processes as $m \to \infty$, with two types of quantitative bounds characterising this convergence. Finite-sample bounds compare the network with its Gaussian limit at a fixed finite sample set, on an arbitrary domain, in the quadratic Wasserstein d...
Luis Wiederhold, Nil Ayday, Debarghya Ghoshdastidar· 0 citations
On-policy self-distillation improves a model using guidance from the model itself, but it still requires a teacher that provides more useful predictions than the student. Existing approaches obtain such guidance by giving the teacher additional context or instructions. We ask whether it can instead come from changing h...
Wei Fan, Qing-Yue Yang, Chao-Hong Tan et al.· 0 citations
Sycophancy in Large Language Models, the tendency to align responses with user preferences over ground truth, has largely been studied using questions without a clear ground truth and with a single, plainly stated user opinion. We present a systematic study of which framings of a user's claim trigger sycophancy in fact...
Jean Seo, Pepa Atanasova, Isabelle Augenstein· 0 citations
Owner-Aware Routing is proposed, which drafts a schema-only SQL query, counts the owners whose tables it joins, and routes the question before any private row is read, and beats every fixed protocol on PeopleJoin, by up to 9.3 points on held-out organizations.
Standard identifiability theory assumes one-dimensional latent factors, but learned representations can encode latent information across multidimensional blocks whose internal coordinates are not uniquely determined. When such blocks are used to represent and intervene on higher-level concepts, it is unclear whether th...
Training-free diffusion-based compression methods repurpose the generative priors of a diffusion or a flow model to compress data without retraining them as task-specific codecs. Recent codebook-based approaches such as Turbo-DDCM achieve strong perceptual quality at ultra-low bitrates, but their reliance on dense Gaus...
Or Ronai, Vladimir Kulikov, T. Michaeli· 0 citations