Table of Links Abstract and 1. Introduction Related Work Preliminaries and Notations Differentiable Structural Information 4.1. A New Formulation 4.2. Properties 4.3. Differentiability & Deep Graph Clustering LSEnet 5.1. Embedding Leaf Nodes 5.2. Learning Parent Nodes 5.3. Hyperbolic Partitioning Tree Experiments 6.1. Graph Clustering 6.2. Discussion on Structural Entropy Conclusion, Broader Impact, and References Appendix A. Proofs B. Hyperbolic Space C. Technical Details D. Additional Results C. Technical Details C.1. Notations The mathematical notations are described in Table […]

Ver mais

We introduce Strategic Doctrine Language Models (sdLM), a learning-system framework for multi-document strategic reasoning with doctrinal consistency constraints and calibrated uncertainty. The approach combines multi-document attention, temporal encoding, and a doctrine-consistency layer to improve long-horizon forecasting and plan plausibility while reducing severe doctrinal violations. We evaluate sdLM using (i) expert-panel scoring of strategic scenarios (N=47), (ii) doctrine consistency on 336 doctrine publications (12,847 statements), and (iii) geopolitical forecasting on 127 historical counterfactuals (1945-2020) across 12-60 month horizons. Across […]

Ver mais

arXiv:2512.08601v2 Announce Type: replace Abstract: Since the 1990s, considerable empirical work has been carried out to train statistical models, such as neural networks (NNs), as learned heuristics for combinatorial optimization (CO) problems. When successful, such an approach eliminates the need for experts to design heuristics per problem type. Due to their structure, many hard CO problems are amenable to treatment through reinforcement learning (RL). Indeed, we find a wealth of literature training NNs using value-based, policy gradient, or […]

Ver mais

arXiv:2603.25937v1 Announce Type: new Abstract: Visual Navigation Models (VNMs) promise generalizable, robot navigation by learning from large-scale visual demonstrations. Despite growing real-world deployment, existing evaluations rely almost exclusively on success rate, whether the robot reaches its goal, which conceals trajectory quality, collision behavior, and robustness to environmental change. We present a real-world evaluation of five state-of-the-art VNMs (GNM, ViNT, NoMaD, NaviBridger, and CrossFormer) across two robot platforms and five environments spanning indoor and outdoor settings. Beyond success rate, […]

Ver mais

This study examines the multifaceted application of machine learning and artificial intelligence (AI) in two key, dynamically developing sectors: cryptocurrency market capitalisation forecasting and customer service optimisation. An analysis of the effectiveness of various regression models (Linear, Lasso, and Decision Tree Regression) in predicting the market capitalisation of 3 leading cryptocurrencies shows that a model’s success is highly dependent on the specific characteristics of the asset. While linear models achieve exceptional accuracy (R2>0.99) for most major and liquid […]

Ver mais

arXiv:2501.02624v2 Announce Type: replace-cross Abstract: Approximate Leave-One-Out Cross-Validation (ALO-CV) is a method that has been proposed to estimate the generalization error of a regularized estimator in the high-dimensional regime where dimension and sample size are of the same order, the so-called “proportional regime”. A new analysis is developed to derive the consistency of ALO-CV for non-differentiable regularizers under Gaussian covariates and strong convexity. Using a conditioning argument, the difference between the ALO-CV weights and their counterparts in mean-field […]

Ver mais

arXiv:2602.09075v1 Announce Type: new Abstract: In-Context Learning (ICL) in transformers acts as an online associative memory and is believed to underpin their high performance on complex sequence processing tasks. However, in gated linear attention models, this memory has a fixed capacity and is prone to interference, especially for long sequences. We propose Palimpsa, a self-attention model that views ICL as a continual learning problem that must address a stability-plasticity dilemma. Palimpsa uses Bayesian metaplasticity, where the plasticity of […]

Ver mais

arXiv:2604.02341v1 Announce Type: new Abstract: Mathematical reasoning in large language models has improved substantially with reinforcement learning using verifiable rewards, where final answers can be checked automatically and converted into reliable training signals. Most such pipelines optimize outcome correctness only, which yields sparse feedback for long, multi-step solutions and offers limited guidance on intermediate reasoning errors. Recent work therefore introduces process reward models (PRMs) to score intermediate steps and provide denser supervision. In practice, PRM scores are often […]

Ver mais

We employ stochastic feed-forward neural networks with Gaussian-distributed weights to determine a probabilistic forecast for spatio-temporal raster datasets. The networks are trained using MMAF-guided learning, a generalized Bayesian methodology in which the observed data are preprocessed using an embedding designed to produce a low-dimensional representation that captures their dependence and causal structure. The design of the embedding is theory-guided by the assumption that a spatio-temporal Ornstein-Uhlenbeck process with finite second-order moments generates the observed data. The trained networks, […]

Ver mais