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.
PoDiRe learns long-term rewards in multi-task recommendations.
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…
Skip-gram with negative sampling, a popular variant of Word2vec originally designed and tuned to create word embeddings for Natural Language Processing, has been used to create item embeddings with successful applications in recommendation. While these fields do not share the same type of data, neither evaluate on the …
The two main tasks in the Recommender Systems domain are the ranking and rating prediction tasks. The rating prediction task aims at predicting to what extent a user would like any given item, which would enable to recommend the items with the highest predicted scores. The ranking task on the other hand directly aims a…
One of the first things to do while planning a trip is to book a good place to stay. Booking a hotel online can be an overwhelming task with thousands of hotels to choose from, for every destination. Motivated by the importance of these situations, we decided to work on the task of recommending hotels to users. We used…
We present multi-modal adversarial autoencoders for recommendation and evaluate them on two different tasks: citation recommendation and subject label recommendation. We analyze the effects of adversarial regularization, sparsity, and different input modalities. By conducting 408 experiments, we show that adversarial r…
CnGAN generates synthetic user preferences for non-overlapped users in cross-network recommender systems.
We explore the task of local music recommendation: provide listeners with personalized playlists of relevant tracks by artists who play most of their live events within a small geographic area. Most local artists tend to be obscure, long-tail artists and generally have little or no available user preference data associ…
RecoBERT uses a language model to recommend items from catalogs.
AutoRec automates deep recommendation models using AutoML.
In many online applications interactions between a user and a web-service are organized in a sequential way, e.g., user browsing an e-commerce website. In this setting, recommendation system acts throughout user navigation by showing items. Previous works have addressed this recommendation setup through the task of pre…
In a variety of application domains the content to be recommended to users is associated with text. This includes research papers, movies with associated plot summaries, news articles, blog posts, etc. Recommendation approaches based on latent factor models can be extended naturally to leverage text by employing an exp…
Conventional collaborative filtering techniques treat a top-n recommendations problem as a task of generating a list of the most relevant items. This formulation, however, disregards an opposite - avoiding recommendations with completely irrelevant items. Due to that bias, standard algorithms, as well as commonly used …
HyperSTAR optimizes deep network hyperparameters for specific tasks.
NAM learns multiview representations with attention for better task performance.
Recommender systems objectives can be broadly characterized as modeling user preferences over short-or long-term time horizon. A large body of previous research studied long-term recommendation through dimensionality reduction techniques applied to the historical user-item interactions. A recently introduced session-ba…
MiM-StocR combines momentum indicators and adaptive ranking loss for better stock recommendation.
Model improves CVR estimation in recommender systems by mitigating bias and overlooking causal relationships.
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…
Neural Logic Reasoning integrates deep learning and symbolic logic for better prediction tasks.
Proposes a deep learning model for timely and accurate recommendations.
The paper aims to define a benchmark for deep learning recommendation models.
Memory-Augmented Meta-Optimization improves cold-start recommendation.
Paper optimizes recommendation systems for long-term business metrics.
This study tackles mutual fund portfolio prediction, focusing on novel items.
In this paper, we investigate the common scenario where every candidate item for recommendation is characterized by a maximum capacity, i.e., number of seats in a Point-of-Interest (POI) or size of an item's inventory. Despite the prevalence of the task of recommending items under capacity constraints in a variety of s…
News recommender systems are aimed to personalize users experiences and help them to discover relevant articles from a large and dynamic search space. Therefore, news domain is a challenging scenario for recommendations, due to its sparse user profiling, fast growing number of items, accelerated item's value decay, and…
Hyperbolic geometry autoencoder outperforms Euclidean in top-N recommendation tasks.
BLOB combines organic and bandit signals for better user interest estimation.
We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical obs…
New method interprets deep neural networks for better recommendation system understanding.
HyperFair integrates fairness in recommender systems using probabilistic soft logic.
Improves search performance by transferring knowledge from recommender system.
Determinantal point processes (DPPs) have received significant attention in the recent years as an elegant model for a variety of machine learning tasks, due to their ability to elegantly model set diversity and item quality or popularity. Recent work has shown that DPPs can be effective models for product recommendati…
XploVAE improves recommendation by balancing known and novel items.
Proposes a new framework for resource-limited recommendation.
Automates investor/company matching with AI, explaining decisions.
Cross-domain recommendation has been proposed to transfer user behavior pattern by pooling together the rating data from multiple domains to alleviate the sparsity problem appearing in single rating domains. However, previous models only assume that multiple domains share a latent common rating pattern based on the use…
Recent studies identified that sequential Recommendation is improved by the attention mechanism. By following this development, we propose Relation-Aware Kernelized Self-Attention (RKSA) adopting a self-attention mechanism of the Transformer with augmentation of a probabilistic model. The original self-attention of Tra…
In this paper, we study a multi-step interactive recommendation problem, where the item recommended at current step may affect the quality of future recommendations. To address the problem, we develop a novel and effective approach, named CFRL, which seamlessly integrates the ideas of both collaborative filtering (CF) …
A new model learns preferences incrementally without personal data.
This paper reviews methods for constructing confidence intervals for error rates in 1:1 matching tasks.
Paper presents content-based models for game recommendation in cold start scenarios.
CHAMELEON tackles news recommendation using deep learning, addressing cold-start issues.
Most automation in machine learning focuses on model selection and hyper parameter tuning, and many overlook the challenge of automatically defining predictive tasks. We still heavily rely on human experts to define prediction tasks, and generate labels by aggregating raw data. In this paper, we tackle the challenge of…
A new personality-based recommender system tackles data sparsity without feedback.
DiPS learns to optimize sketching policies for better recommendation quality.
New algorithm optimizes long-term user satisfaction in recommendation systems.