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

72145217289 · May 202619922001200920172026
48 results for Algebraic statistics

Statistical Lie algebras with constant curvature are linked to locally conformally Kähler structures.

problem Characterizing Lie algebras with constant curvature and their geometric implications.
method Constructing statistical manifolds and Sasakian structures to relate Lie algebras to locally conformally Kähler structures.
result Statistical Lie algebras of constant curvature correspond to locally conformally Kähler Lie algebras.

New algebraic geometry and statistical manifold connections proven.

problem Understanding the structure of statistical manifolds and their algebraic properties.
method Developed relations between algebraic geometry, information theory, and Topological Field Theory.
result Statistical pre-Frobenius manifolds form algebraic varieties and have hexagonal, isoclinic webs.

We develop the necessary theory in computational algebraic geometry to place Bayesian networks into the realm of algebraic statistics. We present an algebra{statistics dictionary focused on statistical modeling. In particular, we link the notion of effiective dimension of a Bayesian network with the notion of algebraic…

2012-07-11abs ↗pdf ↗

Paper reviews algebraic research in machine learning theory.

problem Understanding phase transitions in machine learning models.
method Algebraic approaches in statistical mechanics.
result Algebraic methods are essential for analyzing machine learning models with singularities.

Paper uses algebraic signatures to identify probabilistic structures in empirical data.

problem Identifying probabilistic structure from observed binomials in empirical probability tensors.
method Treating vanishing binomials as algebraic signatures, matching signatures to identify models without parameter estimation.
result The method successfully identified rank-one structures in real language data, revealing interpretable sets of words.

We study the connections between link invariants, the chromatic polynomial, geometric representations of models of statistical mechanics, and their common underlying algebraic structure. We establish a relation between several algebras and their associated combinatorial and topological quantities. In particular, we def…

2008-06-20abs ↗pdf ↗

The statistical leverage scores of a complex matrix ACn×dA\in\mathbb{C}^{n\times d} record the degree of alignment between col(A)(A) and the coordinate axes in Cn\mathbb{C}^n. These score are used in random sampling algorithms for solving certain numerical linear algebra problems. In this paper we present a max-plus algebr…

2016-09-29abs ↗pdf ↗

A new algebra for probabilistic programming improves tail behavior accuracy.

problem Inaccurate tail behavior in probabilistic models based on neural networks.
method Developed a three-parameter tail asymptotics algebra based on the generalized Gamma distribution.
result Inference algorithms using the heavy-tailed algebra achieve superior performance.

Quantum statistical models with singularities are studied for state estimation and model selection.

problem Understanding statistical properties of quantum singular models.
method Classical singular learning theory extended to quantum state estimation and model selection using algebraic geometrical methods.
result Asymptotically unbiased estimator (QWAIC) for quantum generalization loss constructed.

This paper provides a construction of a quantum statistical mechanical system associated to knots in the 3-sphere and cyclic branched coverings of the 3-sphere, which is an analog, in the sense of arithmetic topology, of the Bost-Connes system, with knots replacing primes, and cyclic branched coverings of the 3-sphere …

2016-02-16abs ↗pdf ↗

Despite their popularity, many questions about the algebraic constraints imposed by linear structural equation models remain open problems. For causal discovery, two of these problems are especially important: the enumeration of the constraints imposed by a model, and deciding whether two graphs define the same statist…

2018-07-10abs ↗pdf ↗

Generative model designs highly designable proteins using geometric algebra.

problem Creating proteins with diverse and statistically accurate secondary structures.
method Introduced a geometric algebra flow matching model (FrameFlow) with Clifford Frame Attention (CFA) for protein backbone design.
result Achieved high designability, diversity, and novelty in protein backbone sampling.

Paper explores the Jones polynomial and its impact on knot theory and related fields.

problem Exploring the Jones polynomial and its applications in knot theory.
method Recalling the Jones polynomial and its development, discussing its connections to various mathematical and physical contexts.
result The Jones polynomial has wide-ranging applications and connections in mathematics and physics.

The generic identification problem is to decide whether a stochastic process (Xt)(X_t) is a hidden Markov process and if yes to infer its parameters for all but a subset of parametrizations that form a lower-dimensional subvariety in parameter space. Partial answers so far available depend on extra assumptions on the pro…

2011-01-19abs ↗pdf ↗

In this paper, we consider formal series associated with events, profiles derived from events, and statistical models that make predictions about events. We prove theorems about realizations for these formal series using the language and tools of Hopf algebras.

2009-01-18abs ↗pdf ↗

The paper studies the graph geometry of finite groups, creating a dataset and analyzing its properties.

problem Understanding how group-theoretic structure is reflected in Cayley graph observables.
method Construction of a dataset of Cayley graphs for groups of order up to 767, analysis of graph statistics, and comparison of model performance.
result Graph statistics are highly informative for predicting group properties, and GNNs can recover substantial structural signal.

Kernelized cumulants improve statistical analysis in high-dimensional spaces.

problem Statistical analysis in high-dimensional spaces with low variance estimators.
method Extending cumulants to RKHS using tensor algebra and kernel trick.
result Kernelized cumulants provide new all-purpose statistics with computational tractability.

This paper offers a new algebraic perspective of GCCA using subspace intersection.

problem Finding common variables across multiple feature representations.
method Subspace intersection approach based on a (bi-)linear generative model.
result GCCA is equivalent to subspace intersection, with conditions for identifiable common subspace.

The study examines how permutation-based optimization performance varies across different function representations.

problem Understanding how the order of function evaluations affects optimization performance.
method Iterative search setting with sampling without replacement, algebraic function recombination, correlation analysis, hierarchical clustering, PCA, ANOVA.
result Algebraically modified benchmarks yield stable re-rankings and coherent clusters of functions and sampling policies, indicating non-additive search effort.

The paper provides exact multivariate amplitude distributions for non-stationary Gaussian or algebraic fluctuations.

problem Capturing the statistical properties of fluctuating correlations in non-stationary systems.
method Developed a random matrix model to average multivariate amplitude distributions from short time scales to large time scales.
result Explicit multivariate distributions for non-stationary correlation systems are provided, capturing the degree of non-stationarity.

Quantum probability theory reveals hidden structure in joint probability distributions.

problem Understanding hidden structure in joint probability distributions.
method Modeling joint probability distributions as density operators and applying partial trace.
result Decoding extra information in reduced density operators that captures subsystem interactions.

Unified analysis of multilabel Fisher discriminants with improved dimensionality and robustness.

problem Improving discriminant analysis for multilabel classification with enhanced dimensionality and robustness.
method Unified theoretical analysis of multilabel Fisher discriminants with algebraic and statistical guarantees.
result Unified characterization of multilabel Fisher objectives and their equivalence under orthogonality constraints.

We derive optimal statistical and computational complexity bounds for exp-concave stochastic minimization in terms of the effective dimension. For common eigendecay patterns of the population covariance matrix, this quantity is significantly smaller than the ambient dimension. Our results reveal interesting connections…

2018-05-21abs ↗pdf ↗

Unified analysis of multilabel Fisher discriminants with improved dimensionality and robustness.

problem Improving discriminant analysis for multilabel classification with enhanced dimensionality and robustness.
method Unified algebraic and statistical analysis of multilabel Fisher discriminants with Stiefel orthogonality constraints.
result Equivalence of four Fisher objectives under the Stiefel constraint and improved discriminant dimensionality.

Researchers derive the relation between temperature and volatility in ideal agent systems.

problem Deriving the exact algebraic relation between temperature and volatility in ideal agent systems.
method Analogy with spin systems from statistical physics.
result Derive the exact algebraic relation between temperature and volatility for an ideal agent system.

Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which s…

2013-01-23abs ↗pdf ↗

Paper connects free-energy and low-degree hardness in high-dimensional statistics.

problem High-dimensional statistical inference problems are computationally hard.
method Defines a free-energy criterion and connects it to low-degree hardness.
result Establishes connection between free-energy and low-degree hardness for Gaussian models.

Open problem: Establishing bounds for Cayley-table completion to discover discrete algorithmic axioms.

problem Discovering discrete algorithmic axioms missing in deep learning.
method Cayley-table completion as a testbed for algorithmic complexity minimization.
result Formal exact recovery bounds for Cayley-table completion.