English
Related papers

Related papers: Optimality of Universal Bayesian Sequence Predicti…

200 papers

A class of parameter-free online linear optimization algorithms is proposed that harnesses the structure of an adversarial sequence by adapting to some side information. These algorithms combine the reduction technique of Orabona and…

Information Theory · Computer Science 2022-02-08 J. Jon Ryu , Alankrita Bhatt , Young-Han Kim

An empirical Bayes problem has an unknown prior to be estimated from data. The predictive recursion (PR) algorithm provides fast nonparametric estimation of mixing distributions and is ideally suited for empirical Bayes applications. This…

Statistics Theory · Mathematics 2012-10-19 Ryan Martin

Bayesian networks (BNs) are probabilistic graphical models for describing complex joint probability distributions. The main problem for BNs is inference: Determine the probability of an event given observed evidence. Since exact inference…

Programming Languages · Computer Science 2018-03-01 Kevin Batz , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Christoph Matheja

The optimal instant of observation of astrophysical phenomena for objects that vary on human time-sales is an important problem, as it bears on the cost-effective use of usually scarce observational facilities. In this paper we address this…

Solar and Stellar Astrophysics · Physics 2023-02-15 Miguel Videla , Rene A. Mendez , Jorge F. Silva , Marcos E. Orchard

The paper solves the problem of optimal portfolio choice when the parameters of the asset returns distribution, like the mean vector and the covariance matrix are unknown and have to be estimated by using historical data of the asset…

Statistical Finance · Quantitative Finance 2023-04-19 David Bauder , Taras Bodnar , Nestor Parolya , Wolfgang Schmid

It is common practice to combine deep neural networks into ensembles. These deep ensembles can benefit from the cancellation of errors effect: Errors by ensemble members may average out, leading to better generalization performance than…

Machine Learning · Computer Science 2025-01-07 Nick Hauptvogel , Christian Igel

We study a Bayesian binary sequential hypothesis testing problem with multiple large language models (LLMs). Each LLM $j$ has per-query cost $c_j>0$, random waiting time with mean $\mu_j>0$ and sub-Gaussian tails, and \emph{asymmetric}…

Data Structures and Algorithms · Computer Science 2026-04-03 Guokai Li , Alys Liang , Mo Liu , Murray Lei , Stefanus Jasin , Fenghua Yang , Preet Baxi

In the estimation of the causal effect under linear Structural Causal Models (SCMs), it is common practice to first identify the causal structure, estimate the probability distributions, and then calculate the causal effect. However, if the…

Methodology · Statistics 2021-03-16 Shunsuke Horii

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

Probability · Mathematics 2018-12-12 Pieter C. Allaart , Jose A. Islas

We consider a Bayesian approach to model selection in Gaussian linear regression, where the number of predictors might be much larger than the number of observations. From a frequentist view, the proposed procedure results in the penalized…

Statistics Theory · Mathematics 2010-09-14 Felix Abramovich , Vadim Grinshtein

Let $X_1,\ldots,X_n$ be independent identically distributed random vectors in $\mathbb{R}^d$. We consider upper bounds on $\max_x \mathbb{P}(a_1X_1+\cdots+a_nX_n=x)$ under various restrictions on $X_i$ and the weights $a_i$. When…

Probability · Mathematics 2020-08-04 Tomas Juškevičius , Valentas Kurauskas

Many real-world optimization problems can be stated in terms of submodular functions. Furthermore, these real-world problems often involve uncertainties which may lead to the violation of given constraints. A lot of evolutionary…

Neural and Evolutionary Computing · Computer Science 2024-11-04 Aneta Neumann , Frank Neumann

The problem of simple $M-$ary hypothesis testing under a generic performance criterion that depends on arbitrary functions of error probabilities is considered. Using results from convex analysis, it is proved that an optimal decision rule…

Signal Processing · Electrical Eng. & Systems 2019-07-26 Berkan Dulek , Cuneyd Ozturk , Sinan Gezici

Estimation of Distribution Algorithms have been proposed as a new paradigm for evolutionary optimization. This paper focuses on the parallelization of Estimation of Distribution Algorithms. More specifically, the paper discusses how to…

Neural and Evolutionary Computing · Computer Science 2007-05-23 Jiri Ocenasek , Martin Pelikan

Stochastic optimization is a widely used approach for optimization under uncertainty, where uncertain input parameters are modeled by random variables. Exact or approximation algorithms have been obtained for several fundamental problems in…

Machine Learning · Computer Science 2025-08-14 Arpit Agarwal , Rohan Ghuge , Viswanath Nagarajan , Zhengjia Zhuo

We review typical design problems encountered in the planning of observational studies and propose a unifying framework that allows us to use the same concepts and notation for different problems. In the framework, the design is defined as…

Statistics Theory · Mathematics 2017-11-02 Juha Karvanen , Jarno Vanhatalo , Kari Auranen , Sangita Kulathinal , Samu Mäntyniemi

The assumption of Gaussian or Gaussian mixture data has been extensively exploited in a long series of precise performance analyses of machine learning (ML) methods, on large datasets having comparably numerous samples and features. To…

Machine Learning · Statistics 2025-03-14 Xiaoyi Mai , Zhenyu Liao

The property of perfectness plays an important role in the theory of Bayesian networks. First, the existence of perfect distributions for arbitrary sets of variables and directed acyclic graphs implies that various methods for reading…

Artificial Intelligence · Computer Science 2012-12-12 Christopher Meek , David Maxwell Chickering

Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which…

Logic in Computer Science · Computer Science 2011-04-15 Krishnendu Chatterjee , Thomas A. Henzinger , Barbara Jobstmann , Rohit Singh

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

Machine Learning · Computer Science 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal