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

231462692923 · Jun 202019922001200920172026
48 results for non-linear function classes

Study shows long-term solutions for complex equations on curved spaces.

problem Long-term behavior of solutions to fully non-linear parabolic equations on Hermitian manifolds.
method Used general assumptions and derived a Harnack inequality for the linearized equation.
result Proved the long-time existence and convergence of solutions.

Papers learn from data to make decisions without interacting, improving on previous methods.

problem Achieving optimal decision-making from offline data with non-linear function approximation.
method Pessimistic Nonlinear Least-Square Value Iteration (PNLSVI) with three innovative components.
result Achieves minimax optimal instance-dependent regret for non-linear function approximation.

ENIAC method optimizes and explores complex RL problems with non-linear policies.

problem Theoretical understanding of non-linear policies in RL with strategic exploration.
method ENIAC, an actor-critic method for non-linear function approximation.
result ENIAC finds near-optimal policies in polynomial exploration rounds under bounded eluder dimension.

Quantum computing offers a quadratic speedup for estimating non-linear functionals.

problem Estimating non-linear functionals of probability distributions.
method Proposes a quantum-inside-quantum Monte Carlo algorithm for a broad class of non-linear estimation problems.
result Achieves a quadratic speedup for non-linear estimation problems, including nested conditional expectations and stochastic optimization.

New algorithm tackles non-linear utility in MNL bandits with ildeO(T) ilde{O}(\sqrt{T}) regret.

problem Sequential assortment selection with intricate user-item interactions.
method Upper Confidence Bound principle for non-linear parametric utility functions, including neural networks.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret bound for neural network-based utilities.

New particle-based VI algorithm expands function class and improves scalability.

problem Limited function class in particle-based VI algorithms restricts flexibility and scalability.
method Introduces a functional regularization term to expand the function class and proposes PFG algorithm.
result Proposed PFG algorithm has larger function class, improved scalability, better adaptation to ill-conditioned distributions, and provable convergence.

Adaptive NN method improves matrix completion for non-smooth data.

problem Matrix completion with non-smooth non-linear functions under high missingness.
method Two-sided nearest neighbors with \Holder function class non-linearity.
result NN error rate matches oracle's for latent factors, non-trivial for wide range of missingness.

We present a general framework for solving a large class of learning problems with non-linear functions of classification rates. This includes problems where one wishes to optimize a non-decomposable performance metric such as the F-measure or G-mean, and constrained training problems where the classifier needs to sati…

2019-09-06abs ↗pdf ↗

The one-class kernel spectral regression (OC-KSR), the regression-based formulation of the kernel null-space approach has been found to be an effective Fisher criterion-based methodology for one-class classification (OCC), achieving state-of-the-art performance in one-class classification while providing relatively hig…

2019-05-22abs ↗pdf ↗

This paper proposes a new method to learn integration schemes for complex ODEs.

problem Learning efficient integration schemes for non-linear ODEs and their identification.
method A novel framework to learn integration schemes that minimize an integration-related cost function.
result The proposed learning-based approach provides integration schemes close to analytical solutions.

Broadens Jourdain and Martini's method to non-linear stochastic processes.

problem Applying pricing methods to non-linear stochastic processes.
method Analyzes from probabilistic and analytic viewpoints, extending Jourdain and Martini's method.
result Broadens applicability of pricing methods to non-linear frameworks.

Let (X,d,μ)(X,d,μ) be a complete metric measure space, with μμ a locally doubling measure, that supports a local weak L2L^2-Poincaré inequality. By assuming a heat semigroup type curvature condition, we prove that Cheeger-harmonic functions are Lipschitz continuous on (X,d,μ)(X,d,μ). Gradient estimates for Cheeger-harmonic func…

2013-07-04abs ↗pdf ↗

The paper introduces a non-linear version of the process convolution formalism for building covariance functions for multi-output Gaussian processes. The non-linearity is introduced via Volterra series, one series per each output. We provide closed-form expressions for the mean function and the covariance function of t…

2018-10-10abs ↗pdf ↗

New framework for analyzing games with multi-dimensional singular controls and non-linear jumps.

