Statistical computational learning (Q6602226)

From MaRDI portal

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Statistical computational learning

scientific article; zbMATH DE number 7910846

Language	Label	Description	Also known as
English	Statistical computational learning	scientific article; zbMATH DE number 7910846

Statements

scholarly article

0 references

Statistical computational learning (English)

0 references

Antoine Cornuéjols

0 references

Frédéric Koriche

0 references

0 references

publication date

11 September 2024

0 references

MaRDI profile type

0 references

The complexity of properly learning simple concept classes

0 references

Ranking Tournaments

0 references

Scale-sensitive dimensions, uniform convergence, and learnability

0 references

Discrete mathematics of neural networks. Selected topics

0 references

0 references

Neural Network Learning

0 references

Using the Perceptron Algorithm to Find Consistent Hypotheses

0 references

The hardness of approximate optima in lattices, codes, and systems of linear equations

0 references

Breaking the Curse of Dimensionality with Convex Neural Networks

0 references

Optimization with Sparsity-Inducing Penalties

0 references

Greedy Sparsity-Constrained Optimization

0 references

Integer linear programming for the Bayesian network structure learning problem

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

On the difficulty of approximately maximizing agreements.

0 references

0 references

Rank-\(r\) decision trees are a subclass of \(r\)-decision lists

0 references

Learnability and the Vapnik-Chervonenkis dimension

0 references

10.1162/153244302760200704

0 references

Bagging predictors

0 references

0 references

0 references

Approximating discrete probability distributions with dependence trees

0 references

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

0 references

0 references

0 references

10.1162/153244303322533188

0 references

Decision Forests: A Unified Framework for Classification, Regression, Density Estimation, Manifold Learning and Semi-Supervised Learning

0 references

Modeling and Reasoning with Bayesian Networks

0 references

Probability for Statistics and Machine Learning

0 references

0 references

On Agnostic Learning of Parities, Monomials, and Halfspaces

0 references

Agnostic Learning of Monomials by Halfspaces Is Hard

0 references

Machine Learning

0 references

0 references

New analysis and results for the Frank-Wolfe method

0 references

10.1162/1532443041827916

0 references

A decision-theoretic generalization of on-line learning and an application to boosting

0 references

Preference Learning

0 references

A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization

0 references

On structured output training: hard cases and an efficient alternative

0 references

The robustness of the \(p\)-norm algorithms

0 references

0 references

The Elements of Statistical Learning

0 references

Quantifying inductive bias: AI learning algorithms and Valiant's learning framework

0 references

Decision theoretic generalizations of the PAC model for neural net and other learning applications

0 references

Learning Integer Lattices

0 references

Label ranking by learning pairwise preferences

0 references

An Introduction to Statistical Learning

0 references

The densest hemisphere problem

0 references

0 references

A Survey and Empirical Comparison of Object Ranking Methods

0 references

Learning in the Presence of Malicious Errors

0 references

Learning Boolean formulas

0 references

Toward efficient agnostic learning

0 references

Exponentiated gradient versus gradient descent for linear predictors

0 references

Learning intersections and thresholds of halfspaces

0 references

Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)

0 references

Cryptographic hardness for learning intersections of halfspaces

0 references

An Elementary Introduction to Statistical Learning Theory

0 references

0 references

The EM algorithm for graphical association models with missing data

0 references

On the complexity analysis of randomized block-coordinate descent methods

0 references

NON-NULL RANKING MODELS. I

0 references

On the complexity of polyhedral separability

0 references

0 references

0 references

Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization

0 references

Sparse Approximate Solutions to Linear Systems

0 references

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

0 references

Computational limitations on learning from examples

0 references

A universal prior for integers and estimation by minimum description length

0 references

A Stochastic Approximation Method

0 references

On the density of families of sets

0 references

Improved boosting algorithms using confidence-rated predictions

0 references

0 references

0 references

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

0 references

0 references

Maximum likelihood bounded tree-width Markov networks

0 references

Support Vector Machines

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Computing machinery and intelligence

0 references

A theory of the learnable

0 references

0 references

Label Ranking Algorithms: A Survey

0 references

Graphical Models, Exponential Families, and Variational Inference

0 references

Algebraic Geometry and Statistical Learning Theory

0 references

Coordinate descent algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-06164-7_11

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6602226

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6602226&oldid=40585607"