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.
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.
The paper proposes a method to predict audio ad quality using acoustic features.
problem Improving user experience in online music streaming services by ensuring high quality audio advertisements.
method The paper proposes predicting audio ad quality using acoustic features and a proxy metric called Long Click Rate (LCR). A deep learning model is also introduced.
result The proposed deep learning model outperforms other models trained on hand-crafted features for audio ad quality prediction.
The study assesses music as an investment asset class using discounted cashflow models.
problem Quantifying the risk and return characteristics of music royalty assets.
method Fitting three discounted cashflow models to Royalty Exchange platform transactions and backtesting performance.
result Life of Rights music assets had risk and return characteristics comparable to stocks in the S\&P500 over 5 years.
System composes polyphonic music using LSTM and RL.
problem Complex polyphonic music composition.
method Divided music into monophonic streams, trained LSTM to generate sequences, used RL to find pleasant compositions.
result System generates intricate melodies, chords, and contrapuntal sequences.
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 ~ ( k T ) \widetilde{\mathcal{O}}\big(\!\sqrt{kT}\big) O ( k T ) regret and O ( k ln ln T ) \mathcal{O}\big(k\ln\ln T\big) O ( k ln ln T ) switches. New framework estimates long-term outcomes from short-term data.
problem Estimating long-term outcomes from short-term data.
method Reward function decomposition-based framework (LOPE).
result LOPE outperforms existing methods, especially when surrogacy is violated.
Neural nets classify Thai Lukthung songs from other genres.
problem Classifying Thai Lukthung songs for personalized music recommendations.
method Developed neural networks using lyrics and audio features.
result Combined model yields F 1 F_1 F 1 score of 0.86 for Lukthung classification. 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.
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…
This article surveys online machine learning in big data streams.
problem Limited storage for past data in data streams.
method Distributed software architectures and libraries for efficient algorithms.
result Overview of classification, regression, recommendation, and unsupervised models for streaming data.
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.
Develops online cluster validation indices for streaming data.
problem Validating clusters in streaming data.
method Two online versions of Xie-Beni and Davies-Bouldin indices, analyzed using sk-means and online ellipsoidal clustering.
result Incremental Xie-Beni index with forgetting factor superior to other indices.
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.
Paper analyzes stochastic gradient for PCA in streaming data.
problem Complexity analysis of stochastic gradient for PCA in online settings.
method Studied stochastic gradient algorithm with online learning rate selection.
result Practical relevance of plain stochastic gradient confirmed; learning rate improvement possible.
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.
Generative model learns to create coherent slates from prompts.
problem Generating coherent slates from natural language prompts.
method DMSG, a generative framework based on diffusion models.
result DMSG outperforms baselines in relevance and diversity.
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.
New algorithm clusters streaming data efficiently.
problem Challenges in clustering streaming data.
method Online clustering algorithm for unknown number of clusters.
result Produces partitions close to full data clustering.
Proposes a new online learning strategy for multi-target regression in data streams.
problem Challenges in learning from high-throughput data streams, especially in multi-target regression.
method Extends existing online decision tree learning algorithm to consider inter-target dependencies.
result SST-HT presents superior predictive accuracy compared to state-of-the-art algorithms.
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 ℓ 2 \ell_2 ℓ 2 -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.
A model classifies music genres from MP3 files using metric learning and feature extraction.
problem Classifying music genres from MP3 files efficiently and accurately.
method Metric learning and feature extraction using MFCC and PCA.
result Promising results in classification accuracy compared to baseline algorithms.
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.
Study finds conformity bias drives music sampling traditions.
problem How frequency-based bias drives cultural diversity in music sampling.
method Agent-based simulations in approximate Bayesian computation framework.
result Sampling patterns at population-level consistent with conformity bias.
GOOWE-ML ensemble improves multi-label stream classification.
problem Online multi-label data stream classification.
method Novel online stacked ensemble with spatial weighting.
result GOOWE-ML ensembles outperform other models in predictive performance.
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.
Improved online neural transducer model matches non-streaming model performance.
problem Significant performance degradation of online neural transducer models.
method Increased attention window, LAS initialization, stronger language models.
result Improved online neural transducer model matches non-streaming model performance.
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.
Paper proposes an efficient PCA method for memory-limited streaming data.
problem Memory-limited online PCA methods struggle with convergence and eigenvector extraction.
method A single-pass algorithm converging to the first k eigenvectors without predefined parameters.
result Empirical results show the scheme converges to first k eigenvectors in a single pass.
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 ( ln T ) \mathcal{O}(\ln{T}) O ( ln T ) for online unlearning. Links clusters streaming data vectors in high dimensions.
problem Efficient clustering of streaming high-dimensional data.
method Online clustering algorithm for unit vectors.
result Successfully applied to face and voice recognition.
Proposes CLSM for better subsequence generation in music sequences.
problem Editing subsequences in music sequences without losing context.
method Context-informed prior and decoder for generative model, context position-informed encoder for inference.
result Contextual latent space is smoother in interpolation and generates higher quality samples.
Paper tackles online budgeted learning for feature acquisition in machine learning.
problem Finding optimal feature values to acquire from each instance in a data stream under budget constraints.
method Introduces a general framework for online budgeted learning, proposing two feature value acquisition policies: random and adaptive.
result Adaptive policies outperform random policies for most budget limitations and datasets, achieving near-optimal results in some cases.
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.
SpectralLeader learns latent variables from streaming data efficiently and globally.
problem Learning latent variable models from a stream of data efficiently and globally.
method SpectralLeader, an online learning algorithm for latent variable models that converges to the global optimum.
result SpectralLeader achieves a sublinear upper bound on n n n -step regret in the bag-of-words model. Method decomposes streaming data into sparse and low-rank components from compressive measurements.
problem Online decomposing compressive streaming data efficiently.
method Solves n n n - ℓ 1 \ell_1 ℓ 1 cluster-weighted minimization to decompose sparse and low-rank components. result Outperforms existing methods for numerical and video data.
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.
MusicVAE uses a hierarchical decoder to model long-term structure in music sequences.
problem Difficulty of existing recurrent VAE models in modeling long-term structure in sequential data.
method Proposes a hierarchical decoder that outputs embeddings for subsequences and uses these embeddings to generate each subsequence independently.
result Demonstrates better sampling, interpolation, and reconstruction performance than a flat baseline model.
Sketches linear classifiers using Weight-Median Sketch for efficient data stream analysis.
problem Efficiently learning and analyzing data streams with limited memory.
method Introduces Weight-Median Sketch for compressed linear classifier learning over data streams.
result Memory-limited execution of various analyses over streams, including feature selection and mutual information estimation.