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.
Data science teams collaborate extensively, using various tools and stakeholders.
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…
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-…
We study a recent model of collaborative PAC learning where players with 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…
Game theory models incentivizes honesty in collaborative learning among competitors.
This work proposes a collaborative multi-head attention layer to reduce model size without sacrificing accuracy.
This work advances collaborative decision making by combining human and AI strengths in uncertainty quantification.
Optimal algorithm found for collaborative learning in bandits with optimal regret bounds.
Collaborative filtering (CF) has been successfully employed by many modern recommender systems. Conventional CF-based methods use the user-item interaction data as the sole information source to recommend items to users. However, CF-based methods are known for suffering from cold start problems and data sparsity proble…
Improved product recommendations using deep learning.
Partner-aware algorithms improve AI collaboration in multi-agent settings.
Develops NFCF to reduce gender bias in social media recommendation systems.
There is much empirical evidence that item-item collaborative filtering works well in practice. Motivated to understand this, we provide a framework to design and analyze various recommendation algorithms. The setup amounts to online binary matrix completion, where at each time a random user requests a recommendation a…
Defense against user shilling attacks in collaborative filtering using edge reweighting.
In this work, we define a collaborative and privacy-preserving machine teaching paradigm with multiple distributed teachers. We focus on consensus super teaching. It aims at organizing distributed teachers to jointly select a compact while informative training subset from data hosted by the teachers to make a learner l…
New algorithms balance collaboration and adversarial behavior in linear bandits.
A novel federated learning framework resolves structural misalignment in model fusion.
The boom of deep learning induced many industries and academies to introduce machine learning based approaches into their concern, competitively. However, existing machine learning frameworks are limited to sufficiently fulfill the collaboration and management for both data and models. We proposed NSML, a machine learn…
This study optimizes model averaging for personalized collaborative learning.
JPS improves joint policies for multi-agent collaboration in imperfect information games.
In this paper, we propose a listwise approach for constructing user-specific rankings in recommendation systems in a collaborative fashion. We contrast the listwise approach to previous pointwise and pairwise approaches, which are based on treating either each rating or each pairwise comparison as an independent instan…
Backdoor attacks are possible in feature-partitioned collaborative learning, even without labels.
Framework allows organizations to collaborate on learning tasks securely.
New algorithms reduce communication costs in collaborative learning.
Optimizes resource allocation for distributed parameter estimation in sensor networks.
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…
In this paper, we apply a mini-batch based negative sampling method to efficiently train a latent factor autoencoder model on large scale and sparse data for implicit feedback collaborative filtering. We compare our work against a state-of-the-art baseline model on different experimental datasets and show that this met…
Novel method reduces radiomic data annotation needs.
Benchopt automates machine learning benchmarking across languages and hardware.
Split learning improves deep learning in healthcare by sharing data.
Shifu2 discovers advisor-advisee relationships in collaboration networks.
To select the best algorithm for a new problem is an expensive and difficult task. However, there are automatic solutions to address this problem: using Metalearning, which takes advantage of problem characteristics (i.e. metafeatures), one is able to predict the relative performance of algorithms. In the Collaborative…
Proposes a new method to handle data heterogeneity in causal inference.
New model improves recommendation systems by analyzing user-item interactions.
Revisits neural collaborative filtering vs. matrix factorization, showing dot product superiority.
Proposes MANE for multi-view network embedding, improving node representations.
In recent years, deep neural networks have yielded state-of-the-art performance on several tasks. Although some recent works have focused on combining deep learning with recommendation, we highlight three issues of existing models. First, these models cannot work on both explicit and implicit feedback, since the networ…
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.…
This is a mainly expository article honoring my recently deceased friend and collaborator Krzysztof Galicki who died after a tragic hiking accident. I give a review of our recent work in Sasakian geometry. A few new results are also presented.
New algorithm reduces regret in multi-agent bandits with malicious agents.
Collaborative learning allows participants to jointly train a model without data sharing. To update the model parameters, the central server broadcasts model parameters to the clients, and the clients send updating directions such as gradients to the server. While data do not leave a client device, the communicated gra…
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…
Flexible priors improve VAE-based CF models for better user preference modeling.
Despite the prevalence of collaborative filtering in recommendation systems, there has been little theoretical development on why and how well it works, especially in the "online" setting, where items are recommended to users over time. We address this theoretical gap by introducing a model for online recommendation sy…
RGCF improves collaborative filtering by refining graph convolution embeddings.
Previous work on recommender systems mainly focus on fitting the ratings provided by users. However, the response patterns, i.e., some items are rated while others not, are generally ignored. We argue that failing to observe such response patterns can lead to biased parameter estimation and sub-optimal model performanc…
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…
Study on collaborative vs. non-collaborative online and bandit convex optimization.