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

3657291,0941,458 · Jun 202019922001200920172026
48 results for concept modulation models

Concept modulation models unify identifiability and extrapolation in conditional latent variable models.

problem Reliable generalization in conditional latent variable models
method Concept modulation models (CMMs) with structure AoΛoCoXA o Λ o C o X
result Lifts identifiability to conditional settings and controls extrapolation through attribute potentials.

New approach learns causally disentangled latent structures in generative models.

problem Fundamental tension between expressivity and structure in latent structure learning.
method Added a context module to an arbitrarily complex model to learn causally disentangled concepts.
result Causally disentangled representations can be composed for out-of-distribution generation.

In the work we discuss two invariants of conjugacy classes of braids. The first invariant is the conformal module which occurred in connection with the interest in the 13th Hilbert Problem. The second is a popular dynamical invariant, the entropy. It occurred in connection with Thurston's theory of surface homeomorphis…

2014-12-19abs ↗pdf ↗

The conformal module of conjugacy classes of braids implicitly appeared in a paper of Lin and Gorin in connection with their interest in the 13. Hilbert Problem. This invariant is the supremum of conformal modules (in the sense of Ahlfors) of certain annuli related to the conjugacy class. This note states that the conf…

2012-08-07abs ↗pdf ↗

We introduce a weak concept of Morita equivalence, in the birational context, for Poisson modules on complex normal Poisson projective varieties. We show that Poisson modules, on projective varieties with mild singularities, are either rationally Morita equivalent to a flat partial holomorphic sheaf, or a sheaf with a …

2019-08-06abs ↗pdf ↗

We solve a broad class of sequential decision-making problems with partially observed states.

problem Sequential decision-making under uncertainty with partially observed states.
method Modeling as a partially observed Markov decision process (POMDP) and separating state and modulation process.
result The approach allows for specialized approximate solution procedures.

Using the concept of a cohesive module defined by Block, we use the theory of superconnections in the sense of Quillen to construct natural superconnections on Hermitian cohesive modules. By the Chern-Weil construction, we obtain characteristic classes with values in Bott-Chern cohomology which refines the usual deRham…

2016-11-14abs ↗pdf ↗

Unified model learns concepts across domains like left and right.

problem Limited generalization of language concepts in inference-only models.
method Logic-Enhanced Foundation Model (LEFT) with a differentiable, domain-independent program executor.
result LEFT flexibly learns and reasons with concepts across 2D images, 3D scenes, human motions, and robotic manipulation.

The study of neurocognitive tasks requiring accurate localisation of activity often rely on functional Magnetic Resonance Imaging, a widely adopted technique that makes use of a pipeline of data processing modules, each involving a variety of parameters. These parameters are frequently set according to the local goal o…

2016-10-13abs ↗pdf ↗

What does a neural network encode about a concept as we traverse through the layers? Interpretability in machine learning is undoubtedly important, but the calculations of neural networks are very challenging to understand. Attempts to see inside their hidden layers can either be misleading, unusable, or rely on the la…

2020-02-05abs ↗pdf ↗

Developed a theory of stated SL(n)-skein modules for 3-manifolds.

problem Understanding the algebraic structure of 3-manifolds marked with intervals.
method Introduced and studied SL(n)-skein modules and algebras of 3-manifolds, proving homomorphisms and algebra properties.
result Skein algebra of thickened surfaces is isomorphic to Oq(SL(n))O_q(SL(n)) and provides geometric interpretations of quantum group structures.

Topological parallax assesses AI models' geometric similarity to datasets for safety.

problem Ensuring AI models' robustness and safety in deep learning applications.
method Topological parallax compares a trained model to a reference dataset using Rips complexes and geodesic distortions.
result Topological parallax indicates whether a model shares similar multiscale geometric features with the dataset.

Abstract sketches historical development of Lie brackets, crossed modules, and Lie-Rinehart algebras.

problem Characterizing and understanding the relationships between Lie brackets, crossed modules, and Lie-Rinehart algebras.
method Historical review and combinatorial group theory considerations.
result The mutual relationship between Lie-Rinehart algebras and Lie brackets, and the historical development of these concepts.

In the present paper, we construct an invariant for virtual knots in the thickened sphere with g handles; this invariant is a Laurent polynomial in 2g+3 variables. To this end, we use a modification of the Wirtinger presentation of the knot group and the concept of parity introduced by V.O.Manturov. The section 4 of th…

2013-05-09abs ↗pdf ↗

In this paper, we focus on a prediction-based novelty estimation strategy upon the deep reinforcement learning (DRL) framework, and present a flow-based intrinsic curiosity module (FICM) to exploit the prediction errors from optical flow estimation as exploration bonuses. We propose the concept of leveraging motion fea…

2019-05-24abs ↗pdf ↗

We study a multi-armed bandit problem where the rewards exhibit regime switching. Specifically, the distributions of the random rewards generated from all arms are modulated by a common underlying state modeled as a finite-state Markov chain. The agent does not observe the underlying state and has to learn the transiti…

2020-01-26abs ↗pdf ↗

Neural Module Networks, originally proposed for the task of visual question answering, are a class of neural network architectures that involve human-specified neural modules, each designed for a specific form of reasoning. In current formulations of such networks only the parameters of the neural modules and/or the or…

