English
Related papers

Related papers: Some remarks on the Sudakov minoration

200 papers

We derive two lower bounds on entanglement of formation for arbitrary mixed Gaussian states by two distinct methods. To achieve the first one we use a local measurement procedure derived by Giedke et al [Quantum Inf. and Comp. vol.1, 79…

Quantum Physics · Physics 2016-09-08 G. Rigolin , C. O. Escobar

For a stochastic process with state space some Polish space, this paper gives sufficient conditions on the initial and conditional distributions for the joint law to satisfy Gaussian concentration inequalities, transportation inequalities…

Probability · Mathematics 2013-09-19 Gordon Blower , François Bolley

This paper develops a new direct approach to approximating suprema of general empirical processes by a sequence of suprema of Gaussian processes, without taking the route of approximating whole empirical processes in the sup-norm. We prove…

Probability · Mathematics 2014-08-19 Victor Chernozhukov , Denis Chetverikov , Kengo Kato

We define the local empirical process, based on $n$ i.i.d. random vectors in dimension $d$, in the neighborhood of the boundary of a fixed set. Under natural conditions on the shrinking neighborhood, we show that, for these local empirical…

Statistics Theory · Mathematics 2011-04-22 John H. J. Einmahl , Estáte V. Khmaladze

Markov models lie at the interface between statistical independence in a probability distribution and graph separation properties. We review model selection and estimation in directed and undirected Markov models with Gaussian…

Methodology · Statistics 2020-09-03 Irene Córdoba , Concha Bielza , Pedro Larrañaga

The prior independent framework for algorithm design considers how well an algorithm that does not know the distribution of its inputs approximates the expected performance of the optimal algorithm for this distribution. This paper gives a…

Computer Science and Game Theory · Computer Science 2021-07-13 Jason Hartline , Aleck Johnsen

This paper deals with the convergence time analysis of a class of fixed-time stable systems with the aim to provide a new non-conservative upper bound for its settling time. Our contribution is fourfold. First, we revisit the well-known…

Optimization and Control · Mathematics 2019-07-23 R. Aldana-López , D. Gómez-Gutiérrez , E. Jiménez-Rodríguez , J. D. Sánchez-Torres , M. Defoort

We establish new conditions for obtaining uniform bounds on the moments of discrete-time stochastic processes. Our results require a weak negative drift criterion along with a state-dependent restriction on the sizes of the one-step jumps…

Probability · Mathematics 2022-06-02 Arnab Ganguly , Debasish Chatterjee

When estimating the directed information between two jointly stationary Markov processes, it is typically assumed that the recipient of the directed information is itself Markov of the same order as the joint process. While this assumption…

Information Theory · Computer Science 2019-05-02 Gabriel Schamberg , Todd P. Coleman

We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…

Numerical Analysis · Mathematics 2025-06-13 Lars Diening , Johannes Storn

In this paper we study the exponential decay of posterior probability of a set of sources and conditioning by rare sources for both uniform and general prior distributions of sources. The decay rate is determined by $L$-divergence and rare…

Statistics Theory · Mathematics 2007-06-13 M. Grendar

We study the self-normalized concentration of vector-valued stochastic processes. We focus on bounds for "sub-$\psi$" processes, a well-known and quite general class of process that encompasses a wide variety of well-known tail conditions…

Probability · Mathematics 2026-02-06 Ben Chugg , Aaditya Ramdas

Loss functions with non-isolated minima have emerged in several machine learning problems, creating a gap between theory and practice. In this paper, we formulate a new type of local convexity condition that is suitable to describe the…

Machine Learning · Computer Science 2022-05-31 Taehee Ko , Xiantao Li

We show that the maximizing point and the supremum of the standardized uniform empirical process converge in distribution. Here, the limit variable (Z, Y ) has independent components. Moreover, Z attains the values zero and one with equal…

Probability · Mathematics 2025-12-22 Dietmar Ferger

In a probabilistic graphical model on a set of variables $V$, the Markov blanket of a random vector $B$ is the minimal set of variables conditioned to which $B$ is independent from the remaining of the variables $V \backslash B$. We…

Probability · Mathematics 2019-03-11 Victor Cohen , Axel Parmentier

We study the small deviation probabilities of a family of very smooth self-similar Gaussian processes. The canonical process from the family has the same scaling property as standard Brownian motion and plays an important role in the study…

Probability · Mathematics 2011-08-18 Frank Aurzada , Fuchang Gao , Thomas Kühn , Wenbo V. Li , Qi-Man Shao

We consider the Markov chain approximations for singular stable-like processes. First we obtain properties of some Markov chains. Then we construct the approximating Markov chains and give a necessary condition for weak convergence of these…

Probability · Mathematics 2012-10-11 Fangjun Xu

We show bounds on tail probabilities for quadratic forms in sub-gaussian non-necessarily independent random variables. Our main tool will be estimates of the Luxemburg norms of such forms. This will allow us to formulate the above-mentioned…

Probability · Mathematics 2020-08-14 Krzysztof Zajkowski

We study the representation of stationary Gaussian Markov random fields as factors of i.i.d. processes, with a focus on their approximation by finitely dependent distributions. Our model is a Gaussian field on $\mathbf{Z}^d$ such that the…

Probability · Mathematics 2026-05-20 Corentin Faipeur

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

Artificial Intelligence · Computer Science 2009-11-30 Matthias Horbach , Christoph Weidenbach
‹ Prev 1 4 5 6 7 8 10 Next ›