← Optimization
Mathematics & Optimization › Optimization ›

Stochastic Methods

2788 directly classified papers

Papers per year

Papers

Training sparse natural image models with a fast Gibbs sampler of an extended state space NIPS 2012
Stochastic Gradient Descent with Only One Projection NIPS 2012
Continuous Relaxations for Discrete Hamiltonian Monte Carlo NIPS 2012
Risk Aversion in Markov Decision Processes via Near Optimal Chernoff Bounds NIPS 2012
Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods NIPS 2012
Query Complexity of Derivative-Free Optimization NIPS 2012
Online allocation and homogeneous partitioning for piecewise constant mean-approximation NIPS 2012
Non-parametric Approximate Dynamic Programming via the Kernel Method NIPS 2012
Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence NIPS 2012
A Family of MCMC Methods on Implicitly Defined Manifolds AISTATS 2012
Iterative ranking from pair-wise comparisons NIPS 2012
Near-optimal Differentially Private Principal Components NIPS 2012
Multi Kernel Learning with Online-Batch Optimization JMLR 2012
DEAP: Evolutionary Algorithms Made Easy JMLR 2012
A Nonparametric Conjugate Prior Distribution for the Maximizing Argument of a Noisy Function NIPS 2012
A Stochastic Gradient Method with an Exponential Convergence _Rate for Finite Training Sets NIPS 2012
Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs AISTATS 2012
Trajectory-Based Short-Sighted Probabilistic Planning NIPS 2012
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit AISTATS 2012
Error bounds for Kernel Fisher Linear Discriminant in Gaussian Hilbert space AISTATS 2012
Lightning-speed Structure Learning of Nonlinear Continuous Networks AISTATS 2012
Scalable Inference on Kingman’s Coalescent using Pair Similarity AISTATS 2012
On Bayesian Upper Confidence Bounds for Bandit Problems AISTATS 2012
Efficient Sampling from Combinatorial Space via Bridging AISTATS 2012