Statistical computational learning (Q6602226)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Statistical computational learning

scientific article; zbMATH DE number 7910846

Language	Label	Description	Also known as
default for all languages	No label defined
English	Statistical computational learning	scientific article; zbMATH DE number 7910846

Statements

instance of

scholarly article

0 references

title

Statistical computational learning (English)

0 references

0 references

0 references

0 references

11 September 2024

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

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

Probabilistic learning and Boolean functions

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

Convex optimization algorithms

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

Random forests

0 references

Convex optimization: algorithms and complexity

0 references

Approximating discrete probability distributions with dependence trees

0 references

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

0 references

Ranking the best instances

0 references

Q4243442

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. Fundamentals and advanced topics.

0 references

Q4139463

0 references

On agnostic learning of parities, monomials, and halfspaces

0 references

Machine learning. The art and science of algorithms that make sense of data.

0 references

Q3806565

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

Q3510469

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. With applications in R

0 references

The densest hemisphere problem

0 references

Regularization techniques for learning with matrices

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

Learning the kernel matrix with semidefinite programming

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

Q4398828

0 references

Asymptotics in empirical risk minimization

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

Q3967358

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

Q3148817

0 references

Learnability, stability and uniform convergence

0 references

Trading accuracy for sparsity in optimization problems with sparsity constraints

0 references

Q5396661

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

Q4770512

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

1547.6865

0 references

DOI

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

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Statistical computational learning