相关论文: A minimax approach to duality for linear distribut…

Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…

This paper revisits the question of duality between minimum variance estimation and optimal control first described for the linear Gaussian case in the celebrated paper of Kalman and Bucy. A duality result is established for nonlinear…

We propose Log-Averaged Mirror Prox (LAMP), a linear-space primal-dual method for large-scale optimal transport. LAMP implements primal mirror prox updates by tracking an averaged dual sequence, reducing storage complexity from ${O}(nm)$ to…

We study the extension problem on the Sierpinski Gasket ($SG$). In the first part we consider minimizing the functional $\mathcal{E}_{\lambda}(f) = \mathcal{E}(f,f) + \lambda \int f^2 d \mu$ with prescribed values at a finite set of points…

In this article, we introduce a novel discrepancy called the maximum variance discrepancy for the purpose of measuring the difference between two distributions in Hilbert spaces that cannot be found via the maximum mean discrepancy. We also…

This paper studies distributional model risk in marginal problems, where each marginal measure is assumed to lie in a Wasserstein ball centered at a fixed reference measure with a given radius. Theoretically, we establish several…

The main aim of this article is to give an exposition of weak convergence, Prohorov theorem and Prohorov spaces. In this context we study the relationship between Levy distance $\ell(F, G)$ between two distribution functions $F$ and $G$ and…

We investigate existence of dual optimizers in one-dimensional martingale optimal transport problems. While [BNT16] established such existence for weak (quasi-sure) duality, [BHP13] showed existence for the natural stronger pointwise…

Diversity maximization is an important geometric optimization problem with many applications in recommender systems, machine learning or search engines among others. A typical diversification problem is as follows: Given a finite metric…

Given a determinate (multivariate) probability measure $\mu$, we characterize Gaussian mixtures $\nu\_\phi$ which minimize the Wasserstein distance $W\_2(\mu,\nu\_\phi)$ to $\mu$ when the mixing probability measure $\phi$ on the parameters…

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

We develop and analyze $M$-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variational characterization of $f$-divergences, which allows the…

The limiting behavior of stochastic evolution processes with small noise intensity $\epsilon$ is investigated in distribution-based approach. Let $\mu^{\epsilon}$ be stationary measure for stochastic process $X^{\epsilon}$ with small…

This paper studies duality and optimality conditions for general convex stochastic optimization problems. The main result gives sufficient conditions for the absence of a duality gap and the existence of dual solutions in a locally convex…

We consider the problem of testing hypotheses on the copula density from $n$ bi-dimensional observations. We wish to test the null hypothesis characterized by a parametric class against a composite nonparametric alternative. Each density…

We study a random matching problem on closed compact $2$-dimensional Riemannian manifolds (with respect to the squared Riemannian distance), with samples of random points whose common law is absolutely continuous with respect to the volume…

We extend in two ways the standard Karush-Kuhn-Tucker optimality conditions to problems with a convex objective, convex functional constraints, and the extra requirement that some of the variables must be integral. While the standard…

Approximating a convex function by a polyhedral function that has a limited number of facets is a fundamental problem with applications in various fields, from mitigating the curse of dimensionality in optimal control to bi-level…

Under the null hypothesis, the marginal probability of the positive response is symmetric at any specified correlated coefficient, and the discordance probability is also symmetric to the positive response probability. The marginal…

We consider the fundamental problem of estimating a discrete distribution on a domain of size $K$ with high probability in Kullback-Leibler divergence. We provide upper and lower bounds on the minimax estimation rate, which show that the…