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

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for Exact Solution

PhD dissertation on Finsler geometry and gravity, focusing on Berwald spaces and exact solutions.

problem Characterizing and solving Finsler gravity equations.
method Analysis of Berwald spaces, (α,β)(α,β)-metrics, and exact solutions to Finsler gravity equations.
result Exact vacuum solutions in Finsler gravity.

The paper finds exact solutions to a complex Einstein-Dirac-Maxwell system on 4D Sasakian spacetimes.

problem Finding exact solutions to an Einstein-Dirac-Maxwell system with Sasakian quasi-Killing spinors.
method Constructing a family of exact solutions on four-dimensional static Sasakian spacetimes using the Sasakian frame.
result Closed and open universe models are found with specific energy conditions.

By using Bäcklund transformation for the sine-Gordon equation, new periodic exact solutions of the constant astigmatism equation zyy+(1/z)xx+2=0 z_{yy} + ({1}/{z})_{xx} + 2 = 0 are generated from a seed which corresponds to Lipschitz surfaces of constant astigmatism.

2017-07-03abs ↗pdf ↗

Exact solution found for two-body financial dealer model using kinetic theory.

problem Finding an exact solution for the two-body financial dealer model.
method Exact master-Liouville equations derived using kinetic theory and probability currents.
result Exact order-book profile and average transaction interval derived.

Let f,g:RRf,g:{\Bbb R}\to{\Bbb R} be integrable functions, ff nowhere zero, and φ(u)=du/f(u)φ(u)=\int du/f(u) be invertible. An exact solution to the generalized nonhomogeneous inviscid Burgers' equation ut+g(u).ux=f(u)u_t+g(u).u_x=f(u) is given, by quadratures.

2009-08-25abs ↗pdf ↗

Develops methods for constructing exact, non-stationary solutions to Euler equations.

problem Constructing exact, non-stationary solutions to the incompressible Euler equations.
method Arnold's geometric framework with a generalized Coriolis force.
result Explicit, smooth, global-in-time solutions on curved surfaces and three-dimensional manifolds.

Exact second-order optimization for deep learning reduces computational cost and improves performance.

problem Inadequate use of second-order optimization methods in deep learning due to high computational cost and non-convexity.
method Developed an exact stochastic second-order Newton method that addresses the non-convexity issue and provides an expression for the stochastic Hessian.
result Exact second-order Newton direction formula and its application in deep learning datasets.

This paper solves the multiple reference model problem in RLHF with exact solutions and sample complexity guarantees.

problem Limitations of single reference models in aligning LLMs with human feedback.
method Integrates multiple reference models into RLHF frameworks, addressing theoretical challenges with exact solutions and sample complexity guarantees.
result First exact solution to the multiple reference model problem in reverse KL-regularized RLHF.

In a number of physically important cases, the nonholonomically (nonintegrable) constrained Ricci flows can be modelled by exact solutions of Einstein equations with nonhomogeneous (anisotropic) cosmological constants. We develop two geometric methods for constructing such solutions: The first approach applies the form…

2007-05-05abs ↗pdf ↗

Study on 2-hessian equation finds new invariant models and exact solutions.

problem Classifying and solving 3D nonlinear 2-hessian equations.
method Group classification using Lie method, finding equivalence transformations and optimal subalgebras.
result Optimal system of one-dimensional Lie subalgebras generated, leading to new invariant models and exact solutions.

Two sweeps of the Brennan-Schwartz algorithm solve American options under negative rates.

problem Inability of the Brennan-Schwartz algorithm to solve American options under negative interest rates.
method Two sweeps of the Brennan-Schwartz algorithm in two directions.
result Recovery of the exact solution for American options under negative rates.

Ancient solutions and translators identified for Lagrangian flow.

problem Characterizing ancient solutions and translators of Lagrangian mean curvature flow.
method Analyzing almost calibrated, exact, ancient solutions with specific geometric properties.
result All ancient solutions with entropy less than 3 are special Lagrangian, planes, or translators in \(\mathbb{C}^2\).

FLASH-MAX predicts electromagnetic fields from sparse data in seconds.

problem Predicting homogeneous electromagnetic fields from sparse pointwise observations.
method Exact-by-construction neural network architecture that satisfies Maxwell's equations symbolically.
result FLASH-MAX achieves sub-1% relative validation error from 1K sparse observations in seconds.

