Showing 1–20 of 62 results
/ Date/ Name
Feb 13, 2020Fast Convergence for Langevin Diffusion with Manifold StructureJul 9, 2021The Effects of Invertibility on the Representational Complexity of Encoders in Variational AutoencodersMay 29, 2018Representational Power of ReLU Networks and Polynomial Kernels: Beyond Worst-Case AnalysisNov 7, 2017Theoretical limitations of Encoder-Decoder GAN architecturesMar 23, 2015On some provably correct cases of variational inference for topic modelsJun 3, 2023Provable benefits of score matchingJun 15, 2023Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing DiffusionsSep 30, 2020Efficient sampling from the Bingham distributionMar 7, 2015Label optimal regret bounds for online local learningJun 27, 2018Approximability of Discriminators Implies Diversity in GANsOct 2, 2020Representational aspects of depth and conditioning in normalizing flowsJun 14, 2017Provable benefits of representation learningJul 12, 2016Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methodsJul 11, 2016How to calculate partition functions using convex programming hierarchies: provable bounds for variational methodsDec 28, 2016Provable learning of Noisy-or NetworksOct 3, 2022Statistical Efficiency of Score Matching: The View from IsoperimetryJun 1, 2023Understanding Augmentation-based Self-Supervised Representation Learning via RKHS Approximation and RegressionNov 29, 2018Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain DecompositionOct 12, 2020The Risks of Invariant Risk MinimizationFeb 25, 2021An Online Learning Approach to Interpolation and Extrapolation in Domain Generalization