Proposes a comprehensive framework for financial product lead recommendations using graph representation learning and link prediction.
problem Challenges in surface lead recommendations for financial products due to changing market scenarios and difficulty in capturing holder's mindset.
method Bi-partite graph representation of financial holders and funds, GraphSage model for learning representations, link prediction model for ranking recommendations.
result The proposed graph ML solution outperforms baseline by 42%, 22%, and 14% in hit rate for top-k recommendations (50, 100, 200) and 18%, 19%, and 18% on unseen holders.
Count data are often used in recommender systems: they are widespread (song play counts, product purchases, clicks on web pages) and can reveal user preference without any explicit rating from the user. Such data are known to be sparse, over-dispersed and bursty, which makes their direct use in recommender systems chal…
DeepFair improves fairness in recommender systems without sacrificing accuracy.
problem Lack of bias management in recommender systems leads to unfair recommendations for minority groups.
method Deep Learning based Collaborative Filtering algorithm that balances fairness and accuracy.
result It is possible to make fair recommendations without losing significant accuracy.
Improves algorithmic recourse to guide towards both acceptance and improvement.
problem Algorithmic recourse recommendations may not lead to improvement.
method Improvement-Focused Causal Recourse (ICR) requires recommendations to guide towards improvement and leverages causal knowledge to design accurate decision systems.
result ICR guides towards both acceptance and improvement given correct causal knowledge.
What we discover and see online, and consequently our opinions and decisions, are becoming increasingly affected by automated machine learned predictions. Similarly, the predictive accuracy of learning machines heavily depends on the feedback data that we provide them. This mutual influence can lead to closed-loop inte…
Recommendations are broadly used in marketplaces to match users with items relevant to their interests and needs. To understand user intent and tailor recommendations to their needs, we use deep learning to explore various heterogeneous data available in marketplaces. This paper focuses on the challenge of measuring re…
Two-stage recommender systems struggle with exploration, leading to linear regret.
problem Linear regret in two-stage recommender systems due to exploration issues.
method Proposed a method to synchronize exploration strategies between the ranker and nominators using LinUCB.
result Demonstrated the effectiveness of the proposed algorithm experimentally.
Paper optimizes recommendation systems for long-term business metrics.
problem Short-term reward optimization ignores long-term business metrics.
method Introduced a framework for modeling long-term rewards in RecoGym.
result Proposed a simple extension leading to state-of-the-art results.
The paper shows how ignoring temporal context in recommender systems evaluation leads to false confidence, proposing a method to embed temporal context.
problem The discrepancy between offline and online recommender system performance evaluation.
method Proposes a training procedure to embed temporal context into recommender systems and validates its advantage using multi-objective optimization.
result Including temporal context in recommender systems evaluation can improve recall@20 by up to 20%.
Like other social systems, in collaborative filtering a small number of "influential" users may have a large impact on the recommendations of other users, thus affecting the overall behavior of the system. Identifying influential users and studying their impact on other users is an important problem because it provides…
Confounding biases recommender systems, even when data seems fully observed.
problem Unmeasured features influencing both treatment and outcome in recommender systems.
method Illustrations and simulation studies showing how common practices introduce confounding.
result Standard recommender system practices can introduce confounding, reducing performance.
Recommender systems often face heterogeneous datasets containing highly personalized historical data of users, where no single model could give the best recommendation for every user. We observe this ubiquitous phenomenon on both public and private datasets and address the model selection problem in pursuit of optimizi…
StableDR stabilizes doubly robust learning for biased recommendation data.
problem Data missing not at random in recommender systems.
method StableDR, a stabilized doubly robust learning approach.
result StableDR achieves bounded bias, variance, and generalization error.
Theoretical model for iterative user discovery in recommender systems.
problem Iterative feedback loops in recommender systems and their biases.
method Theoretical framework to model system evolution and convergence properties.
result Theoretical bounds and convergence properties on user discovery and blind spots.
In this paper we consider an online recommendation setting, where a platform recommends a sequence of items to its users at every time period. The users respond by selecting one of the items recommended or abandon the platform due to fatigue from seeing less useful items. Assuming a parametric stochastic model of user …
FLARKO uses LLMs, KGs, and KTO to generate profitable, behaviorally aligned financial recommendations.
problem Financial recommendation systems often fail to account for behavioral and regulatory factors.
method FLARKO integrates LLMs, KGs, and KTO to generate profitable and behaviorally aligned recommendations.
result FLARKO consistently outperforms state-of-the-art recommendation baselines on behavioral alignment and joint profitability.
Adaptive time decay functions improve financial product recommendation accuracy.
problem Inaccurate recommendations due to static historical data in finance.
method Time-dependent collaborative filtering with personalized decay functions.
result Significant improvements over state-of-the-art benchmarks in financial product recommendation.
AMEIR automates recommender system design using NAS.
problem Manual feature and architecture engineering in recommender systems.
method Three-stage search space and tailored three-step pipeline.
result AMEIR outperforms manual and complex NAS methods.
The increasing role of recommender systems in many aspects of society makes it essential to consider how such systems may impact social good. Various modifications to recommendation algorithms have been proposed to improve their performance for specific socially relevant measures. However, previous proposals are often …
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.
The paper proposes a new recommender system combining ratings and textual reviews.
problem Lack of using textual reviews in recommender systems.
method Combines Latent Factor Model with Latent Dirichlet Allocation for textual reviews.
result Combining textual reviews with ratings improves recommendation quality.
Recommendation algorithms are widely adopted in marketplaces to help users find the items they are looking for. The sparsity of the items by user matrix and the cold-start issue in marketplaces pose challenges for the off-the-shelf matrix factorization based recommender systems. To understand user intent and tailor rec…
We partner with a leading European healthcare provider and design a mechanism to match patients with family doctors in primary care. We define the matchmaking process for several distinct use cases given different levels of available information about patients. Then, we adopt a hybrid recommender system to present each…
KHGRec tackles noisy and incomplete KG-enhanced recommendations by modeling complex interactions.
problem Challenges in integrating KGs for accurate recommendations, especially in complex higher-order interactions and heterogeneous modalities.
method KHGRec uses a collaborative knowledge heterogeneous hypergraph (CKHG) to model group-wise interdependencies, employing two hypergraph encoders and attention mechanisms.
result KHGRec achieves an average 5.18% relative improvement over state-of-the-art baselines on four real-world datasets.
Estimates citation impact to recommend best publication venue.
problem Choosing optimal publication venue for academic papers.
method Treatment effect estimation and bias correction method.
result Effective recommendation of publication venues based on citation potential.
We study offline recommender learning from explicit rating feedback in the presence of selection bias. A current promising solution for the bias is the inverse propensity score (IPS) estimation. However, the performance of existing propensity-based methods can suffer significantly from the propensity estimation bias. I…
Recent progress in deep learning is revolutionizing the healthcare domain including providing solutions to medication recommendations, especially recommending medication combination for patients with complex health conditions. Existing approaches either do not customize based on patient health history, or ignore existi…
Debias recommender systems by accounting for hidden confounders using network information.
problem Debiased recommender systems to reduce bias caused by hidden confounders.
method Leverage network information to disentangle user conformity and item popularity, modeling exposure and ratings while controlling hidden confounders.
result The proposed method effectively debiases recommender systems, improving recommendation accuracy.
A new algorithm for conversational recommendation systems using dueling bandits in GLMs.
problem Limited user feedback in existing conversational bandit methods.
method Integrates dueling bandits with relative feedback in generalized linear models.
result Theoretical and empirical validation of ConDuel's efficacy.
Recommendation models mainly deal with categorical variables, such as user/item ID and attributes. Besides the high-cardinality issue, the interactions among such categorical variables are usually long-tailed, with the head made up of highly frequent values and a long tail of rare ones. This phenomenon results in the d…
The study aims to prevent unfair content presentation in recommender systems.
problem Over- and under-presentation of content leads to biased user preference estimates.
method Two models are considered: one that ignores systematic and limited exposure, and another that conditions on limited exposure.
result Ignoring systematic presentations overestimates promoted options and underestimates censored alternatives.
Item recommendation is a personalized ranking task. To this end, many recommender systems optimize models with pairwise ranking objectives, such as the Bayesian Personalized Ranking (BPR). Using matrix Factorization (MF) --- the most widely used model in recommendation --- as a demonstration, we show that optimizing it…
There are great interests as well as many challenges in applying reinforcement learning (RL) to recommendation systems. In this setting, an online user is the environment; neither the reward function nor the environment dynamics are clearly defined, making the application of RL challenging. In this paper, we propose a …
Two-stage recommender systems show better performance when components interact rather than operate independently.
problem Two-stage recommender systems are often treated as sums of their parts, ignoring interactions between components.
method Used synthetic and real-world data to demonstrate interactions between ranker and nominators. Derived a generalization lower bound and proposed a Mixture-of-Experts approach to learn optimal item pools.
result Independent nominator training can lead to performance on par with random recommendations, highlighting the importance of interactions.
Designs algorithms to assist humans without affecting their decisions.
problem Algorithms often fail to improve human decisions.
method Formalizes algorithm design using potential outcomes framework and monotonicity assumption.
result Derives minimax optimal recommendation algorithms for limited data.
A new Adamize method improves multi-objective recommender systems.
problem Improving recommendation systems with multiple conflicting objectives.
method Developed a multi-objective model-agnostic Adamize method that corrects and stabilizes gradients.
result Significant improvements in recommendation systems, measured by hypervolume, coverage, and spacing.
Proposes MR estimator for unbiased recommendation models.
problem Data biases in recommender systems lead to inaccurate predictions.
method Introduces multiple robust (MR) learning approach combining multiple imputation and propensity models.
result MR estimator achieves unbiasedness when any of the models is accurate.
WSB community outperforms investment banks in stock picks.
problem Can WSB's community provide better investment advice than banks?
method Data-driven comparison of WSB and bank recommendations on S&P 500 stocks.
result WSB recommendations outperform banks in some cases and detect top stocks better.
MEANTIME improves sequential recommendation by using multi-temporal embeddings and attention mechanisms.
problem Limited use of timestamp information and information bottleneck in sequential recommendation models.
method MEANTIME employs multiple types of temporal embeddings and attention mechanisms to capture diverse patterns from user behavior sequences.
result MEANTIME outperforms state-of-the-art sequential recommendation methods.
With the overwhelming online products available in recent years, there is an increasing need to filter and deliver relevant personalized advice for users. Recommender systems solve this problem by modeling and predicting individual preferences for a great variety of items such as movies, books or research articles. In …
This paper improves attacks on recommender systems by solving optimization problems more precisely.
problem Adversarial injection attacks on recommender systems.
method Solving optimization problems for generating fake user interactions more accurately.
result The exact solution for generating fake users leads to a much larger impact on recommender systems.
In modern recommender systems, both users and items are associated with rich side information, which can help understand users and items. Such information is typically heterogeneous and can be roughly categorized into flat and hierarchical side information. While side information has been proved to be valuable, the maj…
Matrix approximation is a common tool in machine learning for building accurate prediction models for recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model w…
SVAT reduces investment risks by making stock models sensitive to adversarial perturbations.
problem Risk control in stock recommendation models is insufficient, leading to high investment losses.
method SVAT combines adversarial learning and variational perturbation generation to enhance risk awareness.
result SVAT reduces investment risks by more than 30% compared to state-of-the-art baselines.
New study shows personalized content recommendations can lead to polarization of user preferences.
problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.
CFRecs uses counterfactual reasoning to improve graph-based recommendations in real estate.
problem Improving model interpretability and actionable insights in graph-based recommender systems.
method A two-stage architecture combining GNN and Graph-VAE to propose minimal yet impactful changes in graph structure and node attributes.
result Demonstrates effectiveness in delivering actionable recommendations for home buyers and sellers.
New probabilistic approaches offer recourse recommendations even when causal models are imperfect.
problem Limited causal knowledge makes guaranteeing algorithmic recourse impossible.
method Two probabilistic approaches: Bayesian model averaging and average effect computation.
result Probabilistic approaches lead to more reliable recourse recommendations.
This paper introduces structure learning for autoencoder recommenders to improve performance and generalization.
problem Efficient training and generalization in sparse collaborative filtering data.
method Learn groups of related items and use this information to determine the connectivity structure of an auto-encoding neural network.
result The proposed structure learning method results in a sparse network that converges to a local optimum with smaller spectral norm and generalization error.