arXiv research

To detect the irregular trade behaviors in the stock market is the important problem in machine learning field. These irregular trade behaviors are obviously illegal. To detect these irregular trade behaviors in the stock market, data scientists normally employ the supervised learning techniques. In this paper, we empl…

The paper calculates graph Ricci curvature and finds properties of specific graph types.

TGNN4I model forecasts irregularly observed graph data using ODEs.

Machine learning methods such as convolutional neural networks (CNNs) are becoming an integral part of scientific research in many disciplines, spatial vector data often fail to be analyzed using these powerful learning methods because of its irregularities. With the aid of graph Fourier transform and convolution theor…

Proposes LSGP for better graph signal representation.

Paper reviews multi-way graph signal processing for tensor data.

Proposes GIB for recognizing informative subgraphs in graphs.

We present a novel and hierarchical approach for supervised classification of signals spanning over a fixed graph, reflecting shared properties of the dataset. To this end, we introduce a Convolutional Cluster Pooling layer exploiting a multi-scale clustering in order to highlight, at different resolutions, locally con…

Graph neural networks extend neural Bayes estimators to irregular spatial data.

The understanding of geographical reality is a process of data representation and pattern discovery. Former studies mainly adopted continuous-field models to represent spatial variables and to investigate the underlying spatial continuity/heterogeneity in the regular spatial domain. In this article, we introduce a more…

TK-GCN forecasts spatiotemporal dynamics using Koopman-enhanced graph convolutional networks.

Numerous pattern recognition applications can be formed as learning from graph-structured data, including social network, protein-interaction network, the world wide web data, knowledge graph, etc. While convolutional neural network (CNN) facilitates great advances in gridded image/video understanding tasks, very limit…

We explore the use of graph networks to deal with irregular-geometry detectors in the context of particle reconstruction. Thanks to their representation-learning capabilities, graph networks can exploit the full detector granularity, while natively managing the event sparsity and arbitrarily complex detector geometries…

Graph neural networks learn PDEs from sparse, irregular data.

New strategies improve multi-agent decision-making on irregular networks.

Research on graph representation learning has received a lot of attention in recent years since many data in real-world applications come in form of graphs. High-dimensional graph data are often in irregular form, which makes them more difficult to analyze than image/video/audio data defined on regular lattices. Variou…

Graph neural networks (GNNs) have been shown to replicate convolutional neural networks' (CNNs) superior performance in many problems involving graphs. By replacing regular convolutions with linear shift-invariant graph filters (LSI-GFs), GNNs take into account the (irregular) structure of the graph and provide meaning…

In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or words' embedding, represented by graphs. We present a formulation o…

We proposed a novel graph convolutional neural network that could construct a coarse, sparse latent point cloud from a dense, raw point cloud. With a novel non-isotropic convolution operation defined on irregular geometries, the model then can reconstruct the original point cloud from this latent cloud with fine detail…

We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited, which generalizes the bandlimited class and is similar to the globally smooth class. We then propose two recovery s…

Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of graph neural network architectures remains highly fragmented impeding the development of optimized …

Study on flat connections with controlled irregularity.

This paper explores different graph neural network functions to improve graph isomorphism.

Learning representation on graph plays a crucial role in numerous tasks of pattern recognition. Different from grid-shaped images/videos, on which local convolution kernels can be lattices, however, graphs are fully coordinate-free on vertices and edges. In this work, we propose a Gaussian-induced convolution (GIC) fra…

Investment returns naturally reside on irregular domains, however, standard multivariate portfolio optimization methods are agnostic to data structure. To this end, we investigate ways for domain knowledge to be conveniently incorporated into the analysis, by means of graphs. Next, to relax the assumption of the comple…

Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods for signal processing on graphs ignore the dimension of time, tr…

Scattering transforms are non-trainable deep convolutional architectures that exploit the multi-scale resolution of a wavelet filter bank to obtain an appropriate representation of data. More importantly, they are proven invariant to translations, and stable to perturbations that are close to translations. This stabili…

EDICT learns evidential distributions for irregular time series, improving predictions and uncertainty quantification.

With the developments of the last decade on complete constant mean curvature 1 (CMC 1) surfaces in the hyperbolic 3-space $H^3$, many examples of such surfaces are now known. However, most of the known examples have regular ends. (An end is irregular, resp. regular, if the hyperbolic Gauss map of the surface has an ess…

Graph signals offer a very generic and natural representation for data that lives on networks or irregular structures. The actual data structure is however often unknown a priori but can sometimes be estimated from the knowledge of the application domain. If this is not possible, the data structure has to be inferred f…

We show that there are no irregular Sasaki-Einstein structures on rational homology 5-spheres. On the other hand, using K-stability we prove the existence of continuous families of non-toric irregular Sasaki-Einstein structures on odd connected sums of $S^2 \times S^3$.

The paper studies complex affine structures near irregular singularities.

Study deformation spaces of irregular isomonodromy systems on Riemann surfaces.

Graph convolutional networks (GCNs) suffer from the irregularity of graphs, while more widely-used convolutional neural networks (CNNs) benefit from regular grids. To bridge the gap between GCN and CNN, in contrast to previous works on generalizing the basic operations in CNNs to graph data, in this paper we address th…

We construct a new five parameter family of constant mean curvature trinoids with two asymptotically Delaunay ends and one irregular end.

Many irregular domains such as social networks, financial transactions, neuron connections, and natural language constructs are represented using graph structures. In recent years, a variety of graph neural networks (GNNs) have been successfully applied for representation learning and prediction on such graphs. In many…

LLapDiff models irregular multivariate time series without step-by-step integration.

CRUs model irregular time series with continuous hidden states.

Develops neural network for directed hypergraphs for node classification.

This research introduces dynamic portfolio cuts using a spectral approach for graph-theoretic diversification.

For a complex polynomial in two variables we study the morphism induced in homology by the embedding of an irregular fiber in a regular neighborhood of it. We give necessary and sufficient conditions for this morphism to be injective, surjective. Particularly this morphism is an isomorphism if and only if the correspon…

The book is devoted to study so-called irregular subsets of the Grassmannian manifold $G^{n}_{k}(V)$ (this class of sets was introduced by author). In the previous variant of the book we restrict ourself only to the case when $V$ is an $n$-dimensional vector space under the field $R$. Now we consider irregular subsets …

ACSSM models irregular time series with continuous dynamics.

New graph convolution captures local features on non-Euclidean grids.

Superior performance and ease of implementation have fostered the adoption of Convolutional Neural Networks (CNNs) for a wide array of inference and reconstruction tasks. CNNs implement three basic blocks: convolution, pooling and pointwise nonlinearity. Since the two first operations are well-defined only on regular-s…

Neural Laplace Control tackles offline RL for continuous-time delayed systems with irregular observations.

Graphon pooling preserves spectral properties in GNNs, reducing overfitting.

daep learns from irregular, multimodal astronomical data.