scientific article; zbMATH DE number 4170917
From MaRDI portal
zbMATH Open0712.05012MaRDI QIDQ3496342FDOQ3496342
Authors: Colin McDiarmid 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
isoperimetric inequalitysymmetric groupAzuma's inequalitybounded difference methodbounded martingale difference sequencesmartingale result
Cited In (only showing first 100 items - show all)
- Consistency of the \(k\)-nearest neighbors rule for functional data
- Active Nearest-Neighbor Learning in Metric Spaces
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Typical values of extremal-weight combinatorial structures with independent symmetric weights
- Circular automata synchronize with high probability
- On theorems of Wirsing and Sanders
- Lower bounds of size Ramsey number for graphs with small independence number
- Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization
- Concentration inequalities for cross-validation in scattered data approximation
- Cut distance identifying graphon parameters over weak* limits
- Concentration inequalities for two-sample rank processes with application to bipartite ranking
- State-based confidence bounds for data-driven stochastic reachability using Hilbert space embeddings
- A convenient infinite dimensional framework for generative adversarial learning
- Quantitative aspects of acyclicity
- Random approximations in multiobjective optimization
- Differential privacy for symbolic systems with application to Markov chains
- Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
- A permutation approach to validation*
- On the strong universal consistency of local averaging regression estimates
- Recurrence, rigidity, and popular differences
- A rainbow blow‐up lemma
- Concentration inequalities for non-causal random fields
- Amenability and unique ergodicity of automorphism groups of countable homogeneous directed graphs
- Title not available (Why is that?)
- Deviation inequalities for separately Lipschitz functionals of composition of random functions
- Active sequential hypothesis testing
- Title not available (Why is that?)
- Cost-per-Impression Pricing for Display Advertising
- Circular law for random block band matrices with genuinely sublinear bandwidth
- Tuza's conjecture for random graphs
- Pseudorandom hypergraph matchings
- Simulation of a Random Variable and its Application to Game Theory
- Microscopic path structure of optimally aligned random sequences
- The voice of optimization
- Concentration Inequalities for Samples without Replacement
- Finding the seed of uniform attachment trees
- Train tracks with gaps: applying the probabilistic method to trains
- Modeling interactive components by coordinate kernel polynomial models
- Convex formulation of multiple instance learning from positive and unlabeled bags
- Consistency of learning algorithms using Attouch–Wets convergence
- When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
- Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels
- Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence
- New lower bounds on the size-Ramsey number of a path
- Adaptive estimation for some nonparametric instrumental variable models with full independence
- Estimation of dense stochastic block models visited by random walks
- Rigidity, weak mixing, and recurrence in abelian groups
- Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Communication complexity of quasirandom rumor spreading
- Uncertainty learning of rough set-based prediction under a holistic framework
- Random walks on hyperbolic spaces: concentration inequalities and probabilistic Tits alternative
- Meet and merge: approximation algorithms for confluent flows
- Decompositions into isomorphic rainbow spanning trees
- Randomised broadcasting: memory vs. randomness
- Stability for \(t\)-intersecting families of permutations
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
- A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance
- Vertex reinforced non-backtracking random walks: an example of path formation
- Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities
- On an anti-Ramsey threshold for random graphs
- Complete partitions of graphs
- Concentration Inequalities for Statistical Inference
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Robustness and generalization
- On sparse approximations to randomized strategies and convex combinations
- Density estimation by the penalized combinatorial method
- Stability analysis of learning algorithms for ontology similarity computation
- List-ranking on interconnection networks.
- Learning sparse gradients for variable selection and dimension reduction
- A spectral algorithm for learning hidden Markov models
- On the power of two choices: balls and bins in continuous time
- An affine invariant \(k\)-nearest neighbor regression estimate
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Achlioptas process phase transitions are continuous
- The structure of popular difference sets
- Comparing a large number of multivariate distributions
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Generalization bounds for averaged classifiers
- Universal smoothing factor selection in density estimation: theory and practice. (With discussion)
- Isomorphic bisections of cubic graphs
- On domination of tail probabilities of (super)martingales: explicit bounds
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.
- The cook-book approach to the differential equation method
- Deviation inequalities for separately Lipschitz functionals of iterated random functions
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- Nearest-neighbor entropy estimators with weak metrics
- Statistical properties of kernel principal component analysis
- Selection of a metric for the nearest neighbor entropy estimators
- Linear eigenvalue statistics of random matrices with a variance profile
- Probabilistic analysis of the generalised assignment problem
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Generalization performance of bipartite ranking algorithms with convex losses
- A Hoeffding-type inequality for ergodic time series
- Voting rules that are unbiased but not transitive-symmetric
- On Talagrand's deviation inequalities for product measures
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- Noncommutative martingale concentration inequalities
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
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 Q3496342)
