A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Improved simulation of phase transitions using hierarchical autoregressive networks.
Study on detecting hierarchical community structures in networks.
Diffusion models reveal a phase transition in reconstructing high-level features.
Sharp theory of neural network scaling laws for hierarchical targets.
A long user history inevitably reflects the transitions of personal interests over time. The analyses on the user history require the robust sequential model to anticipate the transitions and the decays of user interests. The user history is often modeled by various RNN structures, but the RNN structures in the recomme…
A new model separates persistence and transition priors in HDP-HMM.
We study the crash dynamics of the Warsaw Stock Exchange (WSE) by using the Minimal Spanning Tree (MST) networks. We find the transition of the complex network during its evolution from a (hierarchical) power law MST network, representing the stable state of WSE before the recent worldwide financial crash, to a superst…
We find numerical and empirical evidence for dynamical, structural and topological phase transitions on the (German) Frankfurt Stock Exchange (FSE) in the temporal vicinity of the worldwide financial crash. Using the Minimal Spanning Tree (MST) technique, a particularly useful canonical tool of the graph theory, two tr…
Diffusion models reveal latent hierarchical structure in data.
Deep neural networks undergo hierarchical free-energy landscape transitions with increasing data size.
VTA learns hierarchical temporal structure for sequential data.
We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree polynomial which depends on at most inputs, counting at most monomial terms, which minimizes the sum of the squares of its prediction errors. The previous hierarchical sparse specification aligns w…
A hierarchical model shows how scaling laws emerge from sequential feature recovery.
Hierarchical RL simplifies exploration in RL tasks.
Deep networks, composed of multiple layers of hierarchical distributed representations, tend to learn low-level features in initial layers and transition to high-level features towards final layers. Paradigms such as transfer learning, multi-task learning, and continual learning leverage this notion of generic hierarch…
E-learning systems are capable of providing more adaptive and efficient learning experiences for students than the traditional classroom setting. A key component of such systems is the learning strategy, the algorithm that designs the learning paths for students based on information such as the students' current progre…
Model improves robustness of neural network sequences without transition failures.
We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model (iHMM) that supports a simple, efficient inference scheme. The siHMM is well suited to segmentation problems, where the goal is to identify points at which a time series transitions from one relatively stable regime to a new regime. Conv…
PALM learns abstract models for efficient planning and task transfer.
We develop dependent hierarchical normalized random measures and apply them to dynamic topic modeling. The dependency arises via superposition, subsampling and point transition on the underlying Poisson processes of these measures. The measures used include normalised generalised Gamma processes that demonstrate power …
Continuous semi-implicit models enable faster training and better performance in generative modeling.
We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between "nearby" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pai…
Proves efficient learning of hierarchical structure in meta-reinforcement learning.
Paper proposes a new AI design philosophy for distributed learning.
We address the problem of analyzing sets of noisy time-varying signals that all report on the same process but confound straightforward analyses due to complex inter-signal heterogeneities and measurement artifacts. In particular we consider single-molecule experiments which indirectly measure the distinct steps in a b…
Symmetry unifies AI learning dynamics, complexity, and representation.
The stability of money value is an important requisite for a functioning economy, yet it critically depends on the actions of participants in the market themselves. Here we model the value of money as a dynamical variable that results from trading between agents. The basic trading scenario can be recast into an Ising t…
Hierarchical nucleation patterns emerge in deep neural network layers.
New method detects changes in complex models using hierarchical latent-class models.
New origami structures adapt to over 100 shapes with minimal actuation.
Proposes a new RNN for language generation capturing long-range dependencies.
Develops a more flexible HDP-HMM for temporal data segmentation.
Superstatistics is a widely employed tool of non-equilibrium statistical physics which plays an important role in analysis of hierarchical complex dynamical systems. Yet, its "canonical" formulation in terms of a single nuisance parameter is often too restrictive when applied to complex empirical data. Here we show tha…
We present the Infinite Latent Events Model, a nonparametric hierarchical Bayesian distribution over infinite dimensional Dynamic Bayesian Networks with binary state representations and noisy-OR-like transitions. The distribution can be used to learn structure in discrete timeseries data by simultaneously inferring a s…
Sharp feature transitions revealed in extensive-width networks.
This paper investigates generalisation in multi-agent games, where the generality of the agent can be evaluated by playing against opponents it hasn't seen during training. We propose two new games with concealed information and complex, non-transitive reward structure (think rock/paper/scissors). It turns out that mos…
The successful application of general reinforcement learning algorithms to real-world robotics applications is often limited by their high data requirements. We introduce Regularized Hierarchical Policy Optimization (RHPO) to improve data-efficiency for domains with multiple dominant tasks and ultimately reduce require…
One of the challenges in model-based control of stochastic dynamical systems is that the state transition dynamics are involved, and it is not easy or efficient to make good-quality predictions of the states. Moreover, there are not many representational models for the majority of autonomous systems, as it is not easy …
Using movement primitive libraries is an effective means to enable robots to solve more complex tasks. In order to build these movement libraries, current algorithms require a prior segmentation of the demonstration trajectories. A promising approach is to model the trajectory as being generated by a set of Switching L…
The probability of default (PD) estimation is an important process for financial institutions. The difficulty of the estimation depends on the correlations between borrowers. In this paper, we introduce a hierarchical Bayesian estimation method using the beta binomial distribution and consider a multi-year case with a …
New approach for large-scale distributed learning systems that improve generalization performance.
New model improves cancer screening prediction accuracy.
This paper proposes a new approach to Transformers by integrating hierarchical associative memory with MetaFormers.
Representation of human actions as a sequence of human body movements or action attributes enables the development of models for human activity recognition and summarization. We present an extension of the low-rank representation (LRR) model, termed the clustering-aware structure-constrained low-rank representation (CS…
The paper models reciprocity in interbank markets using a statistical null model.
A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST …
Genetic sequence data are well described by hidden Markov models (HMMs) in which latent states correspond to clusters of similar mutation patterns. Theory from statistical genetics suggests that these HMMs are nonhomogeneous (their transition probabilities vary along the chromosome) and have large support for self tran…
New method estimates and samples high-dimensional probability distributions avoiding optimization and approximation curse.