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

131261392522 · Jun 202019922001200920172026
48 results for collaborative prediction

This work advances collaborative decision making by combining human and AI strengths in uncertainty quantification.

problem Current AI lacks robust decision-making capabilities under uncertainty, especially in high-stakes contexts.
method Introduces Human AI Collaborative Uncertainty Quantification (HACUQ) framework, formalizing AI-human collaboration and developing calibration algorithms.
result Optimal collaborative prediction sets follow a two-threshold structure, and online adaptation algorithms can adapt to evolving human behavior.

We address challenges in collaborative black-box optimization through three frameworks.

problem Challenges in distributed experimentation, heterogeneity, and privacy in black-box optimization.
method Three unifying frameworks: global, local, and predictive.
result Shift from descriptive/predictive to prescriptive federated learning in black-box optimization.

HCFContext predicts mobile context using collaborative filtering and homomorphic encryption.

problem Accurate mobile context determination for enterprise policies.
method Proposes HPContext and HCFContext models using sequential history and collaborative filtering, with privacy-preserving homomorphic encryption.
result HCFContext enhances context prediction by leveraging related users' observations.

Proposes TFCL to mitigate negative transfer in MTL by collaborating across features and tasks.

problem Negative transfer in Multi-Task Learning (MTL) due to dissimilar tasks.
method Task-Feature Collaborative Learning (TFCL) with heterogeneous block-diagonal structure regularizer and optimization method.
result Global convergence and block-diagonal structure recovery guarantees.

In this paper we examine the effect of applying ensemble learning to the performance of collaborative filtering methods. We present several systematic approaches for generating an ensemble of collaborative filtering models based on a single collaborative filtering algorithm (single-model or homogeneous ensemble). We pr…

2012-11-13abs ↗pdf ↗

Proposes a flexible neural recommendation framework for better prediction performance.

problem Data sparsity, cold start problem, and long-tail distribution in recommendations.
method A modular neural recommendation framework that includes a neural collaborative filtering part and a text processing part as a regularizer.
result Achieves better prediction performance than state-of-the-art text-aware methods using a simple text processing approach.

Deep learning predicts frame errors in CIRN using SC2 dataset.

problem Predicting frame errors in Collaborative Intelligent Radio Networks (CIRN).
method Deep learning model trained on SC2 dataset with randomized or fixed bandwidth and channel allocation strategies.
result Deep learning model predicts frame error rates and instances with interesting characteristics over different SNR ranges.

Proposes a method to analyze distributed datasets without sharing original data.

problem Difficulty in centralizing large, distributed datasets due to size and privacy concerns.
method Centralizes intermediate representations instead of original datasets.
result Achieves higher prediction performance compared to individual analyses.

Collaborative Trees model analyzes feature interactions and additive effects.

problem Analyzing complex statistical associations between features and response variables.
method Proposes a novel tree model and its bagging version to decompose mean decrease in impurity and visualize feature contributions.
result Demonstrates the superior capability of the tree model in estimating additive effects and interaction effects.

A neural collaborative filtering method predicts corn hybrid yield performance.

problem Predicting yield performance of untested hybrid combinations in plant breeding.
method Ensemble of matrix factorization and neural networks.
result The model significantly outperformed other models in the Syngenta Crop Challenge.

We study the problem of collaborative filtering where ranking information is available. Focusing on the core of the collaborative ranking process, the user and their community, we propose new models for representation of the underlying permutations and prediction of ranks. The first approach is based on the assumption …

2014-07-23abs ↗pdf ↗

A new machine learning framework called machine collaboration improves prediction accuracy.

problem Improving prediction accuracy in machine learning.
method Machine Collaboration (MaC) framework, which uses a circular and interactive learning approach.
result Machine Collaboration framework significantly outperforms other state-of-the-art methods in most cases.

FL improves insurance claims loss prediction without sharing data.

problem Limited data volume and variety due to privacy concerns.
method Federated Learning (FL) to update a global model using local data insights.
result Improved claims loss forecasting compared to individual models.

Study compares federated and centralized learning for patient data privacy.

problem Ensuring privacy in machine learning models trained on electronic health records.
method Examined private and non-private federated learning for clinical prediction tasks.
result Differentially private stochastic gradient descent is effective in centralized learning but challenging in federated learning.

Defense against user shilling attacks in collaborative filtering using edge reweighting.

problem Vulnerability of collaborative filtering to profile injection attacks.
method Adversarial robustness based edge reweighting to attenuate non-robust edges.
result Effective defense against various types of attacks demonstrated through experiments.

We study fairness in collaborative-filtering recommender systems, which are sensitive to discrimination that exists in historical data. Biased data can lead collaborative-filtering methods to make unfair predictions for users from minority groups. We identify the insufficiency of existing fairness metrics and propose f…

2017-05-24abs ↗pdf ↗

Framework uses human judgment to distinguish algorithmically indistinguishable cases.

problem Clarifying human-AI collaboration in prediction and decision tasks.
method Integrates human judgment to distinguish algorithmically indistinguishable cases.
result Improves performance of any feasible algorithmic predictor.

