The Infinity of Randomness

• URL: http://arxiv.org/abs/2211.16975v1
• Date: Wed, 16 Nov 2022 13:19:35 GMT
• Title: The Infinity of Randomness
• Authors: Yongxin Li
• Abstract summary: The source and nature of randomness is explored, and the relationship between infinity and randomness is found. The importance of randomness in AI research is emphasized.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and randomness is found. The properties of randomness are summarized from the perspective of interaction between systems, that is, the set composed of sequences generated by randomness has the property of asymptotic completeness. Finally, the importance of randomness in AI research is emphasized.

Related papers

• Gradient Span Algorithms Make Predictable Progress in High Dimension [0.0]
  We prove that all 'gradient algorithms' have deterministically on scaled random functions as the this tends to infinity. The distributional assumption is used for training but also encompass random glasses and spin.
  arXiv  Detail & Related papers  (2024-10-13T19:26:18Z)
• Verifying randomness in sets of quantum states via observables [4.289151408389622]
  We show that Haar-randomness is connected to the Dirichlet distribution, and provide a closed-form expression, and simple bounds of the statistical moments. We generalize this metric to permutation- and unitary-equivalent observables, ensuring that if the extended average randomness is compatible with a Haar-random distribution, then the set of states is approximately Haar-random.
  arXiv  Detail & Related papers  (2024-04-24T21:11:58Z)
• Probability Tools for Sequential Random Projection [1.6317061277457001]
  We introduce the first probabilistic framework tailored for sequential random projection. The analysis is complicated by the sequential dependence and high-dimensional nature of random variables. By employing the method of mixtures within a self-normalized process, we achieve a desired non-asymptotic probability bound.
  arXiv  Detail & Related papers  (2024-02-16T13:17:13Z)
• Randomness: what is it and why does it matter? [0.0]
  A widely accepted definition of randomness lacks scientific rigor and its results are questionable. I propose an information-theory-based definition of randomness which focuses on the physical process of random number generation itself. A new quantity named "randomness deviation" allows for a practical measure of quality of a random number generating process or a device.
  arXiv  Detail & Related papers  (2023-03-14T16:38:16Z)
• PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium [62.51015395213579]
  We consider the non-AL equilibrium nonconptotic objective function in two-player zero-sum continuous games. The proposed algorithm employs the movements of particles to represent the updates of random strategies for the $ilon$-mixed Nash equilibrium.
  arXiv  Detail & Related papers  (2023-03-02T05:08:15Z)
• Shortcomings of Top-Down Randomization-Based Sanity Checks for Evaluations of Deep Neural Network Explanations [67.40641255908443]
  We identify limitations of model-randomization-based sanity checks for the purpose of evaluating explanations. Top-down model randomization preserves scales of forward pass activations with high probability.
  arXiv  Detail & Related papers  (2022-11-22T18:52:38Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• Dense Uncertainty Estimation via an Ensemble-based Conditional Latent Variable Model [68.34559610536614]
  We argue that the aleatoric uncertainty is an inherent attribute of the data and can only be correctly estimated with an unbiased oracle model. We propose a new sampling and selection strategy at train time to approximate the oracle model for aleatoric uncertainty estimation. Our results show that our solution achieves both accurate deterministic results and reliable uncertainty estimation.
  arXiv  Detail & Related papers  (2021-11-22T08:54:10Z)
• Applications of Quantum Randomness: From Rabi Oscillations to Fourier Axis Controlling the Musical Timbre [0.0]
  We aim at achieving a new sense of aesthetic effect in music which derives from the true randomness that prevails in the natural quantum world. In this project, we attempt to take a further step by directly producing sound events from the genuine quantum true randomness of quantum physical systems.
  arXiv  Detail & Related papers  (2021-09-08T09:11:08Z)
• A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits [91.3755431537592]
  This paper unifies the analysis of risk-averse Thompson sampling algorithms for the multi-armed bandit problem. Using the contraction principle in the theory of large deviations, we prove novel concentration bounds for continuous risk functionals. We show that a wide class of risk functionals as well as "nice" functions of them satisfy the continuity condition.
  arXiv  Detail & Related papers  (2021-08-25T17:09:01Z)
• Stochastic Saddle-Point Optimization for Wasserstein Barycenters [69.68068088508505]
  We consider the populationimation barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. We employ the structure of the problem and obtain a convex-concave saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose an optimization algorithm and estimate its complexity.
  arXiv  Detail & Related papers  (2020-06-11T19:40:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.