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

Trend · papers per month

3570105140 · Jun 202019922001200920172026
48 results for User Heterogeneity

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

problem Heterogeneous user data with varying numbers of data points and distributions.
method Simple model of heterogeneous user data, differential privacy mechanism for estimation.
result Asymptotic optimality of the proposed estimator and general lower bounds on error.

Paper proposes TPathMine model for more accurate user attribute prediction.

problem Predicting user attributes from click data in heterogeneous networks.
method HetPathMine model with meta-path weights optimized for user emotional preferences.
result TPathMine model achieves higher accuracy in user attribute prediction.

Proposes a semi-supervised approach to predict user-level sentiments in social media.

problem Detect and analyze sentiment in social media, especially user-level sentiments.
method Semi-supervised approach using a heterogeneous graph built from social networks, incorporating user influences and multiple types of links.
result Predicts user-level sentiments for specific topics more effectively than previous supervised learning approaches.

The study finds that Chinese internet users have different search behaviors and attention patterns.

problem Heterogeneity in search behavior and attention among Chinese internet users.
method Data extraction technology to analyze Baidu Index keyword search volume data.
result Chinese internet users exhibit different search behaviors and attention patterns.

SHIFT method optimally estimates heterogeneous discrete distributions with limited communication.

problem Collaborative learning of discrete distributions under heterogeneity and communication constraints.
method Two-stage method: First, users learn a central distribution; then, fine-tune this to estimate individual distributions.
result SHIFT is minimax optimal in the model of heterogeneity and under communication constraints.

The paper develops personalized DAG models for web user behavior.

problem Understanding user behavior transitions between websites with user heterogeneity and network dependency.
method Personalized Binomial DAG models with network-structured covariates, embedding network structure into a dimension-reduced covariate, learning node neighborhoods, and exploring variance-mean relation.
result The proposed algorithm outperforms state-of-the-art competitors in heterogeneous data.

A new federated learning method clusters users into multiple models for better data distribution handling.

problem Non-IID data from heterogeneous sources in federated learning.
method Proposes a multi-center aggregation mechanism to learn multiple global models and optimally match users to centers.
result Our method outperforms existing federated learning methods on benchmark datasets.

Study proposes a time-aware model to predict user conversion intent.

problem Weak predictive signals from users not suitable for conversion prediction.
method Time-aware approach to model user activities and capture conversion intent signals.
result Approach outperforms other models on real-world datasets.

New bounds for LDP with heterogeneous privacy levels guaranteeing high probability of accuracy.

problem Statistical estimation under LDP with users having varying privacy levels.
method Developed finite sample upper bounds in ℓ_2-norm with high probability, complemented by lower bounds.
result Optimal guarantees for heterogeneous LDP in terms of probability and constants.

MetaSelector learns to choose the best model for each user.

problem Heterogeneous datasets and user-specific historical data make it hard to find the best model for each user.
method Meta-learning framework to train a model selector that chooses the best model for each user based on their historical data.
result MetaSelector outperforms single model and sample-level model selector in AUC and LogLoss.

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…

2019-07-18abs ↗pdf ↗

We provide the first convergence analysis of local gradient descent for minimizing the average of smooth and convex but otherwise arbitrary functions. Problems of this form and local gradient descent as a solution method are of importance in federated learning, where each function is based on private data stored by a u…

2019-09-10abs ↗pdf ↗

Estimates shared linear subspace from noisy data with multiple users.

problem Recovering shared linear subspace from noisy data with non-isotropic noise.
method Estimates shared subspace using at least two data points per user, avoiding restrictive assumptions.
result Upper and lower bounds for estimation error match, showing no additional error due to noise irregularity.

We propose a friend recommendation system (an application of link prediction) using edge embeddings on social networks. Most real-world social networks are multi-graphs, where different kinds of relationships (e.g. chat, friendship) are possible between a pair of users. Existing network embedding techniques do not leve…

2019-02-07abs ↗pdf ↗

Adaptive clustering and personalization algorithms minimize regret in multi-agent stochastic linear bandits.

problem Minimizing regret in a multi-agent stochastic linear bandits framework with user heterogeneity.
method Proposes a novel algorithm that refines cluster identities and minimizes regret, adapting to cluster separation and user parameter deviations.
result Regret scales as O(T/N)\mathcal{O}(\sqrt{T/N}) for well-separated clusters and O(T12+ε/(N)12ε)\mathcal{O}(T^{\frac{1}{2} + \varepsilon}/(N)^{\frac{1}{2} -\varepsilon}) for poorly separated clusters.

Propagates adversarial robustness in federated learning.

problem Heterogeneous federated users with non-iid data and limited resources.
method Adversarial robustness propagation through batch-normalization.
result Federated models achieve remarkable robustness even with limited adversarial training.

Optimizes user marketing campaigns to balance cost and effectiveness.

problem Lack of methods to optimize marketing campaigns considering cost and effectiveness.
method Proposes a treatment effect optimization algorithm using deep learning to balance cost and effectiveness.
result Demonstrates superior performance in cost-efficiency and real-world business value.

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 ↗

FedConPE improves conversational recommender systems efficiency and privacy.

problem Efficiently eliciting user preferences in interactive systems with heterogeneous clients.
method Phase elimination-based federated conversational bandit algorithm with adaptive key term construction.
result Minimizes uncertainty across all dimensions in feature space and offers improved efficiency and privacy.

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.

Consider a platform that wants to learn a personalized policy for each user, but the platform faces the risk of a user abandoning the platform if she is dissatisfied with the actions of the platform. For example, a platform is interested in personalizing the number of newsletters it sends, but faces the risk that the u…

2018-02-23abs ↗pdf ↗

Interactive news recommendation has been launched and attracted much attention recently. In this scenario, user's behavior evolves from single click behavior to multiple behaviors including like, comment, share etc. However, most of the existing methods still use single click behavior as the unique criterion of judging…

2018-11-30abs ↗pdf ↗

Paper proposes FedPer to combat statistical heterogeneity in federated learning for personalized tasks.

problem Statistical heterogeneity in federated learning data degrades performance of traditional federated averaging.
method FedPer: a base + personalization layer approach for federated training of deep feedforward neural networks.
result FedPer effectively combats statistical heterogeneity in non-identical data partitions of CIFAR datasets and personalized image aesthetics datasets.

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 ↗

Paper tackles robust federated learning for affine distribution shifts.

problem Statistical heterogeneity and distribution shifts degrade model performance in federated learning.
method Develops a robust federated learning algorithm (FLRA) for affine distribution shifts.
result FLRA achieves significant performance gains against affine distribution shifts.

Which song will Smith listen to next? Which restaurant will Alice go to tomorrow? Which product will John click next? These applications have in common the prediction of user trajectories that are in a constant state of flux over a hidden network (e.g. website links, geographic location). What users are doing now may b…

2015-11-03abs ↗pdf ↗

Enhances social spam detection using multi-level dependency of relational sequences.

problem Social spam detection in multi-relation social networks.
method Developed the Multi-level Dependency Model (MDM) to exploit long-term and short-term dependencies in user relational sequences.
result MDM improves social spam detection accuracy on a real-world multi-relational social network.

Recently, matrix factorization-based recommendation methods have been criticized for the problem raised by the triangle inequality violation. Although several metric learning-based approaches have been proposed to overcome this issue, existing approaches typically project each user to a single point in the metric space…

2019-06-04abs ↗pdf ↗

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.