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,694 papers · 148 categories

Trend · papers per month

64128191255 · Jun 202019922001200920172026
48 results for nonlinear transform

The paper examines how nonlinear transformations affect ridge sets in manifold learning.

problem Understanding the impact of nonlinear transformations on ridge sets in manifold learning.
method Examined the effects of nonlinear transformations on ridge sets using mathematical proofs and numerical experiments.
result The inclusion relationship $\cR(f\circ p)\subseteq \cR(p)$ holds for strictly increasing and concave transformations, and the Hausdorff distance between transformed and non-transformed ridge sets is smaller.

Random Transformers behave like polynomial models in ICL with asymptotic growth.

problem Understanding in-context learning capabilities of pretrained Transformers.
method Asymptotic analysis of a random Transformer with a fixed first layer and a trained second layer, considering growth in context length, input dimension, hidden dimension, and training parameters.
result The random Transformer's ICL error is equivalent to a finite-degree Hermite polynomial model.

Proposes σσ-PCA to learn identifiable linear transformations without whitening.

problem Cannot identify axes with equal variances in PCA.
method Unified model for linear and nonlinear PCA, introducing a missing piece to eliminate rotational indeterminacy.
result Eliminates subspace rotational indeterminacy in PCA.

SSMs combined with neural networks match Transformers in dynamic token selection.

problem Understanding the capabilities of SSMs in dynamic token selection.
method Exploring SSMs combined with fully connected neural networks.
result SSMs combined with nonlinear layers can efficiently solve challenging tasks and estimate functions.

The visibility transformation embeds data position into signature features for efficient pattern recognition.

problem Embedding absolute position into signature features for efficient pattern recognition.
method The visibility transformation is put on a theoretical footing and used to embed absolute position into signature features efficiently.
result The generated feature set simplifies pattern recognition by accommodating nonlinear functions of absolute and relative values.

DGPFM uses deep Gaussian processes to map functions accurately and quantify uncertainty.

problem Learning mappings between functional spaces, especially when data are noisy, sparse, or irregularly sampled.
method Constructs a sequence of GP-based linear and nonlinear transformations directly in function space, leveraging kernel integral transforms, GP conditional means, and nonlinear activations sampled from Gaussian processes.
result Empirical results show DGPFM outperforms existing methods in predictive accuracy and uncertainty calibration.

Transformations of macroeconomic data affect machine learning forecasts, especially with regularization and nonlinearity.

problem The impact of data transformations on machine learning forecasts in macroeconomic contexts.
method Review and propose new data transformations, empirically evaluate their effects, and compare traditional and moving average rotations.
result Traditional factors should almost always be included as predictors, and moving average rotations can provide important gains.

DTCCA learns nonlinear transformations of multi-view data for high-order correlation.

problem Learning complex nonlinear transformations of multiple data views.
method Maximizes high-order canonical correlation by jointly learning transformations of each view using a reformulated tensor decomposition.
result DTCCA efficiently handles high-dimensional and large number of views, overcoming scalability issues.

Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformati…

2019-03-21abs ↗pdf ↗

Generalizes Hasimoto transformation to arbitrary flows on space curves.

problem Modeling and analyzing wave motions on space curves.
method Develops a mapping between curve evolution and scalar equations, transforming general vector fields in the Frenet frame.
result Binormal flows are generally length preserving but bending energy is fragile.

New algorithm solves Schrödinger bridge problem with mismatched channels.

problem Solving Schrödinger bridge problem with input and noise channel mismatch.
method Design of a Sinkhorn recursion with memory for nonlinear PDEs.
result Demonstrates solving control-affine Schrödinger bridge problem.

SISR improves feature attribution in complex payoff schemes.

problem Distorted feature attributions due to non-additive payoff functions and high-dimensional feature spaces.
method Sparse Isotonic Shapley Regression (SISR) learns a monotonic transformation to restore additivity and enforces L0 sparsity.
result SISR achieves strong support recovery and stable attributions across various payoff schemes.

We examine Deep Canonically Correlated LSTMs as a way to learn nonlinear transformations of variable length sequences and embed them into a correlated, fixed dimensional space. We use LSTMs to transform multi-view time-series data non-linearly while learning temporal relationships within the data. We then perform corre…

2018-01-16abs ↗pdf ↗

In this paper, we propose novel strategies for neutral vector variable decorrelation. Two fundamental invertible transformations, namely serial nonlinear transformation and parallel nonlinear transformation, are proposed to carry out the decorrelation. For a neutral vector variable, which is not multivariate Gaussian d…

2017-05-30abs ↗pdf ↗

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.

New kinematic model for a spin-rolling sphere using Darboux frame.

problem Control and planning of an underactuated sphere on a plane.
method Darboux frame transformation to fully-actuated model.
result Underactuated sphere model transformed into fully-actuated model.

ADMM algorithm solves nonlinear matrix decompositions efficiently.

problem Nonlinear matrix decompositions for various applications.
method Alternating Direction Method of Multipliers (ADMM) for nonlinear matrix factorization.
result The method efficiently solves diverse nonlinear matrix decompositions.

New method preserves spectral clustering performance under aggressive sparsification and quantization.

