paper-with-me

Papers

MMD-OPT : Maximum Mean Discrepancy Based Sample Efficient Collision Risk Minimization for Autonomous Driving

2024-12-12 · Basant Sharma, Arun Kumar Singh

We propose MMD-OPT: a sample-efficient approach for minimizing the risk of collision under arbitrary prediction distribution of the dynamic obstacles. MMD-OPT is based on embedding distribution in Reproducing Kernel Hilbert Space (RKHS) and the associated Maximum Mean Discrepancy (MMD). We show how these two concepts can be used to define a sample efficient surrogate for collision risk estimate. We perform extensive simulations to validate the effectiveness of MMD-OPT on both synthetic and real-world datasets. Importantly, we show that trajectory optimization with our MMD-based collision risk surrogate leads to safer trajectories at low sample regimes than popular alternatives based on Conditional Value at Risk (CVaR).

📄 PDF Abstract BibTeX arXiv:2412.09121

Code (0)

등록된 구현이 없습니다.

Tasks

Autonomous Driving

Similar Papers 제목 키워드 기반

Strictly Proper Kernel Scoring Rules and Divergences with an Application to Kernel Two-Sample Hypothesis Testing

2017-04-09 · Hamed Masnadi-Shirazi

We study strictly proper scoring rules in the Reproducing Kernel Hilbert Space. We propose a general Kernel Scoring rule and associated Kernel Divergence. We consider conditions under which the Kernel Score is strictly p…

One-class classifierscoring ruleTwo-sample testing

(De)-regularized Maximum Mean Discrepancy Gradient Flow

2024-09-23 · Zonghao Chen, Aratrika Mustafi, Pierre Glaser, Anna Korba 외

We introduce a (de)-regularization of the Maximum Mean Discrepancy (DrMMD) and its Wasserstein gradient flow. Existing gradient flows that transport samples from source distribution to target distribution with only targe…

Permutation Complexity Bound on Out-Sample Error

2010-12-01 · NeurIPS 2010 12 · Malik Magdon-Ismail

We define a data dependent permutation complexity for a hypothesis set \math{\hset}, which is similar to a Rademacher complexity or maximum discrepancy. The permutation complexity is based like the maximum discrepancy on…

Math

XFlowMP: Task-Conditioned Motion Fields for Generative Robot Planning with Schrodinger Bridges

2025-11-02 · Khang Nguyen, Minh Nhat Vu arxiv

Generative robotic motion planning requires not only the synthesis of smooth and collision-free trajectories but also feasibility across diverse tasks and dynamic constraints. Prior planning methods, both traditional and…

Motion Planning

Detecting Machine-Generated Texts by Multi-Population Aware Optimization for Maximum Mean Discrepancy

2024-02-25 · Shuhai Zhang, Yiliao Song, Jiahao Yang, Yuanqing Li 외

Large language models (LLMs) such as ChatGPT have exhibited remarkable performance in generating human-like texts. However, machine-generated texts (MGTs) may carry critical risks, such as plagiarism issues, misleading i…

HallucinationSentence