Skip to content
conftrace_

Stochastic Processes

2,948 papers

2
30
60
258
253
'5
'10
'15
'20
'25

Papers

Multi-armed Bandits: Competing with Optimal Sequences NeurIPS 2016 Multiple-Play Bandits in the Position-Based Model NeurIPS 2016 Near-Optimal Smoothing of Structured Conditional Probability Matrices NeurIPS 2016 Nonparametric Network Models for Link Prediction JMLR 2016 No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016 On collapsed representation of hierarchical Completely Random Measures ICML 2016 On Graduated Optimization for Stochastic Non-Convex Problems ICML 2016 Online Isotonic Regression COLT 2016 On Mixtures of Markov Chains NeurIPS 2016 Parallel Markov Chain Monte Carlo via Spectral Clustering AISTATS 2016 Partition Functions from Rao-Blackwellized Tempered Sampling ICML 2016 Patches, Planes and Probabilities: A Non-Local Prior for Volumetric 3D Reconstruction CVPR 2016 Principled Parallel Mean-Field Inference for Discrete Random Fields CVPR 2016 Recursive Decentralized Collaborative Localization for Sparsely Communicating Robots RSS 2016 Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits COLT 2016 RNN-BLSTM Based Multi-Pitch Estimation Interspeech 2016 Robust Monte Carlo Sampling using Riemannian Nosé-Poincaré Hamiltonian Dynamics ICML 2016 Safe Control under Uncertainty with Probabilistic Signal Temporal Logic RSS 2016 Scalable Discrete Sampling as a Multi-Armed Bandit Problem ICML 2016 Scalable MCMC for Mixed Membership Stochastic Blockmodels AISTATS 2016 Scaling Factorial Hidden Markov Models: Stochastic Variational Inference without Messages NeurIPS 2016 Scan Order in Gibbs Sampling: Models in Which it Matters and Bounds on How Much NeurIPS 2016 SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization ICML 2016 Slice Sampling on Hamiltonian Trajectories ICML 2016 Softened Approximate Policy Iteration for Markov Games ICML 2016