Skip to content
conftrace_

Papers (including subtopics)

Provable Learning-based Algorithm For Sparse Recovery ICLR 2022 Provable Lifelong Learning of Representations AISTATS 2022 Provable Stochastic Optimization for Global Contrastive Learning: Small Batch Does Not Harm Performance ICML 2022 Provable Tensor-Train Format Tensor Completion by Riemannian Optimization JMLR 2022 Provably Adversarially Robust Nearest Prototype Classifiers ICML 2022 Provably Confidential Language Modelling NAACL 2022 Provably convergent quasistatic dynamics for mean-field two-player zero-sum games ICLR 2022 Provably Efficient Model-Free Constrained RL with Linear Function Approximation NeurIPS 2022 Provably Efficient Offline Reinforcement Learning for Partially Observable Markov Decision Processes ICML 2022 Provably Efficient Reinforcement Learning in Partially Observable Dynamical Systems NeurIPS 2022 Provably Robust Adversarial Examples ICLR 2022 Provably tuning the ElasticNet across instances NeurIPS 2022 Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks ICLR 2022 Proxima: An Approach for Time or Accuracy Budgeted Collision Proximity Queries RSS 2022 Proximal and Federated Random Reshuffling ICML 2022 Proximal Denoiser for Convergent Plug-and-Play Optimization with Nonconvex Regularization ICML 2022 Proximal Exploration for Model-guided Protein Sequence Design ICML 2022 Proximal Optimal Transport Modeling of Population Dynamics AISTATS 2022 Proximal Point Imitation Learning NeurIPS 2022 ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally! ICML 2022 Pruned RNN-T for fast, memory-efficient ASR training Interspeech 2022 Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions NeurIPS 2022 Pruning’s Effect on Generalization Through the Lens of Training and Regularization NeurIPS 2022 Pseudo Numerical Methods for Diffusion Models on Manifolds ICLR 2022 P-Tuning: Prompt Tuning Can Be Comparable to Fine-tuning Across Scales and Tasks ACL 2022