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

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920182026
48 results for modular computation

PICLE uses probabilistic models to efficiently evaluate and compose modules for continual learning.

problem Challenging search space of module compositions in continual learning.
method Probabilistic framework to cheaply compute module compositions' fitness.
result First modular CL algorithm to achieve perceptual, few-shot, and latent transfer.

A general question behind this paper is to explore a good notion for intrinsic curvature in the framework of noncommutative geometry started by Alain Connes in the 80s. It has only recently begun (2014) to be comprehended via the intensive study of modular geometry on the noncommutative two tori. In this paper, we exte…

2015-10-15abs ↗pdf ↗

A new modularity density measure improves community detection in heterogeneous networks.

problem Detecting meaningful communities in heterogeneous networks.
method Formulated a novel metric, modularity density, for undirected, weighted networks.
result Maximization of modularity density is free from bias and better at detecting weakly-separated communities.

Empirical risk minimization frequently employs convex surrogates to underlying discrete loss functions in order to achieve computational tractability during optimization. However, classical convex surrogates can only tightly bound modular loss functions, sub-modular functions or supermodular functions separately while …

2016-04-12abs ↗pdf ↗

Revealing a community structure in a network or dataset is a central problem arising in many scientific areas. The modularity function QQ is an established measure quantifying the quality of a community, being identified as a set of nodes having high modularity. In our terminology, a set of nodes with positive modular…

2017-08-18abs ↗pdf ↗

New method for clustering hypergraphs using modularity maximization.

problem Clustering on hypergraphs for various applications.
method Introduced a hypergraph null model and node-degree preserving reduction. Defined a modularity function and used the Louvain algorithm to maximize it. Proposed a refinement method.
result Demonstrated the efficacy and efficiency of the method on real-world datasets.

We show that the topological modular functor from Witten-Chern-Simons theory is universal for quantum computation in the sense a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the functor's state space. A computational model based on Chern-Simons theory at a fifth ro…

2000-01-29abs ↗pdf ↗

Quantum theory uses modular group representations to assign invariants to 3-manifolds.

problem Assigning invariants to 3-manifolds via modular group representations.
method Projective representations of the modular group derived from a noncommutative torus.
result Computed traces and determinants of matrices associated with modular group elements.

In this paper we provide descriptions of the Whitehead groups with coefficients in a ring of the Hilbert modular group and its reduced version, as well as for the topological K-theory of CC^*-algebras, after tensoring with Q\mathbb{Q}, by computing the source of the assembly maps in the Farrell-Jones and the Baum-Con…

2017-06-14abs ↗pdf ↗

Noise-driven neural networks emerge modular structures, improving robustness and generalization.

problem Artificial neural networks struggle with modular solutions, leading to poor generalization and robustness.
method Inspired by brain's modular architecture, the study uses neural noise and nonlinear responses to drive the emergence of modular solutions.
result Noise-driven modularisation improves robustness and generalization in neural networks.

New proof of rearrangement lemma for noncommutative tori using hypergeometric functions.

problem Proving rearrangement lemma in noncommutative tori.
method Using Lauricella functions of type D and Gauss hypergeometric functions.
result Full reduction of spectral functions to Gauss hypergeometric functions.

Study explores how neural networks and Transformers learn modular arithmetic with multiple inputs.

problem Understanding how neural networks and Transformers learn modular arithmetic with multiple inputs.
method Analytical characterization of features learned by neural networks and Transformers, focusing on margin maximization and Fourier spectra.
result Neural networks and Transformers require a minimum neuron count of \( m \geq 2^{2k-2} \cdot (p-1) \) to solve modular addition problems with \( k \) inputs and modulus \( p \).

Mathematical study supports connection between 3D manifolds and modular tensor categories.

problem Connecting geometric topology and quantum topology using Chern-Simons invariants and Reidemeister torsions.
method Developed an algorithm to generate modular TT-matrices and quantum dimensions from Seifert fibered spaces and torus bundles over the circle.
result Mathematically constructed premodular categories from Seifert fibered spaces and torus bundles over the circle, conjecturing their modularity under specific conditions.

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liqu…

2001-01-04abs ↗pdf ↗

Routing networks tackle challenges in modular and compositional computation.

problem Challenges in learning and training compositional models with module parameters and their composition.
method Routing networks as a general approach to address these challenges, examining the interplay of algorithmic decisions.
result Empirical analysis of routing networks reveals the interplay of challenges and design decisions.

Revisits SYM theory to compute Donaldson invariants using mock modular forms.

