paper-with-me

Papers

Minimum Sliced Distance Estimation in a Class of Nonregular Econometric Models

2024-12-07 · Yanqin Fan, Hyeonseok Park

This paper proposes minimum sliced distance estimation in structural econometric models with possibly parameter-dependent supports. In contrast to likelihood-based estimation, we show that under mild regularity conditions, the minimum sliced distance estimator is asymptotically normally distributed leading to simple inference regardless of the presence/absence of parameter dependent supports. We illustrate the performance of our estimator on an auction model.

📄 PDF Abstract BibTeX arXiv:2412.05621

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

An Introduction to Sliced Optimal Transport

2025-08-17 · Khai Nguyen arxiv

Sliced Optimal Transport (SOT) is a rapidly developing branch of optimal transport (OT) that exploits the tractability of one-dimensional OT problems. By combining tools from OT, integral geometry, and computational stat…

Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distances

2022-10-17 · Sloan Nietert, Ritwik Sadhu, Ziv Goldfeld, Kengo Kato

Sliced Wasserstein distances preserve properties of classic Wasserstein distances while being more scalable for computation and estimation in high dimensions. The goal of this work is to quantify this scalability from th…

Numerical Integration

Orthogonal Estimation of Wasserstein Distances

2019-03-09 · Mark Rowland, Jiri Hron, Yunhao Tang, Krzysztof Choromanski 외

Wasserstein distances are increasingly used in a wide variety of applications in machine learning. Sliced Wasserstein distances form an important subclass which may be estimated efficiently through one-dimensional sortin…

BIG-bench Machine Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Sliced Multi-Marginal Optimal Transport

2021-02-14 · samuel cohen, Alexander Terenin, Yannik Pitcan, Brandon Amos 외

Multi-marginal optimal transport enables one to compare multiple probability measures, which increasingly finds application in multi-task learning problems. One practical limitation of multi-marginal transport is computa…

Density EstimationMulti-Task Learning

Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions

2026-06-29 · Christophe Vauthier, Quentin Mérigot, Anna Korba arxiv

The Sliced Wasserstein (SW) distance has emerged as a computationally attractive alternative to the Wasserstein distance by leveraging one-dimensional optimal transport along random projections. Standard estimators of th…

Federated Learning