中文
相关论文

相关论文: A Natural Law of Succession

200 篇论文

We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of…

信息论 · 计算机科学 2007-07-13 Aaron B. Wagner , Pramod Viswanath , Sanjeev R. Kulkarni

In this work we consider the task of relaxing the i.i.d assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider range of tasks. Pattern recognition is guessing a discrete…

机器学习 · 计算机科学 2012-02-28 Daniil Ryabko

In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the…

组合数学 · 数学 2012-05-01 Dmitry Kruchinin

This note proves a law of large numbers for predicting several steps ahead, which, in the case of uniformly bounded random variables, generalizes the standard law of large numbers for martingales; the standard law of large numbers…

概率论 · 数学 2026-04-14 Vladimir Vovk

Estimating a large alphabet probability distribution from a limited number of samples is a fundamental problem in machine learning and statistics. A variety of estimation schemes have been proposed over the years, mostly inspired by the…

机器学习 · 统计学 2018-08-20 Amichai Painsky , Meir Feder

We consider the classical problem of discrete distribution estimation using i.i.d. samples in a novel scenario where additional side information is available on the distribution. In large alphabet datasets such as text corpora, such side…

信息论 · 计算机科学 2026-01-19 Haricharan Balasundaram , Andrew Thangaraj

There are $n$ independent Bernoulli random variables $I_{k}$ with parameters $p_{k}$ that are observed sequentially. We consider a generalization of the Last-Success-Problem considering $w_{k}$ positive payments if the player successfully…

概率论 · 数学 2018-12-24 Jose Maria Grau ribas

Consider a collection of competing machine learning algorithms. Given their performance on a benchmark of datasets, we would like to identify the best performing algorithm. Specifically, which algorithm is most likely to rank highest on a…

机器学习 · 计算机科学 2025-08-08 Amichai Painsky

The article attempts to demonstrate the rich history of one truly remarkable problem situated at the confluence of probability theory and theory of numbers - finding the probability of co-primality of two randomly selected natural numbers.…

历史与综述 · 数学 2017-04-12 Sergei Abramovich , Yakov Yu. Nikitin

Suppose $N$ independent Bernoulli trials are observed sequentially at random times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. We focus…

概率论 · 数学 2024-10-22 Alexander Gnedin , Zakaria Derbazi

The multinomial model is one of the simplest statistical models. When constraints are placed on the possible values for the probabilities, however, it becomes much more difficult to deal with. Model checking and checking for prior-data…

The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…

机器学习 · 计算机科学 2010-06-29 Shankar Vembu

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

数论 · 数学 2015-09-30 Victor Volfson

Within the context of the binomial model, we analyse sequences of values that are almost-uniform and we discuss a prediction method called the frequent outcome approach, in which the outcome that has occurred the most in the observed trials…

统计理论 · 数学 2022-09-29 Ben O'Neill

We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful complexity measures to study learning with i.i.d. data. Our…

机器学习 · 计算机科学 2014-08-13 Alexander Rakhlin , Karthik Sridharan , Ambuj Tewari

We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…

概率论 · 数学 2025-11-18 Persi Diaconis , Brett Kolesnik

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

综合数学 · 数学 2019-07-25 K. K. Kataria

Predicting the winner of an election is of importance to multiple stakeholders. To formulate the problem, we consider an independent sequence of categorical data with a finite number of possible outcomes in each. The data is assumed to be…

应用统计 · 统计学 2024-10-17 Soudeep Deb , Rishideep Roy , Shubhabrata Das

We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…

统计理论 · 数学 2014-08-19 P. Vellaisamy

The purpose of this paper is to give an easy to understand with step-by-step explanation to allow interested people to fully appreciate the power of natural deduction for first-order logic. Natural deduction as a proof system can be used to…

计算机科学中的逻辑 · 计算机科学 2021-08-16 Alrubyli , Yazeed
‹ 上一页 1 2 3 10 下一页 ›