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

3.6%7.1%10.7%14.3% · Oct 199219922001200920172026
48 results for sequence identification

Computational identification of promoters is notoriously difficult as human genes often have unique promoter sequences that provide regulation of transcription and interaction with transcription initiation complex. While there are many attempts to develop computational promoter identification methods, we have no reliab…

2018-10-02abs ↗pdf ↗

Established recurrent neural networks are well-suited to solve a wide variety of prediction tasks involving discrete sequences. However, they do not perform as well in the task of dynamical system identification, when dealing with observations from continuous variables that are unevenly sampled in time, for example due…

2019-11-21abs ↗pdf ↗

Recent developments within deep learning are relevant for nonlinear system identification problems. In this paper, we establish connections between the deep learning and the system identification communities. It has recently been shown that convolutional architectures are at least as capable as recurrent architectures …

2019-09-04abs ↗pdf ↗

Paper tackles counterfactual sentence detection and evaluation.

problem Detect and evaluate counterfactual sentences in natural language.
method Used a BERT base model for classification and a hybrid BERT Multi-Layer Perceptron for sequence identification. Introduced cascaded linear inputs to improve performance.
result Achieved an F1 score of 85.00% in Task 1 and 83.90% in Task 2.

We study a variant of the source identification game with training data in which part of the training data is corrupted by an attacker. In the addressed scenario, the defender aims at deciding whether a test sequence has been drawn according to a discrete memoryless source XPXX \sim P_X, whose statistics are known to hi…

2017-03-27abs ↗pdf ↗

A distributed system identification method for LTI systems using reverse experience replay.

problem Online system identification of LTI systems over multi-agent networks.
method DSGD-RER, a distributed variant of SGD-RER with backward updates.
result The estimation error decreases as the network size grows.

BestChanID identifies the channel with maximal capacity using training sequences.

problem Identifying the channel with maximal capacity among several discrete memoryless channels.
method Formulated as a multi-armed bandit problem, proposed a capacity estimator, and developed gap-elimination algorithms.
result Guaranteed to output the DMC with the largest capacity with a desired confidence.

We propose a method for face de-identification that enables fully automatic video modification at high frame rates. The goal is to maximally decorrelate the identity, while having the perception (pose, illumination and expression) fixed. We achieve this by a novel feed-forward encoder-decoder network architecture that …

2019-11-19abs ↗pdf ↗

This study improves UAV identification using RF signals with one-shot generative methods.

problem Limited RF environments and signal variability make traditional RF identification ineffective.
method Introduces one-shot generative methods to augment RF signals for UAV identification.
result One-shot generative methods outperform traditional methods in low-data regimes.

A novel deep probabilistic model for dynamic systems forecasting.

problem Probabilistic forecasting in dynamic systems.
method Combining deep generative models and state space models with recurrent neural networks and variational sequence models.
result Outperforms existing models in system identification benchmarks and real-world centrifugal compressor forecasting.

T. Saito and M. Teragaito asked whether Berge knots of type VII are hyperbolic, and showed that some infinite sequences of the knots are hyperbolic. We show that Berge knots of types VII and VIII are hyperbolic except the known sequence of torus knots. We used the Reidemeister torsions. As a result, the Alexander polyn…

2011-07-02abs ↗pdf ↗

Sequential data often originates from diverse domains across which statistical regularities and domain specifics exist. To specifically learn cross-domain sequence representations, we introduce disentangled state space models (DSSM) -- a class of SSM in which domain-invariant state dynamics is explicitly disentangled f…

2019-06-07abs ↗pdf ↗

New dataset and models detect cryptocurrency bubbles using social media data.

problem Detecting anomalous market behavior in cryptocoins and meme stocks.
method Developed a novel multi-span identification task and sequence-to-sequence hyperbolic models.
result Models effectively detect cryptocoins and meme stocks bubbles in zero-shot settings.

In its most general form, the recognition problem in Riemannian geometry asks for the identification of an unknown Riemannian manifold via measurements of metric invariants on the manifold. We introduce a new infinite sequence of invariants, the first term of which is the usual diameter, and illustrate the role of thes…

1992-10-01abs ↗pdf ↗

Continuous-time event sequences represent discrete events occurring in continuous time. Such sequences arise frequently in real-life. Usually we expect the sequences to follow some regular pattern over time. However, sometimes these patterns may be interrupted by unexpected absence or occurrences of events. Identificat…

