GraLSP improves graph neural networks by incorporating local structural patterns.
arXiv research
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.
Trend · papers per month
GraphSTONE uses topic models to capture graph structures, improving GCN performance.
In the wake of recent advances in experimental methods in neuroscience, the ability to record in-vivo neuronal activity from awake animals has become feasible. The availability of such rich and detailed physiological measurements calls for the development of advanced data analysis tools, as commonly used techniques do …
New PCA method handles multiple datasets and detects sparse patterns robustly.
An image pattern can be represented by a probability distribution whose density is concentrated on different low-dimensional subspaces in the high-dimensional image space. Such probability densities have an astronomical number of local modes corresponding to typical pattern appearances. Related groups of modes can join…
EPNE models evolving network patterns for better predictions.
Enhances GNNs to better capture local graph structures.
Large bundles of myelinated axons, called white matter, anatomically connect disparate brain regions together and compose the structural core of the human connectome. We recently proposed a method of measuring the local integrity along the length of each white matter fascicle, termed the local connectome. If communicat…
In personalised decision making, evidence is required to determine whether an action (treatment) is suitable for an individual. Such evidence can be obtained by modelling treatment effect heterogeneity in subgroups. The existing interpretable modelling methods take a top-down approach to search for subgroups with heter…
node2coords learns interpretable graph node representations robust to graph perturbations.
We find empirically a characteristic sharp peak-flat trough pattern in a large set of commodity prices. We argue that the sharp peak structure reflects an endogenous inter-market organization, and that peaks may be seen as local ``singularities'' resulting from imitation and herding. These findings impose a novel strin…
The paper proposes a new algorithm to select subsets of training data for better accuracy and explainability.
New scoring rule predicts causal relations from data with selection bias.
To understand the structural dynamics of a large-scale social, biological or technological network, it may be useful to discover behavioral roles representing the main connectivity patterns present over time. In this paper, we propose a scalable non-parametric approach to automatically learn the structural dynamics of …
Unsupervised domain adaptation methods aim to alleviate performance degradation caused by domain-shift by learning domain-invariant representations. Existing deep domain adaptation methods focus on holistic feature alignment by matching source and target holistic feature distributions, without considering local feature…
A data-driven approach predicts morphological development under structural instability.
In the field of exploratory data mining, local structure in data can be described by patterns and discovered by mining algorithms. Although many solutions have been proposed to address the redundancy problems in pattern mining, most of them either provide succinct pattern sets or take the interests of the user into acc…
We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights on the graph gives a set of global coordinates on the space of circle patterns wi…
Quantum walks blend patterns into splines when averaged.
Four-dimensional scanning transmission electron microscopy (4D-STEM) of local atomic diffraction patterns is emerging as a powerful technique for probing intricate details of atomic structure and atomic electric fields. However, efficient processing and interpretation of large volumes of data remain challenging, especi…
Randomization helps verify if data mining results are due to inherent patterns.
We are interested in solving the multiple measurement vector (MMV) problem for instances, where the underlying sparsity pattern exhibit spatio-temporal structure motivated by the electroencephalogram (EEG) source localization problem. We propose a probabilistic model that takes this structure into account by generalizi…
LNUCB-TA improves MAB performance by dynamically adjusting exploration rates and recognizing spatiotemporal patterns.
Safe Pattern Pruning reduces pattern explosion in predictive pattern mining.
In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties -- the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on weighted graphs, an additional design challenge is to incorporate …
PSEUDo learns patterns in multivariate time series with locality-sensitive hashing and relevance feedback.
A new method predicts links better across various networks.
Enhances DGPs with adaptive RKHS Fourier features for better non-stationary pattern modeling.
Hashing detects anomalies in structured data efficiently.
The artificial neural network shows powerful ability of inference, but it is still criticized for lack of interpretability and prerequisite needs of big dataset. This paper proposes the Rule-embedded Neural Network (ReNN) to overcome the shortages. ReNN first makes local-based inferences to detect local patterns, and t…
The paper proposes a method to identify high-quality financial patterns using entropy.
This paper is the third in a series that researches the Morse Theory, gradient flows, concavity and complexity on smooth compact manifolds with boundary. Employing the local analytic models from \cite{K2}, for \emph{traversally generic flows} on -manifolds , we embark on a detailed and somewhat tedious study …
In many complex dynamical systems, artificial or natural, one can observe self-organization of patterns emerging from local rules. Cellular automata, like the Game of Life (GOL), have been widely used as abstract models enabling the study of various aspects of self-organization and morphogenesis, such as the emergence …
LLE produces unwanted results without regularization, which can be prevented with regularization.
A motif-based framework identifies local spillover structures in financial markets.
A new framework detects anomalies in structured data.
Symplectic forms match on circle pattern space.
RBM models reveal how hidden unit tail behavior affects pattern reconstruction.
Producing probabilistic forecasts for large collections of similar and/or dependent time series is a practically relevant and challenging task. Classical time series models fail to capture complex patterns in the data, and multivariate techniques struggle to scale to large problem sizes. Their reliance on strong struct…
New tensor framework connects Fisher information, hypergraphs, and multi-observable correlations.
Study circle patterns on tori, linking symplectic forms and homeomorphisms.
SigTime learns interpretable signatures from time series data.
Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.
New neural operators learn structured patterns efficiently.
The paper models musical motif transformations in Beethoven's works.
A new associative memory uses Sinkhorn divergence for efficient pattern retrieval.
This paper presents an efficient binarized algorithm for both learning and classification of human epileptic seizures from intracranial electroencephalography (iEEG). The algorithm combines local binary patterns with brain-inspired hyperdimensional computing to enable end-to-end learning and inference with binary opera…
Gene regulatory networks play a crucial role in controlling an organism's biological processes, which is why there is significant interest in developing computational methods that are able to extract their structure from high-throughput genetic data. A typical approach consists of a series of conditional independence t…