scientific article
From MaRDI portal
zbMath0712.05012MaRDI QIDQ3496342
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
isoperimetric inequalitysymmetric groupAzuma's inequalitybounded difference methodbounded martingale difference sequencesmartingale result
Related Items
Learning and Convergence of the Normalized Radial Basis Functions Networks, Stability and generalization of graph convolutional networks in eigen-domains, Multiple Round Random Ball Placement: Power of Second Chance, Spanners in randomly weighted graphs: Euclidean case, The expected loss of feature diversity (versus phylogenetic diversity) following rapid extinction at the present, Smoothed counting of 0–1 points in polyhedra, Doubly random polytopes, The giant component after percolation of product graphs, Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II), Pseudorandom correlation functions from variable-density LPN, revisited, Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, Hamilton transversals in random Latin squares, On sufficient conditions for spanning structures in dense graphs, Tuza's conjecture for random graphs, Distribution of the autocorrelation of random Boolean functions, Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result, Optimal sampling algorithms for block matrix multiplication, On the all-pairs shortest path algorithm of Moffat and Takaoka, Near-optimal distributed edge coloring, Minimum degree conditions for tight Hamilton cycles, A general approach to transversal versions of Dirac‐type theorems, How does the chromatic number of a random graph vary?, Large population limits of Markov processes on random networks, 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 \(\varphi\)-subgaussian random variables, Differential privacy for symbolic systems with application to Markov chains, Optimal non-asymptotic concentration of centered empirical relative entropy in the high-dimensional regime, Consistency of the \(k\)-nearest neighbor classifier for spatially dependent data, Two-sample goodness-of-fit tests on the flat torus based on Wasserstein distance and their relevance to structural biology, Coordinatewise Gaussianization: Theories and Applications, Dirac-type conditions for spanning bounded-degree hypertrees, Gaussian concentration bounds for stochastic chains of unbounded memory, On the concentration of the chromatic number of random graphs, The asymptotics of \(r(4,t)\), Quantifying directed dependence via dimension reduction, Defective coloring of hypergraphs, Some recent advances in random walks and random environments, Randomized Rumour Spreading: The Effect of the Network Topology, On the Method of Typical Bounded Differences, A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials, Concentration Inequalities for Samples without Replacement, Learning Minimal Latent Directed Information Polytrees, Error estimates and convergence rates for the stochastic homogenization of Hamilton-Jacobi equations, Some applications of concentration inequalities to statistics, The peak sidelobe level of random binary sequences, Balls into bins via local search: Cover time and maximum load, The communication complexity of pointer chasing, The size-Ramsey number of trees, The cut metric, random graphs, and branching processes, An approximation algorithm for the partial vertex cover problem in hypergraphs, Approximate Nash Equilibria for Multi-player Games, Online Stochastic Matching: New Algorithms with Better Bounds, Perfect $L_p$ Sampling in a Data Stream, Asymptotic Enumeration of Hypergraphs by Degree Sequence, On the Application of McDiarmid's Inequality to Complex Systems, Recurrence, rigidity, and popular differences, The symmetry in the martingale inequality, Coexistence results for catalysts, Testing Lipschitz functions on hypergrid domains, An approximate version of the tree packing conjecture, Non-equilibrium statistical mechanics inspired by modern information theory, Consistency and generalization bounds for maximum entropy density estimation, Tikhonov, Ivanov and Morozov regularization for support vector machine learning, One-pass AUC optimization, On the richness of the collection of subtrees in random binary search trees, Discrete one-dimensional coverage process on a renewal process, A new method of moments for latent variable models, Nonlinearity measures of random Boolean functions, The cross-correlation measure of families of finite binary sequences: limiting distributions and minimal values, Some nonasymptotic results on resampling in high dimension. I: Confidence regions, A universally acceptable smoothing factor for kernel density estimates, A stronger bound for the strong chromatic index (extended abstract), Judicious partitions of hypergraphs, On the kernel rule for function classification, On the stabbing number of a random Delaunay triangulation, On the phase transition in random simplicial complexes, Spectral gap for the zero range process with constant rate, A quasi-polynomial-time algorithm for sampling words from a context-free language, Tight approximations for resource constrained scheduling and bin packing, Risk bounds for statistical learning, Constructive bounds for a Ramsey-type problem, Estimation of a distribution from data with small measurement errors, Universal smoothing factor selection in density estimation: theory and practice. (With discussion), An explicit bound on the transportation cost distance, The structure of popular difference sets, Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps, Localization and delocalization of eigenvectors for heavy-tailed random matrices, A partial overview of the theory of statistics with functional data, Randomised broadcasting: memory vs. randomness, Stability for \(t\)-intersecting families of permutations, On an anti-Ramsey threshold for random graphs, Stability in large Bayesian games with heterogeneous players, Size and degree anti-Ramsey numbers, Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs, List-ranking on interconnection networks., Robustness and generalization, Estimating beta-mixing coefficients via histograms, Around the circular law, Learning sparse gradients for variable selection and dimension reduction, A spectral algorithm for learning hidden Markov models, Random graphs with a given degree sequence, Hoeffding's inequality for supermartingales, An affine invariant \(k\)-nearest neighbor regression estimate, On the number of groups in clustering, A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks, Achlioptas process phase transitions are continuous, Total error in a plug-in estimator of level sets., Uniform strong consistency of robust estimators., Randomly colouring graphs (a combinatorial view), An improved analysis of the Rademacher data-dependent bound using its self bounding property, 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, \(L_1\)-consistent estimation of the density of residuals in random design regression models, On domination of tail probabilities of (super)martingales: explicit bounds, Deviation inequalities for separately Lipschitz functionals of iterated random functions, Concentration inequalities using the entropy method, System identification in the presence of outliers and random noises: a compressed sensing approach, Nearest-neighbor entropy estimators with weak metrics, Random orderings and unique ergodicity of automorphism groups, Thermodynamical approach to the longest common subsequence problem, Generalization performance of bipartite ranking algorithms with convex losses, Extensions of Black-Scholes processes and Benford's law, Noncommutative martingale concentration inequalities, Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning, Bounds for tail probabilities of martingales using skewness and kurtosis, Complete partitions of graphs, Boosting conditional probability estimators, A randomized algorithm for the joining protocol in dynamic distributed networks, Probabilistic analysis of the generalised assignment problem, Tight cycles and regular slices in dense hypergraphs, Random \(k\)-dimensional orders: Width and number of linear extensions, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, Tight bounds for the cover time of multiple random walks, A non-adapted sparse approximation of PDEs with stochastic inputs, Density estimation by the penalized combinatorial method, Learning and generalization with the information bottleneck, A note on the universal consistency of the kernel distribution function estimator, Lifshits tails for squared potentials, A simple measure of conditional dependence, Foundations of a multi-way spectral clustering framework for hybrid linear modeling, Regularized rank-based estimation of high-dimensional nonparanormal graphical models, Parsimonious flooding in geometric random-walks, Strongly consistent model selection for densities, On surrogate loss functions and \(f\)-divergences, The triangle-free process, On the \(k\)-orientability of random graphs, Poisson-Voronoi approximation, Near-optimal, distributed edge colouring via the nibble method, A note on the chromatic number of a dense random graph, An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm, Non-asymptotic tests of model performance, Threshold dominating cliques in random graphs and interval routing, On prediction of individual sequences, On sparse approximations to randomized strategies and convex combinations, Long arithmetic progressions in critical sets, Laws of large numbers and tail inequalities for random tries and PATRICIA trees, A nonparametric statistical procedure for the detection of marine pollution, Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem, Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree, Normal estimation on manifolds by gradient learning, Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming, Approximating Nash Equilibria in Tree Polymatrix Games, Nonlinear large deviations, Finding the seed of uniform attachment trees, On the Bernstein-Hoeffding method, Efficient parallel computing with memory faults, Linear Conic Optimization for Inverse Optimal Control, Some error analysis for the quantum phase estimation algorithms, Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities, Statistical properties of kernel principal component analysis, Model selection by bootstrap penalization for classification, A Hoeffding-type inequality for ergodic time series, Measuring the unmeasurable: an application of uncertainty quantification to Treasury bond portfolios, Error bounds of multi-graph regularized semi-supervised classification, Online Stochastic Matching: Online Actions Based on Offline Statistics, Graphical Convergence of Subgradients in Nonconvex Optimization and Learning, Class-prior estimation for learning from positive and unlabeled data, Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets, Limits of mappings, Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets, Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints, Gibbsian representations of continuous specifications: the theorems of Kozlov and Sullivan revisited, A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem, Analysis of the generalization ability of a full decision tree, $k$-Variance: A Clustered Notion of Variance, Connectivity of the k-Out Hypercube, Fast and optimal simulations between CRCW PRAMs, The log-star revolution, Consistency of learning algorithms using Attouch–Wets convergence, Global sensitivity analysis: a novel generation of mighty estimators based on rank statistics, A Short proof of the blow-up lemma for approximate decompositions, Extremal distances for subtree transfer operations in binary trees, Consistency of the \(k\)-nearest neighbors rule for functional data, Amenability and unique ergodicity of automorphism groups of countable homogeneous directed graphs, A convenient infinite dimensional framework for generative adversarial learning, Unnamed Item, Unnamed Item, Ontology optimization tactics via distance calculating, Ranking and empirical minimization of \(U\)-statistics, A Stronger Bound for the Strong Chromatic Index, The Induced Size-Ramsey Number of Cycles, Pure exploration in finitely-armed and continuous-armed bandits, Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization, Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research), Modularity of Erdős‐Rényi random graphs, Polynomial-time targeted attacks on coin tossing for any number of corruptions, Multi-variate correlation and mixtures of product measures, Limiting spectral distribution of renormalized separable sample covariance matrices when \(p/n\to 0\), Nonparametric Independence Tests: Space Partitioning and Kernel Approaches, Active sequential hypothesis testing, A rainbow blow‐up lemma, Judiciously 3‐partitioning 3‐uniform hypergraphs, A rainbow blow-up lemma for almost optimally bounded edge-colourings, Set estimation and nonparametric detection, Non-intrusive low-rank separated approximation of high-dimensional stochastic models, Matrix concentration inequalities via the method of exchangeable pairs, The scaling window of the 2-SAT transition, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Non-concentration of the chromatic number of a random graph, A simple augmentation method for matchings with applications to streaming algorithms, Active Nearest-Neighbor Learning in Metric Spaces, Aspects of discrete mathematics and probability in the theory of machine learning, Meet and merge: approximation algorithms for confluent flows, Unnamed Item, Unnamed Item, A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance, The threshold for d-collapsibility in random complexes*, Circular law for random block band matrices with genuinely sublinear bandwidth, Risk bounds for mixture density estimation, Theory of Classification: a Survey of Some Recent Advances, Concentration inequalities for dependent random variables via the martingale method, Concentration Inequalities for Statistical Inference, Coloring Sparse Hypergraphs, A permutation approach to validation*, Cost-per-Impression Pricing for Display Advertising, On theorems of Wirsing and Sanders, Parsimonious Flooding in Geometric Random-Walks, The correlation measures of finite sequences: limiting distributions and minimum values, Reinforcement Learning in Robust Markov Decision Processes, Error bounds for learning the kernel, Optimal Re-centering Bounds, with Applications to Rosenthal-type Concentration of Measure Inequalities, Sharp concentration of the equitable chromatic number of dense random graphs, Pseudorandom hypergraph matchings, Quenched decay of correlations for slowly mixing systems, Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration, Unnamed Item, Simulation of a Random Variable and its Application to Game Theory, Central limit theorems for coupled particle filters, On the power of two choices: balls and bins in continuous time, Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization, On Talagrand's deviation inequalities for product measures, Strong consistency of a kernel-based rule for spatially dependent data, Universal consistency of delta estimators, Linear eigenvalue statistics of random matrices with a variance profile, A Theoretical Perspective on Hyperdimensional Computing, Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion, Concentration inequalities for cross-validation in scattered data approximation, Cut distance identifying graphon parameters over weak* limits, Generalization bounds for non-stationary mixing processes, State-based confidence bounds for data-driven stochastic reachability using Hilbert space embeddings, The rectangle covering number of random Boolean matrices, Random approximations in multiobjective optimization, On Hoeffding's inequalities., Generalization bounds for averaged classifiers, A sharp threshold in proof complexity yields lower bounds for satisfiability search, Concentration inequalities for non-causal random fields, Deviation inequalities for martingales with applications, Transportation cost-information inequalities and applications to random dynamical systems and diffusions., On leaf related statistics in recursive tree models, Close-to-optimal and near-optimal broadcasting in random graphs, Concentration of measure and isoperimetric inequalities in product spaces, Local Rademacher complexity: sharper risk bounds with and without unlabeled samples, Efficient PRAM simulation on a distributed memory machine, Upper tails for arithmetic progressions in random subsets, Convex formulation of multiple instance learning from positive and unlabeled bags, Packing nearly optimal Ramsey \(R(3,t)\) graphs, A quantitative McDiarmid's inequality for geometrically ergodic Markov chains, Non parametric estimation for random walks in random environment, Hoeffding's inequality for sums of dependent random variables, Some theoretical properties of GANs, Analysis of convergence performance of neural networks ranking algorithm, Collapsibility and vanishing of top homology in random simplicial complexes, Uncertainty learning of rough set-based prediction under a holistic framework, Giant vacant component left by a random walk in a random \(d\)-regular graph, Good edit similarity learning by loss minimization, A sharp estimate of the binomial mean absolute deviation with applications, Sequencing by hybridization in few rounds, Relative deviation learning bounds and generalization with unbounded loss functions, Comparing a large number of multivariate distributions, On complexity, representation and approximation of integral multicommodity flows, Circular automata synchronize with high probability, Decompositions into isomorphic rainbow spanning trees, On the \(k\)-planar local crossing number, Concentration inequalities for two-sample rank processes with application to bipartite ranking, A tight upper bound on the generalization error of feedforward neural networks, Isomorphic bisections of cubic graphs, Lower bounds of size Ramsey number for graphs with small independence number, Graphon-valued stochastic processes from population genetics, No outliers in the spectrum of the product of independent non-Hermitian random matrices with independent entries, Stability for 1-intersecting families of perfect matchings, Recurrence and transience of contractive autoregressive processes and related Markov chains, Vertex reinforced non-backtracking random walks: an example of path formation, Robust multicategory support vector machines using difference convex algorithm, Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models, Existence of a non-averaging regime for the self-avoiding walk on a high-dimensional infinite percolation cluster, \(K_4\)-free graphs without large induced triangle-free subgraphs, Convergence rates of learning algorithms by random projection, Approximation analysis of gradient descent algorithm for bipartite ranking, Selection of a metric for the nearest neighbor entropy estimators, Learning from MOM's principles: Le Cam's approach, Limits of structures and the example of tree semi-lattices, Stability analysis of learning algorithms for ontology similarity computation, Moment inequalities for functions of independent random variables, Higher order concentration for functions of weakly dependent random variables, Model selection in utility-maximizing binary prediction, Approximation algorithm for the multicovering problem, Microscopic path structure of optimally aligned random sequences, Cutoff for random walk on dynamical Erdős-Rényi graph, A Bayesian learning model for estimating unknown demand parameter in revenue management, A local Vapnik-Chervonenkis complexity, Linear extensions and comparable pairs in partial orders, Voting rules that are unbiased but not transitive-symmetric, Improved Hoeffding inequality for dependent bounded or sub-Gaussian random variables, The heavy range of randomly biased walks on trees, Phase transition for the interchange and quantum Heisenberg models on the Hamming graph, Intermediate disorder limits for multi-layer semi-discrete directed polymers, A sharp threshold for bootstrap percolation in a random hypergraph, The voice of optimization, Train tracks with gaps: applying the probabilistic method to trains, Modeling interactive components by coordinate kernel polynomial models, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference, QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations, Concentration inequalities for upper probabilities, Solving equations of random convex functions via anchored regression, 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, Deviation inequalities for separately Lipschitz functionals of composition of random functions, Expected worst-case partial match in random quadtries, Estimation of dense stochastic block models visited by random walks, Adaptive estimation for some nonparametric instrumental variable models with full independence, Rigidity, weak mixing, and recurrence in abelian groups, Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance, Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings, Some new copula based distribution-free tests of independence among several random variables, On the strong universal consistency of local averaging regression estimates, Random walks on hyperbolic spaces: concentration inequalities and probabilistic Tits alternative, Quantitative aspects of acyclicity, Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs, Subdivisions of a large clique in \(C_6\)-free graphs, A note on the large random inner-product kernel matrices, Annealed and quenched limit theorems for random expanding dynamical systems, Typical values of extremal-weight combinatorial structures with independent symmetric weights, Communication complexity of quasirandom rumor spreading
