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

Trend · papers per month

3569104138 · May 202619922001200920172026
48 results for Nonlinear splittings

Novel methods for splitting Gaussian mixtures improve uncertainty propagation in nonlinear systems.

problem Improving accuracy and efficiency in nonlinear uncertainty propagation.
method Preserving mean and covariance, novel heuristics for selecting splitting direction informed by initial uncertainty and nonlinear function properties.
result Improved accuracy and efficiency in uncertainty propagation compared to existing techniques.

Paper analyzes and proves convergence of a new method for solving complex PDEs.

problem Solving high-dimensional nonlinear PDEs and PIDEs with random neural networks.
method Random deep splitting method using random neural networks.
result The method converges to the unique viscosity solution of nonlinear PDEs and PIDEs.

A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.

problem Approximating nonlinear filtering densities for noisy and partial measurements.
method Deep splitting scheme applied to the Fokker--Planck equation followed by Bayes' formula.
result Convergence rate established for the numerical scheme under parabolic Hörmander condition.

Develops a new parabolic equation for surfaces, proving long-time existence and convergence.

problem Extending elliptic equations to parabolic settings for surfaces.
method Introduces a parabolic analogue of the elliptic split-type Monge-Ampère equation.
result Proves long-time existence and convergence conditions for the new equation.

In this paper we introduce a numerical method for nonlinear parabolic PDEs that combines operator splitting with deep learning. It divides the PDE approximation problem into a sequence of separate learning problems. Since the computational graph for each of the subproblems is comparatively small, the approach can handl…

2019-07-08abs ↗pdf ↗

Develops formal moduli theory for splitting complex supermanifolds.

problem Tackles the splitting problem of complex supermanifolds.
method Constructs a filtered dg Lie algebra to control splittings and transfers the theory to a minimal filtered LL_\infty-model.
result Recover classical obstruction classes as leading terms of Maurer-Cartan representatives and proves the existence of higher obstructions.

In the geometry of generic 2-plane fields on 5-manifolds, the local equivalence problem was solved by Cartan who also constructed the fundamental curvature invariant. For generic 2-plane fields or (2,3,5)(2,3,5)-distributions determined by a single function of the form F(q)F(q), the vanishing condition for the curvature invar…

2015-06-08abs ↗pdf ↗

We show that the pluriclosed flow preserves generalized Kähler structures with the extra condition [J+,J]=0[J_+,J_-] = 0, a condition referred to as "split tangent bundle." Moreover, we show that in this in this case the flow reduces to a nonconvex fully nonlinear parabolic flow of a scalar potential function. We prove a num…

2014-05-04abs ↗pdf ↗

The usual Gromoll-Meyer's generalized Morse lemma near degenerate critical points on Hilbert spaces, so called splitting lemma, is stated for at least C2C^2-smooth functionals. In this paper we establish a splitting theorem and a shifting theorem for a class of continuously directional differentiable functionals (lower…

2011-02-10abs ↗pdf ↗

We propose a tree regularization framework, which enables many tree models to perform feature selection efficiently. The key idea of the regularization framework is to penalize selecting a new feature for splitting when its gain (e.g. information gain) is similar to the features used in previous splits. The regularizat…

2012-01-07abs ↗pdf ↗

We consider a global, nonlinear version of the Whitney extension problem for manifold-valued smooth functions on closed domains CC, with non-smooth boundary, in possibly non-compact manifolds. Assuming CC is a submanifold with corners, or is compact and locally convex with rough boundary, we prove that the restrictio…

2018-01-12abs ↗pdf ↗

We propose a new algorithm called PLUTO for building logistic regression trees to binary response data. PLUTO can capture the nonlinear and interaction patterns in messy data by recursively partitioning the sample space. It fits a simple or a multiple linear logistic regression model in each partition. PLUTO employs th…

2014-11-25abs ↗pdf ↗

Novel approach for creating interpretable classifiers using bilevel optimization of split-rules in NLDTs.

problem Creating highly accurate and easily interpretable classifiers for practical applications.
method Representing classifiers as assemblies of simple mathematical rules using NLDTs with evolutionary bilevel optimization.
result The approach ensures interpretability while achieving high accuracy on various classification problems.

WeldNet reduces complex dynamics to simpler, manageable segments.

problem Complex, high-dimensional time-dependent datasets from physical processes are costly to simulate.
method Windowed Encoders for Learning Dynamics, splitting time domain into windows for nonlinear dimension reduction and propagator training.
result WeldNet captures nonlinear latent structures and dynamics, outperforming existing methods.

Study develops a method to select penalty parameters for sparse neural networks without cross-validation.

problem Selecting optimal penalty parameters for sparse neural networks without cross-validation.
method Established theoretical foundation to bound the infinite norm of the gradient of the loss function at zero.
result Proposed method effectively selects penalty parameters for sparse neural networks.

The Gromoll-Meyer's generalized Morse lemma (so called splitting lemma) near degenerate critical points on Hilbert spaces, which is one of key results in infinite dimensional Morse theory, is usually stated for at least C2C^2-smooth functionals. It obstructs one using Morse theory to study most of variational problems …

2012-11-06abs ↗pdf ↗

The paper studies statistical properties of CART regression trees.

problem Understanding the statistical properties of CART regression trees.
method The paper constructs a prior distribution on split points and solves a nonlinear optimization problem to bound the Pearson correlation between the optimal decision stump and response data.
result CART with cost-complexity pruning achieves an optimal complexity/goodness-of-fit tradeoff when the depth scales with the logarithm of the sample size.

