High-dimensional partial differential equations (PDE) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment (CVA) models, or portfolio optimization models. The PDEs in such applications are high-dimensional as the dimension corresponds to the number …
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,742 papers · 148 categories
Trend · papers per month
48 results for “nonlinear dimensionality”
Paper uses low-dimensional sensor data analysis for better fault detection.
problem Fault detection in critical equipment using multivariate, nonlinear sensor data.
method Exploits t-SNE and KPCA for nonlinear dimension reduction and anomaly detection.
result Low-dimensional representations improve interpretability and edge processing in IoT.
Natural differential invariants and equivalence of third order nonlinear differential operatorsmath-ph
Study natural invariants for third order nonlinear operators on 2D manifolds.
problem Equivalence problem of third order nonlinear differential operators.
method Description of rational natural differential invariants.
result Application of natural invariants to equivalence problem.
EnSF improves accuracy in tracking high-dimensional nonlinear systems.
problem Low accuracy in high-dimensional, nonlinear filtering problems.
method Score-based diffusion model, mini-batch Monte Carlo estimator.
result EnSF outperforms state-of-the-art methods in tracking high-dimensional systems.
We solve a high-dimensional model where nonlinear autoencoders detect hidden structure missed by PCA.
problem Hidden structure in high-dimensional data not detected by PCA.
method Tractable spiked model with two latent factors, one visible and one uncorrelated.
result Nonlinear autoencoders can extract hidden structure missed by PCA, even if reconstruction loss is higher.
On the achievability of blind source separation for high-dimensional nonlinear source mixturesstat.ML
For many years, a combination of principal component analysis (PCA) and independent component analysis (ICA) has been used for blind source separation (BSS). However, it remains unclear why these linear methods work well with real-world data that involve nonlinear source mixtures. This work theoretically validates that…
Kernel-based Bayesian filter for nonlinear systems using infinite-dimensional operators.
problem Modeling and predicting nonlinear dynamical systems.
method Functional Bayesian perspective, reproducing kernel Hilbert space, Gaussian kernel.
result Effective approximation and accurate results for nonlinear systems.
This paper extends RMT for deep learning models beyond eigenvalues.
problem Challenges in high-dimensional, overparameterized ML models.
method Introduces High-dimensional Equivalent to analyze nonlinear models.
result Unified understanding of training and generalization in deep learning.
By using the geometric concept of PDEs with prescribed curvature representations, we show that the 1+2 dimensional Landau-Lifshitz equation is gauge equivalent to a 1+2 dimensional nonlinear Schrödinger-type system. From the nonlinear Schrödinger-type system, we construct blowing up -solutions to the 1+…
Proposes a method to reveal nonlinearities in tensor data.
problem Capturing nonlinear relationships in high-dimensional tensor data.
method Linear tensor projection method to maximize prediction accuracy.
result Effective in revealing nonlinear relationships in tensor data.
TRNN combines tensor geometry with neural network nonlinearity for HD data.
problem Modeling high-dimensional data with preserved tensor geometry and nonlinear interactions.
method Introduces TRNN that integrates tensor geometry and neural network nonlinearity.
result TRNN preserves tensor geometry while offering nonlinearity.
We introduce a data-driven order reduction method for nonlinear control systems, drawing on recent progress in machine learning and statistical dimensionality reduction. The method rests on the assumption that the nonlinear system behaves linearly when lifted into a high (or infinite) dimensional feature space where ba…
In this era of data deluge, many signal processing and machine learning tasks are faced with high-dimensional datasets, including images, videos, as well as time series generated from social, commercial and brain network interactions. Their efficient processing calls for dimensionality reduction techniques capable of p…
Nonlinear Sparse Generalized Canonical Correlation Analysis for Multi-view High-dimensional Datastat.ML
New methods integrate nonlinear, sparse, and multi-view aspects for high-dimensional data analysis.
problem Integrating nonlinear dependence, sparsity, and multi-view data in high-dimensional datasets.
method Proposes HSIC-SGCCA, SA-KGCCA, and TS-KGCCA methods for multi-view high-dimensional data analysis.
result HSIC-SGCCA outperforms competing methods in multi-view variable selection.
We propose a geometric setup to study analytic aspects of a variant of the super symmetric two-dimensional nonlinear sigma model. This functional extends the functional of Dirac-harmonic maps by gravitino fields. The system of Euler--Lagrange equations of the two-dimensional nonlinear sigma model with gravitino is calc…
We introduce a novel data-driven order reduction method for nonlinear control systems, drawing on recent progress in machine learning and statistical dimensionality reduction. The method rests on the assumption that the nonlinear system behaves linearly when lifted into a high (or infinite) dimensional feature space wh…
IKD uses eigen-decomposition for nonlinear dimensionality reduction.
problem Lack of sophisticated and nonlinear dimensionality reduction methods.
method Inverse Kernel Decomposition (IKD) based on eigen-decomposition of sample covariance matrix.
result IKD achieves comparable performance to optimization-based methods with faster running speeds.
Energy-Based Control of Nonlinear Infinite-Dimensional Port-Hamiltonian Systems with Dissipationmath.OC
In this paper, we consider nonlinear PDEs in a port-Hamiltonian setting based on an underlying jet-bundle structure. We restrict ourselves to systems with 1-dimensional spatial domain and 2nd-order Hamiltonian including certain dissipation models that can be incorporated in the port- Hamiltonian framework by means of a…
Feature Learning for Nonlinear Dimensionality Reduction toward Maximal Extraction of Hidden Patternscs.LG
FEALM learns features for better nonlinear DR of hidden patterns.
problem DR misses important patterns on distorted manifolds.
method FEALM generates optimized projections using an optimization algorithm and neighbor-shape dissimilarity.
result FEALM captures important patterns on hidden manifolds.
Novel autoencoder method approximates Koopman operator in low dimensions.
problem Challenges in approximating finite Koopman operators using data-driven methods.
method Mori-Zwanzig autoencoder (MZ-AE) for robust Koopman operator approximation.
result Improved predictive capability and robust long-term statistical performance.
For a -dimensional spin manifold with a fixed spin structure and a spinor bundle , we prove an -regularity theorem for weak solutions to the nonlinear Dirac equation of cubic nonlinearity. This, in particular, answers a regularity question raised by Chen-Jost-Wang when .
A new flow-based Bayesian filter tackles high-dimensional nonlinear stochastic systems.
problem Bayesian filtering for high-dimensional nonlinear systems is challenging due to non-Gaussian distributions and computational limitations.
method Integrates normalizing flows to construct a latent linear state-space model with efficient density estimation and sampling.
result Demonstrates superior accuracy and efficiency in numerical experiments.
We simplify complex regression coefficients using linearization and feature comparison.
problem Interpreting high-dimensional regression coefficients from nonlinear responses.
method Developed a linearization method to derive feature coefficients and compare them with regression coefficients.
result Shows how regression coefficients relate to linearized feature coefficients and how they change under regularization.
Robust method learns nonlinear structures robustly to noise.
problem Learning nonlinear structures in noisy data.
method Robust Non-Linear Matrix Factorization (RNLMF).
result RNLMF achieves noticeable improvements in denoising and clustering.
PGPCA improves PCA for nonlinear data in neuroscience.
problem Nonlinear data distribution in neuroscience.
method Developed PGPCA for nonlinear manifolds, incorporating EM algorithm.
result PGPCA outperforms PPCA in modeling data around nonlinear manifolds.
Sharp Lipschitz bounds and gradient estimates for fully nonlinear parabolic equations.
problem Understanding moduli of continuity for fully nonlinear parabolic equations.
method Proving moduli of continuity of viscosity solutions are subsolutions of one-dimensional parabolic equations.
result Sharp Lipschitz bounds and gradient estimates for fully nonlinear parabolic equations with bounded initial data.
In this paper, we address the problem of hidden common variables discovery from multimodal data sets of nonlinear high-dimensional observations. We present a metric based on local applications of canonical correlation analysis (CCA) and incorporate it in a kernel-based manifold learning technique.We show that this metr…
The Bäcklund problem is solved for both the compact and noncompact versions of the Ishimori (2+1)-dimensional nonlinear spin model. In particular, a realization of the arising Bäcklund algebra in the form of an infinite-dimensional loop Lie algebra of the Kač--Moody type is provided.
Letter analyzes training dynamics of a nonlinear contrastive learning model in high dimensions.
problem Understanding training dynamics of nonlinear contrastive learning models in high-dimensional settings.
method High-dimensional analysis using McKean-Vlasov PDEs and low-dimensional ODEs.
result The model's performance evolves according to specific ODEs, revealing features like feature learnability and noise effects.
The approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the curse of dimensionality by embedding the nonlinear feature space into a low dim…
MediEncoder: Nonlinear Representation Learning for High-Dimensional Causal Mediation Analysisstat.ME
MediEncoder learns nonlinear representations for causal mediation analysis.
problem High-dimensional noisy covariates and mediators in biomedical studies.
method Coupled encoder-decoder architecture with cross-factor network.
result Improves estimation accuracy in high-dimensional causal mediation analysis.
A new DDR framework learns low-dimensional data representations using dynamical systems.
problem Learning efficient low-dimensional data representations.
method DDR framework based on nonlinear dynamical systems, using linear combinations of functions and regularization.
result DDR method outperforms other methods on synthetic and real datasets.
AdaKoop efficiently models nonlinear dynamics from nonstationary data streams.
problem Capturing nonlinear dynamics in nonstationary data streams with computational efficiency.
method Koopman operator theory and probabilistic framework for streaming data.
result AdaKoop outperforms state-of-the-art methods in real-time forecasting accuracy and efficiency.
Paper confirms Thom's conjecture for nonlinear evolutions on manifolds.
problem Thom's gradient conjecture for nonlinear evolution equations.
method Extending and settling the conjecture in infinite dimensional problems using Łojasiewicz, L. Simon, and Kurdyka-Mostowski-Parusinski's foundational works.
result Uniqueness of the limiting direction and characterization of convergence rates for both classical and infinite dimensional settings.
Researchers prove a nonlinear gluing theorem for gravitational fields near static backgrounds.
problem Proving a nonlinear gluing theorem for gravitational fields near static backgrounds.
method Proved a nonlinear characteristic -gluing theorem for vacuum gravitational fields in Bondi gauge.
result Generalized the -gluing theorem near light cones to a wider class of hypersurfaces.
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.
Stacked Kernel Networkstat.ML
Kernel methods are powerful tools to capture nonlinear patterns behind data. They implicitly learn high (even infinite) dimensional nonlinear features in the Reproducing Kernel Hilbert Space (RKHS) while making the computation tractable by leveraging the kernel trick. Classic kernel methods learn a single layer of nonl…
Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good kernel has to be chosen. Picking a good kernel is a very challenging problem in its…
The paper uses machine learning to forecast macroeconomic outcomes with high-dimensional data.
problem Forecasting the full conditional distribution of macroeconomic outcomes.
method Systematically integrating three key principles: high-dimensional data with regularization, rigorous out-of-sample validation, and incorporating nonlinearities.
result Regularization via shrinkage is essential to control model complexity, while nonlinearities yield limited improvements in predictive accuracy.
Improved generative models learn structured data better.
problem Training score-based generative models for structured data.
method Nonlinear denoising score matching with neural control variates.
result Enhanced learning of multimodal and symmetric data.
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.
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…
PSMF factorizes time-varying datasets into a dictionary and time-varying coefficients.
problem Factorizing time-varying and non-stationary datasets with temporal nonlinearities.
method Probabilistic Sequential Matrix Factorization (PSMF) using nonlinear Gaussian state-space models and approximate extended Kalman filtering.
result PSMF can account for temporal nonlinearities and estimate generic subspace models.
Develops VAEs for learning complex physical systems from data.
problem Learning low-dimensional representations of nonlinear physical systems.
method Variational Autoencoders with manifold latent spaces.
result Effective in learning nonlinear Burgers equation and constrained mechanical systems.
Adaptive algorithm improves nonlinear data assimilation for non-Gaussian systems.
problem Challenges of non-Gaussian statistics in data assimilation.
method Triangular measure transport with P-spline basis functions and an information criterion.
result Automatic selection of parsimonious parametrization for efficient adaptation.
Projected Gradient Descent Algorithms for Solving Nonlinear Inverse Problems with Generative Priorsstat.ML
PGD algorithms solve nonlinear inverse problems with generative priors using noisy measurements.
problem Signal estimation from noisy nonlinear measurements with generative priors.
method Projected gradient descent algorithms for two cases: unknown and known nonlinearity.
result PGD algorithms converge linearly to optimal statistical rates using arbitrary initialization.
This paper considers improved forecasting in possibly nonlinear dynamic settings, with high-dimension predictors ("big data" environments). To overcome the curse of dimensionality and manage data and model complexity, we examine shrinkage estimation of a back-propagation algorithm of a deep neural net with skip-layer c…
We establish a one-parameter family of Harnack inequalities connecting the constrained trace Li-Yau differential Harnack inequality for a nonlinear parabolic equation to the constrained trace Chow-Hamilton Harnack inequality for this nonlinear equation with respect to evolving metrics related to Ricci flow on a 2-dimen…