English
Related papers

Related papers: Experimental Design for Matching

200 papers

This paper traces the strong relations between experimental design and control, such as the use of optimal inputs to obtain precise parameter estimation in dynamical systems and the introduction of suitably designed perturbations in…

Optimization and Control · Mathematics 2008-03-03 Luc Pronzato

Classical deterministic optimal control problems assume full information about the controlled process. The theory of control for general partially-observable processes is powerful, but the methods are computationally expensive and typically…

Optimization and Control · Mathematics 2024-08-02 Dongping Qi , Adam Dhillon , Alexander Vladimirsky

Machine learning models trained on uncurated datasets can often end up adversely affecting inputs belonging to underrepresented groups. To address this issue, we consider the problem of adaptively constructing training sets which allow us…

Machine Learning · Computer Science 2021-07-21 Shubhanshu Shekhar , Greg Fields , Mohammad Ghavamzadeh , Tara Javidi

Randomized sampling based algorithms are widely used in robot motion planning due to the problem's intractability, and are experimentally effective on a wide range of problem instances. Most variants bias their sampling using various…

The efficacy of robust optimization spans a variety of settings with uncertainties bounded in predetermined sets. In many applications, uncertainties are affected by decisions and cannot be modeled with current frameworks. This paper takes…

Optimization and Control · Mathematics 2018-03-29 Omid Nohadani , Kartikey Sharma

Matching algorithms are used routinely to match donors to recipients for solid organs transplantation, for the assignment of medical residents to hospitals, record linkage in databases, scheduling jobs on machines, network switching, online…

Data Structures and Algorithms · Computer Science 2020-01-09 David García-Soriano , Francesco Bonchi

We study mechanism design when a designer repeatedly uses a fixed mechanism to interact with strategic agents who learn from observing their allocations. We introduce a static framework, calibrated mechanism design, requiring mechanisms to…

Theoretical Economics · Economics 2026-02-19 Laura Doval , Alex Smolin

In the classical context of robotic mapping and localization, map matching is typically defined as the task of finding a rigid transformation (i.e., 3DOF rotation/translation on the 2D moving plane) that aligns the query and reference maps…

Robotics · Computer Science 2016-09-09 Kanji Tanaka

We study the competition for partners in two-sided matching markets with heterogeneous agent preferences, with a focus on how the equilibrium outcomes depend on the connectivity in the market. We model random partially connected markets,…

Computer Science and Game Theory · Computer Science 2023-01-12 Yash Kanoria , Seungki Min , Pengyu Qian

The hematopoietic system has a highly regulated and complex structure in which cells are organized to successfully create and maintain new blood cells. Feedback regulation is crucial to tightly control this system, but the specific…

Strategy-proofness is a fundamental desideratum in mechanism design, ensuring truthful reporting and robust participation. Stability is another central requirement in matching markets, widely adopted in applications such as school choice…

Computer Science and Game Theory · Computer Science 2026-05-06 Zhaohong Sun , Makoto Yokoo

Models of physical systems are used to explain and predict experimental results and observations. When students encounter discrepancies between the actual and expected behavior of a system, they revise their models to include the newly…

Physics Education · Physics 2022-07-06 Laura Ríos , Benjamin Pollard , Dimitri R. Dounas-Frazer , H. J. Lewandowski

Machine learning systems appear stochastic but are deterministically random, as seeded pseudorandom number generators produce identical realisations across repeated executions. Standard evaluation practice typically treats runs across…

Machine Learning · Computer Science 2026-02-03 Udit Sharma

Matching is a commonly used causal inference study design in observational studies. Through matching on measured confounders between different treatment groups, valid randomization inferences can be conducted under the no unmeasured…

Methodology · Statistics 2024-09-20 Jeffrey Zhang , Siyu Heng

An urban planner might design the spatial layout of transportation amenities so as to improve accessibility for underserved communities -- a fairness objective. However, implementing such a design might trigger processes of neighborhood…

Multiagent Systems · Computer Science 2024-02-12 J. Carlos Martínez Mori , Zhanzhan Zhao

We propose a novel model-based approach for constructing optimal designs with complex blocking structures and network effects, for application in agricultural field experiments. The potential interference among treatments applied to…

Methodology · Statistics 2021-08-25 Vasiliki Koutra , Steven G. Gilmour , Ben M. Parker , Andrew Mead

Robotic performance emerges from the coupling of body and controller, yet it remains unclear when morphology-control co-design is necessary. We present a unified framework that embeds morphology and control parameters within a single neural…

Neural and Evolutionary Computing · Computer Science 2025-10-10 Yi Zhang , Yue Xie , Tao Sun , Fumiya Iida

When managing wide-area networks, network architects must decide how to balance multiple conflicting metrics, and ensure fair allocations to competing traffic while prioritizing critical traffic. The state of practice poses challenges since…

Programming Languages · Computer Science 2022-07-05 Yanjun Wang , Zixuan Li , Chuan Jiang , Xiaokang Qiu , Sanjay G. Rao

In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…

Artificial Intelligence · Computer Science 2011-10-12 J. Culberson , Y. Gao

Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and…

Programming Languages · Computer Science 2012-06-28 Francesco Versaci , Keshav Pingali
‹ Prev 1 4 5 6 7 8 10 Next ›