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

58116173231 · Jun 202019922001200920182026
48 results for User Association

Deep learning optimizes user association in Massive MIMO networks.

problem Optimizing user cell association for maximum sum-rate in Massive MIMO networks.
method Training a deep neural network to learn optimal association rules based on user positions.
result The neural network achieves the same performance as traditional optimization methods with reduced computational complexity.

A new method uses machine learning to optimize user pairing and association in multicell NOMA networks.

problem Optimizing user pairing and association in multicell non-orthogonal multiple access (NOMA) systems.
method Formulated as a combinatorial optimization problem, solved using a Pointer Network (PtrNet) trained with deep reinforcement learning.
result Achieves near-optimal performance in terms of aggregate data rate, outperforming random heuristics by up to 30%.

Federated learning optimizes task and resource allocation in balloon networks.

problem Minimizing energy and time consumption in task computation and transmission.
method SVM-based federated learning algorithm to dynamically adjust user associations, service sequences, and task allocations.
result Reduces the weighted sum of energy and time consumption by up to 16.1%.

OMBA learns product and user representations for better online market basket analysis.

problem Limited ability to uncover rarely occurring and temporal associations in MBA.
method Jointly learns product and user representations, captures temporal dynamics, scalable online method.
result OMBA outperforms state-of-the-art methods by 21% on real-world datasets.

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.

We consider the task of collaborative preference completion: given a pool of items, a pool of users and a partially observed item-user rating matrix, the goal is to recover the \emph{personalized ranking} of each user over all of the items. Our approach is nonparametric: we assume that each item ii and each user uu h…

2017-05-24abs ↗pdf ↗

Study improves scalability of cell-free massive MIMO networks by optimizing UE-AP association.

problem Optimizing UE-AP association in cell-free massive MIMO networks.
method Deep learning algorithm using Bidirectional Long Short-Term Memory cells and hybrid probabilistic weight updating.
result Enhanced scalability without retraining, robust against pilot contamination.

MACRo-mIcro VAE learns disentangled user behavior representations.

problem Complex user behavior data in recommender systems are entangled; disentangling them enhances robustness and interpretability.
method MACRo-mIcro Disentangled Variational Auto-Encoder (MacridVAE) infers high-level user intentions and micro-disentangles preferences.
result Our approach achieves substantial improvement over state-of-the-art baselines and demonstrates interpretable and controllable learned representations.

Classifies privacy policy segments for better user understanding.

problem Difficulty in understanding privacy policies due to legal jargon.
method Uses machine learning and deep learning techniques to classify privacy policy segments.
result Identifies data practices in privacy policies for better user comprehension.

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

problem Relapse prevention for alcohol and tobacco addiction users.
method Records user profiles, tracks relapse history, uses machine learning for prediction, and recommends activities.
result Predictive machine learning algorithms help in preventing relapse.

Bayesian optimization agent learns user preferences from pairwise comparisons.

problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.

Deep learning identifies smartphone users from motion sensor data.

problem Smartphone user identification using motion sensor signals.
method Transformed motion signals into images, trained CNN for classification, used SVM for few-shot identification.
result CNN achieved 89.75% multi-class user classification and 96.72% few-shot user identification accuracy.

Algorithm maximizes user rewards under per-item budget constraints.

problem Maximizing cumulative rewards in collaborative bandits with budget constraints.
method Collaborative algorithm B-LATTICE that clusters users and collaborates across groups.
result Achieves sub-linear regret bounds matching minimax bounds.

Optimal algorithm for latent bandits with cluster structure reduces regret to nearly optimal.

problem Maximizing cumulative rewards in a multi-armed bandit problem with latent clusters.
method LATTICE algorithm exploiting cluster structure and arm information.
result Minimax optimal regret of O((M+N)T)O(\sqrt{(\mathsf{M}+\mathsf{N})\mathsf{T}}) with O(logT)O(\log{\mathsf{T}}) calls to matrix completion oracle.

Integrates regression trees to explain latent factor models in recommendation systems.

problem Difficulty in explaining latent factor models in personalized recommendations.
method Builds regression trees on users and items using user-generated reviews to guide latent factor model learning and explain latent factors.
result Model generates explainable recommendations by tracking latent profiles through regression tree paths.

