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

Trend · papers per month

3927851,1771,569 · Jun 202019922001200920172026
48 results for nonlinear learning

The paper introduces a fast algorithm for learning and forecasting nonlinear dynamics from noisy time series data.

problem Challenges in capturing nonlinear dynamics from noisy time series data.
method A projected nonlinear state-space model with kernel functions applied to projected lines.
result The model effectively learns and forecasts complex nonlinear dynamics with computational efficiency.

Paper connects contrastive learning to MI maximization and establishes robust methods for nonlinear ICA and subspace estimation.

problem Understanding and improving unsupervised representation learning and density ratio estimation.
method The paper connects contrastive learning to MI maximization, establishes new recovery conditions for nonlinear ICA, and proposes a practical outlier-robust method for nonlinear subspace estimation.
result The proposed methods can be seen as maximizing MI, performing nonlinear ICA, or estimating nonlinear subspaces, and are robust to outliers.

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.

This paper reviews nonlinear ICA for disentangled representations in unsupervised learning.

problem Finding useful disentangled representations in unsupervised deep learning.
method Review of nonlinear ICA theory and algorithms for disentanglement.
result Nonlinear ICA can be shown to estimate useful disentangled representations.

CDSSL improves representation quality by integrating linear and nonlinear dependencies.

problem Scarcity of labeled data and neglect of nonlinear dependencies in SSL.
method CDSSL combines linear correlations and nonlinear dependencies using HSIC in RKHS.
result CDSSL enhances representation quality on diverse benchmarks.

DKLM learns adaptive kernels for robust nonlinear subspace clustering.

problem Nonlinear structures in data and challenges with kernel-based clustering.
method Data-driven kernel learning with adaptive weighting and optimal block-diagonal affinity matrix.
result DKLM enhances robustness and preserves manifold structure in nonlinear space.

Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.

problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.

The paper develops adaptive deep learning methods for nonlinear time series models.

problem Estimating mean functions of non-stationary and nonlinear time series models.
method Develops non-penalized and sparse-penalized DNN estimators for general non-stationary time series, derives minimax lower bounds, and shows the sparse-penalized DNN estimator is adaptive and optimal.
result Sparse-penalized DNN estimator achieves minimax optimal rates for many nonlinear AR models.

We introduce nonlinear higher-order label spreading for semi-supervised learning.

problem Efficient semi-supervised learning on graphs with complex label spreading.
method We add nonlinearity to label spreading through higher-order graph structures, proving convergence and demonstrating efficiency on various datasets.
result Our nonlinear higher-order label spreading algorithm converges to the global solution and performs favorably compared to classical methods.

New method learns nonlinear systems from single finite trajectory samples.

problem Learning stabilizable nonlinear systems from single finite trajectory samples.
method Gradient-based algorithms with noise-sensitive uniform convergence guarantees.
result Efficient learning of general nonlinear systems with high accuracy and small sample complexity.

Three-layer networks learn complex hierarchical polynomials of multiple nonlinear features.

problem Understanding how neural networks learn hierarchical features of multiple nonlinear inputs.
method Examine a broad class of functions using three-layer neural networks, showing complete recovery and efficient learning.
result Three-layer neural networks trained via gradient descent can learn hierarchical polynomials of multiple nonlinear features efficiently.

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.

Paper uses machine learning to uncover nonlinear dynamics in CAT bond pricing.

problem Traditional linear models miss nonlinear relationships in CAT bond pricing.
method Advanced machine learning techniques applied to CAT bond transaction records.
result Machine learning enhances CAT bond pricing accuracy and reveals complex risk interactions.

This paper analyzes a simplified strategy for nonlinear control using local linear models and iLQR updates.

problem Nonlinear policy optimization in control systems.
method Iterative estimation of local linear models and iLQR-like policy updates.
result Demonstrates polynomial sample complexity and overcomes exponential problem horizon dependence.

This research highlights the secrecy potential of nonlinear generative models and their all-or-nothing phase transition.

