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)
- 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
- 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
- On the number of groups in clustering
- The size-Ramsey number of trees
- Hoeffding's inequality for supermartingales
- The cross-correlation measure of families of finite binary sequences: limiting distributions and minimal values
- Extensions of Black-Scholes processes and Benford's law
- The peak sidelobe level of random binary sequences
- Concentration of measure and isoperimetric inequalities in product spaces
- A stronger bound for the strong chromatic index (extended abstract)
- Ranking and empirical minimization of \(U\)-statistics
- Moment inequalities for functions of independent random variables
- Localization and delocalization of eigenvectors for heavy-tailed random matrices
- Minimum degree conditions for tight Hamilton cycles
- Asymptotic Enumeration of Hypergraphs by Degree Sequence
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)
