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

Trend · papers per month

83166249332 · Jun 202019922001200920172026
48 results for subject label recommendation

Advances citation and subject label recommendation using multi-modal adversarial autoencoders.

problem Improving recommendation systems for citations and subject labels.
method Multi-modal adversarial autoencoders with adversarial regularization, sparsity, and input modality analysis.
result Adversarial regularization consistently improves recommendation performance.

This paper reviews PU learning evaluation methods and provides practical recommendations.

problem Evaluating PU learning methods when only positive and unlabelled data are available.
method Critical review of 51 articles proposing PU classifiers and alternative predictive accuracy measures.
result Practical recommendations for improving PU learning evaluation.

The paper identifies and analyzes subjective class issues in user-generated data.

problem Subjective labels in user-generated data can lead to biased and manipulated results.
method Defined subjective and objective classes, proposed a framework for detecting subjective labels.
result Data mining practitioners can detect and avoid subjective class issues early in their projects.

The paper addresses treatment recommendation problems by optimizing distributional characteristics.

problem Optimizing treatment recommendations based on distributional targets.
method Characterizes the problem's difficulty and proposes near-optimal policies.
result Characterizes the difficulty of the problem and proposes near-regret optimal policies.

The profusion of online news articles makes it difficult to find interesting articles, a problem that can be assuaged by using a recommender system to bring the most relevant news stories to readers. However, news recommendation is challenging because the most relevant articles are often new content seen by few users. …

2013-03-04abs ↗pdf ↗

The need for diversification of recommendation lists manifests in a number of recommender systems use cases. However, an increase in diversity may undermine the utility of the recommendations, as relevant items in the list may be replaced by more diverse ones. In this work we propose a novel method for maximizing the u…

2014-11-13abs ↗pdf ↗

A substantial progress in development of new and efficient tensor factorization techniques has led to an extensive research of their applicability in recommender systems field. Tensor-based recommender models push the boundaries of traditional collaborative filtering techniques by taking into account a multifaceted nat…

2016-03-19abs ↗pdf ↗

Proposes dynamic model type recommendation for OLP technique.

problem Limited local competence of base-classifiers in uneven data distributions.
method Builds a multi-label meta-classifier to recommend model types based on local data complexity.
result Statistically similar performance to original OLP with fixed base-classifier model.

Supervisory signals can help topic models discover low-dimensional data representations that are more interpretable for clinical tasks. We propose a framework for training supervised latent Dirichlet allocation that balances two goals: faithful generative explanations of high-dimensional data and accurate prediction of…

2017-12-01abs ↗pdf ↗

Industrial recommender systems deal with extremely large action spaces -- many millions of items to recommend. Moreover, they need to serve billions of users, who are unique at any point in time, making a complex user state space. Luckily, huge quantities of logged implicit feedback (e.g., user clicks, dwell time) are …

2018-12-06abs ↗pdf ↗

A new method uses counterfactual learning to improve recommendation system evaluation.

problem Inconsistent results in recommender systems due to exposure mechanisms.
method Proposes a minimax empirical risk formulation with an adversarial game to account for exposure.
result Shows improved learning bounds and effectiveness over various recommendation settings.

CGM combines SSL and LFM for better recommendation performance.

problem Label sparsity in user-item rating matrices limits LFM performance.
method Probabilistic chain graph model (CGM) integrating Bayesian network and Markov random field.
result CGM significantly outperforms state-of-the-art approaches in recommendation.

The paper improves recommendation systems by ensuring their outputs are reliable.

problem Recommendation systems often lack reliability guarantees for their outputs.
method The method uses a pre-trained ranking model to create a set of items with rigorous FDR control.
result The approach provides a way to guarantee the reliability of recommendation outputs.

The paper briefly introduces multiple classifier systems and describes a new algorithm, which improves classification accuracy by means of recommendation of a proper algorithm to an object classification. This recommendation is done assuming that a classifier is likely to predict the label of the object correctly if it…

