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

Trend · papers per month

237474711948 · Jun 202019922001200920172026
48 results for Math Problem Solving

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.

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

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.

Improved math problem solvers using Transformer networks and diverse notations.

problem Challenges in constructing accurate and automatic solvers for math word problems.
method Transformer networks trained to translate math word problems to arithmetic expressions in infix, prefix, and postfix notations. Pre-training on general text corpus to improve performance.
result Significant improvements in accuracy, up to 10% over previous state of the art.

When a bilingual student learns to solve word problems in math, we expect the student to be able to solve these problem in both languages the student is fluent in,even if the math lessons were only taught in one language. However, current representations in machine learning are language dependent. In this work, we pres…

2018-09-23abs ↗pdf ↗

The paper finds minimum Steklov eigenvalues on combinatorial graphs.

problem Finding the minimum Steklov eigenvalues on combinatorial graphs.
method Extending Friedman's nodal domain theory for Laplacian eigenfunctions to Steklov eigenfunctions.
result The minimum of the imthi^{ m th} Steklov eigenvalue on a connected combinatorial graph is essentially attained by a star or a regular comb with minimal brooms.

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.

Let X be a locally symmetric space associated to a reductive algebraic group G defined over Q. L-modules are a combinatorial analogue of constructible sheaves on the reductive Borel-Serre compactification of X; they were introduced in [math.RT/0112251]. That paper also introduced the micro-support of an L-module, a com…

2004-12-20abs ↗pdf ↗

Sharp spectral gap estimates for higher-order operators on hyperbolic spaces.

problem Estimating spectral gaps for higher-order operators on Cartan-Hadamard manifolds.
method Symmetrization-free proofs based on general functional inequalities.
result Solves a sharp asymptotic problem from Cheng and Yang and answers a question from Kristály.

This note summarizes the talk by the author at the workshop "Geometry and Computer Science" held in Pescara in February 2017. We present how SageMath can help in research in Complex and Differential Geometry, with two simple applications, which are not intended to be original. We consider two "classification problems" …

2017-04-13abs ↗pdf ↗

