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

Trend · papers per month

1.4%2.7%4.1%5.4% · Sep 202019922001200920172026
48 results for streaming recommendation

Proposes CVRCF for streaming recommender systems combining deep learning and probabilistic models.

problem Streaming recommendation problem with dynamic data and complexity.
method Coupled Variational Recurrent Collaborative Filtering (CVRCF) framework integrating stochastic processes and deep factorization models.
result Favorable performance in temporal dependency modeling and predictive accuracy compared to state-of-the-art methods.

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.

A new recommendation system model tackles unreliable user behavior.

problem Creating effective recommendation systems in the presence of unreliable user behavior.
method A novel modification of Multi-Armed Bandits with an unreliable intermediate.
result Proved fundamental theorems and developed an Explore-Commit algorithm close to optimal performance.

New method for evaluating sequential recommendations with lower variance.

problem Evaluating good sequences of music, video, news, and e-commerce recommendations.
method Proposes a new counterfactual estimator for sequential reward interactions with lower variance and asymptotic unbiasedness.
result Our method outperforms existing methods in bias and data efficiency for sequential track recommendations.

The paper examines the consistency of item embeddings in recommendation systems.

problem The relevance of averaging item embeddings for user or concept representation.
method Proposes an expected precision score to measure consistency and analyzes it theoretically and empirically.
result Real-world averages are less consistent for recommendation compared to theoretical assumptions.

Develops a real-time exercise recommendation system using deep learning.

problem Improving accuracy in exercise recommendation systems without user feedback.
method Deep recurrent neural network with attention mechanisms, real-time expert feedback.
result Improved accuracy in exercise recommendation system after real-time active learning.

New model for music streaming recommends songs based on past play history.

problem Nonstationary stochastic bandit model with delay-dependent rewards.
method Ranking policies approximating optimal policy with bounded regret.
result Algorithm with O~( ⁣kT)\widetilde{\mathcal{O}}\big(\!\sqrt{kT}\big) regret and O(klnlnT)\mathcal{O}\big(k\ln\ln T\big) switches.

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 …

2018-02-16abs ↗pdf ↗

New robustness certificates for streaming models with a sliding window.

problem Applying robustness certificates to streaming data with correlated inputs.
method Deriving robustness certificates for models using a sliding window over a sequence of potentially correlated inputs.
result Guarantees hold for the average model performance across the entire stream, independent of stream size.

Paper presents a reinforcement learning framework for personalized music playlist generation.

problem Misalignment between offline model objectives and online user satisfaction metrics in conventional playlist recommendation methods.
method Simulation-based reinforcement learning approach using a Deep Q-Network (DQN) modified to address large state and action spaces.
result The modified DQN (AH-DQN) policy leads to better user-satisfaction metrics compared to baseline methods during online A/B tests.

Paper addresses challenges in benchmarking stream learning algorithms with real-world data.

problem Lack of publicly available non-stationary real-world datasets for evaluating stream algorithms.
method Proposes a new public data repository for benchmarking stream algorithms with real-world data.
result Mitigates problems related to dataset choice in experimental evaluation of stream classifiers and drift detectors.

Improved item recommendations for repeat interactions using sequence analysis.

problem Limited effectiveness of traditional recommender systems in handling repeated user-item interactions.
method Designed a recommender system that considers sequences of item interactions for each user.
result Empirically shown to give highly accurate predictions and increase sales by 5%.

OTT services are replacing traditional telecom services, affecting revenue streams.

problem OTT services are reducing traditional telecom revenue streams.
method Quantitative analysis of mobile user trends and revenue changes.
result OTT services are becoming more prevalent and impacting telecom revenue.

Improved action detection for multi-person videos using attention filtering.

problem Difficulty in distinguishing relevant parts of multi-person videos for action detection.
method Fovea attention filtering and generalized binary loss function.
result 20% relative improvement in mAP over baseline in AVA dataset.

Proposes DTS framework to predict CTR by tracking user interest evolution over time.

problem Predicting CTR by ignoring dynamic user interest changes over time.
method Integrates time information using ODEs in a neural network to model interest evolution.
result Achieves superior CTR prediction performance compared to existing methods.

CHAMELEON tackles news recommendation using deep learning, addressing cold-start issues.

problem Personalizing user experiences in a dynamic news search space.
method Modular reference architecture with different neural building blocks, leveraging user and article context, and modeling temporal decay and concept drift.
result CHAMELEON outperforms traditional and state-of-the-art session-based recommendation algorithms in accuracy, item coverage, novelty, and reduced item cold-start problem.

Poisson factorization is a probabilistic model of users and items for recommendation systems, where the so-called implicit consumer data is modeled by a factorized Poisson distribution. There are many variants of Poisson factorization methods who show state-of-the-art performance on real-world recommendation tasks. How…

2017-03-04abs ↗pdf ↗

Selective reinitialization improves adaptability of neural bandits in dynamic environments.

problem Loss of plasticity in neural bandits, leading to rigid neural network parameters.
method Selective Reinitialization (SeRe) framework that dynamically resets underutilized units.
result SeRe enhances adaptability of CNB algorithms, reducing cumulative regret in dynamic environments.

Hop Sampling improves GNNs in non-stationary environments by preventing overfitting.

problem Non-stationary environments cause concept drift, making GNNs overfit to training graphs.
method Randomly selects the number of propagation steps in GNNs to prevent overfitting.
result Improves GNNs' prediction accuracy by 7.97% and 16.93% in LINE Coupon recommender systems.

A new method classifies multiple correlated data streams simultaneously.

problem Classifying multiple correlated data streams in practical scenarios.
method Double-Coupling Support Vector Machines (DC-SVM) considers both internal and external correlations.
result The proposed method outperforms traditional methods on artificial and real-world data streams.

With the increasing variety of services that e-commerce platforms provide, criteria for evaluating their success become also increasingly multi-targeting. This work introduces a multi-target optimization framework with Bayesian modeling of the target events, called Deep Bayesian Multi-Target Learning (DBMTL). In this f…

2019-02-25abs ↗pdf ↗

A new algorithm uses bandits to diversify database activity monitoring.

problem Limitation of current DAM systems in collecting diverse data.
method Redefined DAM sampling as a bandit problem and developed a novel algorithm combining expert knowledge and random exploration.
result Adding diversity to sampling using the bandit-based approach improves coverage without decreasing alert quality.

stream-learn is a Python library for analyzing data streams with various drift types.

problem Analyzing drifting and imbalanced data streams.
method Synthetic data stream generator, evaluation methodologies, and imbalanced binary classification metrics.
result Efficient implementation of classifiers for data stream analysis.

PySAD offers a unified Python framework for efficient streaming anomaly detection.

problem Efficient anomaly detection in streaming data with strict constraints.
method Unified architecture with 17+ streaming algorithms, specialized components, and support for multiple learning paradigms.
result PySAD enables real-time processing with bounded memory and is compatible with other Python frameworks.

New estimator uses clustering to improve off-policy evaluation accuracy.

problem Improving off-policy evaluation accuracy when logging and evaluation policies differ.
method Proposes an estimator that shares information across similar contexts using clustering.
result Clustering contexts improves estimation accuracy, especially in deficient information settings.

Context improves one-class classifiers in dynamic data streams.

problem Improving one-class classification in data streams with limited training data.
method Proposes using context to guide one-class classifier learning in data streams, presenting three frameworks.
result The use of context can improve the performance of streaming one-class classifiers.