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

Trend · papers per month

62124185247 · Jun 202019922001200920172026
48 results for modular regularization

A new method integrates forms on Riemann surfaces, leading to modular forms.

problem Integrating differential forms with poles on Riemann surfaces.
method Simple procedure to integrate differential forms with arbitrary holomorphic poles, establishing an analytic theory for integrals over configuration spaces.
result Regularized graph integrals on elliptic curves are almost-holomorphic modular forms.

This paper extends foliation concepts to singular foliations using Lie \infty-algebroids.

problem Cohomological obstruction to volume forms in singular foliations.
method Replacing singular foliations with universal Lie \infty-algebroids to define modular class.
result Geometric meaning of modular class as an obstruction to universal Lie \infty-algebroids.

We investigate modular embeddings for semi-arithmetic Fuchsian groups. First we prove some purely algebro-geometric or even topological criteria for a regular map from a smooth complex curve to a quaternionic Shimura variety to be covered by a modular embedding. Then we set up an adelic formalism for modular embeddings…

2015-09-02abs ↗pdf ↗

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.

Dynamic information balancing reduces catastrophic forgetting in modular neural networks.

problem Catastrophic forgetting in neural networks when learning multiple tasks.
method Dynamic Information Balancing (DIB) using reinforcement learning to adaptively route inputs based on module information load.
result DIB combined with EWC regularization outperforms models with similar capacity and EWC regularization.

We introduce linear holonomy on Poisson manifolds. The linear holonomy of a Poisson structure generalizes the linearized holonomy on a regular symplectic foliation. However, for singular Poisson structures the linear holonomy is defined for the lifts of tangential path to the cotangent bundle (cotangent paths). The lin…

1998-12-28abs ↗pdf ↗

We study the behavior of the modular class of an orientable Poisson manifold and formulate some unimodularity criteria in the semilocal context, around a (singular) symplectic leaf. Our results generalize some known unimodularity criteria for regular Poisson manifolds related to the notion of the Reeb class. In particu…

2017-01-31abs ↗pdf ↗

Bayesian methods detect clusters in noisy data more reliably.

problem Noisy data distorts traditional clustering methods, leading to unreliable results.
method Bayesian community detection using Minimum Description Length principle.
result Bayesian methods identify more robust clusters in noisy data.

New methods detect modular structure in neural networks, revealing surprising effects of dropout.

problem Detecting functional modules in neural networks for learning, compositionality, and generalization.
method Two families of methods: upstream and downstream, to define similarity between units.
result Dropout dramatically increased modularity, and there's little agreement between upstream and downstream methods.

A framework for modular training of robust generative models.

problem Training large generative models is resource-intensive and requires heuristic tuning.
method Modular training using a gating mechanism and a minimax game to find a robust gate.
result The modular approach can theoretically outperform monolithic baselines and is scalable.

Theoretical analysis explains why models generalize after overfitting in modular addition.

problem Understanding why models generalize after overfitting in modular addition.
method Theoretical analysis and gradient descent behavior of two-layer quadratic networks and Transformers.
result Two-layer quadratic networks and simple Transformers generalize well after initially overfitting, indicating grokking.

Study compares two methods to extend Z^\widehat{Z} invariants, finding incompatibility for Brieskorn spheres.

problem Comparing two methods to extend Z^\widehat{Z} invariants for 3-manifolds.
method Two prescriptions: regularized +1/r+1/r-surgery combined with false-mock modular conjecture, and resurgence-based construction.
result Incompatibility found between the two prescriptions for some Brieskorn spheres.

New method for scalable barycenter computation using Wasserstein gradient flows.

problem Scalability and integration of label information in barycenter computation.
method Gradient flows in Wasserstein space, time discretization, mini-batch optimal transport, modular regularization, task-aware functions, supervised information integration.
result Empirically validated new state-of-the-art barycenter solver with labeled barycenters outperforming unlabeled ones.

Definition of the partition function of U(1) gauge theory is extended to a class of four-manifolds containing all compact spaces and certain asymptotically locally flat (ALF) ones including the multi-Taub--NUT spaces. The partition function is calculated via zeta-function regularization with special attention to its mo…

2010-05-31abs ↗pdf ↗

In this paper we investigate the curvature of conformal deformations by noncommutative Weyl factors of a flat metric on a noncommutative 2-torus, by analyzing in the framework of spectral triples functionals associated to perturbed Dolbeault operators. The analogue of Gaussian curvature turns out to be a sum of two fun…

2011-10-16abs ↗pdf ↗

Study interprets neural network generalization and memorization on corrupted data.

