Understanding machine learning. From theory to algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Testing conditional independence in supervised learning algorithms
- BEST: a decision tree algorithm that handles missing values
- High-dimensional penalty selection via minimum description length principle
- Crowdsourcing with unsure option
- Optimal distributed stochastic mirror descent for strongly convex optimization
- A quantum-implementable neural network model
- Hierarchical design of fast minimum disagreement algorithms
- Generalization bounds for learning weighted automata
- Stochastic transitivity: axioms and models
- Fast approximation of betweenness centrality through sampling
- Volatility forecasting via SVR-GARCH with mixture of Gaussian kernels
- Networks for nonlinear diffusion problems in imaging
- Stochastic variance reduced gradient methods using a trust-region-like scheme
- Convergence of stochastic proximal gradient algorithm
- Multi-fidelity deep neural network surrogate model for aerodynamic shape optimization
- (Machine) learning parameter regions
- Model selection in utility-maximizing binary prediction
- Stability bounds and almost sure convergence of improved particle swarm optimization methods
- A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods
- Bounds for the tracking error of first-order online optimization methods
- Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules
- A selective overview of deep learning
- Relative utility bounds for empirically optimal portfolios
- Fastest rates for stochastic mirror descent methods
- Solving the Kolmogorov PDE by means of deep learning
- Regularisation of neural networks by enforcing Lipschitz continuity
- The VC-dimension of axis-parallel boxes on the torus
- Twelve great papers: comments and replies. Response to a special issue on logical perspectives on science and cognition -- the philosophy of Gerhard Schurz
- Universal Bayes consistency in metric spaces
- A hybrid acceleration strategy for nonparallel support vector machine
- An exact cutting plane method for k-submodular function maximization
- Superquantiles at work: machine learning applications and efficient subgradient computation
- Generalization error of GAN from the discriminator's perspective
- Marginal singularity and the benefits of labels in covariate-shift
- Machine learning for failure analysis: a mathematical modelling perspective
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization
- Dimension independent excess risk by stochastic gradient descent
- Percolation centrality via Rademacher Complexity
- Dot products in \(\mathbb{F}_q^3\) and the Vapnik-Chervonenkis dimension
- Perturbed iterate SGD for Lipschitz continuous loss functions
- Towards convergence rate analysis of random forests for classification
- Coupled block diagonal regularization for multi-view subspace clustering
- Regret-minimizing Bayesian persuasion
- Quantum learning of concentrated Boolean functions
- On the robustness of randomized classifiers to adversarial examples
- Efficient fair principal component analysis
- Computation of invariant sets via immersion for discrete-time nonlinear systems
- On the expressive power of message-passing neural networks as global feature map transformers
- Stable recovery of entangled weights: towards robust identification of deep neural networks from minimal samples
- A measure theoretical approach to the mean-field maximum principle for training NeurODEs
- Compressive sensing and neural networks from a statistical learning perspective
- On the perceptron's compression
- Suboptimality of constrained least squares and improvements via non-linear predictors
- From inexact optimization to learning via gradient concentration
- PAC-learning gains of Turing machines over circuits and neural networks
- Depth separations in neural networks: what is actually being separated?
- The Barron space and the flow-induced function spaces for neural network models
- Robust and resource-efficient identification of two hidden layer neural networks
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- Understanding generalization error of SGD in nonconvex optimization
- Physically interpretable machine learning algorithm on multidimensional non-linear fields
- Prediction of magnetization dynamics in a reduced dimensional feature space setting utilizing a low-rank kernel method
- Deep microlocal reconstruction for limited-angle tomography
- Neural network training using \(\ell_1\)-regularization and bi-fidelity data
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
- Solving multiscale steady radiative transfer equation using neural networks with uniform stability
- A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
- Efficient parameter estimation of truncated Boolean product distributions
- Joint feature selection and classification for positive unlabelled multi-label data using weighted penalized empirical risk minimization
- Frameworks and results in distributionally robust optimization
- Training thinner and deeper neural networks: jumpstart regularization
- Joint ranking SVM and binary relevance with robust low-rank learning for multi-label classification
- The minimax learning rates of normal and Ising undirected graphical models
- Convergence analysis of Tikhonov regularization for non-linear statistical inverse problems
- Normal approximations for discrete-time occupancy processes
- A comparative analysis of optimization and generalization properties of two-layer neural network and random feature models under gradient descent dynamics
- Optimal probability aggregation based on generalized Brier scoring
- Newton-type methods for non-convex optimization under inexact Hessian information
- Absolutely no free lunches!
- Properties of the sign gradient descent algorithms
- Computational complexity of learning algebraic varieties
- On weak \(\epsilon\)-nets and the Radon number
- Kolmogorov width decay and poor approximators in machine learning: shallow neural networks, random feature models and neural tangent kernels
- Fast approximate simulation of finite long-range spin systems
- A statistician teaches deep learning
- A generalized minimal residual based iterative back propagation algorithm for polynomial nonlinear models
- Accelerated gradient sliding for minimizing a sum of functions
- Domain adaptation -- can quantity compensate for quality?
- Control-based algorithms for high dimensional online learning
- Solving equations of random convex functions via anchored regression
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model
- Numerical study of reciprocal recommendation with domain matching
- Fast rates by transferring from auxiliary hypotheses
- Empirical risk minimization: probabilistic complexity and stepsize strategy
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints
- Regularizing conjunctive features for classification
- Real estate price estimation in French cities using geocoding and machine learning
- Big data driven order-up-to level model: application of machine learning
- Nearest neighbor representations of Boolean functions
This page was built for publication: Understanding machine learning. From theory to algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494386)
