惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Y
Y Combinator Blog
V
V2EX
Jina AI
Jina AI
爱范儿
爱范儿
M
MIT News - Artificial intelligence
量子位
L
LangChain Blog
Google DeepMind News
Google DeepMind News
酷 壳 – CoolShell
酷 壳 – CoolShell
罗磊的独立博客
腾讯CDC
MongoDB | Blog
MongoDB | Blog
P
Proofpoint News Feed
宝玉的分享
宝玉的分享
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Last Week in AI
Last Week in AI
H
Hackread – Cybersecurity News, Data Breaches, AI and More
F
Fortinet All Blogs
The GitHub Blog
The GitHub Blog
Engineering at Meta
Engineering at Meta
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Vercel News
Vercel News
T
The Blog of Author Tim Ferriss

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
A correlation inequality for random points in a hypercube...
Royi Jacobovic, Or Zuk · 2022-09-01 · via math.ST updates on arXiv.org

Let $\prec$ be the product order on $\mathbb{R}^k$ and assume that $X_1,X_2,\ldots,X_n$ ($n\geq3$) are i.i.d. random vectors distributed uniformly in the unit hypercube $[0,1]^k$. Let $S$ be the (random) set of vectors in $\mathbb{R}^k$ that $\prec$-dominate all vectors in $\{X_3,..,X_n\}$, and let $W$ be the set of vectors that are not $\prec$-dominated by any vector in $\{X_3,..,X_n\}$. The main result of this work is the correlation inequality \begin{equation*} P(X_2\in W|X_1\in W)\leq P(X_2\in W|X_1\in S)\,. \end{equation*} For every $1\leq i \leq n$ let $E_{i,n}$ be the event that $X_i$ is not $\prec$-dominated by any of the other vectors in $\{X_1,\ldots,X_n\}$. The main inequality yields an elementary proof for the result that the events $E_{1,n}$ and $E_{2,n}$ are asymptotically independent as $n\to\infty$. Furthermore, we derive a related combinatorial formula for the variance of the sum $\sum_{i=1}^n \textbf{1}_{E_{i,n}}$, i.e. the number of maxima under the product order $\prec$, and show that certain linear functionals of partial sums of $\{\textbf{1}_{E_{i,n}};1\leq i\leq n\}$ are asymptotically normal as $n\to\infty$.