An intrinsic geometric failure of kernel-embedding-based descriptions is identified, whose enclosing balls can admit arbitrarily dispersed distributions and produce infinite worst-case costs.
This paper introduces a data-driven Distributionally Robust Optimization (DRO) framework to identify risk-averse Hamiltonian cycles in non-stationary stochastic networks subject to severe probabilistic uncertainty. Rather than relying on static nominal travel times, which suffer heavily from the optimizer's curse, we c...
Аббасов Зафар Думан, M. Toleubek, T. Z. Yelemes· Bulletin of Manash Kozybayev...· 0 citations
This work studies robust score estimation under Wasserstein perturbations of a reference distribution of Ornstein--Uhlenbeck diffusion and characterize how finite data, intrinsic dimension, and distribution shift affect the robustness of score-based diffusion models.
Wei Luo, N. K. Chada, Shi-Jie Zhang et al.· 0 citations
Decisions that weigh several reward signals against each other require the joint distribution of the return vector. Categorical critics scale exponentially in the reward dimension, and quantiles have no canonical multivariate analogue. Multivariate distributional critics therefore represent each return distribution by...
The probability smoothing problem seeks estimators that assign positive probability to all categories, including those unobserved in a finite sample. In our previous work, we established that the estimator derived from distributionally robust optimization (DRO) with a $q$-norm ambiguity set ($q$-DRO) satisfies the axio...
Kota Kurihara, Yuya Yamakawa, Yoichi Izunaga· 0 citations
Distribution regression seeks to learn mappings from probability distributions to response variables and has emerged as a unifying framework for kernel methods, multi-instance learning, and set-valued learning. Despite its success, kernel-based distribution regression remains computationally expensive and sensitive to...
Bilevel data selection is a fundamental task with numerous applications in machine learning and statistics. A common strategy for tackling this problem is to relax the original bilevel combinatorial optimization into a continuous one. However, existing methods, including 0-1 relaxation and probabilistic relaxation, sti...
Shi-Zhan Cai, Qi-Xin Zhang, Si-Yuan Ma et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.