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

Trend · papers per month

3.6%7.1%10.7%14.3% · Oct 199219922001200920172026
48 results for activity sequences

Generative model predicts daily activity sequences with duration-aware dynamics.

problem Accurately forecasting granular daily activity sequences for energy demand.
method Hierarchical semi-Markov models with duration-aware dynamics.
result Explicitly modeling activity durations improves predictive performance.

This document investigates the integration of adaptive distinguishing sequences into the process of active automata learning (AAL). A novel AAL algorithm "ADT" (adaptive discrimination tree) is developed and presented. Since the submission of the original thesis, the presented algorithm has been integrated into LearnLi…

2019-02-04abs ↗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.

Traditionally, the automatic recognition of human activities is performed with supervised learning algorithms on limited sets of specific activities. This work proposes to recognize recurrent activity patterns, called routines, instead of precisely defined activities. The modeling of routines is defined as a metric lea…

2019-07-08abs ↗pdf ↗

A faster method for optimizing DNA and protein sequences using machine learning.

problem Designing DNA and protein sequences with improved function.
method Activation maximization with a straight-through approximation and adaptive entropy variable.
result Fast SeqProp achieves up to 100-fold faster convergence and improved fitness optima.

We consider active maximum a posteriori (MAP) inference problem for Hidden Markov Models (HMM), where, given an initial MAP estimate of the hidden sequence, we select to label certain states in the sequence to improve the estimation accuracy of the remaining states. We develop an analytical approach to this problem for…

2014-11-03abs ↗pdf ↗

We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical obs…

2016-08-11abs ↗pdf ↗

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 ↗

New algorithm improves interpretability in sequence classification.

problem Lack of human-independent interpretability metrics in sequence classification.
method Combines linear classifiers with background knowledge embeddings to create a new feature space.
result Preserves predictive power while delivering more interpretable models.

CLVSA predicts financial market trends using LSTM and attention mechanisms.

problem Predicting trends in financial markets due to complex interactions.
method Hybrid model combining LSTM, sequence-to-sequence, attention, and convolutional LSTM.
result CLVSA outperforms basic models in predicting financial market trends.

Until recently, research on artificial neural networks was largely restricted to systems with only two types of variable: Neural activities that represent the current or recent input and weights that learn to capture regularities among inputs, outputs and payoffs. There is no good reason for this restriction. Synapses …

2016-10-20abs ↗pdf ↗

Introduces alternators for modeling sequences, outperforming baselines.

problem Modeling complex sequential data with stability and efficiency.
method Two neural networks (OTN and FTN) alternate between outputting samples in observation and feature spaces, learned via cross-entropy criterion.
result Alternators outperform strong baselines in various domains (Lorenz equations, Neuroscience, Climate Science).

GGP models multivariate time series with latent sub-sequences for diverse behaviors.

problem Modeling multivariate time series with diverse behaviors and patterns.
method Graph Gamma Process (GGP) linear dynamical systems with latent sub-sequences.
result GGP models exhibit good predictive performance and reveal interpretable latent patterns.

The paper introduces walks with jumps for modeling neuron activity in hyperbolic space.

problem Encoding neuron activity sequences in hyperbolic space.
method Introducing walks with jumps in hyperbolic geometry to model neuron activity.
result Endpoints of walks with jumps do not fully encode the sequence of jump times.

Paper proposes semi-supervised learning using change points for sequence classification.

problem Limited labeled data for sequential sensor data classification.
method Change point detection for identifying class changes, semi-supervised learning with labeled and unlabeled data.
result Improved classification performance on human activity recognition datasets.

We introduce the stochastic multiplicative point process modelling trading activity of financial markets. Such a model system exhibits power-law spectral density S(f) ~ 1/f**beta, scaled as power of frequency for various values of beta between 0.5 and 2. Furthermore, we analyze the relation between the power-law autoco…

2004-12-28abs ↗pdf ↗

Active-memory mechanisms can replace self-attention in Transformers, but optimal results often require both.

problem Replacing self-attention with active-memory mechanisms in Transformers.
method Evaluation of various active-memory mechanisms in a Transformer model.
result Active-memory mechanisms can achieve comparable results to self-attention for language modeling, but optimal results are often achieved by combining both mechanisms.

Many online platforms have deployed anti-fraud systems to detect and prevent fraudulent activities. However, there is usually a gap between the time that a user commits a fraudulent action and the time that the user is suspended by the platform. How to detect fraudsters in time is a challenging problem. Most of the exi…

2018-09-12abs ↗pdf ↗

ESE-FN improves elderly activity recognition accuracy.

problem Recognizing individual actions and human-object interactions in elderly activities.
method Exploits multi-modal features from RGB videos and skeleton sequences using ESE attentions and a new Multi-modal Loss.
result ESE-FN achieves best accuracy on ETRI-Activity3D dataset.

Recurrent neural networks (RNNs) provide state-of-the-art performance in processing sequential data but are memory intensive to train, limiting the flexibility of RNN models which can be trained. Reversible RNNs---RNNs for which the hidden-to-hidden transition can be reversed---offer a path to reduce the memory require…

2018-10-25abs ↗pdf ↗

A framework is introduced for actively and adaptively solving a sequence of machine learning problems, which are changing in bounded manner from one time step to the next. An algorithm is developed that actively queries the labels of the most informative samples from an unlabeled data pool, and that adapts to the chang…

2018-05-29abs ↗pdf ↗

Neural networks cannot approximate certain functions in Sobolev spaces, leading to unbounded parameter growth.

problem Non-closedness of sets of neural networks in Sobolev spaces.
method Construction of sequences of neural networks whose realizations converge to functions not realizable by neural networks.
result Sets of realized neural networks are not closed in order-(m1)(m-1) Sobolev spaces Wm1,pW^{m-1,p} for p[1,]p \in [1,\infty].

Not all types of supervision signals are created equal: Different types of feedback have different costs and effects on learning. We show how self-regulation strategies that decide when to ask for which kind of feedback from a teacher (or from oneself) can be cast as a learning-to-learn problem leading to improved cost…

2019-07-11abs ↗pdf ↗

New algorithm for active learning from feedback coding.

problem Efficiently selecting examples for labeling in active machine learning.
method Formalized structural similarities between active learning and feedback channel coding, developed an optimal transport-based algorithm called Approximate Posterior Matching (APM).
result Learning performance comparable to existing methods at reduced computational cost.

New approach models computer network activity as mixtures of sources.

problem Malicious activity detection in computer networks using standard algorithms is ineffective.
method Source separation approach to model short-term dynamics of computer network activity.
result Qualitative and quantitative experiments validate the approach.

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 ↗

We stabilize the activations of Recurrent Neural Networks (RNNs) by penalizing the squared distance between successive hidden states' norms. This penalty term is an effective regularizer for RNNs including LSTMs and IRNNs, improving performance on character-level language modeling and phoneme recognition, and outperfor…

2015-11-26abs ↗pdf ↗