2019-05-27abs ↗pdf ↗

We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another. Based on this multiplicity, we define a pseudo distance on the class of objects. W…

2011-01-10abs ↗pdf ↗

This work tackles uncertainty in multi-agent multi-modal trajectory forecasting.

problem Measuring and ranking uncertainty in multi-agent multi-modal trajectory forecasting.
method Proposes collaborative uncertainty (CU) and a CU-aware regression framework.
result The CU-aware regression framework improves SOTA systems' performances.

While physics conveys knowledge of nature built from an interplay between observations and theory, it has been considered less importantly in deep neural networks. Especially, there are few works leveraging physics behaviors when the knowledge is given less explicitly. In this work, we propose a novel architecture call…

2019-02-08abs ↗pdf ↗

This paper continues math.DG/9903140. Here we construct a linking form on the torsion part of middle dimensional extended L^2 homology and cohomology of odd-dimensional manifolds. We give a geometric necessary condition when this linking form is hyperbolic. We compute this linking form in case when the manifold bounds.…

2000-06-15abs ↗pdf ↗

In this paper we propose a semi-Markov modulated model of interest rates. We assume that the switching process is a semi-Markov process with finite state space E and the modulated process is a diffusive process. We derive recursive equations for the higher order moments of the discount factor and we describe a Monte Ca…

2012-10-11abs ↗pdf ↗

Methods for learning Bayesian network structure can discover dependency structure between observed variables, and have been shown to be useful in many applications. However, in domains that involve a large number of variables, the space of possible network structures is enormous, making it difficult, for both computati…

2012-10-19abs ↗pdf ↗

The objective of this paper is to clarify the relationships between the quantum D-module and equivariant Floer theory. Equivariant Floer theory was introduced by Givental in his paper ``Homological Geometry''. He conjectured that the quantum D-module of a symplectic manifold is isomorphic to the equivariant Floer cohom…

2004-10-22abs ↗pdf ↗

Let {T1,,Tn}\{T_1, \ldots, T_n\} be a set of nn commuting bounded linear operators on a Hilbert space H\mathcal{H}. Then the nn-tuple (T1,,Tn)(T_1, \ldots, T_n) turns H\mathcal{H} into a module over C[z1,,zn]\mathbb{C}[z_1, \ldots, z_n] in the following sense: \[\mathbb{C}[z_1, \ldots, z_n] \times \mathcal{H} \raro \clh, \quad \quad …

2013-08-28abs ↗pdf ↗

A commuting nn-tuple (T1,,Tn)(T_1, \ldots, T_n) of bounded linear operators on a Hilbert space $\clh$ associate a Hilbert module H\mathcal{H} over C[z1,,zn]\mathbb{C}[z_1, \ldots, z_n] in the following sense: \[\mathbb{C}[z_1, \ldots, z_n] \times \mathcal{H} \rightarrow \mathcal{H}, \quad \quad (p, h) \mapsto p(T_1, \ldots, T_n)h…

2014-09-27abs ↗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.

Paper proposes a new pipeline for few-shot classification using forget-update module and channel vector sequence.

problem Few-shot classification with limited support samples.
method Channel vector sequence construction module and forget-update module.
result Pipeline achieves state-of-the-art results on various datasets.

Recent advances in deep learning have brought to the fore models that can make multiple computational steps in the service of completing a task; these are capable of describ- ing long-term dependencies in sequential data. Novel recurrent attention models over possibly large external memory modules constitute the core m…

2018-09-04abs ↗pdf ↗

Designing models that are robust to small adversarial perturbations of their inputs has proven remarkably difficult. In this work we show that the reverse problem---making models more vulnerable---is surprisingly easy. After presenting some proofs of concept on MNIST, we introduce a generic tilting attack that injects …

2018-06-19abs ↗pdf ↗

Spatio-temporal (ST) data, which represent multiple time series data corresponding to different spatial locations, are ubiquitous in real-world dynamic systems, such as air quality readings. Forecasting over ST data is of great importance but challenging as it is affected by many complex factors, including spatial char…

2018-09-28abs ↗pdf ↗

Bayesian attention modules improve model interpretability and performance.

problem Deterministic attention modules limit model interpretability and optimization.
method Proposes a scalable stochastic attention module using simplex-constrained distributions and Bayesian learning.
result Consistent improvements over baselines in various attention-based models.

New rough stochastic volatility models using log-modulated fractional Brownian motion.

problem Analyzing rough stochastic volatility models over the range 0H<1/20 \le H < 1/2.
method Introducing log-modulated fractional Brownian motion (log-fBm) to handle H=0H = 0 and analyze over the full range.
result Obtained skew asymptotics of log(1/T)pTH1/2\log(1/T)^{-p} T^{H-1/2} as To0T o 0 for H0H \ge 0, no flattening of skew as Ho0H o 0.

We present a neurosymbolic framework for the lifelong learning of algorithmic tasks that mix perception and procedural reasoning. Reusing high-level concepts across domains and learning complex procedures are key challenges in lifelong learning. We show that a program synthesis approach that combines gradient descent w…

2018-03-31abs ↗pdf ↗