Explore >> Select a destination

You are here

 fa.bianp.net
On the Link Between Polynomials and Optimization, Part 1
| | www.ethanepperly.com
Vandermonde Matrices are Merely Exponentially Ill-Conditioned - Ethan N. Epperly
4.0 parsecs away

Travel
| |
| | francisbach.com
Sums-of-squares for dummies: a view from the Fourier domain - Machine Learning Research Blog
2.3 parsecs away

Travel
| |
| | jeremykun.wordpress.com
Duality for the SVM - Math ? Programming
4.1 parsecs away

Travel
| | This post is a sequel toFormulating the Support Vector Machine Optimization Problem. The Karush-Kuhn-Tucker theorem Generic optimization problems are hard to solve efficiently. However, optimization problems whose objective and constraints have special structureoften succumb to analytic simplifications. For example, if you want to optimize a linear function subject to linear equality constraints, one can compute...
| | extremal010101.wordpress.com
Learning low degree functions in log(n) queries. - Zeros and Ones
49.6 parsecs away

Travel
| With Alexandros Eskenazis we posted a paper on arxiv "Learning low-degree functions from a logarithmic number of random queries" exponentially improving randomized query complexity for low degree functions. Perhaps a very basic question one asks in learning theory is as follows: there is an unknown function $latex f : \{-1,1\}^{n} \to \mathbb{R}$, and we are...