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

63125188250 · Jun 202019922001200920172026
48 results for discrete sequences

This work compresses sequences by treating them as continuous-time processes, enabling efficient discretization.

problem Efficient compression of sequences, especially with deep learning models that scale with sequence length.
method Treat sequences as continuous-time processes, learn efficient discretization, and decode at different time intervals.
result Automatic bit rate reductions in video and motion capture sequences using learned discretization.

Deep generative models have been successfully used to learn representations for high-dimensional discrete spaces by representing discrete objects as sequences and employing powerful sequence-based deep models. Unfortunately, these sequence-based models often produce invalid sequences: sequences which do not represent a…

2017-12-05abs ↗pdf ↗

Proposes OC4Seq for detecting anomalies in discrete event sequences.

problem Challenges in detecting anomalies in discrete event sequences, including data imbalance, discrete events, and sequential nature.
method Integrates anomaly detection with recurrent neural networks (RNNs) to embed sequences into latent spaces and designs a multi-scale RNN framework to capture multi-scale sequential patterns.
result OC4Seq consistently outperforms various baselines on three benchmark datasets.

Deep learning techniques have been hugely successful for traditional supervised and unsupervised machine learning problems. In large part, these techniques solve continuous optimization problems. Recently however, discrete generative deep learning models have been successfully used to efficiently search high-dimensiona…

2017-08-15abs ↗pdf ↗

Study of discrete analogues of Atiyah sequence in principal bundles.

problem Discrete analogues of vector bundles and connections in principal bundles.
method Analysis in two categories: fiber bundles with sections and local Lie groupoids, defining discrete curvature and splittings.
result Correspondence between splittings of discrete Atiyah sequence and discrete connections with trivial curvature.

We study discrete conjugate nets whose Laplace sequence is of period four. Corresponding points of opposite nets in this cyclic sequence have equal osculating planes in different net directions, that is, they correspond in an asymptotic transformation. We show that this implies that the connecting lines of correspondin…

2011-04-19abs ↗pdf ↗

Sequence-to-sequence text-to-speech (TTS) is dominated by soft-attention-based methods. Recently, hard-attention-based methods have been proposed to prevent fatal alignment errors, but their sampling method of discrete alignment is poorly investigated. This research investigates various combinations of sampling methods…

2019-10-28abs ↗pdf ↗

Connections on principal bundles play a fundamental role in expressing the equations of motion for mechanical systems with symmetry in an intrinsic fashion. A discrete theory of connections on principal bundles is constructed by introducing the discrete analogue of the Atiyah sequence, with a connection corresponding t…

2005-08-18abs ↗pdf ↗

This paper derives a diffusion approximation for a sequence of discrete-time one-sided limit order book models with non-linear state dependent order arrival and cancellation dynamics. The discrete time sequences are specified in terms of an R+\R_+-valued best bid price process and an Lloc2L^2_{loc}-valued volume process. …

2016-08-05abs ↗pdf ↗

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i), unless Gamma_i's are (eventually) elementary or contain normal finite subgroups of ar…

2007-08-20abs ↗pdf ↗

Normalizing flows are a powerful class of generative models for continuous random variables, showing both strong model flexibility and the potential for non-autoregressive generation. These benefits are also desired when modeling discrete random variables such as text, but directly applying normalizing flows to discret…

2019-01-29abs ↗pdf ↗

There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm{ü}ller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of su…

2007-01-20abs ↗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 ↗

Paper analyzes symbolic-dynamics inspired Markov modeling for time-series data.

problem Capturing temporal patterns in sequential data for statistical learning.
method Two-step process: discretization of continuous attributes and estimation of temporal memory.
result Effective Markov modeling depends on accurate discretization and memory estimation.

A 2-manifold's group structure is deduced from orbit configuration spaces.

problem Understanding the fundamental groups of orbit configuration spaces.
method Relating the four-term exact sequence of orbifold pure braid groups to the fundamental groups of the orbit configuration spaces.
result Fundamental groups of orbit configuration spaces form a four-term exact sequence.

Survey and benchmark high-dimensional Bayesian optimization of discrete sequences.

problem Heterogeneous experimental set-ups and technical barriers in high-dimensional Bayesian optimization of discrete sequences.
method Unified framework and software libraries to test and benchmark methods.
result Unified framework and software libraries for testing and benchmarking high-dimensional Bayesian optimization methods.

