English
Related papers

Related papers: A Discrepancy Bound for Deterministic Acceptance-R…

200 papers

Evaluating the performance of autonomous vehicles (AV) and their complex subsystems to high precision under naturalistic circumstances remains a challenge, especially when failure or dangerous cases are rare. Rarity does not only require an…

Machine Learning · Computer Science 2022-04-07 Mansur Arief , Zhepeng Cen , Zhenyuan Liu , Zhiyuang Huang , Henry Lam , Bo Li , Ding Zhao

We prove risk bounds for binary classification in high-dimensional settings when the sample size is allowed to be smaller than the dimensionality of the training set observations. In particular, we prove upper bounds for both 'compressive…

Statistics Theory · Mathematics 2017-09-29 Ata Kaban , Robert J. Durrant

The accuracy of camera-based object detection (CBOD) built upon deep learning is often evaluated against the real objects in frames only. However, such simplistic evaluation ignores the fact that many unimportant objects are small, distant,…

We study the problem of aligning the supports of distributions. Compared to the existing work on distribution alignment, support alignment does not require the densities to be matched. We propose symmetric support difference as a divergence…

Machine Learning · Computer Science 2022-03-18 Shangyuan Tong , Timur Garipov , Yang Zhang , Shiyu Chang , Tommi S. Jaakkola

Generation of pseudorandom numbers from different probability distributions has been studied extensively in the Monte Carlo simulation literature. Two standard generation techniques are the acceptance-rejection and inverse transformation…

Computational Finance · Quantitative Finance 2014-03-25 Nguyet Nguyen , Giray Ökten

Big data has shown its uniquely powerful ability to reveal, model, and understand driver behaviors. The amount of data affects the experiment cost and conclusions in the analysis. Insufficient data may lead to inaccurate models while…

Machine Learning · Computer Science 2017-06-26 Wenshuo Wang , Chang Liu , Ding Zhao

The Central Limit Theorem provides a foundation for inferential statistics and hypothesis testing. It describes how standardized statistics behave under repeated sampling from large populations. However, if the size of the sample (n)…

Methodology · Statistics 2026-05-19 Mike Crowhurst

Marine obstacle detection demands robust segmentation under challenging conditions, such as sun glitter, fog, and rapidly changing wave patterns. These factors degrade image quality, while the scarcity and structural repetition of marine…

Computer Vision and Pattern Recognition · Computer Science 2025-12-17 Miaohua Zhang , Mohammad Ali Armin , Xuesong Li , Sisi Liang , Lars Petersson , Changming Sun , David Ahmedt-Aristizabal , Zeeshan Hayder

Domain Randomization (DR) is known to require a significant amount of training data for good performance. We argue that this is due to DR's strategy of random data generation using a uniform distribution over simulation parameters, as a…

Computer Vision and Pattern Recognition · Computer Science 2021-08-31 Rawal Khirodkar , Kris M. Kitani

Thanks to its fine balance between model flexibility and interpretability, the nonparametric additive model has been widely used, and variable selection for this type of model has been frequently studied. However, none of the existing…

Methodology · Statistics 2022-01-10 Xiaowu Dai , Xiang Lyu , Lexin Li

We study two-sample variable selection: identifying variables that discriminate between the distributions of two sets of data vectors. Such variables help scientists understand the mechanisms behind dataset discrepancies. Although…

Machine Learning · Statistics 2025-11-06 Kensuke Mitsuzawa , Motonobu Kanagawa , Stefano Bortoli , Margherita Grossi , Paolo Papotti

Kernel methods have recently attracted resurgent interest, showing performance competitive with deep neural networks in tasks such as speech recognition. The random Fourier features map is a technique commonly used to scale up kernel…

Machine Learning · Computer Science 2018-02-01 Tri Dao , Christopher De Sa , Christopher Ré

The task of the binary classification problem is to determine which of two distributions has generated a length-$n$ test sequence. The two distributions are unknown; two training sequences of length $N$, one from each distribution, are…

Information Theory · Computer Science 2016-04-18 Dayu Huang , Sean Meyn

Diffusion generative models synthesize samples by discretizing reverse-time dynamics driven by a learned score (or denoiser). Existing convergence analyses of diffusion models typically scale at least linearly with the ambient dimension,…

Machine Learning · Computer Science 2026-01-30 Ahmad Aghapour , Erhan Bayraktar , Ziqing Zhang

Estimating some mathematical expectations from partially observed data and in particular missing outcomes is a central problem encountered in numerous fields such as transfer learning, counterfactual analysis or causal inference. Matching…

Statistics Theory · Mathematics 2025-05-01 Simon Viel , Lionel Truquet , Ikko Yamane

We study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in $d$ dimensions. We study the $A$-optimal design variant where the objective is to…

Data Structures and Algorithms · Computer Science 2018-07-18 Aleksandar Nikolov , Mohit Singh , Uthaipon Tao Tantipongpipat

Sampling from diffusion models can be treated as solving the corresponding ordinary differential equations (ODEs), with the aim of obtaining an accurate solution with as few number of function evaluations (NFE) as possible. Recently,…

Computer Vision and Pattern Recognition · Computer Science 2024-09-30 Zhenyu Zhou , Defang Chen , Can Wang , Chun Chen

We investigate color superconducting phase at high density in the extended Nambu--Jona-Lasinio model for the two flavor quarks. Because of the non-renormalizability of the model, physical observables may depend on the regularization…

High Energy Physics - Phenomenology · Physics 2010-04-21 T. Fujihara , D. Kimura , T. Inagaki , A. Kvinikhidze

In this work we discuss the problem of selecting suitable approximators from families of parameterized elementary functions that are known to be dense in a Hilbert space of functions. We consider and analyze published procedures, both…

Numerical Analysis · Computer Science 2016-09-01 Alexander N. Gorban , Ivan Yu. Tyukin , Danil V. Prokhorov , Konstantin I. Sofeikov

This paper proposes and studies a detection technique for adversarial scenarios (dubbed deterministic detection). This technique provides an alternative detection methodology in case the usual stochastic methods are not applicable: this can…

Machine Learning · Computer Science 2017-11-08 Kristiaan Pelckmans