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
- An inequality for tail probabilities of martingales with bounded differences
- A randomized algorithm for the joining protocol in dynamic distributed networks
- Linear extensions and comparable pairs in partial orders
- Random \(k\)-dimensional orders: Width and number of linear extensions
- Near-optimal, distributed edge colouring via the nibble method
- Title not available (Why is that?)
- Class-prior estimation for learning from positive and unlabeled data
- Pure exploration in finitely-armed and continuous-armed bandits
- Near-optimal distributed edge coloring
- Learning and generalization with the information bottleneck
- On the Method of Typical Bounded Differences
- Strongly consistent model selection for densities
- Approximation algorithm for the multicovering problem
- Lifshits tails for squared potentials
- Some theoretical properties of GANs
- A local Vapnik-Chervonenkis complexity
- On the stabbing number of a random Delaunay triangulation
- Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings
- On complexity, representation and approximation of integral multicommodity flows
- Higher order concentration for functions of weakly dependent random variables
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
- Parsimonious flooding in geometric random-walks
- Consistency of the \(k\)-nearest neighbor classifier for spatially dependent data
- A note on the large random inner-product kernel matrices
- Approximating Nash Equilibria in Tree Polymatrix Games
- Convergence rates of learning algorithms by random projection
- On the \(k\)-orientability of random graphs
- A note on the chromatic number of a dense random graph
- Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
- Title not available (Why is that?)
- Pseudorandom correlation functions from variable-density LPN, revisited
- Modularity of Erdős‐Rényi random graphs
- Non-asymptotic tests of model performance
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝)
- Estimating beta-mixing coefficients via histograms
- Universal consistency of delta estimators
- Coexistence results for catalysts
- Some new copula based distribution-free tests of independence among several random variables
- Threshold dominating cliques in random graphs and interval routing
- Title not available (Why is that?)
- Annealed and quenched limit theorems for random expanding dynamical systems
- Title not available (Why is that?)
- Sharp concentration of the equitable chromatic number of dense random graphs
- A sharp threshold in proof complexity yields lower bounds for satisfiability search
- Fast and optimal simulations between CRCW PRAMs
- Optimal sampling algorithms for block matrix multiplication
- Thermodynamical approach to the longest common subsequence problem
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)