problem Secrecy potential of nonlinear generative models in statistical learning.
method Replica method to derive asymptotic normalized cross entropy and statistical decoupling of Bayesian estimator.
result Strictly nonlinear models exhibit an all-or-nothing phase transition, leading to perfect secrecy.

This paper analyzes the sample complexity of two timescale reinforcement learning algorithms.

problem Analyzing the sample complexity of two timescale reinforcement learning algorithms.
method Non-asymptotic analysis of linear and nonlinear TDC and Greedy-GQ algorithms under Markovian sampling with constant stepsize.
result The paper provides non-asymptotic convergence results for two timescale linear and nonlinear TDC and Greedy-GQ algorithms.

GD-VAEs learn dynamics from observations using geometric and topological information.

problem Learning parsimonious representations of nonlinear dynamics from observations.
method Develops data-driven methods incorporating geometric and topological information using Variational Autoencoders (VAEs).
result GD-VAEs provide methods for learning reduced dimensional representations of nonlinear dynamics.

Enhances learning of structured distributions using nonlinear denoising score matching.

problem Learning structured distributions from noisy data.
method Latent Nonlinear Denoising Score Matching (LNDSM) integrating nonlinear dynamics with VAE-based latent score matching.
result LNDSM achieves superior sample quality and variability compared to structure-agnostic methods.

Paper extends ICA to ISA with auxiliary variables for better speech representation learning.

problem Learning unsupervised speech representations with independent subspaces.
method Theoretical framework of nonlinear ISA with auxiliary variables.
result Proposes an algorithm to learn speech representations with independent subspaces.

The paper automates policy learning for nonlinear welfare criteria using machine learning and debiasing techniques.

problem Learning optimal policies from observational data with nonlinear welfare criteria.
method Modeling a nonlinear welfare criterion with a utility function, estimating propensity scores with machine learning, and using sieve approximations and cross-validation for model selection.
result The proposed policy learning method satisfies oracle inequalities, providing theoretical guarantees on performance.

Machine Learning improves macroeconomic forecasting by capturing nonlinearities.

problem Improving macroeconomic forecasting accuracy.
method Study four features (nonlinearities, regularization, cross-validation, loss function) in data-rich and data-poor environments.
result Nonlinearity is the key to improving forecasting accuracy.

New model combines ICA and HMM for unsupervised learning of nonstationary time series.

problem Manual segmentation of non-stationary data is computationally expensive and inaccurate.
method Combines Hidden Markov Model with nonlinear ICA for unsupervised learning.
result Proves identifiability of the model for general mixing nonlinearity.

We learn linear models from nonlinear systems using multiple trajectories and regularization.

problem Identifying linear models from data when the underlying dynamics are nonlinear.
method Multiple trajectories data acquisition followed by regularized least squares.
result Learn linearized dynamics with arbitrarily small error given enough samples.

Kernel VICReg improves SSL in RKHS, capturing nonlinear structures.

problem Limited ability of existing SSL methods to handle nonlinear dependencies.
method Kernel VICReg framework in RKHS, kernelizing VICReg objectives.
result Kernel VICReg mitigates representational collapse and improves performance.

Develops a framework for learning nonlinear operators using Mercer kernels.

problem Learning nonlinear operators between infinite-dimensional spaces.
method Stochastic approximation framework with Mercer operator-valued kernels.
result Establishes dimension-free polynomial convergence rates for nonlinear operator learning.

Optimizes exploration for nonlinear systems to learn controllers efficiently.

problem Learning optimal controllers for unknown nonlinear systems.
method Formally quantifies which parameters are most critical, and develops an algorithm to efficiently explore these parameters.
result Proves a near-instance-optimal rate for learning controllers.

New framework for identifying spatial data components using TP latent components.

problem Identifying complex dependencies in spatial data.
method Introduces a new nonlinear ICA framework with tt-process latent components and develops a learning and inference algorithm.
result Identifiability of TP independent components under general conditions and Gaussian Process limit.