← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14207 directly classified papers

Papers per year

Papers

Volume Regularization for Binary Classification NIPS 2012
Simultaneously Leveraging Output and Task Structures for Multiple-Output Regression NIPS 2012
Feature Clustering for Accelerating Parallel Coordinate Descent NIPS 2012
Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button NIPS 2012
A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation NIPS 2012
Fused sparsity and robust estimation for linear models with unknown variance NIPS 2012
Scalable nonconvex inexact proximal splitting NIPS 2012
Non-parametric Approximate Dynamic Programming via the Kernel Method NIPS 2012
Hierarchical Optimistic Region Selection driven by Curiosity NIPS 2012
A Stochastic Gradient Method with an Exponential Convergence _Rate for Finite Training Sets NIPS 2012
Sparse Prediction with the $k$-Support Norm NIPS 2012
Minimizing Uncertainty in Pipelines NIPS 2012
Efficient Spike-Coding with Multiplicative Adaptation in a Spike Response Model NIPS 2012
Forging The Graphs: A Low Rank and Positive Semidefinite Graph Learning Approach NIPS 2012
Tensor Decomposition for Fast Parsing with Latent-Variable PCFGs NIPS 2012
A Polynomial-time Form of Robust Regression NIPS 2012
Newton-Like Methods for Sparse Inverse Covariance Estimation NIPS 2012
Convergence Rate Analysis of MAP Coordinate Minimization Algorithms NIPS 2012
Approximating Concavely Parameterized Optimization Problems NIPS 2012
Stochastic Gradient Descent with Only One Projection NIPS 2012
Tractable Objectives for Robust Policy Optimization NIPS 2012
Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization NIPS 2012
Majorization for CRFs and Latent Likelihoods NIPS 2012
Minimax Multi-Task Learning and a Generalized Loss-Compositional Paradigm for MTL NIPS 2012
A quasi-Newton proximal splitting method NIPS 2012