2019-12-19abs ↗pdf ↗

In this paper, we consider a best action identification problem in the stochastic linear bandit setup with a fixed confident constraint. In the considered best action identification problem, instead of minimizing the accumulative regret as done in existing works, the learner aims to obtain an accurate estimate of the u…

2018-12-02abs ↗pdf ↗

The paper develops a convex parameterization for robust RNNs ensuring stability and robustness.

problem Lack of stability and robustness guarantees in RNNs for sequence-to-sequence mapping applications.
method Formulated convex sets of RNNs with stability and robustness guarantees using incremental quadratic constraints.
result The proposed model structure ensures global exponential stability and bounds on incremental 2 \ell_2 gain.

Study on generating and identifying languages privately, showing privacy imposes costs and creates barriers.

problem Generating and identifying languages privately in the limit model.
method Introduced a continual release model under differential privacy constraints, proving both positive and negative results.
result Privacy imposes quantitative and qualitative costs, and creates fundamental barriers for identification.

This paper solves the best arm identification problem with both quick commitment and reward maximization.

problem Simultaneously identifying the best arm and minimizing regret in a stochastic Multi-Armed Bandit problem.
method Introduces Regret Optimal Best Arm Identification (ROBAI) and presents algorithms EOCP and its variants.
result Achieves asymptotic optimal regret and quick commitment to the optimal arm in both pre-determined and adaptive stopping times.

Algorithm identifies missing data distributions in graphical models.

problem Identifying missing data distributions in graphical models with interventionist perspective.
method Tree-based identification algorithm that tracks selection bias and admissible intervention strategies.
result Valid estimating equations for missingness mechanism and complete data distribution.

Algorithm identifies bilinear dynamical systems from noisy data.

problem Learning a realization of a partially observed bilinear dynamical system.
method Regression of outputs to highly correlated covariates for Markov-like parameters.
result High probability error bounds on identification algorithm under uniform stability assumption.

Bayes-assisted confidence sequences improve efficiency for bounded means.

problem Efficient uncertainty quantification for bounded IID means without parametric assumptions.
method Bayesian working predictive model selects adaptive martingale updates maximizing predictive log-growth.
result Asymptotically log-optimal performance with informative priors reducing width and sampling effort.

BCI system improves word selection efficiency using sequential best-arm identification.

problem Conventional non-adaptive BCI paradigms lead to a lengthy learning process.
method Casted as sequence of best-arm identification tasks in multi-armed bandits, using pre-trained LLMs and STTS algorithm.
result Substantial empirical improvement in word selection efficiency demonstrated.

Local ancestry inference (LAI) allows identification of the ancestry of all chromosomal segments in admixed individuals, and it is a critical step in the analysis of human genomes with applications from pharmacogenomics and precision medicine to genome-wide association studies. In recent years, many LAI techniques have…

2019-11-27abs ↗pdf ↗

In this paper we consider the problem of video-based person re-identification, which is the task of associating videos of the same person captured by different and non-overlapping cameras. We propose a Siamese framework in which video frames of the person to re-identify and of the candidate one are processed by two ide…

2019-09-26abs ↗pdf ↗

A novel algorithm for best-arm identification in non-stationary linear bandits reduces error probability.

problem Non-stationary environments in A/B testing scenarios.
method Proposes a novel algorithm P1\mathsf{P1}-RAGE\mathsf{RAGE} for robust best-arm identification.
result Error probability decreases as exp(TΔ(1)2/d)\exp(-TΔ^2_{(1)}/d), demonstrating robustness to non-stationarity.

We develop a model to predict effects of sequential interventions, clarifying their combined impact.

problem Uncertainty in generalizing behavioral predictions for combinations of interventions.
method Explicit model for composition of interventions, identifying their combined effect.
result Our compositional model aids prediction in sparse data conditions.

We prove that stochastic gradient descent efficiently converges to the global optimizer of the maximum likelihood objective of an unknown linear time-invariant dynamical system from a sequence of noisy observations generated by the system. Even though the objective function is non-convex, we provide polynomial running …

2016-09-16abs ↗pdf ↗

This paper provides both a detailed study of color-dependence of link homologies, as realized in physics as certain spaces of BPS states, and a broad study of the behavior of BPS states in general. We consider how the spectrum of BPS states varies as continuous parameters of a theory are perturbed. This question can be…

2015-12-24abs ↗pdf ↗