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

4080120160 · Jun 202019922001200920172026
48 results for online pipeline

OFTER predicts multivariate time series online, outperforming baselines.

problem Mid-sized multivariate time series forecasting challenges.
method k-nearest neighbors, Generalized Regression Neural Networks, dimensionality reduction.
result OFTER outperforms state-of-the-art baselines in financial multivariate time series forecasting.

Modular pipeline improves stock portfolio prediction robustness under regime changes.

problem Overfitting in deep learning models for non-stationary datasets.
method Modular machine learning pipeline with GBDT models and online learning techniques.
result GBDT models with dropout show high performance, robustness, and generalisability.

This paper introduces Zap, a generic machine learning pipeline for making predictions based on online user behavior. Zap combines well known techniques for processing sequential data with more obscure techniques such as Bloom filters, bucketing, and model calibration into an end-to-end solution. The pipeline creates we…

2018-07-16abs ↗pdf ↗

Clapping reduces memory usage in distributed optimization by reusing data samples.

problem Significant communication overhead and impractical memory overhead in pipeline-parallel distributed optimization.
method Lazy sampling strategy to reuse data samples across steps, supporting convergence without unbiased gradient assumptions.
result Clapping achieves convergence in few-epoch or online training regimes without sample-size memory overhead.

This paper studies the problems of vehicle make & model classification. Some of the main challenges are reaching high classification accuracy and reducing the annotation time of the images. To address these problems, we have created a fine-grained database using online vehicle marketplaces of Turkey. A pipeline is prop…

2018-08-23abs ↗pdf ↗

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 O(lnT)\mathcal{O}(\ln{T}) for online unlearning.

New machine learning pipeline solves dynamic vehicle routing problems efficiently.

problem Efficiently handling same day deliveries in e-commerce logistics.
method Combination of machine learning and combinatorial optimization.
result Ranked first in the EURO Meets NeurIPS Vehicle Routing Competition.

This paper introduces a novel approach for dengue fever classification based on online learning paradigms. The proposed approach is suitable for practical implementation as it enables learning using only a few training samples. With time, the proposed approach is capable of learning incrementally from the data collecte…

2019-04-17abs ↗pdf ↗

A scalable system detects price anomalies in online marketplaces to improve customer experience.

problem Inaccurate prices on online marketplaces lead to poor customer experience and revenue loss.
method MoatPlus uses unsupervised statistical features and an ensemble of models to generate upper price bounds.
result Our approach improves precise anchor coverage by up to 46.6% in high-vulnerability item subsets.

Large companies need to monitor various metrics (for example, Page Views and Revenue) of their applications and services in real time. At Microsoft, we develop a time-series anomaly detection service which helps customers to monitor the time-series continuously and alert for potential incidents on time. In this paper, …

2019-06-10abs ↗pdf ↗

AVATAR uses a surrogate model to quickly evaluate ML pipelines, saving time and resources.

problem Time-consuming evaluation of ML pipelines limits exploration of complex models.
method AVATAR employs a surrogate model to assess pipeline validity without execution.
result AVATAR accelerates ML pipeline evaluation, improving efficiency in complex scenarios.

A new metric, Weighted Regret, unifies FDR and power evaluation in online multiple testing.

problem The asymmetric costs of false positives and false negatives in automated pipelines.
method Introducing Weighted Regret and Decoupled-OMT (DOMT) to unify FDR and power evaluation.
result DOMT achieves an order-optimal sublinear mitigation of threshold depletion in bursty environments.

While the purpose of most fake news is misinformation and political propaganda, our team sees it as a new type of myth that is created by people in the age of internet identities and artificial intelligence. Seeking insights on the fear and desire hidden underneath these modified or generated stories, we use machine le…

2019-08-05abs ↗pdf ↗

STVNN models spatiotemporal data using covariance matrices.

problem Challenges in modeling spatiotemporal interactions in multivariate time series.
method Introduces SpatioTemporal coVariance Neural Network (STVNN) that operates on sample covariance matrix and uses joint spatiotemporal convolutions.
result STVNN is stable to online estimation uncertainties and outperforms temporal PCA.

FavMac maximizes value while controlling cost in multi-label prediction.

problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.

New online learning algorithms improve cyberattack detection in industrial control systems.

problem Detecting cyberattacks in industrial control systems with limited resources.
method Online learning algorithms to process continuous data streams and address class imbalance.
result Improved detection rate of cyberattacks in industrial control systems.

Hyperparameter tuning of multi-stage pipelines introduces a significant computational burden. Motivated by the observation that work can be reused across pipelines if the intermediate computations are the same, we propose a pipeline-aware approach to hyperparameter tuning. Our approach optimizes both the design and exe…

