← Optimization & Theory
Machine Learning › Optimization & Theory ›

Stochastic Methods

1077 directly classified papers

Papers per year

Papers

Feature Clustering for Accelerating Parallel Coordinate Descent NIPS 2012
Entropy Estimations Using Correlated Symmetric Stable Random Projections NIPS 2012
Spectral learning of linear dynamics from generalised-linear observations with application to neural population data NIPS 2012
Risk-Aversion in Multi-armed Bandits NIPS 2012
Confusion-Based Online Learning and a Passive-Aggressive Scheme NIPS 2012
Trajectory-Based Short-Sighted Probabilistic Planning NIPS 2012
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
Quasi-Newton Methods for Markov Chain Monte Carlo NIPS 2011
Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning NIPS 2011
Stochastic convex optimization with bandit feedback NIPS 2011
Online Learning: Stochastic, Constrained, and Smoothed Adversaries NIPS 2011
Hogwild!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent NIPS 2011
Inferring spike-timing-dependent plasticity from spike train data NIPS 2011
Monte Carlo Value Iteration with Macro-Actions NIPS 2011
Better Mini-Batch Algorithms via Accelerated Gradient Methods NIPS 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
An Empirical Evaluation of Thompson Sampling NIPS 2011
Distributed Delayed Stochastic Optimization NIPS 2011
Gaussian process modulated renewal processes NIPS 2011
Simultaneous Sampling and Multi-Structure Fitting with Adaptive Reversible Jump MCMC NIPS 2011
Finite Time Analysis of Stratified Sampling for Monte Carlo NIPS 2011