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

3.3%6.6%9.9%13.2% · Jan 202019922001200920172026
48 results for User Selection

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.

Optimizes convergence time of federated learning over wireless networks.

problem Limited resource blocks in wireless networks affect federated learning convergence time and performance.
method Formulates an optimization problem to minimize convergence time while optimizing performance, proposes a probabilistic user selection scheme and uses ANNs for estimation.
result Improves convergence time and performance of federated learning over wireless networks.

This paper examines feature selection for extracting user intentions from Twitter.

problem Extracting user intentions from informal, misspelled tweets.
method Developed a dataset from Twitter feeds, used two feature selection techniques (Information Gain and hybrid forward selection), and applied four classification algorithms.
result The hybrid feature selection approach outperformed the Information Gain method.

This paper improves context-aware recommender systems by selecting and incorporating relevant low-dimensional contextual information.

problem Generating accurate recommendations is not enough; contextual information can cause issues like battery drain and privacy.
method Developed a feature-selection algorithm based on genetic algorithms to reduce context dimensions while maintaining explainability.
result The approach improves accuracy and transparency in recommendations, outperforming state-of-the-art models.

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.

Algorithm maximizes revenue from user choices with contextual information.

problem Maximizing revenue from user choices with contextual preference information.
method Proposes an algorithm that learns from user feedback and achieves a revenue regret of order \( \widetilde{O}(d \sqrt{K T} / L_0 ) \).
result Achieves a revenue regret of order \( \widetilde{O}(d \sqrt{K T} / L_0 ) \) and a lower bound of order \( \Omega(d \sqrt{T}/ L_0) \).

We study the problem of clustering a set of items from binary user feedback. Such a problem arises in crowdsourcing platforms solving large-scale labeling tasks with minimal effort put on the users. For example, in some of the recent reCAPTCHA systems, users clicks (binary answers) can be used to efficiently label imag…

2019-10-14abs ↗pdf ↗

OLPA optimizes online user-centric selection with probing, achieving near-optimal regret bounds.

problem Sequential decision-making with unknown resources and rewards.
method Probing-augmented user-centric selection (PUCS) framework, greedy probing algorithm, OLPA algorithm.
result OLPA achieves a near-optimal regret bound of O(T+ln2T)\mathcal{O}(\sqrt{T} + \ln^{2} T) for online settings.

Enhanced recommender system using ensemble learning and graph embedding.

problem Challenges in selecting relevant data for users from large datasets.
method Group classification, ensemble learning, fuzzy rules, decision tree, graph embedding.
result High efficiency of the presented method on MovieLens datasets.

This paper tackles selection bias in recommender systems by considering the neighborhood effect.

problem Selection bias in recommender systems due to filtering and user selection.
method Formalizes neighborhood effect as interference problem, introduces treatment representation, and proposes ideal loss.
result Proposed methods achieve unbiased learning when both selection bias and neighborhood effect are present.

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.

Optimizes long-term social welfare in recommender systems by matching users to providers.

problem Realistic recommender systems dynamics affect all agents, not just users.
method Formulated as an optimal constrained matching problem, solved using dynamical system equilibrium selection.
result Ensures maximal social welfare with diverse viable providers, improving over myopic matching.

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 ↗

New algorithm speeds up user preference learning in conversational contexts.

problem Limited performance of existing conversational contextual bandit approaches.
method Proposes ConLinUCB framework and two algorithms, ConLinUCB-BS and ConLinUCB-MCR, with explorative key-term selection.
result Proves tighter regret bounds and achieves significant computational efficiency improvements.

We present a new Bitcoin coin selection algorithm, "coin selection with leverage", which aims to improve upon cost savings than that of standard knapsack like approaches. Parameters to the new algorithm are available to be tuned at the users discretion to address other goals of coin selection. Our approach naturally fi…

2019-11-04abs ↗pdf ↗

SYNTHONY selects tabular synthesizers based on stress profiling and user intent.

problem Non-uniform performance of tabular generative models across datasets.
method Stress profiling and intent-conditioned tabular synthesis selection.
result Meta-features predict synthesizer performance, improving selection accuracy.

Federated Learning tackles limited user participation with a new risk-aware approach.

problem Limited availability of users in federated learning environments.
method Random Access Model (RAM) and Conditional Value-at-Risk (CVaR) to design a risk-aware federated learning algorithm.
result The proposed approach achieves significantly improved performance under various setups compared to standard federated learning.

Flexible Cox model for time-dependent covariates with complex sparsity patterns.

problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.

DeepUnHide uses deep learning to reveal hidden demographic features in recommender systems.

problem Extracting hidden demographic features from recommender systems factors.
method Gradient-based localization in deep learning for feature extraction.
result DeepUnHide outperforms state-of-the-art feature selection methods.

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 ↗

Collaborative filtering (CF) aims to predict users' ratings on items according to historical user-item preference data. In many real-world applications, preference data are usually sparse, which would make models overfit and fail to give accurate predictions. Recently, several research works show that by transferring k…

2012-10-26abs ↗pdf ↗

The paper analyzes regret in online recommendation systems with constraints.

problem Analyzing regret in online recommendation systems with user-item constraints.
method Theoretical analysis and algorithm design considering user-item constraints and unknown probabilities.
result Derives regret lower bounds and algorithms achieving these limits for various structural assumptions.

Proposes a new query autocompletion method that maximizes retrieval performance.

problem Users often select suboptimal queries due to unknown best retrieval performance.
method Formulates query autocompletion as ranking item rankings, uses counterfactual learning.
result Empirical results show improved query suggestions for better retrieval performance.

Growing amounts of online user data motivate the need for automated processing techniques. In case of user ratings, one interesting option is to use neural networks for learning to predict ratings given an item and a user. While training for prediction, such an approach at the same time learns to map each user to a vec…

2019-01-08abs ↗pdf ↗

Graph neural networks optimize radio resource management policies for wireless networks.

problem Optimizing user selection and power control in wireless networks with fairness constraints.
method Formulated as a Lagrangian dual problem, RRM policies are parameterized by a GNN architecture trained on channel conditions.
result The method achieves superior tradeoff between average and 5th percentile rates, demonstrating fairness.

In this paper we consider an online recommendation setting, where a platform recommends a sequence of items to its users at every time period. The users respond by selecting one of the items recommended or abandon the platform due to fatigue from seeing less useful items. Assuming a parametric stochastic model of user …

2019-01-23abs ↗pdf ↗

User surveys for Quality of Experience (QoE) are a critical source of information. In addition to the common "star rating" used to estimate Mean Opinion Score (MOS), more detailed survey questions (problem tokens) about specific areas provide valuable insight into the factors impacting QoE. This paper explores two aspe…

2018-08-19abs ↗pdf ↗

Critical task and cognition-based environments, such as in military and defense operations, aviation user-technology interaction evaluation on UI, understanding intuitiveness of a hardware model or software toolkit, etc. require an assessment of how much a particular task is generating mental workload on a user. This i…

2019-11-07abs ↗pdf ↗

Improves relevancy of black-box anomaly detectors with user feedback.

problem Users often ignore many detected anomalies, requiring a method to identify and prioritize relevant ones.
method Uses user feedback to adjust anomaly selection process based on identified anomaly types.
result Significant improvements in precision and recall over various anomaly detectors.