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

Stochastic Processes

2,667 papers

Papers per year

2
30
60
244
157
'05
'10
'15
'20
'25

Papers

Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo NIPS 2018
Efficient inference for time-varying behavior during learning NIPS 2018
Bandit Learning with Implicit Feedback NIPS 2018
Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimation NIPS 2018
Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo NIPS 2018
A Reduction for Efficient LDA Topic Reconstruction NIPS 2018
Video Prediction via Selective Sampling NIPS 2018
Learning latent variable structured prediction models with Gaussian perturbations NIPS 2018
Online Structured Laplace Approximations for Overcoming Catastrophic Forgetting NIPS 2018
Towards Understanding Acceleration Tradeoff between Momentum and Asynchrony in Nonconvex Stochastic Optimization NIPS 2018
Reliability and Learnability of Human Bandit Feedback for Sequence-to-Sequence Reinforcement Learning ACL 2018
Batch IS NOT Heavy: Learning Word Representations From All Samples ACL 2018
Stock Movement Prediction from Tweets and Historical Prices ACL 2018
Reinforced Extractive Summarization with Question-Focused Rewards ACL 2018
Structured Gaussian Processes with Twin Multiple Kernel Learning ACML 2018
Hypernetwork-based Implicit Posterior Estimation and Model Averaging of CNN ACML 2018
On Truly Block Eigensolvers via Riemannian Optimization AISTATS 2018
Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond AISTATS 2018
Finding Global Optima in Nonconvex Stochastic Semidefinite Optimization with Variance Reduction AISTATS 2018
Stochastic Multi-armed Bandits in Constant Space AISTATS 2018
Benefits from Superposed Hawkes Processes AISTATS 2018
Natural Gradients in Practice: Non-Conjugate Variational Inference in Gaussian Process Models AISTATS 2018
Tracking the gradients using the Hessian: A new look at variance reducing stochastic methods AISTATS 2018
Slow and Stale Gradients Can Win the Race: Error-Runtime Trade-offs in Distributed SGD AISTATS 2018
Delayed Sampling and Automatic Rao-Blackwellization of Probabilistic Programs AISTATS 2018