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

4.2%8.3%12.5%16.7% · Apr 199519922001200920172026
48 results for multiple streams

Data stream classification methods demonstrate promising performance on a single data stream by exploring the cohesion in the data stream. However, multiple data streams that involve several correlated data streams are common in many practical scenarios, which can be viewed as multi-task data streams. Instead of handli…

2019-08-15abs ↗pdf ↗

A new control chart detects shifts in binary data streams quickly and reliably.

problem Early detection of small shifts in multiple binary data streams.
method Cumulative Standardized Binomial EWMA (CSB-EWMA) chart with exact variance derivation.
result Adaptive control limits ensure robust detection across different data distributions.

Financial fraud detection in digital banking requires reasoning over multiple heterogeneous event streams.

problem Financial fraud detection in digital banking requires reasoning over multiple heterogeneous event streams.
method Multi-Stream Fraud Transformer (MSFT) architecture that encodes each event stream with independent Transformer encoders and fuses their representations through configurable mechanisms.
result Sequence models significantly outperform gradient-boosted trees operating on aggregated features.

Scikit-multiflow is a multi-output/multi-label and stream data mining framework for the Python programming language. Conceived to serve as a platform to encourage democratization of stream learning research, it provides multiple state of the art methods for stream learning, stream generators and evaluators. scikit-mult…

2018-07-12abs ↗pdf ↗

In this paper we introduce a micro-clustering strategy for Functional Boxplots. The aim is to summarize a set of streaming time series splitted in non overlapping windows. It is a two step strategy which performs at first, an on-line summarization by means of functional data structures, named Functional Boxplot micro-c…

2012-12-12abs ↗pdf ↗

In data stream mining, predictive models typically suffer drops in predictive performance due to concept drift. As enough data representing the new concept must be collected for the new concept to be well learnt, the predictive performance of existing models usually takes some time to recover from concept drift. To spe…

2019-01-07abs ↗pdf ↗

Manifold learning based methods have been widely used for non-linear dimensionality reduction (NLDR). However, in many practical settings, the need to process streaming data is a challenge for such methods, owing to the high computational complexity involved. Moreover, most methods operate under the assumption that the…

2017-10-17abs ↗pdf ↗

Online detection of abrupt changes in high-dimensional data streams.

problem Detecting abrupt changes in high-dimensional, streaming data with multiple subspaces.
method Dynamic sparse subspace learning approach with multiple structural change-point model, Bayesian information criterion for penalty coefficients selection, and Pruned Exact Linear Time algorithm.
result Effectiveness demonstrated through simulation and real gesture data studies.

Proposes a method to optimize budget allocation for collecting and analyzing streaming data.

problem Optimizing resource allocation for collecting and analyzing streaming data.
method Formulates optimization problems to allocate budgets for collecting input data and running simulations, characterizes asymptotic behavior of performance estimators, and develops a multi-stage simultaneous budget allocation procedure.
result Demonstrates competitive performance of the proposed procedure through numerical studies.

StreamEnsemble dynamically selects ML models for ST data streams to improve predictive accuracy.

problem Predictive queries over spatiotemporal data streams are challenging due to varying distributions and patterns.
method Dynamic selection and allocation of ML models based on time series distributions and characteristics.
result Significantly outperforms traditional ensemble and single model approaches, reducing prediction error by over 10 times.

The paper tackles carousel personalization in music streaming apps using contextual bandits.

problem Selecting relevant items to display in carousels for personalized content recommendation.
method Modeling carousel personalization as a contextual multi-armed bandit problem with multiple plays, cascade-based updates and delayed batch feedback.
result Empirically shows the effectiveness of the framework in capturing characteristics of real-world carousels.

With the dawn of the Big Data era, data sets are growing rapidly. Data is streaming from everywhere - from cameras, mobile phones, cars, and other electronic devices. Clustering streaming data is a very challenging problem. Unlike the traditional clustering algorithms where the dataset can be stored and scanned multipl…

2019-02-07abs ↗pdf ↗

It is well known that combining multiple hedge fund alpha streams yields diversification benefits to the resultant portfolio. Additionally, crossing trades between different alpha streams reduces transaction costs. As the number of alpha streams increases, the relative turnover of the portfolio decreases as more trades…

2014-04-03abs ↗pdf ↗

Oja's algorithm has been the cornerstone of streaming methods in Principal Component Analysis (PCA) since it was first proposed in 1982. However, Oja's algorithm does not have a standardized choice of learning rate (step size) that both performs well in practice and truly conforms to the online streaming setting. In th…

2019-05-28abs ↗pdf ↗

We discuss investment allocation to multiple alpha streams traded on the same execution platform with internal crossing of trades and point out differences with allocating investment when alpha streams are traded on separate execution platforms with no crossing. First, in the latter case allocation weights are non-nega…

2014-05-19abs ↗pdf ↗

A new method for predicting uncertainties in stream networks.

problem Uncertainty quantification in spatiotemporal graphs with directional flow constraints.
method Spatio-Temporal Adaptive Conformal Inference (STACI) integrating network topology and temporal dynamics.
result STACI effectively balances prediction efficiency and coverage, outperforming existing methods.