Discretizes Helfrich-type energies on surfaces using triangular complexes.

problem Discretizing curvature energies on surfaces of specific type.
method Asymptotic lower bound combined with recovery sequence of triangulations and edge director fields.
result Valid discrete versions of integral curvature energies on surfaces.

DFMs enable flow-based models for multimodal discrete and continuous data.

problem Combining discrete and continuous data for generative models.
method Discrete Flow Models (DFMs) using Continuous Time Markov Chains.
result DFMs achieve state-of-the-art co-design performance for protein structure and sequence generation.

SocialInteractionGAN generates realistic human interactions from low-dimensional data.

problem Generating realistic human interactions from limited data.
method Adversarial architecture with a recurrent encoder-decoder generator and dual-stream discriminator.
result SocialInteractionGAN produces high-quality action sequences of interacting people.

Branching Flows generates sequences of varying lengths using binary trees.

problem Generating sequences of unknown lengths or fixed elements.
method A generative modeling framework that evolves states over binary trees, controlling sequence length.
result Branching Flows can generate sequences of varying lengths and mix different types of state spaces.

Deep network predicts action sequences for complex tasks from a scene image.

problem Scalable task and motion planning from initial scene images.
method Deep convolutional recurrent neural network that predicts action sequences.
result Predicts promising action sequences, reducing motion planning problems.

A Darboux transformation for polarized space curves is introduced and its properties are studied, in particular, Bianchi permutability. Semi-discrete isothermic surfaces are described as sequences of Darboux transforms of polarized curves in the conformal n-sphere and their transformation theory is studied. Semi-discre…

2015-06-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 ↗

Researchers develop flexible kernels for biological sequences with guaranteed reliability.

problem Challenges in applying machine learning to biological sequences, including unreliable methods.
method Theoretical analysis and development of modified kernels to ensure reliability and accuracy.
result Developed kernels that are universal, characteristic, and metrize the space of distributions for biological sequences.

Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygon…

2008-11-07abs ↗pdf ↗

The paper confirms a conjecture about optimal expected utility in markets with insider information.

problem Optimal expected utility in markets with insider information.
method An extension of the Black-Scholes-Merton model with a sequence of discrete-time economies.
result Optimal expected utility converges to the classic model when conditions are met.

A formula connects discrete harmonic surfaces to holomorphic functions.

problem Creating smooth discrete harmonic surfaces from holomorphic data.
method Weierstrass representation formula for discrete harmonic surfaces.
result Smooth converging sequence of discrete harmonic surfaces converges to a minimal surface.

Improved text generation with constraints using discrete auto-regressive biasing.

problem Balancing fluency and constraint satisfaction in LLM outputs.
method Discrete Auto-regressive Biasing, leveraging gradients in discrete text space.
result Significantly improved constraint satisfaction with comparable fluency.

We study Betti numbers of sequences of Riemannian manifolds which Benjamini-Schramm converge to their universal covers. Using the Price inequalities we developed elsewhere, we derive two distinct convergence results. First, under a negative Ricci curvature assumption and no assumption on sign of the sectional curvature…

2019-09-12abs ↗pdf ↗

Given a finite set of points in Rn\mathbb R^n and a radius parameter, we study the Čech, Delaunay-Čech, Delaunay (or Alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel sets of generalized discrete Morse functions, we prove that the four…

2013-12-04abs ↗pdf ↗

We introduce a new neural architecture to learn the conditional probability of an output sequence with elements that are discrete tokens corresponding to positions in an input sequence. Such problems cannot be trivially addressed by existent approaches such as sequence-to-sequence and Neural Turing Machines, because th…

2015-06-09abs ↗pdf ↗

This primer explains diffusion models in general state spaces.

problem Diffusion models in general state spaces are not well-introduced.
method Develops discrete-time and continuous-time views of diffusion models, deriving Fokker-Planck and master equations.
result Unified understanding of diffusion models across continuous and discrete domains.

Kernel methods on discrete domains have shown great promise for many challenging data types, for instance, biological sequence data and molecular structure data. Scalable kernel methods like Support Vector Machines may offer good predictive performances but do not intrinsically provide uncertainty estimates. In contras…

2018-10-24abs ↗pdf ↗