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

Trend · papers per month

158317475633 · Jun 202019922001200920172026
48 results for task collaboration

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.

We study a recent model of collaborative PAC learning where kk players with kk different tasks collaborate to learn a single classifier that works for all tasks. Previous work showed that when there is a classifier that has very small error on all tasks, there is a collaborative algorithm that finds a single classifi…

2018-05-22abs ↗pdf ↗

CoLoRA leverages task similarity to boost fine-tuning efficiency.

problem Efficiently fine-tuning large foundation models with scarce labeled data.
method CoLoRA trains a shared adapter for task similarity and personalized adapters for user-specific tasks.
result CoLoRA significantly boosts fine-tuning performance when tasks are similar.

Experiment shows cognitive biases impact human-AI collaboration, highlighting the need for diverse evaluator samples.

problem Cognitive biases affect human-AI collaboration, leading to suboptimal outcomes.
method Randomized experiment with 2,784 participants, manipulating AI suggestion quality, task burden, and financial incentives.
result Individual attitudes toward AI are the strongest predictor of performance, influencing accuracy and overcorrection.

Game theory models incentivizes honesty in collaborative learning among competitors.

problem Incentivizing honest updates among competitors in collaborative learning schemes.
method Formulated a game to model interactions, studied two learning tasks, proposed mechanisms to incentivize honest communication.
result Rational clients are incentivized to manipulate their updates, preventing learning; proposed mechanisms ensure comparable learning quality to full cooperation.

A novel method for efficient CDRL over wireless networks.

problem Challenges in collaborative deep reinforcement learning over wireless networks.
method Semantic-aware heterogeneous federated deep reinforcement learning (HFDRL) algorithm.
result Superior performance compared to state-of-the-art baselines.

This study proposes a deep learning framework using ResNeXt for efficient financial data mining.

problem Complex financial data with high dimensionality, nonlinearity, and task correlations.
method Introduces ResNeXt into multi-task learning framework for efficient feature extraction and task collaboration.
result Significantly improved performance in classification and regression tasks on S&P 500 data.

Backdoor attacks are possible in feature-partitioned collaborative learning, even without labels.

problem Backdoor attacks in feature-partitioned collaborative learning.
method Demonstrated the feasibility of backdoor attacks and introduced defense techniques.
result Backdoor attacks can be blocked without significantly affecting main task 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 ↗

New method for collaborative learning with multiple distributions, minimizing sample size.

problem Learning accurate classifiers for multiple data distributions without a single universal classifier.
method Empirical Risk Minimization (ERM) on a modified hypothesis class, with computational hardness results.
result Sample-efficient learning is possible under a weaker realizability assumption.

RGCF improves collaborative filtering by refining graph convolution embeddings.

problem GCN-based recommendation models introduce noise and redundancy, limiting high-order connectivity capture.
method Developed RGCF, a new GCN-based Collaborative Filtering model with redesigned embeddings.
result RGCF significantly outperforms state-of-the-art models on public datasets.

In this dissertation, we cover some recent advances in collaborative filtering and ranking. In chapter 1, we give a brief introduction of the history and the current landscape of collaborative filtering and ranking; chapter 2 we first talk about pointwise collaborative filtering problem with graph information, and how …

2020-02-27abs ↗pdf ↗

We introduce collaborative learning in which multiple classifier heads of the same network are simultaneously trained on the same training data to improve generalization and robustness to label noise with no extra inference cost. It acquires the strengths from auxiliary training, multi-task learning and knowledge disti…

2018-05-30abs ↗pdf ↗

DiCE uses diverse agents to explore and learn, avoiding local minima.

problem Local minima in RL due to limited exploration and correlated behavior.
method DiCE employs a group of heterogeneous agents to explore simultaneously and share experiences, with a diversity regularization mechanism.
result DiCE achieves substantial improvement over baselines in MuJoCo locomotion tasks.

Drone optimizes collaborative learning for neural networks.

problem Training a shared neural network with heterogeneous data from multiple devices.
method Drone collects and aggregates model parameters from devices, optimizing trajectory for best accuracy.
result Significant improvement in final accuracy and speedup in training time.

In today's day and age when almost every industry has an online presence with users interacting in online marketplaces, personalized recommendations have become quite important. Traditionally, the problem of collaborative filtering has been tackled using Matrix Factorization which is linear in nature. We extend the wor…

2018-07-14abs ↗pdf ↗

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.

New collaborative algorithm improves personalized mean estimation in online settings.

problem Online estimation of means from multiple, possibly overlapping distributions.
method Novel collaborative strategy for active querying and mean estimation.
result Algorithm improves mean estimates through communication among agents.

OpenML is an online machine learning platform where researchers can easily share data, machine learning tasks and experiments as well as organize them online to work and collaborate more efficiently. In this paper, we present an R package to interface with the OpenML platform and illustrate its usage in combination wit…

2017-01-05abs ↗pdf ↗

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 many applications requiring multiple inputs to obtain a desired output, if any of the input data is missing, it often introduces large amounts of bias. Although many techniques have been developed for imputing missing data, the image imputation is still difficult due to complicated nature of natural images. To addre…

2019-01-28abs ↗pdf ↗

NKI integrates obfuscated datasets using nonlinear kernels for improved data collaboration.

problem Privacy-preserving data collaboration with reduced reconstruction risk.
method Formulates linear kernel integration, kernelizes it, and introduces graph regularization and centering constraints.
result NKI improves classification accuracy over existing linear integration methods under nonlinear dimensionality reduction.

Shortage of labeled data has been holding the surge of deep learning in healthcare back, as sample sizes are often small, patient information cannot be shared openly, and multi-center collaborative studies are a burden to set up. Distributed machine learning methods promise to mitigate these problems. We argue for a sp…

2019-12-27abs ↗pdf ↗

OL4EL optimizes edge learning on resource-constrained servers.

problem Resource constraints on edge servers hinder effective distributed machine learning.
method Online Learning for EL (OL4EL) framework using budget-limited multi-armed bandit model.
result OL4EL significantly improves learning performance while conserving resources.

Paper proposes methods to reduce bias and variance in recommender systems.

problem Bias in recommender systems due to users' preferences.
method Proposes a principled approach to reduce bias and variance in DR methods, and a novel semi-parametric collaborative learning approach.
result The proposed methods outperform existing debiasing methods in both theory and experiments.

In this paper, we study a multi-step interactive recommendation problem, where the item recommended at current step may affect the quality of future recommendations. To address the problem, we develop a novel and effective approach, named CFRL, which seamlessly integrates the ideas of both collaborative filtering (CF) …

2019-02-02abs ↗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.

This paper proposes CF-NADE, a neural autoregressive architecture for collaborative filtering (CF) tasks, which is inspired by the Restricted Boltzmann Machine (RBM) based CF model and the Neural Autoregressive Distribution Estimator (NADE). We first describe the basic CF-NADE model for CF tasks. Then we propose to imp…

2016-05-31abs ↗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.