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

60121181241 · May 202619922001200920172026
48 results for Geometric Reasoning

LatFormer improves geometric reasoning by incorporating lattice symmetry priors in attention mechanisms.

problem State-of-the-art models struggle with geometric reasoning tasks in the ARC and LARC datasets.
method Introduced LatFormer, a model that uses lattice symmetry priors in attention masks.
result LatFormer requires 2 orders of magnitude fewer data than standard attention mechanisms.

Transformers mimic Bayesian reasoning in controlled settings, revealing geometric mechanisms.

problem Verifying if transformers perform Bayesian reasoning rigorously in natural data.
method Constructing Bayesian wind tunnels with known posteriors and proving memorization impossibility.
result Transformers achieve 10310^{-3}-10410^{-4} bit accuracy in Bayesian posteriors, while MLPs fail.

This paper presents KeypointNet, an end-to-end geometric reasoning framework to learn an optimal set of category-specific 3D keypoints, along with their detectors. Given a single image, KeypointNet extracts 3D keypoints that are optimized for a downstream task. We demonstrate this framework on 3D pose estimation by pro…

2018-07-05abs ↗pdf ↗

Survey on automating geometry problem solving with large models.

problem Automating geometric problem solving with spatial understanding and logical reasoning.
method Synthesizes GPS advancements through benchmark construction, parsing, and reasoning paradigms.
result Unified analytical paradigm and emerging opportunities identified.

SpatialSim benchmarks machine learning in recognizing object spatial configurations.

problem Machine learning in recognizing precise geometrical configurations of groups of objects.
method SpatialSim benchmark with tasks of Identification and Comparison, using Graph Neural Networks (MPGNNs).
result MPGNNs outperform baselines in recognizing spatial configurations, highlighting current limits.

ManifoldMind uses adaptive-curvature probabilistic spheres for trustworthy recommendations in semantic hierarchies.

problem Sparse and abstract recommendation domains where users explore diverse conceptual paths.
method Adaptive-curvature probabilistic spheres, soft multi-hop inference, and curvature-aware semantic kernel.
result Superior NDCG, calibration, and diversity compared to baselines on public benchmarks.

In this paper we study geometric coincidence problems in the spirit of the following problems by B. Grünbaum: How many affine diameters of a convex body in Rn\mathbb R^n must have a common point? How many centers (in some sense) of hyperplane sections of a convex body in Rn\mathbb R^n must coincide? One possible approa…

2011-06-30abs ↗pdf ↗