2019-03-12abs ↗pdf ↗

Study proposes a statistical testing framework for evaluating clustering pipelines.

problem Quantifying the statistical reliability of clustering results from data analysis pipelines.
method Selective inference-based statistical testing framework for clustering pipelines.
result The proposed test controls the type I error rate and is effective in validating clustering results.

Unified approach to RLHF tackles uncertainty in reward function.

problem Uncertainty in reward function learned from human feedback.
method Value-incentivized preference optimization (VPO) that regularizes the reward function with value function.
result Theoretical and practical guarantees for both online and offline RLHF settings.

Investigates fairness in pipeline models where individuals may drop out.

problem Fairness in pipeline models where individuals may drop out and subsequent stages depend on remaining individuals.
method Rigorous framework for evaluating fairness guarantees, showing that naïve auditing is insufficient and dependence must exist between stages.
result Fairness in pipelines can be arbitrary, even with just two stages, and requires dependence between stages.

Bridges uplift modeling and sequential decision-making with online budget allocation.

problem Treatment allocation under budget constraints in digital advertising.
method Budget-Constrained Causal Bandits (BCCB) integrates learning, exploration, and budget pacing.
result Data-efficiency crossover: BCCB operates effectively from the first user, 3-5x lower performance variance.

Automates supervised learning pipeline design with matrix and tensor factorization.

problem Designing effective supervised learning pipelines with many choices.
method Uses matrix and tensor factorization to model pipeline search space and develops greedy experiment design protocols.
result Demonstrates the effectiveness of the approach on real-world classification problems.

KVCOMM optimizes multi-agent LLM systems by reusing KV-caches, reducing redundant processing.

problem Substantial overhead from reprocessing overlapping contexts across multi-agent systems.
method KVCOMM reuses KV-caches and adjusts offsets for shared content using a pool of cached examples (anchors).
result Achieves over 70% reuse rate across diverse multi-agent tasks, up to 7.8x speedup.

Algorithm learns optimal coordination for strategic agents in uncertain settings.

problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of O~(T)\tilde{O}(\sqrt{T}) for learning optimal policy.

Pipeline decomposes portfolio optimization problems into smaller, solvable subproblems.

problem Large-scale portfolio optimization with constraints.
method Decomposition pipeline with preprocessing, clustering, and risk rebalancing.
result Pipeline reduces problem size by 80% and computation time.

Paper proposes a statistical test for feature selection pipelines using selective inference.

problem Assessing the significance of feature selection pipelines in data analysis.
method Selective inference technique applied to feature selection pipelines composed of various algorithms.
result The proposed statistical test controls false positive feature selection probabilities.

Pipelined Backpropagation trains large models without batches efficiently.

problem Training large models efficiently on hardware with limited batch sizes.
method Fine-grained Pipelined Backpropagation with Spike Compensation and Linear Weight Prediction.
result Fine-grained Pipelined Backpropagation with a batch size of one matches the accuracy of SGD for multiple networks.

Study reveals similarities in knowledge flows between pharmaceutical and AI industries.

problem Understanding the dynamics of drug pipelines in global pharmaceutical industry.
method Multilayer network analysis of drug pipeline, global supply chain, and ownership data.
result Proven similarities in knowledge flows between pharmaceutical and AI industries.

TODS automates time series outlier detection with customizable pipelines.

problem Automated detection of outliers in time series data.
method Modular system with 70 primitives for data processing, time series analysis, and detection algorithms. GUI and data-driven searcher for pipeline design.
result Automated discovery and construction of effective outlier detection pipelines.

Study forecasts vegetable prices in Nepal using a novel index and ensemble model.

problem High volatility and cultural influences on agricultural commodity prices.
method Developed KVPI, created features, evaluated multiple models, introduced Momentum-Corrected Online Stacking Ensemble.
result Achieved RMSE of 1.771, MAPE of 0.68%, and R-squared of 0.845 at 90-day horizon.

A rigorous ML pipeline for binary classification in biomedical studies, focusing on pancreatic cancer.

problem Handling bias in ML models for complex biomedical data.
method Customizable ML analysis pipeline with 9 algorithms, hyperparameter optimization, and thorough evaluation.
result Comparison of ML algorithms to ExSTraCS, highlighting interpretability and bias handling.

Pipeline parallelism (PP) when training neural networks enables larger models to be partitioned spatially, leading to both lower network communication and overall higher hardware utilization. Unfortunately, to preserve the statistical efficiency of sequential training, existing PP techniques sacrifice hardware efficien…

2019-10-09abs ↗pdf ↗