In this paper, we investigate the non-linear Black--Scholes equation: ut+ax2uxx+bx3uxx2+c(xuxu)=0,a,b>0, c0.u_t+ax^2u_{xx}+bx^3u_{xx}^2+c(xu_x-u)=0,\quad a,b>0,\ c\geq0. and show that the one can be reduced to the equation ut+(uxx+ux)2=0u_t+(u_{xx}+u_x)^2=0 by an appropriate point transformation of variables. For the resulting equation, we study the group-theore…

2015-11-30abs ↗pdf ↗

Neural network discovers exact solutions to QP with linear constraints.

problem Discovering exact solutions to Quadratic Programs (QP) with linear constraints using neural networks.
method Proposes a neural network modeling approach that analytically derives model parameters from problem coefficients, ensuring closed-form solutions without training.
result The closed-form NN model produces exact solutions for every critical region of the QP solution function, outperforming DNNs and commercial solvers in terms of optimality and feasibility.

This work presents an exact solution to the generalized Heston model, where the model parameters are assumed to have linear time dependence The solution for the model in expressed in terms of confluent hypergeometric functions.

2014-02-23abs ↗pdf ↗

New method for debiased inference without assuming exact solutions in inverse problems.

problem Dealing with inverse problems where exact solutions may not exist.
method Nonparametric instrumental variable analysis without structural equations.
result Valid inference on functionals of inverse problems without assuming exact solutions.

Paper constructs solutions for a class of overdetermined systems.

problem Constructing solutions for a class of overdetermined systems.
method Resolution of the solution sheaf, sufficient condition for global exactness, gluing techniques, local solvability of the Treves complex.
result Obtained a sufficient condition for global exactness, leading to gluing techniques for local solutions.

Decentralized Gaussian processes for multi-agent systems.

problem Scalable and flexible learning solutions for multi-agent systems.
method Asymptotically exact decentralized solution to Gaussian processes, with online Bayesian model averaging for hyperparameter selection.
result Asymptotically exact decentralized Gaussian process approximation and online Bayesian model averaging.

The paper explores partial identifiability in nonnegative matrix factorization under specific conditions.

problem Identifying specific columns of the matrices in nonnegative matrix factorization.
method Mathematical rigor and geometric interpretation to analyze partial identifiability of columns in nonnegative matrix factorization.
result The partial uniqueness of a single column of CC or SS can be guaranteed under certain sparsity and algebraic conditions.

Algorithm for exact partitioning of high-order models using convex tensor relaxation.

problem Exact partitioning of high-order models.
method Defining a general class of mm-degree Homogeneous Polynomial Models, relaxing the high-order combinatorial problem to a convex conic form problem, defining the Carathéodory symmetric tensor cone, and constructing a primal-dual certificate.
result The solution of the convex relaxation is correct and provides a statistical upper bound for exact partitioning.

We study rank-1 {L1-norm-based TUCKER2} (L1-TUCKER2) decomposition of 3-way tensors, treated as a collection of NN D×MD \times M matrices that are to be jointly decomposed. Our contributions are as follows. i) We prove that the problem is equivalent to combinatorial optimization over NN antipodal-binary variables. ii)…

2017-10-31abs ↗pdf ↗

Paper uses SDP for community detection with side information.

problem Community detection in graphs with additional non-graph data.
method Formulates SDP relaxation for maximum likelihood node labeling with side information.
result SDP achieves same exact recovery threshold as maximum likelihood with side information.

Unified convex relaxation framework for neural network robustness verification.

problem Inability to achieve tight verification of neural networks against adversarial attacks.
method Unified convex relaxation framework for neural networks of various architectures and nonlinearities.
result Exact solution to convex-relaxed problem does not significantly improve verification gap.

Paper proposes OpenAPI to interpret PLM models without access to parameters.

problem Interpreting hidden predictive models without access to parameters.
method Closed-form solution using overdetermined linear equation systems.
result Exact and consistent interpretations for PLM models.

We provide an exact analytical solution of the Nash equilibrium for kk- price auctions. We also introduce a new type of auction and demonstrate that it has fair solutions other than the second price auctions, therefore paving the way for replacing second price auctions.

2018-09-26abs ↗pdf ↗