English
Related papers

Related papers: The HulC: Confidence Regions from Convex Hulls

200 papers

A current strand of research in high-dimensional statistics deals with robustifying the available methodology with respect to deviations from the pervasive light-tail assumptions. In this paper we consider a linear mean regression model…

Statistics Theory · Mathematics 2025-02-06 Philipp Hermann , Hajo Holzmann

This paper derives new asymptotic results for the adaptive LASSO estimator in cointegrating regressions, allowing for uncertainty about whether the regressors are exact unit root processes. We study model selection probabilities, estimator…

Econometrics · Economics 2026-03-13 Karsten Reichold , Ulrike Schneider

We develop adaptive estimation and inference methods for high-dimensional Gaussian copula regression that achieve the same performance without the knowledge of the marginal transformations as that for high-dimensional linear regression.…

Methodology · Statistics 2015-12-09 T. Tony Cai , Linjun Zhang

Nonparametric regression and regression-discontinuity designs suffer from smoothing bias that distorts conventional confidence intervals. Solutions based on robust bias correction (RBC) are now central to the economist's toolbox. In this…

The curse of dimensionality presents a pervasive challenge in optimization problems, with exponential expansion of the search space rapidly causing traditional algorithms to become inefficient or infeasible. An adaptive sampling strategy is…

Numerical Analysis · Mathematics 2025-11-18 Julian Soltes

The Highly-Adaptive-LASSO Targeted Minimum Loss Estimator (HAL-TMLE) is an efficient plug-in estimator of a pathwise differentiable parameter in a statistical model that at minimal (and possibly only) assumes that the sectional variation…

Statistics Theory · Mathematics 2020-02-12 Weixin Cai , Mark van der Laan

It is common when using cross-section or panel data to assign each observation to a cluster and allow for arbitrary patterns of heteroskedasticity and correlation within clusters. For regression models, there are many ways to make…

Econometrics · Economics 2026-04-03 James G. MacKinnon

Recently, motivated by the rapid increase of the data size in various applications, Monemizadeh [APPROX'23] and Driemel, Monemizadeh, Oh, Staals, and Woodruff [SoCG'25] studied geometric problems in the setting where the only access to the…

Computational Geometry · Computer Science 2026-03-24 T. Schibler , J. Xue , J. Zhu

An important disadvantage of the h-index is that typically it cannot take into account the specific field of research of a researcher. Usually sample point estimates of the average and median h-index values for the various fields are…

Digital Libraries · Computer Science 2017-08-29 C. Malesios , S. Psarakis

While deep learning offers tremendous promise for scientific and medical imaging, any failures and hallucinations (predictions that do not coincide with reality) are hard to pinpoint and can have serious downstream consequences. Uncertainty…

Image and Video Processing · Electrical Eng. & Systems 2026-05-26 Cassandra Tong Ye , Shamus Li , Tyler King , Kristina Monakhova

We propose a new framework of variance-reduced Hamiltonian Monte Carlo (HMC) methods for sampling from an $L$-smooth and $m$-strongly log-concave distribution, based on a unified formulation of biased and unbiased variance reduction…

Machine Learning · Computer Science 2021-02-10 Zhengmian Hu , Feihu Huang , Heng Huang

The convex hull cheapest insertion heuristic produces good solutions to the Euclidean Traveling Salesperson Problem, but it has never been extended to the non-Euclidean problem. This paper uses multidimensional scaling to first project the…

Artificial Intelligence · Computer Science 2024-07-04 Mithun Goutham , Meghna Menon , Sarah Garrow , Stephanie Stockar

We study confidence intervals based on hard-thresholding, soft-thresholding, and adaptive soft-thresholding in a linear regression model where the number of regressors $k$ may depend on and diverge with sample size $n$. In addition to the…

Statistics Theory · Mathematics 2018-10-08 Ulrike Schneider

Existing convergence of distributed optimization methods in non-Euclidean geometries typically rely on kernel assumptions: (i) global Lipschitz smoothness and (ii) bi-convexity of the associated Bregman divergence function. Unfortunately,…

Optimization and Control · Mathematics 2026-03-16 Junwen Qiu , Ziyang Zeng , Leilei Mei , Junyu Zhang

Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and…

Computational Geometry · Computer Science 2022-06-24 Kevin Christopher VanHorn , Murat Can Çobanoğlu

In this paper, we consider adaptive estimation of an unknown planar compact, convex set from noisy measurements of its support function on a uniform grid. Both the problem of estimating the support function at a point and that of estimating…

Statistics Theory · Mathematics 2015-08-18 Tony Cai , Adityanand Guntuboyina , Yuting Wei

An open question in \emph{Imprecise Probabilistic Machine Learning} is how to empirically derive a credal region (i.e., a closed and convex family of probabilities on the output space) from the available data, without any prior knowledge or…

Machine Learning · Statistics 2025-01-29 Michele Caprio , David Stutz , Shuo Li , Arnaud Doucet

Multi-arm bandit experimental designs are increasingly being adopted over standard randomized trials due to their potential to improve outcomes for study participants, enable faster identification of the best-performing options, and/or…

Methodology · Statistics 2025-06-04 Brian M Cho , Aurélien Bibaut , Nathan Kallus

This paper develops a uniformly valid and asymptotically nonconservative test based on projection for a class of shape restrictions. The key insight we exploit is that these restrictions form convex cones, a simple and yet elegant structure…

Econometrics · Economics 2021-09-21 Zheng Fang , Juwon Seo

Traditional nearest points methods use all the samples in an image set to construct a single convex or affine hull model for classification. However, strong artificial features and noisy data may be generated from combinations of training…

Computer Vision and Pattern Recognition · Computer Science 2014-08-27 Shaokang Chen , Arnold Wiliem , Conrad Sanderson , Brian C. Lovell
‹ Prev 1 3 4 5 6 7 10 Next ›