English
Related papers

Related papers: Nearly Minimax One-Sided Mixture-Based Sequential …

200 papers

Given a random sample from a distribution with density function that depends on an unknown parameter $\theta$, we are interested in accurately estimating the true parametric density function at a future observation from the same…

Statistics Theory · Mathematics 2009-09-29 Mihaela Aslan

We study the recursion-theoretic complexity of Positive Almost-Sure Termination ($\mathsf{PAST}$) in an imperative programming language with rational variables, bounded nondeterministic choice, and discrete probabilistic choice. A program…

Programming Languages · Computer Science 2023-10-30 Rupak Majumdar , V. R. Sathiyanarayana

This paper studies the problem of selecting a minimum-size set of input nodes to guarantee stability of a networked system in the presence of uncertainties and time delays. Current approaches to input selection in networked dynamical…

Optimization and Control · Mathematics 2017-12-13 Zhipeng Liu , Yao Long , Andrew Clark , Phillip Lee , Linda Bushnell , Daniel Kirschen , Radha Poovendran

The chase procedure is a fundamental algorithmic tool in databases that allows us to reason with constraints, such as existential rules, with a plethora of applications. It takes as input a database and a set of constraints, and iteratively…

Databases · Computer Science 2023-03-24 Marco Calautti , Mostafa Milani , Andreas Pieris

Optimal balance is a non-asymptotic numerical method to compute a point on the slow manifold for certain two-scale dynamical systems. It works by solving a modified version of the system as a boundary value problem in time, where the…

Dynamical Systems · Mathematics 2022-12-13 G. Tuba Masur , Haidar Mohamad , Marcel Oliver

The standard theory of optimal stopping is based on the idealised assumption that the underlying process is essentially known. In this paper, we drop this restriction and study data-driven optimal stopping for a general diffusion process,…

Statistics Theory · Mathematics 2023-12-12 Sören Christensen , Niklas Dexheimer , Claudia Strauch

We consider the fundamental problem of estimating a discrete distribution on a domain of size $K$ with high probability in Kullback-Leibler divergence. We provide upper and lower bounds on the minimax estimation rate, which show that the…

Machine Learning · Statistics 2026-02-23 Dirk van der Hoeven , Julia Olkhovskaia , Tim van Erven

We investigate minimax testing for detecting local signals or linear combinations of such signals when only indirect data is available. Naturally, in the presence of noise, signals that are too small cannot be reliably detected. In a…

Statistics Theory · Mathematics 2023-02-21 Markus Pohlmann , Frank Werner , Axel Munk

A fixed-confidence, finite-sample problem of active hypothesis testing arises in many safety-critical applications. Situated in the context of sequential hypothesis testing, this paper studies the effect of hypothesis elimination on the…

Machine Learning · Computer Science 2026-05-05 Ziyuan Lin , Hoang Ngoc Nguyen , Jie Xu , Ivan Ruchkin

Permutation tests are widely used in statistics, providing a finite-sample guarantee on the type I error rate whenever the distribution of the samples under the null hypothesis is invariant to some rearrangement. Despite its increasing…

Statistics Theory · Mathematics 2022-05-26 Ilmun Kim , Sivaraman Balakrishnan , Larry Wasserman

Super-convergence of order 1.5 in pressure and velocity has been experimentally investigated for the two-dimensional Stokes problem discretised with the MINI mixed finite element. Even though the classic mixed finite element theory for the…

Numerical Analysis · Mathematics 2019-01-04 Andrea Cioncolini , Daniele Boffi

We consider the problem of binary classification with abstention in the relatively less studied \emph{bounded-rate} setting. We begin by obtaining a characterization of the Bayes optimal classifier for an arbitrary input-label distribution…

Machine Learning · Computer Science 2019-05-24 Shubhanshu Shekhar , Mohammad Ghavamzadeh , Tara Javidi

We consider the game-theoretic approach to time-inconsistent stopping of a one-dimensional diffusion where the time-inconsistency is due to the presence of a non-exponential (weighted) discount function. In particular, we study (weak)…

Probability · Mathematics 2022-07-01 Andi Bodnariu , Sören Christensen , Kristoffer Lindensjö

We study minimax testing in a statistical inverse problem when the associated operator is unknown. In particular, we consider observations from an inverse Gaussian regression model where the associated operator is unknown but contained in a…

Statistics Theory · Mathematics 2025-09-03 Clément Marteau , Theofanis Sapatinas

It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computable function, has a length larger than the computational depth…

Computational Complexity · Computer Science 2009-11-25 Bruno Bauwens

A measurement strategy is developed for a new kind of hypothesis testing. It assigns, with minimum probability of error, the state of a quantum system to one or the other of two complementary subsets of a set of N given non-orthogonal…

Quantum Physics · Physics 2009-11-07 Ulrike Herzog , Janos A. Bergou

We study the problem of causal structure learning over a set of random variables when the experimenter is allowed to perform at most $M$ experiments in a non-adaptive manner. We consider the optimal learning strategy in terms of minimizing…

Machine Learning · Computer Science 2017-03-01 AmirEmad Ghassami , Saber Salehkaleybar , Negar Kiyavash

In statistical classification/multiple hypothesis testing and machine learning, a model distribution estimated from the training data is usually applied to replace the unknown true distribution in the Bayes decision rule, which introduces a…

Information Theory · Computer Science 2024-09-24 Zijian Yang , Vahe Eminyan , Ralf Schlüter , Hermann Ney

Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p in P or from a distribution q in Q and wants to decide from which set the…

Information Theory · Computer Science 2020-07-20 Fernando G. S. L. Brandao , Aram W. Harrow , James R. Lee , Yuval Peres

In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…

Optimization and Control · Mathematics 2024-12-26 Hong Zhu