As enterprise agent tool catalogs scale from 10 to 110 agents, routing accuracy drops 16--23 percentage points on under-specified requests. An oracle analysis identifies retrieval and confusion gaps, with embedding-based shortlisting recovering +10--11pp F1. A human-annotated study of 1,435 utterances confirms real-world recovery of +10--17pp despite lower absolute performance.
A new framework uses positive-unlabeled learning and Partial Optimal Transport to audit LLM evaluation biases. It aligns human-verified positive outputs with unlabelled model responses in embedding space, identifying consistent human preferences and correcting verbosity bias without retraining. Experiments show improved human alignment, robustness to presentation biases, and interpretable confidence estimates.
Giskard enables confidential and Byzantine-robust decentralized machine learning aggregation by organizing parties into tree-based committees of size O(log n). It uses BGW-style MPC and a committee-adapted binary search to compute an approximate median, reducing per-party communication complexity asymptotically while maintaining model utility under up to n/4 Byzantine parties.
OrthoReg introduces orthogonal regularization to prevent neural components from relearning symbolic structures in hybrid dynamical systems. By directly penalizing overlap between symbolic and neural parts, it enables a complementary decomposition where symbolic models capture expressible physics and neural models handle remaining dynamics. On benchmarks with partial library mismatch, OrthoReg improves symbolic recovery and out-of-distribution performance.
Morpheus is a morphology-aware neural tokenizer and word embedder for Turkish that preserves original text through lossless encoding and decoding. It achieves the lowest bits-per-character (1.425), improves morphological alignment (MorphScore macro-F1 0.61), and uses 19% less GPU memory than 64K-vocabulary subword tokenizers. Frozen Morpheus embeddings outperform BGE-M3 and BERTurk in lexical retrieval, with root-family MAP of 0.85 and ROC-AUC of 1.00.
LegalWorld models Chinese civil litigation as a causally connected chain of five stages, based on 75,309 judgments. It includes reusable infrastructure to maintain consistency across stages and enables LongJud-Bench to evaluate agent performance across all phases, revealing significant capability gaps between models in different legal tasks.
A meta-feedback semi-supervised learning framework enables scaling of automatic emergency braking using massive unlabeled fleet data. The stabilized approach reduces pseudo-label errors through noise-aware decoupling and kinematics-gated pseudo-labeling, improving safety with a 100:1 positive-to-false activation ratio and 35% more accident-free driving mileage compared to rule-based systems.
TransitNet, a compact attention-augmented deep learning framework, achieves 95.2% accuracy in low-SNR transit blind searches, outperforming TLS and BLS in ROC-AUC and PR-AP values. It recovers 93.0% of injected Earth- and sub-Earth-size transits, with 97.4% of injected transits fully covered by estimated transit windows, and successfully recovers all 34 confirmed Kepler planets with a mean midpoint error of 1.24 hours.
An exploratory analysis of 10 vibe-coded C/C++ projects reveals near-zero in-artifact variability, with all decisions resolved at generation time. The paper proposes Variability by Regeneration (VbR), a product-line approach where an LLM acts as a derivation engine, generating tailored binaries from declarative specifications, with a variant dispatcher routing user requests to the correct binary. VbR shifts variability into specifications, not code, offering a new paradigm for SPL engineering.
A new taxonomy classifies LLM agent communication protocols across five dimensions: counterparty, payload, interaction state, discovery mechanism, and schema flexibility. Analysis shows hybrid payloads, session-state persistence, and runtime schema negotiation are common, with decentralized discovery remaining rare. The study predicts short-term convergence toward unified agent-to-agent and agent-to-context protocols, and long-term evolution toward a federated, layered protocol stack.
OrthoReg introduces orthogonal regularization to prevent neural components from relearning symbolic structures in hybrid dynamical systems. By directly penalizing overlap between symbolic and neural parts, it enables a complementary decomposition where symbolic models capture expressible physics and neural components handle remaining dynamics. On benchmarks with partial library mismatch, OrthoReg improves symbolic recovery and out-of-distribution performance.
The article confirms there was no actual jailbreak of Anthropic's Fable AI. Instead, a test involving fake code with planted vulnerabilities was conducted, where Fable refused to review the code and only responded to a request to 'fix this code' after manual steps. Katie Moussouris of Luta Security states this scenario should not trigger export controls, calling it a deliberate, engineered test that undermines claims of a security breach.
ConTex reformulates counterfactual generation for time series forecasting as a globally consistent intervention problem. It achieves state-of-the-art validity with sparse, interpretable interventions, reduces computational cost by 12-36x, and enables real-time inference in approximately 0.007 seconds.
This paper proposes SD-ZFS, a deep reinforcement learning framework adapted from S2V-DQN, to solve the NP-hard minimum zero-forcing set problem on undirected graphs. The framework demonstrates strong performance compared to optimal solutions and greedy heuristics, showing effective generalization, scalability, and transfer across diverse graph structures.
A new convex quasilinearization method, LiL-Q, solves nonlinear PDEs by reducing them to linear subproblems using physics-informed neural networks. LiL-Q converges in single-digit iterations across seven benchmarks, achieving machine precision when the exact solution lies in the trial space, and requires up to two orders of magnitude fewer parameters than standard PINN solvers.
A study of 14,727 security and privacy prompts from 3.2M real-world user-LLM conversations identifies nine categories of S&P queries. Commercial LLMs outperform open models, with GPT 5.5 providing good responses on 98% of prompts versus Llama 4 at 47%, though some commercial models produce contradictory responses across runs.
MGUP introduces a selective update mechanism that applies larger step-sizes to a fixed proportion of parameters in stochastic optimization, while using smaller, non-zero step-sizes for the rest. It integrates seamlessly with optimizers like AdamW, Lion, and Muon, providing theoretical convergence guarantees for MGUP-AdamW and demonstrating superior or more stable performance in training large language models and MAE pretraining tasks.
SPHERE-JEPA introduces deterministic statistical regularizers on the hypersphere, replacing stochastic sliced methods with analytically integrated objectives like MMD, KSD, and KL divergence. Rotationally invariant kernels based on heat and bandlimited filters ensure spatial bias-free learning, with empirical results showing improved convergence and performance on ImageNet and Galaxy10, and superior instance separation in procedural texture retrieval using KL divergence.
TUNEAHEAD is a lightweight framework that predicts fine-tuning performance using meta-feature vectors from dataset descriptors and short probe runs. It outperforms baselines like Early-Stop Extrapolation and ProxyLM, achieving an RMSE of 1.47 percentage points and 95.1% of predictions within ±3 percentage points of true scores on 370 held-out runs.
A confusion-aware difficulty score is introduced within the Transfer Teacher framework to improve model interpretability and data efficiency. Evaluations on CIFAR-10 show that confusion-aware curriculum ordering outperforms random ordering by up to 8.7% at 20% data, demonstrating consistent data-efficiency gains. However, curriculum or anti-curriculum ordering does not improve accuracy over standard training at full data, indicating that scoring function improvements alone are insufficient to overcome curriculum learning failure modes.