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

Trend · papers per month

1.7%3.5%5.2%7.0% · Aug 202019922001200920172026
48 results for fit recommendation

There are three quite distinct ways to train a machine learning model on recommender system logs. The first method is to model the reward prediction for each possible recommendation to the user, at the scoring time the best recommendation is found by computing an argmax over the personalized recommendations. This metho…

2019-04-24abs ↗pdf ↗

A new method for decision tree selection in recommendation systems.

problem Feature-based selection of a single tree from an ensemble for dynamic interpretation.
method A multi-armed contextual bandit recommendation framework that trains a system on top of Random Forests to identify the most relevant tree.
result The dynamic method outperforms an independent CART tree and is comparable to Random Forest in predictive performance.

Exploiting low-rank structure of the user-item rating matrix has been the crux of many recommendation engines. However, existing recommendation engines force raters with heterogeneous behavior profiles to map their intrinsic rating scales to a common rating scale (e.g. 1-5). This non-linear transformation of the rating…

2018-10-31abs ↗pdf ↗

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.

JIMA uses multi-level preference data to recommend composite items.

problem Recommending composite items efficiently with multi-level preference information.
method Joint Interaction Modeling (JIMA) approach that integrates multi-level preference data and interactions.
result JIMA outperforms advanced baselines in offline and online settings.

New method improves reliability of recommender systems in face of fake accounts and manipulation.

problem Improving reliability of recommender systems in the presence of fake accounts and manipulation.
method Robust Discrete Matrix Completion (RDMC) method designed to handle sparse rating data and manipulation.
result Evaluations show RDMC offers a statistically-sound blueprint for future studies on recommender systems.

Paper tackles exposure bias in recommender systems using contrastive learning.

problem Exposure bias in large-scale recommender systems.
method Contrastive learning to reduce exposure bias via inverse propensity weighting.
result Contrastive learning effectively reduces exposure bias in recommender systems.

GPLVMF improves CARS performance by addressing overfitting and context importance.

problem Overfitting and lack of automatic context importance determination in GP-based CARS.
method GPLVMF applies a non-zero mean function and real-valued latent space to improve GP model performance.
result Significant improvement in performance on real datasets and automatic context importance determination.

Modeling interactions between features improves the performance of machine learning solutions in many domains (e.g. recommender systems or sentiment analysis). In this paper, we introduce Exponential Machines (ExM), a predictor that models all interactions of every order. The key idea is to represent an exponentially l…

2016-05-12abs ↗pdf ↗

DRGO improves graph recommendation by mitigating noisy samples and enhancing out-of-distribution generalization.

problem Noisy samples in training data diminish recommendation systems' out-of-distribution generalization.
method DRGO uses a diffusion paradigm to reduce noisy effects and entropy regularization to avoid extreme weights.
result DRGO outperforms current methods in OOD recommendation across various distribution shifts.

We introduce an exploratory study on Mutation Validation (MV), a model validation method using mutated training labels for supervised learning. MV mutates training data labels, retrains the model against the mutated data, then uses the metamorphic relation that captures the consequent training performance changes to as…

2019-05-24abs ↗pdf ↗

Joint analysis of data from multiple sources has the potential to improve our understanding of the underlying structures in complex data sets. For instance, in restaurant recommendation systems, recommendations can be based on rating histories of customers. In addition to rating histories, customers' social networks (e…

2011-05-17abs ↗pdf ↗

Model analyzes cooccurrence data for recommender systems and item relevance.

problem High-dimensional cooccurrence data from online platforms.
method Shared parameter Alternating Tweedie (SA-Tweedie) model with Fisher scoring and learning rate adjustment.
result SA-Tweedie model outperforms other methods in optimizing parameters.

Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.

problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.

This paper surveys fairness notions in ML and recommends the most suitable one for real-world scenarios.

problem Ensuring ML systems do not discriminate against specific individuals or sub-populations.
method Identifying fairness-related characteristics of real-world scenarios and analyzing the behavior of fairness notions.
result A decision diagram to recommend the most suitable fairness notion for specific setups.

CAFL breaks feedback loops in recommender systems using causal inference.

problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.

Previous work on recommender systems mainly focus on fitting the ratings provided by users. However, the response patterns, i.e., some items are rated while others not, are generally ignored. We argue that failing to observe such response patterns can lead to biased parameter estimation and sub-optimal model performanc…

2012-10-16abs ↗pdf ↗

Infer-AVAE infers missing user attributes from incomplete data using a novel adversarial approach.

problem Incomplete user attributes in social networks.
method Infer-AVAE combines MLP and GNNs with adversarial training to infer missing attributes.
result Infer-AVAE outperforms baselines by 7.0% in accuracy on real-world datasets.

With the increasing variety of services that e-commerce platforms provide, criteria for evaluating their success become also increasingly multi-targeting. This work introduces a multi-target optimization framework with Bayesian modeling of the target events, called Deep Bayesian Multi-Target Learning (DBMTL). In this f…

2019-02-25abs ↗pdf ↗

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.

Machine learning models learn what we teach them to learn. Machine learning is at the heart of recommender systems. If a machine learning model is trained on biased data, the resulting recommender system may reflect the biases in its recommendations. Biases arise at different stages in a recommender system, from existi…

2019-05-10abs ↗pdf ↗

The paper aims to define a benchmark for deep learning recommendation models.

problem Insufficient benchmarking for deep learning recommendation models.
method Synthesizes modeling strategies, defines desirable characteristics, and summarizes advice from the MLPerf Recommendation Advisory Board.
result Defines an industry-relevant benchmark for deep learning recommendation models.

Interprets feature interactions in ad-click prediction models.

problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.

Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually ignore the diversity of the recommendation results, thus usually results in unsa…

2019-07-01abs ↗pdf ↗

Job recommendation has traditionally been treated as a filter-based match or as a recommendation based on the features of jobs and candidates as discrete entities. In this paper, we introduce a methodology where we leverage the progression of job selection by candidates using machine learning. Additionally, our recomme…

2019-05-28abs ↗pdf ↗

Data poisoning attacks can manipulate recommender systems to recommend target items.

problem Attacks on recommender systems to influence top-N item recommendations.
method Formulated as an optimization problem, solved using influence function to select influential users.
result Effective data poisoning attacks that outperform existing methods.

Recommender system is an important component of many web services to help users locate items that match their interests. Several studies showed that recommender systems are vulnerable to poisoning attacks, in which an attacker injects fake data to a given system such that the system makes recommendations as the attacke…

2018-09-11abs ↗pdf ↗

In this study, we perform a novel analysis of the 2015 financial bubble in the Chinese stock market by calibrating the Log Periodic Power Law Singularity (LPPLS) model to two important Chinese stock indices, SSEC and SZSC, from early 2014 to June 2015. The back tests of the 2015 Chinese stock market bubbles indicates t…

2019-05-23abs ↗pdf ↗

Develops a real-time exercise recommendation system using deep learning.

problem Improving accuracy in exercise recommendation systems without user feedback.
method Deep recurrent neural network with attention mechanisms, real-time expert feedback.
result Improved accuracy in exercise recommendation system after real-time active learning.

Recommender systems are used in variety of domains affecting people's lives. This has raised concerns about possible biases and discrimination that such systems might exacerbate. There are two primary kinds of biases inherent in recommender systems: observation bias and bias stemming from imbalanced data. Observation b…

2018-09-13abs ↗pdf ↗