scientific article; zbMATH DE number 1263196
From MaRDI portal
Publication:4234067
Recommendations
- Exponentiated gradient versus gradient descent for linear predictors
- Analysis of two gradient-based algorithms for on-line regression
- Exponentiated gradient algorithms for conditional random fields and max-margin Markov networks
- Relative loss bounds for on-line density estimation with the exponential family of distributions
Cited in
(15)- Selection of relevant features and examples in machine learning
- Broadening the tests of learning models
- On the worst-case analysis of temporal-difference learning algorithms
- Analysis of two gradient-based algorithms for on-line regression
- Regret bounded by gradual variation for online convex optimization
- Pairwise constrained concept factorization for data representation
- Projective DNF formulae and their revision
- scientific article; zbMATH DE number 6378147 (Why is no real title available?)
- scientific article; zbMATH DE number 5957285 (Why is no real title available?)
- Exponentiated gradient algorithms for conditional random fields and max-margin Markov networks
- Exploiting Cluster-Structure to Predict the Labeling of a Graph
- Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
- Scalable estimation strategies based on stochastic approximations: classical results and new insights
- Exponentiated gradient versus gradient descent for linear predictors
- Pseudonorm approachability and applications to regret minimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234067)
