English
Related papers

Related papers: The HulC: Confidence Regions from Convex Hulls

200 papers

Confidence intervals for the means of multiple normal populations are often based on a hierarchical normal model. While commonly used interval procedures based on such a model have the nominal coverage rate on average across a population of…

Methodology · Statistics 2016-12-28 Chaoyu Yu , Peter D. Hoff

The upper bounds on the coverage probabilities of the confidence regions based on blockwise empirical likelihood [Kitamura (1997)] and nonstandard expansive empirical likelihood [Nordman et al. (2013)] methods for time series data are…

Methodology · Statistics 2014-08-01 Xianyang Zhang , Xiaofeng Shao

This paper proposes a new method for finding the highest predictive density set or region, within the heteroscedastic regression framework. This framework enjoys the property that any highest predictive density set is a translation of some…

Methodology · Statistics 2025-04-09 Max Sampson , Kung-Sik Chan

Conformal prediction delivers prediction intervals with distribution-free coverage, but its intervals can look overconfident in regions where the model is extrapolating, because standard conformal scores do not explicitly represent…

Machine Learning · Statistics 2026-03-10 Luben M. C. Cabezas , Sabina J. Sloman , Bruno M. Resende , Fanyi Wu , Michele Caprio , Rafael Izbicki

Conformal prediction provides finite-sample, distribution-free coverage under exchangeability, but standard constructions may lack robustness in the presence of outliers or heavy tails. We propose a robust conformal method based on a…

Statistics Theory · Mathematics 2026-04-21 Alejandro Cholaquidis , Emilien Joly , Leonardo Moreno

Subsampling is a general statistical method developed in the 1990s aimed at estimating the sampling distribution of a statistic $\hat \theta _n$ in order to conduct nonparametric inference such as the construction of confidence intervals…

Statistics Theory · Mathematics 2021-12-14 Dimitris N. Politis

This paper addresses the clustering of data in the hyperdimensional computing (HDC) domain. In prior work, an HDC-based clustering framework, referred to as HDCluster, has been proposed. However, the performance of the existing HDCluster is…

Machine Learning · Computer Science 2024-04-19 Lulu Ge , Keshab K. Parhi

We introduce Reflective Hamiltonian Monte Carlo (ReHMC), an HMC-based algorithm, to sample from a log-concave distribution restricted to a convex body. We prove that, starting from a warm start, the walk mixes to a log-concave target…

Machine Learning · Computer Science 2023-03-30 Apostolos Chalkis , Vissarion Fisikopoulos , Marios Papachristou , Elias Tsigaridas

Adaptive regularization with cubics (ARC) is an algorithm for unconstrained, non-convex optimization. Akin to the popular trust-region method, its iterations can be thought of as approximate, safe-guarded Newton steps. For cost functions…

Optimization and Control · Mathematics 2020-05-19 Naman Agarwal , Nicolas Boumal , Brian Bullins , Coralia Cartis

Uncertainty quantification for estimation through stochastic optimization solutions in an online setting has gained popularity recently. This paper introduces a novel inference method focused on constructing confidence intervals with…

Machine Learning · Statistics 2026-03-24 Wanrong Zhu , Zhipeng Lou , Ziyang Wei , Wei Biao Wu

Constructing valid confidence sets is a crucial task in statistical inference, yet traditional methods often face challenges when dealing with complex models or limited observed sample sizes. These challenges are frequently encountered in…

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

Computational Geometry · Computer Science 2025-06-30 Ivor van der Hoog , Eva Rotenberg , Daniel Rutschmann

In this work we deal with the problem of support estimation under shape restrictions. The shape restriction we deal with is an extension of the notion of convexity named alpha-convexity. Instead of assuming, as in the convex case, the…

Methodology · Statistics 2011-05-31 Beatriz Pateiro-López , Alberto Rodríguez Casal

We introduce the notion of heterogeneous calibration that applies a post-hoc model-agnostic transformation to model outputs for improving AUC performance on binary classification tasks. We consider overconfident models, whose performance is…

Machine Learning · Statistics 2022-02-11 David Durfee , Aman Gupta , Kinjal Basu

In the setting of high-dimensional linear models with Gaussian noise, we investigate the possibility of confidence statements connected to model selection. Although there exist numerous procedures for adaptive point estimation, the…

Statistics Theory · Mathematics 2009-10-07 Angelika Rohde , Lutz Duembgen

Adaptively collected data has become ubiquitous within modern practice. However, even seemingly benign adaptive sampling schemes can introduce severe biases, rendering traditional statistical inference tools inapplicable. This can be…

Statistics Theory · Mathematics 2025-12-02 Wei Fan , Kevin Tan , Yuting Wei

We study statistical inference and distributionally robust solution methods for stochastic optimization problems, focusing on confidence intervals for optimal values and solutions that achieve exact coverage asymptotically. We develop a…

Machine Learning · Statistics 2018-07-03 John Duchi , Peter Glynn , Hongseok Namkoong

The bootstrap is a method for estimating the distribution of an estimator or test statistic by re-sampling the data or a model estimated from the data. Under conditions that hold in a wide variety of econometric applications, the bootstrap…

Econometrics · Economics 2018-09-12 Joel L. Horowitz

In assessing prediction accuracy of multivariable prediction models, optimism corrections are essential for preventing biased results. However, in most published papers of clinical prediction models, the point estimates of the prediction…

The non-convexity and intractability of distributionally robust chance constraints make them challenging to cope with. From a data-driven perspective, we propose formulating it as a robust optimization problem to ensure that the…

Optimization and Control · Mathematics 2023-06-23 Zhiping Chen , Wentao Ma , Bingbing Ji
‹ Prev 1 4 5 6 7 8 10 Next ›