Active learning tackles cold start and imbalanced data issues.
problem Cold start problem and imbalanced data in ML models.
method ODAL approach with 3-stage AL policies.
result ODAL can quickly reach high performance models with limited labels.
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
48 results for “cold-start scenarios”
SPARC tackles cold-start nodes in graphs by using spectral embeddings.
problem Cold-start nodes in graphs lacking initial connections.
method Introduces SPARC, a framework utilizing spectral embeddings to predict on cold-start nodes.
result SPARC outperforms existing models on cold-start nodes across tasks.
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…
Cold-start is a very common and still open problem in the Recommender Systems literature. Since cold start items do not have any interaction, collaborative algorithms are not applicable. One of the main strategies is to use pure or hybrid content-based approaches, which usually yield to lower recommendation quality tha…
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.
We propose a new STAcked and Reconstructed Graph Convolutional Networks (STAR-GCN) architecture to learn node representations for boosting the performance in recommender systems, especially in the cold start scenario. STAR-GCN employs a stack of GCN encoder-decoders combined with intermediate supervision to improve the…
NAM learns multiview representations with attention for better task performance.
problem Finding optimal combination of multiviews for specific tasks.
method Introduces Neural Attentive Multiview machine with attention mechanism.
result NAM outperforms single view and alternative multiview methods in item recommendations.
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.
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…
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…
Content Based Player and Game Interaction Model for Game Recommendation in the Cold Start settingcs.IR
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…
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.
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.
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…
Enhances time-series modeling by dropping patches, improving efficiency and adaptability.
problem Improving masked time-series modeling efficiency and adaptability.
method DropPatch method, which randomly drops sub-sequence level patches.
result DropPatch improves pre-training efficiency and adaptability in various learning scenarios.
FAB-COST improves cold-start recommendation accuracy with less data.
problem Cold-start problem in recommendation systems.
method Contextual bandit algorithm using Expectation Propagation and Assumed Density Filtering.
result FAB-COST outperforms Laplace approximation on real data.
In recommender systems, cold-start issues are situations where no previous events, e.g. ratings, are known for certain users or items. In this paper, we focus on the item cold-start problem. Both content information (e.g. item attributes) and initial user ratings are valuable for seizing users' preferences on a new ite…
Cold-start PV forecasting uses synthetic histories to train time-series foundation models.
problem Cold-start PV forecasting
method Zero-shot pipeline with synthetic histories
result TabPFN-TS achieves the lowest error under Real Feedback strategy
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.
Restricted Boltzman Machines (RBMs) have been successfully used in recommender systems. However, as with most of other collaborative filtering techniques, it cannot solve cold start problems for there is no rating for a new item. In this paper, we first apply conditional RBM (CRBM) which could take extra information in…
Content-based news recommendation systems need to recommend news articles based on the topics and content of articles without using user specific information. Many news articles describe the occurrence of specific events and named entities including people, places or objects. In this paper, we propose a graph traversal…
TransCORALNet: A Two-Stream Transformer CORAL Networks for Supply Chain Credit Assessment Cold Startcs.LG
TransCORALNet uses transformer and CORAL for supply chain credit assessment with cold start.
problem Supply chain credit assessment for new borrowers with limited data.
method Two-stream transformer CORAL networks with domain adaptation and LIME.
result TransCORALNet outperforms state-of-the-art models in accuracy.
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.
Among the machine learning applications to business, recommender systems would take one of the top places when it comes to success and adoption. They help the user in accelerating the process of search while helping businesses maximize sales. Post phenomenal success in computer vision and speech recognition, deep learn…
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 …
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.
Paper tackles cold-start domain adaptation with language descriptions.
problem Cold-start domain adaptation failure with scarce target data.
method Leverages textual descriptions to learn preferences from LLM, integrates into EM algorithm.
result Framework guides source selection for weak target signals, improves as data accumulates.
Proposes efficient user cold start recommendation via meta parameter partition.
problem User cold start in recommendation systems.
method Divides model parameters into fixed and adaptive parts, learning them separately offline and online.
result Significant improvement in AUC (2.48% absolute improvement).
We propose a new hybrid algorithm that allows incorporating both user and item side information within the standard collaborative filtering technique. One of its key features is that it naturally extends a simple PureSVD approach and inherits its unique advantages, such as highly efficient Lanczos-based optimization pr…
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.
Improves deep learning for Airbnb search ranking.
problem Challenges in ranking inventory and handling new listings.
method New ranking neural network architecture, positional bias handling, and cold start solutions.
result Significant improvements in inventory ranking and new listing treatment.
Warm Up Cold-start Advertisements: Improving CTR Predictions via Learning to Learn ID Embeddingscs.LG
Click-through rate (CTR) prediction has been one of the most central problems in computational advertising. Lately, embedding techniques that produce low-dimensional representations of ad IDs drastically improve CTR prediction accuracies. However, such learning techniques are data demanding and work poorly on new ads w…
A Unified Framework for Long Range and Cold Start Forecasting of Seasonal Profiles in Time Seriesstat.ML
Providing long-range forecasts is a fundamental challenge in time series modeling, which is only compounded by the challenge of having to form such forecasts when a time series has never previously been observed. The latter challenge is the time series version of the cold-start problem seen in recommender systems which…
Making recommendations in the presence of sparsity is known to present one of the most challenging problems faced by collaborative filtering methods. In this work we tackle this problem by exploiting the innately hierarchical structure of the item space following an approach inspired by the theory of Decomposability. W…
New algorithm reduces cold-start costs in multi-armed bandits for many products.
problem High burn-in costs in multi-armed bandits for new products.
method Two-phase bandit algorithm using subsampling and low-rank matrix estimation.
result Reduces burn-in costs and expedites experiment in large product sets.
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.
Study improves engagement prediction in educational videos.
problem Addressing cold-start problem in educational recommenders.
method Introduced VLE dataset with content and engagement features, conducted experiments.
result VLE dataset leads to better engagement prediction models.
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.
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…
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 …
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.
Traditional recommendation systems rely on past usage data in order to generate new recommendations. Those approaches fail to generate sensible recommendations for new users and items into the system due to missing information about their past interactions. In this paper, we propose a solution for successfully addressi…
Model improves fraud detection for new scenes with limited data.
problem Improving fraud detection models with scarce training data.
method Adapted tree boosting for transfer learning.
result Enhanced model performance on new data.
Collaborative filtering often suffers from sparsity and cold start problems in real recommendation scenarios, therefore, researchers and engineers usually use side information to address the issues and improve the performance of recommender systems. In this paper, we consider knowledge graphs as the source of side info…
To address the sparsity and cold start problem of collaborative filtering, researchers usually make use of side information, such as social networks or item attributes, to improve recommendation performance. This paper considers the knowledge graph as the source of side information. To address the limitations of existi…
Zero-Shot Heterogeneous Transfer Learning from Recommender Systems to Cold-Start Search Retrievalcs.LG
Improves search performance by transferring knowledge from recommender system.
problem Cold start and feedback loop problems in search retrieval.
method Zero-Shot Heterogeneous Transfer Learning framework.
result Significant improvements in relevance and user interactions over production system.
The study proposes an audit to assess user control over recommendations in collaborative filtering systems.
problem The gap between maximizing accuracy and ensuring user control over information availability in recommender systems.
method The approach involves a computationally efficient audit for top- linear recommender models, focusing on reachability and user agency.
result The study demonstrates that model complexity affects the effort required for users to exert control over their recommendations.