scientific article; zbMATH DE number 4170917

Recommendations

scientific article; zbMATH DE number 1195776
An inequality for tail probabilities of martingales with bounded differences
Centering Sequences with Bounded Differences
On Hoeffding's inequalities.
On measure concentration for separately Lipschitz functions in product spaces

Cited in

(only showing first 100 items - show all)

Concentration inequalities for samples without replacement
Randomised broadcasting: memory vs. randomness
A randomized algorithm for the joining protocol in dynamic distributed networks
Stability for t-intersecting families of permutations
An inequality for tail probabilities of martingales with bounded differences
The Induced Size-Ramsey Number of Cycles
The scaling window of the 2-SAT transition
Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
Consistency of the \(k\)-nearest neighbors rule for functional data
A tight upper bound on the generalization error of feedforward neural networks
Stability for 1-intersecting families of perfect matchings
Coloring sparse hypergraphs
Modularity of Erdős-Rényi random graphs
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
The law of large numbers for large stable matchings
Simulation of a random variable and its application to game theory
On an anti-Ramsey threshold for random graphs
Linear extensions and comparable pairs in partial orders
Random k-dimensional orders: Width and number of linear extensions
On the \(k\)-planar local crossing number
Strong consistency of a kernel-based rule for spatially dependent data
Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities
Some applications of concentration inequalities to statistics
Quenched decay of correlations for slowly mixing systems
Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
System identification in the presence of outliers and random noises: a compressed sensing approach
Trained quantum neural networks are Gaussian processes
Near-optimal, distributed edge colouring via the nibble method
\(K_4\)-free graphs without large induced triangle-free subgraphs
A general approach to transversal versions of Dirac‐type theorems
How does the chromatic number of a random graph vary?
Linear conic optimization for inverse optimal control
Partition functions of discrete coalescents: from Cayley's formula to Frieze's (3) limit theorem
Normal estimation on manifolds by gradient learning.
Percolation in simple directed random graphs with a given degree distribution
Two-sample goodness-of-fit tests on the flat torus based on Wasserstein distance and their relevance to structural biology
Hamilton transversals in random Latin squares
Random graphs with a given degree sequence
Tight approximations for resource constrained scheduling and bin packing
scientific article; zbMATH DE number 1195776 (Why is no real title available?)
Typical values of extremal-weight combinatorial structures with independent symmetric weights
Circular automata synchronize with high probability
Testing Lipschitz functions on hypergrid domains
An approximate version of the tree packing conjecture
Graphon-valued stochastic processes from population genetics
Class-prior estimation for learning from positive and unlabeled data
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Large population limits of Markov processes on random networks
The threshold for d-collapsibility in random complexes
Pure exploration in finitely-armed and continuous-armed bandits
The symmetry in the martingale inequality
Complete partitions of graphs
On theorems of Wirsing and Sanders
Lower bounds of size Ramsey number for graphs with small independence number
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
Relative deviation learning bounds and generalization with unbounded loss functions
Generalization bounds for non-stationary mixing processes
Robustness and generalization
Giant vacant component left by a random walk in a random \(d\)-regular graph
Variance-aware estimation of kernel mean embedding
Optimizing Sharpe ratio: risk-adjusted decision-making in multi-armed bandits
A quantitative McDiarmid's inequality for geometrically ergodic Markov chains
Convergence of message-passing graph neural networks with generic aggregation on large random graphs
Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
Optimal granularity selection based on algorithm stability with application to attribute reduction in rough set theory
Concentration inequality and the weak law of large numbers for the sum of partly negatively dependent -subgaussian random variables
Consistency and generalization bounds for maximum entropy density estimation
Non-equilibrium statistical mechanics inspired by modern information theory
Tight bounds for the cover time of multiple random walks
One-pass AUC optimization
Tikhonov, Ivanov and Morozov regularization for support vector machine learning
Cutoff for a class of auto-regressive models with vanishing additive noise
Approximating Nash equilibria in tree polymatrix games
Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
On sparse approximations to randomized strategies and convex combinations
Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs G(n, m) and G(n, p)
Stability and generalization of graph convolutional networks in eigen-domains
Generalized Tuza's conjecture for random hypergraphs
Near-optimal distributed edge coloring
A partially random Trotter algorithm for quantum Hamiltonian simulations
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
An approximation algorithm for the partial vertex cover problem in hypergraphs
Quantified uncertainty of flexible protein-protein docking algorithms
Packing nearly optimal Ramsey R(3,t) graphs
Balls into bins via local search: cover time and maximum load
A note on the universal consistency of the kernel distribution function estimator
Learning and generalization with the information bottleneck
Concentration inequalities for cross-validation in scattered data approximation
Cut distance identifying graphon parameters over weak* limits
State-based confidence bounds for data-driven stochastic reachability using Hilbert space embeddings
Concentration inequalities for two-sample rank processes with application to bipartite ranking
Quantitative aspects of acyclicity
Strongly consistent model selection for densities
A convenient infinite dimensional framework for generative adversarial learning
An improved analysis of the Rademacher data-dependent bound using its self bounding property
Global sensitivity analysis: a novel generation of mighty estimators based on rank statistics
Random approximations in multiobjective optimization
Density estimation by the penalized combinatorial method
The log-star revolution

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)