We prove that the homotopy class of a Morin mapping f: P^p --> Q^q with p-q odd contains a cusp mapping. This affirmatively solves a strengthened version of the Chess conjecture [DS Chess, A note on the classes [S_1^k(f)], Proc. Symp. Pure Math., 40 (1983) 221-224] and [VI Arnol'd, VA Vasil'ev, VV Goryunov, OV Lyashenk…

2003-01-31abs ↗pdf ↗

We survey what is known about singularities of special Lagrangian submanifolds (SL m-folds) in (almost) Calabi-Yau manifolds. The bulk of the paper summarizes the author's five papers math.DG/0211294, math.DG/0211295, math.DG/0302355, math.DG/0302356, math.DG/0303272 on SL m-folds X with isolated conical singularities.…

2003-10-29abs ↗pdf ↗

In frictionless markets, utility maximization problems are typically solved either by stochastic control or by martingale methods. Beginning with the seminal paper of Davis and Norman [Math. Oper. Res. 15 (1990) 676--713], stochastic control theory has also been used to solve various problems of this type in the presen…

2010-10-21abs ↗pdf ↗

Riemannian and pseudo-Riemannian symmetric spaces with semisimple transvection group are known and classified for a long time. Contrary to that the description of pseudo-Riemannian symmetric spaces with non-semisimple transvection group is an open problem. In the last years some progress on this problem was achieved. I…

2006-12-04abs ↗pdf ↗

The paper solves MMV and MV problems with random coefficients and finds shared optimal strategies.

problem Optimal trading strategies with random market coefficients.
method Backward stochastic differential equations (BSDEs) to find optimal strategies.
result MMV and MV problems share the same optimal portfolio and value under random coefficients.

This paper presents fifteen problems about mapping class groups. It is an expanded and updated version of the author's preprint "Ten problems on the mapping class groups". The paper will appear in the book "Problems on Mapping Class Groups and Related Topics", ed. by B. Farb, Proc. Symp. Pure Math. series, Amer. Math. …

2006-08-14abs ↗pdf ↗

In [Tohoku Math. J. 62 (2010), 45--53] the second author showed that, except for a few cases, the order NN of a cyclic group of self-homeomorphisms of a closed orientable topological surface SgS_g of genus g2g \geq 2 determines the group up to a topological conjugation, provided that N3gN\geq 3g. The first author et al…

2017-02-08abs ↗pdf ↗

Train a lightweight carry-on model on existing LLMs for faster customization.

problem Customizing large language models for specific tasks is computationally expensive.
method Train an additional branch of transformer blocks on the final-layer embedding of pretrained LLMs, then merge them with a carry-on module.
result Training a 100M carry-on layer requires less than 1GB GPU memory, making it scalable and affordable.

This paper solves part of a problem by constructing surfaces with specific curvature and singularities.

problem Solving an open problem by Gálvez, Hauswirth, and Mira regarding constant curvature metrics with conical singularities.
method Established a geometric correspondence between metrics and isometric immersions into Euclidean 3-space, constructing a family of surfaces.
result Explicitly constructed a family of surfaces with constant curvature one and two conical singularities.

Study shows challenges in reinforcement learning math problems, proposing enhancements and a hardness measure.

problem Challenges in reinforcement learning finding rare high-reward instances.
method Combining combinatorial group theory, algorithmic enhancements, and topological hardness measure.
result Resolved mathematical questions and proposed enhancements for reinforcement learning.

We study how well one can recover sparse principal components of a data matrix using a sketch formed from a few of its elements. We show that for a wide class of optimization problems, if the sketch is close (in the spectral norm) to the original data matrix, then one can recover a near optimal solution to the optimiza…

2015-03-12abs ↗pdf ↗

We give topological lower bounds on the number of periodic and closed trajectories in strictly convex smooth billiards. We use variational reduction admitting a finite group of symmetries and apply topological approach based on equivariant Morse and Lusternik - Schnirelman theories. The paper continues results publishe…

2000-06-12abs ↗pdf ↗

The goal of this article was the S^1-equivariant transversality-problem and the compactification-problem for the moduli spaces of (perturbed) PU(2)-monopoles. A substantially improved version entitled "Moduli spaces of PU(2)-monopoles (revised version)" which gives simpler, clearer proofs of the transversality results,…

1997-02-07abs ↗pdf ↗

Rapid progress has been made recently on symmetry breaking operators for real reductive groups. Based on Program A-C for branching problems (T.Kobayashi [Progr.Math.2015]), we illustrate a scheme of the classification of (local and nonlocal) symmetry breaking operators by an example of conformal representations on diff…

2017-12-26abs ↗pdf ↗

Introduces SMMV preferences to avoid inconsistency in portfolio selection.

problem Monotone mean-variance preferences fail to differentiate strictly dominant payoffs.
method Introduces strictly monotone mean-variance preferences and applies them to portfolio selection problems.
result SMMV preferences provide a more rational basis for assessing prospects and coincide with MV preferences under certain conditions.

LEWIS merges LLMs without training, improving performance on specific tasks.

problem Limited performance improvement of merged models on specific benchmarks.
method Guided model merging using layer-wise sparsity and task-vector pruning.
result Improved model performance by up to 11.3% on math-solving tasks.

A note on the uniqueness of differential characters and K-theory via homological algebra.

problem Existence and uniqueness of differential characters and differential K-theory.
method Observation and application of Rakesh Pawar's results in homological algebra.
result The hexagon diagram uniquely determines differential K-theory groups up to isomorphism.

The existence of a natural and projectively invariant quantization in the sense of P. Lecomte [Progr. Theoret. Phys. Suppl. (2001), no. 144, 125-132] was proved by M. Bordemann [math.DG/0208171], using the framework of Thomas-Whitehead connections. We extend the problem to the context of supermanifolds and adapt M. Bor…

2010-10-04abs ↗pdf ↗

A deep learning approach generates math word problems in multiple languages.

problem Template-based mechanisms for generating mathematical word problems lack customizability and creativity.
method Character Level Long Short Term Memory Network (LSTM) and POS tags are used to generate and resolve constraints in generated problems.
result The approach generates accurate math word problems in English and Sinhala with over 90% accuracy.

We solve the following problem: to describe in geometric terms all differential operators of the second order with a given principal symbol. Initially the operators act on scalar functions. Operator pencils acting on densities of arbitrary weights appear naturally in the course of study. We show that for the algebra of…

2003-01-21abs ↗pdf ↗

We construct from a real affine manifold with singularities (a tropical manifold) a degeneration of Calabi-Yau manifolds. This solves a fundamental problem in mirror symmetry. Furthermore, a striking feature of our approach is that it yields an explicit and canonical order-by-order description of the degeneration via f…

2007-03-28abs ↗pdf ↗

We give dimension-free regularity conditions for a class of possibly degenerate sub-elliptic equations in the Heisenberg group exhibiting super-quadratic growth in the horizontal gradient; this solves an issue raised by Manfredi & Mingione (Math. Ann. 2007) where only dimension dependent bounds for the growth exponent …

2007-08-27abs ↗pdf ↗