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

Trend · papers per month

51101152202 · Jun 202019922001200920172026
48 results for context module

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.

An interesting theme in complex differential geometry is to find a correspondence between algebraic objects and differential geometric objects. One of the most attractive is the non-abelian Hodge theory of Simpson. In this paper, pursuing an analogue of the non-abelian Hodge theory in the context of qq-difference modu…

2019-02-10abs ↗pdf ↗

NFM improves deep learning by selectively processing hidden states.

problem Processing entire hidden states in each layer limits modularity and reusability.
method Introduces Neural Function Modules (NFM) with attention, sparsity, and feedback.
result Improves results in classification, generalization, generative modeling, and reinforcement learning.

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 ↗

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 ↗

Many prediction problems, such as those that arise in the context of robotics, have a simplifying underlying structure that, if known, could accelerate learning. In this paper, we present a strategy for learning a set of neural network modules that can be combined in different ways. We train different modular structure…

2018-06-26abs ↗pdf ↗

The Serre-Swan theorem in differential geometry establishes an equivalence between the category of smooth vector bundles over a smooth compact manifold and the category of finitely generated projective modules over the unital ring of smooth functions. This theorem is here generalized to manifolds of bounded geometry. I…

2013-02-14abs ↗pdf ↗

Stability of catenoid in hyperbolic space proven without symmetry assumptions.

problem Stability of catenoid in hyperbolic space.
method Profile construction, modulation analysis, integrated local energy decay, vectorfield method.
result Nonlinear asymptotic stability of catenoid for n5n \geq 5 without symmetry assumptions.

In this paper we apply the theory of finitely generated FI-modules developed by Church, Ellenberg and Farb to certain sequences of rational cohomology groups. Our main examples are the cohomology of the moduli space of n-pointed curves, the cohomology of the pure mapping class group of surfaces and some manifolds of hi…

2012-07-30abs ↗pdf ↗

Study the algebraic action of torus on knot complement's skein module.

problem Understand the algebraic structure of knot complements and boundary tori.
method Analyze the Kauffman bracket skein algebra and module of the 3-twist knot complement.
result Determine the action of Kauffman bracket skein algebra on module of 3-twist knot complement.

Details of quantum knot invariant calculations using a specific SU(3)_q-module are given which distinguish the Conway and Kinoshita-Teresaka pair of mutant knots. Features of Kuperberg's skein-theoretic techniques for SU(3)_q invariants in the context of mutant knots are also discussed.

1998-10-27abs ↗pdf ↗

The category of finite dimensional module over the quantum superalgebra U_q(sl(2|1)) is not semi-simple and the quantum dimension of a generic U_q(sl(2|1))-module vanishes. This vanishing happens for any value of q (even when q is not a root of unity). These properties make it difficult to create a fusion or modular ca…

2017-05-10abs ↗pdf ↗

Extends Manin triples to Lie bialgebroids over Lie groupoids.

problem Characterizing Lie bialgebroids via Manin triples.
method Establishing correspondence between Lie bialgebroid groupoids and multiplicative Manin triples.
result New viewpoint on co-quadratic Lie algebroids and Manin triple description of Lie bialgebroid crossed modules.

The paper shows the computation of the noncommutative generalization of the A-polynomial of the trefoil knot. The classical A-polynomial was introduced by Cooper, Culler, Gillet, Long and Shalen, and was generalized to the context of Kauffman bracket skein modules by the author in joint work with Frohman and Lofaro. A …

2000-04-25abs ↗pdf ↗

We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our grammar's rule probabilities are modulated by a per-sentence continuous latent variabl…

2019-06-24abs ↗pdf ↗

Improved stock price prediction using attention modules and news sentiment.

problem Predicting stock prices with non-stationary and non-parametric data.
method α_{t}-RIM architecture with attention modules and exponentially smoothed recurrent neural network.
result The αtα_{t}-RIM outperforms state-of-the-art models in predicting unseen data.

CRAUM-Net improves salient object detection with context and uncertainty modeling.

problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.

Paper proposes linear transformers for efficient in-context learning without context length limitations.

problem Quadratic complexity of softmax transformers limits data processing speed.
method Investigates linear transformers under domain generalization, showing they learn mappings from context distributions to response functions.
result Linear transformers achieve in-context learning with a linear complexity in context length, offering a dimension-independent convergence rate.

