This work compresses sequences by treating them as continuous-time processes, enabling efficient discretization.
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.
Trend · papers per month
Open problem seeks an online learning algorithm for binary classification.
New spectral sequence connects to topological Hochschild homology.
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…
New methods tackle adversarial attacks on categorical sequences, improving model security.
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…
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…
ProGen models protein sequences for synthetic biology.
LaMBO optimizes biological sequences using autoencoders and Bayesian optimization.
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…
Study braid group actions on exceptional sequences using branched coverings.
New techniques improve channel prediction in noisy wireless systems.
The paper explores spectral sequences of complex manifolds with special metrics.
Study on continuous sequence classification with distribution uncertainty.
We consider a simple and overarching representation for permutation-invariant functions of sequences (or multiset functions). Our approach, which we call Janossy pooling, expresses a permutation-invariant function as the average of a permutation-sensitive function applied to all reorderings of the input sequence. This …
FIGARO generates symbolic music with fine-grained control.
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…
In this paper, we prove two results. First, there is a family of sequences of embedded quarters of the hyperbolic plane such that any sequence converges to a limit which is an end of the hyperbolic plane. Second, there is no algorithm which would allow us to check whether two given ends are equal or not.
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…
Improved algorithms for stochastic linear bandits using tighter confidence sequences.
Recurrent neural networks and sequence to sequence models require a predetermined length for prediction output length. Our model addresses this by allowing the network to predict a variable length output in inference. A new loss function with a tailored gradient computation is developed that trades off prediction accur…
Study of orbifold mapping class groups via arc and curve actions.
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…
Time-based model improves recommendation performance.
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…
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…
Recurrent Neural Networks (RNNS) are now widely used on sequence generation tasks due to their ability to learn long-range dependencies and to generate sequences of arbitrary length. However, their left-to-right generation procedure only allows a limited control from a potential user which makes them unsuitable for int…
Randomized positional encodings boost transformer performance on longer sequences.
P3BO optimizes biological sequence design by combining multiple methods.
Paper presents robust confidence sequences for means with known moment bounds and arbitrary corruption.
Reinforcement Patching optimizes dynamic sequence patching for efficient time series forecasting.
Transformers learn causal structure through gradient descent on self-attention mechanisms.
Data of practical interest - such as personal records, transaction logs, and medical histories - are sequential collections of events relevant to a particular source entity. Recent studies have attempted to link sequences that represent a common entity across data sets to allow more comprehensive statistical analyses a…
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…
QRNN uses quantum neurons to learn sequences efficiently.
Given the emerging global threat of antimicrobial resistance, new methods for next-generation antimicrobial design are urgently needed. We report a peptide generation framework PepCVAE, based on a semi-supervised variational autoencoder (VAE) model, for designing novel antimicrobial peptide (AMP) sequences. Our model l…
mGENRE improves multilingual entity linking with autoregressive sequence prediction.
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…
We give a complete description of the closure of the space of one-generator closed subgroups of PSL2(R) for the Chabauty topology, by computing explicitly the matrices associated with elements of Aut(D) = PSL2(R), and finding quantities parametrizing the limit cases. Along the way, we investigate under what conditions …
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…
We introduce a general method to extract knowledge from a recurrent neural network (Long Short Term Memory) that has learnt to detect if a given input sequence is valid or not, according to an unknown generative automaton. Based on the clustering of the hidden states, we explain how to build and validate an automaton t…
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…
Spacetimeformer learns spatiotemporal relationships from data alone.
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…
TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.
In this note, given a polarized algebraic manifold , we define the Donaldson-Futaki invariant for a sequence of test configurations for with exponents tending to infinity. This then allows us to define a strong version of K-stability or K-semistability for . In particular, will be shown to…
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…
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…