2015-04-21abs ↗pdf ↗

Heart rate estimation from electrocardiogram signals is very important for the early detection of cardiovascular diseases. However, due to large individual differences and varying electrocardiogram signal quality, there does not exist a single reliable estimation algorithm that works well on all subjects. Every algorit…

2019-03-26abs ↗pdf ↗

A new PLL method uses class activation values to improve robustness.

problem Weakly supervised learning with noisy data and adversarial perturbations.
method Subjective logic with class activation values for uncertainty representation and label weight re-distribution.
result More robust predictions under high noise levels, out-of-distribution examples, and adversarial perturbations.

Modern computing and communication technologies can make data collection procedures very efficient. However, our ability to analyze large data sets and/or to extract information out from them is hard-pressed to keep up with our capacities for data collection. Among these huge data sets, some of them are not collected f…

2019-01-29abs ↗pdf ↗

Bayesian framework evaluates predictors of subjective visual tasks.

problem Evaluating uncertainty in machine learning predictors for tasks with subjective annotations.
method Bayesian framework to estimate epistemic uncertainty from human labels.
result Framework successfully applied to four image classification tasks.

RecoBERT uses a language model to recommend items from catalogs.

problem Harnessing language models for text-based item recommendations.
method RecoBERT is a BERT-based approach that learns specialized language models for item recommendations without requiring labeled data.
result RecoBERT outperforms other techniques in inferring item similarities from textual catalogs.

This paper improves attacks on recommender systems by solving optimization problems more precisely.

problem Adversarial injection attacks on recommender systems.
method Solving optimization problems for generating fake user interactions more accurately.
result The exact solution for generating fake users leads to a much larger impact on recommender systems.

Proposes a comprehensive framework for financial product lead recommendations using graph representation learning and link prediction.

problem Challenges in surface lead recommendations for financial products due to changing market scenarios and difficulty in capturing holder's mindset.
method Bi-partite graph representation of financial holders and funds, GraphSage model for learning representations, link prediction model for ranking recommendations.
result The proposed graph ML solution outperforms baseline by 42%, 22%, and 14% in hit rate for top-k recommendations (50, 100, 200) and 18%, 19%, and 18% on unseen holders.

Efficiently classifies binary labels with XOR queries, even under noisy conditions.

problem Binary classification with unknown labels using XOR queries.
method Effective query type and an efficient inference algorithm for noisy conditions.
result Achieves information-theoretic limit on optimal number of queries.

NIS learns optimal embedding sizes for recommendation models.

problem Finding optimal embedding sizes for large-scale recommendation models.
method Neural Input Search (NIS) uses reinforcement learning to automatically find optimal vocabulary sizes and embedding dimensions.
result NIS improves prediction accuracy by 6.8% on Recall@1 and 1.8% on ROC-AUC.

Recommendation algorithms are widely adopted in marketplaces to help users find the items they are looking for. The sparsity of the items by user matrix and the cold-start issue in marketplaces pose challenges for the off-the-shelf matrix factorization based recommender systems. To understand user intent and tailor rec…

2018-09-06abs ↗pdf ↗

A new method selects the best feature selection technique for datasets.

problem Selecting the best feature selection method for unseen datasets.
method Data synthesis, meta features, fuzzy similarity, classification model training.
result Successfully recommended the best feature selection method for five out of eight datasets.

New system assigns vehicles to routes for cost and energy efficiency.

problem Optimizing vehicle route assignment for cost and energy efficiency.
method Machine learning-based neural network algorithm to estimate energy consumption and provide real-time recommendations.
result Demonstrated efficient vehicle assignment for medium and heavy duty trucks.

SAFER improves personalized treatment recommendations for dynamic clinical contexts.

problem Personalized treatment optimization in evolving clinical contexts with safety concerns.
method Integrates structured EHR and clinical notes, uses conformal prediction for safe recommendations.
result SAFER outperforms state-of-the-art baselines in recommendation metrics and mortality rates.