problem Computing Donaldson invariants in topological SYM theory.
method Uses mock modular forms and indefinite theta functions to evaluate correlation functions.
result Explicit evaluation of correlation functions leading to modular data predictions.

RLgraph separates RL tasks into modular components for stability and efficiency.

problem Algorithmic instability, hyper-parameter sensitivity, and distributed communication patterns in RL tasks.
method Introduces RLgraph, a library for RL tasks in static and define-by-run paradigms.
result Robust, testable, and high-performance implementations across different frameworks and backends.

We compute the Euler characteristics of the recently discovered series of Gothic Teichmüller curves. The main tool is the construction of 'Gothic' Hilbert modular forms vanishing at the images of these Teichmüller curves. Contrary to all previously known examples, the Euler characteristic is not proportional to the Eul…

2018-07-26abs ↗pdf ↗

Quantum invariants of three-manifolds linked to mock theta functions.

problem Quantum invariants of three-manifolds and their mock modular properties.
method Study of a specific class of Seifert three-manifolds and a conjecture on their quantum invariants.
result Illustration of mock modular properties of a quantum invariant for a specific three-manifold.

Modularity-aware GAE and VGAE improve community detection and link prediction.

problem Improving community detection with GAE and VGAE in the absence of node features.
method Introducing a modularity-aware message passing scheme and regularizer to GAE and VGAE encoders.
result Jointly addressing community detection and link prediction with high accuracy is possible.

Estimating graphical model structure from high-dimensional and undersampled data is a fundamental problem in many scientific fields. Existing approaches, such as GLASSO, latent variable GLASSO, and latent tree models, suffer from high computational complexity and may impose unrealistic sparsity priors in some cases. We…

2017-06-11abs ↗pdf ↗

Modular curves X1(N)X_{1}(N) parametrize elliptic curves with a point of order NN. They can be identified with connected components of projectivized strata PH(a,a)\mathbb{P}\mathcal{H}(a,-a) of meromorphic differentials. As strata of meromorphic differentials, they have a canonical walls-and-chambers structure defined by the …

2017-10-23abs ↗pdf ↗

Researchers create projective representations of Hecke groups using TQFT.

problem Constructing projective representations of Hecke groups.
method Using Witten-Reshetikhin-Turaev topological quantum field theory of higher genus surfaces.
result The representation's image group is infinite at low levels in genus 2.

The simplicial volume introduced by Gromov provides a topologically accessible lower bound for the minimal volume. Lafont and Schmidt proved that the simplicial volume of closed, locally symmetric spaces of non-compact type is positive. In this paper, we present a generalization of this result to certain non-compact lo…

2007-06-26abs ↗pdf ↗

New modular data from torus bundles via particle-hole equivariantization.

problem Constructing modular tensor categories from 3-manifolds.
method Using Chern-Simons invariants and adjoint Reidemeister torsions, and performing Z2\mathbb{Z}_2-equivariantization.
result Modular data from torus bundles realized by Z2\mathbb{Z}_2-equivariantization of premodular categories.

Researchers found the global topology of the Eisenstein-Picard modular surface.

problem Understanding the global topology of the Eisenstein-Picard modular surface.
method Quotient space of the complex hyperbolic plane by the modular group.
result Determined the global topology of the Eisenstein-Picard modular surface as a 4-orbifold.

Study the Mexican stock market's interdependency structure from 2000-2019.

problem Characterize the interdependency structure of the Mexican Stock Exchange.
method Estimate correlation/concentration matrices from different models and compute network theory metrics.
result Visualizations provide a comprehensive overview of the stock market's interdependency structure.

Study modular surfaces in Lorentz-Minkowski 3-space, classifying and analyzing their curvature and applications.

problem Understanding the curvature properties of modular surfaces in Lorentz-Minkowski space.
method Analyzing the sign of Gaussian and mean curvature, classifying surfaces, and applying to conformal field theories.
result Complete classification of zero Gaussian curvature modular surfaces and non-existence of non-planar maximal modular surfaces.

Modular neural networks generalize better with less data.

problem Theoretical and practical understanding of how modularity improves neural network generalization.
method Theoretical analysis of sample complexity, development of a novel learning rule.
result Modular networks require fewer samples to generalize compared to nonmodular networks, especially in high-dimensional tasks.

New mapping class group actions on Hochschild complexes for modular categories.

problem Understanding actions of mapping class groups on Hochschild complexes of modular categories.
method Construction of a symmetric monoidal functor with excision property.
result Homotopy coherent projective action of mapping class groups on Hochschild complexes.