English
Related papers

Related papers: Maximum value of the standardized log of odds rati…

200 papers

Linear regression is one of the most prevalent techniques in machine learning, however, it is also common to use linear regression for its \emph{explanatory} capabilities rather than label prediction. Ordinary Least Squares (OLS) is often…

Data Structures and Algorithms · Computer Science 2017-08-23 Or Sheffet

Two sequential estimators are proposed for the odds p/(1-p) and log odds log(p/(1-p)) respectively, using independent Bernoulli random variables with parameter p as inputs. The estimators are unbiased, and guarantee that the variance of the…

Statistics Theory · Mathematics 2025-01-07 Luis Mendo

In nonlinear deterministic parameter estimation, the maximum likelihood estimator (MLE) is unable to attain the Cramer-Rao lower bound at low and medium signal-to-noise ratios (SNR) due the threshold and ambiguity phenomena. In order to…

Applications · Statistics 2015-06-19 Achraf Mallat , Sinan Gezici , Davide Dardari , Christophe Craeye , Luc Vandendorpe

We present an algorithm for the statistical learning setting with a bounded exp-concave loss in $d$ dimensions that obtains excess risk $O(d \log(1/\delta)/n)$ with probability at least $1 - \delta$. The core technique is to boost the…

Machine Learning · Computer Science 2016-10-17 Nishant A. Mehta

The probability of benefit is a valuable and important measure of treatment effect, which has advantages over the average treatment effect. Particularly for an ordinal outcome, it has a better interpretation and can make apparent different…

Methodology · Statistics 2023-05-19 Erin E Gabriel , Michael C Sachs , Andreas Kryger Jensen

A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…

Information Theory · Computer Science 2018-05-11 Amichai Painsky , Gregory W. Wornell

We present a new finite-time analysis of the estimation error of the Ordinary Least Squares (OLS) estimator for stable linear time-invariant systems. We characterize the number of observed samples (the length of the observed trajectory)…

Statistics Theory · Mathematics 2020-03-27 Yassir Jedra , Alexandre Proutiere

Consider a setting with $N$ independent individuals, each with an unknown parameter, $p_i \in [0, 1]$ drawn from some unknown distribution $P^\star$. After observing the outcomes of $t$ independent Bernoulli trials, i.e., $X_i \sim…

Statistics Theory · Mathematics 2019-02-13 Ramya Korlakai Vinayak , Weihao Kong , Gregory Valiant , Sham M. Kakade

Let $M_n=\max \left(X_1, X_2, \ldots, X_n \right)$ denote the partial maximum of an independent and identically distributed skew-normal random sequence. In this paper, the rate of uniform convergence of skew-normal extremes is derived. It…

Probability · Mathematics 2023-02-20 Qian Xiong , Zuoxiang Peng , Saralees Nadarajah

The standard loss functions used in the literature on probabilistic prediction are the log loss function, the Brier loss function, and the spherical loss function; however, any computable proper loss function can be used for comparison of…

Machine Learning · Computer Science 2015-06-30 Vladimir Vovk

We prove uniform estimates for the expected value of averages of order statistics of bivariate functions in terms of their largest values by a direct analysis. As an application, uniform estimates for the expected value of averages of order…

Probability · Mathematics 2018-10-03 Richard Lechner , Markus Passenbrunner , Joscha Prochno

This paper is concerned with normal approximation under relaxed moment conditions using Stein's method. We obtain the explicit rates of convergence in the central limit theorem for (i) nonlinear statistics with finite absolute moment of…

Probability · Mathematics 2021-06-16 Nguyen Tien Dung

In this paper we consider a group sequentially monitored trial on a survival endpoint, monitored using a weighted log-rank (WLR) statistic with deterministic weight function. We introduce a summary statistic in the form of a weighted…

Methodology · Statistics 2017-11-30 Grant Izmirlian

This paper shows that the logarithm of the epsilon-error capacity (average error probability) for n uses of a discrete memoryless channel is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2 log n +…

Information Theory · Computer Science 2013-10-25 Marco Tomamichel , Vincent Y. F. Tan

Calibration is a vital aspect of the performance of risk prediction models, but research in the context of ordinal outcomes is scarce. This study compared calibration measures for risk models predicting a discrete ordinal outcome, and…

Meta-analysis allows rigorous aggregation of estimates and uncertainty across multiple studies. When a given study reports multiple estimates, such as log odds ratios (ORs) or log relative risks (RRs) across exposure groups, accounting for…

Methodology · Statistics 2024-07-02 Alexander Johnson-Vázquez , Alexander W. Hsu , Peng Zheng , Aleksandr Aravkin

Most classification methods provide either a prediction of class membership or an assessment of class membership probability. In the case of two-group classification the predicted probability can be described as "risk" of belonging to a…

Machine Learning · Statistics 2011-10-28 Yizhar Toren

Uniform and nonuniform Berry--Esseen (BE) bounds of optimal orders on the closeness to normality for general abstract nonlinear statistics are given, which are then used to obtain optimal bounds on the rate of convergence in the delta…

Statistics Theory · Mathematics 2017-01-17 Iosif Pinelis , Raymond Molzon

We study a localized notion of uniform convergence known as an "optimistic rate" (Panchenko 2002; Srebro et al. 2010) for linear regression with Gaussian data. Our refined analysis avoids the hidden constant and logarithmic factor in…

Machine Learning · Statistics 2021-12-09 Lijia Zhou , Frederic Koehler , Danica J. Sutherland , Nathan Srebro

Under correlation-type conditions, we derive an upper bound of order $(\log n)/n$ for the average Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. The result is based on improved…

Probability · Mathematics 2019-06-24 S. G. Bobkov , G. P. Chistyakov , F. Götze