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

10192938 · May 202619922001200920172026
48 results for modular interface

We define and study the problem of modular concept learning, that is, learning a concept that is a cross product of component concepts. If an element's membership in a concept depends solely on it's membership in the components, learning the concept as a whole can be reduced to learning the components. We analyze this …

2019-11-07abs ↗pdf ↗

New techniques prove quantum modularity for various functions.

problem Proving quantum modularity of false theta functions and related series.
method Developed techniques including Poisson summation formula and modular series framework.
result Unified approach to proving quantum modularity for various functions.

Torch-Points3D simplifies 3D deep learning research and reproducibility.

problem Lack of transparency and reproducibility in 3D deep learning research.
method Modular framework with quality-of-life features, standardized protocols, and open-source implementation.
result Facilitates fair and rigorous evaluation of 3D deep learning methods.

FinRL-X unifies trading components for AI and rule-based strategies.

problem Inconsistent between research and live deployment in trading platforms.
method Modular architecture integrating data processing, strategy construction, backtesting, and execution.
result Unified protocol supports AI and rule-based trading components without altering execution.

End-to-end optimization has achieved state-of-the-art performance on many specific problems, but there is no straight-forward way to combine pretrained models for new problems. Here, we explore improving modularity by learning a post-hoc interface between two existing models to solve a new task. Specifically, we take i…

2019-02-21abs ↗pdf ↗

Neural architecture search methods are able to find high performance deep learning architectures with minimal effort from an expert. However, current systems focus on specific use-cases (e.g. convolutional image classifiers and recurrent language models), making them unsuitable for general use-cases that an expert migh…

2019-09-30abs ↗pdf ↗

Predictive modelling and supervised learning are central to modern data science. With predictions from an ever-expanding number of supervised black-box strategies - e.g., kernel methods, random forests, deep learning aka neural networks - being employed as a basis for decision making processes, it is crucial to underst…

2018-01-02abs ↗pdf ↗

One obstacle to the use of Gaussian processes (GPs) in large-scale problems, and as a component in deep learning system, is the need for bespoke derivations and implementations for small variations in the model or inference. In order to improve the utility of GPs we need a modular system that allows rapid implementatio…

2020-03-02abs ↗pdf ↗

OpenGM is a C++ template library for defining discrete graphical models and performing inference on these models, using a wide range of state-of-the-art algorithms. No restrictions are imposed on the factor graph to allow for higher-order factors and arbitrary neighborhood structures. Large models with repetitive struc…

2012-06-01abs ↗pdf ↗

TODS automates time series outlier detection with customizable pipelines.

problem Automated detection of outliers in time series data.
method Modular system with 70 primitives for data processing, time series analysis, and detection algorithms. GUI and data-driven searcher for pipeline design.
result Automated discovery and construction of effective outlier detection pipelines.

In this work we present Ludwig, a flexible, extensible and easy to use toolbox which allows users to train deep learning models and use them for obtaining predictions without writing code. Ludwig implements a novel approach to deep learning model building based on two main abstractions: data types and declarative confi…

2019-09-17abs ↗pdf ↗

New interface explains contextual bandits to non-experts.

problem Interpreting and managing contextual bandits for non-expert operators.
method Developed a metric 'value gain' for off-policy evaluation and designed an interface to explain bandit behavior.
result Empowered non-experts to manage complex machine learning systems through accessible presentation.

We consider the regularity of an interface between two incompressible and inviscid fluids flows in the presence of surface tension. We obtain local in time estimates on the interface in H32k+1H^{\frac32k +1} and the velocity fields in H32kH^{\frac32k}. These estimates are obtained using geometric considerations which show th…

2006-09-20abs ↗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 ↗

Study boundary behavior of limit interfaces in Riemannian manifolds without convexity assumptions.

problem Boundary behavior of limit interfaces in Riemannian manifolds.
method Proves limit-interface is a free boundary varifold, integer rectifiable up to boundary.
result No convexity assumption required; valid even when limit-interface clusters near boundary.

Paper presents a modular RL framework for Forex trading, addressing limitations of prior studies.

problem Challenges in applying RL to Forex trading, including unrealistic environments, simplified rewards, and restricted action spaces.
method Integrates three components: a friction-aware execution engine, a decomposable reward architecture, and a discrete action interface.
result Empirical evaluation shows strong non-monotonic reward interactions and optimal Sharpe ratio with the full reward configuration.

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.

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 ↗

Analytic patch trees reveal new geometric structures and dimension fields.

problem Understanding the geometric and analytical properties of surface patch trees.
method Developed analytic surface patch trees and introduced interface curves to transmit state.
result Surface patch trees have natural foliations with one-dimensional curve trees and dimension fields.

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 ↗

Common models for two-phase lipid bilayer membranes are based on an energy that consists of an elastic term for each lipid phase and a line energy at interfaces. Although such an energy controls only the length of interfaces, the membrane surface is usually assumed to be at least C1C^1 across phase boundaries. We consi…

2016-03-01abs ↗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 ↗

This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.

problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.

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 ↗

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.

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.