conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Optimization

1,207 papers

Papers per year

1
5
36
106
88
'05
'10
'15
'20
'25

Papers

Tractable Objectives for Robust Policy Optimization NIPS 2012
Robustness and risk-sensitivity in Markov decision processes NIPS 2012
A quasi-Newton proximal splitting method NIPS 2012
Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods NIPS 2012
Query Complexity of Derivative-Free Optimization NIPS 2012
Matrix reconstruction with the local max norm NIPS 2012
Data dependent kernels in nearly-linear time AISTATS 2012
Complexity of Bethe Approximation AISTATS 2012
Reconstruction from Anisotropic Random Measurements COLT 2012
Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences COLT 2012
Fast Approximation of Matrix Coherence and Statistical Leverage JMLR 2012
Structure Learning for Optimization NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Signal Estimation Under Random Time-Warpings and Nonlinear Signal Alignment NIPS 2011
Predicting Dynamic Difficulty NIPS 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011
On the Universality of Online Mirror Descent NIPS 2011
Efficient Offline Communication Policies for Factored Multiagent POMDPs NIPS 2011
Quasi-Newton Methods for Markov Chain Monte Carlo NIPS 2011
A Convergence Analysis of Log-Linear Training NIPS 2011
Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011
A Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods AISTATS 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 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