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.

169,051 papers · 148 categories

Trend · papers per month

4.8%9.6%14.5%19.3% · Sep 202419922001200920182026
48 results for non-linear specifications

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.

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 ↗

A method for constructing explicit Calabi-Yau metrics in six dimensions in terms of an initial hyperkahler structure is presented. The equations to solve are non linear in general, but become linear when the objects describing the metric depend on only one complex coordinate of the hyperkahler 4-dimensional space and i…

2009-09-09abs ↗pdf ↗

Paper studies solutions to a specific equation in conformal geometry with singular sets.

problem Singular solutions to a fully non-linear equation in conformal geometry.
method Uses a classical gluing method adapted to the fully non-linear setting.
result Shows the classical gluing method can be applied to the σ2σ_2--Yamabe equation.

Study confirms complex crypto market dynamics via non-linear potentials.

problem Linear models fail to capture complex financial market dynamics.
method Analyzed high-frequency crypto currency data to confirm non-linear drift and potential functions.
result Markets exhibit either single-well or double-well potentials, indicating varying levels of uncertainty or stress.

Gradient descent with growing learning rate enables learning non-linear features in neural networks.

problem Learning non-linear features in two-layer neural networks.
method Using gradient descent with a learning rate that grows with the sample size.
result Multiple rank-one components emerge, each corresponding to a specific polynomial feature.

Unified model learns joint and individual features from brain imaging data.

problem Integrating structural and functional connectivity data for behavioral phenotypes.
method Cross-Modal Joint-Individual Variational Network (CM-JIVNet) with multi-head attention fusion.
result CM-JIVNet outperforms in cross-modal reconstruction and behavioral trait prediction.

ParamBoost uses gradient boosting to create interpretable non-linear models with constraints.

problem Creating interpretable non-linear models with expert knowledge constraints.
method Gradient Boosting of cubic polynomials with specified constraints.
result ParamBoost outperforms state-of-the-art GAMs in real-world datasets.

This research evaluates learning models for bionic robots, focusing on transfer function identification.

problem Developers need guidance on selecting and constructing transfer functions for bionic robots.
method Comprehensive evaluation strategy including data collection, learning model selection, comparative analysis, and transfer function identification.
result A framework for effectively dealing with multi-input multi-output robotic data.

A notion of parabolic C-subsolutions is introduced for parabolic equations, extending the theory of C-subsolutions recently developed by B. Guan and more specifically G. Székelyhidi for elliptic equations. The resulting parabolic theory provides a convenient unified approach for the study of many geometric flows.

2017-11-29abs ↗pdf ↗

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.

DPLS improves asset pricing by capturing non-linear risk factor structures.

problem Estimating asset pricing models with non-linear risk factor structures.
method Deep Partial Least Squares (DPLS) for dynamic and flexible factor modeling.
result DPLS models outperform linear models in asset pricing, capturing non-linear risk factor interactions.

DGPs learn from multiple tasks using shared and private latent processes.

problem Improving learning performance and information transfer between tasks.
method Non-linear mixtures of latent processes with shared and task-specific components, using hard or soft sharing.
result DGPs outperform other multi-task learning models across various settings.

Layer-wise relevance propagation (LRP) is a recently proposed technique for explaining predictions of complex non-linear classifiers in terms of input variables. In this paper, we apply LRP for the first time to natural language processing (NLP). More precisely, we use it to explain the predictions of a convolutional n…

2016-06-23abs ↗pdf ↗

Deep networks prioritize easier examples over harder ones, leading to faster training.

problem Understanding how deep networks prioritize examples of varying difficulty.
method Investigated the effect of linear vs non-linear learning modes on example difficulty.
result Non-linear dynamics tend to sequentialize the learning of examples of increasing difficulty.

Tractable model explains market dynamics using Langevin and SUSY QM.

problem Understanding non-linear market dynamics and option pricing.
method Langevin dynamics mapped to QM, using SUSY to find solutions.
result NES model provides accurate option pricing with a single volatility parameter.

New algorithm for choosing top-K options efficiently with linear space and non-linear feedback.

problem Choosing the best K out of N options at each time instant with efficient trade-off between exploration and exploitation.
method CMAB-SM algorithm, divide-and-conquer strategy, linear space, non-linear feedback.
result Achieves a sub-linear regret bound of $O(K^{ rac{1}{2}}N^{ rac{1}{3}}T^{ rac{2}{3}})$.

