English
Related papers

Related papers: Learning to Match

200 papers

In the era of big data, many big organizations are integrating machine learning into their work pipelines to facilitate data analysis. However, the performance of their trained models is often restricted by limited and imbalanced data…

Machine Learning · Computer Science 2024-03-05 Cheng Chen , Jiaying Zhou , Jie Ding , Yi Zhou

We study the problem of pure exploration in matching markets under uncertain preferences, where the goal is to identify a stable matching with confidence parameter $\delta$ and minimal sample complexity. Agents learn preferences via…

Computer Science and Game Theory · Computer Science 2025-09-19 Tejas Pagare , Agniv Bandyopadhyay , Sandeep Juneja

Successful human-robot teaming will require robots to adapt autonomously to a human teammate's internal state, where a critical element of such adaptation is the ability to estimate the human's workload in unknown situations. Existing…

Robotics · Computer Science 2025-07-11 Josh Bhagat Smith , Julie A. Adams

In this paper we introduce the hiring under uncertainty problem to model the questions faced by hiring committees in large enterprises and universities alike. Given a set of $n$ eligible candidates, the decision maker needs to choose the…

Data Structures and Algorithms · Computer Science 2019-05-08 Manish Raghavan , Manish Purohit , Sreenivas Gollupadi

We investigate the problem of heterogeneous task assignment in crowdsourcing markets from the point of view of the requester, who has a collection of tasks. Workers arrive online one by one, and each declare a set of feasible tasks they can…

Data Structures and Algorithms · Computer Science 2015-08-17 Sepehr Assadi , Justin Hsu , Shahin Jabbari

Networks analysis has been commonly used to study the interactions between units of complex systems. One problem of particular interest is learning the network's underlying connection pattern given a single and noisy instantiation. While…

Machine Learning · Statistics 2021-06-08 Tianxi Li , Can M. Le

We consider a combined problem of teaming and scheduling of multi-skilled employees that have to perform jobs with uncertain qualification requirements. We propose two modeling approaches that generate solutions that are robust to possible…

Optimization and Control · Mathematics 2020-11-03 Yulia Anoshkina , Marc Goerigk , Frank Meisel

The map-matching is an essential preprocessing step for most of the trajectory-based applications. Although it has been an active topic for more than two decades and, driven by the emerging applications, is still under development. There is…

Databases · Computer Science 2019-10-30 Pingfu Chao , Yehong Xu , Wen Hua , Xiaofang Zhou

The data-driven economy has led to a significant shortage of data scientists. To address this shortage, this study explores the prospects of outsourcing data analysis tasks to freelancers available on online labor markets (OLMs) by…

Computers and Society · Computer Science 2017-07-07 Michael Feldman , Frida Juldaschewa , Abraham Bernstein

Key to multitask learning is exploiting relationships between different tasks to improve prediction performance. If the relations are linear, regularization approaches can be used successfully. However, in practice assuming the tasks to be…

Machine Learning · Computer Science 2017-08-11 Carlo Ciliberto , Alessandro Rudi , Lorenzo Rosasco , Massimiliano Pontil

While the promises of Multi-Task Learning (MTL) are attractive, characterizing the conditions of its success is still an open problem in Deep Learning. Some tasks may benefit from being learned together while others may be detrimental to…

Machine Learning · Computer Science 2023-01-10 Raphael Azorin , Massimo Gallo , Alessandro Finamore , Dario Rossi , Pietro Michiardi

Two-sided matching markets describe a large class of problems wherein participants from one side of the market must be matched to those from the other side according to their preferences. In many real-world applications (e.g. content…

Computer Science and Game Theory · Computer Science 2024-10-16 Hadi Hosseini , Sanjukta Roy , Duohan Zhang

We study the problem of an organization that matches agents to objects where agents have preference rankings over objects and the organization uses algorithms to construct a ranking over objects on behalf of each agent. Our new framework…

Theoretical Economics · Economics 2025-08-12 Terence Highsmith

The challenge in the widely applicable online matching problem lies in making irrevocable assignments while there is uncertainty about future inputs. Most theoretically-grounded policies are myopic or greedy in nature. In real-world…

Machine Learning · Computer Science 2022-11-01 Mohammad Ali Alomrani , Reza Moravej , Elias B. Khalil

We study a recent model of collaborative PAC learning where $k$ players with $k$ 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…

Machine Learning · Computer Science 2018-11-01 Huy L. Nguyen , Lydia Zakynthinou

Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of collaborators, is a central problem in economics. Indeed, the growing prevalence of matching-based markets, many of which online in nature, has…

Data Structures and Algorithms · Computer Science 2024-07-09 Zhiyi Huang , Zhihao Gavin Tang , David Wajc

Meta-learning has emerged as an effective methodology to model several real-world tasks and problems due to its extraordinary effectiveness in the low-data regime. There are many scenarios ranging from the classification of rare diseases to…

Machine Learning · Computer Science 2023-12-29 Prabhat Agarwal , Shreya Singh

Overlapping clusters are common in models of many practical data-segmentation applications. Suppose we are given $n$ elements to be clustered into $k$ possibly overlapping clusters, and an oracle that can interactively answer queries of the…

Machine Learning · Computer Science 2019-10-29 Wasim Huleihel , Arya Mazumdar , Muriel Médard , Soumyabrata Pal

In this paper we study a single machine scheduling problem with the objective of minimizing the sum of completion times. Each of the given jobs is either short or long. However the processing times are initially hidden to the algorithm, but…

Data Structures and Algorithms · Computer Science 2021-05-06 Fanny Dufossé , Christoph Dürr , Noël Nadal , Denis Trystram , Óscar C. Vásquez