As an emerging research direction, online streaming feature selection deals with sequentially added dimensions in a feature space while the number of data instances is fixed. Online streaming feature selection provides a new, complementary algorithmic methodology to enrich online feature selection, especially targets t…
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,932 papers · 148 categories
Trend · papers per month
48 results for “online streaming”
Online-iForest detects anomalies in streaming data efficiently.
problem Offline anomaly detection methods are impractical for streaming contexts.
method Online-iForest tracks evolving data processes in real-time without periodic retraining.
result Online-iForest outperforms all competitors in efficiency.
Online Multi-Source Domain Adaptation through Gaussian Mixtures and Dataset Dictionary Learningcs.LG
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 method rebalances evolving data streams incrementally.
problem Incremental rebalancing of evolving data streams.
method Proposes a new streaming approach for rebalancing data streams online.
result Outperforms existing approaches in rebalancing data streams.
New PAC-Bayesian bounds for online learning with data streams.
problem Challenges of traditional PAC-Bayesian bounds in dynamic data collection.
method Developed new PAC-Bayesian bounds in online learning framework, using updated regret definition and batch-to-online conversion.
result PAC-Bayesian bounds hold for online learning with dependent data and non-convex losses.
Proposes standards for evaluating online machine learning methods in evolving data streams.
problem Difficulty in evaluating online machine learning methods under realistic conditions.
method Proposes comprehensive evaluation standards, performance measures, and evaluation strategies.
result Provides a new Python framework (float) for modular integration of libraries and custom code.
Dynamic Model Tree improves online learning for evolving data streams.
problem Effective and transparent machine learning on data streams is challenging.
method Revisit Model Trees for data stream applications, introducing Dynamic Model Tree.
result Dynamic Model Tree reduces the number of splits and outperforms state-of-the-art models.
New online feature selection method handles streaming data with concept drift.
problem Handling streaming data with concept drift and sparsity.
method Online feature screening method with model adaptation.
result Online screening methods with model adaptation outperform without model adaptation on data streams with concept drift.
Online Linearized LASSOstat.ML
Paper proposes an online sparse linear regression method for streaming data.
problem Sparse regression for variable selection and prediction accuracy.
method Online sparse linear regression framework with memory efficiency and relaxed assumptions.
result The -norm statistical error of the estimator diminishes to zero with optimal order.
Proposes an online method for high-dimensional streaming data.
problem Increasing variable dimensions with sample size in online kernel sliced inverse regression.
method Introduces approximate linear dependence condition and dictionary variable sets to address the problem. Transforms into online generalized eigen-decomposition problem and uses stochastic optimization for updates.
result Achieves close performance to batch processing kernel sliced inverse regression.
OLBoost improves online decision tree performance without increasing memory or time costs.
problem Improving predictive performance in online decision trees without high memory or time costs.
method OLBoost applies boosting to small regions of the instances space within online decision tree algorithms.
result OLBoost can significantly improve online learning decision tree performance without increasing tree size.
The area of online machine learning in big data streams covers algorithms that are (1) distributed and (2) work from data streams with only a limited possibility to store past data. The first requirement mostly concerns software architectures and efficient algorithms. The second one also imposes nontrivial theoretical …
New online method estimates OT distances from sample streams.
problem Computing OT distances between arbitrary distributions.
method Online Sinkhorn algorithm using iterative enrichment of non-parametric representation.
result Consistent estimation of true regularized OT distance with nearly-O(1/n) sample complexity.
Streaming variational Bayes (SVB) is successful in learning LDA models in an online manner. However previous attempts toward developing online Monte-Carlo methods for LDA have little success, often by having much worse perplexity than their batch counterparts. We present a streaming Gibbs sampling (SGS) method, an onli…
New online GP algorithm offers performance guarantees for streaming data.
problem Training and inference of GPs require all historic data, limiting online decision-making.
method Developed a new theoretical framework based on PAC-Bayes theory, optimizing empirical risk and parameter divergence.
result Offers both a guarantee of generalized performance and good accuracy.
A new method for online multi-label stream classification.
problem Challenges in classifying continuous data streams with concept drift and delayed labels.
method Online unsupervised incremental method based on self-organizing maps.
result The method is highly competitive in both stationary and concept drift scenarios.
iPrescribe offers fast online offer recommendations using deep learning.
problem Online offer recommendation in real-time.
method Ensemble of deep learning and machine learning algorithms, optimized streaming technology stack, and efficient LSTM deployment.
result 90th percentile recommendation latency of 38 milliseconds.
New algorithm learns and unlearns from streaming data efficiently.
problem Continuous learning and unlearning from production data streams.
method Translated batch unlearning techniques to online setting using regret, sample complexity, and deletion capacity.
result Achieved logarithmic regret bound of for online unlearning.
Cluster analysis is used to explore structure in unlabeled data sets in a wide range of applications. An important part of cluster analysis is validating the quality of computationally obtained clusters. A large number of different internal indices have been developed for validation in the offline setting. However, thi…
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.
Optimal sampling reduces power grid data analysis costs.
problem Efficient online analysis of high-speed, correlated IoT data.
method D-optimality criterion-based sampling methods combining Bernoulli and leverage score sampling.
result Leverage score sampling improves computational efficiency and outperforms benchmarks.
Online learning algorithm identifies contextual changes for streaming data.
problem Challenges in identifying and utilizing contextual cues for streaming data.
method Neural network-based autoencoder for identifying contextual changes; comparison to a knowledge base of learned contexts.
result Classifier training benefits from automatically discovered contexts, demonstrating quicker learning convergence during contextual changes.
Online TERM improves robustness and fairness in streaming data.
problem Streaming data's lack of worst-case fairness and robustness in ERM.
method Proposes an online TERM formulation to balance average-case accuracy with worst-case fairness and robustness.
result Negative tilting effectively suppresses outlier influence, positive tilting improves recall with minimal precision loss.
We introduce a new sub-linear space sketch---the Weight-Median Sketch---for learning compressed linear classifiers over data streams while supporting the efficient recovery of large-magnitude weights in the model. This enables memory-limited execution of several statistical analyses over streams, including online featu…
Federated online learning for streaming data with privacy and efficiency.
problem Analyzing continuous, heterogeneous data streams in a privacy-preserving manner.
method Personalized models for each data source, subgroup assumption, penalized renewable estimation, proximal gradient descent.
result Effective model for distributed multi-source streaming data analysis with privacy and efficiency.
Low-rank extended Kalman filtering for online learning of neural networks from streaming datastat.ML
Efficiently learns neural network parameters from streaming data.
problem Online learning of neural networks from non-stationary data streams.
method Low-rank extended Kalman filtering for approximate Bayesian inference.
result Significantly faster learning and adaptation to changing distributions.
Survey of robust streaming techniques and their relationships.
problem Challenges in robust streaming and online learning.
method Overview and survey of robust streaming techniques, unifying theorems.
result Proved the relationship between robust streaming techniques.
CDRE estimates density ratios in streaming data without historical samples.
problem Online learning with shifting data distributions.
method Iterative estimation of density ratios between initial and current distributions.
result CDRE outperforms standard DRE in estimating divergences between distributions.
Online algorithm detects community structure in dynamic event streams.
problem Community detection in networks with temporal event streams.
method Continuous-time point process latent network models with fast online variational inference.
result Online inference achieves comparable community recovery to non-online methods but with computational gains.
New algorithm improves feature selection for streaming data.
problem Traditional OSFS methods assume all data available at runtime, but features and samples stream concurrently.
method Introduces Geometric Online Adaption (GOA) for concurrent streaming of features and samples.
result GOA outperforms SAOLA on various datasets and in the OSFS-SS setting.
A method detects changes in heterogeneous data streams over graph nodes.
problem Detecting changes in data streams from nodes of a graph.
method Online non-parametric method using likelihood-ratio estimation.
result The method accurately identifies change-points in real-world applications.
A novel online framework for analyzing multidimensional functional data.
problem Analysis of multidimensional functional data streams poses significant challenges.
method Online functional principal component analysis using tensor product splines on a Stiefel manifold with Riemannian stochastic gradient descent.
result Efficient and scalable modeling of multidimensional functional data.
SBIC improves real-time online binary classification from crowdsourced data.
problem Inferring ground truth from noisy crowdsourced data.
method Streaming Bayesian Inference for Crowdsourcing (SBIC).
result SBIC has low complexity, high accuracy, and provable guarantees.
A new framework predicts hidden Markov model regimes online.
problem Efficiently identify hidden Markov model regimes in streaming data.
method Develops a predictive-first optimisation framework for streaming HMMs, approximating the full posterior predictive distribution.
result The method provides competitive prequential performance compared to Online EM and Sequential Monte Carlo.
KQT-EWMA monitors multivariate data streams online with flexible and practical change detection.
problem Online monitoring of multivariate data streams for detecting changes.
method Combines Kernel-QuantTree histogram and EWMA statistic for non-parametric monitoring.
result Controls Average Run Length (ARL0) while achieving comparable detection delays.
One of the current challenges in machine learning is how to deal with data coming at increasing rates in data streams. New predictive learning strategies are needed to cope with the high throughput data and concept drift. One of the data stream mining tasks where new learning strategies are needed is multi-target regre…
SkyGP improves Gaussian process scalability for real-time learning.
problem Scalability issues with exact Gaussian processes for streaming data.
method Streaming kernel-induced progressively generated Gaussian process experts (SkyGP).
result SkyGP maintains performance guarantees while improving scalability.
New method controls false discoveries in real-time data streams.
problem Online testing of hypotheses with strict error constraints and no future data.
method Structure-adaptive sequential testing (SAST) with alpha-investment algorithm.
result Substantial power gain over existing online testing rules.
Adapts DPMM for fast streaming data clustering.
problem Clustering streaming data with time-dependent statistics.
method Adapts DPMM and sampling-based inference for online clustering.
result Obtains state-of-the-art results in speed and accuracy.
As data streams become more prevalent, the necessity for online algorithms that mine this transient and dynamic data becomes clearer. Multi-label data stream classification is a supervised learning problem where each instance in the data stream is classified into one or more pre-defined sets of labels. Many methods hav…
Survey of active learning for data streams.
problem Efficiently labeling data points in real-time data streams.
method Review of active learning approaches for data streams.
result Overview of recent approaches for online active learning.
NADINE builds MLPs from streaming data, overcoming forgetting issues.
problem Building deep neural networks from streaming data efficiently and avoiding forgetting.
method NADINE uses a fully open MLP structure that dynamically evolves its depth and width online, resolving catastrophic forgetting through soft-forgetting and adaptive memory.
result NADINE outperforms existing methods in nine data stream classification and regression problems.
New method for efficient online variational estimation in streaming data.
problem Efficiently estimating parameters and latent states in online parametric models.
method i.i.d. Monte Carlo sampling coupled with deep architecture.
result The method computes the evidence lower bound and its gradient efficiently.
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…
Efficiently factorize tensors in streaming data with coreset selection.
problem Efficiently factorize tensors in streaming data.
method Online filtering and kernelization techniques to select a coreset of vectors.
result CP decomposition of coreset approximates full data tensor decomposition.
FAHT improves fairness in online decision-making systems.
problem Discrimination in decision support systems due to biased data.
method FAHT is an adaptive fairness-aware decision tree classifier based on Hoeffding Tree algorithm.
result FAHT maintains fairness while maintaining moderate predictive performance in streaming environments.
Paper develops an online EM algorithm for graph signal inference from streaming data.
problem Joint inference and clustering of graph signals with non-white excitation.
method Mixture model with low-rank plus sparse prior, online EM algorithm.
result Proposed online EM algorithm converges to MAP solution.
iMondrian forest combines isolation forest and Mondrian forest for better anomaly detection.
problem Anomaly detection in batch and online settings.
method Hybrid of isolation forest and Mondrian forest, using depth in Mondrian forest structure.
result iMondrian forest outperforms existing methods in batch and online settings.