scientific article; zbMATH DE number 7307484

MaRDI QIDQ5149248FDOQ5149248

Authors: Anindya De, Philip M. Long, Rocco A. Servedio 

Publication date: 8 February 2021

Full work available at URL: https://arxiv.org/abs/1807.07013

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4031026
• Probability and plurality for aggregations of learning machines
• Probability pooling for dependent agents in collective learning
• Learning \(\mathrm{AC}^0\) under \(k\)-dependent distributions
• Sparse regression learning by aggregation and Langevin Monte-Carlo
• Concentration of weakly dependent Banach-valued sums and applications to statistical learning methods
• Learning sparse conditional distribution: an efficient kernel-based approach
• Sums of Independent Random Vectors: Proximity Estimating
• scientific article; zbMATH DE number 1696562

zbMATH Keywords

central limit theoremequidistributionsample complexitysums of independent random variablessemi-agnostic learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
• Binomial approximation to the Poisson binomial distribution: The Krawtchouk expansion
• Playing anonymous games using simple strategies
• The Fourier transform of Poisson multinomial distributions and its algorithmic applications
• Sharper bounds for Gaussian and empirical processes
• Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
• Normal Approximation by Stein’s Method
• Title not available (Why is that?)
• On the learnability of discrete distributions
• Title not available (Why is that?)
• Title not available (Why is that?)
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Title not available (Why is that?)
• Combinatorial methods in density estimation
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Efficiently learning mixtures of two Gaussians
• Translated Poisson approximation for Markov chains
• Pseudorandom generators for combinatorial shapes
• Poisson perturbations
• Title not available (Why is that?)
• Translated Poisson approximation using exchangeable pair couplings
• Testing Poisson binomial distributions
• Learning mixtures of arbitrary Gaussians
• Sparse covers for sums of indicators
• Title not available (Why is that?)
• Distribution of modular inverses and multiples of small integers and the Sato-Tate conjecture on average
• Equivalence of models for polynomial learnability
• Limit theorems for multi-indexed sums of random variables
• Testing shape restrictions of discrete distributions
• Learning \(k\)-modal distributions via testing
• Big data on the rise? Testing monotonicity of distributions
• Title not available (Why is that?)
• Learning from satisfying assignments
• Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack
• Learning mixtures of arbitrary distributions over large discrete domains
• A size-free CLT for Poisson multinomials and its applications
• Learning \(k\)-modal distributions via testing

Cited In (2)

• Probability pooling for dependent agents in collective learning
• Learning Sums of Independent Random Variables with Sparse Collective Support

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149248)