English
Related papers

Related papers: Concentration Bounds for the Collision Estimator

200 papers

We study robust testing and estimation of discrete distributions in the strong contamination model. We consider both the "centralized setting" and the "distributed setting with information constraints" including communication and local…

Information Theory · Computer Science 2021-04-23 Jayadev Acharya , Ziteng Sun , Huanyu Zhang

Improving Importance Sampling estimators for rare event probabilities requires sharp approx- imations of the optimal density leading to a nearly zero-variance estimator. This paper presents a new way to handle the estimation of the…

Statistics Theory · Mathematics 2014-01-15 Virgile Caron

We consider the group testing problem, in the case where the items are defective independently but with non-constant probability. We introduce and analyse an algorithm to solve this problem by grouping items together appropriately. We give…

Information Theory · Computer Science 2015-02-04 Tom Kealy , Oliver Johnson , Robert Piechocki

Random testing approaches work by generating inputs at random, or by selecting inputs randomly from some pre-defined operational profile. One long-standing question that arises in this and other testing contexts is as follows: When can we…

Software Engineering · Computer Science 2024-06-25 Neil Walkinshaw , Michael Foster , Jose Miguel Rojas , Robert M Hierons

We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…

Dynamical Systems · Mathematics 2020-01-08 Olli Hella , Mikko Stenlund

In this work, the concept of QCD dynamical entropy is extended to heavy ion systems. This notion of entropy can be understood as a relative entropy and can also be used to estimate the initial entropy density in ultra-relativistic heavy ion…

High Energy Physics - Phenomenology · Physics 2025-07-15 G. S. Ramos , L. S. Moriggi , M. V. T. Machado

In ultrarelativistic heavy-ion experiments, one estimates the centrality of a collision by using a single observable, say $n$, typically given by the transverse energy or the number of tracks observed in a dedicated detector. The…

We prove a Bennett-type concentration bound for suprema of empirical processes based on sampling without replacement and a corresponding bound in the case of an arbitrary Hoeffding statistics. We improve on the previous results of such…

Probability · Mathematics 2023-01-10 Bartłomiej Polaczyk

This paper proposes a new framework based on joint statistical models for evaluating risks of automated vehicles in a naturalistic driving environment. The previous studies on the Accelerated Evaluation for automated vehicles are extended…

Systems and Control · Computer Science 2017-07-18 Zhiyuan Huang , Henry Lam , Ding Zhao

Improving Importance Sampling estimators for rare event probabilities requires sharp approximations of conditional densities. This is achieved for events E_{n}:=(f(X_{1})+...+f(X_{n}))\inA_{n} where the summands are i.i.d. and E_{n} is a…

Probability · Mathematics 2012-02-08 Michel Broniatowski , Virgile Caron

Entropy rate of sequential data-streams naturally quantifies the complexity of the generative process. Thus entropy rate fluctuations could be used as a tool to recognize dynamical perturbations in signal sources, and could potentially be…

Information Theory · Computer Science 2014-03-24 Ishanu Chattopadhyay , Hod Lipson

Computing equilibrium concentrations of molecular complexes is generally analytically intractable and requires numerical approaches. In this work we focus on the polymer-monomer level, where indivisible molecules (monomers) combine to form…

Data Structures and Algorithms · Computer Science 2025-08-25 Hamidreza Akef , Minki Hhan , David Soloveichik

Event-by-event analysis of heavy-ion collision events is an important tool for the study of the QCD phase boundary and formation of a quark-gluon plasma. A universal feature of phase boundaries is the appearance of increased fluctuations of…

High Energy Physics - Phenomenology · Physics 2007-05-23 T. A. Trainor

New Vapnik and Chervonenkis type concentration inequalities are derived for the empirical distribution of an independent random sample. Focus is on the maximal deviation over classes of Borel sets within a low probability region. The…

Statistics Theory · Mathematics 2022-04-26 Stéphane Lhaut , Anne Sabourin , Johan Segers

Randomized controlled trials generate experimental variation that can credibly identify causal effects, but often suffer from limited scale, while observational datasets are large, but often violate desired identification assumptions. To…

Econometrics · Economics 2023-12-27 George Z. Gui

We prove results about uniform convergence of densities in the free central limit theorem without assumptions of boundedness on the support.

Operator Algebras · Mathematics 2011-04-11 John D. Williams

This paper considers a finite sample perspective on the problem of identifying an LTI system from a finite set of possible systems using trajectory data. To this end, we use the maximum likelihood estimator to identify the true system and…

Systems and Control · Electrical Eng. & Systems 2024-12-03 Nicolas Chatzikiriakos , Andrea Iannelli

This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…

Optimization and Control · Mathematics 2025-01-17 Jiaqi Lei , Sanjay Mehrotra

Perception of obstacles remains a critical safety concern for autonomous vehicles. Real-world collisions have shown that the autonomy faults leading to fatal collisions originate from obstacle existence detection. Open source autonomous…

Robotics · Computer Science 2024-01-11 Ayoosh Bansal , Hunmin Kim , Simon Yu , Bo Li , Naira Hovakimyan , Marco Caccamo , Lui Sha

Convergence bounds are one of the main tools to obtain information on the performance of a distributed machine learning task, before running the task itself. In this work, we perform a set of experiments to assess to which extent, and in…

Networking and Internet Architecture · Computer Science 2022-12-06 Francesco Malandrino , Carla Fabiana Chiasserini