← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14207 directly classified papers

Papers per year

Papers

Clusters and Coarse Partitions in LP Relaxations NIPS 2008
An interior-point stochastic approximation method and an L1-regularized delta rule NIPS 2008
Online Metric Learning and Fast Similarity Search NIPS 2008
Bayesian Network Score Approximation using a Metagraph Kernel NIPS 2008
Fast Rates for Regularized Objectives NIPS 2008
Regularized Policy Iteration NIPS 2008
Dimensionality Reduction for Data in Multiple Feature Representations NIPS 2008
Mind the Duality Gap: Logarithmic regret algorithms for online optimization NIPS 2008
An Online Algorithm for Maximizing Submodular Functions NIPS 2008
MAS: a multiplicative approximation scheme for probabilistic inference NIPS 2008
Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method NIPS 2008
An Homotopy Algorithm for the Lasso with Online Observations NIPS 2008
QUIC-SVD: Fast SVD Using Cosine Trees NIPS 2008
Supervised Exponential Family Principal Component Analysis via Convex Optimization NIPS 2008
Multi-stage Convex Relaxation for Learning with Sparse Regularization NIPS 2008
Estimating vector fields using sparse basis field expansions NIPS 2008
MDPs with Non-Deterministic Policies NIPS 2008
Biasing Approximate Dynamic Programming with a Lower Discount Factor NIPS 2008
On the Efficient Minimization of Classification Calibrated Surrogates NIPS 2008
From Online to Batch Learning with Cutoff-Averaging NIPS 2008
Designing neurophysiology experiments to optimally constrain receptive field models along parametric submanifolds NIPS 2008
An Extended Level Method for Efficient Multiple Kernel Learning NIPS 2008
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms NIPS 2008
Learning with Consistency between Inductive Functions and Kernels NIPS 2008
Sparse Online Learning via Truncated Gradient NIPS 2008