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.

169,181 papers · 148 categories

Trend · papers per month

53107160213 · Jun 202019922001200920182026
48 results for position modulation

FI-modules were introduced by the first three authors in [CEF] to encode sequences of representations of symmetric groups. Over a field of characteristic 0, finite generation of an FI-module implies representation stability for the corresponding sequence of S_n-representations. In this paper we prove the Noetherian pro…

2012-10-05abs ↗pdf ↗

We derive a general obstruction to the existence of Riemannian metrics of positive scalar curvature on closed spin manifolds in terms of hypersurfaces of codimension two. The proof is based on coarse index theory for Dirac operators that are twisted with Hilbert C*-module bundles. Along the way we give a complete and s…

2014-02-17abs ↗pdf ↗

Skein modules are the main objects of an algebraic topology based on knots (or position). In the same spirit as Leibniz we would call our approach "algebra situs." When looking at the panorama of skein modules we see, past the rolling hills of homologies and homotopies, distant mountains - the Kauffman bracket skein mo…

1998-09-21abs ↗pdf ↗

In this paper, we consider the similarity and quasi-affinity problems for Hilbert modules in the Cowen-Douglas class associated with the complex geometric objects, the hermitian anti-holomorphic vector bundles and curvatures. Given a "simple" rank one Cowen-Douglas Hilbert module M\mathcal{M}, we find necessary and su…

2012-12-12abs ↗pdf ↗

A framework evaluates the impact of different modules in graph contrastive learning.

problem Insufficient module-level evaluation in existing graph contrastive learning methods.
method Proposes a framework decomposing GCL models into four modules for module-level evaluation.
result Identifies module-level guidelines and competitive performance of different modules.

Novel GP-modulated Cox process framework with linear inequality constraints.

problem Modeling point patterns with positiveness and inequality constraints.
method Directly impose positiveness and inequality constraints on the Gaussian process without restrictions on covariance functions.
result Accurate inference of intensity functions with improved results for monotonic processes.

We propose a new point of view on quantum cohomology, strongly motivated by the work of Givental and Dubrovin, but closer to differential geometry than the existing approaches. The central object is the D-module which "quantizes" a commutative algebra associated to the (uncompactified) space of rational curves. A stand…

2002-06-20abs ↗pdf ↗

We identify branched coverings (continuous open surjections p:Y->X of Hausdorff spaces with uniformly bounded number of pre-images) with Hilbert C*-modules C(Y) over C(X) and with faithful unital positive conditional expectations E:C(Y)->C(X) topologically of index-finite type. The case of non-branched coverings corres…

2010-02-18abs ↗pdf ↗

We describe in this chapter (Chapter IX) the idea of building an algebraic topology based on knots (or more generally on the position of embedded objects). That is, our basic building blocks are considered up to ambient isotopy (not homotopy or homology). For example, one should start from knots in 3-manifolds, surface…

2006-02-13abs ↗pdf ↗

A standard technique for understanding underlying dependency structures among a set of variables posits a shared conditional probability distribution for the variables measured on individuals within a group. This approach is often referred to as module networks, where individuals are represented by nodes in a network, …

2014-05-11abs ↗pdf ↗

We define new higher-order Alexander modules An(C)\mathcal{A}_n(C) and higher-order degrees δn(C)δ_n(C) which are invariants of the algebraic planar curve CC. These come from analyzing the module structure of the homology of certain solvable covers of the complement of the curve CC. These invariants are in the spirit of th…

2005-09-21abs ↗pdf ↗

Efficiently accelerates attention calculation for Transformers with relative positional encoding.

problem Quadratic complexity of attention in long sequences.
method Kernelized attention with Fast Fourier Transform (FFT) for RPE.
result Achieves O(n log n) time complexity, mitigates training instability, and outperforms other models.

Improves Bayesian optimization efficiency for mixed variable spaces.

problem Boosting sample efficiency in Bayesian optimization for mixed variable spaces.
method Proposes frequency modulated (FM) kernels to model complex dependencies across different types of variables.
result BO-FM outperforms competitors in various optimization problems.

We construct the first combinatorial 1-cocycle with values in the Z[x,x1] \mathbb{Z} [x,x^{-1}]-module of isotopy classes of singular long knots in 3-space with a signed planar double point, and which represents a non trivial cohomology class in the topological moduli space of long knots. It can be interpreted as an invaria…

2014-05-21abs ↗pdf ↗

