Research
On-device research index

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.

168,657 papers · 148 categories

Trend · papers per month

54109163217 · Jun 202019922001200920172026
48 results for nonlinear embeddings

This paper tackles efficient optimization for nonlinear embeddings in similarity learning.

problem Learning similarity with nonlinear embeddings is challenging due to the large number of pairs.
method Detailed derivations and efficient optimization methods for nonlinear embeddings are developed.
result Efficient optimization methods for nonlinear embeddings are shown to be highly effective.

The paper analyzes and proposes an algorithm for multi-modal nonlinear embeddings with theoretical performance bounds.

problem Generalizability of multi-modal nonlinear embeddings to unseen data.
method Theoretical analysis and a multi-modal nonlinear representation learning algorithm motivated by performance bounds.
result The proposed algorithm yields promising performance in multi-modal image classification and cross-modal image-text retrieval applications.

QENDy learns quadratic dynamics from nonlinear systems data.

problem Identifying governing equations of highly nonlinear dynamical systems.
method QENDy embeds nonlinear dynamics into a quadratic feature space, requiring trajectory data and preselected basis functions.
result QENDy accurately identifies quadratic dynamics and outperforms SINDy and deep learning methods.

MMbeddings reduces categorical embeddings by treating them as latent effects, significantly decreasing parameters and mitigating overfitting.

problem Large cardinalities in categorical embeddings lead to high parameter counts and overfitting.
method MMbeddings treats embeddings as latent random effects in a variational autoencoder framework, reducing parameter count and mitigating overfitting.
result MMbeddings consistently outperforms traditional embeddings across various tasks, demonstrating its potential in machine learning applications.

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.

InfiniteWalk connects deep network embeddings to spectral graph theory with a nonlinear transformation.

problem Learning node representations from networks with deep learning methods.
method Study of the DeepWalk objective in the limit as window size goes to infinity, linking to spectral graph embeddings with a nonlinear transformation.
result Simple binary thresholding of the Laplacian pseudoinverse can approximate DeepWalk embeddings.

Identifying coordinate transformations that make strongly nonlinear dynamics approximately linear is a central challenge in modern dynamical systems. These transformations have the potential to enable prediction, estimation, and control of nonlinear systems using standard linear theory. The Koopman operator has emerged…

2017-12-27abs ↗pdf ↗

We present several principal bundles of embeddings of compact manifolds (with or without boundary) whose base manifolds are nonlinear Grassmannians. We study their infinite dimensional differential manifold structure in the Fréchet category. This study is motivated by the occurrence of such objects in the geometric Lag…

2014-02-06abs ↗pdf ↗

LNPE enhances local connections in embeddings using extended neighbor propagation.

problem Improving local connections and interactions in nonlinear dimensionality reduction.
method Inspired by GCN, LNPE extends 1-hop neighbors to n-hop neighbors in LLE.
result LNPE produces more faithful and robust embeddings with better topological and geometrical properties.

Stochastic neighbor embedding (SNE) and related nonlinear manifold learning algorithms achieve high-quality low-dimensional representations of similarity data, but are notoriously slow to train. We propose a generic formulation of embedding algorithms that includes SNE and other existing algorithms, and study their rel…

2012-06-18abs ↗pdf ↗

Kernel-spectral embedding learns low-dim. structures from noisy data.

problem Learning low-dimensional nonlinear structures from high-dimensional noisy data.
method Adaptive bandwidth spectral embedding using integral operators.
result Convergence to noiseless embeddings and eigenfunctions of integral operators.

A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.

problem Nonlinear functional regression in infinite-dimensional functional data analysis.
method Functional deep neural network with adaptive kernel embedding and projection steps.
result Explicit rates of approximating nonlinear smooth functionals are derived, and the network is shown to be effective in both simulated and real datasets.

We introduce a nonlinear method for directly embedding large, sparse, stochastic graphs into low-dimensional spaces, without requiring vertex features to reside in, or be transformed into, a metric space. Graph data and models are prevalent in real-world applications. Direct graph embedding is fundamental to many graph…

2019-06-13abs ↗pdf ↗

Meta-learning for Koopman spectral analysis with short time-series data.

problem Lack of long time-series for training embedding functions in Koopman spectral analysis.
method Meta-learning approach using bidirectional LSTM and neural network to estimate embedding functions from short time-series.
result The proposed method achieves better performance in eigenvalue estimation and future prediction compared to existing methods.

New methods for functional data analysis improve manifold methods for continuous data.

problem Challenges in evaluating embeddings for functional data.
method Transfer manifold methods from tabular and image data to functional data, define a theoretical framework, and propose nuanced evaluation strategies.
result Manifold methods can be successfully applied to functional data, but careful evaluation is needed.

