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

2825648451,127 · Jun 202019922001200920172026
48 results for data collaboration

The excellent performance of representation learning of autoencoders have attracted considerable interest in various applications. However, the structure and multi-local collaborative relationships of unlabeled data are ignored in their encoding procedure that limits the capability of feature extraction. This paper pre…

2019-06-12abs ↗pdf ↗

Meta clustering categorizes learners for collaborative learning.

problem Filtering out unqualified collaborators in collaborative learning.
method Select-Exchange-Cluster (SEC) method to classify learners by their supervised functions.
result SEC can cluster learners into accurate collaboration sets and enhance single-learner performance.

A new privacy-preserving deep learning scheme for asymmetrically collaborative machine learning.

problem Privacy and efficiency in collaborative machine learning across different data owners.
method Decomposes neural network steps for privacy-preserving training; novel protocol for information leakage.
result Efficient training with stable performance and significant speedup.

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.

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.

New algorithms for collaborative learning in uncertain, decentralized environments.

problem Byzantine collaborative learning in uncertain, decentralized environments.
method Two asynchronous solutions to averaging agreement, each optimal according to some dimension.
result New algorithms achieve optimal Byzantine resilience and collaborative learning.

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 ↗

Split learning improves deep learning in healthcare by sharing data.

problem Data scarcity in healthcare limits deep learning applications.
method Distributed learning approach for collaborative training of deep neural networks.
result Split learning outperformed non-collaborative methods in both binary and multi-label classification tasks.

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.

Study on collaboration vs. independent data collection in sensor networks.

problem Impact of sensor correlation on data collection strategies.
method Analysis of Fisher information and Cramer-Rao bound.
result Optimal strategy involves transferring non-immediate information for improved estimation.

Paper proposes efficient privacy-preserving matrix encryption for secure collaborative learning against malicious adversaries.

problem Secure collaborative learning of sensitive data across different agencies is challenging with malicious adversaries.
method The paper applies matrix encryption to secure data against chosen plaintext attack, known plaintext attack, and collusion attack, achieving local differential privacy and high computation efficiency.
result The proposed schemes are computationally efficient and secure against malicious adversaries compared to existing techniques.

This paper analyzes privacy-preserving methods for collaborative forecasting.

problem Data owners' reluctance to share data due to competitive and privacy concerns.
method Examines three groups of privacy-preserving methods: data transformation, secure multi-party computations, and decomposition methods.
result State-of-the-art techniques have limitations in preserving data privacy, such as trade-offs between privacy and forecasting accuracy.

Optimizes resource allocation for distributed parameter estimation in sensor networks.

problem Maximizing accuracy in parameter estimation with limited resources.
method Formulates a data collection and collaboration policy design problem as a Fisher information maximization problem. Proposes multi-armed bandit algorithms for learning the optimal policy.
result Identifies optimal data collection and collaboration policies that balance resource use and estimation accuracy.

Proposes a new method to handle data heterogeneity in causal inference.

problem Challenges of collaborating between different data centers due to heterogeneity.
method Collaborative inverse propensity score weighting estimator to adjust for distribution shift.
result Significant improvements over traditional meta-analysis methods when dealing with increased heterogeneity.

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.

In this paper, we propose a data collaboration analysis method for distributed datasets. The proposed method is a centralized machine learning while training datasets and models remain distributed over some institutions. Recently, data became large and distributed with decreasing costs of data collection. If we can cen…

2019-02-20abs ↗pdf ↗

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.

Artificial intelligence (AI) is intrinsically data-driven. It calls for the application of statistical concepts through human-machine collaboration during generation of data, development of algorithms, and evaluation of results. This paper discusses how such human-machine collaboration can be approached through the sta…

2017-12-08abs ↗pdf ↗

Asynchronous algorithms reduce privacy costs in distributed machine learning.

problem Privacy concerns in training machine learning models on scattered private data.
method Differentially-private asynchronous algorithms for collaborative training.
result Cost of privacy is inversely proportional to dataset size and privacy budgets.

The paper proposes a model reward scheme for collaborative ML based on Shapley value and information gain.

problem Designing fair incentives for collaborative machine learning.
method The paper proposes a reward scheme based on Shapley value and information gain, with properties like fairness and stability.
result The proposed reward scheme satisfies fairness and trade-offs between desirable properties via an adjustable parameter.

Supply Chain Management often requires independent organizations to work together to achieve shared objectives. This collaboration is necessary when coordinated actions benefit the group more than the uncoordinated efforts of individual firms. Despite the commonly reported benefits that can be gained in close relations…

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

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.

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.

A framework for collaborative learning reduces communication rounds.

problem Collaborative learning with distributed features and privacy concerns.
method Federated Stochastic Block Coordinate Descent (FedBCD) algorithm.
result The algorithm achieves O(T)O(\sqrt{T}) communication rounds and O(1/T)O(1/\sqrt{T}) accuracy.

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.

A novel federated learning framework resolves structural misalignment in model fusion.

problem Structural misalignment in model fusion due to chaotic information distribution.
method Feature-oriented regulation method (ΨΨ-Net) to ensure feature information allocation and dedicated collaboration schemes.
result Effective enhancement of federated learning applicability to heterogeneous settings with improved convergence speed, accuracy, and efficiency.

Nowadays, collaborative filtering recommender systems have been widely deployed in many commercial companies to make profit. Neighbourhood-based collaborative filtering is common and effective. To date, despite its effectiveness, there has been little effort to explore their robustness and the impact of data poisoning …

2019-12-01abs ↗pdf ↗