Advanced Lectures on Machine Learning
From MaRDI portal
Publication:5424901
Recommendations
Cited in
(48)- Entropy and concentration
- Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities
- 10.1162/1532443041424292
- Concentration and moment inequalities for polynomials of independent random variables
- Fundamentals of Stein's method
- Non-asymptotic oracle inequalities for the Lasso and group Lasso in high dimensional logistic model
- Concentration inequality and the weak law of large numbers for the sum of partly negatively dependent \(\varphi\)-subgaussian random variables
- The concentration inequalities of functions of independent random variables
- An introduction to matrix concentration inequalities
- Bernstein-type bounds for beta distribution
- Dominated concentration
- Spectral norm of products of random and deterministic matrices
- Adaptive density estimation on bounded domains under mixing conditions
- Measuring the unmeasurable: an application of uncertainty quantification to treasury bond portfolios
- Concentration inequalities. A nonasymptotic theory of independence
- Concentration inequalities for non-causal random fields
- New Bernstein's inequalities for dependent observations and applications to learning theory
- Fair resource allocation for demands with sharp lower tail inequalities
- Minoration via mixed volumes and Cover's problem for general channels
- Concentration of Measure for the Analysis of Randomized Algorithms
- scientific article; zbMATH DE number 1857648 (Why is no real title available?)
- An approach to the distributionally robust shortest path problem
- Integral approximation by kernel smoothing
- 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
- A class of dimension-free metrics for the convergence of empirical measures
- Statistical learning for analysis of networked control systems over unknown channels
- Concentration inequalities for nonlinear matroid intersection
- When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack
- Large deviation theory for a homogenized and ``corrected elliptic ODE
- On the application of McDiarmid's inequality to complex systems
- Efficient and Provable White-Box Primitives
- A population Monte Carlo scheme with transformed weights and its application to stochastic kinetic models
- Exact minimax optimality of spectral methods in phase synchronization and orthogonal group synchronization
- Metastable behavior of weakly mixing Markov chains: the case of reversible, critical zero-range processes
- Refined Rademacher chaos complexity bounds with applications to the multikernel learning problem
- Towards scalable synthesis of stochastic control systems
- Concentration Inequalities and Martingale Inequalities: A Survey
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Concentration inequalities for statistical inference
- Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
- Optimal bounds on approximation of submodular and XOS functions by juntas
- Robustness of randomized rumour spreading
- Estimation in high dimensions: a geometric perspective
- scientific article; zbMATH DE number 7525473 (Why is no real title available?)
- PENELOPE MADDY. Defending the Axioms: On the Philosophical Foundations of Set Theory. Oxford: Oxford University Press, 2011. ISBN 978-0-19-959618-8 (hbk); 978-0-19-967148-9 (pbk). Pp. x + 150
- Fourier analysis and large independent sets in powers of complete graphs
- Concentration inequality of sums of dependent subexponential random variables and application to bounds for value-at-risk
This page was built for publication: Advanced Lectures on Machine Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5424901)
