arXiv research

Smart app tracks relapse history and predicts relapse based on spatial-temporal factors.

This paper presents a novel approach to the technical analysis of wireheading in intelligent agents. Inspired by the natural analogues of wireheading and their prevalent manifestations, we propose the modeling of such phenomenon in Reinforcement Learning (RL) agents as psychological disorders. In a preliminary step tow…

Optimal investment and consumption model with habit formation constraint.

We solve an optimal consumption problem with habit formation constraints.

Opioid addiction is a severe public health threat in the U.S, causing massive deaths and many social problems. Accurate relapse prediction is of practical importance for recovering patients since relapse prediction promotes timely relapse preventions that help patients stay clean. In this paper, we introduce a Generati…

Drawing an inspiration from behavioral studies of human decision making, we propose here a general parametric framework for a reinforcement learning problem, which extends the standard Q-learning approach to incorporate a two-stream framework of reward processing with biases biologically associated with several neurolo…

This paper studies the continuous time utility maximization problem on consumption with addictive habit formation in incomplete semimartingale markets. Introducing the set of auxiliary state processes and the modified dual space, we embed our original problem into a time-separable utility maximization problem with a sh…

We consider a model of optimal investment and consumption with both habit formation and partial observations in incomplete Itô processes market. The investor chooses his consumption under the addictive habits constraint while only observing the market stock prices but not the instantaneous rate of return. Applying the …

Let $f$ be an ordinary polynomial in $\mathbb{C}[z_1,..., z_n]$ with no negative exponents and with no factor of the form $z_1^{α_1}... z_n^{α_n}$ where $α_i$ are non zero natural integer. If we assume in addicting that $f$ is maximally sparse polynomial (that its support is equal to the set of vertices of its Newton p…

Predicts academic risk in college students using interpretable machine learning.

This paper studies the optimal consumption under the addictive habit formation preference in markets with transaction costs and unbounded random endowments. To model the proportional transaction costs, we adopt the Kabanov's multi-asset framework with a cash account. At the terminal time T, the investor can receive unb…

The "standard" Merton formulation of optimal investment and consumption involves optimizing the integrated lifetime utility of consumption, suitably discounted, together with the discounted future bequest. In this formulation the utility of consumption at any given time depends only on the amount consumed at that time.…

The paper analyzes optimal retirement strategies in a market with habit persistence and jump diffusion, finding discontinuous investment strategies.

Automates kernel discovery for longitudinal data analysis.

This paper introduces a novel generative encoder (GE) model for generative imaging and image processing with applications in compressed sensing and imaging, image compression, denoising, inpainting, deblurring, and super-resolution. The GE model consists of a pre-training phase and a solving phase. In the pre-training …

GUIDE-VAE generates user-guided data with improved realism and performance.

Hybrid approach combines user feedback and machine learning for predicting user satisfaction.

Author2Vec generates user embeddings from social media data.

Optimal recommendation system using user and item clustering.

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

Recommender systems recommend items more accurately by analyzing users' potential interest on different brands' items. In conjunction with users' rating similarity, the presence of users' implicit feedbacks like clicking items, viewing items specifications, watching videos etc. have been proved to be helpful for learni…

New method detects and measures malicious users in recommendation algorithms.

Traditional collaborative filtering (CF) based recommender systems tend to perform poorly when the user-item interactions/ratings are highly scarce. To address this, we propose a learning framework that improves collaborative filtering with a synthetic feedback loop (CF-SFL) to simulate the user feedback. The proposed …

A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a channel are the same for each user. In contrast to prior work, it is assumed that t…

Users increasingly rely on social media feeds for consuming daily information. The items in a feed, such as news, questions, songs, etc., usually result from the complex interplay of a user's social contacts, her interests and her actions on the platform. The relationship of the user's own behavior and the received fee…

We consider an online model for recommendation systems, with each user being recommended an item at each time-step and providing 'like' or 'dislike' feedback. Each user may be recommended a given item at most once. A latent variable model specifies the user preferences: both users and items are clustered into types. Al…

Paper uses RNN to predict SaaS user lifetime value.

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

Improved neural model for social recommendation by integrating social and interest networks.

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…

In human-in-the-loop machine learning, the user provides information beyond that in the training data. Many algorithms and user interfaces have been designed to optimize and facilitate this human--machine interaction; however, fewer studies have addressed the potential defects the designs can cause. Effective interacti…

Study personalizes user experience to maximize rewards with patience budget.

Estimates population mean from user-level data with privacy, accounting for heterogeneity.

Deep learning predicts user identity, activity, and location from Wi-Fi signals.

The evolution of social media users' behavior over time complicates user-level comparison tasks such as verification, classification, clustering, and ranking. As a result, naïve approaches may fail to generalize to new users or even to future observations of previously known users. In this paper, we propose a novel pro…

AI2V learns user representations by focusing on recent interests.

Model user preferences for conversational LLMs using weak rewards.

With the information explosion of news articles, personalized news recommendation has become important for users to quickly find news that they are interested in. Existing methods on news recommendation mainly include collaborative filtering methods which rely on direct user-item interactions and content based methods …

Bayesian optimization agent learns user preferences from pairwise comparisons.

MRIF models dynamic user interests at multiple temporal-ranges.

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 …

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

Paper presents AETN for efficient user modeling from mobile app usage.

Improved multi-user VoiceFilter-Lite model for speech recognition.

Recommender systems take inputs from user history, use an internal ranking algorithm to generate results and possibly optimize this ranking based on feedback. However, often the recommender system is unaware of the actual intent of the user and simply provides recommendations dynamically without properly understanding …

Most users of online services have unique behavioral or usage patterns. These behavioral patterns can be exploited to identify and track users by using only the observed patterns in the behavior. We study the task of identifying users from statistics of their behavioral patterns. Specifically, we focus on the setting i…

CrystalCandle creates user-friendly explanations for machine learning models.

FedUA trains UA models privately without raw data.