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

214429643857 · Jun 202019922001200920172026
48 results for nonlinear sets

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.

In this paper we provide a characterization of second order fully nonlinear CR invariant equations on the Heisenberg group, which is the analogue in the CR setting of the result proved in the Euclidean setting by A. Li and the first author (2003). We also prove a comparison principle for solutions of second order fully…

2010-10-30abs ↗pdf ↗

We consider a stochastic control problem for a class of nonlinear kernels. More precisely, our problem of interest consists in the optimisation, over a set of possibly non-dominated probability measures, of solutions of backward stochastic differential equations (BSDEs). Since BSDEs are nonlinear generalisations of the…

2015-10-28abs ↗pdf ↗

Linear principal component analysis (PCA) can be extended to a nonlinear PCA by using artificial neural networks. But the benefit of curved components requires a careful control of the model complexity. Moreover, standard techniques for model selection, including cross-validation and more generally the use of an indepe…

2012-04-03abs ↗pdf ↗

Proposes a new derivative concept for nonlinear DRO problems.

problem Optimizing nonlinear functions in probability space with distributionally robust optimization.
method Introduces Gateaux derivative for smoothness and proposes a Frank-Wolfe algorithm.
result Validates theoretical results on portfolio selection problems with numerical validation.

Greedy MI maximization method outperforms existing approaches in nonlinear models.

problem Maximizing mutual information in nonlinear models with non-Gaussian noise.
method Greedy approaches based on log-Sobolev inequalities for computationally inexpensive MI lower bounds.
result Proposed method outperforms random selection and Gaussian approximations.

Proposes a new method for nonlinear Bayesian updates using ensemble kernel regression.

problem Nonlinear and non-Gaussian Bayesian updates for complex systems.
method Combines Kalman filtering for observed components and kernel density estimation for unobserved components, with subsampling and clustering.
result Reduces estimation errors in highly nonlinear scenarios compared to standard linear updates.

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.

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.

Proposes a new method for nonlinear models with robustness guarantees.

problem Distributional robustness in nonlinear models with causality.
method Representation learning and identifiable representation learning.
result First causality-inspired robustness method with finite-radius guarantees in nonlinear settings.

Sublinear functionals of random variables are known as sublinear expectations; they are convex homogeneous functionals on infinite-dimensional linear spaces. We extend this concept for set-valued functionals defined on measurable set-valued functions (which form a nonlinear space), equivalently, on random closed sets. …

2019-03-12abs ↗pdf ↗

Estimates input from output of nonlinear systems using ANN.

problem Estimating unknown compositional input from system output.
method Artificial Neural Networks (ANNs) for nonlinear system inversion.
result ANNs can compete with optimal bounds for linear systems and demonstrate promising results for nonlinear systems.

New algorithm tackles stochastic optimization with inequality constraints.

problem Stochastic optimization with inequality constraints in various applications.
method Active-set stochastic sequential quadratic programming (StoSQP) with a differentiable exact augmented Lagrangian.
result Global convergence for any initialization, KKT residuals converge to zero almost surely.

Solves geometric problems using fully nonlinear equations and Morse theory.

problem Geometric problems, specifically Loewner-Nirenberg and Yamabe problems.
method Investigates structure of fully nonlinear equations and applies Morse theory techniques.
result Constructs admissible metrics under weak conditions and demonstrates topological obstructions.

The paper introduces reservoir computing models for complex systems.

problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.

Unified analysis for nonlinear parametric models in Bayesian optimization.

problem Limited theoretical guarantees for nonlinear parametric models in Bayesian optimization.
method Kernel-based framework for analyzing regularized nonlinear parametric models trained on adaptively collected data.
result Unified convergence guarantees for nonlinear acquisition and surrogate models.

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.

To a system of second order ordinary differential equations (SODE) one can assign a canonical nonlinear connection that describes the geometry of the system. In this work we develop a geometric setting that allows us to assign a canonical nonlinear connection also to a system of higher order ordinary differential equat…