Recent dialogue approaches operate by reading each word in a conversation history, and aggregating accrued dialogue information into a single state. This fixed-size vector is not expandable and must maintain a consistent format over time. Other recent approaches exploit an attention mechanism to extract useful informat…

2019-10-16abs ↗pdf ↗

We introduce a technique for proving quantitative representation stability theorems for sequences of representations of certain finite linear groups over a field of characteristic zero. In particular, we prove a vanishing result for higher syzygies of VIC- and SI-modules, which can be thought of as a weaker version of …

2017-09-12abs ↗pdf ↗

We give a foundational account on topological racks and quandles. Specifically, we define the notions of ideals, kernels, units, and inner automorphism group in the context of topological racks. Further, we investigate topological rack modules and principal rack bundles. Central extensions of topological racks are then…

2015-05-30abs ↗pdf ↗

Improved sample-efficient learning for non-coherent digital jamming.

problem Learning optimal jamming strategies in non-coherent digital modulation schemes without prior knowledge.
method Introduced a linear bandit algorithm that accounts for action similarities and integrates context features.
result Significantly improved convergence behavior compared to prior art.

The paper studies combinatorics of injective words in the context of Temperley-Lieb algebras.

problem Combinatorial properties of injective words in the context of Temperley-Lieb algebras.
method Investigation of a chain complex of modules over the Temperley-Lieb algebra, focusing on Euler characteristic, homology modules, and Jacobsthal numbers.
result The Euler characteristic of the complex is the n-th Fine number, and the top-dimensional homology module is decomposed in terms of standard Young tableaux.

ForecastGAN improves multi-horizon time series forecasting by integrating numerical and categorical features.

problem Limited performance of existing approaches in short-term and long-term forecasting.
method Decomposition, model selection, adversarial training.
result ForecastGAN consistently outperforms state-of-the-art transformer models for short-term forecasting.

Enhances count process modelling with Markov-modulated non-homogeneous Poisson process.

problem Count data modelling challenges, especially in complex scenarios.
method Introduces a flexible frequency perturbation measure into Markov-modulated Poisson process framework.
result Natural incorporation of observed event arrivals and latent factors.

A commonly cited inefficiency of neural network training by back-propagation is the update locking problem: each layer must wait for the signal to propagate through the full network before updating. Several alternatives that can alleviate this issue have been proposed. In this context, we consider a simpler, but more e…

2019-01-23abs ↗pdf ↗

Paper investigates Lipschitz constants of self-attention modules in neural networks.

problem Lipschitz constants of self-attention modules in neural networks.
method Proved standard dot-product self-attention is not Lipschitz for unbounded input domain. Proposed L2 self-attention that is Lipschitz. Derived upper bound on L2 self-attention's Lipschitz constant.
result Proved standard self-attention is not Lipschitz for unbounded input domain and proposed an alternative L2 self-attention that is Lipschitz.

We describe principal 3-bundles with adjusted connections using Lie algebras and groupoids.

problem Describing principal 3-bundles with adjusted connections.
method Derived explicit forms of adjustment data for 3-term LL_\infty-algebras, integrated action Lie 3-algebroids to Lie 3-groupoids, and used differential cohomology.
result Explicit description of principal 3-bundles with adjusted connections in terms of differential cohomology.

Improved financial sentiment analysis using LLMs with retrieval augmentation.

problem Limited performance of traditional NLP models in financial sentiment analysis.
method Retrieval-augmented Large Language Models (LLMs) with instruction tuning.
result Achieved 15% to 48% performance gain in accuracy and F1 score.

This paper tackles continuous domain adaptation with a new approach.

problem Learning in non-stationary environments, especially domain drift.
method Variational domain-agnostic feature replay, composed of inference, generative, and solver modules.
result Demonstrates the effectiveness of the proposed approach for practical usage.

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.

In the early 2000's Cochran and Harvey introduced non-commutative Alexander polynomials for 3-manifolds. Their degrees give strong lower bounds on the Thurston norm. In this paper we make the case that the vanishing of a certain Novikov-Sikorav homology module is the correct notion of a monic non-commutative Alexander …

2016-06-11abs ↗pdf ↗