Model-based collaborative filtering analyzes user-item interactions to infer latent factors that represent user preferences and item characteristics in order to predict future interactions. Most collaborative filtering algorithms assume that these latent factors are static, although it has been shown that user preferen…

2016-08-17abs ↗pdf ↗

Collaborative filtering is a useful technique for exploiting the preference patterns of a group of users to predict the utility of items for the active user. In general, the performance of collaborative filtering depends on the number of rated examples given by the active user. The more the number of rated examples giv…

2012-07-11abs ↗pdf ↗

BeMF improves recommendation reliability in recommender systems.

problem Improving reliability in recommender systems beyond accuracy.
method Bernoulli Matrix Factorization (BeMF) for model-based collaborative filtering.
result BeMF selects more reliable predictions, improving recommendation quality.

Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.

problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.

We study the stability vis a vis adversarial noise of matrix factorization algorithm for matrix completion. In particular, our results include: (I) we bound the gap between the solution matrix of the factorization method and the ground truth in terms of root mean square error; (II) we treat the matrix factorization as …

2012-06-18abs ↗pdf ↗

A new method for estimating uncertainty intervals in regression.

problem Lack of effective methods to estimate uncertainty intervals in regression.
method Collaborating Networks (CN) approach using two neural networks with distinct loss functions.
result CN method improves performance on various real-world datasets, including forecasting A1c values in diabetic patients.

A new method for finding efficient neural interaction functions in collaborative filtering.

problem Finding consistent good performance for complex interactions in collaborative filtering.
method Proposes a search algorithm for simple neural interaction functions (SIF) in CF, using a structured multi-layer perceptron.
result Demonstrates much better prediction performance and distinct IFCs for different data sets and tasks.

Study addresses covariate mismatch in federated learning, improving model accuracy.

problem Learning from clients with different feature sets in federated learning.
method Developed two approaches for linear prediction under covariate mismatch: plug-in estimator and impute-then-regress strategy.
result Proposed methods provide asymptotic and finite-sample learning rates, improving model accuracy.

We investigate a novel cluster-of-bandit algorithm CAB for collaborative recommendation tasks that implements the underlying feedback sharing mechanism by estimating the neighborhood of users in a context-dependent manner. CAB makes sharp departures from the state of the art by incorporating collaborative effects into …

2016-08-06abs ↗pdf ↗

The paper analyzes the trade-off between privacy and model fitness in collaborative machine learning.

problem Balancing privacy and model utility in collaborative machine learning.
method Differential privacy applied to noisy gradients in stochastic gradient descent.
result The fitness of the model is inversely proportional to the size of the datasets and privacy budget.

New model predicts links in community-based networks robustly.

problem Link prediction in community-based networks with local clustering errors.
method Markov Stochastic Block Model (MSBM) with Hidden Markov Model (HMM) predictions.
result Misclassification error decays exponentially with relevant signal-to-noise ratio (SNR).

AdaDKRR tackles data silos by combining autonomy, privacy, and collaboration.

problem Data silos caused by privacy and interoperability constraints.
method Adaptive distributed kernel ridge regression (AdaDKRR) with autonomy, privacy, and collaboration.
result AdaDKRR performs similarly to optimal learning algorithms on the whole data under mild conditions.

We study the problem of privacy-preserving machine learning (PPML) for ensemble methods, focusing our effort on random forests. In collaborative analysis, PPML attempts to solve the conflict between the need for data sharing and privacy. This is especially important in privacy sensitive applications such as learning pr…

2018-11-21abs ↗pdf ↗

JoVA combines two VAEs to learn user and item representations for better recommendation.

problem Collaborative filtering with implicit feedback.
method Joint Variational Autoencoders (JoVA) with a hinge-based pairwise loss function (JoVA-Hinge).
result JoVA-Hinge outperforms state-of-the-art methods in top-k recommendation.

Classical collaborative filtering, and content-based filtering methods try to learn a static recommendation model given training data. These approaches are far from ideal in highly dynamic recommendation domains such as news recommendation and computational advertisement, where the set of items and users is very fluid.…

2015-02-11abs ↗pdf ↗

Paper presents content-based models for game recommendation in cold start scenarios.

problem Cold start problem in game recommendation where new games and players have no historical data.
method Uses survey data to develop content-based interaction models that generalize to new games, players, and both.
result Content models outperform collaborative filtering in predicting new interactions.

Collaborative filtering (CF) is a popular technique in today's recommender systems, and matrix approximation-based CF methods have achieved great success in both rating prediction and top-N recommendation tasks. However, real-world user-item rating matrices are typically sparse, incomplete and noisy, which introduce ch…

2018-11-06abs ↗pdf ↗

In applications such as recommendation systems and revenue management, it is important to predict preferences on items that have not been seen by a user or predict outcomes of comparisons among those that have never been compared. A popular discrete choice model of multinomial logit model captures the structure of the …

2015-06-26abs ↗pdf ↗