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

推荐订阅源

MongoDB | Blog
MongoDB | Blog
B
Blog
Y
Y Combinator Blog
大猫的无限游戏
大猫的无限游戏
aimingoo的专栏
aimingoo的专栏
B
Blog RSS Feed
博客园 - Franky
V
V2EX
IT之家
IT之家
WordPress大学
WordPress大学
博客园 - 三生石上(FineUI控件)
J
Java Code Geeks
F
Fortinet All Blogs
I
InfoQ
云风的 BLOG
云风的 BLOG
腾讯CDC
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
N
Netflix TechBlog - Medium
宝玉的分享
宝玉的分享
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
P
Proofpoint News Feed
Microsoft Security Blog
Microsoft Security Blog

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
Improvement of two Hungarian bivariate theorems
2009-06-22 · via math.ST updates on arXiv.org

We introduce a new technique to establish Hungarian multivariate theorems. In this article we apply this technique to the strong approximation bivariate theorems of the uniform empirical process. It improves the Komlos, Major and Tusnády (1975) result, as well as our own (1998). More precisely, we show that the error in the approximation of the uniform bivariate $n$-empirical process by a bivariate Brownian bridge is of order $n^{-1/2}(log (nab))^{3/2}$ on the rectangle $[0,a]x[0,b]$, $0 <a, b <1$, and that the error in the approximation of the uniform univariate $n$-empirical process by a Kiefer process is of order $n^{-1/2}(log (na))^{3/2}$ on the interval $[0,a]$, $0 < a < 1$. In both cases, the global error bound is therefore of order $n^{-1/2}(log (n))^{3/2}$. Previously, from the 1975 article of Komlos, Major and Tusnády, the global error bound was of order $n^{-1/2}(log (n))^{2}$, and from our 1998 article, the local error bounds were of order $n^{-1/2}(log (nab))^{2}$ or $n^{-1/2}(log (na))^{2}$. We think that, in the d-variate case, the global error bound between the uniform d-variate $n$-empirical process and the associated Gaussian process is of order $n^{-1/2}(log (n))^{(d+1)/2}$, and that this result is optimal. The new feature of this article is to identify martingales in the error terms and to apply to them an exponential inequality. The idea is to bound of the compensator of the error term, instead of bounding of the error term itself.