MALTS: Matching After Learning to Stretch

• URL: http://arxiv.org/abs/1811.07415v9
• Date: Thu, 8 Jun 2023 00:10:12 GMT
• Title: MALTS: Matching After Learning to Stretch
• Authors: Harsh Parikh, Cynthia Rudin, Alexander Volfovsky
• Abstract summary: We learn an interpretable distance metric for matching, which leads to substantially higher quality matches. Our ability to learn flexible distance metrics leads to matches that are interpretable and useful for the estimation of conditional average treatment effects.
• Score: 86.84454964051014
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a flexible framework that produces high-quality almost-exact matches for causal inference. Most prior work in matching uses ad-hoc distance metrics, often leading to poor quality matches, particularly when there are irrelevant covariates. In this work, we learn an interpretable distance metric for matching, which leads to substantially higher quality matches. The learned distance metric stretches the covariate space according to each covariate's contribution to outcome prediction: this stretching means that mismatches on important covariates carry a larger penalty than mismatches on irrelevant covariates. Our ability to learn flexible distance metrics leads to matches that are interpretable and useful for the estimation of conditional average treatment effects.

Related papers

• Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering [51.11677202873771]
  Categorical attributes with qualitative values are ubiquitous in cluster analysis of real datasets.<n>Unlike the Euclidean distance of numerical attributes, the categorical attributes lack well-defined relationships of their possible values.<n>This paper breaks the intrinsic relationship tie of attribute categories and learns customized distance metrics suitable for flexibly revealing various cluster distributions.
  arXiv  Detail & Related papers  (2025-11-12T06:57:24Z)
• Dense Match Summarization for Faster Two-view Estimation [22.238347776252333]
  We speed up robust two-view relative pose from dense correspondences.<n>We propose an efficient match summarization scheme which provides comparable accuracy to using the full set of dense matches.
  arXiv  Detail & Related papers  (2025-06-03T14:01:12Z)
• Representation Learning Preserving Ignorability and Covariate Matching for Treatment Effects [18.60804431844023]
  Estimating treatment effects from observational data is challenging due to hidden confounding. A common framework to address both hidden confounding and selection bias is missing.
  arXiv  Detail & Related papers  (2025-04-29T09:33:56Z)
• HomoMatcher: Dense Feature Matching Results with Semi-Dense Efficiency by Homography Estimation [39.48940223810725]
  Feature matching between image pairs is a fundamental problem in computer vision that drives many applications, such as SLAM. This paper concentrates on enhancing the fine-matching module in the semi-dense matching framework. We employ a lightweight and efficient homography estimation network to generate the perspective mapping between patches obtained from coarse matching.
  arXiv  Detail & Related papers  (2024-11-11T04:05:12Z)
• Semiparametric conformal prediction [79.6147286161434]
  Risk-sensitive applications require well-calibrated prediction sets over multiple, potentially correlated target variables. We treat the scores as random vectors and aim to construct the prediction set accounting for their joint correlation structure. We report desired coverage and competitive efficiency on a range of real-world regression problems.
  arXiv  Detail & Related papers  (2024-11-04T14:29:02Z)
• Learning covariate importance for matching in policy-relevant observational research [2.6361497319422176]
  We propose the Priority-Aware one-to-one Matching Algorithm (PAMA)<n>It is a semi-supervised framework that learns a covariate importance measure from a subset data of units that are paired by experts and uses it to match additional units.<n>It is applied to a real-world study of in-person schooling and COVID-19 transmission.
  arXiv  Detail & Related papers  (2024-03-19T02:24:16Z)
• Unsupervised Dense Retrieval with Relevance-Aware Contrastive Pre-Training [81.3781338418574]
  We propose relevance-aware contrastive learning. We consistently improve the SOTA unsupervised Contriever model on the BEIR and open-domain QA retrieval benchmarks. Our method can not only beat BM25 after further pre-training on the target corpus but also serves as a good few-shot learner.
  arXiv  Detail & Related papers  (2023-06-05T18:20:27Z)
• Understanding and Mitigating Spurious Correlations in Text Classification with Neighborhood Analysis [69.07674653828565]
  Machine learning models have a tendency to leverage spurious correlations that exist in the training set but may not hold true in general circumstances. In this paper, we examine the implications of spurious correlations through a novel perspective called neighborhood analysis. We propose a family of regularization methods, NFL (doN't Forget your Language) to mitigate spurious correlations in text classification.
  arXiv  Detail & Related papers  (2023-05-23T03:55:50Z)
• A Probabilistic Transformation of Distance-Based Outliers [2.1055643409860743]
  We describe a generic transformation of distance-based outlier scores into interpretable, probabilistic estimates. The transformation is ranking-stable and increases the contrast between normal and outlier data points. Our work generalizes to a wide range of distance-based outlier detection methods.
  arXiv  Detail & Related papers  (2023-05-16T14:05:30Z)
• Neural Score Matching for High-Dimensional Causal Inference [5.696039065328919]
  We develop theoretical results which motivate the use of neural networks to obtain non-trivial balancing scores of a chosen level of coarseness. We show that our method is competitive against other matching approaches on semi-synthetic high-dimensional datasets.
  arXiv  Detail & Related papers  (2022-03-01T15:36:12Z)
• Deep Probabilistic Graph Matching [72.6690550634166]
  We propose a deep learning-based graph matching framework that works for the original QAP without compromising on the matching constraints. The proposed method is evaluated on three popularly tested benchmarks (Pascal VOC, Willow Object and SPair-71k) and it outperforms all previous state-of-the-arts on all benchmarks.
  arXiv  Detail & Related papers  (2022-01-05T13:37:27Z)
• Deconfounding Scores: Feature Representations for Causal Effect Estimation with Weak Overlap [140.98628848491146]
  We introduce deconfounding scores, which induce better overlap without biasing the target of estimation. We show that deconfounding scores satisfy a zero-covariance condition that is identifiable in observed data. In particular, we show that this technique could be an attractive alternative to standard regularizations.
  arXiv  Detail & Related papers  (2021-04-12T18:50:11Z)
• dame-flame: A Python Library Providing Fast Interpretable Matching for Causal Inference [41.065018571282465]
  dame-flame is a Python package for performing matching for observational causal inference. It implements the Dynamic Almost Matching Exactly (DAME) and Fast Large-Scale Almost Matching Exactly (FLAME) algorithms.
  arXiv  Detail & Related papers  (2021-01-06T04:38:57Z)
• A Formally Robust Time Series Distance Metric [6.929025509877642]
  We propose a novel distance metric that is robust against arbitrarily "bad" contamination. We show in an empirical evaluation that the metric yields competitive classification accuracy when applied in k-Nearest Neighbor time series classification.
  arXiv  Detail & Related papers  (2020-08-18T11:28:50Z)
• Towards Certified Robustness of Distance Metric Learning [53.96113074344632]
  We advocate imposing an adversarial margin in the input space so as to improve the generalization and robustness of metric learning algorithms. We show that the enlarged margin is beneficial to the generalization ability by using the theoretical technique of algorithmic robustness.
  arXiv  Detail & Related papers  (2020-06-10T16:51:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.