problem Maintaining spectral clustering performance with sparse and quantized data.
method Random matrix theory applied to eigenspectrum changes under sparsification and quantization.
result Spectral clustering performance is preserved even with aggressive sparsification and quantization.

We present new extensions to a method for constructing several families of solvable one-dimensional time-homogeneous diffusions whose transition densities are obtainable in analytically closed-form. Our approach is based on a dual application of the so-called diffusion canonical transformation method that combines smoo…

2009-07-16abs ↗pdf ↗

NKI integrates obfuscated datasets using nonlinear kernels for improved data collaboration.

problem Privacy-preserving data collaboration with reduced reconstruction risk.
method Formulates linear kernel integration, kernelizes it, and introduces graph regularization and centering constraints.
result NKI improves classification accuracy over existing linear integration methods under nonlinear dimensionality reduction.

Transformers learn low-dimensional target functions efficiently in-context.

problem Efficiently learning nonlinear target functions in-context using transformers.
method Nonlinear MLP layer in transformers optimized by gradient descent, focusing on single-index target functions.
result Transformers can learn target functions with low-dimensional structures efficiently in-context.

Paper analyzes Transformer learning dynamics, proving benign landscape for in-context learning.

problem Understanding how Transformers learn in context with nonlinear features.
method Mean-field and two-timescale analysis of Transformer dynamics, proving nonconvex but benign landscape.
result Proves mean-field dynamics avoid saddle points, leading to improved optimization.

Transformer-based method for causal discovery with prior knowledge integration.

problem Complex nonlinear dependencies and spurious correlations in time series data.
method Multi-layer Transformer forecaster with gradient-based causal structure extraction and attention masking for prior knowledge integration.
result Significant improvement in causal discovery and causal lag estimation compared to state-of-the-art methods.

The paper introduces a new method for risk measurement using weak optimal transport.

problem Risk measurement in insurance and financial contexts.
method Convex risk measures with weak optimal transport penalties, explicit representation via nonlinear transform, computational aspects, and approximations using neural networks.
result Explicit representation and computational methods for risk measures.

Dual optimization connects ERM-fDR to normalization function.

problem Empirical risk minimization with f-divergence regularization.
method Dual formulation, Legendre-Fenchel transform, implicit function theorem, nonlinear ODE.
result Computational method to calculate normalization function efficiently.

Paper transforms a complex equation into simpler forms for analysis.

problem Analyzing a fourth-order dispersive flow equation on Kähler manifolds.
method Developed the generalized Hasimoto transformation to simplify the equation.
result Explicit expressions derived for three examples of compact Kähler manifolds.

Transformers with MLP heads outperform linear baselines in in-context learning.

problem Understanding in-context learning in Transformers with nonlinear MLP heads.
method Analyzing a model with two-layer MLPs trained via gradient steps and fully optimized, under high-dimensional asymptotics.
result Nonlinear MLPs enhance ICL performance, particularly on nonlinear tasks.

While conformal transformations of the plane preserve Laplace's equation, Lorentz-conformal mappings preserve the wave equation. We discover how simple geometric objects, such as quadrilaterals and pairs of crossing curves, are transformed under nonlinear Lorentz-conformal mappings. Squares are transformed into curvili…

2013-06-05abs ↗pdf ↗

MPTE uses Transformer attention to estimate mixed-frequency factor models.

problem Estimating factor models in panel datasets with mixed frequencies and nonlinear signals.
method Mixed-Panels-Transformer Encoder (MPTE) with attention mechanisms.
result MPTE achieves competitive performance in nonlinear forecasting environments.

Connections between integration along hypersufaces, Radon transforms, and neural networks are exploited to highlight an integral geometric mathematical interpretation of neural networks. By analyzing the properties of neural networks as operators on probability distributions for observed data, we show that the distribu…

2019-07-04abs ↗pdf ↗

We analyze and calculate the early exercise boundary for a class of stationary generalized Black-Scholes equations in which the volatility function depends on the second derivative of the option price itself. A motivation for studying the nonlinear Black Scholes equation with a nonlinear volatility arises from option p…

2017-07-02abs ↗pdf ↗

Transformers can approximate posterior predictive distributions through in-context learning.

problem Bayesian prediction tasks, especially beyond point predictions.
method Gradient descent algorithm targeting posterior predictive mean and variance, followed by nonlinear mappings.
result Transformers can implement algorithms to approximate posterior predictive distributions.

Shallow nonlinear networks can separate classes linearly with polynomially scaling width.

problem Understanding the linear separability of deep networks' features.
method Modeling inputs as a union of low-dimensional subspaces and using random weights and quadratic activations.
result Shallow nonlinear networks can achieve linear separation with polynomially scaling width.

The paper develops a computational method for efficient online filtering of diffusion processes.

problem Online filtering of discretely observed nonlinear diffusion processes.
method The approach involves Doob's hh-transforms approximated by solving backward Kolmogorov equations using nonlinear Feynman-Kac formulas and neural networks.
result The proposed method can be orders of magnitude more efficient than state-of-the-art particle filters.

Clarifies relation for solving control-affine Schrödinger bridge problems.

problem Solving control-affine Schrödinger bridge problems via Hopf-Cole transform.
method Applies Hopf-Cole transform to conditions of optimality, resulting in nonlinear PDEs.
result Generic control-affine Schrödinger bridge requires further algorithmic development.