April 2026

Acquiring world knowledge directly from visual observation is fundamental to Artificial General Intelligence (AGI). To support this capability, the Vision World Model (VWM) has emerged as a key paradigm, which learns how the world evolves over time from visual streams. However, recent progress has been driven by diverse research communities, resulting in inconsistent problem formulations, disconnected taxonomies, and divergent evaluation protocols. We argue that addressing this gap requires a conceptual shift: vision should not be treated merely as […]

Ver mais

The Hill cipher has historically lacked the confusion and diffusion properties required for modern cryptographic use. This paper presents the Multidimensional Hill Substitution-Permutation Network (MD-Hill-SPN), a 128-bit, 12-round block cipher combining three elements: (1) a hierarchical matrix diffusion layer operating at 4×4, 8×8, and 16×16 byte scales over GF(2⁸); (2) two AES S-box substitution layers per round; and (3) Argon2id memory-hard key derivation. Metric sessions used a SHA-256 domain-separator surrogate for Argon2id for computational tractability; Argon2id is the […]

Ver mais

The distributional specification in Markov-switching GARCH models has historically been driven by empirical convention rather than statistical theory. This paper derives the two-regime MS-GARCH specification from the Maximum Entropy Principle, providing an information-theoretic motivation for Student-t regime-conditional innovations in cryptocurrency volatility modelling. The framework is applied to five major cryptocurrencies, Bitcoin, Ethereum, Ripple, Litecoin, and Bitcoin Cash, over the period January 2017 to March 2026, comprising 15,834 daily observations spanning six complete market cycles. Three principal findings emerge. […]

Ver mais

Engineering teams often think about infrastructure only when something breaks. A remote connection fails. A server becomes unstable. A workstation loses access to a critical system. A field team cannot synchronize data. An industrial environment starts showing communication issues that no one can explain clearly. At that point, infrastructure suddenly becomes visible. But by then, the real problem has usually been present for a long time. In my experience working with networks, servers, secure connectivity, technical support, and […]

Ver mais

arXiv:2604.25655v1 Announce Type: new Abstract: Nonlinear dynamical systems with regime transitions are typically described by ordinary differential equations with jumping parameters parameters. Traditional methods often treat change-point detection and parameter estimation as separate tasks, ignoring the inherent coupling between them. To address this, we propose residual-loss anomaly analysis of physics-informed neural networks, a unified framework that leverages dynamical consistency within the physics-informed learning paradigm. This approach jointly infers piecewise parameters and transition points under a single set of […]

Ver mais

arXiv:2604.25272v1 Announce Type: new Abstract: Smooth functions on graphs have wide applications in manifold and semi-supervised learning. In this work, we study a bandit problem where the payoffs of arms are smooth on a graph. This framework is suitable for solving online learning problems that involve graphs, such as content-based recommendation. In this problem, each item we can recommend is a node of an undirected graph and its expected rating is similar to the one of its neighbors. […]

Ver mais

arXiv:2604.25271v1 Announce Type: new Abstract: We consider adversarial multi-armed bandit problems where the learner is allowed to observe losses of a number of arms beside the arm that it actually chose. We study the case where all non-chosen arms reveal their loss with a fixed but unknown probability $r$, independently of each other and the action of the learner. We propose two algorithms that work for different ranges of $r$. We show that after $T$ rounds in a […]

Ver mais

arXiv:2604.25158v1 Announce Type: new Abstract: Support vector machines (SVMs) are a standard tool for binary classification, but their classical formulations are purely data-driven and offer no direct way to encode trusted benchmark models or structured preferences on selected subsets of the data. We propose Elite-Driven Support Vector Machines (EDSVM), a general framework that augments regularized empirical risk minimization by guiding the slack variables for a curated set of elite observations (typically the union of support vectors from one […]

Ver mais

arXiv:2604.25025v1 Announce Type: new Abstract: Preference feedback, in the form of pairwise comparisons rather than scalar scores, has seen increasing use in applications such as human-, laboratory-, and expert-in-the-loop design, as well as scientific discovery. We propose a Thompson Sampling (TS) approach to Bayesian optimization with preferential feedback that models comparisons using a monotone link on latent utility differences and leverages the dueling kernel induced by a base kernel. We provide a finite-time analysis showing that the performance […]

Ver mais