While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly due to the necessary spectral decomposition step, which limits control over the…

2015-08-13abs ↗pdf ↗

FREDE efficiently embeds graphs using linear space and guarantees quality.

problem Efficiently embedding graphs with quality guarantees and linear space complexity.
method FREDE combines matrix sketching with a nonlinear transform of PageRank similarities to achieve linear space and quality guarantees.
result FREDE provides column-covariance approximation guarantees that are nearly as good as SVD, even with limited node similarities.

The study compares Euclidean and cosine distances in medical drug prescription prediction.

problem Comparing Euclidean and cosine distances in medical drug prescription prediction.
method Established geometric properties and compared distances in real-world medical data.
result Different distances lead to different optimizing nonlinear kernel embedding frameworks.

We construct an algebra of nonlinear generalized tensor fields on manifolds in the sense of J.-F. Colombeau, i.e., containing distributional tensor fields as a linear subspace and smooth tensor fields as a faithful subalgebra. The use of a background connection on the manifold allows for a simplified construction based…

2011-04-05abs ↗pdf ↗

The paper shows how to recover true node positions from a graph or similarity matrix.

problem Recovering true distances and positions from a graph or similarity matrix.
method Two steps: matrix factorisation followed by nonlinear dimension reduction.
result Nonlinear dimension reduction can recover latent positions close to a manifold where geodesic distance is encoded.

This paper lays the foundations for a nonlinear theory of differential geometry that is developed in a subsequent paper which is based on Colombeau algebras of tensor distributions on manifolds. We adopt a new approach and construct a global theory of algebras of generalised functions on manifolds based on the concept …

2019-10-08abs ↗pdf ↗

This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.

problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.

We examine the algebraic and geometric properties of a uni-directional GRU and word embeddings trained end-to-end on a text classification task. A hyperparameter search over word embedding dimension, GRU hidden dimension, and a linear combination of the GRU outputs is performed. We conclude that words naturally embed t…

2018-03-07abs ↗pdf ↗

Semantic word embeddings represent the meaning of a word via a vector, and are created by diverse methods. Many use nonlinear operations on co-occurrence statistics, and have hand-tuned hyperparameters and reweighting methods. This paper proposes a new generative model, a dynamic version of the log-linear topic model o…

2015-02-12abs ↗pdf ↗

We are concerned with underlying connections between fluids, elasticity, isometric embedding of Riemannian manifolds, and the existence of wrinkled solutions of the associated nonlinear partial differential equations. In this paper, we develop such connections for the case of two spatial dimensions, and demonstrate tha…

2016-05-10abs ↗pdf ↗

We present a new paradigm for speeding up randomized computations of several frequently used functions in machine learning. In particular, our paradigm can be applied for improving computations of kernels based on random embeddings. Above that, the presented framework covers multivariate randomized functions. As a bypr…

2016-04-25abs ↗pdf ↗

A method for estimating nonlinear regression errors and their distributions without performing regression is presented. Assuming continuity of the modeling function the variance is given in terms of conditional probabilities extracted from the data. For N data points the computational demand is N2. Comparing the predic…

2014-04-11abs ↗pdf ↗

We propose a new method for input variable selection in nonlinear regression. The method is embedded into a kernel regression machine that can model general nonlinear functions, not being a priori limited to additive models. This is the first kernel-based variable selection method applicable to large datasets. It sides…

2018-04-19abs ↗pdf ↗

This paper builds on the theory of generalised functions begun in [1]. The Colombeau theory of generalised scalar fields on manifolds is extended to a nonlinear theory of generalised tensor fields which is diffeomorphism invariant and has the sheaf property. The generalised Lie derivative for generalised tensor fields …

2019-10-08abs ↗pdf ↗

New algorithm learns Koopman operator online, with complexity control and convergence guarantees.

problem Online learning of Koopman operator for general nonlinear systems.
method Sparse online learning via stochastic approximation, RKHS action, CME operator.
result Provably convergent algorithm with finite-time guarantees in mis-specified setting.

Researchers solve a complex equation to embed graphs with negative curvature.

problem Embedding graphs in Rn+1\mathbb R^{n+1} with negative Gauss curvature.
method Solving a fully nonlinear Monge-Ampère equation using energy estimates and Nash-Moser iteration.
result Local solvability of the fully nonlinear equation for negative curvature.

A method for learning embeddings from multi-view data using Gromov-Wasserstein.

problem Challenges in learning low-dimensional representations from multi-view relational data with differing geometries.
method Bary-GWMDS and Mean-GWMDS-C, Gromov-Wasserstein-based methods operating on distance matrices.
result Stable and geometrically meaningful embeddings learned from synthetic and real-world datasets.