The following pages link to Understanding Machine Learning (Q5494386):
Displayed 50 items.
- Testing conditional independence in supervised learning algorithms (Q113672) (← links)
- BEST : A decision tree algorithm that handles missing values (Q143925) (← links)
- Eigenvalue clustering, control energy, and logarithmic capacity (Q325057) (← links)
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
- A multiple criteria nominal classification method based on the concepts of similarity and dissimilarity (Q724076) (← links)
- On sharpness of error bounds for univariate approximation by single hidden layer feedforward neural networks (Q777322) (← links)
- Deep learning observables in computational fluid dynamics (Q777521) (← links)
- CLIP: cheap Lipschitz training of neural networks (Q826198) (← links)
- Machine learning from a continuous viewpoint. I (Q829085) (← links)
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
- High-dimensional penalty selection via minimum description length principle (Q1631787) (← links)
- Crowdsourcing with unsure option (Q1640566) (← links)
- Optimal distributed stochastic mirror descent for strongly convex optimization (Q1640744) (← links)
- A quantum-implementable neural network model (Q1702220) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- Generalization bounds for learning weighted automata (Q1704563) (← links)
- Stochastic transitivity: axioms and models (Q1735993) (← links)
- Fast approximation of betweenness centrality through sampling (Q1741154) (← links)
- Volatility forecasting via SVR-GARCH with mixture of Gaussian kernels (Q1789603) (← links)
- Networks for nonlinear diffusion problems in imaging (Q1988365) (← links)
- Stochastic variance reduced gradient methods using a trust-region-like scheme (Q1995995) (← links)
- Convergence of stochastic proximal gradient algorithm (Q2019902) (← links)
- Multi-fidelity deep neural network surrogate model for aerodynamic shape optimization (Q2020786) (← links)
- (Machine) learning parameter regions (Q2024444) (← links)
- Model selection in utility-maximizing binary prediction (Q2024476) (← links)
- Stability bounds and almost sure convergence of improved particle swarm optimization methods (Q2028697) (← links)
- A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods (Q2031928) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules (Q2034842) (← links)
- A selective overview of deep learning (Q2038303) (← links)
- Relative utility bounds for empirically optimal portfolios (Q2040434) (← links)
- Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
- Solving the Kolmogorov PDE by means of deep learning (Q2051092) (← links)
- Regularisation of neural networks by enforcing Lipschitz continuity (Q2051250) (← links)
- The VC-dimension of axis-parallel boxes on the torus (Q2052168) (← links)
- Twelve great papers: comments and replies. Response to a special issue on logical perspectives on science and cognition -- the philosophy of Gerhard Schurz (Q2054152) (← links)
- Universal Bayes consistency in metric spaces (Q2054482) (← links)
- A hybrid acceleration strategy for nonparallel support vector machine (Q2055553) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- Superquantiles at work: machine learning applications and efficient subgradient computation (Q2070410) (← links)
- Generalization error of GAN from the discriminator's perspective (Q2071033) (← links)
- Marginal singularity and the benefits of labels in covariate-shift (Q2073708) (← links)
- Machine learning for failure analysis: a mathematical modelling perspective (Q2080563) (← links)
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
- Dimension independent excess risk by stochastic gradient descent (Q2084455) (← links)
- Percolation centrality via Rademacher Complexity (Q2091801) (← links)
- Dot products in \(\mathbb{F}_q^3\) and the Vapnik-Chervonenkis dimension (Q2092325) (← links)
- Perturbed iterate SGD for Lipschitz continuous loss functions (Q2093279) (← links)
- Towards convergence rate analysis of random forests for classification (Q2093392) (← links)
- Coupled block diagonal regularization for multi-view subspace clustering (Q2097445) (← links)