problem Understanding when a neural network has memorized corrupted data versus learned the underlying rule.
method Analyzes multi-layer perceptrons and Transformers on modular arithmetic tasks with corrupted labels.
result Regularization methods can force networks to ignore corrupted data, improving accuracy on uncorrupted data.

Scaling model capacity has been vital in the success of deep learning. For a typical network, necessary compute resources and training time grow dramatically with model size. Conditional computation is a promising way to increase the number of parameters with a relatively small increase in resources. We propose a train…

2018-11-13abs ↗pdf ↗

We compute the Moore-Witten regularized u-plane integral on CP^2, and we confirm their conjecture that it is the generating function for the SO(3)-Donaldson invariants of CP^2. We prove this conjecture using the theory of mock theta functions and harmonic Maass forms. We also derive further such generating functions fo…

2008-08-11abs ↗pdf ↗

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 ↗

We find and propose an explanation for a large variety of modularity-related symmetries in problems of 3-manifold topology and physics of 3d N=2\mathcal{N}=2 theories where such structures a priori are not manifest. These modular structures include: mock modular forms, SL(2,Z)SL(2,\mathbb{Z}) Weil representations, quantum mo…

2018-09-26abs ↗pdf ↗

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 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.

Scalable methods for maximizing regularized submodular functions with improved memory and communication complexity.

problem Maximizing submodular functions with negative values and constraints.
method Developed one-pass streaming and distributed algorithms for maximizing regularized submodular functions.
result Improved memory and communication complexity by a factor of O(1/ε) compared to existing work.

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.

Our aim is to introduce and advocate non-ΣΣ (non-symmetric) modular operads. While ordinary modular operads were inspired by the structure of the moduli space of stable complex curves, non-ΣΣ modular operads model surfaces with open strings outputs. An immediate application of our theory is a short proof that the mod…

2014-10-13abs ↗pdf ↗

Neural networks learn modular arithmetic but not all, extending known solutions to generalize.

problem Neural networks struggle with modular arithmetic, especially for polynomials.
method Developed analytical solutions for MLP networks to learn modular addition and multiplication, then combined these solutions to generalize on arbitrary modular polynomials.
result Neural networks can learn and generalize solutions to modular polynomials, supporting the hypothesis that some polynomials are learnable.

Fuchsian groups with a modular embedding have the richest arithmetic properties among non-arithmetic Fuchsian groups. But they are very rare, all known examples being related either to triangle groups or to Teichmueller curves. In Part I of this paper we study the arithmetic properties of the modular embedding and deve…

2015-03-19abs ↗pdf ↗

We introduce the notion of the modular class of a Lie algebroid equipped with a Nambu structure. In particular, we recover the modular class of a Nambu-Poisson manifold MM with its Nambu tensor ΛΛ as the modular class of the tangent Lie algebroid TMTM with Nambu structure Λ.Λ. We show that many known properties of th…

2016-09-16abs ↗pdf ↗

Quantum modularity proved for SU(2) TQFT signature on genus 2 surfaces.

problem Proving quantum modularity of SU(2) TQFT signature for genus 2 surfaces.
method Using quantum modularity of generalized Dedekind sums associated with modular forms and trigonometric sum expressions.
result Quantum modularity of SU(2) TQFT signature on genus 2 surfaces proved.

Motivated by a question of Hirzebruch on the possible topological types of cusp cross-sections of Hilbert modular varieties, we give a necessary and sufficient condition for a manifold M to be diffeomorphic to a cusp cross-section of a Hilbert modular variety. Specialized to Hilbert modular surfaces, this proves that e…

2007-06-25abs ↗pdf ↗

Study Alexander polynomials of modular knots, revealing finite and infinite coefficient properties.

problem Investigate Alexander polynomials of modular knots.
method Use Burau representation and geometric SL2(Z)\mathrm{SL}_2(\mathbb{Z})-invariants.
result Alexander polynomials of modular knots have both finite and infinite coefficient properties.

In this paper the exact linear relation between the leading eigenvectors of the modularity matrix and the singular vectors of an uncentered data matrix is developed. Based on this analysis the concept of a modularity component is defined, and its properties are developed. It is shown that modularity component analysis …

2015-10-19abs ↗pdf ↗

Sharp lower bounds for modular invariants and Dehn twist coefficients in genus 2 and 3.

problem Finding sharp lower bounds for modular invariants and Dehn twist coefficients.
method Analyzing the relation between fractional Dehn twists and modular invariants, classifying pseudo-periodic maps, and proving rigidity properties.
result Sharp lower bounds for modular invariants and Dehn twist coefficients in genus 2 and 3.