A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
We present a new PAC-Bayesian generalization bound. Standard bounds contain a $\sqrt{L_n \cdot \KL/n}$ complexity term which dominates unless Ln, the empirical error of the learning algorithm's randomized predictions, vanishes. We manage to replace Ln by a term which vanishes in many more situations, essentially …
We obtain a Bernstein theorem for special Lagrangian graphs in n-dimensional complex space for arbitrary n only assuming bounded slope, but no quantitative restriction.
We obtain a gradient estimate for the Gauss maps from complete spacelike constant mean curvature hypersurfaces in Minkowski space into the hyperbolic space. As applications, we prove a Bernstein theorem which says that if the image of the Gauss map is bounded from one side, then the spacelike constant mean curvature hy…
A weighted area estimate for entire graphs with bounded weighted mean curvature in Gauss space is given by a simple proof. Bernstein type theorems for self shrinkers (\cite {wa}) as well as for graphic λ-hypersurfaces (\cite{ chwe2}) follow immediately as consequences.
Using Schauder's theory for linear elliptic partial differential equations in two independent variables and fundamental estimates for univalent mappings due to E. Heinz we establish an upper bound of the Gaussian curvature of two-dimensional minimal surface graphs in R^n. This leads us to a theorem of Bernstein-Liouvil…
We give improved constants for data dependent and variance sensitive confidence bounds, called empirical Bernstein bounds, and extend these inequalities to hold uniformly over classes of functionswhose growth function is polynomial in the sample size n. The bounds lead us to consider sample variance penalization, a nov…
We give tight concentration bounds for mixtures of martingales that are simultaneously uniform over (a) mixture distributions, in a PAC-Bayes sense; and (b) all finite times. These bounds are proved in terms of the martingale variance, extending classical Bernstein inequalities, and sharpening and simplifying prior wor…
In this paper we study nonconvex penalization using Bernstein functions. Since the Bernstein function is concave and nonsmooth at the origin, it can induce a class of nonconvex functions for high-dimensional sparse estimation problems. We derive a threshold function based on the Bernstein penalty and give its mathemati…
We prove semi-empirical concentration inequalities for random variables which are given as possibly nonlinear functions of independent random variables. These inequalities describe concentration of random variable in terms of the data/distribution-dependent Efron-Stein (ES) estimate of its variance and they do not requ…
In this paper we study nonconvex penalization using Bernstein functions whose first-order derivatives are completely monotone. The Bernstein function can induce a class of nonconvex penalty functions for high-dimensional sparse estimation problems. We derive a thresholding function based on the Bernstein penalty and di…
New concentration inequality for U-statistics of Markov chains.
problem Proving a concentration inequality for U-statistics of order two in uniformly ergodic Markov chains.
method Inductive analysis using martingale techniques, uniform ergodicity, Nummelin splitting, and Bernstein's inequality.
result Recovery of convergence rate for U-statistics of independent random variables and canonical kernels, with improved results for dependent kernels.
We obtain a Bernstein type result for entire two dimensional minimal graphs in R4, which extends a previous one due to L. Ni. Moreover, we provide a characterization for complex analytic curves.
In this paper, we prove some Bernstein type results for n-dimensional minimal Lagrangian graphs in quaternion Euclidean space Hn≅R4n. In particular, we also get a new Bernstein Theorem for special Lagrangian graphs in Cn
The paper develops concentration inequalities for structured random data, extending beyond independent terms.
problem Developing concentration inequalities for structured weighted sums of random data, including tensors and matrix-valued data.
method The paper develops Hoeffding and Bernstein bounds for structured weighted sums under exchangeability, extending beyond the classical framework of independent terms.
result The paper develops a sharper concentration bound for combinatorial sums of matrix arrays.
We present Bernstein-Sato identities for scalar-, spinor- and differential form-valued distribution kernels on Euclidean space associated to conformal symmetry breaking operators. The associated Bernstein-Sato operators lead to partially new formulae for conformal symmetry breaking differential operators on functions, …
For entire spacelike stationary 2-dimensional graphs in Minkowski spaces, we establish Bernstein type theorems under specific boundedness assumptions either on the W-function or on the total (Gaussian) curvature. These conclusions imply the classical Bernstein theorem for minimal surfaces in 3-dimensional Euclidean spa…
We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration inequality, proved using the same method. Together these constitute a finite-time versi…