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

113227340453 · Jun 202019922001200920172026
48 results for sequence representation

This thesis investigates unsupervised time series representation learning for sequence prediction problems, i.e. generating nice-looking input samples given a previous history, for high dimensional input sequences by decoupling the static input representation from the recurrent sequence representation. We introduce thr…

2018-04-18abs ↗pdf ↗

New method learns low-dimensional representations of nonlinear time series without supervision.

problem Learning low-dimensional representations of nonlinear time series without supervision.
method Based on monotone variational inequality, the method learns representations by assuming sequences arise from a common domain.
result The method can learn the geometry for the entire domain and faithful representations for the dynamics of each individual sequence.

In this paper, we obtain stability results for martingale representations in a very general framework. More specifically, we consider a sequence of martingales each adapted to its own filtration, and a sequence of random variables measurable with respect to those filtrations. We assume that the terminal values of the m…

2018-06-04abs ↗pdf ↗

Let ΓΓ be the fundamental group of a complete hyperbolic 33-manifold MM with toric cusps. We define the ωω-Borel invariant βnω(ρω)β_n^ω(ρ_ω) associated to a representation ρω:ΓSL(n,Cω)ρ_ω: Γ\rightarrow SL(n,\mathbb{C}_ω), where Cω\mathbb{C}_ω is a field which can be constructed as a quotient of a suitable subset of $\mathbb{C}^\m…

2017-09-22abs ↗pdf ↗

Recurrent models for sequences have been recently successful at many tasks, especially for language modeling and machine translation. Nevertheless, it remains challenging to extract good representations from these models. For instance, even though language has a clear hierarchical structure going from characters throug…

2018-01-29abs ↗pdf ↗

nTreeClus clusters categorical sequences using tree-based learners and k-mers.

problem Challenges in clustering categorical and sequential data.
method nTreeClus uses Tree-based Learners, k-mers, and autoregressive models for categorical time series.
result nTreeClus outperformed baseline methods in various validation metrics.

Generative Distribution Embeddings learn multiscale representations of distributions.

problem Learning representations of entire distributions for multiscale reasoning.
method Introducing GDE framework that lifts autoencoders to the space of distributions, using conditional generative models and distributional invariance.
result GDEs learn predictive sufficient statistics embedded in Wasserstein space, recovering distances and trajectories for Gaussian and Gaussian mixture distributions.

We show that the Korevaar-Schoen limit of the sequence of equivariant harmonic maps corresponding to a sequence of irreducible SL2(C)SL_2({\mathbb C}) representations of the fundamental group of a compact Riemannian manifold is an equivariant harmonic map to an R{\mathbb R}-tree which is minimal and whose length function …

1998-10-06abs ↗pdf ↗

Let M_g^n be the moduli space of Riemann surfaces of genus g with n labeled marked points. We prove that, for g \geq 2, the cohomology groups {H^i(M_g^n;Q)}_{n=1}^{\infty} form a sequence of Sn representations which is representation stable in the sense of Church-Farb [CF]. In particular this result applied to the triv…

2011-06-06abs ↗pdf ↗

This paper clarifies vine copula structures using graph and matrix representations.

problem Ambiguity in vine copula representations in literature.
method Graph and matrix representations to clarify vine structures, including cherry and chordal sequences.
result A unique matrix representation of vine structures when given a perfect elimination ordering.

Let ΔL,ρn(t)Δ_{L,ρ_n}(t) be the twisted Alexander polynomial with respect to the representation given by the composition of the lift of the holonomy representation of a certain hyperbolic link LL and the nn-dimensional irreducible complex representation of SL(2,C)\text{SL}(2,\mathbb C). We consider a sequence of ΔL,ρn(t)Δ_{L,ρ_n}(t)

2017-10-27abs ↗pdf ↗

Proposes a novel model for healthcare and SME credit risk prediction.

problem Lack of guidance from global view in sequence representation learning for time series modeling.
method Hierarchical Global View-guided (HGV) sequence representation learning framework with GGE and ββ-Attn modules.
result Competitive prediction performance compared with other known baselines.

Cataclysm deformations study Anosov representations and their convergence.

problem Understanding convergence of Anosov representations under deformation.
method Cataclysm deformation of Anosov representations using twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.