For a closed manifold equipped with a Riemannian metric, a triangulation, a representation of its fundamental group on an Hilbert module of finite type (over of finite von Neumann algebra), and a Hermitian structure on the flat bundle associated to the representation, one defines a numerical invariant, the relative tor…

1997-11-25abs ↗pdf ↗

Torsion objects of von Neumann categories describe the phenomen "spectrum near zero" discovered by S. Novikov and M. Shubin. In this paper we classify Hermitian forms on torsion objects of a finite von Neumann category. We prove that any such form can be represented as a discriminant form of a degenerate Hermitian form…

1999-03-23abs ↗pdf ↗

A new method for matching binary distributions using compressed sensing.

problem Matching fixed-length binary distributions efficiently.
method Inspired by compressed sensing, the paper introduces sparsity in binary sources via position modulation and a simple exact matcher based on Gaussian signal quantization. The dematcher uses GAMP for low-complexity dematching.
result The proposed method achieves asymptotically optimal performance, with vanishing reconstruction error in a proper limit.

Improved trading strategy using deep learning and changepoint detection for market changes.

problem Traditional momentum strategies struggle with rapid market changes, especially after trend reversals.
method Inserted an online changepoint detection module into a Deep Momentum Network (DMN) pipeline.
result Improvement in Sharpe ratio by one-third over 1995-2020 period, especially beneficial in nonstationary periods.

We lift ambit fields as introduced by Barndorff-Nielsen and Schmiegel to a class of Hilbert space-valued volatility modulated Volterra processes. We name this class Hambit fields, and show that they can be expressed as a countable sum of weighted real-valued volatility modulated Volterra processes. Moreover, Hambit fie…

2015-09-28abs ↗pdf ↗

Let kk be a subring of the field of rational functions in x,v,sx, v, s which contains x±1,v±1,s±1x^{\pm 1}, v^{\pm 1}, s^{\pm 1}. If MM is an oriented 3-manifold, let S(M)S(M) denote the Homflypt skein module of MM over kk. This is the free kk-module generated by isotopy classes of framed oriented links in MM quotiented by the…

2000-07-20abs ↗pdf ↗

A mathematical isomorphism connects Floer homology to DAHA representations.

problem Connecting Floer homology to DAHA representations.
method Isomorphism between Floer homology and DAHA module structure.
result Establishes equivalence between DAHA polynomial representation and Floer homology module structure.

Kriformer uses graph transformers to estimate data in sparse sensor areas.

problem Sparse sensor deployment and unreliable data in spatiotemporal kriging tasks.
method Graph transformer model with positional encoding and attention mechanisms.
result Kriformer excels in representing unobserved locations in spatiotemporal kriging tasks.

Elliptic Chern characters and Atiyah-Witten formula generalized to double loop spaces.

problem Generalizing classical Atiyah-Witten formula to double loop spaces.
method Constructing elliptic Chern and Bismut-Chern characters, defining elliptic holonomy, and using equivariant twisted parallel transport.
result Established elliptic Atiyah-Witten formula on double loop space.

Researchers develop a new basis to simplify solving infinite systems for HOMFLYPT skein module of lens spaces.

problem Computing the HOMFLYPT skein module of lens spaces L(p,1)L(p, 1) via braids.
method Using a new basis ΛΛ of the HOMFLYPT skein module of the solid torus, relating infinite systems of equations obtained by performing braid band moves on elements in Λ+Λ^+ and ΛΛ^- via a map II.
result Reduced complexity in solving the infinite system of equations for L(p,1)L(p, 1) using braids.

New method learns both module structure and sequencing in neural networks.

problem Learning only the parameters and order of execution of neural modules.
method Expands the approach to learn the internal structure of modules, including the ordering and combination of arithmetic operators.
result Performance comparable to hand-designed modules achieved without extra supervisory signals.

New analysis shows PE in Transformers increases generalization gap and vulnerability.

problem Understanding the impact of PE on Transformer generalization and robustness.
method Generalization analysis and adversarial Rademacher bounds for a single-layer Transformer with trainable PE.
result PE systematically enlarges the generalization gap and makes models more vulnerable to attacks.

Curvature defined for Hilbert modules and Kasparov modules.

problem Defining and studying curvature in Hilbert modules and Kasparov modules.
method Introduced curvature for densely defined universal connections on Hilbert CC^{*}-modules relative to spectral triples.
result Curvature only depends on the represented form of the universal connection modulo junk forms.