scientific article; zbMATH DE number 4170917
From MaRDI portal
Publication:3496342
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- 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
- Bounding one-way differences
- Probabilistic analysis of the generalised assignment problem
- Near-optimal, distributed edge colouring via the nibble method
- A simple measure of conditional dependence
- On sparse approximations to randomized strategies and convex combinations
- Coexistence results for catalysts
- A universally acceptable smoothing factor for kernel density estimates
- Judicious partitions of hypergraphs
- A quasi-polynomial-time algorithm for sampling words from a context-free language
- Tight approximations for resource constrained scheduling and bin packing
- Constructive bounds for a Ramsey-type problem
- Universal smoothing factor selection in density estimation: theory and practice. (With discussion)
- List-ranking on interconnection networks.
- Total error in a plug-in estimator of level sets.
- Uniform strong consistency of robust estimators.
- Concentration inequalities using the entropy method
- On prediction of individual sequences
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- The symmetry in the martingale inequality
- Discrete one-dimensional coverage process on a renewal process
- A new method of moments for latent variable models
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- Upper tails for arithmetic progressions in random subsets
- Non parametric estimation for random walks in random environment
- Hoeffding's inequality for sums of dependent random variables
- Relative deviation learning bounds and generalization with unbounded loss functions
- On the \(k\)-planar local crossing number
- No outliers in the spectrum of the product of independent non-Hermitian random matrices with independent entries
- 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
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Moment inequalities for functions of independent random variables
- Linear extensions and comparable pairs in partial orders
- Expected worst-case partial match in random quadtries
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- An inequality for tail probabilities of martingales with bounded differences
- On Hoeffding's inequalities.
- Generalization bounds for averaged classifiers
- A sharp threshold in proof complexity yields lower bounds for satisfiability search
- Transportation cost-information inequalities and applications to random dynamical systems and diffusions.
- Close-to-optimal and near-optimal broadcasting in random graphs
- Concentration of measure and isoperimetric inequalities in product spaces
- Efficient PRAM simulation on a distributed memory machine
- Analysis of convergence performance of neural networks ranking algorithm
- Collapsibility and vanishing of top homology in random simplicial complexes
- 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
- On complexity, representation and approximation of integral multicommodity flows
- A tight upper bound on the generalization error of feedforward neural networks
- Isomorphic bisections of cubic graphs
- Stability for 1-intersecting families of perfect matchings
- 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
- Model selection in utility-maximizing binary prediction
- Approximation algorithm for the multicovering problem
- Cutoff for random walk on dynamical Erdős-Rényi graph
- A Bayesian learning model for estimating unknown demand parameter in revenue management
- Improved Hoeffding inequality for dependent bounded or sub-Gaussian random variables
- 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
- Concentration inequalities for upper probabilities
- 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
- 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
- Some new copula based distribution-free tests of independence among several random variables
- Random walks on hyperbolic spaces: concentration inequalities and probabilistic Tits alternative
- Typical values of extremal-weight combinatorial structures with independent symmetric weights
- 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 non-causal random fields
- 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
- Some theoretical properties of GANs
- Uncertainty learning of rough set-based prediction under a holistic framework
- Comparing a large number of multivariate distributions
- Circular automata synchronize with high probability
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)
