Worldcoin aims to make cryptocurrency transparent and accessible.
problem Lack of transparency and regulation in cryptocurrency markets.
method Hypothetical cryptocurrency model to establish transparency and equal access.
result Established a model for a regulated and trusted cryptocurrency infrastructure.
Visualizes board connections for socially responsible investing insights.
problem Understanding corporate governance and sustainability through board connections.
method Data Visualization tool to reveal connections between Directors and Executives.
result Strength of tool in investigating corporate governance and sustainability.
Study of Hitchin map on specific Higgs bundles.
problem Understanding the Hitchin map on even very stable Higgs bundles.
method Defined even very stable Higgs bundles and studied the Hitchin map on their upward flows.
result Classification of type (1,...,1) examples and their relation to root systems.
New algorithms reduce communication costs in collaborative learning.
problem Reducing communication costs in collaborative learning.
method Distributed boosting and adaptation to classification noise.
result Communication-efficient algorithms for collaborative PAC learning robust to noise.
FedSyn generates synthetic data from multiple organizations' datasets.
problem Generating diverse synthetic data from limited datasets.
method Federated learning and GAN for privacy-preserving synthetic data generation.
result Synthetic data can be generated from diverse datasets without accessing individual data.
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…
This paper considers the problem of high dimensional signal detection in a large distributed network whose nodes can collaborate with their one-hop neighboring nodes (spatial collaboration). We assume that only a small subset of nodes communicate with the Fusion Center (FC). We design optimal collaboration strategies w…
Proposes MC-AE for better unsupervised clustering of unlabeled data.
problem Lack of consideration for multi-local collaborative relationships in autoencoders.
method Integrates LSH for multi-local cross blocks, mcrRBM and mcrGRBM models.
result MC-AE improves unsupervised clustering performance.
Paper tackles unobserved confounding in human-AI collaborations.
problem Unobserved confounding undermines human-AI collaboration effectiveness.
method Combines sensitivity analysis from causal inference with AI-driven statistical modeling.
result Enhances robustness and reliability of collaborative outcomes.
The paper identifies collaborations in codebases using commit activity and language usage.
problem Identifying organic team interactions and collaborations in large codebases.
method Embedding and clustering commit activity, language usage, and code identifier topics.
result Restores engineering organization and reveals hidden collaborations.
Firms' collaboration networks can decline but remain resilient.
problem Resilience of firms' collaboration networks during decline.
method Analysis of 21,500 R&D collaborations over 25 years, simulating drop-out cascades.
result Firms' collaboration networks can adapt to mitigate decline and recover.
Data science teams collaborate extensively, using various tools and stakeholders.
problem Lack of understanding in how data science workers collaborate in practice.
method Conducted an online survey with 183 data science workers.
result Data science teams are highly collaborative and use multiple tools and stakeholders.
Asynchronous federated learning for vertically partitioned data improves efficiency and privacy.
problem Efficiently train models on vertically partitioned data without a trusted third party.
method Proposed AFSGD-VP and its SVRG and SAGA variants for asynchronous federated learning.
result AFSGD-VP and its variants achieve higher efficiency than synchronous algorithms.
A new model VCM improves collaborative filtering by synchronously linking two VAEs.
problem Cold start and data sparsity issues in CF-based recommender systems.
method Proposes a variational collaborative model (VCM) that synchronously links two VAEs.
result VCM outperforms state-of-the-art methods on real-life datasets.
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 N agents learning M 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.
Advances in collaborative filtering and ranking methods.
problem Improving recommendation systems efficiency and accuracy.
method Graph information encoding, pairwise and listwise approaches, regularization techniques, personalization.
result New methods significantly improve recommendation system performance.
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{n−1,δ}, where n is the number of agents and δ∈[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…
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…
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.
Proposes a deep latent factor model for better recommendation systems.
problem Improving collaborative filtering in recommendation systems.
method Introduces a deeper latent factor model using deep learning.
result Significantly outperforms state-of-the-art techniques in experiments.
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.
Post-Quantum Secure Federated DeFi for Inclusive Banking
problem Financial systems and DeFi ecosystems are vulnerable to quantum computing threats.
method Post-Quantum Secure Federated DeFi framework using lattice-based FHE.
result End-to-end homomorphic computation enables inter-bank collaboration.
A collaborative machine teaching method that improves learner performance with privacy and efficiency.
problem Improving learner performance with distributed teachers while maintaining privacy and scalability.
method Formulates collaborative teaching as a consensus and privacy-preserving optimization process to minimize teaching risk.
result The proposed method delivers significantly more accurate teaching results with high speed compared to non-collaborative MINLP-based super teaching.
Rubin LSST DESC uses AI/ML for dark energy research.
problem Challenges in uncertainty quantification and model robustness for AI/ML in DESC.
method Bayesian inference, physics-informed methods, validation frameworks, active learning.
result AI/ML methods are essential but require rigorous evaluation and governance.
Partner-aware algorithms improve AI collaboration in multi-agent settings.
problem Improving AI cooperation in teams with shared rewards.
method Proposed Partner-Aware strategy extending Upper Confidence Bound for decentralized MAB.
result Achieves logarithmic regret in collaborative decision-making.
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.
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 …
Enhances student diversity in collaborative learning.
problem Student homogenization in large groups.
method Random routing, diverse feature sets, and random subgroup imitation.
result Significantly outperforms state-of-the-art approaches.
Efficiently trains autoencoders for collaborative filtering on large datasets.
problem Training autoencoders on large, sparse implicit feedback datasets.
method Mini-batch based negative sampling for large-scale training.
result Shows improved performance compared to state-of-the-art baseline models.
Solvents can induce helical knots in simulated biopolymer tubes.
problem Understanding how solvents influence the folding of biopolymers.
method Computer simulations using morphometric solvation techniques.
result Solvents can induce complex helical structures, including knots.
Enhances financial analysis with multi-agent collaboration.
problem Limited use of AI-agent collaboration in financial research.
method Proposes a multi-agent system for financial investment research.
result Multi-agent system outperforms single-agent models.
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-…
A recipe recommendation system suggests missing ingredients using collaborative filtering.
problem Encouraging healthy diets through personalized ingredient suggestions.
method Item-based collaborative filtering applied to a sparse dataset of recipes.
result Best method achieves a recall@10 of circa 40%.
Paper studies collaboration in multi-armed bandits with limited interaction.
problem Identifying the best arm collaboratively with limited communication.
method Developed techniques to quantify and prove round-speedup tradeoffs.
result Almost tight round-speedup tradeoffs for distributed exploration.
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.
Decentralized learning of personalized models and collaboration graphs without central coordination.
problem Training personalized models and collaboration graphs in a decentralized manner without a central coordinator.
method Alternates between training models given the graph and updating the graph given the models, using peer-to-peer exchanges.
result Communication-efficient approach that avoids exchanging personal data, with benefits demonstrated on synthetic and real datasets.
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 study the collaborative PAC learning problem recently proposed in Blum et al.~\cite{BHPQ17}, in which we have k 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…
This paper advances theory on the process of collaboration between entities and its implications on the quality of services, information, and/or products (SIPs) that the collaborating entities provide to each other. It investigates the scenario of outsourced IS projects (such as custom software development) where the e…
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.
Develops NFCF to reduce gender bias in social media recommendation systems.
problem Reduces gender bias in collaborative filtering systems on social media data.
method Pre-training and fine-tuning neural collaborative filtering with bias correction techniques.
result Achieves better performance and fairness in gender de-biased recommendations.
Collaborative filtering (CF) and content-based filtering (CBF) have widely been used in information filtering applications. Both approaches have their strengths and weaknesses which is why researchers have developed hybrid systems. This paper proposes a novel approach to unify CF and CBF in a probabilistic framework, n…