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

117235352469 · Jun 202019922001200920172026
48 results for sequence allowability

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.

Open problem seeks an online learning algorithm for binary classification.

problem Existence of an online learning algorithm for binary classification with sublinear mistakes.
method Assumption of sequence allowing learning algorithm's existence.
result Specific condition determines sequence's learnability.

We develop two new methods of constructing sequences of manifolds with positive scalar curvature that converge in the Gromov-Hausdorff and Intrinsic Flat sense to limit spaces with "pulled regions". The examples created rigorously within using these methods were announced by us a few years ago and have influenced the s…

2019-11-06abs ↗pdf ↗

New methods tackle adversarial attacks on categorical sequences, improving model security.

problem Adversarial attacks on categorical sequence models, especially for money transactions and medical fraud.
method Two black-box adversarial attacks: Monte-Carlo and continuous relaxation methods.
result Generated adversarial sequences fool machine learning models but remain close to original ones.

Let T be a torus. We present an exact sequence relating the relative equivariant cohomologies of the skeletons of an equivariantly formal T-space. This sequence, which goes back to Atiyah and Bredon, generalizes the so-called Chang-Skjelbred lemma. As coefficients, we allow prime fields and subrings of the rationals, i…

2003-07-09abs ↗pdf ↗

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state auto…

2008-12-10abs ↗pdf ↗

LaMBO optimizes biological sequences using autoencoders and Bayesian optimization.

problem Bayesian optimization for drug design is limited by discrete, high-dimensional decision variables.
method Jointly trains denoising autoencoder with a Gaussian process head for gradient-based optimization in latent space.
result LaMBO outperforms genetic optimizers and requires no large pretraining corpus.

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 ↗

Study braid group actions on exceptional sequences using branched coverings.

problem Transitivity of braid group action on full exceptional sequences.
method Relate exceptional sequences to branched coverings, apply Birman--Hilden theory.
result Counterexamples to Bondal--Polishchuk conjecture on braid group transitivity.

New techniques improve channel prediction in noisy wireless systems.

problem Predicting channels in wireless communication systems from noisy observations.
method Adapted sequence-to-sequence models and transformers with reverse positional encoding and reversed encoder outputs.
result Improved robustness and relationship capture in channel prediction models.

The paper explores spectral sequences of complex manifolds with special metrics.

problem Understanding spectral sequences of compact complex manifolds with special metrics.
method Investigation of Frölicher spectral sequences and special metrics (balanced, SKT, Gauduchon) on manifolds.
result Found compact manifolds where spectral sequences do not degenerate at the second page, providing counterexamples and new families.

Study on continuous sequence classification with distribution uncertainty.

problem Classifying continuous sequences with varying distribution uncertainty.
method Proposes distribution-free tests for three test designs: fixed-length, sequential, and two-phase tests.
result Error probabilities decay exponentially fast for all test designs.

We present a novel framework for kernel learning with sequential data of any kind, such as time series, sequences of graphs, or strings. Our approach is based on signature features which can be seen as an ordered variant of sample (cross-)moments; it allows to obtain a "sequentialized" version of any static kernel. The…

2016-01-29abs ↗pdf ↗

Deep conditional generative models are developed to simultaneously learn the temporal dependencies of multiple sequences. The model is designed by introducing a three-way weight tensor to capture the multiplicative interactions between side information and sequences. The proposed model builds on the Temporal Sigmoid Be…

2016-05-22abs ↗pdf ↗

Improved algorithms for stochastic linear bandits using tighter confidence sequences.

problem Stochastic linear bandits with improved worst-case regret guarantees.
method Novel tail bound for adaptive martingale mixtures to construct tighter confidence sequences.
result Linear bandit algorithm achieves competitive worst-case regret.

Study of orbifold mapping class groups via arc and curve actions.

problem Understanding the structure of orbifold mapping class groups.
method Defined orbifold mapping class groups and studied their actions on arcs and curves. Established a Birman exact sequence and derived finite presentations.
result Finite presentations of orbifold mapping class groups established.

We consider spectral sequences in smooth generalized cohomology theories, including differential generalized cohomology theories. The main differential spectral sequences will be of the Atiyah-Hirzebruch (AHSS) type, where we provide a filtration by the Cech resolution of smooth manifolds. This allows for systematic st…

2016-05-11abs ↗pdf ↗

Given a sequential learning algorithm and a target model, sequential machine teaching aims to find the shortest training sequence to drive the learning algorithm to the target model. We present the first principled way to find such shortest training sequences. Our key insight is to formulate sequential machine teaching…

2018-10-15abs ↗pdf ↗

