English
Related papers

Related papers: Practical Estimation of Renyi Entropy

200 papers

The purpose of Secure Multi-Party Computation is to enable protocol participants to compute a public function of their private inputs while keeping their inputs secret, without resorting to any trusted third party. However, opening the…

Cryptography and Security · Computer Science 2018-03-02 Patrick Ah-Fat , Michael Huth

Reliable probability estimation is of crucial importance in many real-world applications where there is inherent (aleatoric) uncertainty. Probability-estimation models are trained on observed outcomes (e.g. whether it has rained or not, or…

Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K\"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum…

Quantum Physics · Physics 2011-07-18 Jürg Wullschleger

'Causal' direction is of great importance when dealing with complex systems. Often big volumes of data in the form of time series are available and it is important to develop methods that can inform about possible causal connections between…

Statistical Mechanics · Physics 2014-01-24 Fatimah Abdul Razak , Henrik Jeldtoft Jensen

Transfer entropy measures directed information flow in time series, and it has become a fundamental quantity in applications spanning neuroscience, finance, and complex systems analysis. However, existing estimation methods suffer from the…

Machine Learning · Computer Science 2026-04-10 Simon Pedro Galeano Munoz , Mustapha Bounoua , Giulio Franzese , Pietro Michiardi , Maurizio Filippone

We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show…

Information Theory · Computer Science 2016-03-24 Stefan Dantchev , Ioannis Ivrissimtzis

Transferring knowledge from one neural network to another has been shown to be helpful for learning tasks with few training examples. Prevailing fine-tuning methods could potentially contaminate pre-trained features by comparably high…

Machine Learning · Computer Science 2019-07-15 Farshid Varno , Behrouz Haji Soleimani , Marzie Saghayi , Lisa Di Jorio , Stan Matwin

Problems of probabilistic inference and decision making under uncertainty commonly involve continuous random variables. Often these are discretized to a few points, to simplify assessments and computations. An alternative approximation is…

Artificial Intelligence · Computer Science 2013-03-08 William B. Poland , Ross D. Shachter

The problem of analyzing data streams of very large volumes is important and is very desirable for many application domains. In this paper we present and demonstrate effective working of an algorithm to find clusters and anomalous data…

Machine Learning · Computer Science 2025-03-25 Aniket Bhanderi , Raj Bhatnagar

Robust estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in…

Machine Learning · Computer Science 2018-03-14 Ilias Diakonikolas , Gautam Kamath , Daniel M. Kane , Jerry Li , Ankur Moitra , Alistair Stewart

Estimating statistical properties is fundamental in statistics and computer science. In this paper, we propose a unified quantum algorithm framework for estimating properties of discrete probability distributions, with estimating R\'enyi…

Quantum Physics · Physics 2024-04-04 Xinzhao Wang , Shengyu Zhang , Tongyang Li

We study the problem of robustly estimating the parameter $p$ of an Erd\H{o}s-R\'enyi random graph on $n$ nodes, where a $\gamma$ fraction of nodes may be adversarially corrupted. After showing the deficiencies of canonical estimators, we…

Data Structures and Algorithms · Computer Science 2022-02-16 Jayadev Acharya , Ayush Jain , Gautam Kamath , Ananda Theertha Suresh , Huanyu Zhang

It was recently shown that estimating the Shannon entropy $H({\rm p})$ of a discrete $k$-symbol distribution ${\rm p}$ requires $\Theta(k/\log k)$ samples, a number that grows near-linearly in the support size. In many applications $H({\rm…

Information Theory · Computer Science 2016-03-11 Jayadev Acharya , Alon Orlitsky , Ananda Theertha Suresh , Himanshu Tyagi

High level declarative constraints provide a powerful (and popular) way to define and construct control policies; however, most synthesis algorithms do not support specifying the degree of randomness (unpredictability) of the resulting…

Robotics · Computer Science 2021-06-30 Marcell Vazquez-Chanlatte , Sebastian Junges , Daniel J. Fremont , Sanjit Seshia

Generating secure random numbers is a central problem in cryptography that needs a reliable source of enough computing entropy. Without enough entropy available - meaning no good source of secure random numbers - a device is susceptible to…

Cryptography and Security · Computer Science 2018-10-02 JV Roig

Entropy and free-energy estimation are key in thermodynamic characterization of simulated systems ranging from spin models through polymers, colloids, protein structure, and drug-design. Current techniques suffer from being model specific,…

Statistical Mechanics · Physics 2019-10-30 Ram Avinery , Micha Kornreich , Roy Beck

In recent years, the Renyi entropy has repeatedly been discussed for characterization of quantum critical states and entanglement. Here, time evolution of the Renyi entropy is studied. A compact general formula is presented for the lower…

Quantum Physics · Physics 2016-08-05 Sumiyoshi Abe

The investor is interested in the expected return and he is also concerned about the risk and the uncertainty assumed by the investment. One of the most popular concepts used to measure the risk and the uncertainty is the variance and/or…

Statistical Finance · Quantitative Finance 2008-12-02 Andreia Dionisio , Rui Menezes , Diana A. Mendes

In quantum Shannon theory, various kinds of quantum entropies are used to characterize the capacities of noisy physical systems. Among them, min-entropy and its smooth version attract wide interest especially in the field of quantum…

Quantum Physics · Physics 2025-07-15 Rong Wang , H. F. Chau

We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees…

Statistics Theory · Mathematics 2024-02-14 Aryeh Kontorovich , Amichai Painsky
‹ Prev 1 8 9 10 Next ›