In supervised machine learning, an agent is typically trained once and then deployed. While this works well for static settings, robots often operate in changing environments and must quickly learn new things from data streams. In this paradigm, known as streaming learning, a learner is trained online, in a single pass…

2018-09-16abs ↗pdf ↗

Paper tackles online multi-source domain adaptation using Gaussian mixtures and dictionary learning.

problem Adapting multiple, heterogeneous source domains to a target domain in a streaming fashion.
method Introduces a novel approach for online fitting of Gaussian Mixture Models based on Wasserstein geometry, combined with dataset dictionary learning.
result Demonstrates ability to adapt 'on the fly' to target domain data streams.

New algorithm samples matrix rows proportional to their ℓ_p norm in a turnstile data stream.

problem Sampling rows of a dynamic matrix efficiently in a turnstile data stream.
method Develops a novel algorithm for sampling rows proportional to their ℓ_p norm in a turnstile data stream, returning sampled row indexes and approximated sampling probabilities.
result Achieves (1+ε)(1+\varepsilon) approximation for logistic regression in a turnstile data stream with polynomial sketch size.

This paper reviews methods for distributed training of machine learning models from high-rate streams.

problem Training machine learning models from high-rate distributed streams in a compute- and bandwidth-limited setting.
method Recently developed methods for large-scale distributed stochastic optimization.
result There exist regimes where systems can learn from distributed, streaming data at order-optimal rates.

Improved COD algorithm reduces streaming AMM errors and uses less space.

problem Efficiently approximate matrix multiplication with limited memory.
method Tighter error bound for COD, space optimality, sparse matrix variant.
result Improved COD is space optimal and more efficient for sparse matrices.

In these notes we discuss investment allocation to multiple alpha streams traded on the same execution platform, including when trades are crossed internally resulting in turnover reduction. We discuss approaches to alpha weight optimization where one maximizes P&L subject to bounds on volatility (or Sharpe ratio). The…

2014-06-05abs ↗pdf ↗

This work provides improved guarantees for streaming principle component analysis (PCA). Given A1,,AnRd×dA_1, \ldots, A_n\in \mathbb{R}^{d\times d} sampled independently from distributions satisfying E[Ai]=Σ\mathbb{E}[A_i] = Σ for Σ0Σ\succeq \mathbf{0}, this work provides an O(d)O(d)-space linear-time single-pass streaming algorithm …

2016-02-22abs ↗pdf ↗

We consider the problems of robust PAC learning from distributed and streaming data, which may contain malicious errors and outliers, and analyze their fundamental complexity questions. In particular, we establish lower bounds on the communication complexity for distributed robust learning performed on multiple machine…

2017-03-30abs ↗pdf ↗

We present a streaming model for large-scale classification (in the context of 2\ell_2-SVM) by leveraging connections between learning and computational geometry. The streaming model imposes the constraint that only a single pass over the data is allowed. The 2\ell_2-SVM is known to have an equivalent formulation in …

2009-08-05abs ↗pdf ↗

A current challenge for data management systems is to support the construction and maintenance of machine learning models over data that is large, multi-dimensional, and evolving. While systems that could support these tasks are emerging, the need to scale to distributed, streaming data requires new models and algorith…

2017-10-05abs ↗pdf ↗

A federated model predicts failures using multi-stream incomplete data.

problem Insufficient data for reliable prognostic models in multi-stream applications.
method Federated data fusion, multivariate functional principal component analysis, (log)-location-scale regression model, federated algorithm.
result Performance is as good as classic non-federated models and better than individual models.

In recent years, there has been a growing interest in identifying anomalous structure within multivariate data streams. We consider the problem of detecting collective anomalies, corresponding to intervals where one or more of the data streams behaves anomalously. We first develop a test for a single collective anomaly…

2019-09-04abs ↗pdf ↗

Paper proposes a new MIMO detection algorithm using Gaussian Mixture Expectation Propagation.

problem Challenges in MIMO detection due to interference and noise in high-order high-dimensional systems.
method The approach uses a Gaussian Mixture Model (GMM) approximation for Belief Propagation (BP) and Expectation Propagation (EP) messages to improve detection accuracy.
result The proposed algorithm outperforms state-of-the-art detection algorithms while maintaining low computational complexity.

A model for deciding which facts to remember in a lifelong learning scenario.

problem Deciding which facts to retain in limited memory from an endless stream of information.
method Mathematical model based on online learning framework, using multiplicative weights update algorithm with modifications.
result Design of an alternative scheme with close to optimal regret guarantees for memory-constrained lifelong learning.

DDG-DA predicts future data distribution to adapt models for predictable concept drift.

problem Adapting models to streaming data with predictable concept drift.
method Train a predictor to forecast future data distribution, generate training samples, and train models on them.
result Significant improvement on multiple models in real-world tasks.

Online Streaming Feature Selection (OSFS) is a sequential learning problem where individual features across all samples are made available to algorithms in a streaming fashion. In this work, firstly, we assert that OSFS's main assumption of having data from all the samples available at runtime is unrealistic and introd…

2019-10-02abs ↗pdf ↗