Recommending items to users is a challenging task due to the large amount of missing information. In many cases, the data solely consist of ratings or tags voluntarily contributed by each user on a very limited subset of the available items, so that most of the data of potential interest is actually missing. Current ap…

2015-09-30abs ↗pdf ↗

A deep RL framework optimizes resource allocation in wireless networks.

problem Optimizing resource allocation and interference in wireless networks.
method Multi-agent deep reinforcement learning for distributed decision-making.
result Our approach outperforms decentralized and centralized baselines in terms of user rates.

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.

PABBO optimizes user utility learning from preferential feedback, significantly faster than traditional methods.

problem Computational inefficiency in Preferential Bayesian Optimization (PBO) methods.
method Amortized Bayesian Optimization (PABBO) using transformer neural processes and reinforcement learning.
result Significantly faster performance compared to traditional Gaussian process-based methods.

Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of online and interactive CF: given the current ratings associated with a user, what queries (new ratings) would most improve the quality of the rec…

2012-10-19abs ↗pdf ↗

Method optimizes diffusion model generation to meet user preferences.

problem Optimizing diffusion model generation with only black-box target scores.
method Covariance-adaptive sequential optimization algorithm for black-box optimization.
result Proves superior performance in achieving better target scores.

A new algorithm improves top-kk recommendation accuracy by considering item payoffs uncertainty.

problem Suboptimal performance in top-kk recommendation rankings due to varying item payoffs.
method Proposes a risk-seeking utility function for ranking items based on estimated preference scores.
result Risk-seeking ranking yields the best performance in top-kk recommendations.

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 ↗

An interactive image retrieval system learns which images in the database belong to a user's query concept, by analyzing the example images and feedback provided by the user. The challenge is to retrieve the relevant images with minimal user interaction. In this work, we propose to solve this problem by posing it as a …

2018-02-12abs ↗pdf ↗

A new method selects important variables for clustering from dependency networks.

problem Variable selection for clustering in high-cost data scenarios.
method Create dependency networks, rank variables by centrality, select top-n variables.
result Top-n variables improve clustering performance compared to existing methods.

Proposes element-level differential privacy for better privacy and utility in statistical learning.

problem Challenges of strong differential privacy in statistical learning applications.
method Introduces element-level differential privacy, extending classical DP to protect specific user elements.
result Provides better utility and more robust results compared to classical DP by allowing finer privacy protections.

A new Input-Output model, called the Multi-Entity Input-Output (MEIO) model, is introduced to estimate the responsibility of entities of an ecosystem on the footprint of each other. It assumed that the ecosystem is comprised of end users, service providers, and utilities. The proposed MEIO modeling approach can be seen…

2014-04-24abs ↗pdf ↗

We tackle robust influence maximization in social networks with hyperparametric edge probabilities.

problem Maximizing worst-case influence in social networks with hyperparametric edge probabilities.
method Proposed a model with NP-hard proper robust optimization, using sampling and multiplicative weight updates.
result Empirically validated method outperforms state-of-the-art robust influence maximization techniques.

Study optimal bidding strategies for digital ads targeting purchases and health campaigns.

problem Optimizing advertising strategies in digital channels.
method Continuous-time models encoding user behavior and auction mechanisms, semi-explicit formulas for optimal bidding.
result Semi-explicit formulas for optimal value and bidding policy for different types of advertising.

We propose a practical approach based on federated learning to solve out-of-domain issues with continuously running embedded speech-based models such as wake word detectors. We conduct an extensive empirical study of the federated averaging algorithm for the "Hey Snips" wake word based on a crowdsourced dataset that mi…

2018-10-09abs ↗pdf ↗

Deep learning model for AI co-creativity boosts design creativity.

problem Design creativity enhancement through AI collaboration.
method Novelty metric applied to deep learning-generated vector representations for conceptual shifts in a co-creative design system.
result Increasing novelty in AI contributions correlates with higher creative outcomes in design.

We address the cold start problem in recommendation systems assuming no contextual information is available neither about users, nor items. We consider the case in which we only have access to a set of ratings of items by users. Most of the existing works consider a batch setting, and use cross-validation to tune param…

2014-07-10abs ↗pdf ↗