Related papers: Functional convex order for the scaled McKean-Vlas…
Let $X_1,\dots, X_n$ be i.i.d. random variables sampled from a normal distribution $N(\mu,\Sigma)$ in ${\mathbb R}^d$ with unknown parameter $\theta=(\mu,\Sigma)\in \Theta:={\mathbb R}^d\times {\mathcal C}_+^d,$ where ${\mathcal C}_+^d$ is…
Directionally convex ($dcx$) ordering is a tool for comparison of dependence structure of random vectors that also takes into account the variability of the marginal distributions. When extended to random fields it concerns comparison of…
In a recent paper, Bubeck, Lee, and Singh introduced a new first order method for minimizing smooth strongly convex functions. Their geometric descent algorithm, largely inspired by the ellipsoid method, enjoys the optimal linear rate of…
This paper considers projection and convolution operations for integrally convex functions, which constitute a fundamental function class in discrete convex analysis. It is shown that the class of integrally convex functions is stable under…
In this paper we introduce and study a new sequence of positive linear operators acting on function spaces defined on a convex compact subset. Their construction depends on a given Markov operator, a positive real number and a sequence of…
Let $F$ be a class of functions on a probability space $(\Omega,\mu)$ and let $X_1,...,X_k$ be independent random variables distributed according to $\mu$. We establish high probability tail estimates of the form $\sup_{f \in F} |\{i :…
We give two different definitions of what it means for a matrix-valued function to be log concave, guided by similar notions in complex differential geometry. After discussing a few simple examples, we proceed to develop some of the basic…
This work concerns the nonlinear filtering problem of multiscale McKean-Vlasov stochastic systems where the whole systems depend on distributions of fast components. First of all, we prove that the slow component of the original system…
The Steklov function $\mu_f(\cdot,t)$ is defined to average a continuous function $f$ at each point of its domain by using a window of size given by $t>0$. It has traditionally been used to approximate $f$ smoothly with small values of $t$.…
By investigating McKean-Vlasov SDEs, the order preservation and positive correlation are characterized for nonlinear Fokker-Planck equations. The main results recover the corresponding criteria on these properties established in [3, 5] for…
It has been recently discovered that a convex function can be determined by its slopes and its infimum value, provided this latter is finite. The result was extended to nonconvex functions by replacing the infimum value by the set of all…
We introduce an algorithm which, given probabilities $\mu \leq_{\text{cx}} \nu$ in convex order and defined on a separable Banach space $B$, constructs finitely-supported approximations $\mu_n \to \mu, \nu_n\to \nu$ which are in convex…
In this article we study multivariate continuous-time autoregressive moving-average (MCARMA) processes with values in convex cones. More specifically, we introduce matrix-valued MCARMA processes with L\'evy noise and present necessary and…
We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled…
First-order methods underpin most large-scale learning algorithms, yet their classical convergence guarantees hinge on carefully scheduled step-sizes that depend on the total horizon $T$, which is rarely known in advance. The Schedule-Free…
Two optimization algorithms are proposed for solving a stochastic programming problem for which the objective function is given in the form of the expectation of convex functions and the constraint set is defined by the intersection of…
We provide algorithms for computing a Lyapunov function for a class of systems where the state trajectories are constrained to evolve within a closed convex set. The dynamical systems that we consider comprise a differential equation which…
The proposal and study of dependent prior processes has been a major research focus in the recent Bayesian nonparametric literature. In this paper, we introduce a flexible class of dependent nonparametric priors, investigate their…
We obtain operator concavity (convexity) of some functions of two or three variables by using perspectives of regular operator mappings of one or several variables. As an application, we obtain, for $ 0<p < 1,$ concavity, respectively…
Given noisy data, function estimation is considered when the unknown function is known apriori to consist of a small number of regions where the function is either convex or concave. When the regions are known apriori, the estimate is…