Results 41 to 50 of about 992,707 (136)
Continuous mapping approach to the asymptotics of $U$- and $V$-statistics [PDF]
We derive a new representation for $U$- and $V$-statistics. Using this representation, the asymptotic distribution of $U$- and $V$-statistics can be derived by a direct application of the Continuous Mapping theorem.
Beutner, Eric, Zähle, Henryk
core +2 more sources
ABSTRACT We study a random walk on the Lie algebra sl2(Fp)$$ {\mathfrak{sl}}_2\left({\mathbf{F}}_p\right) $$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we analyze the limiting distribution of the random walk and the speed at which it
Urban Jezernik, Matevž Miščič
wiley +1 more source
A U-statistic estimator for the variance of resampling-based error estimators [PDF]
We revisit resampling procedures for error estimation in binary classification in terms of U-statistics. In particular, we exploit the fact that the error rate estimator involving all learning-testing splits is a U-statistic.
Boulesteix, Anne-Laure +3 more
core +3 more sources
Multidimensional Screening With Precise Seller Information
A multi‐product monopolist faces a buyer who is privately informed about his valuations for the goods. As is well known, optimal mechanisms are in general complicated, while simple mechanisms—such as pure bundling or separate sales—can be far from optimal and do not admit clear‐cut comparisons.
Mira Frick, Ryota Iijima, Yuhta Ishii
wiley +1 more source
Estimating operator norms using covering nets [PDF]
We present several polynomial- and quasipolynomial-time approximation schemes for a large class of generalized operator norms. Special cases include the $2\rightarrow q$ norm of matrices for $q>2$, the support function of the set of separable quantum ...
Brandao, Fernando G. S. L. +1 more
core +1 more source
Statistical Complexity of Quantum Learning
The statistical performance of quantum learning is investigated as a function of the number of training data N$N$, and of the number of copies available for each quantum state in the training and testing data sets, respectively S$S$ and V$V$. Indeed, the biggest difference in quantum learning comes from the destructive nature of quantum measurements ...
Leonardo Banchi +3 more
wiley +1 more source
Sequential Monte Carlo smoothing for general state space hidden Markov models
Computing smoothing distributions, the distributions of one or more states conditional on past, present, and future observations is a recurring problem when operating on general hidden Markov models.
Douc, Randal +4 more
core +2 more sources
Policy learning with new treatments
I study the problem of a decision maker choosing a policy that allocates treatment to a heterogeneous population on the basis of experimental data that includes only a subset of possible treatment values. The effects of new treatments are partially identified by shape restrictions on treatment response.
Samuel D. Higbee
wiley +1 more source
U-statistics of Ornstein-Uhlenbeck branching particle system [PDF]
We consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in $\Rd$ and undergoing a binary, supercritical branching with a constant rate $\lambda>0$.
Adamczak, Radosław, Miłoś, Piotr
core

