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

Trend · papers per month

50101151201 · May 202619922001200920172026
48 results for geometric intuition

In this expository article, we introduce the topological ideas and context central to the Poincare Conjecture. Our account is intended for a general audience, providing intuitive definitions and spatial intuition whenever possible. We define surfaces and their natural generalizations, manifolds. We then discuss the cla…

2008-03-02abs ↗pdf ↗

Survey of minimal generating sets for nonorientable mapping class groups.

problem Challenges in generating minimal sets for nonorientable surfaces.
method Detailed analysis of various generating sets, including torsions, involutions, and commutators.
result For large genus, both Mod(Ng)\mathrm{Mod}(N_{g}) and Tg\mathcal{T}_{g} are generated by two elements.

GeoStat simplifies time series classification with fast, intuitive features.

problem Efficiently classify time series data without high computational costs.
method GeoStat representations based on differential geometric statistics.
result Simple KNN and SVM classifiers achieve state-of-the-art performance.

Generative Adversarial Nets (GANs) represent an important milestone for effective generative models, which has inspired numerous variants seemingly different from each other. One of the main contributions of this paper is to reveal a unified geometric structure in GAN and its variants. Specifically, we show that the ad…

2017-05-08abs ↗pdf ↗

This work introduces a geometric approach to probability representation and option pricing.

problem Representing probability distributions geometrically for better understanding and approximation.
method Introducing a geometric representation of probability using implied volatility and geometric transformations.
result Any probability distribution on positive reals can be represented by a planar curve, facilitating approximation and analysis.

Information Geometric Causal Inference (IGCI) is a new approach to distinguish between cause and effect for two variables. It is based on an independence assumption between input distribution and causal mechanism that can be phrased in terms of orthogonality in information space. We describe two intuitive reinterpretat…

2014-02-11abs ↗pdf ↗

We show that the two-component Hunter-Saxton system with negative coupling constant describes the geodesic flow on an infinite-dimensional pseudosphere. This approach yields explicit solution formulae for the Hunter-Saxton system. Using this geometric intuition, we conclude by constructing global weak solutions. The ma…

2012-01-24abs ↗pdf ↗

We consider the problem of detecting anomalies in a large dataset. We propose a framework called Partial Identification which captures the intuition that anomalies are easy to distinguish from the overwhelming majority of points by relatively few attribute values. Formalizing this intuition, we propose a geometric anom…

2019-12-08abs ↗pdf ↗

Study decision boundaries using heat diffusion and probabilistic techniques.

problem Understanding the geometry of decision boundaries in machine learning.
method Using Brownian motion and probabilistic techniques to analyze decision boundaries.
result Decision boundaries exhibit persistent 'wiggly and fuzzy' regions, even under adversarial attacks.

We study the problem of supervised learning for both binary and multiclass classification from a unified geometric perspective. In particular, we propose a geometric regularization technique to find the submanifold corresponding to a robust estimator of the class probability P(yx)P(y|\pmb{x}). The regularization term meas…

2015-03-04abs ↗pdf ↗

Paper formalizes multi-dimensional FSD using geometric methods.

problem Complex measure theory and calculus barriers to formalization in proof assistants.
method Geometric framework for first-order stochastic dominance in N dimensions.
result Geometric approach bypasses complex integration theory for direct comparison of survival probabilities.

The volume of a credal set correlates with epistemic uncertainty in binary classification but not in multi-class.

problem Representing and quantifying epistemic uncertainty in machine learning.
method Examined the geometric representation of credal sets as dd-dimensional polytopes and their volume as a measure of uncertainty.
result The volume of a credal set is a meaningful measure of epistemic uncertainty in binary classification but not in multi-class.

We argue that the existing regret matchings for Nash equilibrium approximation conduct "jumpy" strategy updating when the probabilities of future plays are set to be proportional to positive regret measures. We propose a geometrical regret matching which features "smooth" strategy updating. Our approach is simple, intu…

2019-08-18abs ↗pdf ↗

