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

3486961,0431,391 · Jun 202019922001200920172026
48 results for finitely generated chain complexes

Link Floer homology is split into snake complexes and local systems.

problem Classifying link Floer complexes over specific rings.
method Classifying isomorphism and chain homotopy equivalence classes of free chain complexes over a specific ring, then applying these results to link Floer complexes.
result Link Floer complexes split uniquely into snake complexes and local systems.

We prove an analogue of the de Rham theorem for the extended L^2-cohomology introduced by M. Farber. This is done by establishing that the de Rham complex over a compact closed manifold with coefficients in a flat Hilbert bundle E of A-modules over a finite von Neumann algebra A is chain-homotopy equivalent (with bound…

1996-10-11abs ↗pdf ↗

Study nonparametric estimator for Markov chain transition matrices in offline setting.

problem Estimating transition matrices of finite controlled Markov chains from logged data.
method Developed sample complexity bounds and conditions for minimaxity.
result Achieving certain statistical risk requires balancing mixing properties and sample size.

For a Lie-Rinehart algebra (A,L) such that, as an A-module, L is finitely generated and projective of finite constant rank, the relationship between generators of the Gerstenhaber bracket and connections on the highest A-exterior power of L given in an earlier paper arises from the canonical pairing between the exterio…

2000-10-03abs ↗pdf ↗

Let f:MRf:M \rightarrow \mathbb{R} be a Morse-Bott function on a finite dimensional closed smooth manifold MM. Choosing an appropriate Riemannian metric on MM and Morse-Smale functions fj:CjRf_j:C_j \rightarrow \mathbb{R} on the critical submanifolds CjC_j, one can construct a Morse chain complex whose boundary operator is…

2011-10-20abs ↗pdf ↗

New bounds for SMC show its advantage over MCMC in multimodal distributions.

problem Estimating expectations under multimodal distributions with slow global mixing.
method Proves finite sample complexities for SMC with local mixing times, addressing bias through sequential resampling.
result SMC provides fully polynomial time approximation for multimodal problems.

Deep neural networks optimize inventory decisions in complex supply chains.

problem Optimizing inventory decisions in stochastic multi-echelon supply chains.
method Pairwise modeling and DNN agents for order-up-to levels.
result The method performs better than alternate methods in general supply chain networks.

In his 2011 work, Maas has shown that the law of any time-reversible continuous-time Markov chain with finite state space evolves like a gradient flow of the relative entropy with respect to its stationary distribution. In this work we show the converse to the above by showing that if the relative law of a Markov chain…

2014-05-11abs ↗pdf ↗

Transformers solve parity problems efficiently with step-by-step reasoning.

problem Training transformers to solve complex, recursive problems like parity.
method Training a one-layer transformer to solve kk-parity, incorporating intermediate parities into the loss function, and using teacher forcing or augmented data.
result Transformers can learn parity in one gradient update with intermediate supervision or self-consistency checks.

This paper introduces an inner product on chain complexes of finite simplicial complexes that is well-adapted to the harmonic study of subdivisions. Its definition utilizes a decomposition of the chain spaces that suggests a sequence of subdivision invariants which we show do not all vanish for non-trivial subdivisions…

2008-07-26abs ↗pdf ↗

We refine the Whitehead torsion of a chain equivalence of finite chain complexes in an additive category $\bA$ from an element of $\widetilde{K}^{iso}_1(\bA)$ to an element of the absolute group $K_1^{iso}(\bA)$. We apply this invariant to symmetric Poincaré complexes and identify it in terms of more traditional invari…

2005-02-16abs ↗pdf ↗

The paper computes torsion invariants for groups acting on complexes.

problem Computing torsion invariants for groups acting on complexes.
method Analyzes residually finite groups acting cocompactly on contractible complexes with specific stabilizers.
result Torsion limits to the torsion of the boundary subcomplex, independent of the chain of subgroups.

We prove (without using Federer's structure theorem) that a finite-mass flat chain over any coefficient group is rectifiable if and only if almost all of its 0-dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a simple necessary and su…

1999-07-01abs ↗pdf ↗

In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion of torsion generalizes the torsion of acyclic based chain complexes, and is a ch…

2006-08-18abs ↗pdf ↗

The paper proves inequalities for Steklov eigenvalues on finite graphs.

problem Eigenvalues of Laplacians for reversible Markov chains and Steklov eigenvalues.
method Generalized Cheeger inequalities, convergence results, and resolvent convergence.
result Sharp estimate for the first non-trivial Steklov eigenvalue.

We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the matrices corresponding to the differential in each dimension to the Smith normal form, …

2001-10-31abs ↗pdf ↗

New results on homology torsion growth for various groups.

problem Understanding the growth of higher torsion homologies for arithmetic lattices and other groups.
method Quantitative homotopical method called effective rebuilding, constructing small classifying spaces of finite index subgroups.
result Strong asymptotic bounds for the torsion growth in principal congruence subgroups.

Optimal sample complexity for autoregressive chain-of-thought learning proven.

problem Determining the minimum number of samples needed for accurate autoregressive chain-of-thought learning.
method Proved upper bound on sample complexity using Daniely-Shalev-Shwartz dimension and roll-out stable parity dimension.
result The sample complexity is bounded by the local next-token class rate, with no dependence on rollout length.

In this paper we present a new theory of calculus over kk-dimensional domains in a smooth nn-manifold, unifying the discrete, exterior, and continuum theories. The calculus begins at a single point and is extended to chains of finitely many points by linearity, or superposition. It converges to the smooth continuum w…

2006-01-09abs ↗pdf ↗

The paper extends Hoeffding's inequality for Markov chains using a generalized concentrability condition.

problem Applying Hoeffding's inequality to non-ergodic Markov chains.
method Integrates generalized concentrability condition via IPM to extend traditional hypotheses.
result Demonstrates utility in machine learning applications such as empirical risk minimization and bandits.

A method for learning with autoregressive chain-of-thoughts.

problem Learning prompt-to-answer mappings from sequence-to-next-token generators.
method Iterating a fixed, time-invariant generator for multiple steps to generate a chain-of-thought, then taking the final token as the answer.
result Universal representability and computationally tractable chain-of-thought learning for a simple base class.

Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a variant of stochastic gradient descent where the random samples are taken on the t…

2018-09-12abs ↗pdf ↗

There is a canonical way to associate two simplicial complexes K, L to any relation RX×YR\subset X\times Y. Moreover, the geometric realizations of K and L are homotopy equivalent. This was studied in the fifties by C.H. Dowker. In this article we prove a Galois-type correspondence for relations RX×YR\subset X\times Y when…

2007-02-07abs ↗pdf ↗

A discrete (finite-difference) analogue of differential forms is considered, defined on simplicial complexes, including triangulations of continuous manifolds. Various operations are explicitly defined on these forms, including exterior derivative and exterior product. The latter one is non-associative. Instead, as ant…

2007-04-19abs ↗pdf ↗

Fix an integer N>1. To each diagram of a link colored by 1,...,N, we associate a chain complex of graded matrix factorizations. We prove that the homotopy type of this chain complex is invariant under Reidemeister moves. When every component of the link is colored by 1, this chain complex is isomorphic to the chain com…

2009-07-03abs ↗pdf ↗

We give a new proof of the Morse Homology Theorem by constructing a chain complex associated to a Morse-Bott-Smale function that reduces to the Morse-Smale-Witten chain complex when the function is Morse-Smale and to the chain complex of smooth singular NN-cube chains when the function is constant. We show that the ho…

2006-12-12abs ↗pdf ↗

Differential chains are a proper subspace of de Rham currents given as an inductive limit of Banach spaces endowed with a geometrically defined strong topology. Boundary is a continuous operator, as are operators that dualize to Hodge star, Lie derivative, pullback and interior product. Partitions of unity exist in thi…

2012-10-16abs ↗pdf ↗

This article surveys the use of configuration space integrals in the study of the topology of knot and link spaces. The main focus is the exposition of how these integrals produce finite type invariants of classical knots and links. More generally, we also explain the construction of a chain map, given by configuration…

2013-10-27abs ↗pdf ↗

New methods assess topological entanglement in periodic systems.

problem Assessing topological entanglement in systems with periodic boundary conditions.
method Introducing Periodic Jones polynomial and Cell Jones polynomial.
result Periodic Jones polynomial is a recurring factor of Jones polynomial of finite cutoffs.

We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…

2016-09-20abs ↗pdf ↗

This paper develops a Hoeffding inequality for the partial sums k=1nf(Xk)\sum_{k=1}^n f (X_k), where {Xk}kZ>0\{X_k\}_{k \in \mathbb{Z}_{> 0}} is an irreducible Markov chain on a finite state space SS, and f:S[a,b]f : S \to [a, b] is a real-valued function. Our bound is simple, general, since it only assumes irreducibility and finiteness…

2020-01-05abs ↗pdf ↗

We analyze a functor from cyclic operads to chain complexes first considered by Getzler and Kapranov and also Markl. This functor is a generalization of the graph homology considered by Kontsevich, which was defined for the three operads Comm, Assoc, and Lie. More specifically we show that these chain complexes have a …

2002-08-12abs ↗pdf ↗

Matrix Chernoff bound for Markov chains applied to co-occurrence matrices.

problem Analyzing the behavior of co-occurrence statistics in sequential data.
method Proved a matrix Chernoff-type bound for sums of matrix-valued random variables sampled via a regular Markov chain.
result Achieved exponentially fast convergence rate and sample complexity analysis for co-occurrence matrices.

Estimates covariance matrices using Markov chain Monte Carlo with improved sample complexity.

problem Complexity of covariance matrix estimation for Gibbs distributions.
method Uses Markov chain Monte Carlo with conditions on the chain's spectral gap and Poincaré inequality.
result Achieves similar sample complexity as i.i.d. samples with better query complexity.

Indian Buffet Process based models are an elegant way for discovering underlying features within a data set, but inference in such models can be slow. Inferring underlying features using Markov chain Monte Carlo either relies on an uncollapsed representation, which leads to poor mixing, or on a collapsed representation…

2017-03-09abs ↗pdf ↗