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

245491736981 · Jun 202019922001200920172026
48 results for Mathematical problem solving

Transformer models can solve complex math problems with less data.

problem Solving complex symbolic mathematics problems with limited data.
method Pretrain transformer models on language translation tasks and fine-tune for symbolic math.
result Pretrained transformer models achieve comparable accuracy to state-of-the-art models with less data.

We give a general overview of the influence of William Thurston on the French mathematical school and we show how some of the major problems he solved are rooted in the French mathematical tradition. At the same time, we survey some of Thurston's major results and their impact. The final version of this paper will appe…

2019-12-06abs ↗pdf ↗

This note explores the mathematical theory to solve modern gamblers ruin problems. We establish a ruin framework and solve for the probability of bankruptcy. We also show how this relates to the expected time to bankruptcy and review the risk neutral probabilities associated an adjustment to asymmetrical views.

2014-03-24abs ↗pdf ↗

Mathematical reasoning---a core ability within human intelligence---presents some unique challenges as a domain: we do not come to understand and solve mathematical problems primarily on the back of experience and evidence, but on the basis of inferring, learning, and exploiting laws, axioms, and symbol manipulation ru…

2019-04-02abs ↗pdf ↗

MathChat uses LLM agents to solve challenging math problems through conversational problem-solving.

problem Solving math problems expressed in natural language.
method MathChat is a conversational framework combining an LLM agent and a user proxy agent for collaborative problem-solving.
result MathChat improves tool-using prompting methods by 6% on difficult math problems.

With the recent rise of Machine Learning as a candidate to partially replace classic Financial Mathematics methodologies, we investigate the performances of both in solving the problem of dynamic portfolio optimization in continuous-time, finite-horizon setting for a portfolio of two assets that are intertwined. In Fin…

2018-12-26abs ↗pdf ↗

The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a binary, continuous and multi-class target type, incorporating constraints not p…

2020-01-22abs ↗pdf ↗

New method tackles inexact bilevel optimization for faster parameter learning.

problem Nested optimization problems in bilevel learning with computationally difficult exact solutions.
method Inexact derivative-free optimization algorithms for approximate lower-level solutions.
result Global convergence and worst-case complexity for the proposed approach.

New algorithms reduce variance in solving complex mathematical problems.

problem Solving convex-concave saddle point problems, variational inequalities, and inclusions.
method Stochastic variance reduction for extragradient, forward-backward-forward, and forward-reflected-backward methods.
result All proposed methods converge with complexities matching or improving deterministic counterparts.

In this paper, we analyze dynamic programming as a novel approach to solve the problem of maximizing the profits of a bank. The mathematical model of the problem and the description of a bank's work is described in this paper. The problem is then approached using the method of dynamic programming. Dynamic programming m…

2015-11-03abs ↗pdf ↗

Paper develops a new method for solving complex problems in generative modeling and mean-field games.

problem Solving complex problems in generative modeling and mean-field games.
method Reinterpreting Generalized Schrödinger Bridges (GSBs) as probabilistic models and using the nonlinear Feynman-Kac lemma.
result Demonstrates the efficacy of the new method in generative modeling and mean-field games.

Analog method solves portfolio optimization problems faster and more efficiently.

problem Accurate covariance matrix estimation and fast optimal portfolio selection for financial applications.
method Two-step process using equilibrium propagation and analog Hopfield networks.
result Fully analog pipeline calculates optimal portfolios in energy-efficient manner.

We consider a class of participation rights, i.e. obligations issued by a company to investors who are interested in performance-based compensation. Albeit having desirable economic properties equity-based debt obligations (EbDO) pose challenges in accounting and contract pricing. We formulate and solve the associated …

2019-01-08abs ↗pdf ↗

We solve the problem of optimal stopping of a Brownian motion subject to the constraint that the stopping time's distribution is a given measure consisting of finitely-many atoms. In particular, we show that this problem can be converted to a finite sequence of state-constrained optimal control problems with additional…

2016-04-11abs ↗pdf ↗

Enhances math problem-solving models with multi-turn preference learning.

problem Improving mathematical problem-solving capabilities of large language models.
method Introduces a multi-turn direct preference learning framework for tool-integrated mathematical reasoning tasks.
result Significant performance improvements in model accuracy on math datasets.

The instance segmentation problem intends to precisely detect and delineate objects in images. Most of the current solutions rely on deep convolutional neural networks but despite this fact proposed solutions are very diverse. Some solutions approach the problem as a network problem, where they use several networks or …

2019-02-01abs ↗pdf ↗

Mathematical framework for language models processes text and predicts next tokens.

problem Understanding and optimizing the performance of large language models.
method Describes encoding, prediction models, learning from data, and deployment of LLMs.
result Demonstrates remarkable empirical successes and provides a platform for further research.

Abstractor enhances Transformers for relational reasoning, improving sample efficiency and performance.

problem Improving sample efficiency and performance in relational tasks.
method Introduces Abstractor module with relational cross-attention to enable explicit relational reasoning.
result Dramatic improvements in sample efficiency and performance on various relational tasks.

Paper solves POMDPs in continuous time and discrete spaces.

problem Optimal decision making in discrete state and action space systems under partial observability.
method Combining optimal filtering theory and deep learning to solve a Hamilton-Jacobi-Bellman equation.
result Derives a mathematical description and solution approach for continuous-time POMDPs.

Paper offers a method for finding the smallest sphere enclosing a set in d-dimensional space.

problem Finding the smallest sphere that encloses a given set in d-dimensional space.
method Mathematical formulation and methods for solving the minimum enclosing ball problem.
result Provides a methodology for solving the minimum enclosing ball problem and related areas.

The braneworld theory appear with the purpose of solving the problem of the hierarchy of the fundamental interactions. The perspectives of the theory emerge as a new physics, for example, deviation of the law of Newton's gravity. One of the principles of the theory is to suppose that the braneworld is local submanifold…

2008-03-07abs ↗pdf ↗

Language models help text classification tasks by predicting next words.

problem Lack of theoretical understanding of why language models perform well on downstream tasks.
method Mathematical study of the connection between next word prediction and text classification, formalizing it and quantifying the benefit.
result Language models that are ε-optimal in cross-entropy learn features that can solve classification tasks with linear approximation.

Mathematical framework using Riemannian geometry for intelligence and consciousness.

problem Lack of a unified mathematical framework for intelligence and consciousness.
method Conceptualizes intelligence as tokens in a high-dimensional space, using Riemannian geometry to describe structure and dynamics.
result Integrates geometric concepts to offer a unified framework for intelligence and consciousness.

In this note we propose a new approach towards solving numerically optimal stopping problems via reinforced regression based Monte Carlo algorithms. The main idea of the method is to reinforce standard linear regression algorithms in each backward induction step by adding new basis functions based on previously estimat…

2018-08-07abs ↗pdf ↗

This survey paper is focused on qualitative and numerical analyses of fully nonlinear partial differential equations of parabolic type arising in financial mathematics. The main purpose is to review various non-linear extensions of the classical Black-Scholes theory for pricing financial instruments, as well as models …

2017-07-04abs ↗pdf ↗

Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine learning algorithms. We describe a generic mathematical model to leverage quantum…

2019-11-17abs ↗pdf ↗