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.

169,051 papers · 148 categories

Trend · papers per month

51101152202 · Jun 202019922001200920182026
48 results for user interactions

JODIE learns dynamic user-item embeddings from interactions, outperforming existing methods.

problem Modeling dynamic user-item interactions for accurate future predictions.
method JODIE uses coupled recurrent models with update, projection, and prediction components, and a novel t-Batch algorithm.
result JODIE outperforms state-of-the-art methods by up to 22.4% on future interaction and state change prediction tasks.

Many successful applications of computer vision to image or video manipulation are interactive by nature. However, parameters of such systems are often trained neglecting the user. Traditionally, interactive systems have been treated in the same manner as their fully automatic counterparts. Their performance is evaluat…

2009-12-13abs ↗pdf ↗

Etsy uses novel embeddings to improve user recommendations based on item interactions.

problem Improving personalized recommendations for users based on diverse item interactions.
method Learning interaction-based item embeddings to encode co-occurrence patterns of item and interaction types.
result Taking interaction type into account improves user shopping behavior modeling accuracy.

Improved item recommendations for repeat interactions using sequence analysis.

problem Limited effectiveness of traditional recommender systems in handling repeated user-item interactions.
method Designed a recommender system that considers sequences of item interactions for each user.
result Empirically shown to give highly accurate predictions and increase sales by 5%.

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…

2018-09-07abs ↗pdf ↗

Proposes MCCF to distinguish latent purchasing motivations in user-item interactions.

problem Difficulty in capturing fine-grained user preferences due to complex latent motivations.
method Introduces MCCF with decomposer and combiner modules to identify and recombine latent components.
result Significant performance gains and necessity of considering multiple components demonstrated.

Interactive learning improves real-time tweet classification for situational awareness.

problem Difficulty in identifying relevant tweets from noisy social media data.
method Interactive learning framework that incorporates user feedback in real-time.
result Our approach outperforms state-of-the-art models in real-time tweet classification.

FBSM improves item recommendation for cold-start users by modeling feature interactions.

problem Cold-start item recommendation for new users.
method Factorized bilinear similarity model learning interactions among item features.
result Improves TOP-n recommendation performance compared to traditional methods.

New model improves recommendation systems by analyzing user-item interactions.

problem Improving recommendation systems for better user-item interactions.
method Sliced Anti-symmetric Decomposition (SAD) model using tensor decomposition.
result SAD produces the most consistent personalized preferences compared to SOTA models.

Modeling social network activity through user and topic interaction.

problem Understanding complex dynamics of opinion formation in social networks.
method Mixture of Interacting Cascades (MIC) model of marked multidimensional Hawkes processes.
result MIC achieves superior performance in modeling information cascade spread.

New model for personalized online advertising with multi-user interaction.

problem Realistic online advertising scenarios with multiple users interacting simultaneously.
method Introduces Multi-User Contextual Cascading Bandit (MCCB) model and proposes UCBBP and AUCBBP algorithms.
result Proves UCBBP and AUCBBP achieve optimal regret bounds for multi-user context.

Interactive steering improves hierarchical clustering for diverse user needs.

problem Existing hierarchical clustering methods fail to meet diverse user needs.
method Knowledge-driven and data-driven constraints, interactive steering through a visual interface.
result Facilitates the building of customized clustering trees efficiently and effectively.

LSTM improves cross-network recommendations by capturing user preference changes and irregular time intervals.

problem Offline cross-network recommender solutions fail to capture user preference changes and dynamic environments.
method Proposes a multi-layered LSTM network with attention mechanisms, higher order interactions, and time-aware gates.
result The model consistently outperforms state-of-the-art in accuracy, diversity, and novelty.

Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…

2015-05-25abs ↗pdf ↗

A new dataset tracks user interactions and click responses in online marketplaces.

problem Lack of exposure data in recommender systems datasets.
method Proposes a novel dataset including slates and click responses, allowing more accurate likelihood models.
result Models using exposure data show more natural likelihood, reducing bias towards previously exposed items.

Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services. The vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy. In this paper…

2017-12-30abs ↗pdf ↗

SAIN integrates user-item feedback with content attributes for better recommendation.

