conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14,969 papers

Papers per year

18
112
342
1289
1646
'05
'10
'15
'20
'25

Papers

Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization NIPS 2010
Convex Multiple-Instance Learning by Estimating Likelihood Ratio NIPS 2010
Reward Design via Online Gradient Ascent NIPS 2010
Distributionally Robust Markov Decision Processes NIPS 2010
MAP Estimation for Graphical Models by Likelihood Maximization NIPS 2010
Sparse Inverse Covariance Selection via Alternating Linearization Methods NIPS 2010
Online Learning in The Manifold of Low-Rank Matrices NIPS 2010
Natural Policy Gradient Methods with Parameter-based Exploration for Control Tasks NIPS 2010
Structured sparsity-inducing norms through submodular functions NIPS 2010
Network Flow Algorithms for Structured Sparsity NIPS 2010
Error Propagation for Approximate Policy and Value Iteration NIPS 2010
Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm NIPS 2010
Worst-case bounds on the quality of max-product fixed-points NIPS 2010
Policy gradients in linearly-solvable MDPs NIPS 2010
Fast Large-scale Mixture Modeling with Component-specific Data Partitions NIPS 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
Implicit Differentiation by Perturbation NIPS 2010
Smoothness, Low Noise and Fast Rates NIPS 2010
Energy Disaggregation via Discriminative Sparse Coding NIPS 2010
Random Conic Pursuit for Semidefinite Programming NIPS 2010
Fast global convergence rates of gradient methods for high-dimensional statistical recovery NIPS 2010
Global Analytic Solution for Variational Bayesian Matrix Factorization NIPS 2010
Linear Complementarity for Regularized Policy Evaluation and Improvement NIPS 2010
Penalized Principal Component Regression on Graphs for Analysis of Subnetworks NIPS 2010
A Family of Penalty Functions for Structured Sparsity NIPS 2010