problem Analyzing games with multi-dimensional singular controls and non-linear jump impacts.
method Probabilistic framework with novel class of MFGs (MFGs of parametrisations).
result Existence of equilibria and equivalence with MFGs of singular controls.

Enhances Cox model for survival analysis with symbolic non-linear log-risk functions.

problem Limited interpretability and non-linearity in traditional Cox models.
method Introduces GCPH model using Kolmogorov-Arnold Networks for symbolic non-linear log-risk functions.
result GCPH achieves competitive performance and superior interpretability.

This paper studies a class of exponential family models whose canonical parameters are specified as linear functionals of an unknown infinite-dimensional slope function. The optimal minimax rates of convergence for slope function estimation are established. The estimators that achieve the optimal rates are constructed …

2011-08-17abs ↗pdf ↗

Bayesian neural networks improve uncertainty quantification in non-linear dimensionality reduction.

problem Current neural network models lack adequate uncertainty quantification.
method Deploy Markov chain Monte Carlo sampling algorithms for Bayesian inference in ANN models with latent variables.
result New research directions are needed due to fundamental challenges in neural networks with latent variables.

The paper tackles noisy combinations of continuous and step functions, providing conditions for their identification.

problem Recovering noisy observations as a combination of continuous and step functions.
method Topological and local properties of the functions are used to determine conditions for identification. A practical estimation algorithm is provided.
result Conditions for the identification of continuous and step functions based on their global and local properties.

Adequate evaluation of an information retrieval system to estimate future performance is a crucial task. Area under the ROC curve (AUC) is widely used to evaluate the generalization of a retrieval system. However, the objective function optimized in many retrieval systems is the error rate and not the AUC value. This p…

2015-11-16abs ↗pdf ↗

A new model explains asset returns with a single factor, improving cross-sectional performance.

problem Understanding the cross-section of asset returns with complex models.
method Proposes a non-linear single-factor asset pricing model with a nonparametric link function estimated jointly with sieve-based estimators.
result The model delivers superior cross-sectional performance with a low-dimensional approximation of the link function.

Study non-linear combinatorial bandits with polynomial rewards, finding significant differences from linear cases.

problem Adversarial combinatorial bandits with general non-linear reward functions.
method Extending existing work on adversarial linear combinatorial bandits, analyzing minimax optimal regret for polynomial and non-polynomial reward functions.
result Minimax optimal regret bounds for adversarial combinatorial bandits with general non-linear reward functions.

We derive a priori estimates for solutions of a general class of fully non-linear equations on compact Hermitian manifolds. Our method is based on ideas that have been used for different specific equations, such as the complex Monge-Ampère, Hessian and inverse Hessian equations. As an application we solve a class of He…

2015-01-12abs ↗pdf ↗

In this paper, benefiting from the strong ability of deep neural network in estimating non-linear functions, we propose a discriminative embedding function to be used as a feature extractor for clustering tasks. The trained embedding function transfers knowledge from the domain of a labeled set of morphologically-disti…

2018-05-07abs ↗pdf ↗

Analyzes Hessian spectrum for neural networks near optimal learning.

problem Understanding learning dynamics near optimal points in neural networks.
method Characterizes Hessian eigenspectrum for teacher-student problems, using analytical and numerical methods.
result The rank of the Hessian matrix determines effective number of parameters for non-linear networks.

We prove a complete family of `cylindrical estimates' for solutions of a class of fully non-linear curvature flows, generalising the cylindrical estimate of Huisken-Sinestrari for the mean curvature flow. More precisely, we show that, for the class of flows considered, an (m+1)(m+1)-convex (0mn20\leq m\leq n-2) solution bec…

2013-10-02abs ↗pdf ↗

Let (Mn,g), n3(M^n,g),~n\ge 3 be a noncompact complete Riemannian manifold with compact boundary and ff a smooth function on M\partial M. In this paper we show that for a large class of such manifolds, there exists a metric within the conformal class of gg that is complete, has zero scalar curvature on MM and has mean curv…

2006-05-24abs ↗pdf ↗

Study proves global existence and decay for complex wave equations.

problem Global existence and decay for quasilinear wave equations with weak-null condition.
method Novel decoupling of higher order energy estimates, focusing on tangential components.
result Established global existence and decay for solutions with small data.