Probability Inequalities for Sums of Bounded Random Variables
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Learning model trees from evolving data streams
- Depth properties of scaled attachment random recursive trees
- From rates of mixing to recurrence times via large deviations
- Prokaryotic evolutionary mechanisms accelerate learning
- Random graphs with a given degree sequence
- Data-adaptive binary classifiers in high dimensions using random partitioning
- Lower bounds for sampling algorithms for estimating the average
- Comparison inequalities for suprema of bounded empirical processes
- Cut-off phenomenon for random walks on free orthogonal quantum groups
- On regularity of Max-CSPs and Min-CSPs
- Distribution-free detection of structured anomalies: permutation and rank-based scans
- General theorems on exponential and Rosenthal's inequalities and on complete convergence
- Asymptotic deviations between perturbed empirical and quantile processes
- Triggering cascades on undirected connected graphs
- Extremal properties of polynomial threshold functions
- Faster estimates of the mean of bounded random variables
- Tipping points in 1-dimensional Schelling models with switching agents
- Extracellular noise-induced stochastic synchronization in heterogeneous quorum sensing network
- Analyzing robustness of Angluin's L^* algorithm in presence of noise
- Adaptive reference levels in a level-crossing analog-to-digital converter
- Model-free conditional independence feature screening for ultrahigh dimensional data
- Colouring graphs when the number of colours is almost the maximum degree
- Expected supremum of a random linear combination of shifted kernels
- Approximation algorithms for time-constrained scheduling on line networks
- Finding similar users in social networks
- Nearly root-\(n\) approximation for regression quantile processes
- Statistical estimation with bounded memory
- Partial observability and learnability
- Orbital angular momentum-encoded quantum digital signature over atmospheric channel
- Optimal parameter choices via precise black-box analysis
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- Spectrum of Johnson graphs
- Deep learning architectures for nonlinear operator functions and nonlinear inverse problems
- An information theoretic proof of the Chernoff-Hoeffding inequality
- Corrected Bayesian information criterion for stochastic block models
- On relationships between statistical zero-knowledge proofs
- Minimax optimality of permutation tests
- Sufficient variable screening with high-dimensional controls
- Number of 1-factorizations of regular high-degree graphs
- The burning number conjecture holds asymptotically
- Kernel gradient descent algorithm for information theoretic learning
- On the sample complexity of entropic optimal transport
- Cramér's moderate deviations for the LS estimator of the autoregressive processes in the neighborhood of the unit root
- Prediction for discrete time series
- Distribution-free bounds for serial correlation coefficients in heteroskedastic symmetric time series
- A comparative runtime analysis of heuristic algorithms for satisfiability problems
- Block thresholding wavelet estimation of copula density based on NSD assumption
- On judicious partitions of uniform hypergraphs
- On solving LPN using BKW and variants, Implementation and analysis
- On support vector machines under a multiple-cost scenario
- Scaling transition for nonlinear random fields with long-range dependence
- Time-uniform, nonparametric, nonasymptotic confidence sequences
- On the Kolmogorov inequalities for quadratic forms of dependent uniformly bounded random variables
- Optimizing the decoy-state BB84 QKD protocol parameters
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
- On handling negative transfer and imbalanced distributions in multiple source transfer learning
- Co-clustering separately exchangeable network data
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Polynomial splines and nonparametric regression
- Almost sure classification of densities
- Estimation and approximation bounds for gradient-based reinforcement learning
- Boundary estimation based on set-indexed empirical processes
- Curve packing and modulus estimates
- Why almost all k-colorable graphs are easy to color
- Exact and approximate algorithms for computing betweenness centrality in directed graphs
- A framework for Monte Carlo based multiple testing
- Transportation inequalities for hidden Markov chains and applications
- Binomial Convolutions and Derivatives Estimation from Noisy Discretizations
- Probabilistic and analytical aspects of the symmetric and generalized Kaiser-Bessel window function
- Detecting change in a hazard regression model with right-censoring
- Multi-instance secure public-key encryption
- A conversation with Samuel Kotz
- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- Some improved tail bounds for the sum of variables with geometric distribution
- Event-triggered learning
- The complexity of parallel search
- Bootstrap approximation to distributions of finite population U-statistics
- Pure exploration in finitely-armed and continuous-armed bandits
- On data depth and distribution-free discriminant analysis using separating surfaces
- On the Lyapunov exponents for a class of circle diffeomorphisms driven by expanding circle endomorphisms
- Upper and lower bounds on black-box steganography
- New lower bounds for essential covers of the cube
- Extremal slabs in the cube and the Laplace transform.
- Consistency of error density and distribution function estimators in nonparametric regression.
- Convergence of binomial-based derivative estimation for \(C^{2}\) noisy discretized curves
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- A randomized algorithm for fixed-dimensional linear programming
- Multi-objective parameter synthesis in probabilistic hybrid systems
- Derivatives of the stochastic growth rate
- The symmetry in the martingale inequality
- The power of a collectivity to act in weighted voting games with many small voters
- Learning deterministic regular grammars from stochastic samples in polynomial time
- An exponential inequality for U-statistics of i.i.d. data
- Guaranteed Local Maximum Likelihood Detection of a Change Point in Nonparametric Logistic Regression
- On the asymptotic properties of smoothed estimators of the classification error rate
- On the random construction of heaps
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Optimal speedup for backtrack search on a butterfly network
- Single pass spectral sparsification in dynamic streams
- Posterior asymptotics in Wasserstein metrics on the real line
This page was built for publication: Probability Inequalities for Sums of Bounded Random Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5332577)