Let C_n(M) be the configuration space of n distinct ordered points in M. We prove that if M is any connected orientable manifold (closed or open), the homology groups H_i(C_n(M); Q) are representation stable in the sense of [Church-Farb]. Applying this to the trivial representation, we obtain as a corollary that the un…

2011-03-12abs ↗pdf ↗

Cataclysm deformations study Anosov representations, leading to new formulas and non-open sets.

problem Understanding Anosov representations and their deformations.
method Cataclysm deformations based on twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.

Using the work of Bonahon-Dreyer and Fock-Goncharov, one can construct a real-analytic parameterization for the PSL(n,R) Hitchin component of a surface S, that is explicitly analogous to the Fenchel-Nielsen coordinates on the Teichmuller space of S. Given a Hitchin representation, we give a lower bound on the "length" …

2014-09-07abs ↗pdf ↗

Bi-directional LSTMs are a powerful tool for text representation. On the other hand, they have been shown to suffer various limitations due to their sequential nature. We investigate an alternative LSTM structure for encoding text, which consists of a parallel state for each word. Recurrent steps are used to perform lo…

2018-05-07abs ↗pdf ↗

The paper studies how neural networks evolve representations, finding a unique fixed point for nonlinear activations.

problem Understanding how neural networks transform input data across layers.
method Theoretical framework for the evolution of the kernel sequence, using mean-field regime and Hermite polynomials.
result For nonlinear activations, the kernel sequence converges globally to a unique fixed point.

Hrrformer uses HRR to speed up self-attention for long sequences.

problem Infeasibility of using transformers with very long sequence lengths.
method Re-cast self-attention using Holographic Reduced Representations (HRR).
result Achieves near state-of-the-art accuracy with O(THlogH)\mathcal{O}(T H \log H) time complexity and O(TH)\mathcal{O}(T H) space complexity.

GTEA learns node representations in temporal interaction graphs.

problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.

New algorithms extract low-dimensional representations from sequential data, revealing insights into complex processes.

problem Challenges in extracting low-dimensional representations from sequential, high-dimensional, sparse, and noisy data.
method Developed new clustering algorithms based on Block Markov Chains theory, validated on real-world data.
result These algorithms can successfully extract low-dimensional representations from real-world sequential data, revealing insights into complex processes.

Seq2Tens uses tensors to efficiently represent sequences, improving performance on time series and video tasks.

problem Challenges in analyzing sequential data due to complex dependencies and non-commutativity.
method Uses tensor algebra to capture dependencies and low-rank tensor projections to manage computational complexity.
result State-of-the-art performance on multivariate time series classification and video generation benchmarks.

Sequential modelling with self-attention has achieved cutting edge performances in natural language processing. With advantages in model flexibility, computation complexity and interpretability, self-attention is gradually becoming a key component in event sequence models. However, like most other sequence models, self…

2019-11-28abs ↗pdf ↗

Representation stability is a phenomenon whereby the structure of certain sequences XnX_n of spaces can be seen to stabilize when viewed through the lens of representation theory. In this paper I describe this phenomenon and sketch a framework, the theory of FI-modules, that explains the mechanism behind it.

2014-04-15abs ↗pdf ↗

Process Monitoring involves tracking a system's behaviors, evaluating the current state of the system, and discovering interesting events that require immediate actions. In this paper, we consider monitoring temporal system state sequences to help detect the changes of dynamic systems, check the divergence of the syste…

2018-07-09abs ↗pdf ↗

The Hitchin component is a connected component of the character variety of reductive group homomorphisms from the fundamental group of a closed surface S of genus greater than 1 to the Lie group PSL_m(R). The Teichmuller space of S naturally embeds into the Hitchin component. The limit points in the Thurston compactifi…

2019-10-29abs ↗pdf ↗

ATS2S model predicts RUL of industrial equipment using attention mechanism.

problem Accurate estimation of RUL for industrial equipment to improve maintenance schedules and reduce costs.
method ATS2S model that optimizes reconstruction and RUL prediction losses, uses attention mechanism, and integrates encoder and decoder features.
result ATS2S model achieves superior performance over 13 state-of-the-art methods on four real datasets.