Statistical computational learning

DOI10.1007/978-3-030-06164-7_11zbMATH Open1547.6865MaRDI QIDQ6602226FDOQ6602226

Authors: Antoine Cornuéjols, Frédéric Koriche, Richard Nock 

Publication date: 11 September 2024

Recommendations

• Statistical learning theory: models, concepts, and results
• Advanced Lectures on Machine Learning
• Statistical machine learning. A unified framework
• Statistical learning theory in practice
• scientific article; zbMATH DE number 53984

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Artificial neural networks and deep learning (68T07)

Cites Work

• A decision-theoretic generalization of on-line learning and an application to boosting
• An introduction to statistical learning. With applications in R
• Graphical models, exponential families, and variational inference
• Title not available (Why is that?)
• Random forests
• Bagging predictors
• NON-NULL RANKING MODELS. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introductory lectures on convex optimization. A basic course.
• Support Vector Machines
• Approximating discrete probability distributions with dependence trees
• A Stochastic Approximation Method
• 10.1162/153244302760200704
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• On the density of families of sets
• Title not available (Why is that?)
• A coordinate gradient descent method for nonsmooth separable minimization
• Improved boosting algorithms using confidence-rated predictions
• Modeling and Reasoning with Bayesian Networks
• Integer linear programming for the Bayesian network structure learning problem
• A universal prior for integers and estimation by minimum description length
• Optimization with sparsity-inducing penalties
• Algebraic Geometry and Statistical Learning Theory
• Learnability and the Vapnik-Chervonenkis dimension
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Learning the kernel matrix with semidefinite programming
• Title not available (Why is that?)
• Sparse Approximate Solutions to Linear Systems
• Title not available (Why is that?)
• Greedy sparsity-constrained optimization
• Ranking Tournaments
• On the complexity of polyhedral separability
• Maximum likelihood bounded tree-width Markov networks
• Coordinate descent algorithms
• Discrete mathematics of neural networks. Selected topics
• Trading accuracy for sparsity in optimization problems with sparsity constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of the learnable
• Title not available (Why is that?)
• 10.1162/1532443041827916
• Neural Network Learning
• Toward efficient agnostic learning
• Label ranking by learning pairwise preferences
• Learning in the Presence of Malicious Errors
• Computational limitations on learning from examples
• Learning Boolean formulas
• Asymptotics in empirical risk minimization
• Preference Learning
• On the complexity analysis of randomized block-coordinate descent methods
• New analysis and results for the Frank-Wolfe method
• The EM algorithm for graphical association models with missing data
• The densest hemisphere problem
• The hardness of approximate optima in lattices, codes, and systems of linear equations
• Convex optimization: algorithms and complexity
• Probability for statistics and machine learning. Fundamentals and advanced topics.
• Regularization techniques for learning with matrices
• Machine learning. The art and science of algorithms that make sense of data.
• The Elements of Statistical Learning
• On the difficulty of approximately maximizing agreements.
• Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
• Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
• Learnability, stability and uniform convergence
• On agnostic learning of parities, monomials, and halfspaces
• Learning intersections and thresholds of halfspaces
• Exponentiated gradient versus gradient descent for linear predictors
• The robustness of the \(p\)-norm algorithms
• Ranking the best instances
• Scale-sensitive dimensions, uniform convergence, and learnability
• The complexity of properly learning simple concept classes
• 10.1162/153244303322533188
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Convex optimization algorithms
• A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
• Cryptographic hardness for learning intersections of halfspaces
• Learning Integer Lattices
• Breaking the curse of dimensionality with convex neural networks
• Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
• Label ranking algorithms: a survey
• A Survey and Empirical Comparison of Object Ranking Methods
• Decision forests: a unified framework for classification, regression, density estimation, manifold learning and semi-supervised learning
• Using the Perceptron Algorithm to Find Consistent Hypotheses
• On structured output training: hard cases and an efficient alternative
• Probabilistic learning and Boolean functions
• An elementary introduction to statistical learning theory
• Computing machinery and intelligence

This page was built for publication: Statistical computational learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602226)