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

Trend · papers per month

2645287911,055 · Jun 202019922001200920172026
48 results for nonlinear generalization

For a system of second order differential equations we determine a nonlinear connection that is compatible with a given generalized Lagrange metric. Using this nonlinear connection, we can find the whole family of metric nonlinear connections that can be associated with a system of SODE and a generalized Lagrange struc…

2004-12-06abs ↗pdf ↗

Study of weighted nonlinear flags in symplectic geometry.

problem Understanding the geometry of weighted nonlinear flags.
method Generalizing weighted nonlinear Grassmannians to Frechet manifolds and using them to describe coadjoint orbits.
result Description of coadjoint orbits of Hamiltonian diffeomorphisms using weighted isotropic nonlinear flags.

New framework IIA identifies innovations in general nonlinear vector autoregressive processes.

problem Limited generality of NVAR models due to additive innovation assumption.
method Independent Innovation Analysis (IIA) framework, assuming mutual independence and modulation by an auxiliary variable.
result Guarantees identifiability of innovations with arbitrary nonlinearities, up to permutation and component-wise invertible nonlinearities.

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.

The main purposes of this article are to extend our previous results on homogeneous sprays to arbitrary (generalized) sprays, to show that locally diffeomorphic exponential maps can be defined for any (generalized) spray, and to give a (possibly nonlinear) covariant derivative for any (possibly nonlinear) connection. I…

2003-04-04abs ↗pdf ↗

Study solves inverse problems for equations with fractional nonlinearities.

problem Solving inverse problems for semilinear elliptic equations with fractional power nonlinearities.
method Higher order linearization method adapted for fractional order.
result Results of previous studies remain valid for general power nonlinearities.

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.

Paper presents a new backward deep BSDE method for solving nonlinear FBSDE problems.

problem Nonlinear Forward Backward Stochastic Differential Equations (FBSDE) with terminal conditions.
method Backward deep BSDE method applied to FBSDE with nonlinear generators and random initial conditions.
result Derives exact and Taylor-based approximations for time-stepping nonlinear BSDEs.

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.

The study sets limits on how well nonlinear models can generalize from training data.

problem Understanding the limits of generalization for nonlinear learning models.
method Deriving explicit generalization lower bounds for multi-layer neural networks and linear regression.
result Explicit bounds for general biased estimators in nonlinear networks, showing unacceptable performance for unbiased estimators.

This paper addresses the following question of neural network identifiability: Does the input-output map realized by a feed-forward neural network with respect to a given nonlinearity uniquely specify the network architecture, weights, and biases? Existing literature on the subject Sussman 1992, Albertini, Sontag et al…

2019-06-11abs ↗pdf ↗

Bayesian method improves predictions in overparameterized nonlinear regression.

problem Understanding overparameterization in nonlinear regression models.
method Bayesian framework with adaptive prior considering data spectral structure.
result Posterior contraction established for generalized linear and single-neuron models, demonstrating prediction consistency.

The geometry of the target space of an N=(2,2) supersymmetry sigma-model carries a generalized Kahler structure. There always exists a real function, the generalized Kahler potential K, that encodes all the relevant local differential geometry data: the metric, the B-field, etc. Generically this data is given by nonlin…

2007-02-16abs ↗pdf ↗

Develops a new method for nonlinear dimension reduction using random features.

problem Statistical challenges in generalizing Gaussian process-based latent variable models to non-Gaussian data.
method Random feature latent variable models (RFLVMs) that approximate nonlinear relationships with linear functions of random features.
result RFLVMs produce comparable results to state-of-the-art methods on various data types.

New methods generalize nonlinear ICA beyond structural sparsity.

problem Identify true latent sources from nonlinear mixtures without structural sparsity assumptions.
method Propose identifiability results for undercomplete, partial sparsity, and flexible grouping structures.
result Prove identifiability in general settings of undercompleteness, partial sparsity, and flexible grouping structures.

The paper studies fully nonlinear equations on Hermitian manifolds, proving existence and interior estimates.

problem Proving existence and interior estimates for fully nonlinear equations on Hermitian manifolds.
method Derives interior estimates and establishes the existence of smooth solutions for the Dirichlet problem and equations on closed manifolds.
result Derives interior estimates and establishes the existence of smooth solutions for the Dirichlet problem and equations on closed manifolds.

The paper provides a non-asymptotic error bound for linear system identification under nonlinear policies.

problem System identification for linear systems with nonlinear and/or time-varying policies under i.i.d. random excitation noises.
method Least square estimation with non-asymptotic error bound for bounded state and action trajectories.
result The error bound is consistent with linear policies and generalizes existing guarantees.

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.

The paper proves gradient estimates for nonlinear parabolic equations on smooth metric measure spaces.

problem Proving gradient estimates for nonlinear parabolic equations on smooth metric measure spaces.
method Using Souplet-Zhang type estimates and properties of Bakry-Emery Ricci tensor and weighted mean curvature.
result Gradient estimates for nonlinear parabolic equations on smooth metric measure spaces with Dirichlet boundary condition.

We discuss smooth nonlinear control systems with symmetry. For a free and proper action of the symmetry group, the reduction of symmetry gives rise to a reduced smooth nonlinear control system. If the action of the symmetry group is only proper, the reduced nonlinear control system need not be smooth. Using the smooth …

2003-05-06abs ↗pdf ↗

The paper provides gradient estimates for nonlinear heat-type equations on smooth metric measure spaces.

problem Proving gradient estimates for nonlinear heat-type equations on smooth metric measure spaces.
method Using Hamilton type and Li-Yau type estimates, the paper proves gradient estimates on positive solutions to generalized nonlinear parabolic equations on smooth metric measure spaces with compact boundary.
result Gradient estimates for nonlinear heat-type equations on smooth metric measure spaces.

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 development of algorithms for unsupervised pattern recognition by nonlinear clustering is a notable problem in data science. Markov clustering (MCL) is a renowned algorithm that simulates stochastic flows on a network of sample similarities to detect the structural organization of clusters in the data, but it has n…

2019-12-27abs ↗pdf ↗

The paper classifies solutions to a Liouville equation on a half-space with a specific boundary condition.

problem Classifying solutions to a Liouville equation with a nonlinear Neumann boundary condition.
method Analyzing the nn-Laplacian Liouville equation on the half-space R+n\mathbb{R}^{n}_{+} with positive nonlinear Neumann boundary condition.
result The classification of solutions extends previous results for n=2n=2 and p=np=n.

Generalizes memory and forecasting capacities for nonlinear recurrent networks with dependent inputs.

problem Understanding memory and forecasting capabilities in networks with dependent inputs.
method Formulated bounds for memory and forecasting capacities in terms of network size and input properties.
result Proved that memory capacity for linear recurrent networks with independent inputs is given by the rank of the controllability matrix.