2010-11-26abs ↗pdf ↗

Guaranteed reachable set for unknown nonlinear systems on manifolds.

problem Determining reachable set for unknown nonlinear systems on manifolds.
method Underapproximations of reachable set using local dynamics and bounds on dynamics rate of change.
result Guaranteed set of reachable states for systems on complete Riemannian manifolds.

Unified framework for ensemble sampling in nonlinear contextual bandits with provable regret bounds.

problem Efficient exploration in nonlinear contextual bandits with unknown feature dimensions.
method Developed GLM-ES and Neural-ES for generalized linear and neural contextual bandits, respectively, using maximum likelihood estimation on randomly perturbed data.
result Unified high-probability frequentist regret bounds for GLM-ES and Neural-ES, matching state-of-the-art results.

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.

Kernel measures similarity of nonlinear causal structures in heterogeneous populations.

problem Learning causal structure in populations with diverse underlying structures.
method Distance covariance-based kernel for measuring similarity of causal structures.
result Kernel enables clustering of homogeneous subpopulations for causal structure learning.

Study decay and compact support of solutions to certain nonlinear PDEs.

problem Decay and compact support properties of positive solutions to ΔpuΛ(u)Δ_{p} u \geq Λ(u) on manifolds.
method Nonlinear PDE analysis, Feller property, integral Ricci curvature conditions.
result Characterization of stochastic completeness for the pp-Laplacian.

A general nonlinear logistic equation has been proposed to model long-time saturation in industrial growth. An integral solution of this equation has been derived for any arbitrary degree of nonlinearity. A time scale for the onset of nonlinear saturation in industrial growth can be estimated from an equipartition cond…

2009-03-02abs ↗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 ↗

Suppose that G=(V,E)G=(V, E) is a finite graph with the vertex set VV and the edge set EE. Let ΔΔ be the usual graph Laplacian. Consider the following nonlinear Schro¨\ddot{o}dinger type equation of the form {Δuαu=f(x,u),uW1,2(V), \left \{ \begin{array}{lcr} -Δu-αu=f(x,u),\\ u\in W^{1,2}(V),\\ \end{array} \right. on graph GG, where $f(x…

2019-03-13abs ↗pdf ↗

Study on robustness of unsupervised representation learning in slightly misspecified settings.

problem Identify nonlinear representation learning in slightly misspecified settings.
method Formalize and investigate Independent Component Analysis (ICA) with observations generated by a mixing function close to a local isometry.
result Approximate identifiability of nonlinear ICA with almost isometric mixing functions.

Improved bounds for function approximation in nonlinear sets.

problem Achieving high probability error with limited samples in nonlinear function approximation.
method Restricting model class to a neighbourhood of the best approximation and estimating sample complexity using tangent and normal spaces' complexities and curvature.
result Improved worst-case bounds for sample complexity in more general sets like tensor networks and neural networks.

New nonlinear smoothers improve state estimation in chaotic systems.

problem Improving state estimation in chaotic dynamical systems with non-Gaussian behavior.
method Developed nonlinear backward ensemble transport smoothers with parameterization and regularization of transport maps.
result Nonlinear smoothers yield lower estimation error than conventional methods for comparable model evaluations.

New method recovers matrices with nonlinear structures using optimization on Grassmann manifold.

problem Recovering high-rank matrices with nonlinear structures like subspaces or clusters.
method Formulated as rank minimization of a nonlinear feature map, approximated by constrained non-convex optimization on the Grassmann manifold, using Riemannian and alternating minimization schemes.
result Global convergence and worst-case complexity bounds for alternating minimization scheme, leading to unique limit point.

The methodology presented provides a quantitative way to characterize investor behavior and price dynamics within a particular asset class and time period. The methodology is applied to a data set consisting of over 250,000 data points of the S&P 100 stocks during 2004-2018. Using a two-way fixed-effects model, we unco…

2019-07-09abs ↗pdf ↗