← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14207 directly classified papers

Papers per year

Papers

Anytime Induction of Cost-sensitive Trees NIPS 2007
Random Sampling of States in Dynamic Programming NIPS 2007
Computing Robust Counter-Strategies NIPS 2007
Incremental Natural Actor-Critic Algorithms NIPS 2007
Temporal Difference Updating without a Learning Rate NIPS 2007
New Outer Bounds on the Marginal Polytope NIPS 2007
Bundle Methods for Machine Learning NIPS 2007
Convex Learning with Invariances NIPS 2007
Stable Dual Dynamic Programming NIPS 2007
Compressed Regression NIPS 2007
Random Features for Large-Scale Kernel Machines NIPS 2007
An Analysis of Convex Relaxations for MAP Estimation NIPS 2007
Efficient Convex Relaxation for Transductive Support Vector Machine NIPS 2007
What makes some POMDP problems easy to approximate? NIPS 2007
Selecting Observations against Adversarial Objectives NIPS 2007
Hierarchical Penalization NIPS 2007
Linear programming analysis of loopy belief propagation for weighted matching NIPS 2007
A Spectral Regularization Framework for Multi-Task Structure Learning NIPS 2007
Simplified Rules and Theoretical Analysis for Information Bottleneck Optimization and PCA with Spiking Neurons NIPS 2007
Convex Relaxations of Latent Variable Training NIPS 2007
Better than least squares: comparison of objective functions for estimating linear-nonlinear models NIPS 2007
Adaptive Online Gradient Descent NIPS 2007
Convex Clustering with Exemplar-Based Models NIPS 2007
Ensemble Clustering using Semidefinite Programming NIPS 2007
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis NIPS 2007