Related papers: New Discretization of Complex Analysis: The Euclid…
Multivariate signal processing is often based on dimensionality reduction techniques. We propose a new method, Dynamical Component Analysis (DyCA), leading to a classification of the underlying dynamics and - for a certain type of dynamics…
Canonical Correlation Analysis (CCA) is a method for feature extraction of two views by finding maximally correlated linear projections of them. Several variants of CCA have been introduced in the literature, in particular, variants based…
This work proposes a new approach to study transport properties of highly correlated local structures. The method, dubbed the Logarithmic Discretization Embedded Cluster Approximation (LDECA), consists of diagonalizing a finite cluster…
Following the previous authors works (joint with I.A.Dynnikov) we develop a theory of the discrete analogs of the differential-geometrical (DG) connections in the triangulated manifolds. We study a nonstandard discretization based on the…
Lattice geometry profoundly shapes physical phenomena such as subsystem symmetry and directed percolation (DP). Among various lattice geometries, hyperbolic lattices are characterized by constant negative curvature and non-Abelian…
This paper presents Deep Dynamic Probabilistic Canonical Correlation Analysis (D2PCCA), a model that integrates deep learning with probabilistic modeling to analyze nonlinear dynamical systems. Building on the probabilistic extensions of…
Augmenting algorithms with learned predictions is a promising approach for going beyond worst-case bounds. Dinitz, Im, Lavastida, Moseley, and Vassilvitskii~(2021) have demonstrated that a warm start with learned dual solutions can improve…
We develop a Non-Crossing Approximation (NCA) for the effective cluster problem of the recently developed Dynamical Cluster Approximation (DCA). The DCA technique includes short-ranged correlations by mapping the lattice problem onto a…
We consider multi-class classification problems for high dimensional data. Following the idea of reduced-rank linear discriminant analysis (LDA), we introduce a new dimension reduction tool with a flavor of supervised principal component…
Existing theoretical stabilization results for linear, hyperbolic multi-dimensional problems are extended to the discretized multi-dimensional problems. In contrast to existing theoretical and numerical analysis in the spatially…
Finding the similarities and differences between groups of datasets is a fundamental analysis task. For high-dimensional data, dimensionality reduction (DR) methods are often used to find the characteristics of each group. However, existing…
We build on the interpretation of the Economic Complexity method as Correspondence Analysis (CA), and propose that the Canonical form of CA (CCA), which originated in the ecology literature, can be used to calculate multi-dimensional…
The main idea of canonical correlation analysis (CCA) is to map different views onto a common latent space with maximum correlation. We propose a deep interpretable variational canonical correlation analysis (DICCA) for multi-view learning.…
The discrete Laplacian on Euclidean triangulated surfaces is a well-established notion. We introduce discrete Laplacians on spherical and hyperbolic triangulated surfaces. On the one hand, our definitions are close to the Euclidean one in…
Incorporating prior knowledge into a data-driven modeling problem can drastically improve performance, reliability, and generalization outside of the training sample. The stronger the structural properties, the more effective these…
A new approach to the problem of doubling is presented with the Dirac-Kahler (DK) theory as a starting point and using Geometric Discretisation providing us with a new way of extracting the Dirac field in the discrete setting of a…
The discrete-dipole approximation (DDA) is a flexible technique for computing scattering and absorption by targets of arbitrary geometry. In this paper we perform systematic study of various non-stationary iterative (conjugate gradient)…
This paper proposes a robust high-dimensional sparse canonical correlation analysis (CCA) method for investigating linear relationships between two high-dimensional random vectors, focusing on elliptical symmetric distributions. Traditional…
Canonical correlation analysis (CCA) is a classic statistical method for discovering latent co-variation that underpins two or more observed random vectors. Several extensions and variations of CCA have been proposed that have strengthened…
Principal Component Analysis (PCA) is one of the most important methods to handle high dimensional data. However, most of the studies on PCA aim to minimize the loss after projection, which usually measures the Euclidean distance, though in…