High dimensional time series are endemic in applications of machine learning such as robotics (sensor data), computational biology (gene expression data), vision (video sequences) and graphics (motion capture data). Practical nonlinear probabilistic approaches to this data are required. In this paper we introduce the v…

2011-07-25abs ↗pdf ↗

Randomized positional encodings boost transformer performance on longer sequences.

problem Transformers struggle with generalizing to sequences of arbitrary length.
method Introduced randomized positional encodings that simulate longer sequences and randomly select positions.
result Randomized positional encodings increase test accuracy by 12.0% on average for sequences of unseen length.

P3BO optimizes biological sequence design by combining multiple methods.

problem Variability in performance of black-box optimization methods for biological sequence design.
method Population-Based Black-Box Optimization (P3BO) that samples sequences from an ensemble of methods, weighting by past performance.
result P3BO outperforms individual methods, proposing higher quality and more diverse sequences.

Paper presents robust confidence sequences for means with known moment bounds and arbitrary corruption.

problem Tackles robustness to outliers and adversarial corruptions in mean estimation.
method Designs new robust exponential supermartingales to create confidence sequences.
result Achieves optimal width and shows smaller margin of error compared to fixed-time robust methods.

Reinforcement Patching optimizes dynamic sequence patching for efficient time series forecasting.

problem Efficiently learning data-adaptive representations for long-horizon sequence data, especially continuous sequences.
method Reinforcement Patching (ReinPatch) uses reinforcement learning to optimize dynamic patching policies and sequence backbones.
result ReinPatch achieves compelling performance in time-series forecasting compared to state-of-the-art methods.

Recurrent Neural Networks (RNNs) with attention mechanisms have obtained state-of-the-art results for many sequence processing tasks. Most of these models use a simple form of encoder with attention that looks over the entire sequence and assigns a weight to each token independently. We present a mechanism for focusing…

2018-06-12abs ↗pdf ↗

mGENRE improves multilingual entity linking with autoregressive sequence prediction.

problem Multilingual Entity Linking (MEL) task of resolving language-specific mentions to a multilingual Knowledge Base.
method Autoregressive sequence-to-sequence system that cross-encodes mention strings and entity names.
result Over 50% improvement in average accuracy in zero-shot settings.

Prior work inspired by compression algorithms has described how the Burrows Wheeler Transform can be used to create a distance measure for bioinformatics problems. We describe issues with this approach that were not widely known, and introduce our new Burrows Wheeler Markov Distance (BWMD) as an alternative. The BWMD a…

2019-12-30abs ↗pdf ↗

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptiv…

2017-12-14abs ↗pdf ↗

We present a probabilistic model for unsupervised alignment of high-dimensional time-warped sequences based on the Dirichlet Process Mixture Model (DPMM). We follow the approach introduced in (Kazlauskaite, 2018) of simultaneously representing each data sequence as a composition of a true underlying function and a time…

2018-11-26abs ↗pdf ↗

Spacetimeformer learns spatiotemporal relationships from data alone.

problem Forecasting multivariate time series with distinct spatial relationships.
method Transformers with dynamic graph connections learning interactions between space, time, and value.
result Competitive results on various time series prediction benchmarks.

We propose generative neural network methods to generate DNA sequences and tune them to have desired properties. We present three approaches: creating synthetic DNA sequences using a generative adversarial network; a DNA-based variant of the activation maximization ("deep dream") design method; and a joint procedure wh…

2017-12-17abs ↗pdf ↗

TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.

problem Recognizing complex relational-temporal events with varying numbers of objects and sequence lengths.
method Neuro-symbolic networks with reasoning layers for finite-domain quantification over objects and time.
result TOQ-Nets can generalize to scenarios with more objects than training data and temporal warpings.

In this note, given a polarized algebraic manifold (X,L)(X,L), we define the Donaldson-Futaki invariant for a sequence of test configurations for (X,L)(X,L) with exponents tending to infinity. This then allows us to define a strong version of K-stability or K-semistability for (X,L)(X,L). In particular, (X,L)(X,L) will be shown to…

2013-07-08abs ↗pdf ↗

Domains in infinite jets present the simplest class of diffieties with boundary. In this note some basic elements of geometry of these domains are introduced and an analogue of the C-spectral sequence in this context is studied. This, in particular, allows cohomological interpretation and analysis of initial data, boun…

2006-09-03abs ↗pdf ↗

In this paper we introduce a new neural architecture for sorting unordered sequences where the correct sequence order is not easily defined but must rather be inferred from training data. We refer to this architecture as OrderNet and describe how it was constructed to be naturally permutation equivariant while still al…

2019-05-27abs ↗pdf ↗