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

Trend · papers per month

230461691921 · Jun 202019922001200920172026
48 results for cold start problem

The item cold-start problem seriously limits the recommendation performance of Collaborative Filtering (CF) methods when new items have either none or very little interactions. To solve this issue, many modern Internet applications propose to predict a new item's interaction from the possessing contents. However, it is…

2019-09-10abs ↗pdf ↗

Graph neural networks improve cold start for new items in recommender systems.

problem Cold start problem for new items in recommender systems.
method Item hierarchy graphs and bespoke graph neural network architecture.
result Our method achieves better forecasting quality than state-of-the-art with comparable computational time.

Playlist recommendation involves producing a set of songs that a user might enjoy. We investigate this problem in three cold-start scenarios: (i) cold playlists, where we recommend songs to form new personalised playlists for an existing user; (ii) cold users, where we recommend songs to form new playlists for a new us…

2019-01-18abs ↗pdf ↗

This work explores the ability of collective matrix factorization models in recommender systems to make predictions about users and items for which there is side information available but no feedback or interactions data, and proposes a new formulation with a faster cold-start prediction formula that can be used in rea…

2018-09-02abs ↗pdf ↗

NetDP predicts loan defaults using network data, addressing cold-start issues.

problem Cold-start problem in default prediction for new users.
method Combines unsupervised and supervised network representations, using parameter-server for scalability.
result Effectiveness in cold-start problem, especially for new users.

Collaborative filtering is used to recommend items to a user without requiring a knowledge of the item itself and tends to outperform other techniques. However, collaborative filtering suffers from the cold-start problem, which occurs when an item has not yet been rated or a user has not rated any items. Incorporating …

2014-06-09abs ↗pdf ↗

Memory-Augmented Meta-Optimization improves cold-start recommendation.

problem Cold-start problem in recommender systems for new users or items.
method Memory-Augmented Meta-Optimization approach with personalized and task-specific memories.
result Significant improvement in cold-start recommendation performance on multiple datasets.

CDLF predicts product life-cycles in cold-start phases with high accuracy.

problem Forecasting new products in early phases when data is scarce.
method Conditional Diffusion Life-cycle Forecaster (CDLF) combining static descriptors, reference trajectories, and new observations.
result CDLF outperforms classical models in accuracy and probabilistic forecasting.

A new algorithm for better decision-making in recommendation systems.

problem Stochastic multi-armed bandit problem and cold start problem in recommender systems.
method Proposes Hellinger-UCB, a variant of UCB algorithm using squared Hellinger distance.
result Hellinger-UCB reaches the theoretical lower bound and outperforms other algorithms in practical applications.

We address the cold start problem in recommendation systems assuming no contextual information is available neither about users, nor items. We consider the case in which we only have access to a set of ratings of items by users. Most of the existing works consider a batch setting, and use cross-validation to tune param…

2014-07-10abs ↗pdf ↗

High-dimensional unimodal distributions can cause MCMC methods to fail.

problem Failure of MCMC methods in high-dimensional unimodal distributions.
method Examples and theoretical analysis of MCMC methods, including Metropolis-Hastings adjusted methods.
result MCMC methods can take an exponential run-time for high-dimensional unimodal distributions.

Multimodal learning has shown promising performance in content-based recommendation due to the auxiliary user and item information of multiple modalities such as text and images. However, the problem of incomplete and missing modality is rarely explored and most existing methods fail in learning a recommendation model …

2018-08-21abs ↗pdf ↗

Paper presents content-based models for game recommendation in cold start scenarios.

problem Cold start problem in game recommendation where new games and players have no historical data.
method Uses survey data to develop content-based interaction models that generalize to new games, players, and both.
result Content models outperform collaborative filtering in predicting new interactions.

Item cold-start is a classical issue in recommender systems that affects anime and manga recommendations as well. This problem can be framed as follows: how to predict whether a user will like a manga that received few ratings from the community? Content-based techniques can alleviate this issue but require extra infor…

2017-09-03abs ↗pdf ↗

Unified approach for conversational recommendation by integrating attributes and items.

problem Cold-start users' real-time personalization in online recommendation.
method Seamlessly unifies attributes and items in Thompson Sampling framework for interactive decision-making.
result Conversational Thompson Sampling (ConTS) outperforms existing methods in success rate and conversation turns.

The application of deep learning to search ranking was one of the most impactful product improvements at Airbnb. But what comes next after you launch a deep learning model? In this paper we describe the journey beyond, discussing what we refer to as the ABCs of improving search: A for architecture, B for bias and C for…

2020-02-10abs ↗pdf ↗

Cold-start problems are long-standing challenges for practical recommendations. Most existing recommendation algorithms rely on extensive observed data and are brittle to recommendation scenarios with few interactions. This paper addresses such problems using few-shot learning and meta learning. Our approach is based o…

2019-06-02abs ↗pdf ↗

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.

With the growing importance of personalized recommendation, numerous recommendation models have been proposed recently. Among them, Matrix Factorization (MF) based models are the most widely used in the recommendation field due to their high performance. However, MF based models suffer from cold start problems where us…

2019-05-27abs ↗pdf ↗

Proposes a flexible neural recommendation framework for better prediction performance.

problem Data sparsity, cold start problem, and long-tail distribution in recommendations.
method A modular neural recommendation framework that includes a neural collaborative filtering part and a text processing part as a regularizer.
result Achieves better prediction performance than state-of-the-art text-aware methods using a simple text processing approach.

Proposes a new model for explainable recommendation systems.

problem Developing predictive models that provide explanations for item recommendations.
method Generalized Additive Models with Manifest and Latent Interactions (GAMMLI).
result Advantages in both predictive performance and explainability.

Federated multi-view matrix factorization learns from multiple data sources without centralizing user data.

problem Cold-start federated recommendations and multi-view data structure.
method Federated learning framework extended to multi-view matrix factorization.
result Federated multi-view matrix factorization outperforms simpler methods in cold-start federated recommendations.

We consider the online one-class collaborative filtering (CF) problem that consists of recommending items to users over time in an online fashion based on positive ratings only. This problem arises when users respond only occasionally to a recommendation with a positive rating, and never with a negative one. We study t…

2017-05-31abs ↗pdf ↗

Paper proposes a method to aggregate customer engagement data for better ranking of e-commerce results.

problem Cold start problem and under-representation of new or under-impressed products in e-commerce search results.
method Aggregates customer engagements within a day for the same query as input training data for machine learning models.
result Training models on aggregated data leads to better ranking of new and under-impressed products.

JoVA combines two VAEs to learn user and item representations for better recommendation.

problem Collaborative filtering with implicit feedback.
method Joint Variational Autoencoders (JoVA) with a hinge-based pairwise loss function (JoVA-Hinge).
result JoVA-Hinge outperforms state-of-the-art methods in top-k recommendation.