Probability

Dimension-Free Error Bounds from Random Projections AAAI 2019 DPPy: DPP Sampling with Python JMLR 2019 Early-Stopping of Scattering Pattern Observation with Bayesian Modeling AAAI 2019 Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines AAAI 2019 Elliptical Perturbations for Differential Privacy NeurIPS 2019 Estimating Convergence of Markov chains with L-Lag Couplings NeurIPS 2019 Estimating the Mixing Time of Ergodic Markov Chains COLT 2019 Hamiltonian Monte Carlo with Energy Conserving Subsampling JMLR 2019 Importance Sampling Policy Evaluation with an Estimated Behavior Policy ICML 2019 Learning low-dimensional state embeddings and metastable clusters from time series data NeurIPS 2019 Learning Multiple Markov Chains via Adaptive Allocation NeurIPS 2019 Log-concave sampling: Metropolis-Hastings algorithms are fast JMLR 2019 Maximum a posteriori Speech Enhancement Based on Double Spectrum Interspeech 2019 McDiarmid-Type Inequalities for Graph-Dependent Variables and Stability Bounds NeurIPS 2019 Meta-Weighted Gaussian Process Experts for Personalized Forecasting of AD Cognitive Changes MLHC 2019 Modelling Stopping Criteria for Search Results using Poisson Processes EMNLP 2019 MRI k-Space Motion Artefact Augmentation: Model Robustness and Task-Specific Uncertainty MIDL 2019 Neural Jump Stochastic Differential Equations NeurIPS 2019 Nonconvex sampling with the Metropolis-adjusted Langevin algorithm COLT 2019 Nonparametric Estimation of Probability Density Functions of Random Persistence Diagrams JMLR 2019 Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NeurIPS 2019 On the Hardness of Probabilistic Inference Relaxations AAAI 2019 On two ways to use determinantal point processes for Monte Carlo integration NeurIPS 2019 Optimal Transport: Fast Probabilistic Approximation with Exact Solvers JMLR 2019 Real-Time Robotic Search using Structural Spatial Point Processes UAI 2019