相关论文: Optimizing stakes in simultaneous bets

Stochastic transitivity is central for rank aggregation based on pairwise comparison data. The existing models, including the Thurstone, Bradley-Terry (BT), and nonparametric BT models, adopt a strong notion of stochastic transitivity,…

We prove that $\beta_p(I(G)) = \beta_{p,p+r}(I(G))$ for skew Ferrers graph $G$, where $p:=\pd(I(G))$ and $r:=\reg(I(G))$. As a consequence, we confirm that Ene, Herzog and Hibi's conjecture is true for the Betti numbers in the last columm…

Let $\{X_i(t):\, t\in S\subset \R^d \}_{i=1,2,\ldots,n}$ be independent copies of a stationary centered Gaussian field with almost surely smooth sample paths. In this paper, we are interested in the conjunction probability defined as $\PP…

Let p_n denote the persistence probability that the first n iterated partial sums of integrable, zero-mean, i.i.d. random variables X_k, are negative. We show that p_n is bounded above up to universal constant by the square root of the…

Hypothesis testing via e-variables can be framed as a sequential betting game, where a player each round picks an e-variable. A good player's strategy results in an effective statistical test that rejects the null hypothesis as soon as…

We observe the actions of a $K$ sub-sample of $N$ individuals up to time $t$ for some large $K<N$. We model the relationships of individuals by i.i.d. Bernoulli($p$)-random variables, where $p\in (0,1]$ is an unknown parameter. The rate of…

We design the weights in consensus algorithms with spatially correlated random topologies. These arise with: 1) networks with spatially correlated random link failures and 2) networks with randomized averaging protocols. We show that the…

We study a simple random process in which vertices of a connected graph reach consensus through pairwise interactions. We compute outcome probabilities, which do not depend on the graph structure, and consider the expected time until a…

The original Kelly criterion provides a strategy to maximize the long-term growth of winnings in a sequence of simple Bernoulli bets with an edge, that is, when the expected return on each bet is positive. The objective of this work is to…

Stochastic saddle point (SSP) problems are, in general, less studied compared to stochastic minimization problems. However, SSP problems emerge from machine learning (adversarial training, e.g., GAN, AUC maximization), statistics (robust…

Let $ A_n $ be an $n \times n$ random matrix with i.i.d Bernoulli($p$) entries. For a fixed positive integer $\beta$, suppose $p$ satisfies $$ \frac{ \log(n) }{ n } \le p \le c_\beta $$ where $c_\beta \in ( 0, 1/2 )$ is a…

Given a real symmetric positive semi-definite matrix E, and an approximation S that is a sum of n independent matrix-valued random variables, we present bounds on the relative error in S due to randomization. The bounds do not depend on the…

We establish a generic symmetrization property for dependent random variables $\{x_{t}\}_{t=1}^{n}$ on $\mathbb{R}^{p}$, where $p$ $>>$ $n$ is allowed. We link $\mathbb{E}\psi (\max_{1\leq i\leq p}|1/n\sum_{t=1}^{n}(x_{i,t}$ $-$…

We consider the binomial distribution with parameters $n$ and $x$, and show that the sum of the squared probabilities is a log-convex function of $x$. This completes the proof of a conjecture formulated in 2014. Applications to R\'{e}nyi…

Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple…

Choose $N$ unoriented lines through the origin of ${\bf R}^{d+1}$. The sum of the angles between these lines is conjectured to be maximized if the lines are distributed as evenly as possible amongst the coordinate axes of some orthonormal…

Fix two words over the binary alphabet $\{0,1\}$, and generate iid Bernoulli$(p)$ bits until one of the words occurs in sequence. This setup, commonly known as Penney's ante, was popularized by Conway, who found (in unpublished work) a…

We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…

We consider $N$ Bernoulli random variables, which are independent conditional on a common random factor determining their probability distribution. We show that certain expected functionals of the proportion $L_N$ of variables in a given…

Consider a sum $S_n=v_i\varepsilon_1+\cdots+v_n\varepsilon_{n}$, where $(v_i)^{n}_{i=1}$ are non-zero vectors in $\mathbb{R}^{d}$ and $(\varepsilon_i)^{n}_{i=1}$ are independent Rademacher random variables (i.e.,…