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

147294441588 · Jun 202019922001200920172026
48 results for user experience

Current recommender systems exploit user and item similarities by collaborative filtering. Some advanced methods also consider the temporal evolution of item ratings as a global background process. However, all prior methods disregard the individual evolution of a user's experience level and how this is expressed in th…

2017-05-06abs ↗pdf ↗

Study personalizes user experience to maximize rewards with patience budget.

problem Maximizing rewards for a platform while respecting user patience.
method Proposes bandit algorithms for sequential choice with feedback models.
result Upper and lower bounds on regret of order O(N2/3)O(N^{2/3}) and Ω(N2/3)Ω(N^{2/3}).

This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.

problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.

Bayesian nonparametric model predicts user activity and intervention success.

problem Predicting user activity and intervention success in online experiments.
method Bayesian nonparametric approach to model user heterogeneity and derive user activity predictions.
result The proposed method outperforms existing approaches in predicting user activity and intervention success.

Interactive user interfaces need to continuously evolve based on the interactions that a user has (or does not have) with the system. This may require constant exploration of various options that the system may have for the user and obtaining signals of user preferences on those. However, such an exploration, especiall…

2018-12-01abs ↗pdf ↗

Framework for discovering treatment benefits in user segments.

problem Discovering differential impacts of treatments across user subgroups.
method Combines causal inference and machine learning for user segment discovery.
result Unified approach for treatment benefit discovery and assignment.

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…

2018-09-06abs ↗pdf ↗

New method detects and measures malicious users in recommendation algorithms.

problem Identifying and quantifying malicious user activity in recommendation systems.
method Probabilistic programming for a disentangled model of malicious and regular user behavior.
result Simulation-based measure for quantifying malicious user effects.

In E-commerce advertising, where product recommendations and product ads are presented to users simultaneously, the traditional setting is to display ads at fixed positions. However, under such a setting, the advertising system loses the flexibility to control the number and positions of ads, resulting in sub-optimal p…

2018-09-10abs ↗pdf ↗

Defense against user shilling attacks in collaborative filtering using edge reweighting.

problem Vulnerability of collaborative filtering to profile injection attacks.
method Adversarial robustness based edge reweighting to attenuate non-robust edges.
result Effective defense against various types of attacks demonstrated through experiments.

ML4Chem offers a user-friendly platform for developing and deploying machine learning models in chemistry.

problem Developing and deploying machine learning models in chemistry and materials science.
method User-experience design, six core building blocks: data, featurization, models, model optimization, inference, and visualization.
result Ease of use and functionality of the atomistic module for neural networks and kernel ridge regression.

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…

2018-09-06abs ↗pdf ↗

With online payment platforms being ubiquitous and important, fraud transaction detection has become the key for such platforms, to ensure user account safety and platform security. In this work, we present a novel method for detecting fraud transactions by leveraging patterns from both users' static profiles and users…

2019-12-26abs ↗pdf ↗

In the 'Big Data' era, many real-world applications like search involve the ranking problem for a large number of items. It is important to obtain effective ranking results and at the same time obtain the results efficiently in a timely manner for providing good user experience and saving computational costs. Valuable …

2017-06-07abs ↗pdf ↗

Currently, there starts a research trend to leverage neural architecture for recommendation systems. Though several deep recommender models are proposed, most methods are too simple to characterize users' complex preference. In this paper, for a fine-grain analysis, users' ratings are explained from multiple perspectiv…

2018-07-12abs ↗pdf ↗

Industry-scale recommendation systems have become a cornerstone of the e-commerce shopping experience. For Etsy, an online marketplace with over 50 million handmade and vintage items, users come to rely on personalized recommendations to surface relevant items from its massive inventory. One hallmark of Etsy's shopping…

2018-12-11abs ↗pdf ↗

CnGAN generates synthetic user preferences for non-overlapped users in cross-network recommender systems.

problem Cross-network recommender solutions ignore non-overlapped users, limiting their applicability.
method Multi-task learning, encoder-GAN architecture, user-based pairwise loss function.
result Generated user preferences improve recommendations for non-overlapped users, achieving superior performance.

In recommender systems, the user-item interaction data is usually sparse and not sufficient for learning comprehensive user/item representations for recommendation. To address this problem, we propose a novel dual-bridging recommendation model (DBRec). DBRec performs latent user/item group discovery simultaneously with…

2019-09-27abs ↗pdf ↗

MRIF models dynamic user interests at multiple temporal-ranges.

problem Capturing dynamic and multi-resolution user interests in recommendation.
method Multi-resolution Interest Fusion (MRIF) model that considers both temporal-ranges and drifts in user interests.
result MRIF outperforms state-of-the-art recommendation methods consistently.

Modeling a sequence of interactions between users and items (e.g., products, posts, or courses) is crucial in domains such as e-commerce, social networking, and education to predict future interactions. Representation learning presents an attractive solution to model the dynamic evolution of user and item properties, w…

2018-12-06abs ↗pdf ↗

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.

PinnerSage creates multi-modal user embeddings for better Pinterest recommendations.

problem Single high-dimensional embeddings fail to fully understand user interests.
method Hierarchical clustering and Medoids to summarize user actions into coherent clusters.
result PinnerSage outperforms single embedding methods in personalized recommendations.

Can machine learning models for recommendation be easily fooled? While the question has been answered for hand-engineered fake user profiles, it has not been explored for machine learned adversarial attacks. This paper attempts to close this gap. We propose a framework for generating fake user profiles which, when inco…

2018-09-21abs ↗pdf ↗

This work analyzes how users and services adapt to reduce risk, leading to specialization.

problem Adaptation of users and services to reduce risk affects learning and performance.
method Analyzed a class of dynamics where users allocate participation and services update parameters.
result Repeated myopic updates with multiple learners lead to better outcomes than repeated risk minimization.

OpenML is an online machine learning platform where researchers can easily share data, machine learning tasks and experiments as well as organize them online to work and collaborate more efficiently. In this paper, we present an R package to interface with the OpenML platform and illustrate its usage in combination wit…

2017-01-05abs ↗pdf ↗

Proposes using frequent sequences to improve sequential recommendation models.

problem Combining user history and recent actions for personalized recommendations.
method Uses frequent sequences to identify relevant parts of user history, embedding items based on preferences and dynamics in a unified metric model.
result Outperforms state-of-the-art methods, especially on sparse datasets.

Recommender systems play a central role in providing individualized access to information and services. This paper focuses on collaborative filtering, an approach that exploits the shared structure among mind-liked users and similar items. In particular, we focus on a formal probabilistic framework known as Markov rand…

2016-02-09abs ↗pdf ↗

Rating platforms enable large-scale collection of user opinion about items (products, other users, etc.). However, many untrustworthy users give fraudulent ratings for excessive monetary gains. In the paper, we present FairJudge, a system to identify such fraudulent users. We propose three metrics: (i) the fairness of …

2017-03-30abs ↗pdf ↗

Whenever a social media user decides to share a story, she is typically pleased to receive likes, comments, shares, or, more generally, feedback from her followers. As a result, she may feel compelled to use the feedback she receives to (re-)estimate her followers' preferences and decides which stories to share next to…

2019-09-01abs ↗pdf ↗