In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group GG, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided. Basic criteria for finding a nearest consistent pairwise comparisons matrix (extend…

2016-01-23abs ↗pdf ↗

The paper analyzes finite-time singularities in Spin(7)-structure flows using Shi-type estimates.

problem Analyzing finite-time singularities in Spin(7)-structure flows.
method Proves Shi-type derivative estimates and shows that Λ(x,t) must blow up at finite-time singularities.
result Establishes a general analytic framework for studying Spin(7)-structure flows.

Geometric vector perceptrons improve protein structure learning.

problem Learning from protein structure with efficient and natural representations.
method Introducing geometric vector perceptrons to extend dense layers for Euclidean vectors, integrating geometric and relational reasoning.
result Improves model quality assessment and computational protein design over existing methods.

New causal versions of MaxEnt and PIR avoid paradoxical probability updates.

problem Paradoxical probability updates in causal MaxEnt and PIR.
method Separate constraints into cause-specific and mechanism-specific restrictions.
result Causal MaxEnt avoids paradoxical updates and aligns with Information Geometric Causal Inference.

LASER compresses recursive model activations by exploiting their low-dimensional structure.

problem Understanding and optimizing the geometric structure of recursive reasoning trajectories.
method Dynamic low-rank basis tracking via matrix-free subspace tracking with a fidelity-triggered reset mechanism.
result Recursive activations occupy a linear, low-dimensional subspace that can be compressed efficiently.

We provide a simpler proof of the hard Lefschetz Theorem for face rings of PL spheres: While the algebraic theory remains the same, we replace the geometric constructions by Pachner's Theorem. This simplifies the reasoning for an important special case of the main result of the first author in arxiv:1812.10454, and alr…

2019-06-03abs ↗pdf ↗

The paper addresses geometric analysis on non-compact Riemannian manifolds, proving Calderón-Zygmund inequalities.

problem Proving Calderón-Zygmund inequalities on non-compact Riemannian manifolds without positive injectivity radius.
method Probabilistic tools, Hessian formulas, and Bismut type representations for heat semigroups.
result The paper proves the Calderón-Zygmund inequality for 1<p<21<p<2 under a lower Ricci curvature bound, and for p>2p>2 under additional curvature conditions.

We study the statistical behavior of reasoning probes in a stylized model of iterative computation inspired by neural algorithmic reasoning. The underlying computation is given by a looped Boolean circuit whose graph is a perfect νν-ary tree (ν2ν\ge 2), with outputs recursively fed back as inputs across computation ro…

2026-02-03abs ↗pdf ↗

Geometric framework detects concept frustration between human concepts and machine representations.

problem Aligning human concepts with machine learning representations.
method Geometric framework and similarity measures for detecting concept frustration.
result Concept frustration affects machine learning model performance and reorganizes learned concept representations.

Smooth actions of the multiplicative monoid (R,)(\mathbb{R},\cdot) of real numbers on manifolds lead to an alternative, and for some reasons simpler, definition of a vector bundle, a double vector bundle and related structures like a graded bundle [Grabowski and Rotkiewicz, J. Geom. Phys. 2011]. For these reasons it is n…

2016-02-05abs ↗pdf ↗

It is well-known that normal extremals in sub-Riemannian geometry are curves which locally minimize the energy functional. Most proofs of this fact do not make, however, an explicit use of relations between local optimality and the geometry of the problem. In this paper, we provide a new proof of that classical result,…

2016-10-31abs ↗pdf ↗

In this paper, we classify completely hyperbolic 3-manifolds corresponding to geometric limits of Kleinian surface groups isomorphic to π1(S)π_1(S) for a finite-type hyperbolic surface SS. In the first of the three main theorems, we construct bi-Lipschitz model manifolds for such hyperbolic 3-manifolds, which have a stru…

2010-02-23abs ↗pdf ↗

Geometric framework explains and controls implicit bias in machine learning.

problem Understanding and controlling the selection of solutions in overparameterized models.
method Developed a theoretical and constructive framework based on geometric corrections induced by gradient noise and continuous symmetries of the loss.
result Computed the induced bias across various architectures and enabled inverse design to shape the bias.

From its creation in 1989 through subsequent extensions, the widely-used "SnapPea census" now aims to represent all cusped finite-volume hyperbolic 3-manifolds that can be obtained from <= 8 ideal tetrahedra. Its construction, however, has relied on inexact computations and some unproven (though reasonable) assumptions…

2014-05-12abs ↗pdf ↗

Generalized distance-squared mappings are quadratic mappings of Rm\mathbb{R}^m into R\mathbb{R}^\ell of special type. In the case that matrices AA constructed by coefficients of generalized distance-squared mappings of R2\mathbb{R}^2 into R\mathbb{R}^\ell (3\ell \geq3) are full rank, the generalized distance-square…

2017-01-27abs ↗pdf ↗

Consider an asymptotically flat Riemannian manifold (M,g)(M,g) of dimension n3n \geq 3 with nonempty compact boundary. We recall the harmonic conformal class [g]h[g]_h of the metric, which consists of all conformal rescalings given by a harmonic function raised to an appropriate power. The geometric significance is that eve…

2010-10-20abs ↗pdf ↗

LaTRO optimizes latent reasoning in LLMs without external reward.

problem Training LLMs to perform complex reasoning tasks.
method Formulates reasoning as latent distribution sampling and optimizes via variational approaches.
result LLMs improve reasoning and evaluation quality through self-improvement.

Auto-CEI improves LLM reasoning by balancing assertiveness and conservativeness.

problem Hallucinations and laziness in LLM reasoning tasks.
method Expert Iteration explores reasoning trajectories, guiding incorrect paths back on track and promoting appropriate 'I don't know' responses.
result Auto-CEI achieves superior alignment in logical reasoning, mathematics, and planning tasks.

Proposes a new model for predicting future motion of road actors in autonomous vehicles.

problem Forecasting the long-term future motion of road actors for safe autonomous driving.
method Recurrent graph-based attentional approach with interpretable geometric and social relationships.
result Can produce diverse predictions conditioned on hypothetical or 'what-if' scenarios.

A new method for math reasoning that allows for iterative correction.

problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.

Inferring new facts from existing knowledge graphs (KG) with explainable reasoning processes is a significant problem and has received much attention recently. However, few studies have focused on relation types unseen in the original KG, given only one or a few instances for training. To bridge this gap, we propose Co…

2019-06-13abs ↗pdf ↗

Transformers learn multi-step reasoning through gradient descent.

problem Understanding how transformers solve symbolic multi-step reasoning tasks.
method Theoretical analysis of gradient descent dynamics and multi-phase training.
result Trained one-layer transformers can solve both backward and forward reasoning tasks with generalization guarantees.

Early stopping methods reduce unnecessary reasoning steps in LLMs by monitoring uncertainty signals.

problem LLMs sometimes generate unnecessary reasoning steps, especially under uncertainty.
method Statistically principled early stopping methods that monitor uncertainty signals during generation.
result Uncertainty-aware early stopping improves efficiency and reliability in LLM reasoning, especially in math reasoning.

Achieving artificial visual reasoning - the ability to answer image-related questions which require a multi-step, high-level process - is an important step towards artificial general intelligence. This multi-modal task requires learning a question-dependent, structured reasoning process over images from language. Stand…

2017-07-10abs ↗pdf ↗