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