← Optimization
Mathematics & Optimization › Optimization ›

Optimization

1203 directly classified papers

Papers per year

Papers

A Unifying Perspective of Parametric Policy Search Methods for Markov Decision Processes NIPS 2012
Reconstruction from Anisotropic Random Measurements COLT 2012
Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences COLT 2012
A quasi-Newton proximal splitting method NIPS 2012
Data dependent kernels in nearly-linear time AISTATS 2012
Minimization of Continuous Bethe Approximations: A Positive Variation NIPS 2012
Feature Clustering for Accelerating Parallel Coordinate Descent NIPS 2012
A Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods AISTATS 2011
Structure Learning for Optimization NIPS 2011
A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data COLT 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011
A Simpler Approach to Matrix Completion JMLR 2011
A Convergence Analysis of Log-Linear Training NIPS 2011
Efficient Offline Communication Policies for Factored Multiagent POMDPs NIPS 2011
On the Universality of Online Mirror Descent NIPS 2011
Signal Estimation Under Random Time-Warpings and Nonlinear Signal Alignment NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Predicting Dynamic Difficulty NIPS 2011
Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011
Load Balancing for Mobility-on-Demand Systems RSS 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
Quasi-Newton Methods for Markov Chain Monte Carlo NIPS 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011
Optimal Web-Scale Tiering as a Flow Problem NIPS 2010