Sequential greedy approximation for certain convex optimization problems

DOI10.1109/TIT.2002.808136zbMath1063.90040MaRDI QIDQ4679946

Tong Zhang

Publication date: 31 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Non intrusive reduced order modeling of parametrized PDEs by kernel POD and neural networks, Greedy strategies for convex optimization, Robust vertex enumeration for convex hulls in high dimensions, Convex optimization on Banach spaces, Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications, Density estimation with stagewise optimization of the empirical risk, Biorthogonal greedy algorithms in convex optimization, Convergence and rate of convergence of some greedy algorithms in convex optimization, Nonlinear tensor product approximation of functions, On the convergence rate of kernel-based sequential greedy regression, A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization, Rescaled pure greedy algorithm for convex optimization, Randomized mixture models for probability density approximation and estimation, Sparse Approximation by Greedy Algorithms, Greedy training algorithms for neural networks and applications to PDEs, On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms, Analysis of error propagation in particle filters with approximation, An algorithmic separating hyperplane theorem and its applications, Greedy expansions in convex optimization, Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data, A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training, Schwarz iterative methods: infinite space splittings, Large-Margin Classification in Infinite Neural Networks, Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods, Boosting as a kernel-based method, A characterization theorem and an algorithm for a convex hull problem, Greedy approximation in convex optimization, Boosting with early stopping: convergence and consistency