scientific article; zbMATH DE number 4170917
From MaRDI portal
zbMATH Open0712.05012MaRDI QIDQ3496342FDOQ3496342
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)
- 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
- The cut metric, random graphs, and branching processes
- Poisson-Voronoi approximation
- Measuring the unmeasurable: an application of uncertainty quantification to Treasury bond portfolios
- Analysis of convergence performance of neural networks ranking algorithm
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Ontology optimization tactics via distance calculating
- Deviation inequalities for martingales with applications
- Approximate Nash Equilibria for Multi-player Games
- Boosting conditional probability estimators
- Concentration inequalities for upper probabilities
- An explicit bound on the transportation cost distance
- Error bounds of multi-graph regularized semi-supervised classification
- Tight cycles and regular slices in dense hypergraphs
- Aspects of discrete mathematics and probability in the theory of machine learning
- A sharp threshold for bootstrap percolation in a random hypergraph
- Error bounds for learning the kernel
- Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps
- On the kernel rule for function classification
- The scaling window of the 2-SAT transition
- Coloring sparse hypergraphs
- Some applications of concentration inequalities to statistics
- System identification in the presence of outliers and random noises: a compressed sensing approach
- \(K_4\)-free graphs without large induced triangle-free subgraphs
- Tight approximations for resource constrained scheduling and bin packing
- Random graphs with a given degree sequence
- The threshold for \(d\)-collapsibility in random complexes
- Testing Lipschitz functions on hypergrid domains
- An approximate version of the tree packing conjecture
- Some nonasymptotic results on resampling in high dimension. I: Confidence regions
- Perfect $L_p$ Sampling in a Data Stream
- An approximation algorithm for the partial vertex cover problem in hypergraphs
- Tight bounds for the cover time of multiple random walks
- Consistency and generalization bounds for maximum entropy density estimation
- Non-equilibrium statistical mechanics inspired by modern information theory
- One-pass AUC optimization
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- A note on the universal consistency of the kernel distribution function estimator
- The log-star revolution
- Global sensitivity analysis: a novel generation of mighty estimators based on rank statistics
- An improved analysis of the Rademacher data-dependent bound using its self bounding property
- Spectral gap for the zero range process with constant rate
- Online Stochastic Matching: New Algorithms with Better Bounds
- The triangle-free process
- Concentration inequalities using the entropy method
- On the richness of the collection of subtrees in random binary search trees
- Around the circular law
- Error estimates and convergence rates for the stochastic homogenization of Hamilton-Jacobi equations
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Randomly colouring graphs (a combinatorial view)
- Judicious partitions of hypergraphs
- A Stronger Bound for the Strong Chromatic Index
- Nonlinearity measures of random Boolean functions
- Concentration inequalities for dependent random variables via the martingale method
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)
