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

推荐订阅源

D
Docker
爱范儿
爱范儿
Vercel News
Vercel News
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Martin Fowler
Martin Fowler
博客园 - 司徒正美
大猫的无限游戏
大猫的无限游戏
酷 壳 – CoolShell
酷 壳 – CoolShell
T
Tailwind CSS Blog
Blog — PlanetScale
Blog — PlanetScale
博客园 - 【当耐特】
人人都是产品经理
人人都是产品经理
F
Fortinet All Blogs
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - Franky
T
The Blog of Author Tim Ferriss
Y
Y Combinator Blog
Recent Announcements
Recent Announcements
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Google DeepMind News
Google DeepMind News
H
Help Net Security
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
G
Google Developers 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
Vertices of the least concave majorant of Brownian motion...
Piet Groeneboom · 2010-10-30 · via math.ST updates on arXiv.org

It was shown in Groeneboom (1983) that the least concave majorant of one-sided Brownian motion without drift can be characterized by a jump process with independent increments, which is the inverse of the process of slopes of the least concave majorant. This result can be used to prove the result of Sparre Andersen (1954) that the number of vertices of the smallest concave majorant of the empirical distribution function of a sample of size n from the uniform distribution on [0,1] is asymptotically normal, with an asymptotic expectation and variance which are both of order log n. A similar (Markovian) inverse jump process was introduced in Groeneboom (1989), in an analysis of the least concave majorant of two-sided Brownian motion with a parabolic drift. This process is quite different from the process for one-sided Brownian motion without drift: the number of vertices in a (corresponding slopes) interval has an expectation proportional to the length of the interval and the variance of the number of vertices in such an interval is about half the size of the expectation, if the length of the interval tends to infinity. We prove an asymptotic normality result for the number of vertices in an increasing interval, which translates into a corresponding result for the least concave majorant of an empirical distribution function of a sample of size n, generated by a strictly concave distribution function. In this case the number of vertices is of order cube root n, and the variance is again about half the size of the asymptotic expectation. As a side result we obtain some interesting relations between the first moments of the number of vertices, the square of the location of the maximum of Brownian motion minus a parabola, the value of the maximum itself, the squared slope of the least concave majorant at zero, and the value of the least concave majorant at zero.