scientific article; zbMATH DE number 4170917
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Density estimation by the penalized combinatorial method
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.
- List-ranking on interconnection networks.
- The cook-book approach to the differential equation method
- Concentration inequalities for upper probabilities
- Voting rules that are unbiased but not transitive-symmetric
- Deviation inequalities for separately Lipschitz functionals of iterated random functions
- Concentration inequalities for statistical inference
- On Talagrand's deviation inequalities for product measures
- Noncommutative martingale concentration inequalities
- Quantified uncertainty of flexible protein-protein docking algorithms
- Approximation analysis of gradient descent algorithm for bipartite ranking
- A spectral algorithm for learning hidden Markov models
- Randomised broadcasting: memory vs. randomness
- Stability for \(t\)-intersecting families of permutations
- The cut metric, random graphs, and branching processes
- On domination of tail probabilities of (super)martingales: explicit bounds
- Statistical properties of kernel principal component analysis
- On sparse approximations to randomized strategies and convex combinations
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Robustness and generalization
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities
- Aspects of discrete mathematics and probability in the theory of machine learning
- On an anti-Ramsey threshold for random graphs
- Deviation inequalities for martingales with applications
- A sharp threshold for bootstrap percolation in a random hypergraph
- Poisson-Voronoi approximation
- Error bounds for learning the kernel
- Approximate Nash Equilibria for Multi-player Games
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- The structure of popular difference sets
- Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps
- Error bounds of multi-graph regularized semi-supervised classification
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Universal smoothing factor selection in density estimation: theory and practice. (With discussion)
- A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- Stability analysis of learning algorithms for ontology similarity computation
- Complete partitions of graphs
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- Tight cycles and regular slices in dense hypergraphs
- Isomorphic bisections of cubic graphs
- Analysis of convergence performance of neural networks ranking algorithm
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Selection of a metric for the nearest neighbor entropy estimators
- On the kernel rule for function classification
- Measuring the unmeasurable: an application of uncertainty quantification to treasury bond portfolios
- Generalization performance of bipartite ranking algorithms with convex losses
- 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
- Boosting conditional probability estimators
- The scaling window of the 2-SAT transition
- Learning sparse gradients for variable selection and dimension reduction
- Comparing a large number of multivariate distributions
- Generalization bounds for averaged classifiers
- Nearest-neighbor entropy estimators with weak metrics
- Ontology optimization tactics via distance calculating
- Vertex reinforced non-backtracking random walks: an example of path formation
- Linear eigenvalue statistics of random matrices with a variance profile
- A Hoeffding-type inequality for ergodic time series
- Probabilistic analysis of the generalised assignment problem
- scientific article; zbMATH DE number 1078078 (Why is no real title available?)
- Some new copula based distribution-free tests of independence among several random variables
- Higher order concentration for functions of weakly dependent random variables
- An inequality for tail probabilities of martingales with bounded differences
- A randomized algorithm for the joining protocol in dynamic distributed networks
- On complexity, representation and approximation of integral multicommodity flows
- Non-asymptotic tests of model performance
- Pure exploration in finitely-armed and continuous-armed bandits
- Stability in large Bayesian games with heterogeneous players
- Pseudorandom correlation functions from variable-density LPN, revisited
- Near-optimal, distributed edge colouring via the nibble method
- Threshold dominating cliques in random graphs and interval routing
- Learning and generalization with the information bottleneck
- Sharp concentration of the equitable chromatic number of dense random graphs
- Linear extensions and comparable pairs in partial orders
- On the method of typical bounded differences
- Bounds for tail probabilities of martingales using skewness and kurtosis
- Convergence rates of learning algorithms by random projection
- Estimating beta-mixing coefficients via histograms
- On the \(k\)-orientability of random graphs
- A note on the chromatic number of a dense random graph
- Learning from MOM's principles: Le Cam's approach
- Approximation algorithm for the multicovering problem
- A note on the large random inner-product kernel matrices
- Non-concentration of the chromatic number of a random graph
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
- Coexistence results for catalysts
- Strongly consistent model selection for densities
- Parsimonious flooding in geometric random-walks
- Long arithmetic progressions in critical sets
- No outliers in the spectrum of the product of independent non-Hermitian random matrices with independent entries
- Subdivisions of a large clique in \(C_6\)-free graphs
- Close-to-optimal and near-optimal broadcasting in random graphs
- Consistency of the \(k\)-nearest neighbor classifier for spatially dependent data
- Random \(k\)-dimensional orders: Width and number of linear extensions
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)