Novel method estimates complex nonlinear systems with stochastic differential equations.

problem Handling complex nonlinear dynamical systems with strong learning guarantees.
method Estimates drift and diffusion coefficients of continuous, multidimensional, nonlinear controlled stochastic differential equations.
result Strong theoretical guarantees including finite-sample bounds for various metrics.

Infinitesimal gradient boosting is a new algorithm derived from gradient boosting.

problem Improving the efficiency and smoothness of gradient boosting.
method Introduced a new class of randomized regression trees and used a limit process in vanishing-learning-rate asymptotic.
result Convergence of the stochastic algorithm and characterization of the limiting procedure as a unique solution of a nonlinear ODE.

Develops geometric framework for dissipative field equations.

problem Dissipative field equations and their geometric analysis.
method Canonical kk-contact manifolds, kk-contactifications, splitting results, regularity conditions, criteria for PDEs.
result Explicit Hamiltonian descriptions for various nonlinear PDEs.

The asymptotic behavior of the stochastic gradient algorithm with a biased gradient estimator is analyzed. Relying on arguments based on the dynamic system theory (chain-recurrence) and the differential geometry (Yomdin theorem and Lojasiewicz inequality), tight bounds on the asymptotic bias of the iterates generated b…

2017-08-30abs ↗pdf ↗

LGB+ improves macroeconomic forecasting by combining linear and tree models.

problem Efficiency in small samples for forecasting with mixed linear and nonlinear dynamics.
method LGB+ is a boosting procedure that evaluates both tree and linear candidates at each step, advancing only the winner. It decomposes forecasts into linear and nonlinear contributions.
result LGB+ delivers strong gains for targets with pronounced autoregressive dynamics or mixed signals.

This work presents a general unified theory for coupled nonlinear elastic and inelastic deformations of curved thin shells. The coupling is based on a multiplicative decomposition of the surface deformation gradient. The kinematics of this decomposition is examined in detail. In particular, the dependency of various ki…

2018-10-23abs ↗pdf ↗

This paper presents a geometric-variational approach to continuous and discrete mechanics and field theories. Using multisymplectic geometry, we show that the existence of the fundamental geometric structures as well as their preservation along solutions can be obtained directly from the variational principle. In parti…

1998-07-15abs ↗pdf ↗

We investigate bi-Hamiltonian structures and mKdV hierarchies of solitonic equations generated by (semi) Riemannian metrics and curve flows of non-stretching curves. There are applied methods of the geometry of nonholonomic manifolds enabled with metric-induced nonlinear connection (N-connection) structure. On spacetim…

2008-10-03abs ↗pdf ↗

Physics-based deep learning improves fiber-optic communication efficiency.

problem Improving signal propagation in fiber-optic communication systems.
method Parameterizing the split-step method of solving the nonlinear Schrödinger equation as a deep neural network.
result Filters can be pruned to as few as 3 taps/step without sacrificing performance.

SPlit optimizes dataset splitting for better model performance.

problem Improving model performance through optimal dataset splitting.
method Adapting Support Points (SP) algorithm for subsampling and categorical variables in a sequential nearest neighbor approach.
result SPlit significantly improves worst-case testing performance compared to random splitting.

Algorithm recovers factors of rank-1 matrices from noisy measurements.

problem Estimating factors of a rank-1 matrix from nonlinearly transformed and noisy measurements.
method Alternating minimization with random initialization and analysis of empirical error recursion.
result Algorithm converges geometrically fast from random initialization, with sharp guarantees.

We report analytical results for the development of the viscous fingering instability in a cylindrical Hele-Shaw cell of radius a and thickness b. We derive a generalized version of Darcy's law in such cylindrical background, and find it recovers the usual Darcy's law for flow in flat, rectangular cells, with correctio…

2002-01-31abs ↗pdf ↗

The paper extends keenness concept to bridge splittings and finds conditions for existence.

problem Extending keenness concept to bridge splittings and finding conditions for existence.
method Extending the concept of keenness to bridge splittings and proving existence conditions.
result Existence of strongly keen (g,b)(g,b)-splitting of a link with distance nn for certain integers gg, bb, and nn.

Non-split almost complex supermanifolds and non-split Riemannian supermanifolds are studied. The first obstacle for a splitting is parametrized by group orbits on an infinite dimensional vector space. Further it is shown that non-split structures appear in the first case as deformations of a split reduction and in the …

2015-01-28abs ↗pdf ↗

The paper uses deep neural networks to estimate and infer ATE without needing to know the dimension of the data.

problem Estimating and inferring the average treatment effect (ATE) in complex data settings.
method The paper uses deep neural networks to estimate the mean regression function and then calculates the ATE. It establishes consistency and asymptotic normality of the estimators.
result The deep neural network estimates of ATE are consistent and asymptotically normal, providing dimension-free rates.

New method weaves paper strips for designing curved surfaces with elasticity.

problem Designing general curved surfaces with geometrical elasticity.
method Shape optimization of paper strips using nonlinear elasticity theory.
result Demonstrated creation of catenoid and helicoid surfaces with 54 paper strips.

We study the self-dual Yang-Mills equations in split signature. We give a special solution, called the basic split instanton, and describe the ADHM construction in the split signature. Moreover a split version of t'Hooft ansatz is described.

2009-02-03abs ↗pdf ↗

Paper proposes a novel SVM method for creating survival trees.

problem Creating non-linear survival trees for right-censored data.
method L2-regularized dipole splitting criteria with kernel methods.
result Non-linear splits using polynomial and Gaussian kernels show similar predictive power but often smaller tree sizes.