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.
Non-linear Hopf manifolds can be embedded into linear ones and admit LCK metrics.
Linear autoregressive models serve as basic representations of discrete time stochastic processes. Different attempts have been made to provide non-linear versions of the basic autoregressive process, including different versions based on kernel methods. Motivated by the powerful framework of Hilbert space embeddings o…
This paper introduces an acceleration structure for hyperbolic embeddings.
Non linear sigma models are quantum field theories describing, in the large deviations sense, random fluctuations of harmonic maps between a Riemann surface and a Riemannian manifold. Via their formal renormalization group analysis, they provide a framework for possible generalizations of the Hamilton-Perelman Ricci fl…
Graph embedding learns low-dimensional representations for nodes in a graph and effectively preserves the graph structure. Recently, a significant amount of progress has been made toward this emerging research area. However, there are several fundamental problems that remain open. First, existing methods fail to preser…
Veronese webs are rich geometric structures with deep relationships to various domains of mathematics. The PDEs which determine the Veronese web are overdetermined if dim >3, but in the case dim =3 they reduce to a special flavor of a non-linear wave equation. The symmetries embedded in the definition of a Veronese web…
LOCA learns standardized data coordinates from measurements.
We introduce a new distance metric for non-linear embeddings of Tempered Exponential Measures.
Unified framework for non-linear attention using modern Hopfield networks.
We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density function over a measurable space. Furthermore, we analyze the connection between th…
A new method estimates rare failure events in complex systems.
The paper generalizes equivariant neural networks on homogeneous spaces to the non-linear setting.
SAFLe solves federated learning's trade-off between non-linearity and scalability.
Proves local isometric embedding of low-differentiability metrics in 3D space.
The local linear embedding algorithm (LLE) is a non-linear dimension-reducing technique, widely used due to its computational simplicity and intuitive approach. LLE first linearly reconstructs each input point from its nearest neighbors and then preserves these neighborhood relations in the low-dimensional embedding. W…
Broadens Jourdain and Martini's method to non-linear stochastic processes.
Improved CAEs reduce training time and enhance generalization.
Network embedding is the process of learning low-dimensional representations for nodes in a network, while preserving node features. Existing studies only leverage network structure information and focus on preserving structural features. However, nodes in real-world networks often have a rich set of attributes providi…
We present function preserving projections (FPP), a scalable linear projection technique for discovering interpretable relationships in high-dimensional data. Conventional dimension reduction methods aim to maximally preserve the global and/or local geometric structure of a dataset. However, in practice one is often mo…
A new method for creating simpler models from complex ones.
Matrix completion works well for smooth non-linear structures, even without low-rank assumptions.
This work develops methods to analyze data on curved spaces using deep learning.
A basic problem in machine learning is to find a mapping from a low dimensional latent space to a high dimensional observation space . Modern tools such as deep neural networks are capable to represent general non-linear mappings. A learner can easily find a mapping which perfectly fits a…
Diffusion maps are an emerging data-driven technique for non-linear dimensionality reduction, which are especially useful for the analysis of coherent structures and nonlinear embeddings of dynamical systems. However, the computational complexity of the diffusion maps algorithm scales with the number of observations. T…
We propose to formulate multi-label learning as a estimation of class distribution in a non-linear embedding space, where for each label, its positive data embeddings and negative data embeddings distribute compactly to form a positive component and negative component respectively, while the positive component and nega…
In machine learning or statistics, it is often desirable to reduce the dimensionality of a sample of data points in a high dimensional space . This paper introduces a dimensionality reduction method where the embedding coordinates are the eigenvectors of a positive semi-definite kernel obtained as the sol…
Improves hierarchical clustering in Euclidean space using autoencoders.
We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension. Our technique consists of partitioning the space into simplices and then embedding the data points into features corresponding to the simplices' barycentric coordinates. We then …
One-hot CNN (convolutional neural network) has been shown to be effective for text categorization (Johnson & Zhang, 2015). We view it as a special case of a general framework which jointly trains a linear model with a non-linear feature generator consisting of `text region embedding + pooling'. Under this framework, we…
A simple framework Probabilistic Multi-view Graph Embedding (PMvGE) is proposed for multi-view feature learning with many-to-many associations so that it generalizes various existing multi-view methods. PMvGE is a probabilistic model for predicting new associations via graph embedding of the nodes of data vectors with …
Network embedding represents nodes in a continuous vector space and preserves structure information from the Network. Existing methods usually adopt a "one-size-fits-all" approach when concerning multi-scale structure information, such as first- and second-order proximity of nodes, ignoring the fact that different scal…
Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinates that describe the data manifold. The coordinates returned by the embedding algorithm are abstract, and finding their physical or domain-r…
Modeling dynamical systems is important in many disciplines, e.g., control, robotics, or neurotechnology. Commonly the state of these systems is not directly observed, but only available through noisy and potentially high-dimensional observations. In these cases, system identification, i.e., finding the measurement map…
This study compares mtl architectures for renewable power generation forecasting.
In this paper, we generalize the famous Hasimoto's transformation by showing that the dynamics of a closed unidimensional vortex filament embedded in a three-dimensional manifold of constant curvature gives rise under Hasimoto's transformation to the non-linear Schrodinger equation. We also give a natural interpretatio…
New insights into tSNE for large datasets.
In this paper, benefiting from the strong ability of deep neural network in estimating non-linear functions, we propose a discriminative embedding function to be used as a feature extractor for clustering tasks. The trained embedding function transfers knowledge from the domain of a labeled set of morphologically-disti…
The paper studies how adding an ℓ2 penalty affects network embeddings.
We discuss from a geometric point of view the connection between the renormalization group flow for non--linear sigma models and the Ricci flow. This offers new perspectives in providing a geometrical landscape for 2D quantum field theories. In particular we argue that the structure of Ricci flow singularities suggests…
In recent years, manifold learning has become increasingly popular as a tool for performing non-linear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity that aim to recover man ifold geometry using either local or global features of the data. Building on t…
Variational auto-encoder frameworks have demonstrated success in reducing complex nonlinear dynamics in molecular simulation to a single non-linear embedding. In this work, we illustrate how this non-linear latent embedding can be used as a collective variable for enhanced sampling, and present a simple modification th…
Reduced modeling of a computationally demanding dynamical system aims at approximating its trajectories, while optimizing the trade-off between accuracy and computational complexity. In this work, we propose to achieve such an approximation by first embedding the trajectories in a reproducing kernel Hilbert space (RKHS…
Visual summarization of clinical data collected on patients contained within the electronic health record (EHR) may enable precise and rapid triage at the time of patient presentation to an emergency department (ED). The triage process is critical in the appropriate allocation of resources and in anticipating eventual …
The widespread availability of electronic health records (EHRs) promises to usher in the era of personalized medicine. However, the problem of extracting useful clinical representations from longitudinal EHR data remains challenging. In this paper, we explore deep neural network models with learned medical feature embe…
Generalizing the canonical symplectization of contact manifolds, we construct an infinite dimensional non-linear Stiefel manifold of weighted embeddings into a contact manifold. This space carries a symplectic structure such that the contact group and the group of reparametrizations act in a Hamiltonian fashion with eq…
A new method for fair representation learning using PLS.
The paper proves local isometric embeddings for singular metrics near a point.
Networks are ubiquitous structure that describes complex relationships between different entities in the real world. As a critical component of prediction task over nodes in networks, learning the feature representation of nodes has become one of the most active areas recently. Network Embedding, aiming to learn non-li…