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

265277103 · Jun 202019922001200920172026
48 results for Collaborative Trees

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.

User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is oft…

2011-09-27abs ↗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.

Notes on Whitney towers in 4-manifolds, focusing on local surface manipulations and invariants.

problem Classifying and understanding Whitney towers in 4-manifolds.
method Local manipulations of surfaces, definitions of Whitney towers and trees, geometric Jacobi identities, classification of twisted Whitney towers.
result Classification of order n twisted Whitney towers in the 4-ball and related invariants.

We tackle the problem of building explainable recommendation systems that are based on a per-user decision tree, with decision rules that are based on single attribute values. We build the trees by applying learned regression functions to obtain the decision rules as well as the values at the leaf nodes. The regression…

2019-12-19abs ↗pdf ↗

Technology and collaboration enable dramatic increases in the size of psychological and psychiatric data collections, but finding structure in these large data sets with many collected variables is challenging. Decision tree ensembles like random forests (Strobl, Malley, and Tutz, 2009) are a useful tool for finding st…

2015-11-06abs ↗pdf ↗

DistGP models multi-robot mapping with distributed Gaussian process learning.

problem Collaborative mapping by multiple robots with limited local data.
method Sparse Gaussian process with factorisation and distributed training via GBP.
result DistGP achieves superior accuracy and robustness compared to DiNNO.

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 ↗

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 ↗

Study collaborative learning among multi-agents in multi-armed bandits.

problem Minimizing group cumulative regret in a heterogeneous multi-agent setting.
method Developed decentralized algorithms for collaboration between NN agents learning MM stochastic multi-armed bandits.
result Proved near-optimal behavior of proposed algorithms for group regret.

DEMVC improves multi-view clustering with collaborative training and deep autoencoders.

problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.

PCL tackles collaborative learning for diverse agents, reducing sample complexity.

problem Balancing collaborative speedup with personalization for heterogeneous agents.
method AffPCL, with bias and importance correction mechanisms.
result AffPCL reduces sample complexity by a factor of max{n1,δ}\max\{n^{-1}, δ\}, where nn is the number of agents and δ[0,1]δ\in[0,1] measures heterogeneity.

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 ↗

Collaborative recommendation is an information-filtering technique that attempts to present information items (movies, music, books, news, images, Web pages, etc.) that are likely of interest to the Internet user. Traditionally, collaborative systems deal with situations with two types of variables, users and items. In…

2009-10-13abs ↗pdf ↗

The way developers collaborate inside and particularly across teams often escapes management's attention, despite a formal organization with designated teams being defined. Observability of the actual, organically formed engineering structure provides decision makers invaluable additional tools to manage their talent p…

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

Optimal algorithm found for collaborative learning in bandits with optimal regret bounds.

problem Minimizing regret in collaborative multi-agent bandit problems.
method Proposed an algorithm with optimal regret bounds for collaborative multi-agent multi-armed bandit model.
result First algorithm with order optimal regret bounds for collaborative bandit model.

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.

Today, the prominence of data science within organizations has given rise to teams of data science workers collaborating on extracting insights from data, as opposed to individual data scientists working alone. However, we still lack a deep understanding of how data science workers collaborate in practice. In this work…

2020-01-18abs ↗pdf ↗

A new method for online personalized learning reduces gradient variance by dynamically selecting peers.

problem Online personalized decentralized learning with statistically heterogeneous clients.
method Gradient-based collaboration criterion allowing clients to dynamically select peers with similar gradients.
result The method acts as a variance reduction method, achieving optimal performance in certain 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.

New algorithms balance collaboration and adversarial behavior in linear bandits.

problem Minimizing regret in a collaborative linear bandit problem with adversarial agents.
method Robust collaborative phased elimination algorithm with tight analyses.
result Achieves near-optimal regret bounds of $O\left(α+ 1/\sqrt{M} ight) \sqrt{dT}$ for good agents.

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.

Collaborative filtering is used to recommend items to a user without requiring a knowledge of the item itself and tends to outperform other techniques. However, collaborative filtering suffers from the cold-start problem, which occurs when an item has not yet been rated or a user has not rated any items. Incorporating …

2014-06-09abs ↗pdf ↗

Implicit feedback is the simplest form of user feedback that can be used for item recommendation. It is easy to collect and domain independent. However, there is a lack of negative examples. Existing works circumvent this problem by making various assumptions regarding the unconsumed items, which fail to hold when the …

2018-08-28abs ↗pdf ↗

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 ↗

Collaborative filtering is a rapidly advancing research area. Every year several new techniques are proposed and yet it is not clear which of the techniques work best and under what conditions. In this paper we conduct a study comparing several collaborative filtering techniques -- both classic and recent state-of-the-…

2012-05-14abs ↗pdf ↗

JPS improves joint policies for multi-agent collaboration in imperfect information games.

problem Learning good joint policies for multi-agent collaboration with imperfect information.
method Decomposes global changes to localized policy changes, iteratively improving joint policies without re-evaluating the entire game.
result JPS improves solutions provided by unilateral approaches and outperforms algorithms designed for collaborative policy learning.

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.

Latent factor models have been used widely in collaborative filtering based recommender systems. In recent years, deep learning has been successful in solving a wide variety of machine learning problems. Motivated by the success of deep learning, we propose a deeper version of latent factor model. Experiments on benchm…

2019-12-10abs ↗pdf ↗

We study the collaborative PAC learning problem recently proposed in Blum et al.~\cite{BHPQ17}, in which we have kk players and they want to learn a target function collaboratively, such that the learned function approximates the target function well on all players' distributions simultaneously. The quality of the col…

2018-05-23abs ↗pdf ↗

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.

Algorithm optimizes collaborative learning among distributed clients using kernel-based bandits.

problem Optimizing personalized objectives in a distributed system with limited global information.
method Kernel-based bandit framework with surrogate Gaussian process models, sparse approximations.
result Order-optimal regret performance (up to polylogarithmic factors) and reduced communication overhead.