Hadwiger's Theorem states that Euclidean-invariant convex-continuous valuations of definable sets are linear combinations of intrinsic volumes. We lift this result from sets to data distributions over sets, specifically, to definable real-valued functions on n-dimensional Euclidean space. This generalizes intrinsic vol…

2012-03-28abs ↗pdf ↗

Deep learning framework for uncertainty quantification in physics.

problem Uncertainty in systems governed by non-linear differential equations.
method Physics-informed neural networks with adversarial inference.
result Effective training of deep generative models for physical systems.

We consider the problem of learning fair decision systems in complex scenarios in which a sensitive attribute might affect the decision along both fair and unfair pathways. We introduce a causal approach to disregard effects along unfair pathways that simplifies and generalizes previous literature. Our method corrects …

2018-02-22abs ↗pdf ↗

This work interprets SFA through variational inference, relaxing linearity constraints.

problem Recover non-linear SFA from variational inference.
method Probabilistic interpretation of SFA through variational inference, relaxing linearity constraints.
result Reinterprets SFA as a variational framework, allowing slowness as a regularizer to reconstruction loss.

Develops a data-driven smoothing technique for high-dimensional, non-linear panel data.

problem Improving prediction accuracy in high-dimensional, non-linear panel data models.
method Adaptive discrete smoothing with data-driven weights based on individual function similarity.
result Significant improvement in prediction accuracy compared to traditional linear panel data estimators.

Paper introduces Functional Effects Models to account for individual heterogeneity in panel data.

problem Accounting for preference heterogeneity in panel data with machine learning.
method Functional Effects Models using gradient boosting decision trees and deep neural networks to learn individual-specific preference parameters.
result Functional Effects Models outperform traditional models in learning inter-individual heterogeneity and predictive performance.

We propose a novel kernel based post selection inference (PSI) algorithm, which can not only handle non-linearity in data but also structured output such as multi-dimensional and multi-label outputs. Specifically, we develop a PSI algorithm for independence measures, and propose the Hilbert-Schmidt Independence Criteri…

2016-10-12abs ↗pdf ↗

Study of recurrences in earthquakes, climate, financial time-series, etc. is crucial to better forecast disasters and limit their consequences. However, almost all the previous phenomenological studies involved only a long-ranged autocorrelation function, or disregarded the multi-scaling properties induced by potential…

2013-02-15abs ↗pdf ↗

New model identifies patient-specific disease root causes.

problem Identifying root causes of complex diseases varying between patients.
method Generalized Root Causal Inference (GRCI) algorithm for heteroscedastic noise model.
result GRCI accurately extracts patient-specific root causes.

Paper introduces non-linear discounting models for default compensation and climate valuation.

problem Valuation of non-replicable value and damage under default risk.
method Develops two models: one for risk-neutralising discounting and another for survival probability dependent discounting.
result Non-decaying discount factors (negative discount rates) are possible under certain scenarios.

This paper tackles efficient and scalable estimation of a complex model involving stochastic linear combinations of non-linear regressions.

problem Estimating a model involving stochastic linear combinations of non-linear regressions efficiently and scalably.
method The paper provides algorithms for estimating the model under specific assumptions about the variate vector and sample size, using techniques like zero-bias transformation and sub-sampling.
result The paper provides theoretical guarantees for the estimation of the model, showing that the estimation errors are of the order O(pn)O(\sqrt{\frac{p}{n}}) and O(1p+pn)O(\frac{1}{\sqrt{p}}+\sqrt{\frac{p}{n}}) with high probability.

Study high-dimensional Bayesian linear regression using variational inference.

problem High-dimensional Bayesian linear regression with product priors.
method Non-linear large deviations theory and variational inference.
result Unique optimizer in variational problem governs posterior distribution under separation condition.

Paper analyzes dataset distillation for efficient encoding of task-relevant information.

problem Efficiently encoding task-relevant information from gradient-based learning of non-linear tasks.
method Theoretical analysis of dataset distillation applied to two-layer neural networks with gradient-based training.
result Low-dimensional structure of the problem is efficiently encoded into distilled data, reproducing a model with high generalization ability.

Sparse Bayesian learning improves rational approximations for complex-valued models.

problem Efficiently approximate complex-valued models with high non-linearity.
method Sparse Bayesian learning applied to rational approximation of complex-valued models.
result Sparse Bayesian learning reduces computational cost while maintaining accuracy.