We derive and analyze a generic, recursive algorithm for estimating all splits in a finite cluster tree as well as the corresponding clusters. We further investigate statistical properties of this generic clustering algorithm when it receives level set estimates from a kernel density estimator. In particular, we derive…

2017-08-17abs ↗pdf ↗

Deep networks can adapt to intrinsic dimensionality beyond domain constraints.

problem Approximating functions on low-dimensional manifolds with high-dimensional data.
method Two-layer compositions with ReLU activation, using dimensionality reducing feature maps.
result Near optimal approximation rates depend on the complexity of the dimensionality reducing map, not the ambient dimension.

This paper is centred on solving differential equations by symmetry groups for first order ODEs and is in response to Starrett (2007). It also explores the possibility of averting the assumptions by Olver (2000) that, in practice finding the solutions of the linearized symmetry condition is usually a much more difficul…

2013-01-28abs ↗pdf ↗

The aim of this note is to present an alternative proof for an already known result relative to the solvability of the Dirichlet problem in Riemannian manifolds (see remark 0.1). In particular, we discuss the p-regularity (regularity relative to the p-laplacian) of domains of the form I = O-K, where O is a regular doma…

2010-02-10abs ↗pdf ↗

GCNs converge and remain stable on large random graphs, revealing geometric insights.

problem Understanding the behavior of GCNs on large, sparse random graphs.
method Analysis of GCNs on random graph models with latent variables and geometric edge probabilities.
result GCNs converge to their continuous counterparts as graph size increases, and are stable to small graph deformations.

Most research on the interpretability of machine learning systems focuses on the development of a more rigorous notion of interpretability. I suggest that a better understanding of the deficiencies of the intuitive notion of interpretability is needed as well. I show that visualization enables but also impedes intuitiv…

2017-11-20abs ↗pdf ↗

In this work, we examine the process of Tropical Polynomial Division, a geometric method which seeks to emulate the division of regular polynomials, when applied to those of the max-plus semiring. This is done via the approximation of the Newton Polytope of the dividend polynomial by that of the divisor. This process i…

2019-11-29abs ↗pdf ↗

Skeleton clustering detects clusters in high-dimensional data without needing prototypes.

problem Detecting clusters in high-dimensional data with irregular shapes.
method Skeleton clustering combines prototype methods, density-based clustering, and hierarchical clustering using surrogate density measures.
result Skeleton clustering reliably detects clusters in multivariate and high-dimensional data.

LemonadeBench evaluates LLMs' economic intuition through a simulated lemonade stand.

problem Evaluating LLMs' economic understanding and decision-making in simple markets.
method Simulated lemonade stand business to test LLMs' long-term planning and profit maximization.
result Models achieve profitability but exhibit local rather than global optimization.

We use tools from geometric statistics to analyze the usual estimation procedure of a template shape. This applies to shapes from landmarks, curves, surfaces, images etc. We demonstrate the asymptotic bias of the template shape estimation using the stratified geometry of the shape space. We give a Taylor expansion of t…

2016-09-06abs ↗pdf ↗

Researchers use LLMs to judge other LLMs, but this study provides a new geometric perspective to understand when it works.

problem The challenge of evaluating LLMs using other LLMs as judges, considering both aleatoric and epistemic uncertainties.
method A geometric perspective on ranking LLM candidates using probability simplices, analyzing conditions for identifiable rankings and designing Bayesian priors.
result Geometric analysis reveals that rankings based on LLM judges are robust in many but not all datasets, emphasizing the importance of modeling epistemic uncertainty.

This paper studies the canonical Chow quotient of a smooth projective variety by a reductive algebraic group. The main purpose is to give some topological interpretations and characterization of Chow quotient which have the advantage to be more intuitive and geometric. This is to be done over the field of complex numbe…

2003-08-04abs ↗pdf ↗

Developmental Robotics offers a new approach to numerous AI features that are often taken as granted. Traditionally, perception is supposed to be an inherent capacity of the agent. Moreover, it largely relies on models built by the system's designer. A new approach is to consider perception as an experimentally acquire…

2018-10-03abs ↗pdf ↗