Probability

Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics ICML 2021 High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm JMLR 2021 Hoeffding's Inequality for General Markov Chains and Its Applications to Statistical Learning JMLR 2021 Implicit Langevin Algorithms for Sampling From Log-concave Densities JMLR 2021 Inferring serial correlation with dynamic backgrounds ICML 2021 Information-Theoretic Generalization Bounds for Stochastic Gradient Descent COLT 2021 Kernel Stein Discrepancy Descent ICML 2021 Kernel Thinning COLT 2021 Learning in Matrix Games can be Arbitrarily Complex COLT 2021 Learning Stochastic Behaviour from Aggregate Data ICML 2021 Loop Estimator for Discounted Values in Markov Reward Processes AAAI 2021 Multi-stream based marked point process ACML 2021 Nonparametric Modeling of Higher-Order Interactions via Hypergraphons JMLR 2021 Optimal prediction of Markov chains with and without spectral gap NeurIPS 2021 Optimal Underdamped Langevin MCMC Method NeurIPS 2021 Parallel tempering on optimized paths ICML 2021 Pareto GAN: Extending the Representational Power of GANs to Heavy-Tailed Distributions ICML 2021 Probabilistic Iterative Methods for Linear Systems JMLR 2021 Rao-Blackwellised parallel MCMC AISTATS 2021 Reinforcement Learning in Parametric MDPs with Exponential Families AISTATS 2021 Relaxed Clustered Hawkes Process for Student Procrastination Modeling in MOOCs AAAI 2021 Scaling up Continuous-Time Markov Chains Helps Resolve Underspecification NeurIPS 2021 Separation Results between Fixed-Kernel and Feature-Learning Probability Metrics NeurIPS 2021 Stability and Identification of Random Asynchronous Linear Time-Invariant Systems L4DC 2021 Stable Online Control of Linear Time-Varying Systems L4DC 2021