problem Cold start problems in recommendation models due to sparse user-item interactions.
method SAIN uses a self-attention mechanism to capture feature interactions and an information integration layer to combine feedback and content information.
result SAIN outperforms state-of-the-art models by 2.13% on public datasets.

FAIRY explains user actions and social media feeds.

problem Users struggle to understand why certain items appear in their social feeds.
method FAIRY uses an interaction graph to model user behavior and ranks feed items, scoring paths connecting user actions and feed items.
result FAIRY provides clear explanations for user actions and feed items, enhancing transparency and user understanding.

Estimates users' preference for a site over others using engagement data.

problem Lack of data on users' interactions with other sites makes it hard to estimate preferences for a focal site.
method Uses Hierarchical Bayes Method with two estimation techniques: Markov Chain Monte Carlo and Stochastic Gradient with Langevin Dynamics.
result Good support found for the approach to computing personalized share of engagement.

New research shows the bandwagon effect doesn't cause bias but can make estimators inconsistent.

problem The bandwagon effect in recommender systems makes estimators inconsistent.
method Theoretical analysis investigating conditions for inconsistency and proposing mitigation approaches.
result The bandwagon effect can make estimators inconsistent, not just cause bias.

The paper tackles robust policy learning in multitask contextual bandits with adversarial users.

problem Learning optimal policies in multitask contextual bandits with a small fraction of adversarial users.
method Developed efficient robust mean estimators for both uni-variate and high-dimensional random variables.
result Lower bound of ildeΩ(min(S,A)α2/ε2) ildeΩ(\min(S,A) \cdot α^2 / ε^2) per-user interactions to learn an εε-optimal policy for good users.

Proposes a new model for diversified interactive recommendation.

problem Previous methods focus on optimizing recommendation accuracy, ignoring diversity.
method DC2^2B model using determinantal point process and Thompson sampling-based variational Bayesian inference.
result Demonstrates effectiveness of the proposed method through extensive experiments.

Interactive weak supervision learns useful heuristics from user feedback.

problem Creating useful heuristics for large labeled datasets is tedious and subjective.
method Develops an interactive framework for learning heuristics from user feedback.
result Only a few feedback iterations are needed to train models without ground truth labels.

Algorithm improves query recommendations with immediate user feedback.

problem Lack of adaptability to immediate user feedback in query recommendation algorithms.
method Augmented transformer-based causal language models with multi-armed bandit framework.
result Substantial improvement in per-round regret compared to state-of-the-art models.

Unified neural framework for multi-relational recommender systems.

problem Accurately capturing users' fine-grained preferences from diverse feedback types.
method Multi-Relational Memory Network (MRMN) framework that models fine-grained user-item relations and discriminates between feedback types.
result The proposed MRMN model outperforms state-of-the-art algorithms in various recommender scenarios.

DPBD simplifies labeling functions through interactive demonstrations.

problem Difficulty in writing labeling functions for large-scale labeled training data.
method Data Programming by Demonstration (DPBD) framework using interactive demonstrations.
result Ruler system generates labeling rules more easily and with higher user satisfaction.

Many recommendation algorithms rely on user data to generate recommendations. However, these recommendations also affect the data obtained from future users. This work aims to understand the effects of this dynamic interaction. We propose a simple model where users with heterogeneous preferences arrive over time. Based…

2017-03-01abs ↗pdf ↗

Proposes a graph-based system for personalized news recommendation considering multiple user behaviors.

problem Lack of considering multiple user behaviors in news recommendation systems.
method Builds an interaction behavior graph, applies DeepWalk and G-CNN for news and behavior sequence representations, introduces core and coritivity features.
result Achieves personalized news recommendation considering user's concentration degree of interests.

Proposes a new framework for resource-limited recommendation.

problem Resource constraints affect user choices in recommendation tasks.
method Interest-behavior multiplicative network with MRRNNs and resource-limited branch.
result Framework effectively predicts user interactions considering resource limitations.

User strategization undermines algorithmic trustworthiness.

problem User strategic behavior corrupts algorithmic data and trust.
method Modeling user-platform interactions as a game, analyzing strategic behavior's short-term benefits and long-term harms.
result User strategization can initially benefit platforms but ultimately harms their ability to make accurate decisions.

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.