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

Trend · papers per month

231461692922 · Jun 202019922001200920172026
48 results for non-linear problem

DualIV simplifies non-linear IV regression via dual formulation.

problem Non-linear instrumental variable regression with potential first-stage regression bottleneck.
method Dual formulation of non-linear IV regression as a convex-concave saddle-point problem, leading to a kernel-based algorithm with analytic solution.
result Empirical results show competitive performance compared to existing algorithms.

Solves Dirichlet problem for elliptic equations on Hermitian manifolds.

problem Solving Dirichlet problem for fully non-linear elliptic equations on Hermitian manifolds.
method Establishing a quantitative boundary estimate under a subsolution assumption.
result Derives solvability and regularity of the Dirichlet problem.

New classifier combines locally linear kernels for fast and accurate non-linear classification.

problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a 1\ell_1 Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels.
result The resulting classifier achieves high accuracy with fast inference time.

The paper establishes boundary estimates for solutions to elliptic equations on Hermitian manifolds.

problem Boundary estimates for solutions to fully non-linear elliptic equations on Hermitian manifolds.
method Unified approach using quantitative boundary estimates, gradient estimates, and existence results.
result Established gradient estimates and unified approach to Dirichlet problem solutions.

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.

Non-linear source separation is a challenging open problem with many applications. We extend a recently proposed Adversarial Non-linear ICA (ANICA) model, and introduce Cramer-Wold ICA (CW-ICA). In contrast to ANICA we use a simple, closed--form optimization target instead of a discriminator--based independence measure…

2019-03-01abs ↗pdf ↗

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.

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.

Improved regret bound for multinomial logistic bandits with non-linearity.

problem Maximizing rewards in multinomial logistic bandits with non-linear feedback.
method Extended the definition of κκ_* to multinomial setting and proposed an efficient algorithm.
result Minimax-optimal regret bound of O~(RdKT/κ) \smash{\widetilde{\mathcal{O}}( R d \sqrt{ {KT}/{κ_*}} ) } , improving over existing guarantees.

Matrix completion works well for smooth non-linear structures, even without low-rank assumptions.

problem Matrix completion for smooth non-linear structures.
method Nuclear-norm penalization for matrices lying in a low-dimensional non-linear manifold.
result Nuclear-norm penalization is minimax rate optimal for recovering smooth non-linear matrices with missing data.

Paper uses black-box inference to estimate non-linear latent force models.

problem Estimating posterior state and forcing term in non-linear systems with unknown forcing terms.
method Black-box variational inference with local inverse autoregressive flows.
result Demonstrates effectiveness of approximation on known posterior systems and non-linear dynamics.

DART optimizes subset selection in non-linear bandit problems.

problem Optimizing subset selection in non-linear bandit problems with correlated rewards.
method DART algorithm for combinatorial bandits without individual arm feedback or linearity assumption.
result DART achieves a regret bound of ildeO(KKNT) ilde{\mathcal{O}}(K\sqrt{KNT}).

Improved disability insurance model with collective health claims.

problem Enhance disability insurance model with collective health claims.
method Expand classic semi-Markov model with collective health claims, solve many-body problem using mean-field approach.
result Mean-field approach simplifies complex model into a transparent pricing method.

This paper tackles non-linear reward optimization in resource allocation problems.

problem Optimizing a non-linear function of long-term average rewards in resource allocation problems.
method Proposes model-based and model-free algorithms to learn optimal policies.
result Model-based algorithm achieves a regret of $\Tilde{O}\left(LKDS\sqrt{\frac{A}{T}} ight)$ for KK objectives combined with a concave LL-Lipschitz function.

Develops inverse EKF for non-linear systems with stability guarantees and learning unknown dynamics.

problem Estimating adversary's Kalman-filtered estimates in highly non-linear systems.
method Proposes inverse extended Kalman filter (I-EKF) for second-order, Gaussian sum, and dithered forward models. Uses reproducing kernel Hilbert space for learning unknown dynamics.
result Derives theoretical stability guarantees for inverse second-order EKF.

Capacity analysis has been recently introduced as a way to analyze how linear models distribute their modelling capacity across the input space. In this paper, we extend the notion of capacity allocation to the case of neural networks with non-linear layers. We show that under some hypotheses the problem is equivalent …

2019-02-22abs ↗pdf ↗

Proves energy estimates for tensorial wave equations, decoupling components for stability proof.

problem Proving stability of (1+3)(1+3)-Minkowski space-time with various non-linearities.
method Decouples energy estimates for tensorial wave equations, exploiting tensorial structure and Lie derivatives.
result Decoupled energy estimates for tensorial solutions, allowing new stability proofs.

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.

Develops a new approach to study nonlinear PDEs and their singularities.

problem Understanding the propagation domains of solutions to nonlinear PDEs.
method Derived geometric machinery and sheaf theory to study nonlinear PDEs and their singular supports.
result Estimates the domains of propagation for solutions of non-linear systems.

The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range constraints. Split feasibility generalizes important inverse problems including con…

2016-12-16abs ↗pdf ↗

Paper establishes limits for accurately estimating low-rank matrices from noisy, non-linear data.

problem Estimating low-rank matrices from noisy, non-linear observations.
method Proves strong universality result with equivalent Gaussian model and effective prior parameters.
result Signal-to-noise ratio requirement grows as $N^{ rac 12 (1-1/k_F)}$ for accurate reconstruction.

In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown that it is possible to carry out a recursive approximation to an arbitrarily highe…

2011-06-01abs ↗pdf ↗

This paper extends forecast reconciliation to non-linearly constrained time series.

problem Forecasting time series with non-linear constraints.
method Non-linearly Constrained Reconciliation (NLCR) algorithm that adjusts forecasts to meet non-linear constraints.
result NLCR significantly improves forecast accuracy compared to benchmarks.

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.